Commit | Line | Data |
---|---|---|
e4b17023 JM |
1 | /* Expand builtin functions. |
2 | Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, | |
3 | 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, | |
4 | 2012 Free Software Foundation, Inc. | |
5 | ||
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify it under | |
9 | the terms of the GNU General Public License as published by the Free | |
10 | Software Foundation; either version 3, or (at your option) any later | |
11 | version. | |
12 | ||
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
19 | along with GCC; see the file COPYING3. If not see | |
20 | <http://www.gnu.org/licenses/>. */ | |
21 | ||
22 | #include "config.h" | |
23 | #include "system.h" | |
24 | #include "coretypes.h" | |
25 | #include "tm.h" | |
26 | #include "machmode.h" | |
27 | #include "rtl.h" | |
28 | #include "tree.h" | |
29 | #include "realmpfr.h" | |
30 | #include "gimple.h" | |
31 | #include "flags.h" | |
32 | #include "regs.h" | |
33 | #include "hard-reg-set.h" | |
34 | #include "except.h" | |
35 | #include "function.h" | |
36 | #include "insn-config.h" | |
37 | #include "expr.h" | |
38 | #include "optabs.h" | |
39 | #include "libfuncs.h" | |
40 | #include "recog.h" | |
41 | #include "output.h" | |
42 | #include "typeclass.h" | |
43 | #include "predict.h" | |
44 | #include "tm_p.h" | |
45 | #include "target.h" | |
46 | #include "langhooks.h" | |
47 | #include "basic-block.h" | |
48 | #include "tree-mudflap.h" | |
49 | #include "tree-flow.h" | |
50 | #include "value-prof.h" | |
51 | #include "diagnostic-core.h" | |
52 | #include "builtins.h" | |
53 | ||
54 | ||
55 | #ifndef PAD_VARARGS_DOWN | |
56 | #define PAD_VARARGS_DOWN BYTES_BIG_ENDIAN | |
57 | #endif | |
58 | static tree do_mpc_arg1 (tree, tree, int (*)(mpc_ptr, mpc_srcptr, mpc_rnd_t)); | |
59 | ||
60 | struct target_builtins default_target_builtins; | |
61 | #if SWITCHABLE_TARGET | |
62 | struct target_builtins *this_target_builtins = &default_target_builtins; | |
63 | #endif | |
64 | ||
65 | /* Define the names of the builtin function types and codes. */ | |
66 | const char *const built_in_class_names[4] | |
67 | = {"NOT_BUILT_IN", "BUILT_IN_FRONTEND", "BUILT_IN_MD", "BUILT_IN_NORMAL"}; | |
68 | ||
69 | #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X, | |
70 | const char * built_in_names[(int) END_BUILTINS] = | |
71 | { | |
72 | #include "builtins.def" | |
73 | }; | |
74 | #undef DEF_BUILTIN | |
75 | ||
76 | /* Setup an array of _DECL trees, make sure each element is | |
77 | initialized to NULL_TREE. */ | |
78 | builtin_info_type builtin_info; | |
79 | ||
80 | static const char *c_getstr (tree); | |
81 | static rtx c_readstr (const char *, enum machine_mode); | |
82 | static int target_char_cast (tree, char *); | |
83 | static rtx get_memory_rtx (tree, tree); | |
84 | static int apply_args_size (void); | |
85 | static int apply_result_size (void); | |
86 | #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return) | |
87 | static rtx result_vector (int, rtx); | |
88 | #endif | |
89 | static void expand_builtin_update_setjmp_buf (rtx); | |
90 | static void expand_builtin_prefetch (tree); | |
91 | static rtx expand_builtin_apply_args (void); | |
92 | static rtx expand_builtin_apply_args_1 (void); | |
93 | static rtx expand_builtin_apply (rtx, rtx, rtx); | |
94 | static void expand_builtin_return (rtx); | |
95 | static enum type_class type_to_class (tree); | |
96 | static rtx expand_builtin_classify_type (tree); | |
97 | static void expand_errno_check (tree, rtx); | |
98 | static rtx expand_builtin_mathfn (tree, rtx, rtx); | |
99 | static rtx expand_builtin_mathfn_2 (tree, rtx, rtx); | |
100 | static rtx expand_builtin_mathfn_3 (tree, rtx, rtx); | |
101 | static rtx expand_builtin_mathfn_ternary (tree, rtx, rtx); | |
102 | static rtx expand_builtin_interclass_mathfn (tree, rtx); | |
103 | static rtx expand_builtin_sincos (tree); | |
104 | static rtx expand_builtin_cexpi (tree, rtx); | |
105 | static rtx expand_builtin_int_roundingfn (tree, rtx); | |
106 | static rtx expand_builtin_int_roundingfn_2 (tree, rtx); | |
107 | static rtx expand_builtin_next_arg (void); | |
108 | static rtx expand_builtin_va_start (tree); | |
109 | static rtx expand_builtin_va_end (tree); | |
110 | static rtx expand_builtin_va_copy (tree); | |
111 | static rtx expand_builtin_memcmp (tree, rtx, enum machine_mode); | |
112 | static rtx expand_builtin_strcmp (tree, rtx); | |
113 | static rtx expand_builtin_strncmp (tree, rtx, enum machine_mode); | |
114 | static rtx builtin_memcpy_read_str (void *, HOST_WIDE_INT, enum machine_mode); | |
115 | static rtx expand_builtin_memcpy (tree, rtx); | |
116 | static rtx expand_builtin_mempcpy (tree, rtx, enum machine_mode); | |
117 | static rtx expand_builtin_mempcpy_args (tree, tree, tree, rtx, | |
118 | enum machine_mode, int); | |
119 | static rtx expand_builtin_strcpy (tree, rtx); | |
120 | static rtx expand_builtin_strcpy_args (tree, tree, rtx); | |
121 | static rtx expand_builtin_stpcpy (tree, rtx, enum machine_mode); | |
122 | static rtx expand_builtin_strncpy (tree, rtx); | |
123 | static rtx builtin_memset_gen_str (void *, HOST_WIDE_INT, enum machine_mode); | |
124 | static rtx expand_builtin_memset (tree, rtx, enum machine_mode); | |
125 | static rtx expand_builtin_memset_args (tree, tree, tree, rtx, enum machine_mode, tree); | |
126 | static rtx expand_builtin_bzero (tree); | |
127 | static rtx expand_builtin_strlen (tree, rtx, enum machine_mode); | |
128 | static rtx expand_builtin_alloca (tree, bool); | |
129 | static rtx expand_builtin_unop (enum machine_mode, tree, rtx, rtx, optab); | |
130 | static rtx expand_builtin_frame_address (tree, tree); | |
131 | static tree stabilize_va_list_loc (location_t, tree, int); | |
132 | static rtx expand_builtin_expect (tree, rtx); | |
133 | static tree fold_builtin_constant_p (tree); | |
134 | static tree fold_builtin_expect (location_t, tree, tree); | |
135 | static tree fold_builtin_classify_type (tree); | |
136 | static tree fold_builtin_strlen (location_t, tree, tree); | |
137 | static tree fold_builtin_inf (location_t, tree, int); | |
138 | static tree fold_builtin_nan (tree, tree, int); | |
139 | static tree rewrite_call_expr (location_t, tree, int, tree, int, ...); | |
140 | static bool validate_arg (const_tree, enum tree_code code); | |
141 | static bool integer_valued_real_p (tree); | |
142 | static tree fold_trunc_transparent_mathfn (location_t, tree, tree); | |
143 | static bool readonly_data_expr (tree); | |
144 | static rtx expand_builtin_fabs (tree, rtx, rtx); | |
145 | static rtx expand_builtin_signbit (tree, rtx); | |
146 | static tree fold_builtin_sqrt (location_t, tree, tree); | |
147 | static tree fold_builtin_cbrt (location_t, tree, tree); | |
148 | static tree fold_builtin_pow (location_t, tree, tree, tree, tree); | |
149 | static tree fold_builtin_powi (location_t, tree, tree, tree, tree); | |
150 | static tree fold_builtin_cos (location_t, tree, tree, tree); | |
151 | static tree fold_builtin_cosh (location_t, tree, tree, tree); | |
152 | static tree fold_builtin_tan (tree, tree); | |
153 | static tree fold_builtin_trunc (location_t, tree, tree); | |
154 | static tree fold_builtin_floor (location_t, tree, tree); | |
155 | static tree fold_builtin_ceil (location_t, tree, tree); | |
156 | static tree fold_builtin_round (location_t, tree, tree); | |
157 | static tree fold_builtin_int_roundingfn (location_t, tree, tree); | |
158 | static tree fold_builtin_bitop (tree, tree); | |
159 | static tree fold_builtin_memory_op (location_t, tree, tree, tree, tree, bool, int); | |
160 | static tree fold_builtin_strchr (location_t, tree, tree, tree); | |
161 | static tree fold_builtin_memchr (location_t, tree, tree, tree, tree); | |
162 | static tree fold_builtin_memcmp (location_t, tree, tree, tree); | |
163 | static tree fold_builtin_strcmp (location_t, tree, tree); | |
164 | static tree fold_builtin_strncmp (location_t, tree, tree, tree); | |
165 | static tree fold_builtin_signbit (location_t, tree, tree); | |
166 | static tree fold_builtin_copysign (location_t, tree, tree, tree, tree); | |
167 | static tree fold_builtin_isascii (location_t, tree); | |
168 | static tree fold_builtin_toascii (location_t, tree); | |
169 | static tree fold_builtin_isdigit (location_t, tree); | |
170 | static tree fold_builtin_fabs (location_t, tree, tree); | |
171 | static tree fold_builtin_abs (location_t, tree, tree); | |
172 | static tree fold_builtin_unordered_cmp (location_t, tree, tree, tree, enum tree_code, | |
173 | enum tree_code); | |
174 | static tree fold_builtin_n (location_t, tree, tree *, int, bool); | |
175 | static tree fold_builtin_0 (location_t, tree, bool); | |
176 | static tree fold_builtin_1 (location_t, tree, tree, bool); | |
177 | static tree fold_builtin_2 (location_t, tree, tree, tree, bool); | |
178 | static tree fold_builtin_3 (location_t, tree, tree, tree, tree, bool); | |
179 | static tree fold_builtin_4 (location_t, tree, tree, tree, tree, tree, bool); | |
180 | static tree fold_builtin_varargs (location_t, tree, tree, bool); | |
181 | ||
182 | static tree fold_builtin_strpbrk (location_t, tree, tree, tree); | |
183 | static tree fold_builtin_strstr (location_t, tree, tree, tree); | |
184 | static tree fold_builtin_strrchr (location_t, tree, tree, tree); | |
185 | static tree fold_builtin_strcat (location_t, tree, tree); | |
186 | static tree fold_builtin_strncat (location_t, tree, tree, tree); | |
187 | static tree fold_builtin_strspn (location_t, tree, tree); | |
188 | static tree fold_builtin_strcspn (location_t, tree, tree); | |
189 | static tree fold_builtin_sprintf (location_t, tree, tree, tree, int); | |
190 | static tree fold_builtin_snprintf (location_t, tree, tree, tree, tree, int); | |
191 | ||
192 | static rtx expand_builtin_object_size (tree); | |
193 | static rtx expand_builtin_memory_chk (tree, rtx, enum machine_mode, | |
194 | enum built_in_function); | |
195 | static void maybe_emit_chk_warning (tree, enum built_in_function); | |
196 | static void maybe_emit_sprintf_chk_warning (tree, enum built_in_function); | |
197 | static void maybe_emit_free_warning (tree); | |
198 | static tree fold_builtin_object_size (tree, tree); | |
199 | static tree fold_builtin_strcat_chk (location_t, tree, tree, tree, tree); | |
200 | static tree fold_builtin_strncat_chk (location_t, tree, tree, tree, tree, tree); | |
201 | static tree fold_builtin_sprintf_chk (location_t, tree, enum built_in_function); | |
202 | static tree fold_builtin_printf (location_t, tree, tree, tree, bool, enum built_in_function); | |
203 | static tree fold_builtin_fprintf (location_t, tree, tree, tree, tree, bool, | |
204 | enum built_in_function); | |
205 | static bool init_target_chars (void); | |
206 | ||
207 | static unsigned HOST_WIDE_INT target_newline; | |
208 | static unsigned HOST_WIDE_INT target_percent; | |
209 | static unsigned HOST_WIDE_INT target_c; | |
210 | static unsigned HOST_WIDE_INT target_s; | |
211 | static char target_percent_c[3]; | |
212 | static char target_percent_s[3]; | |
213 | static char target_percent_s_newline[4]; | |
214 | static tree do_mpfr_arg1 (tree, tree, int (*)(mpfr_ptr, mpfr_srcptr, mp_rnd_t), | |
215 | const REAL_VALUE_TYPE *, const REAL_VALUE_TYPE *, bool); | |
216 | static tree do_mpfr_arg2 (tree, tree, tree, | |
217 | int (*)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t)); | |
218 | static tree do_mpfr_arg3 (tree, tree, tree, tree, | |
219 | int (*)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t)); | |
220 | static tree do_mpfr_sincos (tree, tree, tree); | |
221 | static tree do_mpfr_bessel_n (tree, tree, tree, | |
222 | int (*)(mpfr_ptr, long, mpfr_srcptr, mp_rnd_t), | |
223 | const REAL_VALUE_TYPE *, bool); | |
224 | static tree do_mpfr_remquo (tree, tree, tree); | |
225 | static tree do_mpfr_lgamma_r (tree, tree, tree); | |
226 | static void expand_builtin_sync_synchronize (void); | |
227 | ||
228 | /* Return true if NAME starts with __builtin_ or __sync_. */ | |
229 | ||
230 | static bool | |
231 | is_builtin_name (const char *name) | |
232 | { | |
233 | if (strncmp (name, "__builtin_", 10) == 0) | |
234 | return true; | |
235 | if (strncmp (name, "__sync_", 7) == 0) | |
236 | return true; | |
237 | if (strncmp (name, "__atomic_", 9) == 0) | |
238 | return true; | |
239 | return false; | |
240 | } | |
241 | ||
242 | ||
243 | /* Return true if DECL is a function symbol representing a built-in. */ | |
244 | ||
245 | bool | |
246 | is_builtin_fn (tree decl) | |
247 | { | |
248 | return TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl); | |
249 | } | |
250 | ||
251 | ||
252 | /* Return true if NODE should be considered for inline expansion regardless | |
253 | of the optimization level. This means whenever a function is invoked with | |
254 | its "internal" name, which normally contains the prefix "__builtin". */ | |
255 | ||
256 | static bool | |
257 | called_as_built_in (tree node) | |
258 | { | |
259 | /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since | |
260 | we want the name used to call the function, not the name it | |
261 | will have. */ | |
262 | const char *name = IDENTIFIER_POINTER (DECL_NAME (node)); | |
263 | return is_builtin_name (name); | |
264 | } | |
265 | ||
266 | /* Compute values M and N such that M divides (address of EXP - N) and | |
267 | such that N < M. Store N in *BITPOSP and return M. | |
268 | ||
269 | Note that the address (and thus the alignment) computed here is based | |
270 | on the address to which a symbol resolves, whereas DECL_ALIGN is based | |
271 | on the address at which an object is actually located. These two | |
272 | addresses are not always the same. For example, on ARM targets, | |
273 | the address &foo of a Thumb function foo() has the lowest bit set, | |
274 | whereas foo() itself starts on an even address. */ | |
275 | ||
276 | unsigned int | |
277 | get_object_alignment_1 (tree exp, unsigned HOST_WIDE_INT *bitposp) | |
278 | { | |
279 | HOST_WIDE_INT bitsize, bitpos; | |
280 | tree offset; | |
281 | enum machine_mode mode; | |
282 | int unsignedp, volatilep; | |
283 | unsigned int align, inner; | |
284 | ||
285 | /* Get the innermost object and the constant (bitpos) and possibly | |
286 | variable (offset) offset of the access. */ | |
287 | exp = get_inner_reference (exp, &bitsize, &bitpos, &offset, | |
288 | &mode, &unsignedp, &volatilep, true); | |
289 | ||
290 | /* Extract alignment information from the innermost object and | |
291 | possibly adjust bitpos and offset. */ | |
292 | if (TREE_CODE (exp) == CONST_DECL) | |
293 | exp = DECL_INITIAL (exp); | |
294 | if (DECL_P (exp) | |
295 | && TREE_CODE (exp) != LABEL_DECL) | |
296 | { | |
297 | if (TREE_CODE (exp) == FUNCTION_DECL) | |
298 | { | |
299 | /* Function addresses can encode extra information besides their | |
300 | alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION | |
301 | allows the low bit to be used as a virtual bit, we know | |
302 | that the address itself must be 2-byte aligned. */ | |
303 | if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn) | |
304 | align = 2 * BITS_PER_UNIT; | |
305 | else | |
306 | align = BITS_PER_UNIT; | |
307 | } | |
308 | else | |
309 | align = DECL_ALIGN (exp); | |
310 | } | |
311 | else if (CONSTANT_CLASS_P (exp)) | |
312 | { | |
313 | align = TYPE_ALIGN (TREE_TYPE (exp)); | |
314 | #ifdef CONSTANT_ALIGNMENT | |
315 | align = (unsigned)CONSTANT_ALIGNMENT (exp, align); | |
316 | #endif | |
317 | } | |
318 | else if (TREE_CODE (exp) == VIEW_CONVERT_EXPR) | |
319 | align = TYPE_ALIGN (TREE_TYPE (exp)); | |
320 | else if (TREE_CODE (exp) == INDIRECT_REF) | |
321 | align = TYPE_ALIGN (TREE_TYPE (exp)); | |
322 | else if (TREE_CODE (exp) == MEM_REF) | |
323 | { | |
324 | tree addr = TREE_OPERAND (exp, 0); | |
325 | struct ptr_info_def *pi; | |
326 | if (TREE_CODE (addr) == BIT_AND_EXPR | |
327 | && TREE_CODE (TREE_OPERAND (addr, 1)) == INTEGER_CST) | |
328 | { | |
329 | align = (TREE_INT_CST_LOW (TREE_OPERAND (addr, 1)) | |
330 | & -TREE_INT_CST_LOW (TREE_OPERAND (addr, 1))); | |
331 | align *= BITS_PER_UNIT; | |
332 | addr = TREE_OPERAND (addr, 0); | |
333 | } | |
334 | else | |
335 | align = BITS_PER_UNIT; | |
336 | if (TREE_CODE (addr) == SSA_NAME | |
337 | && (pi = SSA_NAME_PTR_INFO (addr))) | |
338 | { | |
339 | bitpos += (pi->misalign * BITS_PER_UNIT) & ~(align - 1); | |
340 | align = MAX (pi->align * BITS_PER_UNIT, align); | |
341 | } | |
342 | else if (TREE_CODE (addr) == ADDR_EXPR) | |
343 | align = MAX (align, get_object_alignment (TREE_OPERAND (addr, 0))); | |
344 | bitpos += mem_ref_offset (exp).low * BITS_PER_UNIT; | |
345 | } | |
346 | else if (TREE_CODE (exp) == TARGET_MEM_REF) | |
347 | { | |
348 | struct ptr_info_def *pi; | |
349 | tree addr = TMR_BASE (exp); | |
350 | if (TREE_CODE (addr) == BIT_AND_EXPR | |
351 | && TREE_CODE (TREE_OPERAND (addr, 1)) == INTEGER_CST) | |
352 | { | |
353 | align = (TREE_INT_CST_LOW (TREE_OPERAND (addr, 1)) | |
354 | & -TREE_INT_CST_LOW (TREE_OPERAND (addr, 1))); | |
355 | align *= BITS_PER_UNIT; | |
356 | addr = TREE_OPERAND (addr, 0); | |
357 | } | |
358 | else | |
359 | align = BITS_PER_UNIT; | |
360 | if (TREE_CODE (addr) == SSA_NAME | |
361 | && (pi = SSA_NAME_PTR_INFO (addr))) | |
362 | { | |
363 | bitpos += (pi->misalign * BITS_PER_UNIT) & ~(align - 1); | |
364 | align = MAX (pi->align * BITS_PER_UNIT, align); | |
365 | } | |
366 | else if (TREE_CODE (addr) == ADDR_EXPR) | |
367 | align = MAX (align, get_object_alignment (TREE_OPERAND (addr, 0))); | |
368 | if (TMR_OFFSET (exp)) | |
369 | bitpos += TREE_INT_CST_LOW (TMR_OFFSET (exp)) * BITS_PER_UNIT; | |
370 | if (TMR_INDEX (exp) && TMR_STEP (exp)) | |
371 | { | |
372 | unsigned HOST_WIDE_INT step = TREE_INT_CST_LOW (TMR_STEP (exp)); | |
373 | align = MIN (align, (step & -step) * BITS_PER_UNIT); | |
374 | } | |
375 | else if (TMR_INDEX (exp)) | |
376 | align = BITS_PER_UNIT; | |
377 | if (TMR_INDEX2 (exp)) | |
378 | align = BITS_PER_UNIT; | |
379 | } | |
380 | else | |
381 | align = BITS_PER_UNIT; | |
382 | ||
383 | /* If there is a non-constant offset part extract the maximum | |
384 | alignment that can prevail. */ | |
385 | inner = ~0U; | |
386 | while (offset) | |
387 | { | |
388 | tree next_offset; | |
389 | ||
390 | if (TREE_CODE (offset) == PLUS_EXPR) | |
391 | { | |
392 | next_offset = TREE_OPERAND (offset, 0); | |
393 | offset = TREE_OPERAND (offset, 1); | |
394 | } | |
395 | else | |
396 | next_offset = NULL; | |
397 | if (host_integerp (offset, 1)) | |
398 | { | |
399 | /* Any overflow in calculating offset_bits won't change | |
400 | the alignment. */ | |
401 | unsigned offset_bits | |
402 | = ((unsigned) tree_low_cst (offset, 1) * BITS_PER_UNIT); | |
403 | ||
404 | if (offset_bits) | |
405 | inner = MIN (inner, (offset_bits & -offset_bits)); | |
406 | } | |
407 | else if (TREE_CODE (offset) == MULT_EXPR | |
408 | && host_integerp (TREE_OPERAND (offset, 1), 1)) | |
409 | { | |
410 | /* Any overflow in calculating offset_factor won't change | |
411 | the alignment. */ | |
412 | unsigned offset_factor | |
413 | = ((unsigned) tree_low_cst (TREE_OPERAND (offset, 1), 1) | |
414 | * BITS_PER_UNIT); | |
415 | ||
416 | if (offset_factor) | |
417 | inner = MIN (inner, (offset_factor & -offset_factor)); | |
418 | } | |
419 | else | |
420 | { | |
421 | inner = MIN (inner, BITS_PER_UNIT); | |
422 | break; | |
423 | } | |
424 | offset = next_offset; | |
425 | } | |
426 | ||
427 | /* Alignment is innermost object alignment adjusted by the constant | |
428 | and non-constant offset parts. */ | |
429 | align = MIN (align, inner); | |
430 | bitpos = bitpos & (align - 1); | |
431 | ||
432 | *bitposp = bitpos; | |
433 | return align; | |
434 | } | |
435 | ||
436 | /* Return the alignment in bits of EXP, an object. */ | |
437 | ||
438 | unsigned int | |
439 | get_object_alignment (tree exp) | |
440 | { | |
441 | unsigned HOST_WIDE_INT bitpos = 0; | |
442 | unsigned int align; | |
443 | ||
444 | align = get_object_alignment_1 (exp, &bitpos); | |
445 | ||
446 | /* align and bitpos now specify known low bits of the pointer. | |
447 | ptr & (align - 1) == bitpos. */ | |
448 | ||
449 | if (bitpos != 0) | |
450 | align = (bitpos & -bitpos); | |
451 | ||
452 | return align; | |
453 | } | |
454 | ||
455 | /* Return the alignment of object EXP, also considering its type when we do | |
456 | not know of explicit misalignment. Only handle MEM_REF and TARGET_MEM_REF. | |
457 | ||
458 | ??? Note that, in the general case, the type of an expression is not kept | |
459 | consistent with misalignment information by the front-end, for example when | |
460 | taking the address of a member of a packed structure. However, in most of | |
461 | the cases, expressions have the alignment of their type so we optimistically | |
462 | fall back to this alignment when we cannot compute a misalignment. */ | |
463 | ||
464 | unsigned int | |
465 | get_object_or_type_alignment (tree exp) | |
466 | { | |
467 | unsigned HOST_WIDE_INT misalign; | |
468 | unsigned int align = get_object_alignment_1 (exp, &misalign); | |
469 | ||
470 | gcc_assert (TREE_CODE (exp) == MEM_REF || TREE_CODE (exp) == TARGET_MEM_REF); | |
471 | ||
472 | if (misalign != 0) | |
473 | align = (misalign & -misalign); | |
474 | else | |
475 | align = MAX (TYPE_ALIGN (TREE_TYPE (exp)), align); | |
476 | ||
477 | return align; | |
478 | } | |
479 | ||
480 | /* For a pointer valued expression EXP compute values M and N such that | |
481 | M divides (EXP - N) and such that N < M. Store N in *BITPOSP and return M. | |
482 | ||
483 | If EXP is not a pointer, 0 is returned. */ | |
484 | ||
485 | unsigned int | |
486 | get_pointer_alignment_1 (tree exp, unsigned HOST_WIDE_INT *bitposp) | |
487 | { | |
488 | STRIP_NOPS (exp); | |
489 | ||
490 | if (TREE_CODE (exp) == ADDR_EXPR) | |
491 | return get_object_alignment_1 (TREE_OPERAND (exp, 0), bitposp); | |
492 | else if (TREE_CODE (exp) == SSA_NAME | |
493 | && POINTER_TYPE_P (TREE_TYPE (exp))) | |
494 | { | |
495 | struct ptr_info_def *pi = SSA_NAME_PTR_INFO (exp); | |
496 | if (!pi) | |
497 | { | |
498 | *bitposp = 0; | |
499 | return BITS_PER_UNIT; | |
500 | } | |
501 | *bitposp = pi->misalign * BITS_PER_UNIT; | |
502 | return pi->align * BITS_PER_UNIT; | |
503 | } | |
504 | ||
505 | *bitposp = 0; | |
506 | return POINTER_TYPE_P (TREE_TYPE (exp)) ? BITS_PER_UNIT : 0; | |
507 | } | |
508 | ||
509 | /* Return the alignment in bits of EXP, a pointer valued expression. | |
510 | The alignment returned is, by default, the alignment of the thing that | |
511 | EXP points to. If it is not a POINTER_TYPE, 0 is returned. | |
512 | ||
513 | Otherwise, look at the expression to see if we can do better, i.e., if the | |
514 | expression is actually pointing at an object whose alignment is tighter. */ | |
515 | ||
516 | unsigned int | |
517 | get_pointer_alignment (tree exp) | |
518 | { | |
519 | unsigned HOST_WIDE_INT bitpos = 0; | |
520 | unsigned int align; | |
521 | ||
522 | align = get_pointer_alignment_1 (exp, &bitpos); | |
523 | ||
524 | /* align and bitpos now specify known low bits of the pointer. | |
525 | ptr & (align - 1) == bitpos. */ | |
526 | ||
527 | if (bitpos != 0) | |
528 | align = (bitpos & -bitpos); | |
529 | ||
530 | return align; | |
531 | } | |
532 | ||
533 | /* Compute the length of a C string. TREE_STRING_LENGTH is not the right | |
534 | way, because it could contain a zero byte in the middle. | |
535 | TREE_STRING_LENGTH is the size of the character array, not the string. | |
536 | ||
537 | ONLY_VALUE should be nonzero if the result is not going to be emitted | |
538 | into the instruction stream and zero if it is going to be expanded. | |
539 | E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3 | |
540 | is returned, otherwise NULL, since | |
541 | len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not | |
542 | evaluate the side-effects. | |
543 | ||
544 | The value returned is of type `ssizetype'. | |
545 | ||
546 | Unfortunately, string_constant can't access the values of const char | |
547 | arrays with initializers, so neither can we do so here. */ | |
548 | ||
549 | tree | |
550 | c_strlen (tree src, int only_value) | |
551 | { | |
552 | tree offset_node; | |
553 | HOST_WIDE_INT offset; | |
554 | int max; | |
555 | const char *ptr; | |
556 | location_t loc; | |
557 | ||
558 | STRIP_NOPS (src); | |
559 | if (TREE_CODE (src) == COND_EXPR | |
560 | && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0)))) | |
561 | { | |
562 | tree len1, len2; | |
563 | ||
564 | len1 = c_strlen (TREE_OPERAND (src, 1), only_value); | |
565 | len2 = c_strlen (TREE_OPERAND (src, 2), only_value); | |
566 | if (tree_int_cst_equal (len1, len2)) | |
567 | return len1; | |
568 | } | |
569 | ||
570 | if (TREE_CODE (src) == COMPOUND_EXPR | |
571 | && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0)))) | |
572 | return c_strlen (TREE_OPERAND (src, 1), only_value); | |
573 | ||
574 | loc = EXPR_LOC_OR_HERE (src); | |
575 | ||
576 | src = string_constant (src, &offset_node); | |
577 | if (src == 0) | |
578 | return NULL_TREE; | |
579 | ||
580 | max = TREE_STRING_LENGTH (src) - 1; | |
581 | ptr = TREE_STRING_POINTER (src); | |
582 | ||
583 | if (offset_node && TREE_CODE (offset_node) != INTEGER_CST) | |
584 | { | |
585 | /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't | |
586 | compute the offset to the following null if we don't know where to | |
587 | start searching for it. */ | |
588 | int i; | |
589 | ||
590 | for (i = 0; i < max; i++) | |
591 | if (ptr[i] == 0) | |
592 | return NULL_TREE; | |
593 | ||
594 | /* We don't know the starting offset, but we do know that the string | |
595 | has no internal zero bytes. We can assume that the offset falls | |
596 | within the bounds of the string; otherwise, the programmer deserves | |
597 | what he gets. Subtract the offset from the length of the string, | |
598 | and return that. This would perhaps not be valid if we were dealing | |
599 | with named arrays in addition to literal string constants. */ | |
600 | ||
601 | return size_diffop_loc (loc, size_int (max), offset_node); | |
602 | } | |
603 | ||
604 | /* We have a known offset into the string. Start searching there for | |
605 | a null character if we can represent it as a single HOST_WIDE_INT. */ | |
606 | if (offset_node == 0) | |
607 | offset = 0; | |
608 | else if (! host_integerp (offset_node, 0)) | |
609 | offset = -1; | |
610 | else | |
611 | offset = tree_low_cst (offset_node, 0); | |
612 | ||
613 | /* If the offset is known to be out of bounds, warn, and call strlen at | |
614 | runtime. */ | |
615 | if (offset < 0 || offset > max) | |
616 | { | |
617 | /* Suppress multiple warnings for propagated constant strings. */ | |
618 | if (! TREE_NO_WARNING (src)) | |
619 | { | |
620 | warning_at (loc, 0, "offset outside bounds of constant string"); | |
621 | TREE_NO_WARNING (src) = 1; | |
622 | } | |
623 | return NULL_TREE; | |
624 | } | |
625 | ||
626 | /* Use strlen to search for the first zero byte. Since any strings | |
627 | constructed with build_string will have nulls appended, we win even | |
628 | if we get handed something like (char[4])"abcd". | |
629 | ||
630 | Since OFFSET is our starting index into the string, no further | |
631 | calculation is needed. */ | |
632 | return ssize_int (strlen (ptr + offset)); | |
633 | } | |
634 | ||
635 | /* Return a char pointer for a C string if it is a string constant | |
636 | or sum of string constant and integer constant. */ | |
637 | ||
638 | static const char * | |
639 | c_getstr (tree src) | |
640 | { | |
641 | tree offset_node; | |
642 | ||
643 | src = string_constant (src, &offset_node); | |
644 | if (src == 0) | |
645 | return 0; | |
646 | ||
647 | if (offset_node == 0) | |
648 | return TREE_STRING_POINTER (src); | |
649 | else if (!host_integerp (offset_node, 1) | |
650 | || compare_tree_int (offset_node, TREE_STRING_LENGTH (src) - 1) > 0) | |
651 | return 0; | |
652 | ||
653 | return TREE_STRING_POINTER (src) + tree_low_cst (offset_node, 1); | |
654 | } | |
655 | ||
656 | /* Return a CONST_INT or CONST_DOUBLE corresponding to target reading | |
657 | GET_MODE_BITSIZE (MODE) bits from string constant STR. */ | |
658 | ||
659 | static rtx | |
660 | c_readstr (const char *str, enum machine_mode mode) | |
661 | { | |
662 | HOST_WIDE_INT c[2]; | |
663 | HOST_WIDE_INT ch; | |
664 | unsigned int i, j; | |
665 | ||
666 | gcc_assert (GET_MODE_CLASS (mode) == MODE_INT); | |
667 | ||
668 | c[0] = 0; | |
669 | c[1] = 0; | |
670 | ch = 1; | |
671 | for (i = 0; i < GET_MODE_SIZE (mode); i++) | |
672 | { | |
673 | j = i; | |
674 | if (WORDS_BIG_ENDIAN) | |
675 | j = GET_MODE_SIZE (mode) - i - 1; | |
676 | if (BYTES_BIG_ENDIAN != WORDS_BIG_ENDIAN | |
677 | && GET_MODE_SIZE (mode) >= UNITS_PER_WORD) | |
678 | j = j + UNITS_PER_WORD - 2 * (j % UNITS_PER_WORD) - 1; | |
679 | j *= BITS_PER_UNIT; | |
680 | gcc_assert (j < 2 * HOST_BITS_PER_WIDE_INT); | |
681 | ||
682 | if (ch) | |
683 | ch = (unsigned char) str[i]; | |
684 | c[j / HOST_BITS_PER_WIDE_INT] |= ch << (j % HOST_BITS_PER_WIDE_INT); | |
685 | } | |
686 | return immed_double_const (c[0], c[1], mode); | |
687 | } | |
688 | ||
689 | /* Cast a target constant CST to target CHAR and if that value fits into | |
690 | host char type, return zero and put that value into variable pointed to by | |
691 | P. */ | |
692 | ||
693 | static int | |
694 | target_char_cast (tree cst, char *p) | |
695 | { | |
696 | unsigned HOST_WIDE_INT val, hostval; | |
697 | ||
698 | if (TREE_CODE (cst) != INTEGER_CST | |
699 | || CHAR_TYPE_SIZE > HOST_BITS_PER_WIDE_INT) | |
700 | return 1; | |
701 | ||
702 | val = TREE_INT_CST_LOW (cst); | |
703 | if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT) | |
704 | val &= (((unsigned HOST_WIDE_INT) 1) << CHAR_TYPE_SIZE) - 1; | |
705 | ||
706 | hostval = val; | |
707 | if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT) | |
708 | hostval &= (((unsigned HOST_WIDE_INT) 1) << HOST_BITS_PER_CHAR) - 1; | |
709 | ||
710 | if (val != hostval) | |
711 | return 1; | |
712 | ||
713 | *p = hostval; | |
714 | return 0; | |
715 | } | |
716 | ||
717 | /* Similar to save_expr, but assumes that arbitrary code is not executed | |
718 | in between the multiple evaluations. In particular, we assume that a | |
719 | non-addressable local variable will not be modified. */ | |
720 | ||
721 | static tree | |
722 | builtin_save_expr (tree exp) | |
723 | { | |
724 | if (TREE_CODE (exp) == SSA_NAME | |
725 | || (TREE_ADDRESSABLE (exp) == 0 | |
726 | && (TREE_CODE (exp) == PARM_DECL | |
727 | || (TREE_CODE (exp) == VAR_DECL && !TREE_STATIC (exp))))) | |
728 | return exp; | |
729 | ||
730 | return save_expr (exp); | |
731 | } | |
732 | ||
733 | /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT | |
734 | times to get the address of either a higher stack frame, or a return | |
735 | address located within it (depending on FNDECL_CODE). */ | |
736 | ||
737 | static rtx | |
738 | expand_builtin_return_addr (enum built_in_function fndecl_code, int count) | |
739 | { | |
740 | int i; | |
741 | ||
742 | #ifdef INITIAL_FRAME_ADDRESS_RTX | |
743 | rtx tem = INITIAL_FRAME_ADDRESS_RTX; | |
744 | #else | |
745 | rtx tem; | |
746 | ||
747 | /* For a zero count with __builtin_return_address, we don't care what | |
748 | frame address we return, because target-specific definitions will | |
749 | override us. Therefore frame pointer elimination is OK, and using | |
750 | the soft frame pointer is OK. | |
751 | ||
752 | For a nonzero count, or a zero count with __builtin_frame_address, | |
753 | we require a stable offset from the current frame pointer to the | |
754 | previous one, so we must use the hard frame pointer, and | |
755 | we must disable frame pointer elimination. */ | |
756 | if (count == 0 && fndecl_code == BUILT_IN_RETURN_ADDRESS) | |
757 | tem = frame_pointer_rtx; | |
758 | else | |
759 | { | |
760 | tem = hard_frame_pointer_rtx; | |
761 | ||
762 | /* Tell reload not to eliminate the frame pointer. */ | |
763 | crtl->accesses_prior_frames = 1; | |
764 | } | |
765 | #endif | |
766 | ||
767 | /* Some machines need special handling before we can access | |
768 | arbitrary frames. For example, on the SPARC, we must first flush | |
769 | all register windows to the stack. */ | |
770 | #ifdef SETUP_FRAME_ADDRESSES | |
771 | if (count > 0) | |
772 | SETUP_FRAME_ADDRESSES (); | |
773 | #endif | |
774 | ||
775 | /* On the SPARC, the return address is not in the frame, it is in a | |
776 | register. There is no way to access it off of the current frame | |
777 | pointer, but it can be accessed off the previous frame pointer by | |
778 | reading the value from the register window save area. */ | |
779 | #ifdef RETURN_ADDR_IN_PREVIOUS_FRAME | |
780 | if (fndecl_code == BUILT_IN_RETURN_ADDRESS) | |
781 | count--; | |
782 | #endif | |
783 | ||
784 | /* Scan back COUNT frames to the specified frame. */ | |
785 | for (i = 0; i < count; i++) | |
786 | { | |
787 | /* Assume the dynamic chain pointer is in the word that the | |
788 | frame address points to, unless otherwise specified. */ | |
789 | #ifdef DYNAMIC_CHAIN_ADDRESS | |
790 | tem = DYNAMIC_CHAIN_ADDRESS (tem); | |
791 | #endif | |
792 | tem = memory_address (Pmode, tem); | |
793 | tem = gen_frame_mem (Pmode, tem); | |
794 | tem = copy_to_reg (tem); | |
795 | } | |
796 | ||
797 | /* For __builtin_frame_address, return what we've got. But, on | |
798 | the SPARC for example, we may have to add a bias. */ | |
799 | if (fndecl_code == BUILT_IN_FRAME_ADDRESS) | |
800 | #ifdef FRAME_ADDR_RTX | |
801 | return FRAME_ADDR_RTX (tem); | |
802 | #else | |
803 | return tem; | |
804 | #endif | |
805 | ||
806 | /* For __builtin_return_address, get the return address from that frame. */ | |
807 | #ifdef RETURN_ADDR_RTX | |
808 | tem = RETURN_ADDR_RTX (count, tem); | |
809 | #else | |
810 | tem = memory_address (Pmode, | |
811 | plus_constant (tem, GET_MODE_SIZE (Pmode))); | |
812 | tem = gen_frame_mem (Pmode, tem); | |
813 | #endif | |
814 | return tem; | |
815 | } | |
816 | ||
817 | /* Alias set used for setjmp buffer. */ | |
818 | static alias_set_type setjmp_alias_set = -1; | |
819 | ||
820 | /* Construct the leading half of a __builtin_setjmp call. Control will | |
821 | return to RECEIVER_LABEL. This is also called directly by the SJLJ | |
822 | exception handling code. */ | |
823 | ||
824 | void | |
825 | expand_builtin_setjmp_setup (rtx buf_addr, rtx receiver_label) | |
826 | { | |
827 | enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL); | |
828 | rtx stack_save; | |
829 | rtx mem; | |
830 | ||
831 | if (setjmp_alias_set == -1) | |
832 | setjmp_alias_set = new_alias_set (); | |
833 | ||
834 | buf_addr = convert_memory_address (Pmode, buf_addr); | |
835 | ||
836 | buf_addr = force_reg (Pmode, force_operand (buf_addr, NULL_RTX)); | |
837 | ||
838 | /* We store the frame pointer and the address of receiver_label in | |
839 | the buffer and use the rest of it for the stack save area, which | |
840 | is machine-dependent. */ | |
841 | ||
842 | mem = gen_rtx_MEM (Pmode, buf_addr); | |
843 | set_mem_alias_set (mem, setjmp_alias_set); | |
844 | emit_move_insn (mem, targetm.builtin_setjmp_frame_value ()); | |
845 | ||
846 | mem = gen_rtx_MEM (Pmode, plus_constant (buf_addr, GET_MODE_SIZE (Pmode))), | |
847 | set_mem_alias_set (mem, setjmp_alias_set); | |
848 | ||
849 | emit_move_insn (validize_mem (mem), | |
850 | force_reg (Pmode, gen_rtx_LABEL_REF (Pmode, receiver_label))); | |
851 | ||
852 | stack_save = gen_rtx_MEM (sa_mode, | |
853 | plus_constant (buf_addr, | |
854 | 2 * GET_MODE_SIZE (Pmode))); | |
855 | set_mem_alias_set (stack_save, setjmp_alias_set); | |
856 | emit_stack_save (SAVE_NONLOCAL, &stack_save); | |
857 | ||
858 | /* If there is further processing to do, do it. */ | |
859 | #ifdef HAVE_builtin_setjmp_setup | |
860 | if (HAVE_builtin_setjmp_setup) | |
861 | emit_insn (gen_builtin_setjmp_setup (buf_addr)); | |
862 | #endif | |
863 | ||
864 | /* We have a nonlocal label. */ | |
865 | cfun->has_nonlocal_label = 1; | |
866 | } | |
867 | ||
868 | /* Construct the trailing part of a __builtin_setjmp call. This is | |
869 | also called directly by the SJLJ exception handling code. */ | |
870 | ||
871 | void | |
872 | expand_builtin_setjmp_receiver (rtx receiver_label ATTRIBUTE_UNUSED) | |
873 | { | |
874 | rtx chain; | |
875 | ||
876 | /* Clobber the FP when we get here, so we have to make sure it's | |
877 | marked as used by this function. */ | |
878 | emit_use (hard_frame_pointer_rtx); | |
879 | ||
880 | /* Mark the static chain as clobbered here so life information | |
881 | doesn't get messed up for it. */ | |
882 | chain = targetm.calls.static_chain (current_function_decl, true); | |
883 | if (chain && REG_P (chain)) | |
884 | emit_clobber (chain); | |
885 | ||
886 | /* Now put in the code to restore the frame pointer, and argument | |
887 | pointer, if needed. */ | |
888 | #ifdef HAVE_nonlocal_goto | |
889 | if (! HAVE_nonlocal_goto) | |
890 | #endif | |
891 | { | |
892 | emit_move_insn (virtual_stack_vars_rtx, hard_frame_pointer_rtx); | |
893 | /* This might change the hard frame pointer in ways that aren't | |
894 | apparent to early optimization passes, so force a clobber. */ | |
895 | emit_clobber (hard_frame_pointer_rtx); | |
896 | } | |
897 | ||
898 | #if !HARD_FRAME_POINTER_IS_ARG_POINTER | |
899 | if (fixed_regs[ARG_POINTER_REGNUM]) | |
900 | { | |
901 | #ifdef ELIMINABLE_REGS | |
902 | size_t i; | |
903 | static const struct elims {const int from, to;} elim_regs[] = ELIMINABLE_REGS; | |
904 | ||
905 | for (i = 0; i < ARRAY_SIZE (elim_regs); i++) | |
906 | if (elim_regs[i].from == ARG_POINTER_REGNUM | |
907 | && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM) | |
908 | break; | |
909 | ||
910 | if (i == ARRAY_SIZE (elim_regs)) | |
911 | #endif | |
912 | { | |
913 | /* Now restore our arg pointer from the address at which it | |
914 | was saved in our stack frame. */ | |
915 | emit_move_insn (crtl->args.internal_arg_pointer, | |
916 | copy_to_reg (get_arg_pointer_save_area ())); | |
917 | } | |
918 | } | |
919 | #endif | |
920 | ||
921 | #ifdef HAVE_builtin_setjmp_receiver | |
922 | if (HAVE_builtin_setjmp_receiver) | |
923 | emit_insn (gen_builtin_setjmp_receiver (receiver_label)); | |
924 | else | |
925 | #endif | |
926 | #ifdef HAVE_nonlocal_goto_receiver | |
927 | if (HAVE_nonlocal_goto_receiver) | |
928 | emit_insn (gen_nonlocal_goto_receiver ()); | |
929 | else | |
930 | #endif | |
931 | { /* Nothing */ } | |
932 | ||
933 | /* We must not allow the code we just generated to be reordered by | |
934 | scheduling. Specifically, the update of the frame pointer must | |
935 | happen immediately, not later. */ | |
936 | emit_insn (gen_blockage ()); | |
937 | } | |
938 | ||
939 | /* __builtin_longjmp is passed a pointer to an array of five words (not | |
940 | all will be used on all machines). It operates similarly to the C | |
941 | library function of the same name, but is more efficient. Much of | |
942 | the code below is copied from the handling of non-local gotos. */ | |
943 | ||
944 | static void | |
945 | expand_builtin_longjmp (rtx buf_addr, rtx value) | |
946 | { | |
947 | rtx fp, lab, stack, insn, last; | |
948 | enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL); | |
949 | ||
950 | /* DRAP is needed for stack realign if longjmp is expanded to current | |
951 | function */ | |
952 | if (SUPPORTS_STACK_ALIGNMENT) | |
953 | crtl->need_drap = true; | |
954 | ||
955 | if (setjmp_alias_set == -1) | |
956 | setjmp_alias_set = new_alias_set (); | |
957 | ||
958 | buf_addr = convert_memory_address (Pmode, buf_addr); | |
959 | ||
960 | buf_addr = force_reg (Pmode, buf_addr); | |
961 | ||
962 | /* We require that the user must pass a second argument of 1, because | |
963 | that is what builtin_setjmp will return. */ | |
964 | gcc_assert (value == const1_rtx); | |
965 | ||
966 | last = get_last_insn (); | |
967 | #ifdef HAVE_builtin_longjmp | |
968 | if (HAVE_builtin_longjmp) | |
969 | emit_insn (gen_builtin_longjmp (buf_addr)); | |
970 | else | |
971 | #endif | |
972 | { | |
973 | fp = gen_rtx_MEM (Pmode, buf_addr); | |
974 | lab = gen_rtx_MEM (Pmode, plus_constant (buf_addr, | |
975 | GET_MODE_SIZE (Pmode))); | |
976 | ||
977 | stack = gen_rtx_MEM (sa_mode, plus_constant (buf_addr, | |
978 | 2 * GET_MODE_SIZE (Pmode))); | |
979 | set_mem_alias_set (fp, setjmp_alias_set); | |
980 | set_mem_alias_set (lab, setjmp_alias_set); | |
981 | set_mem_alias_set (stack, setjmp_alias_set); | |
982 | ||
983 | /* Pick up FP, label, and SP from the block and jump. This code is | |
984 | from expand_goto in stmt.c; see there for detailed comments. */ | |
985 | #ifdef HAVE_nonlocal_goto | |
986 | if (HAVE_nonlocal_goto) | |
987 | /* We have to pass a value to the nonlocal_goto pattern that will | |
988 | get copied into the static_chain pointer, but it does not matter | |
989 | what that value is, because builtin_setjmp does not use it. */ | |
990 | emit_insn (gen_nonlocal_goto (value, lab, stack, fp)); | |
991 | else | |
992 | #endif | |
993 | { | |
994 | lab = copy_to_reg (lab); | |
995 | ||
996 | emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode))); | |
997 | emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx)); | |
998 | ||
999 | emit_move_insn (hard_frame_pointer_rtx, fp); | |
1000 | emit_stack_restore (SAVE_NONLOCAL, stack); | |
1001 | ||
1002 | emit_use (hard_frame_pointer_rtx); | |
1003 | emit_use (stack_pointer_rtx); | |
1004 | emit_indirect_jump (lab); | |
1005 | } | |
1006 | } | |
1007 | ||
1008 | /* Search backwards and mark the jump insn as a non-local goto. | |
1009 | Note that this precludes the use of __builtin_longjmp to a | |
1010 | __builtin_setjmp target in the same function. However, we've | |
1011 | already cautioned the user that these functions are for | |
1012 | internal exception handling use only. */ | |
1013 | for (insn = get_last_insn (); insn; insn = PREV_INSN (insn)) | |
1014 | { | |
1015 | gcc_assert (insn != last); | |
1016 | ||
1017 | if (JUMP_P (insn)) | |
1018 | { | |
1019 | add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx); | |
1020 | break; | |
1021 | } | |
1022 | else if (CALL_P (insn)) | |
1023 | break; | |
1024 | } | |
1025 | } | |
1026 | ||
1027 | /* Expand a call to __builtin_nonlocal_goto. We're passed the target label | |
1028 | and the address of the save area. */ | |
1029 | ||
1030 | static rtx | |
1031 | expand_builtin_nonlocal_goto (tree exp) | |
1032 | { | |
1033 | tree t_label, t_save_area; | |
1034 | rtx r_label, r_save_area, r_fp, r_sp, insn; | |
1035 | ||
1036 | if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE)) | |
1037 | return NULL_RTX; | |
1038 | ||
1039 | t_label = CALL_EXPR_ARG (exp, 0); | |
1040 | t_save_area = CALL_EXPR_ARG (exp, 1); | |
1041 | ||
1042 | r_label = expand_normal (t_label); | |
1043 | r_label = convert_memory_address (Pmode, r_label); | |
1044 | r_save_area = expand_normal (t_save_area); | |
1045 | r_save_area = convert_memory_address (Pmode, r_save_area); | |
1046 | /* Copy the address of the save location to a register just in case it was | |
1047 | based on the frame pointer. */ | |
1048 | r_save_area = copy_to_reg (r_save_area); | |
1049 | r_fp = gen_rtx_MEM (Pmode, r_save_area); | |
1050 | r_sp = gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL), | |
1051 | plus_constant (r_save_area, GET_MODE_SIZE (Pmode))); | |
1052 | ||
1053 | crtl->has_nonlocal_goto = 1; | |
1054 | ||
1055 | #ifdef HAVE_nonlocal_goto | |
1056 | /* ??? We no longer need to pass the static chain value, afaik. */ | |
1057 | if (HAVE_nonlocal_goto) | |
1058 | emit_insn (gen_nonlocal_goto (const0_rtx, r_label, r_sp, r_fp)); | |
1059 | else | |
1060 | #endif | |
1061 | { | |
1062 | r_label = copy_to_reg (r_label); | |
1063 | ||
1064 | emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode))); | |
1065 | emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx)); | |
1066 | ||
1067 | /* Restore frame pointer for containing function. */ | |
1068 | emit_move_insn (hard_frame_pointer_rtx, r_fp); | |
1069 | emit_stack_restore (SAVE_NONLOCAL, r_sp); | |
1070 | ||
1071 | /* USE of hard_frame_pointer_rtx added for consistency; | |
1072 | not clear if really needed. */ | |
1073 | emit_use (hard_frame_pointer_rtx); | |
1074 | emit_use (stack_pointer_rtx); | |
1075 | ||
1076 | /* If the architecture is using a GP register, we must | |
1077 | conservatively assume that the target function makes use of it. | |
1078 | The prologue of functions with nonlocal gotos must therefore | |
1079 | initialize the GP register to the appropriate value, and we | |
1080 | must then make sure that this value is live at the point | |
1081 | of the jump. (Note that this doesn't necessarily apply | |
1082 | to targets with a nonlocal_goto pattern; they are free | |
1083 | to implement it in their own way. Note also that this is | |
1084 | a no-op if the GP register is a global invariant.) */ | |
1085 | if ((unsigned) PIC_OFFSET_TABLE_REGNUM != INVALID_REGNUM | |
1086 | && fixed_regs[PIC_OFFSET_TABLE_REGNUM]) | |
1087 | emit_use (pic_offset_table_rtx); | |
1088 | ||
1089 | emit_indirect_jump (r_label); | |
1090 | } | |
1091 | ||
1092 | /* Search backwards to the jump insn and mark it as a | |
1093 | non-local goto. */ | |
1094 | for (insn = get_last_insn (); insn; insn = PREV_INSN (insn)) | |
1095 | { | |
1096 | if (JUMP_P (insn)) | |
1097 | { | |
1098 | add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx); | |
1099 | break; | |
1100 | } | |
1101 | else if (CALL_P (insn)) | |
1102 | break; | |
1103 | } | |
1104 | ||
1105 | return const0_rtx; | |
1106 | } | |
1107 | ||
1108 | /* __builtin_update_setjmp_buf is passed a pointer to an array of five words | |
1109 | (not all will be used on all machines) that was passed to __builtin_setjmp. | |
1110 | It updates the stack pointer in that block to correspond to the current | |
1111 | stack pointer. */ | |
1112 | ||
1113 | static void | |
1114 | expand_builtin_update_setjmp_buf (rtx buf_addr) | |
1115 | { | |
1116 | enum machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL); | |
1117 | rtx stack_save | |
1118 | = gen_rtx_MEM (sa_mode, | |
1119 | memory_address | |
1120 | (sa_mode, | |
1121 | plus_constant (buf_addr, 2 * GET_MODE_SIZE (Pmode)))); | |
1122 | ||
1123 | emit_stack_save (SAVE_NONLOCAL, &stack_save); | |
1124 | } | |
1125 | ||
1126 | /* Expand a call to __builtin_prefetch. For a target that does not support | |
1127 | data prefetch, evaluate the memory address argument in case it has side | |
1128 | effects. */ | |
1129 | ||
1130 | static void | |
1131 | expand_builtin_prefetch (tree exp) | |
1132 | { | |
1133 | tree arg0, arg1, arg2; | |
1134 | int nargs; | |
1135 | rtx op0, op1, op2; | |
1136 | ||
1137 | if (!validate_arglist (exp, POINTER_TYPE, 0)) | |
1138 | return; | |
1139 | ||
1140 | arg0 = CALL_EXPR_ARG (exp, 0); | |
1141 | ||
1142 | /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to | |
1143 | zero (read) and argument 2 (locality) defaults to 3 (high degree of | |
1144 | locality). */ | |
1145 | nargs = call_expr_nargs (exp); | |
1146 | if (nargs > 1) | |
1147 | arg1 = CALL_EXPR_ARG (exp, 1); | |
1148 | else | |
1149 | arg1 = integer_zero_node; | |
1150 | if (nargs > 2) | |
1151 | arg2 = CALL_EXPR_ARG (exp, 2); | |
1152 | else | |
1153 | arg2 = integer_three_node; | |
1154 | ||
1155 | /* Argument 0 is an address. */ | |
1156 | op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL); | |
1157 | ||
1158 | /* Argument 1 (read/write flag) must be a compile-time constant int. */ | |
1159 | if (TREE_CODE (arg1) != INTEGER_CST) | |
1160 | { | |
1161 | error ("second argument to %<__builtin_prefetch%> must be a constant"); | |
1162 | arg1 = integer_zero_node; | |
1163 | } | |
1164 | op1 = expand_normal (arg1); | |
1165 | /* Argument 1 must be either zero or one. */ | |
1166 | if (INTVAL (op1) != 0 && INTVAL (op1) != 1) | |
1167 | { | |
1168 | warning (0, "invalid second argument to %<__builtin_prefetch%>;" | |
1169 | " using zero"); | |
1170 | op1 = const0_rtx; | |
1171 | } | |
1172 | ||
1173 | /* Argument 2 (locality) must be a compile-time constant int. */ | |
1174 | if (TREE_CODE (arg2) != INTEGER_CST) | |
1175 | { | |
1176 | error ("third argument to %<__builtin_prefetch%> must be a constant"); | |
1177 | arg2 = integer_zero_node; | |
1178 | } | |
1179 | op2 = expand_normal (arg2); | |
1180 | /* Argument 2 must be 0, 1, 2, or 3. */ | |
1181 | if (INTVAL (op2) < 0 || INTVAL (op2) > 3) | |
1182 | { | |
1183 | warning (0, "invalid third argument to %<__builtin_prefetch%>; using zero"); | |
1184 | op2 = const0_rtx; | |
1185 | } | |
1186 | ||
1187 | #ifdef HAVE_prefetch | |
1188 | if (HAVE_prefetch) | |
1189 | { | |
1190 | struct expand_operand ops[3]; | |
1191 | ||
1192 | create_address_operand (&ops[0], op0); | |
1193 | create_integer_operand (&ops[1], INTVAL (op1)); | |
1194 | create_integer_operand (&ops[2], INTVAL (op2)); | |
1195 | if (maybe_expand_insn (CODE_FOR_prefetch, 3, ops)) | |
1196 | return; | |
1197 | } | |
1198 | #endif | |
1199 | ||
1200 | /* Don't do anything with direct references to volatile memory, but | |
1201 | generate code to handle other side effects. */ | |
1202 | if (!MEM_P (op0) && side_effects_p (op0)) | |
1203 | emit_insn (op0); | |
1204 | } | |
1205 | ||
1206 | /* Get a MEM rtx for expression EXP which is the address of an operand | |
1207 | to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is | |
1208 | the maximum length of the block of memory that might be accessed or | |
1209 | NULL if unknown. */ | |
1210 | ||
1211 | static rtx | |
1212 | get_memory_rtx (tree exp, tree len) | |
1213 | { | |
1214 | tree orig_exp = exp; | |
1215 | rtx addr, mem; | |
1216 | HOST_WIDE_INT off; | |
1217 | ||
1218 | /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived | |
1219 | from its expression, for expr->a.b only <variable>.a.b is recorded. */ | |
1220 | if (TREE_CODE (exp) == SAVE_EXPR && !SAVE_EXPR_RESOLVED_P (exp)) | |
1221 | exp = TREE_OPERAND (exp, 0); | |
1222 | ||
1223 | addr = expand_expr (orig_exp, NULL_RTX, ptr_mode, EXPAND_NORMAL); | |
1224 | mem = gen_rtx_MEM (BLKmode, memory_address (BLKmode, addr)); | |
1225 | ||
1226 | /* Get an expression we can use to find the attributes to assign to MEM. | |
1227 | If it is an ADDR_EXPR, use the operand. Otherwise, dereference it if | |
1228 | we can. First remove any nops. */ | |
1229 | while (CONVERT_EXPR_P (exp) | |
1230 | && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0)))) | |
1231 | exp = TREE_OPERAND (exp, 0); | |
1232 | ||
1233 | off = 0; | |
1234 | if (TREE_CODE (exp) == POINTER_PLUS_EXPR | |
1235 | && TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR | |
1236 | && host_integerp (TREE_OPERAND (exp, 1), 0) | |
1237 | && (off = tree_low_cst (TREE_OPERAND (exp, 1), 0)) > 0) | |
1238 | exp = TREE_OPERAND (TREE_OPERAND (exp, 0), 0); | |
1239 | else if (TREE_CODE (exp) == ADDR_EXPR) | |
1240 | exp = TREE_OPERAND (exp, 0); | |
1241 | else if (POINTER_TYPE_P (TREE_TYPE (exp))) | |
1242 | exp = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (exp)), exp); | |
1243 | else | |
1244 | exp = NULL; | |
1245 | ||
1246 | /* Honor attributes derived from exp, except for the alias set | |
1247 | (as builtin stringops may alias with anything) and the size | |
1248 | (as stringops may access multiple array elements). */ | |
1249 | if (exp) | |
1250 | { | |
1251 | set_mem_attributes (mem, exp, 0); | |
1252 | ||
1253 | if (off) | |
1254 | mem = adjust_automodify_address_nv (mem, BLKmode, NULL, off); | |
1255 | ||
1256 | /* Allow the string and memory builtins to overflow from one | |
1257 | field into another, see http://gcc.gnu.org/PR23561. | |
1258 | Thus avoid COMPONENT_REFs in MEM_EXPR unless we know the whole | |
1259 | memory accessed by the string or memory builtin will fit | |
1260 | within the field. */ | |
1261 | if (MEM_EXPR (mem) && TREE_CODE (MEM_EXPR (mem)) == COMPONENT_REF) | |
1262 | { | |
1263 | tree mem_expr = MEM_EXPR (mem); | |
1264 | HOST_WIDE_INT offset = -1, length = -1; | |
1265 | tree inner = exp; | |
1266 | ||
1267 | while (TREE_CODE (inner) == ARRAY_REF | |
1268 | || CONVERT_EXPR_P (inner) | |
1269 | || TREE_CODE (inner) == VIEW_CONVERT_EXPR | |
1270 | || TREE_CODE (inner) == SAVE_EXPR) | |
1271 | inner = TREE_OPERAND (inner, 0); | |
1272 | ||
1273 | gcc_assert (TREE_CODE (inner) == COMPONENT_REF); | |
1274 | ||
1275 | if (MEM_OFFSET_KNOWN_P (mem)) | |
1276 | offset = MEM_OFFSET (mem); | |
1277 | ||
1278 | if (offset >= 0 && len && host_integerp (len, 0)) | |
1279 | length = tree_low_cst (len, 0); | |
1280 | ||
1281 | while (TREE_CODE (inner) == COMPONENT_REF) | |
1282 | { | |
1283 | tree field = TREE_OPERAND (inner, 1); | |
1284 | gcc_assert (TREE_CODE (mem_expr) == COMPONENT_REF); | |
1285 | gcc_assert (field == TREE_OPERAND (mem_expr, 1)); | |
1286 | ||
1287 | /* Bitfields are generally not byte-addressable. */ | |
1288 | gcc_assert (!DECL_BIT_FIELD (field) | |
1289 | || ((tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1) | |
1290 | % BITS_PER_UNIT) == 0 | |
1291 | && host_integerp (DECL_SIZE (field), 0) | |
1292 | && (TREE_INT_CST_LOW (DECL_SIZE (field)) | |
1293 | % BITS_PER_UNIT) == 0)); | |
1294 | ||
1295 | /* If we can prove that the memory starting at XEXP (mem, 0) and | |
1296 | ending at XEXP (mem, 0) + LENGTH will fit into this field, we | |
1297 | can keep the COMPONENT_REF in MEM_EXPR. But be careful with | |
1298 | fields without DECL_SIZE_UNIT like flexible array members. */ | |
1299 | if (length >= 0 | |
1300 | && DECL_SIZE_UNIT (field) | |
1301 | && host_integerp (DECL_SIZE_UNIT (field), 0)) | |
1302 | { | |
1303 | HOST_WIDE_INT size | |
1304 | = TREE_INT_CST_LOW (DECL_SIZE_UNIT (field)); | |
1305 | if (offset <= size | |
1306 | && length <= size | |
1307 | && offset + length <= size) | |
1308 | break; | |
1309 | } | |
1310 | ||
1311 | if (offset >= 0 | |
1312 | && host_integerp (DECL_FIELD_OFFSET (field), 0)) | |
1313 | offset += TREE_INT_CST_LOW (DECL_FIELD_OFFSET (field)) | |
1314 | + tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1) | |
1315 | / BITS_PER_UNIT; | |
1316 | else | |
1317 | { | |
1318 | offset = -1; | |
1319 | length = -1; | |
1320 | } | |
1321 | ||
1322 | mem_expr = TREE_OPERAND (mem_expr, 0); | |
1323 | inner = TREE_OPERAND (inner, 0); | |
1324 | } | |
1325 | ||
1326 | if (mem_expr == NULL) | |
1327 | offset = -1; | |
1328 | if (mem_expr != MEM_EXPR (mem)) | |
1329 | { | |
1330 | set_mem_expr (mem, mem_expr); | |
1331 | if (offset >= 0) | |
1332 | set_mem_offset (mem, offset); | |
1333 | else | |
1334 | clear_mem_offset (mem); | |
1335 | } | |
1336 | } | |
1337 | set_mem_alias_set (mem, 0); | |
1338 | clear_mem_size (mem); | |
1339 | } | |
1340 | ||
1341 | return mem; | |
1342 | } | |
1343 | \f | |
1344 | /* Built-in functions to perform an untyped call and return. */ | |
1345 | ||
1346 | #define apply_args_mode \ | |
1347 | (this_target_builtins->x_apply_args_mode) | |
1348 | #define apply_result_mode \ | |
1349 | (this_target_builtins->x_apply_result_mode) | |
1350 | ||
1351 | /* Return the size required for the block returned by __builtin_apply_args, | |
1352 | and initialize apply_args_mode. */ | |
1353 | ||
1354 | static int | |
1355 | apply_args_size (void) | |
1356 | { | |
1357 | static int size = -1; | |
1358 | int align; | |
1359 | unsigned int regno; | |
1360 | enum machine_mode mode; | |
1361 | ||
1362 | /* The values computed by this function never change. */ | |
1363 | if (size < 0) | |
1364 | { | |
1365 | /* The first value is the incoming arg-pointer. */ | |
1366 | size = GET_MODE_SIZE (Pmode); | |
1367 | ||
1368 | /* The second value is the structure value address unless this is | |
1369 | passed as an "invisible" first argument. */ | |
1370 | if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0)) | |
1371 | size += GET_MODE_SIZE (Pmode); | |
1372 | ||
1373 | for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) | |
1374 | if (FUNCTION_ARG_REGNO_P (regno)) | |
1375 | { | |
1376 | mode = targetm.calls.get_raw_arg_mode (regno); | |
1377 | ||
1378 | gcc_assert (mode != VOIDmode); | |
1379 | ||
1380 | align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT; | |
1381 | if (size % align != 0) | |
1382 | size = CEIL (size, align) * align; | |
1383 | size += GET_MODE_SIZE (mode); | |
1384 | apply_args_mode[regno] = mode; | |
1385 | } | |
1386 | else | |
1387 | { | |
1388 | apply_args_mode[regno] = VOIDmode; | |
1389 | } | |
1390 | } | |
1391 | return size; | |
1392 | } | |
1393 | ||
1394 | /* Return the size required for the block returned by __builtin_apply, | |
1395 | and initialize apply_result_mode. */ | |
1396 | ||
1397 | static int | |
1398 | apply_result_size (void) | |
1399 | { | |
1400 | static int size = -1; | |
1401 | int align, regno; | |
1402 | enum machine_mode mode; | |
1403 | ||
1404 | /* The values computed by this function never change. */ | |
1405 | if (size < 0) | |
1406 | { | |
1407 | size = 0; | |
1408 | ||
1409 | for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) | |
1410 | if (targetm.calls.function_value_regno_p (regno)) | |
1411 | { | |
1412 | mode = targetm.calls.get_raw_result_mode (regno); | |
1413 | ||
1414 | gcc_assert (mode != VOIDmode); | |
1415 | ||
1416 | align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT; | |
1417 | if (size % align != 0) | |
1418 | size = CEIL (size, align) * align; | |
1419 | size += GET_MODE_SIZE (mode); | |
1420 | apply_result_mode[regno] = mode; | |
1421 | } | |
1422 | else | |
1423 | apply_result_mode[regno] = VOIDmode; | |
1424 | ||
1425 | /* Allow targets that use untyped_call and untyped_return to override | |
1426 | the size so that machine-specific information can be stored here. */ | |
1427 | #ifdef APPLY_RESULT_SIZE | |
1428 | size = APPLY_RESULT_SIZE; | |
1429 | #endif | |
1430 | } | |
1431 | return size; | |
1432 | } | |
1433 | ||
1434 | #if defined (HAVE_untyped_call) || defined (HAVE_untyped_return) | |
1435 | /* Create a vector describing the result block RESULT. If SAVEP is true, | |
1436 | the result block is used to save the values; otherwise it is used to | |
1437 | restore the values. */ | |
1438 | ||
1439 | static rtx | |
1440 | result_vector (int savep, rtx result) | |
1441 | { | |
1442 | int regno, size, align, nelts; | |
1443 | enum machine_mode mode; | |
1444 | rtx reg, mem; | |
1445 | rtx *savevec = XALLOCAVEC (rtx, FIRST_PSEUDO_REGISTER); | |
1446 | ||
1447 | size = nelts = 0; | |
1448 | for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) | |
1449 | if ((mode = apply_result_mode[regno]) != VOIDmode) | |
1450 | { | |
1451 | align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT; | |
1452 | if (size % align != 0) | |
1453 | size = CEIL (size, align) * align; | |
1454 | reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno)); | |
1455 | mem = adjust_address (result, mode, size); | |
1456 | savevec[nelts++] = (savep | |
1457 | ? gen_rtx_SET (VOIDmode, mem, reg) | |
1458 | : gen_rtx_SET (VOIDmode, reg, mem)); | |
1459 | size += GET_MODE_SIZE (mode); | |
1460 | } | |
1461 | return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec)); | |
1462 | } | |
1463 | #endif /* HAVE_untyped_call or HAVE_untyped_return */ | |
1464 | ||
1465 | /* Save the state required to perform an untyped call with the same | |
1466 | arguments as were passed to the current function. */ | |
1467 | ||
1468 | static rtx | |
1469 | expand_builtin_apply_args_1 (void) | |
1470 | { | |
1471 | rtx registers, tem; | |
1472 | int size, align, regno; | |
1473 | enum machine_mode mode; | |
1474 | rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1); | |
1475 | ||
1476 | /* Create a block where the arg-pointer, structure value address, | |
1477 | and argument registers can be saved. */ | |
1478 | registers = assign_stack_local (BLKmode, apply_args_size (), -1); | |
1479 | ||
1480 | /* Walk past the arg-pointer and structure value address. */ | |
1481 | size = GET_MODE_SIZE (Pmode); | |
1482 | if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0)) | |
1483 | size += GET_MODE_SIZE (Pmode); | |
1484 | ||
1485 | /* Save each register used in calling a function to the block. */ | |
1486 | for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) | |
1487 | if ((mode = apply_args_mode[regno]) != VOIDmode) | |
1488 | { | |
1489 | align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT; | |
1490 | if (size % align != 0) | |
1491 | size = CEIL (size, align) * align; | |
1492 | ||
1493 | tem = gen_rtx_REG (mode, INCOMING_REGNO (regno)); | |
1494 | ||
1495 | emit_move_insn (adjust_address (registers, mode, size), tem); | |
1496 | size += GET_MODE_SIZE (mode); | |
1497 | } | |
1498 | ||
1499 | /* Save the arg pointer to the block. */ | |
1500 | tem = copy_to_reg (crtl->args.internal_arg_pointer); | |
1501 | #ifdef STACK_GROWS_DOWNWARD | |
1502 | /* We need the pointer as the caller actually passed them to us, not | |
1503 | as we might have pretended they were passed. Make sure it's a valid | |
1504 | operand, as emit_move_insn isn't expected to handle a PLUS. */ | |
1505 | tem | |
1506 | = force_operand (plus_constant (tem, crtl->args.pretend_args_size), | |
1507 | NULL_RTX); | |
1508 | #endif | |
1509 | emit_move_insn (adjust_address (registers, Pmode, 0), tem); | |
1510 | ||
1511 | size = GET_MODE_SIZE (Pmode); | |
1512 | ||
1513 | /* Save the structure value address unless this is passed as an | |
1514 | "invisible" first argument. */ | |
1515 | if (struct_incoming_value) | |
1516 | { | |
1517 | emit_move_insn (adjust_address (registers, Pmode, size), | |
1518 | copy_to_reg (struct_incoming_value)); | |
1519 | size += GET_MODE_SIZE (Pmode); | |
1520 | } | |
1521 | ||
1522 | /* Return the address of the block. */ | |
1523 | return copy_addr_to_reg (XEXP (registers, 0)); | |
1524 | } | |
1525 | ||
1526 | /* __builtin_apply_args returns block of memory allocated on | |
1527 | the stack into which is stored the arg pointer, structure | |
1528 | value address, static chain, and all the registers that might | |
1529 | possibly be used in performing a function call. The code is | |
1530 | moved to the start of the function so the incoming values are | |
1531 | saved. */ | |
1532 | ||
1533 | static rtx | |
1534 | expand_builtin_apply_args (void) | |
1535 | { | |
1536 | /* Don't do __builtin_apply_args more than once in a function. | |
1537 | Save the result of the first call and reuse it. */ | |
1538 | if (apply_args_value != 0) | |
1539 | return apply_args_value; | |
1540 | { | |
1541 | /* When this function is called, it means that registers must be | |
1542 | saved on entry to this function. So we migrate the | |
1543 | call to the first insn of this function. */ | |
1544 | rtx temp; | |
1545 | rtx seq; | |
1546 | ||
1547 | start_sequence (); | |
1548 | temp = expand_builtin_apply_args_1 (); | |
1549 | seq = get_insns (); | |
1550 | end_sequence (); | |
1551 | ||
1552 | apply_args_value = temp; | |
1553 | ||
1554 | /* Put the insns after the NOTE that starts the function. | |
1555 | If this is inside a start_sequence, make the outer-level insn | |
1556 | chain current, so the code is placed at the start of the | |
1557 | function. If internal_arg_pointer is a non-virtual pseudo, | |
1558 | it needs to be placed after the function that initializes | |
1559 | that pseudo. */ | |
1560 | push_topmost_sequence (); | |
1561 | if (REG_P (crtl->args.internal_arg_pointer) | |
1562 | && REGNO (crtl->args.internal_arg_pointer) > LAST_VIRTUAL_REGISTER) | |
1563 | emit_insn_before (seq, parm_birth_insn); | |
1564 | else | |
1565 | emit_insn_before (seq, NEXT_INSN (entry_of_function ())); | |
1566 | pop_topmost_sequence (); | |
1567 | return temp; | |
1568 | } | |
1569 | } | |
1570 | ||
1571 | /* Perform an untyped call and save the state required to perform an | |
1572 | untyped return of whatever value was returned by the given function. */ | |
1573 | ||
1574 | static rtx | |
1575 | expand_builtin_apply (rtx function, rtx arguments, rtx argsize) | |
1576 | { | |
1577 | int size, align, regno; | |
1578 | enum machine_mode mode; | |
1579 | rtx incoming_args, result, reg, dest, src, call_insn; | |
1580 | rtx old_stack_level = 0; | |
1581 | rtx call_fusage = 0; | |
1582 | rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0); | |
1583 | ||
1584 | arguments = convert_memory_address (Pmode, arguments); | |
1585 | ||
1586 | /* Create a block where the return registers can be saved. */ | |
1587 | result = assign_stack_local (BLKmode, apply_result_size (), -1); | |
1588 | ||
1589 | /* Fetch the arg pointer from the ARGUMENTS block. */ | |
1590 | incoming_args = gen_reg_rtx (Pmode); | |
1591 | emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments)); | |
1592 | #ifndef STACK_GROWS_DOWNWARD | |
1593 | incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize, | |
1594 | incoming_args, 0, OPTAB_LIB_WIDEN); | |
1595 | #endif | |
1596 | ||
1597 | /* Push a new argument block and copy the arguments. Do not allow | |
1598 | the (potential) memcpy call below to interfere with our stack | |
1599 | manipulations. */ | |
1600 | do_pending_stack_adjust (); | |
1601 | NO_DEFER_POP; | |
1602 | ||
1603 | /* Save the stack with nonlocal if available. */ | |
1604 | #ifdef HAVE_save_stack_nonlocal | |
1605 | if (HAVE_save_stack_nonlocal) | |
1606 | emit_stack_save (SAVE_NONLOCAL, &old_stack_level); | |
1607 | else | |
1608 | #endif | |
1609 | emit_stack_save (SAVE_BLOCK, &old_stack_level); | |
1610 | ||
1611 | /* Allocate a block of memory onto the stack and copy the memory | |
1612 | arguments to the outgoing arguments address. We can pass TRUE | |
1613 | as the 4th argument because we just saved the stack pointer | |
1614 | and will restore it right after the call. */ | |
1615 | allocate_dynamic_stack_space (argsize, 0, BIGGEST_ALIGNMENT, true); | |
1616 | ||
1617 | /* Set DRAP flag to true, even though allocate_dynamic_stack_space | |
1618 | may have already set current_function_calls_alloca to true. | |
1619 | current_function_calls_alloca won't be set if argsize is zero, | |
1620 | so we have to guarantee need_drap is true here. */ | |
1621 | if (SUPPORTS_STACK_ALIGNMENT) | |
1622 | crtl->need_drap = true; | |
1623 | ||
1624 | dest = virtual_outgoing_args_rtx; | |
1625 | #ifndef STACK_GROWS_DOWNWARD | |
1626 | if (CONST_INT_P (argsize)) | |
1627 | dest = plus_constant (dest, -INTVAL (argsize)); | |
1628 | else | |
1629 | dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize)); | |
1630 | #endif | |
1631 | dest = gen_rtx_MEM (BLKmode, dest); | |
1632 | set_mem_align (dest, PARM_BOUNDARY); | |
1633 | src = gen_rtx_MEM (BLKmode, incoming_args); | |
1634 | set_mem_align (src, PARM_BOUNDARY); | |
1635 | emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL); | |
1636 | ||
1637 | /* Refer to the argument block. */ | |
1638 | apply_args_size (); | |
1639 | arguments = gen_rtx_MEM (BLKmode, arguments); | |
1640 | set_mem_align (arguments, PARM_BOUNDARY); | |
1641 | ||
1642 | /* Walk past the arg-pointer and structure value address. */ | |
1643 | size = GET_MODE_SIZE (Pmode); | |
1644 | if (struct_value) | |
1645 | size += GET_MODE_SIZE (Pmode); | |
1646 | ||
1647 | /* Restore each of the registers previously saved. Make USE insns | |
1648 | for each of these registers for use in making the call. */ | |
1649 | for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) | |
1650 | if ((mode = apply_args_mode[regno]) != VOIDmode) | |
1651 | { | |
1652 | align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT; | |
1653 | if (size % align != 0) | |
1654 | size = CEIL (size, align) * align; | |
1655 | reg = gen_rtx_REG (mode, regno); | |
1656 | emit_move_insn (reg, adjust_address (arguments, mode, size)); | |
1657 | use_reg (&call_fusage, reg); | |
1658 | size += GET_MODE_SIZE (mode); | |
1659 | } | |
1660 | ||
1661 | /* Restore the structure value address unless this is passed as an | |
1662 | "invisible" first argument. */ | |
1663 | size = GET_MODE_SIZE (Pmode); | |
1664 | if (struct_value) | |
1665 | { | |
1666 | rtx value = gen_reg_rtx (Pmode); | |
1667 | emit_move_insn (value, adjust_address (arguments, Pmode, size)); | |
1668 | emit_move_insn (struct_value, value); | |
1669 | if (REG_P (struct_value)) | |
1670 | use_reg (&call_fusage, struct_value); | |
1671 | size += GET_MODE_SIZE (Pmode); | |
1672 | } | |
1673 | ||
1674 | /* All arguments and registers used for the call are set up by now! */ | |
1675 | function = prepare_call_address (NULL, function, NULL, &call_fusage, 0, 0); | |
1676 | ||
1677 | /* Ensure address is valid. SYMBOL_REF is already valid, so no need, | |
1678 | and we don't want to load it into a register as an optimization, | |
1679 | because prepare_call_address already did it if it should be done. */ | |
1680 | if (GET_CODE (function) != SYMBOL_REF) | |
1681 | function = memory_address (FUNCTION_MODE, function); | |
1682 | ||
1683 | /* Generate the actual call instruction and save the return value. */ | |
1684 | #ifdef HAVE_untyped_call | |
1685 | if (HAVE_untyped_call) | |
1686 | emit_call_insn (gen_untyped_call (gen_rtx_MEM (FUNCTION_MODE, function), | |
1687 | result, result_vector (1, result))); | |
1688 | else | |
1689 | #endif | |
1690 | #ifdef HAVE_call_value | |
1691 | if (HAVE_call_value) | |
1692 | { | |
1693 | rtx valreg = 0; | |
1694 | ||
1695 | /* Locate the unique return register. It is not possible to | |
1696 | express a call that sets more than one return register using | |
1697 | call_value; use untyped_call for that. In fact, untyped_call | |
1698 | only needs to save the return registers in the given block. */ | |
1699 | for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) | |
1700 | if ((mode = apply_result_mode[regno]) != VOIDmode) | |
1701 | { | |
1702 | gcc_assert (!valreg); /* HAVE_untyped_call required. */ | |
1703 | ||
1704 | valreg = gen_rtx_REG (mode, regno); | |
1705 | } | |
1706 | ||
1707 | emit_call_insn (GEN_CALL_VALUE (valreg, | |
1708 | gen_rtx_MEM (FUNCTION_MODE, function), | |
1709 | const0_rtx, NULL_RTX, const0_rtx)); | |
1710 | ||
1711 | emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg); | |
1712 | } | |
1713 | else | |
1714 | #endif | |
1715 | gcc_unreachable (); | |
1716 | ||
1717 | /* Find the CALL insn we just emitted, and attach the register usage | |
1718 | information. */ | |
1719 | call_insn = last_call_insn (); | |
1720 | add_function_usage_to (call_insn, call_fusage); | |
1721 | ||
1722 | /* Restore the stack. */ | |
1723 | #ifdef HAVE_save_stack_nonlocal | |
1724 | if (HAVE_save_stack_nonlocal) | |
1725 | emit_stack_restore (SAVE_NONLOCAL, old_stack_level); | |
1726 | else | |
1727 | #endif | |
1728 | emit_stack_restore (SAVE_BLOCK, old_stack_level); | |
1729 | fixup_args_size_notes (call_insn, get_last_insn(), 0); | |
1730 | ||
1731 | OK_DEFER_POP; | |
1732 | ||
1733 | /* Return the address of the result block. */ | |
1734 | result = copy_addr_to_reg (XEXP (result, 0)); | |
1735 | return convert_memory_address (ptr_mode, result); | |
1736 | } | |
1737 | ||
1738 | /* Perform an untyped return. */ | |
1739 | ||
1740 | static void | |
1741 | expand_builtin_return (rtx result) | |
1742 | { | |
1743 | int size, align, regno; | |
1744 | enum machine_mode mode; | |
1745 | rtx reg; | |
1746 | rtx call_fusage = 0; | |
1747 | ||
1748 | result = convert_memory_address (Pmode, result); | |
1749 | ||
1750 | apply_result_size (); | |
1751 | result = gen_rtx_MEM (BLKmode, result); | |
1752 | ||
1753 | #ifdef HAVE_untyped_return | |
1754 | if (HAVE_untyped_return) | |
1755 | { | |
1756 | emit_jump_insn (gen_untyped_return (result, result_vector (0, result))); | |
1757 | emit_barrier (); | |
1758 | return; | |
1759 | } | |
1760 | #endif | |
1761 | ||
1762 | /* Restore the return value and note that each value is used. */ | |
1763 | size = 0; | |
1764 | for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++) | |
1765 | if ((mode = apply_result_mode[regno]) != VOIDmode) | |
1766 | { | |
1767 | align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT; | |
1768 | if (size % align != 0) | |
1769 | size = CEIL (size, align) * align; | |
1770 | reg = gen_rtx_REG (mode, INCOMING_REGNO (regno)); | |
1771 | emit_move_insn (reg, adjust_address (result, mode, size)); | |
1772 | ||
1773 | push_to_sequence (call_fusage); | |
1774 | emit_use (reg); | |
1775 | call_fusage = get_insns (); | |
1776 | end_sequence (); | |
1777 | size += GET_MODE_SIZE (mode); | |
1778 | } | |
1779 | ||
1780 | /* Put the USE insns before the return. */ | |
1781 | emit_insn (call_fusage); | |
1782 | ||
1783 | /* Return whatever values was restored by jumping directly to the end | |
1784 | of the function. */ | |
1785 | expand_naked_return (); | |
1786 | } | |
1787 | ||
1788 | /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */ | |
1789 | ||
1790 | static enum type_class | |
1791 | type_to_class (tree type) | |
1792 | { | |
1793 | switch (TREE_CODE (type)) | |
1794 | { | |
1795 | case VOID_TYPE: return void_type_class; | |
1796 | case INTEGER_TYPE: return integer_type_class; | |
1797 | case ENUMERAL_TYPE: return enumeral_type_class; | |
1798 | case BOOLEAN_TYPE: return boolean_type_class; | |
1799 | case POINTER_TYPE: return pointer_type_class; | |
1800 | case REFERENCE_TYPE: return reference_type_class; | |
1801 | case OFFSET_TYPE: return offset_type_class; | |
1802 | case REAL_TYPE: return real_type_class; | |
1803 | case COMPLEX_TYPE: return complex_type_class; | |
1804 | case FUNCTION_TYPE: return function_type_class; | |
1805 | case METHOD_TYPE: return method_type_class; | |
1806 | case RECORD_TYPE: return record_type_class; | |
1807 | case UNION_TYPE: | |
1808 | case QUAL_UNION_TYPE: return union_type_class; | |
1809 | case ARRAY_TYPE: return (TYPE_STRING_FLAG (type) | |
1810 | ? string_type_class : array_type_class); | |
1811 | case LANG_TYPE: return lang_type_class; | |
1812 | default: return no_type_class; | |
1813 | } | |
1814 | } | |
1815 | ||
1816 | /* Expand a call EXP to __builtin_classify_type. */ | |
1817 | ||
1818 | static rtx | |
1819 | expand_builtin_classify_type (tree exp) | |
1820 | { | |
1821 | if (call_expr_nargs (exp)) | |
1822 | return GEN_INT (type_to_class (TREE_TYPE (CALL_EXPR_ARG (exp, 0)))); | |
1823 | return GEN_INT (no_type_class); | |
1824 | } | |
1825 | ||
1826 | /* This helper macro, meant to be used in mathfn_built_in below, | |
1827 | determines which among a set of three builtin math functions is | |
1828 | appropriate for a given type mode. The `F' and `L' cases are | |
1829 | automatically generated from the `double' case. */ | |
1830 | #define CASE_MATHFN(BUILT_IN_MATHFN) \ | |
1831 | case BUILT_IN_MATHFN: case BUILT_IN_MATHFN##F: case BUILT_IN_MATHFN##L: \ | |
1832 | fcode = BUILT_IN_MATHFN; fcodef = BUILT_IN_MATHFN##F ; \ | |
1833 | fcodel = BUILT_IN_MATHFN##L ; break; | |
1834 | /* Similar to above, but appends _R after any F/L suffix. */ | |
1835 | #define CASE_MATHFN_REENT(BUILT_IN_MATHFN) \ | |
1836 | case BUILT_IN_MATHFN##_R: case BUILT_IN_MATHFN##F_R: case BUILT_IN_MATHFN##L_R: \ | |
1837 | fcode = BUILT_IN_MATHFN##_R; fcodef = BUILT_IN_MATHFN##F_R ; \ | |
1838 | fcodel = BUILT_IN_MATHFN##L_R ; break; | |
1839 | ||
1840 | /* Return mathematic function equivalent to FN but operating directly on TYPE, | |
1841 | if available. If IMPLICIT is true use the implicit builtin declaration, | |
1842 | otherwise use the explicit declaration. If we can't do the conversion, | |
1843 | return zero. */ | |
1844 | ||
1845 | static tree | |
1846 | mathfn_built_in_1 (tree type, enum built_in_function fn, bool implicit_p) | |
1847 | { | |
1848 | enum built_in_function fcode, fcodef, fcodel, fcode2; | |
1849 | ||
1850 | switch (fn) | |
1851 | { | |
1852 | CASE_MATHFN (BUILT_IN_ACOS) | |
1853 | CASE_MATHFN (BUILT_IN_ACOSH) | |
1854 | CASE_MATHFN (BUILT_IN_ASIN) | |
1855 | CASE_MATHFN (BUILT_IN_ASINH) | |
1856 | CASE_MATHFN (BUILT_IN_ATAN) | |
1857 | CASE_MATHFN (BUILT_IN_ATAN2) | |
1858 | CASE_MATHFN (BUILT_IN_ATANH) | |
1859 | CASE_MATHFN (BUILT_IN_CBRT) | |
1860 | CASE_MATHFN (BUILT_IN_CEIL) | |
1861 | CASE_MATHFN (BUILT_IN_CEXPI) | |
1862 | CASE_MATHFN (BUILT_IN_COPYSIGN) | |
1863 | CASE_MATHFN (BUILT_IN_COS) | |
1864 | CASE_MATHFN (BUILT_IN_COSH) | |
1865 | CASE_MATHFN (BUILT_IN_DREM) | |
1866 | CASE_MATHFN (BUILT_IN_ERF) | |
1867 | CASE_MATHFN (BUILT_IN_ERFC) | |
1868 | CASE_MATHFN (BUILT_IN_EXP) | |
1869 | CASE_MATHFN (BUILT_IN_EXP10) | |
1870 | CASE_MATHFN (BUILT_IN_EXP2) | |
1871 | CASE_MATHFN (BUILT_IN_EXPM1) | |
1872 | CASE_MATHFN (BUILT_IN_FABS) | |
1873 | CASE_MATHFN (BUILT_IN_FDIM) | |
1874 | CASE_MATHFN (BUILT_IN_FLOOR) | |
1875 | CASE_MATHFN (BUILT_IN_FMA) | |
1876 | CASE_MATHFN (BUILT_IN_FMAX) | |
1877 | CASE_MATHFN (BUILT_IN_FMIN) | |
1878 | CASE_MATHFN (BUILT_IN_FMOD) | |
1879 | CASE_MATHFN (BUILT_IN_FREXP) | |
1880 | CASE_MATHFN (BUILT_IN_GAMMA) | |
1881 | CASE_MATHFN_REENT (BUILT_IN_GAMMA) /* GAMMA_R */ | |
1882 | CASE_MATHFN (BUILT_IN_HUGE_VAL) | |
1883 | CASE_MATHFN (BUILT_IN_HYPOT) | |
1884 | CASE_MATHFN (BUILT_IN_ILOGB) | |
1885 | CASE_MATHFN (BUILT_IN_ICEIL) | |
1886 | CASE_MATHFN (BUILT_IN_IFLOOR) | |
1887 | CASE_MATHFN (BUILT_IN_INF) | |
1888 | CASE_MATHFN (BUILT_IN_IRINT) | |
1889 | CASE_MATHFN (BUILT_IN_IROUND) | |
1890 | CASE_MATHFN (BUILT_IN_ISINF) | |
1891 | CASE_MATHFN (BUILT_IN_J0) | |
1892 | CASE_MATHFN (BUILT_IN_J1) | |
1893 | CASE_MATHFN (BUILT_IN_JN) | |
1894 | CASE_MATHFN (BUILT_IN_LCEIL) | |
1895 | CASE_MATHFN (BUILT_IN_LDEXP) | |
1896 | CASE_MATHFN (BUILT_IN_LFLOOR) | |
1897 | CASE_MATHFN (BUILT_IN_LGAMMA) | |
1898 | CASE_MATHFN_REENT (BUILT_IN_LGAMMA) /* LGAMMA_R */ | |
1899 | CASE_MATHFN (BUILT_IN_LLCEIL) | |
1900 | CASE_MATHFN (BUILT_IN_LLFLOOR) | |
1901 | CASE_MATHFN (BUILT_IN_LLRINT) | |
1902 | CASE_MATHFN (BUILT_IN_LLROUND) | |
1903 | CASE_MATHFN (BUILT_IN_LOG) | |
1904 | CASE_MATHFN (BUILT_IN_LOG10) | |
1905 | CASE_MATHFN (BUILT_IN_LOG1P) | |
1906 | CASE_MATHFN (BUILT_IN_LOG2) | |
1907 | CASE_MATHFN (BUILT_IN_LOGB) | |
1908 | CASE_MATHFN (BUILT_IN_LRINT) | |
1909 | CASE_MATHFN (BUILT_IN_LROUND) | |
1910 | CASE_MATHFN (BUILT_IN_MODF) | |
1911 | CASE_MATHFN (BUILT_IN_NAN) | |
1912 | CASE_MATHFN (BUILT_IN_NANS) | |
1913 | CASE_MATHFN (BUILT_IN_NEARBYINT) | |
1914 | CASE_MATHFN (BUILT_IN_NEXTAFTER) | |
1915 | CASE_MATHFN (BUILT_IN_NEXTTOWARD) | |
1916 | CASE_MATHFN (BUILT_IN_POW) | |
1917 | CASE_MATHFN (BUILT_IN_POWI) | |
1918 | CASE_MATHFN (BUILT_IN_POW10) | |
1919 | CASE_MATHFN (BUILT_IN_REMAINDER) | |
1920 | CASE_MATHFN (BUILT_IN_REMQUO) | |
1921 | CASE_MATHFN (BUILT_IN_RINT) | |
1922 | CASE_MATHFN (BUILT_IN_ROUND) | |
1923 | CASE_MATHFN (BUILT_IN_SCALB) | |
1924 | CASE_MATHFN (BUILT_IN_SCALBLN) | |
1925 | CASE_MATHFN (BUILT_IN_SCALBN) | |
1926 | CASE_MATHFN (BUILT_IN_SIGNBIT) | |
1927 | CASE_MATHFN (BUILT_IN_SIGNIFICAND) | |
1928 | CASE_MATHFN (BUILT_IN_SIN) | |
1929 | CASE_MATHFN (BUILT_IN_SINCOS) | |
1930 | CASE_MATHFN (BUILT_IN_SINH) | |
1931 | CASE_MATHFN (BUILT_IN_SQRT) | |
1932 | CASE_MATHFN (BUILT_IN_TAN) | |
1933 | CASE_MATHFN (BUILT_IN_TANH) | |
1934 | CASE_MATHFN (BUILT_IN_TGAMMA) | |
1935 | CASE_MATHFN (BUILT_IN_TRUNC) | |
1936 | CASE_MATHFN (BUILT_IN_Y0) | |
1937 | CASE_MATHFN (BUILT_IN_Y1) | |
1938 | CASE_MATHFN (BUILT_IN_YN) | |
1939 | ||
1940 | default: | |
1941 | return NULL_TREE; | |
1942 | } | |
1943 | ||
1944 | if (TYPE_MAIN_VARIANT (type) == double_type_node) | |
1945 | fcode2 = fcode; | |
1946 | else if (TYPE_MAIN_VARIANT (type) == float_type_node) | |
1947 | fcode2 = fcodef; | |
1948 | else if (TYPE_MAIN_VARIANT (type) == long_double_type_node) | |
1949 | fcode2 = fcodel; | |
1950 | else | |
1951 | return NULL_TREE; | |
1952 | ||
1953 | if (implicit_p && !builtin_decl_implicit_p (fcode2)) | |
1954 | return NULL_TREE; | |
1955 | ||
1956 | return builtin_decl_explicit (fcode2); | |
1957 | } | |
1958 | ||
1959 | /* Like mathfn_built_in_1(), but always use the implicit array. */ | |
1960 | ||
1961 | tree | |
1962 | mathfn_built_in (tree type, enum built_in_function fn) | |
1963 | { | |
1964 | return mathfn_built_in_1 (type, fn, /*implicit=*/ 1); | |
1965 | } | |
1966 | ||
1967 | /* If errno must be maintained, expand the RTL to check if the result, | |
1968 | TARGET, of a built-in function call, EXP, is NaN, and if so set | |
1969 | errno to EDOM. */ | |
1970 | ||
1971 | static void | |
1972 | expand_errno_check (tree exp, rtx target) | |
1973 | { | |
1974 | rtx lab = gen_label_rtx (); | |
1975 | ||
1976 | /* Test the result; if it is NaN, set errno=EDOM because | |
1977 | the argument was not in the domain. */ | |
1978 | do_compare_rtx_and_jump (target, target, EQ, 0, GET_MODE (target), | |
1979 | NULL_RTX, NULL_RTX, lab, | |
1980 | /* The jump is very likely. */ | |
1981 | REG_BR_PROB_BASE - (REG_BR_PROB_BASE / 2000 - 1)); | |
1982 | ||
1983 | #ifdef TARGET_EDOM | |
1984 | /* If this built-in doesn't throw an exception, set errno directly. */ | |
1985 | if (TREE_NOTHROW (TREE_OPERAND (CALL_EXPR_FN (exp), 0))) | |
1986 | { | |
1987 | #ifdef GEN_ERRNO_RTX | |
1988 | rtx errno_rtx = GEN_ERRNO_RTX; | |
1989 | #else | |
1990 | rtx errno_rtx | |
1991 | = gen_rtx_MEM (word_mode, gen_rtx_SYMBOL_REF (Pmode, "errno")); | |
1992 | #endif | |
1993 | emit_move_insn (errno_rtx, GEN_INT (TARGET_EDOM)); | |
1994 | emit_label (lab); | |
1995 | return; | |
1996 | } | |
1997 | #endif | |
1998 | ||
1999 | /* Make sure the library call isn't expanded as a tail call. */ | |
2000 | CALL_EXPR_TAILCALL (exp) = 0; | |
2001 | ||
2002 | /* We can't set errno=EDOM directly; let the library call do it. | |
2003 | Pop the arguments right away in case the call gets deleted. */ | |
2004 | NO_DEFER_POP; | |
2005 | expand_call (exp, target, 0); | |
2006 | OK_DEFER_POP; | |
2007 | emit_label (lab); | |
2008 | } | |
2009 | ||
2010 | /* Expand a call to one of the builtin math functions (sqrt, exp, or log). | |
2011 | Return NULL_RTX if a normal call should be emitted rather than expanding | |
2012 | the function in-line. EXP is the expression that is a call to the builtin | |
2013 | function; if convenient, the result should be placed in TARGET. | |
2014 | SUBTARGET may be used as the target for computing one of EXP's operands. */ | |
2015 | ||
2016 | static rtx | |
2017 | expand_builtin_mathfn (tree exp, rtx target, rtx subtarget) | |
2018 | { | |
2019 | optab builtin_optab; | |
2020 | rtx op0, insns; | |
2021 | tree fndecl = get_callee_fndecl (exp); | |
2022 | enum machine_mode mode; | |
2023 | bool errno_set = false; | |
2024 | tree arg; | |
2025 | ||
2026 | if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE)) | |
2027 | return NULL_RTX; | |
2028 | ||
2029 | arg = CALL_EXPR_ARG (exp, 0); | |
2030 | ||
2031 | switch (DECL_FUNCTION_CODE (fndecl)) | |
2032 | { | |
2033 | CASE_FLT_FN (BUILT_IN_SQRT): | |
2034 | errno_set = ! tree_expr_nonnegative_p (arg); | |
2035 | builtin_optab = sqrt_optab; | |
2036 | break; | |
2037 | CASE_FLT_FN (BUILT_IN_EXP): | |
2038 | errno_set = true; builtin_optab = exp_optab; break; | |
2039 | CASE_FLT_FN (BUILT_IN_EXP10): | |
2040 | CASE_FLT_FN (BUILT_IN_POW10): | |
2041 | errno_set = true; builtin_optab = exp10_optab; break; | |
2042 | CASE_FLT_FN (BUILT_IN_EXP2): | |
2043 | errno_set = true; builtin_optab = exp2_optab; break; | |
2044 | CASE_FLT_FN (BUILT_IN_EXPM1): | |
2045 | errno_set = true; builtin_optab = expm1_optab; break; | |
2046 | CASE_FLT_FN (BUILT_IN_LOGB): | |
2047 | errno_set = true; builtin_optab = logb_optab; break; | |
2048 | CASE_FLT_FN (BUILT_IN_LOG): | |
2049 | errno_set = true; builtin_optab = log_optab; break; | |
2050 | CASE_FLT_FN (BUILT_IN_LOG10): | |
2051 | errno_set = true; builtin_optab = log10_optab; break; | |
2052 | CASE_FLT_FN (BUILT_IN_LOG2): | |
2053 | errno_set = true; builtin_optab = log2_optab; break; | |
2054 | CASE_FLT_FN (BUILT_IN_LOG1P): | |
2055 | errno_set = true; builtin_optab = log1p_optab; break; | |
2056 | CASE_FLT_FN (BUILT_IN_ASIN): | |
2057 | builtin_optab = asin_optab; break; | |
2058 | CASE_FLT_FN (BUILT_IN_ACOS): | |
2059 | builtin_optab = acos_optab; break; | |
2060 | CASE_FLT_FN (BUILT_IN_TAN): | |
2061 | builtin_optab = tan_optab; break; | |
2062 | CASE_FLT_FN (BUILT_IN_ATAN): | |
2063 | builtin_optab = atan_optab; break; | |
2064 | CASE_FLT_FN (BUILT_IN_FLOOR): | |
2065 | builtin_optab = floor_optab; break; | |
2066 | CASE_FLT_FN (BUILT_IN_CEIL): | |
2067 | builtin_optab = ceil_optab; break; | |
2068 | CASE_FLT_FN (BUILT_IN_TRUNC): | |
2069 | builtin_optab = btrunc_optab; break; | |
2070 | CASE_FLT_FN (BUILT_IN_ROUND): | |
2071 | builtin_optab = round_optab; break; | |
2072 | CASE_FLT_FN (BUILT_IN_NEARBYINT): | |
2073 | builtin_optab = nearbyint_optab; | |
2074 | if (flag_trapping_math) | |
2075 | break; | |
2076 | /* Else fallthrough and expand as rint. */ | |
2077 | CASE_FLT_FN (BUILT_IN_RINT): | |
2078 | builtin_optab = rint_optab; break; | |
2079 | CASE_FLT_FN (BUILT_IN_SIGNIFICAND): | |
2080 | builtin_optab = significand_optab; break; | |
2081 | default: | |
2082 | gcc_unreachable (); | |
2083 | } | |
2084 | ||
2085 | /* Make a suitable register to place result in. */ | |
2086 | mode = TYPE_MODE (TREE_TYPE (exp)); | |
2087 | ||
2088 | if (! flag_errno_math || ! HONOR_NANS (mode)) | |
2089 | errno_set = false; | |
2090 | ||
2091 | /* Before working hard, check whether the instruction is available. */ | |
2092 | if (optab_handler (builtin_optab, mode) != CODE_FOR_nothing | |
2093 | && (!errno_set || !optimize_insn_for_size_p ())) | |
2094 | { | |
2095 | target = gen_reg_rtx (mode); | |
2096 | ||
2097 | /* Wrap the computation of the argument in a SAVE_EXPR, as we may | |
2098 | need to expand the argument again. This way, we will not perform | |
2099 | side-effects more the once. */ | |
2100 | CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg); | |
2101 | ||
2102 | op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL); | |
2103 | ||
2104 | start_sequence (); | |
2105 | ||
2106 | /* Compute into TARGET. | |
2107 | Set TARGET to wherever the result comes back. */ | |
2108 | target = expand_unop (mode, builtin_optab, op0, target, 0); | |
2109 | ||
2110 | if (target != 0) | |
2111 | { | |
2112 | if (errno_set) | |
2113 | expand_errno_check (exp, target); | |
2114 | ||
2115 | /* Output the entire sequence. */ | |
2116 | insns = get_insns (); | |
2117 | end_sequence (); | |
2118 | emit_insn (insns); | |
2119 | return target; | |
2120 | } | |
2121 | ||
2122 | /* If we were unable to expand via the builtin, stop the sequence | |
2123 | (without outputting the insns) and call to the library function | |
2124 | with the stabilized argument list. */ | |
2125 | end_sequence (); | |
2126 | } | |
2127 | ||
2128 | return expand_call (exp, target, target == const0_rtx); | |
2129 | } | |
2130 | ||
2131 | /* Expand a call to the builtin binary math functions (pow and atan2). | |
2132 | Return NULL_RTX if a normal call should be emitted rather than expanding the | |
2133 | function in-line. EXP is the expression that is a call to the builtin | |
2134 | function; if convenient, the result should be placed in TARGET. | |
2135 | SUBTARGET may be used as the target for computing one of EXP's | |
2136 | operands. */ | |
2137 | ||
2138 | static rtx | |
2139 | expand_builtin_mathfn_2 (tree exp, rtx target, rtx subtarget) | |
2140 | { | |
2141 | optab builtin_optab; | |
2142 | rtx op0, op1, insns; | |
2143 | int op1_type = REAL_TYPE; | |
2144 | tree fndecl = get_callee_fndecl (exp); | |
2145 | tree arg0, arg1; | |
2146 | enum machine_mode mode; | |
2147 | bool errno_set = true; | |
2148 | ||
2149 | switch (DECL_FUNCTION_CODE (fndecl)) | |
2150 | { | |
2151 | CASE_FLT_FN (BUILT_IN_SCALBN): | |
2152 | CASE_FLT_FN (BUILT_IN_SCALBLN): | |
2153 | CASE_FLT_FN (BUILT_IN_LDEXP): | |
2154 | op1_type = INTEGER_TYPE; | |
2155 | default: | |
2156 | break; | |
2157 | } | |
2158 | ||
2159 | if (!validate_arglist (exp, REAL_TYPE, op1_type, VOID_TYPE)) | |
2160 | return NULL_RTX; | |
2161 | ||
2162 | arg0 = CALL_EXPR_ARG (exp, 0); | |
2163 | arg1 = CALL_EXPR_ARG (exp, 1); | |
2164 | ||
2165 | switch (DECL_FUNCTION_CODE (fndecl)) | |
2166 | { | |
2167 | CASE_FLT_FN (BUILT_IN_POW): | |
2168 | builtin_optab = pow_optab; break; | |
2169 | CASE_FLT_FN (BUILT_IN_ATAN2): | |
2170 | builtin_optab = atan2_optab; break; | |
2171 | CASE_FLT_FN (BUILT_IN_SCALB): | |
2172 | if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2) | |
2173 | return 0; | |
2174 | builtin_optab = scalb_optab; break; | |
2175 | CASE_FLT_FN (BUILT_IN_SCALBN): | |
2176 | CASE_FLT_FN (BUILT_IN_SCALBLN): | |
2177 | if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (exp)))->b != 2) | |
2178 | return 0; | |
2179 | /* Fall through... */ | |
2180 | CASE_FLT_FN (BUILT_IN_LDEXP): | |
2181 | builtin_optab = ldexp_optab; break; | |
2182 | CASE_FLT_FN (BUILT_IN_FMOD): | |
2183 | builtin_optab = fmod_optab; break; | |
2184 | CASE_FLT_FN (BUILT_IN_REMAINDER): | |
2185 | CASE_FLT_FN (BUILT_IN_DREM): | |
2186 | builtin_optab = remainder_optab; break; | |
2187 | default: | |
2188 | gcc_unreachable (); | |
2189 | } | |
2190 | ||
2191 | /* Make a suitable register to place result in. */ | |
2192 | mode = TYPE_MODE (TREE_TYPE (exp)); | |
2193 | ||
2194 | /* Before working hard, check whether the instruction is available. */ | |
2195 | if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing) | |
2196 | return NULL_RTX; | |
2197 | ||
2198 | target = gen_reg_rtx (mode); | |
2199 | ||
2200 | if (! flag_errno_math || ! HONOR_NANS (mode)) | |
2201 | errno_set = false; | |
2202 | ||
2203 | if (errno_set && optimize_insn_for_size_p ()) | |
2204 | return 0; | |
2205 | ||
2206 | /* Always stabilize the argument list. */ | |
2207 | CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0); | |
2208 | CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1); | |
2209 | ||
2210 | op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL); | |
2211 | op1 = expand_normal (arg1); | |
2212 | ||
2213 | start_sequence (); | |
2214 | ||
2215 | /* Compute into TARGET. | |
2216 | Set TARGET to wherever the result comes back. */ | |
2217 | target = expand_binop (mode, builtin_optab, op0, op1, | |
2218 | target, 0, OPTAB_DIRECT); | |
2219 | ||
2220 | /* If we were unable to expand via the builtin, stop the sequence | |
2221 | (without outputting the insns) and call to the library function | |
2222 | with the stabilized argument list. */ | |
2223 | if (target == 0) | |
2224 | { | |
2225 | end_sequence (); | |
2226 | return expand_call (exp, target, target == const0_rtx); | |
2227 | } | |
2228 | ||
2229 | if (errno_set) | |
2230 | expand_errno_check (exp, target); | |
2231 | ||
2232 | /* Output the entire sequence. */ | |
2233 | insns = get_insns (); | |
2234 | end_sequence (); | |
2235 | emit_insn (insns); | |
2236 | ||
2237 | return target; | |
2238 | } | |
2239 | ||
2240 | /* Expand a call to the builtin trinary math functions (fma). | |
2241 | Return NULL_RTX if a normal call should be emitted rather than expanding the | |
2242 | function in-line. EXP is the expression that is a call to the builtin | |
2243 | function; if convenient, the result should be placed in TARGET. | |
2244 | SUBTARGET may be used as the target for computing one of EXP's | |
2245 | operands. */ | |
2246 | ||
2247 | static rtx | |
2248 | expand_builtin_mathfn_ternary (tree exp, rtx target, rtx subtarget) | |
2249 | { | |
2250 | optab builtin_optab; | |
2251 | rtx op0, op1, op2, insns; | |
2252 | tree fndecl = get_callee_fndecl (exp); | |
2253 | tree arg0, arg1, arg2; | |
2254 | enum machine_mode mode; | |
2255 | ||
2256 | if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, REAL_TYPE, VOID_TYPE)) | |
2257 | return NULL_RTX; | |
2258 | ||
2259 | arg0 = CALL_EXPR_ARG (exp, 0); | |
2260 | arg1 = CALL_EXPR_ARG (exp, 1); | |
2261 | arg2 = CALL_EXPR_ARG (exp, 2); | |
2262 | ||
2263 | switch (DECL_FUNCTION_CODE (fndecl)) | |
2264 | { | |
2265 | CASE_FLT_FN (BUILT_IN_FMA): | |
2266 | builtin_optab = fma_optab; break; | |
2267 | default: | |
2268 | gcc_unreachable (); | |
2269 | } | |
2270 | ||
2271 | /* Make a suitable register to place result in. */ | |
2272 | mode = TYPE_MODE (TREE_TYPE (exp)); | |
2273 | ||
2274 | /* Before working hard, check whether the instruction is available. */ | |
2275 | if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing) | |
2276 | return NULL_RTX; | |
2277 | ||
2278 | target = gen_reg_rtx (mode); | |
2279 | ||
2280 | /* Always stabilize the argument list. */ | |
2281 | CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0); | |
2282 | CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1); | |
2283 | CALL_EXPR_ARG (exp, 2) = arg2 = builtin_save_expr (arg2); | |
2284 | ||
2285 | op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL); | |
2286 | op1 = expand_normal (arg1); | |
2287 | op2 = expand_normal (arg2); | |
2288 | ||
2289 | start_sequence (); | |
2290 | ||
2291 | /* Compute into TARGET. | |
2292 | Set TARGET to wherever the result comes back. */ | |
2293 | target = expand_ternary_op (mode, builtin_optab, op0, op1, op2, | |
2294 | target, 0); | |
2295 | ||
2296 | /* If we were unable to expand via the builtin, stop the sequence | |
2297 | (without outputting the insns) and call to the library function | |
2298 | with the stabilized argument list. */ | |
2299 | if (target == 0) | |
2300 | { | |
2301 | end_sequence (); | |
2302 | return expand_call (exp, target, target == const0_rtx); | |
2303 | } | |
2304 | ||
2305 | /* Output the entire sequence. */ | |
2306 | insns = get_insns (); | |
2307 | end_sequence (); | |
2308 | emit_insn (insns); | |
2309 | ||
2310 | return target; | |
2311 | } | |
2312 | ||
2313 | /* Expand a call to the builtin sin and cos math functions. | |
2314 | Return NULL_RTX if a normal call should be emitted rather than expanding the | |
2315 | function in-line. EXP is the expression that is a call to the builtin | |
2316 | function; if convenient, the result should be placed in TARGET. | |
2317 | SUBTARGET may be used as the target for computing one of EXP's | |
2318 | operands. */ | |
2319 | ||
2320 | static rtx | |
2321 | expand_builtin_mathfn_3 (tree exp, rtx target, rtx subtarget) | |
2322 | { | |
2323 | optab builtin_optab; | |
2324 | rtx op0, insns; | |
2325 | tree fndecl = get_callee_fndecl (exp); | |
2326 | enum machine_mode mode; | |
2327 | tree arg; | |
2328 | ||
2329 | if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE)) | |
2330 | return NULL_RTX; | |
2331 | ||
2332 | arg = CALL_EXPR_ARG (exp, 0); | |
2333 | ||
2334 | switch (DECL_FUNCTION_CODE (fndecl)) | |
2335 | { | |
2336 | CASE_FLT_FN (BUILT_IN_SIN): | |
2337 | CASE_FLT_FN (BUILT_IN_COS): | |
2338 | builtin_optab = sincos_optab; break; | |
2339 | default: | |
2340 | gcc_unreachable (); | |
2341 | } | |
2342 | ||
2343 | /* Make a suitable register to place result in. */ | |
2344 | mode = TYPE_MODE (TREE_TYPE (exp)); | |
2345 | ||
2346 | /* Check if sincos insn is available, otherwise fallback | |
2347 | to sin or cos insn. */ | |
2348 | if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing) | |
2349 | switch (DECL_FUNCTION_CODE (fndecl)) | |
2350 | { | |
2351 | CASE_FLT_FN (BUILT_IN_SIN): | |
2352 | builtin_optab = sin_optab; break; | |
2353 | CASE_FLT_FN (BUILT_IN_COS): | |
2354 | builtin_optab = cos_optab; break; | |
2355 | default: | |
2356 | gcc_unreachable (); | |
2357 | } | |
2358 | ||
2359 | /* Before working hard, check whether the instruction is available. */ | |
2360 | if (optab_handler (builtin_optab, mode) != CODE_FOR_nothing) | |
2361 | { | |
2362 | target = gen_reg_rtx (mode); | |
2363 | ||
2364 | /* Wrap the computation of the argument in a SAVE_EXPR, as we may | |
2365 | need to expand the argument again. This way, we will not perform | |
2366 | side-effects more the once. */ | |
2367 | CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg); | |
2368 | ||
2369 | op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL); | |
2370 | ||
2371 | start_sequence (); | |
2372 | ||
2373 | /* Compute into TARGET. | |
2374 | Set TARGET to wherever the result comes back. */ | |
2375 | if (builtin_optab == sincos_optab) | |
2376 | { | |
2377 | int result; | |
2378 | ||
2379 | switch (DECL_FUNCTION_CODE (fndecl)) | |
2380 | { | |
2381 | CASE_FLT_FN (BUILT_IN_SIN): | |
2382 | result = expand_twoval_unop (builtin_optab, op0, 0, target, 0); | |
2383 | break; | |
2384 | CASE_FLT_FN (BUILT_IN_COS): | |
2385 | result = expand_twoval_unop (builtin_optab, op0, target, 0, 0); | |
2386 | break; | |
2387 | default: | |
2388 | gcc_unreachable (); | |
2389 | } | |
2390 | gcc_assert (result); | |
2391 | } | |
2392 | else | |
2393 | { | |
2394 | target = expand_unop (mode, builtin_optab, op0, target, 0); | |
2395 | } | |
2396 | ||
2397 | if (target != 0) | |
2398 | { | |
2399 | /* Output the entire sequence. */ | |
2400 | insns = get_insns (); | |
2401 | end_sequence (); | |
2402 | emit_insn (insns); | |
2403 | return target; | |
2404 | } | |
2405 | ||
2406 | /* If we were unable to expand via the builtin, stop the sequence | |
2407 | (without outputting the insns) and call to the library function | |
2408 | with the stabilized argument list. */ | |
2409 | end_sequence (); | |
2410 | } | |
2411 | ||
2412 | target = expand_call (exp, target, target == const0_rtx); | |
2413 | ||
2414 | return target; | |
2415 | } | |
2416 | ||
2417 | /* Given an interclass math builtin decl FNDECL and it's argument ARG | |
2418 | return an RTL instruction code that implements the functionality. | |
2419 | If that isn't possible or available return CODE_FOR_nothing. */ | |
2420 | ||
2421 | static enum insn_code | |
2422 | interclass_mathfn_icode (tree arg, tree fndecl) | |
2423 | { | |
2424 | bool errno_set = false; | |
2425 | optab builtin_optab = 0; | |
2426 | enum machine_mode mode; | |
2427 | ||
2428 | switch (DECL_FUNCTION_CODE (fndecl)) | |
2429 | { | |
2430 | CASE_FLT_FN (BUILT_IN_ILOGB): | |
2431 | errno_set = true; builtin_optab = ilogb_optab; break; | |
2432 | CASE_FLT_FN (BUILT_IN_ISINF): | |
2433 | builtin_optab = isinf_optab; break; | |
2434 | case BUILT_IN_ISNORMAL: | |
2435 | case BUILT_IN_ISFINITE: | |
2436 | CASE_FLT_FN (BUILT_IN_FINITE): | |
2437 | case BUILT_IN_FINITED32: | |
2438 | case BUILT_IN_FINITED64: | |
2439 | case BUILT_IN_FINITED128: | |
2440 | case BUILT_IN_ISINFD32: | |
2441 | case BUILT_IN_ISINFD64: | |
2442 | case BUILT_IN_ISINFD128: | |
2443 | /* These builtins have no optabs (yet). */ | |
2444 | break; | |
2445 | default: | |
2446 | gcc_unreachable (); | |
2447 | } | |
2448 | ||
2449 | /* There's no easy way to detect the case we need to set EDOM. */ | |
2450 | if (flag_errno_math && errno_set) | |
2451 | return CODE_FOR_nothing; | |
2452 | ||
2453 | /* Optab mode depends on the mode of the input argument. */ | |
2454 | mode = TYPE_MODE (TREE_TYPE (arg)); | |
2455 | ||
2456 | if (builtin_optab) | |
2457 | return optab_handler (builtin_optab, mode); | |
2458 | return CODE_FOR_nothing; | |
2459 | } | |
2460 | ||
2461 | /* Expand a call to one of the builtin math functions that operate on | |
2462 | floating point argument and output an integer result (ilogb, isinf, | |
2463 | isnan, etc). | |
2464 | Return 0 if a normal call should be emitted rather than expanding the | |
2465 | function in-line. EXP is the expression that is a call to the builtin | |
2466 | function; if convenient, the result should be placed in TARGET. */ | |
2467 | ||
2468 | static rtx | |
2469 | expand_builtin_interclass_mathfn (tree exp, rtx target) | |
2470 | { | |
2471 | enum insn_code icode = CODE_FOR_nothing; | |
2472 | rtx op0; | |
2473 | tree fndecl = get_callee_fndecl (exp); | |
2474 | enum machine_mode mode; | |
2475 | tree arg; | |
2476 | ||
2477 | if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE)) | |
2478 | return NULL_RTX; | |
2479 | ||
2480 | arg = CALL_EXPR_ARG (exp, 0); | |
2481 | icode = interclass_mathfn_icode (arg, fndecl); | |
2482 | mode = TYPE_MODE (TREE_TYPE (arg)); | |
2483 | ||
2484 | if (icode != CODE_FOR_nothing) | |
2485 | { | |
2486 | struct expand_operand ops[1]; | |
2487 | rtx last = get_last_insn (); | |
2488 | tree orig_arg = arg; | |
2489 | ||
2490 | /* Wrap the computation of the argument in a SAVE_EXPR, as we may | |
2491 | need to expand the argument again. This way, we will not perform | |
2492 | side-effects more the once. */ | |
2493 | CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg); | |
2494 | ||
2495 | op0 = expand_expr (arg, NULL_RTX, VOIDmode, EXPAND_NORMAL); | |
2496 | ||
2497 | if (mode != GET_MODE (op0)) | |
2498 | op0 = convert_to_mode (mode, op0, 0); | |
2499 | ||
2500 | create_output_operand (&ops[0], target, TYPE_MODE (TREE_TYPE (exp))); | |
2501 | if (maybe_legitimize_operands (icode, 0, 1, ops) | |
2502 | && maybe_emit_unop_insn (icode, ops[0].value, op0, UNKNOWN)) | |
2503 | return ops[0].value; | |
2504 | ||
2505 | delete_insns_since (last); | |
2506 | CALL_EXPR_ARG (exp, 0) = orig_arg; | |
2507 | } | |
2508 | ||
2509 | return NULL_RTX; | |
2510 | } | |
2511 | ||
2512 | /* Expand a call to the builtin sincos math function. | |
2513 | Return NULL_RTX if a normal call should be emitted rather than expanding the | |
2514 | function in-line. EXP is the expression that is a call to the builtin | |
2515 | function. */ | |
2516 | ||
2517 | static rtx | |
2518 | expand_builtin_sincos (tree exp) | |
2519 | { | |
2520 | rtx op0, op1, op2, target1, target2; | |
2521 | enum machine_mode mode; | |
2522 | tree arg, sinp, cosp; | |
2523 | int result; | |
2524 | location_t loc = EXPR_LOCATION (exp); | |
2525 | tree alias_type, alias_off; | |
2526 | ||
2527 | if (!validate_arglist (exp, REAL_TYPE, | |
2528 | POINTER_TYPE, POINTER_TYPE, VOID_TYPE)) | |
2529 | return NULL_RTX; | |
2530 | ||
2531 | arg = CALL_EXPR_ARG (exp, 0); | |
2532 | sinp = CALL_EXPR_ARG (exp, 1); | |
2533 | cosp = CALL_EXPR_ARG (exp, 2); | |
2534 | ||
2535 | /* Make a suitable register to place result in. */ | |
2536 | mode = TYPE_MODE (TREE_TYPE (arg)); | |
2537 | ||
2538 | /* Check if sincos insn is available, otherwise emit the call. */ | |
2539 | if (optab_handler (sincos_optab, mode) == CODE_FOR_nothing) | |
2540 | return NULL_RTX; | |
2541 | ||
2542 | target1 = gen_reg_rtx (mode); | |
2543 | target2 = gen_reg_rtx (mode); | |
2544 | ||
2545 | op0 = expand_normal (arg); | |
2546 | alias_type = build_pointer_type_for_mode (TREE_TYPE (arg), ptr_mode, true); | |
2547 | alias_off = build_int_cst (alias_type, 0); | |
2548 | op1 = expand_normal (fold_build2_loc (loc, MEM_REF, TREE_TYPE (arg), | |
2549 | sinp, alias_off)); | |
2550 | op2 = expand_normal (fold_build2_loc (loc, MEM_REF, TREE_TYPE (arg), | |
2551 | cosp, alias_off)); | |
2552 | ||
2553 | /* Compute into target1 and target2. | |
2554 | Set TARGET to wherever the result comes back. */ | |
2555 | result = expand_twoval_unop (sincos_optab, op0, target2, target1, 0); | |
2556 | gcc_assert (result); | |
2557 | ||
2558 | /* Move target1 and target2 to the memory locations indicated | |
2559 | by op1 and op2. */ | |
2560 | emit_move_insn (op1, target1); | |
2561 | emit_move_insn (op2, target2); | |
2562 | ||
2563 | return const0_rtx; | |
2564 | } | |
2565 | ||
2566 | /* Expand a call to the internal cexpi builtin to the sincos math function. | |
2567 | EXP is the expression that is a call to the builtin function; if convenient, | |
2568 | the result should be placed in TARGET. */ | |
2569 | ||
2570 | static rtx | |
2571 | expand_builtin_cexpi (tree exp, rtx target) | |
2572 | { | |
2573 | tree fndecl = get_callee_fndecl (exp); | |
2574 | tree arg, type; | |
2575 | enum machine_mode mode; | |
2576 | rtx op0, op1, op2; | |
2577 | location_t loc = EXPR_LOCATION (exp); | |
2578 | ||
2579 | if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE)) | |
2580 | return NULL_RTX; | |
2581 | ||
2582 | arg = CALL_EXPR_ARG (exp, 0); | |
2583 | type = TREE_TYPE (arg); | |
2584 | mode = TYPE_MODE (TREE_TYPE (arg)); | |
2585 | ||
2586 | /* Try expanding via a sincos optab, fall back to emitting a libcall | |
2587 | to sincos or cexp. We are sure we have sincos or cexp because cexpi | |
2588 | is only generated from sincos, cexp or if we have either of them. */ | |
2589 | if (optab_handler (sincos_optab, mode) != CODE_FOR_nothing) | |
2590 | { | |
2591 | op1 = gen_reg_rtx (mode); | |
2592 | op2 = gen_reg_rtx (mode); | |
2593 | ||
2594 | op0 = expand_expr (arg, NULL_RTX, VOIDmode, EXPAND_NORMAL); | |
2595 | ||
2596 | /* Compute into op1 and op2. */ | |
2597 | expand_twoval_unop (sincos_optab, op0, op2, op1, 0); | |
2598 | } | |
2599 | else if (TARGET_HAS_SINCOS) | |
2600 | { | |
2601 | tree call, fn = NULL_TREE; | |
2602 | tree top1, top2; | |
2603 | rtx op1a, op2a; | |
2604 | ||
2605 | if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF) | |
2606 | fn = builtin_decl_explicit (BUILT_IN_SINCOSF); | |
2607 | else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI) | |
2608 | fn = builtin_decl_explicit (BUILT_IN_SINCOS); | |
2609 | else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL) | |
2610 | fn = builtin_decl_explicit (BUILT_IN_SINCOSL); | |
2611 | else | |
2612 | gcc_unreachable (); | |
2613 | ||
2614 | op1 = assign_temp (TREE_TYPE (arg), 0, 1, 1); | |
2615 | op2 = assign_temp (TREE_TYPE (arg), 0, 1, 1); | |
2616 | op1a = copy_to_mode_reg (Pmode, XEXP (op1, 0)); | |
2617 | op2a = copy_to_mode_reg (Pmode, XEXP (op2, 0)); | |
2618 | top1 = make_tree (build_pointer_type (TREE_TYPE (arg)), op1a); | |
2619 | top2 = make_tree (build_pointer_type (TREE_TYPE (arg)), op2a); | |
2620 | ||
2621 | /* Make sure not to fold the sincos call again. */ | |
2622 | call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn); | |
2623 | expand_normal (build_call_nary (TREE_TYPE (TREE_TYPE (fn)), | |
2624 | call, 3, arg, top1, top2)); | |
2625 | } | |
2626 | else | |
2627 | { | |
2628 | tree call, fn = NULL_TREE, narg; | |
2629 | tree ctype = build_complex_type (type); | |
2630 | ||
2631 | if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF) | |
2632 | fn = builtin_decl_explicit (BUILT_IN_CEXPF); | |
2633 | else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI) | |
2634 | fn = builtin_decl_explicit (BUILT_IN_CEXP); | |
2635 | else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL) | |
2636 | fn = builtin_decl_explicit (BUILT_IN_CEXPL); | |
2637 | else | |
2638 | gcc_unreachable (); | |
2639 | ||
2640 | /* If we don't have a decl for cexp create one. This is the | |
2641 | friendliest fallback if the user calls __builtin_cexpi | |
2642 | without full target C99 function support. */ | |
2643 | if (fn == NULL_TREE) | |
2644 | { | |
2645 | tree fntype; | |
2646 | const char *name = NULL; | |
2647 | ||
2648 | if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF) | |
2649 | name = "cexpf"; | |
2650 | else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI) | |
2651 | name = "cexp"; | |
2652 | else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL) | |
2653 | name = "cexpl"; | |
2654 | ||
2655 | fntype = build_function_type_list (ctype, ctype, NULL_TREE); | |
2656 | fn = build_fn_decl (name, fntype); | |
2657 | } | |
2658 | ||
2659 | narg = fold_build2_loc (loc, COMPLEX_EXPR, ctype, | |
2660 | build_real (type, dconst0), arg); | |
2661 | ||
2662 | /* Make sure not to fold the cexp call again. */ | |
2663 | call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn); | |
2664 | return expand_expr (build_call_nary (ctype, call, 1, narg), | |
2665 | target, VOIDmode, EXPAND_NORMAL); | |
2666 | } | |
2667 | ||
2668 | /* Now build the proper return type. */ | |
2669 | return expand_expr (build2 (COMPLEX_EXPR, build_complex_type (type), | |
2670 | make_tree (TREE_TYPE (arg), op2), | |
2671 | make_tree (TREE_TYPE (arg), op1)), | |
2672 | target, VOIDmode, EXPAND_NORMAL); | |
2673 | } | |
2674 | ||
2675 | /* Conveniently construct a function call expression. FNDECL names the | |
2676 | function to be called, N is the number of arguments, and the "..." | |
2677 | parameters are the argument expressions. Unlike build_call_exr | |
2678 | this doesn't fold the call, hence it will always return a CALL_EXPR. */ | |
2679 | ||
2680 | static tree | |
2681 | build_call_nofold_loc (location_t loc, tree fndecl, int n, ...) | |
2682 | { | |
2683 | va_list ap; | |
2684 | tree fntype = TREE_TYPE (fndecl); | |
2685 | tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl); | |
2686 | ||
2687 | va_start (ap, n); | |
2688 | fn = build_call_valist (TREE_TYPE (fntype), fn, n, ap); | |
2689 | va_end (ap); | |
2690 | SET_EXPR_LOCATION (fn, loc); | |
2691 | return fn; | |
2692 | } | |
2693 | ||
2694 | /* Expand a call to one of the builtin rounding functions gcc defines | |
2695 | as an extension (lfloor and lceil). As these are gcc extensions we | |
2696 | do not need to worry about setting errno to EDOM. | |
2697 | If expanding via optab fails, lower expression to (int)(floor(x)). | |
2698 | EXP is the expression that is a call to the builtin function; | |
2699 | if convenient, the result should be placed in TARGET. */ | |
2700 | ||
2701 | static rtx | |
2702 | expand_builtin_int_roundingfn (tree exp, rtx target) | |
2703 | { | |
2704 | convert_optab builtin_optab; | |
2705 | rtx op0, insns, tmp; | |
2706 | tree fndecl = get_callee_fndecl (exp); | |
2707 | enum built_in_function fallback_fn; | |
2708 | tree fallback_fndecl; | |
2709 | enum machine_mode mode; | |
2710 | tree arg; | |
2711 | ||
2712 | if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE)) | |
2713 | gcc_unreachable (); | |
2714 | ||
2715 | arg = CALL_EXPR_ARG (exp, 0); | |
2716 | ||
2717 | switch (DECL_FUNCTION_CODE (fndecl)) | |
2718 | { | |
2719 | CASE_FLT_FN (BUILT_IN_ICEIL): | |
2720 | CASE_FLT_FN (BUILT_IN_LCEIL): | |
2721 | CASE_FLT_FN (BUILT_IN_LLCEIL): | |
2722 | builtin_optab = lceil_optab; | |
2723 | fallback_fn = BUILT_IN_CEIL; | |
2724 | break; | |
2725 | ||
2726 | CASE_FLT_FN (BUILT_IN_IFLOOR): | |
2727 | CASE_FLT_FN (BUILT_IN_LFLOOR): | |
2728 | CASE_FLT_FN (BUILT_IN_LLFLOOR): | |
2729 | builtin_optab = lfloor_optab; | |
2730 | fallback_fn = BUILT_IN_FLOOR; | |
2731 | break; | |
2732 | ||
2733 | default: | |
2734 | gcc_unreachable (); | |
2735 | } | |
2736 | ||
2737 | /* Make a suitable register to place result in. */ | |
2738 | mode = TYPE_MODE (TREE_TYPE (exp)); | |
2739 | ||
2740 | target = gen_reg_rtx (mode); | |
2741 | ||
2742 | /* Wrap the computation of the argument in a SAVE_EXPR, as we may | |
2743 | need to expand the argument again. This way, we will not perform | |
2744 | side-effects more the once. */ | |
2745 | CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg); | |
2746 | ||
2747 | op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL); | |
2748 | ||
2749 | start_sequence (); | |
2750 | ||
2751 | /* Compute into TARGET. */ | |
2752 | if (expand_sfix_optab (target, op0, builtin_optab)) | |
2753 | { | |
2754 | /* Output the entire sequence. */ | |
2755 | insns = get_insns (); | |
2756 | end_sequence (); | |
2757 | emit_insn (insns); | |
2758 | return target; | |
2759 | } | |
2760 | ||
2761 | /* If we were unable to expand via the builtin, stop the sequence | |
2762 | (without outputting the insns). */ | |
2763 | end_sequence (); | |
2764 | ||
2765 | /* Fall back to floating point rounding optab. */ | |
2766 | fallback_fndecl = mathfn_built_in (TREE_TYPE (arg), fallback_fn); | |
2767 | ||
2768 | /* For non-C99 targets we may end up without a fallback fndecl here | |
2769 | if the user called __builtin_lfloor directly. In this case emit | |
2770 | a call to the floor/ceil variants nevertheless. This should result | |
2771 | in the best user experience for not full C99 targets. */ | |
2772 | if (fallback_fndecl == NULL_TREE) | |
2773 | { | |
2774 | tree fntype; | |
2775 | const char *name = NULL; | |
2776 | ||
2777 | switch (DECL_FUNCTION_CODE (fndecl)) | |
2778 | { | |
2779 | case BUILT_IN_ICEIL: | |
2780 | case BUILT_IN_LCEIL: | |
2781 | case BUILT_IN_LLCEIL: | |
2782 | name = "ceil"; | |
2783 | break; | |
2784 | case BUILT_IN_ICEILF: | |
2785 | case BUILT_IN_LCEILF: | |
2786 | case BUILT_IN_LLCEILF: | |
2787 | name = "ceilf"; | |
2788 | break; | |
2789 | case BUILT_IN_ICEILL: | |
2790 | case BUILT_IN_LCEILL: | |
2791 | case BUILT_IN_LLCEILL: | |
2792 | name = "ceill"; | |
2793 | break; | |
2794 | case BUILT_IN_IFLOOR: | |
2795 | case BUILT_IN_LFLOOR: | |
2796 | case BUILT_IN_LLFLOOR: | |
2797 | name = "floor"; | |
2798 | break; | |
2799 | case BUILT_IN_IFLOORF: | |
2800 | case BUILT_IN_LFLOORF: | |
2801 | case BUILT_IN_LLFLOORF: | |
2802 | name = "floorf"; | |
2803 | break; | |
2804 | case BUILT_IN_IFLOORL: | |
2805 | case BUILT_IN_LFLOORL: | |
2806 | case BUILT_IN_LLFLOORL: | |
2807 | name = "floorl"; | |
2808 | break; | |
2809 | default: | |
2810 | gcc_unreachable (); | |
2811 | } | |
2812 | ||
2813 | fntype = build_function_type_list (TREE_TYPE (arg), | |
2814 | TREE_TYPE (arg), NULL_TREE); | |
2815 | fallback_fndecl = build_fn_decl (name, fntype); | |
2816 | } | |
2817 | ||
2818 | exp = build_call_nofold_loc (EXPR_LOCATION (exp), fallback_fndecl, 1, arg); | |
2819 | ||
2820 | tmp = expand_normal (exp); | |
2821 | ||
2822 | /* Truncate the result of floating point optab to integer | |
2823 | via expand_fix (). */ | |
2824 | target = gen_reg_rtx (mode); | |
2825 | expand_fix (target, tmp, 0); | |
2826 | ||
2827 | return target; | |
2828 | } | |
2829 | ||
2830 | /* Expand a call to one of the builtin math functions doing integer | |
2831 | conversion (lrint). | |
2832 | Return 0 if a normal call should be emitted rather than expanding the | |
2833 | function in-line. EXP is the expression that is a call to the builtin | |
2834 | function; if convenient, the result should be placed in TARGET. */ | |
2835 | ||
2836 | static rtx | |
2837 | expand_builtin_int_roundingfn_2 (tree exp, rtx target) | |
2838 | { | |
2839 | convert_optab builtin_optab; | |
2840 | rtx op0, insns; | |
2841 | tree fndecl = get_callee_fndecl (exp); | |
2842 | tree arg; | |
2843 | enum machine_mode mode; | |
2844 | enum built_in_function fallback_fn = BUILT_IN_NONE; | |
2845 | ||
2846 | if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE)) | |
2847 | gcc_unreachable (); | |
2848 | ||
2849 | arg = CALL_EXPR_ARG (exp, 0); | |
2850 | ||
2851 | switch (DECL_FUNCTION_CODE (fndecl)) | |
2852 | { | |
2853 | CASE_FLT_FN (BUILT_IN_IRINT): | |
2854 | fallback_fn = BUILT_IN_LRINT; | |
2855 | /* FALLTHRU */ | |
2856 | CASE_FLT_FN (BUILT_IN_LRINT): | |
2857 | CASE_FLT_FN (BUILT_IN_LLRINT): | |
2858 | builtin_optab = lrint_optab; | |
2859 | break; | |
2860 | ||
2861 | CASE_FLT_FN (BUILT_IN_IROUND): | |
2862 | fallback_fn = BUILT_IN_LROUND; | |
2863 | /* FALLTHRU */ | |
2864 | CASE_FLT_FN (BUILT_IN_LROUND): | |
2865 | CASE_FLT_FN (BUILT_IN_LLROUND): | |
2866 | builtin_optab = lround_optab; | |
2867 | break; | |
2868 | ||
2869 | default: | |
2870 | gcc_unreachable (); | |
2871 | } | |
2872 | ||
2873 | /* There's no easy way to detect the case we need to set EDOM. */ | |
2874 | if (flag_errno_math && fallback_fn == BUILT_IN_NONE) | |
2875 | return NULL_RTX; | |
2876 | ||
2877 | /* Make a suitable register to place result in. */ | |
2878 | mode = TYPE_MODE (TREE_TYPE (exp)); | |
2879 | ||
2880 | /* There's no easy way to detect the case we need to set EDOM. */ | |
2881 | if (!flag_errno_math) | |
2882 | { | |
2883 | target = gen_reg_rtx (mode); | |
2884 | ||
2885 | /* Wrap the computation of the argument in a SAVE_EXPR, as we may | |
2886 | need to expand the argument again. This way, we will not perform | |
2887 | side-effects more the once. */ | |
2888 | CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg); | |
2889 | ||
2890 | op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL); | |
2891 | ||
2892 | start_sequence (); | |
2893 | ||
2894 | if (expand_sfix_optab (target, op0, builtin_optab)) | |
2895 | { | |
2896 | /* Output the entire sequence. */ | |
2897 | insns = get_insns (); | |
2898 | end_sequence (); | |
2899 | emit_insn (insns); | |
2900 | return target; | |
2901 | } | |
2902 | ||
2903 | /* If we were unable to expand via the builtin, stop the sequence | |
2904 | (without outputting the insns) and call to the library function | |
2905 | with the stabilized argument list. */ | |
2906 | end_sequence (); | |
2907 | } | |
2908 | ||
2909 | if (fallback_fn != BUILT_IN_NONE) | |
2910 | { | |
2911 | /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99 | |
2912 | targets, (int) round (x) should never be transformed into | |
2913 | BUILT_IN_IROUND and if __builtin_iround is called directly, emit | |
2914 | a call to lround in the hope that the target provides at least some | |
2915 | C99 functions. This should result in the best user experience for | |
2916 | not full C99 targets. */ | |
2917 | tree fallback_fndecl = mathfn_built_in_1 (TREE_TYPE (arg), | |
2918 | fallback_fn, 0); | |
2919 | ||
2920 | exp = build_call_nofold_loc (EXPR_LOCATION (exp), | |
2921 | fallback_fndecl, 1, arg); | |
2922 | ||
2923 | target = expand_call (exp, NULL_RTX, target == const0_rtx); | |
2924 | return convert_to_mode (mode, target, 0); | |
2925 | } | |
2926 | ||
2927 | target = expand_call (exp, target, target == const0_rtx); | |
2928 | ||
2929 | return target; | |
2930 | } | |
2931 | ||
2932 | /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if | |
2933 | a normal call should be emitted rather than expanding the function | |
2934 | in-line. EXP is the expression that is a call to the builtin | |
2935 | function; if convenient, the result should be placed in TARGET. */ | |
2936 | ||
2937 | static rtx | |
2938 | expand_builtin_powi (tree exp, rtx target) | |
2939 | { | |
2940 | tree arg0, arg1; | |
2941 | rtx op0, op1; | |
2942 | enum machine_mode mode; | |
2943 | enum machine_mode mode2; | |
2944 | ||
2945 | if (! validate_arglist (exp, REAL_TYPE, INTEGER_TYPE, VOID_TYPE)) | |
2946 | return NULL_RTX; | |
2947 | ||
2948 | arg0 = CALL_EXPR_ARG (exp, 0); | |
2949 | arg1 = CALL_EXPR_ARG (exp, 1); | |
2950 | mode = TYPE_MODE (TREE_TYPE (exp)); | |
2951 | ||
2952 | /* Emit a libcall to libgcc. */ | |
2953 | ||
2954 | /* Mode of the 2nd argument must match that of an int. */ | |
2955 | mode2 = mode_for_size (INT_TYPE_SIZE, MODE_INT, 0); | |
2956 | ||
2957 | if (target == NULL_RTX) | |
2958 | target = gen_reg_rtx (mode); | |
2959 | ||
2960 | op0 = expand_expr (arg0, NULL_RTX, mode, EXPAND_NORMAL); | |
2961 | if (GET_MODE (op0) != mode) | |
2962 | op0 = convert_to_mode (mode, op0, 0); | |
2963 | op1 = expand_expr (arg1, NULL_RTX, mode2, EXPAND_NORMAL); | |
2964 | if (GET_MODE (op1) != mode2) | |
2965 | op1 = convert_to_mode (mode2, op1, 0); | |
2966 | ||
2967 | target = emit_library_call_value (optab_libfunc (powi_optab, mode), | |
2968 | target, LCT_CONST, mode, 2, | |
2969 | op0, mode, op1, mode2); | |
2970 | ||
2971 | return target; | |
2972 | } | |
2973 | ||
2974 | /* Expand expression EXP which is a call to the strlen builtin. Return | |
2975 | NULL_RTX if we failed the caller should emit a normal call, otherwise | |
2976 | try to get the result in TARGET, if convenient. */ | |
2977 | ||
2978 | static rtx | |
2979 | expand_builtin_strlen (tree exp, rtx target, | |
2980 | enum machine_mode target_mode) | |
2981 | { | |
2982 | if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE)) | |
2983 | return NULL_RTX; | |
2984 | else | |
2985 | { | |
2986 | struct expand_operand ops[4]; | |
2987 | rtx pat; | |
2988 | tree len; | |
2989 | tree src = CALL_EXPR_ARG (exp, 0); | |
2990 | rtx src_reg, before_strlen; | |
2991 | enum machine_mode insn_mode = target_mode; | |
2992 | enum insn_code icode = CODE_FOR_nothing; | |
2993 | unsigned int align; | |
2994 | ||
2995 | /* If the length can be computed at compile-time, return it. */ | |
2996 | len = c_strlen (src, 0); | |
2997 | if (len) | |
2998 | return expand_expr (len, target, target_mode, EXPAND_NORMAL); | |
2999 | ||
3000 | /* If the length can be computed at compile-time and is constant | |
3001 | integer, but there are side-effects in src, evaluate | |
3002 | src for side-effects, then return len. | |
3003 | E.g. x = strlen (i++ ? "xfoo" + 1 : "bar"); | |
3004 | can be optimized into: i++; x = 3; */ | |
3005 | len = c_strlen (src, 1); | |
3006 | if (len && TREE_CODE (len) == INTEGER_CST) | |
3007 | { | |
3008 | expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL); | |
3009 | return expand_expr (len, target, target_mode, EXPAND_NORMAL); | |
3010 | } | |
3011 | ||
3012 | align = get_pointer_alignment (src) / BITS_PER_UNIT; | |
3013 | ||
3014 | /* If SRC is not a pointer type, don't do this operation inline. */ | |
3015 | if (align == 0) | |
3016 | return NULL_RTX; | |
3017 | ||
3018 | /* Bail out if we can't compute strlen in the right mode. */ | |
3019 | while (insn_mode != VOIDmode) | |
3020 | { | |
3021 | icode = optab_handler (strlen_optab, insn_mode); | |
3022 | if (icode != CODE_FOR_nothing) | |
3023 | break; | |
3024 | ||
3025 | insn_mode = GET_MODE_WIDER_MODE (insn_mode); | |
3026 | } | |
3027 | if (insn_mode == VOIDmode) | |
3028 | return NULL_RTX; | |
3029 | ||
3030 | /* Make a place to hold the source address. We will not expand | |
3031 | the actual source until we are sure that the expansion will | |
3032 | not fail -- there are trees that cannot be expanded twice. */ | |
3033 | src_reg = gen_reg_rtx (Pmode); | |
3034 | ||
3035 | /* Mark the beginning of the strlen sequence so we can emit the | |
3036 | source operand later. */ | |
3037 | before_strlen = get_last_insn (); | |
3038 | ||
3039 | create_output_operand (&ops[0], target, insn_mode); | |
3040 | create_fixed_operand (&ops[1], gen_rtx_MEM (BLKmode, src_reg)); | |
3041 | create_integer_operand (&ops[2], 0); | |
3042 | create_integer_operand (&ops[3], align); | |
3043 | if (!maybe_expand_insn (icode, 4, ops)) | |
3044 | return NULL_RTX; | |
3045 | ||
3046 | /* Now that we are assured of success, expand the source. */ | |
3047 | start_sequence (); | |
3048 | pat = expand_expr (src, src_reg, Pmode, EXPAND_NORMAL); | |
3049 | if (pat != src_reg) | |
3050 | { | |
3051 | #ifdef POINTERS_EXTEND_UNSIGNED | |
3052 | if (GET_MODE (pat) != Pmode) | |
3053 | pat = convert_to_mode (Pmode, pat, | |
3054 | POINTERS_EXTEND_UNSIGNED); | |
3055 | #endif | |
3056 | emit_move_insn (src_reg, pat); | |
3057 | } | |
3058 | pat = get_insns (); | |
3059 | end_sequence (); | |
3060 | ||
3061 | if (before_strlen) | |
3062 | emit_insn_after (pat, before_strlen); | |
3063 | else | |
3064 | emit_insn_before (pat, get_insns ()); | |
3065 | ||
3066 | /* Return the value in the proper mode for this function. */ | |
3067 | if (GET_MODE (ops[0].value) == target_mode) | |
3068 | target = ops[0].value; | |
3069 | else if (target != 0) | |
3070 | convert_move (target, ops[0].value, 0); | |
3071 | else | |
3072 | target = convert_to_mode (target_mode, ops[0].value, 0); | |
3073 | ||
3074 | return target; | |
3075 | } | |
3076 | } | |
3077 | ||
3078 | /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE) | |
3079 | bytes from constant string DATA + OFFSET and return it as target | |
3080 | constant. */ | |
3081 | ||
3082 | static rtx | |
3083 | builtin_memcpy_read_str (void *data, HOST_WIDE_INT offset, | |
3084 | enum machine_mode mode) | |
3085 | { | |
3086 | const char *str = (const char *) data; | |
3087 | ||
3088 | gcc_assert (offset >= 0 | |
3089 | && ((unsigned HOST_WIDE_INT) offset + GET_MODE_SIZE (mode) | |
3090 | <= strlen (str) + 1)); | |
3091 | ||
3092 | return c_readstr (str + offset, mode); | |
3093 | } | |
3094 | ||
3095 | /* Expand a call EXP to the memcpy builtin. | |
3096 | Return NULL_RTX 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). */ | |
3099 | ||
3100 | static rtx | |
3101 | expand_builtin_memcpy (tree exp, rtx target) | |
3102 | { | |
3103 | if (!validate_arglist (exp, | |
3104 | POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)) | |
3105 | return NULL_RTX; | |
3106 | else | |
3107 | { | |
3108 | tree dest = CALL_EXPR_ARG (exp, 0); | |
3109 | tree src = CALL_EXPR_ARG (exp, 1); | |
3110 | tree len = CALL_EXPR_ARG (exp, 2); | |
3111 | const char *src_str; | |
3112 | unsigned int src_align = get_pointer_alignment (src); | |
3113 | unsigned int dest_align = get_pointer_alignment (dest); | |
3114 | rtx dest_mem, src_mem, dest_addr, len_rtx; | |
3115 | HOST_WIDE_INT expected_size = -1; | |
3116 | unsigned int expected_align = 0; | |
3117 | ||
3118 | /* If DEST is not a pointer type, call the normal function. */ | |
3119 | if (dest_align == 0) | |
3120 | return NULL_RTX; | |
3121 | ||
3122 | /* If either SRC is not a pointer type, don't do this | |
3123 | operation in-line. */ | |
3124 | if (src_align == 0) | |
3125 | return NULL_RTX; | |
3126 | ||
3127 | if (currently_expanding_gimple_stmt) | |
3128 | stringop_block_profile (currently_expanding_gimple_stmt, | |
3129 | &expected_align, &expected_size); | |
3130 | ||
3131 | if (expected_align < dest_align) | |
3132 | expected_align = dest_align; | |
3133 | dest_mem = get_memory_rtx (dest, len); | |
3134 | set_mem_align (dest_mem, dest_align); | |
3135 | len_rtx = expand_normal (len); | |
3136 | src_str = c_getstr (src); | |
3137 | ||
3138 | /* If SRC is a string constant and block move would be done | |
3139 | by pieces, we can avoid loading the string from memory | |
3140 | and only stored the computed constants. */ | |
3141 | if (src_str | |
3142 | && CONST_INT_P (len_rtx) | |
3143 | && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1 | |
3144 | && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str, | |
3145 | CONST_CAST (char *, src_str), | |
3146 | dest_align, false)) | |
3147 | { | |
3148 | dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx), | |
3149 | builtin_memcpy_read_str, | |
3150 | CONST_CAST (char *, src_str), | |
3151 | dest_align, false, 0); | |
3152 | dest_mem = force_operand (XEXP (dest_mem, 0), target); | |
3153 | dest_mem = convert_memory_address (ptr_mode, dest_mem); | |
3154 | return dest_mem; | |
3155 | } | |
3156 | ||
3157 | src_mem = get_memory_rtx (src, len); | |
3158 | set_mem_align (src_mem, src_align); | |
3159 | ||
3160 | /* Copy word part most expediently. */ | |
3161 | dest_addr = emit_block_move_hints (dest_mem, src_mem, len_rtx, | |
3162 | CALL_EXPR_TAILCALL (exp) | |
3163 | ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL, | |
3164 | expected_align, expected_size); | |
3165 | ||
3166 | if (dest_addr == 0) | |
3167 | { | |
3168 | dest_addr = force_operand (XEXP (dest_mem, 0), target); | |
3169 | dest_addr = convert_memory_address (ptr_mode, dest_addr); | |
3170 | } | |
3171 | return dest_addr; | |
3172 | } | |
3173 | } | |
3174 | ||
3175 | /* Expand a call EXP to the mempcpy builtin. | |
3176 | Return NULL_RTX if we failed; the caller should emit a normal call, | |
3177 | otherwise try to get the result in TARGET, if convenient (and in | |
3178 | mode MODE if that's convenient). If ENDP is 0 return the | |
3179 | destination pointer, if ENDP is 1 return the end pointer ala | |
3180 | mempcpy, and if ENDP is 2 return the end pointer minus one ala | |
3181 | stpcpy. */ | |
3182 | ||
3183 | static rtx | |
3184 | expand_builtin_mempcpy (tree exp, rtx target, enum machine_mode mode) | |
3185 | { | |
3186 | if (!validate_arglist (exp, | |
3187 | POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)) | |
3188 | return NULL_RTX; | |
3189 | else | |
3190 | { | |
3191 | tree dest = CALL_EXPR_ARG (exp, 0); | |
3192 | tree src = CALL_EXPR_ARG (exp, 1); | |
3193 | tree len = CALL_EXPR_ARG (exp, 2); | |
3194 | return expand_builtin_mempcpy_args (dest, src, len, | |
3195 | target, mode, /*endp=*/ 1); | |
3196 | } | |
3197 | } | |
3198 | ||
3199 | /* Helper function to do the actual work for expand_builtin_mempcpy. The | |
3200 | arguments to the builtin_mempcpy call DEST, SRC, and LEN are broken out | |
3201 | so that this can also be called without constructing an actual CALL_EXPR. | |
3202 | The other arguments and return value are the same as for | |
3203 | expand_builtin_mempcpy. */ | |
3204 | ||
3205 | static rtx | |
3206 | expand_builtin_mempcpy_args (tree dest, tree src, tree len, | |
3207 | rtx target, enum machine_mode mode, int endp) | |
3208 | { | |
3209 | /* If return value is ignored, transform mempcpy into memcpy. */ | |
3210 | if (target == const0_rtx && builtin_decl_implicit_p (BUILT_IN_MEMCPY)) | |
3211 | { | |
3212 | tree fn = builtin_decl_implicit (BUILT_IN_MEMCPY); | |
3213 | tree result = build_call_nofold_loc (UNKNOWN_LOCATION, fn, 3, | |
3214 | dest, src, len); | |
3215 | return expand_expr (result, target, mode, EXPAND_NORMAL); | |
3216 | } | |
3217 | else | |
3218 | { | |
3219 | const char *src_str; | |
3220 | unsigned int src_align = get_pointer_alignment (src); | |
3221 | unsigned int dest_align = get_pointer_alignment (dest); | |
3222 | rtx dest_mem, src_mem, len_rtx; | |
3223 | ||
3224 | /* If either SRC or DEST is not a pointer type, don't do this | |
3225 | operation in-line. */ | |
3226 | if (dest_align == 0 || src_align == 0) | |
3227 | return NULL_RTX; | |
3228 | ||
3229 | /* If LEN is not constant, call the normal function. */ | |
3230 | if (! host_integerp (len, 1)) | |
3231 | return NULL_RTX; | |
3232 | ||
3233 | len_rtx = expand_normal (len); | |
3234 | src_str = c_getstr (src); | |
3235 | ||
3236 | /* If SRC is a string constant and block move would be done | |
3237 | by pieces, we can avoid loading the string from memory | |
3238 | and only stored the computed constants. */ | |
3239 | if (src_str | |
3240 | && CONST_INT_P (len_rtx) | |
3241 | && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= strlen (src_str) + 1 | |
3242 | && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str, | |
3243 | CONST_CAST (char *, src_str), | |
3244 | dest_align, false)) | |
3245 | { | |
3246 | dest_mem = get_memory_rtx (dest, len); | |
3247 | set_mem_align (dest_mem, dest_align); | |
3248 | dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx), | |
3249 | builtin_memcpy_read_str, | |
3250 | CONST_CAST (char *, src_str), | |
3251 | dest_align, false, endp); | |
3252 | dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX); | |
3253 | dest_mem = convert_memory_address (ptr_mode, dest_mem); | |
3254 | return dest_mem; | |
3255 | } | |
3256 | ||
3257 | if (CONST_INT_P (len_rtx) | |
3258 | && can_move_by_pieces (INTVAL (len_rtx), | |
3259 | MIN (dest_align, src_align))) | |
3260 | { | |
3261 | dest_mem = get_memory_rtx (dest, len); | |
3262 | set_mem_align (dest_mem, dest_align); | |
3263 | src_mem = get_memory_rtx (src, len); | |
3264 | set_mem_align (src_mem, src_align); | |
3265 | dest_mem = move_by_pieces (dest_mem, src_mem, INTVAL (len_rtx), | |
3266 | MIN (dest_align, src_align), endp); | |
3267 | dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX); | |
3268 | dest_mem = convert_memory_address (ptr_mode, dest_mem); | |
3269 | return dest_mem; | |
3270 | } | |
3271 | ||
3272 | return NULL_RTX; | |
3273 | } | |
3274 | } | |
3275 | ||
3276 | #ifndef HAVE_movstr | |
3277 | # define HAVE_movstr 0 | |
3278 | # define CODE_FOR_movstr CODE_FOR_nothing | |
3279 | #endif | |
3280 | ||
3281 | /* Expand into a movstr instruction, if one is available. Return NULL_RTX if | |
3282 | we failed, the caller should emit a normal call, otherwise try to | |
3283 | get the result in TARGET, if convenient. If ENDP is 0 return the | |
3284 | destination pointer, if ENDP is 1 return the end pointer ala | |
3285 | mempcpy, and if ENDP is 2 return the end pointer minus one ala | |
3286 | stpcpy. */ | |
3287 | ||
3288 | static rtx | |
3289 | expand_movstr (tree dest, tree src, rtx target, int endp) | |
3290 | { | |
3291 | struct expand_operand ops[3]; | |
3292 | rtx dest_mem; | |
3293 | rtx src_mem; | |
3294 | ||
3295 | if (!HAVE_movstr) | |
3296 | return NULL_RTX; | |
3297 | ||
3298 | dest_mem = get_memory_rtx (dest, NULL); | |
3299 | src_mem = get_memory_rtx (src, NULL); | |
3300 | if (!endp) | |
3301 | { | |
3302 | target = force_reg (Pmode, XEXP (dest_mem, 0)); | |
3303 | dest_mem = replace_equiv_address (dest_mem, target); | |
3304 | } | |
3305 | ||
3306 | create_output_operand (&ops[0], endp ? target : NULL_RTX, Pmode); | |
3307 | create_fixed_operand (&ops[1], dest_mem); | |
3308 | create_fixed_operand (&ops[2], src_mem); | |
3309 | expand_insn (CODE_FOR_movstr, 3, ops); | |
3310 | ||
3311 | if (endp && target != const0_rtx) | |
3312 | { | |
3313 | target = ops[0].value; | |
3314 | /* movstr is supposed to set end to the address of the NUL | |
3315 | terminator. If the caller requested a mempcpy-like return value, | |
3316 | adjust it. */ | |
3317 | if (endp == 1) | |
3318 | { | |
3319 | rtx tem = plus_constant (gen_lowpart (GET_MODE (target), target), 1); | |
3320 | emit_move_insn (target, force_operand (tem, NULL_RTX)); | |
3321 | } | |
3322 | } | |
3323 | return target; | |
3324 | } | |
3325 | ||
3326 | /* Expand expression EXP, which is a call to the strcpy builtin. Return | |
3327 | NULL_RTX if we failed the caller should emit a normal call, otherwise | |
3328 | try to get the result in TARGET, if convenient (and in mode MODE if that's | |
3329 | convenient). */ | |
3330 | ||
3331 | static rtx | |
3332 | expand_builtin_strcpy (tree exp, rtx target) | |
3333 | { | |
3334 | if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE)) | |
3335 | { | |
3336 | tree dest = CALL_EXPR_ARG (exp, 0); | |
3337 | tree src = CALL_EXPR_ARG (exp, 1); | |
3338 | return expand_builtin_strcpy_args (dest, src, target); | |
3339 | } | |
3340 | return NULL_RTX; | |
3341 | } | |
3342 | ||
3343 | /* Helper function to do the actual work for expand_builtin_strcpy. The | |
3344 | arguments to the builtin_strcpy call DEST and SRC are broken out | |
3345 | so that this can also be called without constructing an actual CALL_EXPR. | |
3346 | The other arguments and return value are the same as for | |
3347 | expand_builtin_strcpy. */ | |
3348 | ||
3349 | static rtx | |
3350 | expand_builtin_strcpy_args (tree dest, tree src, rtx target) | |
3351 | { | |
3352 | return expand_movstr (dest, src, target, /*endp=*/0); | |
3353 | } | |
3354 | ||
3355 | /* Expand a call EXP to the stpcpy builtin. | |
3356 | Return NULL_RTX if we failed the caller should emit a normal call, | |
3357 | otherwise try to get the result in TARGET, if convenient (and in | |
3358 | mode MODE if that's convenient). */ | |
3359 | ||
3360 | static rtx | |
3361 | expand_builtin_stpcpy (tree exp, rtx target, enum machine_mode mode) | |
3362 | { | |
3363 | tree dst, src; | |
3364 | location_t loc = EXPR_LOCATION (exp); | |
3365 | ||
3366 | if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE)) | |
3367 | return NULL_RTX; | |
3368 | ||
3369 | dst = CALL_EXPR_ARG (exp, 0); | |
3370 | src = CALL_EXPR_ARG (exp, 1); | |
3371 | ||
3372 | /* If return value is ignored, transform stpcpy into strcpy. */ | |
3373 | if (target == const0_rtx && builtin_decl_implicit (BUILT_IN_STRCPY)) | |
3374 | { | |
3375 | tree fn = builtin_decl_implicit (BUILT_IN_STRCPY); | |
3376 | tree result = build_call_nofold_loc (loc, fn, 2, dst, src); | |
3377 | return expand_expr (result, target, mode, EXPAND_NORMAL); | |
3378 | } | |
3379 | else | |
3380 | { | |
3381 | tree len, lenp1; | |
3382 | rtx ret; | |
3383 | ||
3384 | /* Ensure we get an actual string whose length can be evaluated at | |
3385 | compile-time, not an expression containing a string. This is | |
3386 | because the latter will potentially produce pessimized code | |
3387 | when used to produce the return value. */ | |
3388 | if (! c_getstr (src) || ! (len = c_strlen (src, 0))) | |
3389 | return expand_movstr (dst, src, target, /*endp=*/2); | |
3390 | ||
3391 | lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1)); | |
3392 | ret = expand_builtin_mempcpy_args (dst, src, lenp1, | |
3393 | target, mode, /*endp=*/2); | |
3394 | ||
3395 | if (ret) | |
3396 | return ret; | |
3397 | ||
3398 | if (TREE_CODE (len) == INTEGER_CST) | |
3399 | { | |
3400 | rtx len_rtx = expand_normal (len); | |
3401 | ||
3402 | if (CONST_INT_P (len_rtx)) | |
3403 | { | |
3404 | ret = expand_builtin_strcpy_args (dst, src, target); | |
3405 | ||
3406 | if (ret) | |
3407 | { | |
3408 | if (! target) | |
3409 | { | |
3410 | if (mode != VOIDmode) | |
3411 | target = gen_reg_rtx (mode); | |
3412 | else | |
3413 | target = gen_reg_rtx (GET_MODE (ret)); | |
3414 | } | |
3415 | if (GET_MODE (target) != GET_MODE (ret)) | |
3416 | ret = gen_lowpart (GET_MODE (target), ret); | |
3417 | ||
3418 | ret = plus_constant (ret, INTVAL (len_rtx)); | |
3419 | ret = emit_move_insn (target, force_operand (ret, NULL_RTX)); | |
3420 | gcc_assert (ret); | |
3421 | ||
3422 | return target; | |
3423 | } | |
3424 | } | |
3425 | } | |
3426 | ||
3427 | return expand_movstr (dst, src, target, /*endp=*/2); | |
3428 | } | |
3429 | } | |
3430 | ||
3431 | /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE) | |
3432 | bytes from constant string DATA + OFFSET and return it as target | |
3433 | constant. */ | |
3434 | ||
3435 | rtx | |
3436 | builtin_strncpy_read_str (void *data, HOST_WIDE_INT offset, | |
3437 | enum machine_mode mode) | |
3438 | { | |
3439 | const char *str = (const char *) data; | |
3440 | ||
3441 | if ((unsigned HOST_WIDE_INT) offset > strlen (str)) | |
3442 | return const0_rtx; | |
3443 | ||
3444 | return c_readstr (str + offset, mode); | |
3445 | } | |
3446 | ||
3447 | /* Expand expression EXP, which is a call to the strncpy builtin. Return | |
3448 | NULL_RTX if we failed the caller should emit a normal call. */ | |
3449 | ||
3450 | static rtx | |
3451 | expand_builtin_strncpy (tree exp, rtx target) | |
3452 | { | |
3453 | location_t loc = EXPR_LOCATION (exp); | |
3454 | ||
3455 | if (validate_arglist (exp, | |
3456 | POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)) | |
3457 | { | |
3458 | tree dest = CALL_EXPR_ARG (exp, 0); | |
3459 | tree src = CALL_EXPR_ARG (exp, 1); | |
3460 | tree len = CALL_EXPR_ARG (exp, 2); | |
3461 | tree slen = c_strlen (src, 1); | |
3462 | ||
3463 | /* We must be passed a constant len and src parameter. */ | |
3464 | if (!host_integerp (len, 1) || !slen || !host_integerp (slen, 1)) | |
3465 | return NULL_RTX; | |
3466 | ||
3467 | slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1)); | |
3468 | ||
3469 | /* We're required to pad with trailing zeros if the requested | |
3470 | len is greater than strlen(s2)+1. In that case try to | |
3471 | use store_by_pieces, if it fails, punt. */ | |
3472 | if (tree_int_cst_lt (slen, len)) | |
3473 | { | |
3474 | unsigned int dest_align = get_pointer_alignment (dest); | |
3475 | const char *p = c_getstr (src); | |
3476 | rtx dest_mem; | |
3477 | ||
3478 | if (!p || dest_align == 0 || !host_integerp (len, 1) | |
3479 | || !can_store_by_pieces (tree_low_cst (len, 1), | |
3480 | builtin_strncpy_read_str, | |
3481 | CONST_CAST (char *, p), | |
3482 | dest_align, false)) | |
3483 | return NULL_RTX; | |
3484 | ||
3485 | dest_mem = get_memory_rtx (dest, len); | |
3486 | store_by_pieces (dest_mem, tree_low_cst (len, 1), | |
3487 | builtin_strncpy_read_str, | |
3488 | CONST_CAST (char *, p), dest_align, false, 0); | |
3489 | dest_mem = force_operand (XEXP (dest_mem, 0), target); | |
3490 | dest_mem = convert_memory_address (ptr_mode, dest_mem); | |
3491 | return dest_mem; | |
3492 | } | |
3493 | } | |
3494 | return NULL_RTX; | |
3495 | } | |
3496 | ||
3497 | /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE) | |
3498 | bytes from constant string DATA + OFFSET and return it as target | |
3499 | constant. */ | |
3500 | ||
3501 | rtx | |
3502 | builtin_memset_read_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED, | |
3503 | enum machine_mode mode) | |
3504 | { | |
3505 | const char *c = (const char *) data; | |
3506 | char *p = XALLOCAVEC (char, GET_MODE_SIZE (mode)); | |
3507 | ||
3508 | memset (p, *c, GET_MODE_SIZE (mode)); | |
3509 | ||
3510 | return c_readstr (p, mode); | |
3511 | } | |
3512 | ||
3513 | /* Callback routine for store_by_pieces. Return the RTL of a register | |
3514 | containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned | |
3515 | char value given in the RTL register data. For example, if mode is | |
3516 | 4 bytes wide, return the RTL for 0x01010101*data. */ | |
3517 | ||
3518 | static rtx | |
3519 | builtin_memset_gen_str (void *data, HOST_WIDE_INT offset ATTRIBUTE_UNUSED, | |
3520 | enum machine_mode mode) | |
3521 | { | |
3522 | rtx target, coeff; | |
3523 | size_t size; | |
3524 | char *p; | |
3525 | ||
3526 | size = GET_MODE_SIZE (mode); | |
3527 | if (size == 1) | |
3528 | return (rtx) data; | |
3529 | ||
3530 | p = XALLOCAVEC (char, size); | |
3531 | memset (p, 1, size); | |
3532 | coeff = c_readstr (p, mode); | |
3533 | ||
3534 | target = convert_to_mode (mode, (rtx) data, 1); | |
3535 | target = expand_mult (mode, target, coeff, NULL_RTX, 1); | |
3536 | return force_reg (mode, target); | |
3537 | } | |
3538 | ||
3539 | /* Expand expression EXP, which is a call to the memset builtin. Return | |
3540 | NULL_RTX if we failed the caller should emit a normal call, otherwise | |
3541 | try to get the result in TARGET, if convenient (and in mode MODE if that's | |
3542 | convenient). */ | |
3543 | ||
3544 | static rtx | |
3545 | expand_builtin_memset (tree exp, rtx target, enum machine_mode mode) | |
3546 | { | |
3547 | if (!validate_arglist (exp, | |
3548 | POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE)) | |
3549 | return NULL_RTX; | |
3550 | else | |
3551 | { | |
3552 | tree dest = CALL_EXPR_ARG (exp, 0); | |
3553 | tree val = CALL_EXPR_ARG (exp, 1); | |
3554 | tree len = CALL_EXPR_ARG (exp, 2); | |
3555 | return expand_builtin_memset_args (dest, val, len, target, mode, exp); | |
3556 | } | |
3557 | } | |
3558 | ||
3559 | /* Helper function to do the actual work for expand_builtin_memset. The | |
3560 | arguments to the builtin_memset call DEST, VAL, and LEN are broken out | |
3561 | so that this can also be called without constructing an actual CALL_EXPR. | |
3562 | The other arguments and return value are the same as for | |
3563 | expand_builtin_memset. */ | |
3564 | ||
3565 | static rtx | |
3566 | expand_builtin_memset_args (tree dest, tree val, tree len, | |
3567 | rtx target, enum machine_mode mode, tree orig_exp) | |
3568 | { | |
3569 | tree fndecl, fn; | |
3570 | enum built_in_function fcode; | |
3571 | enum machine_mode val_mode; | |
3572 | char c; | |
3573 | unsigned int dest_align; | |
3574 | rtx dest_mem, dest_addr, len_rtx; | |
3575 | HOST_WIDE_INT expected_size = -1; | |
3576 | unsigned int expected_align = 0; | |
3577 | ||
3578 | dest_align = get_pointer_alignment (dest); | |
3579 | ||
3580 | /* If DEST is not a pointer type, don't do this operation in-line. */ | |
3581 | if (dest_align == 0) | |
3582 | return NULL_RTX; | |
3583 | ||
3584 | if (currently_expanding_gimple_stmt) | |
3585 | stringop_block_profile (currently_expanding_gimple_stmt, | |
3586 | &expected_align, &expected_size); | |
3587 | ||
3588 | if (expected_align < dest_align) | |
3589 | expected_align = dest_align; | |
3590 | ||
3591 | /* If the LEN parameter is zero, return DEST. */ | |
3592 | if (integer_zerop (len)) | |
3593 | { | |
3594 | /* Evaluate and ignore VAL in case it has side-effects. */ | |
3595 | expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL); | |
3596 | return expand_expr (dest, target, mode, EXPAND_NORMAL); | |
3597 | } | |
3598 | ||
3599 | /* Stabilize the arguments in case we fail. */ | |
3600 | dest = builtin_save_expr (dest); | |
3601 | val = builtin_save_expr (val); | |
3602 | len = builtin_save_expr (len); | |
3603 | ||
3604 | len_rtx = expand_normal (len); | |
3605 | dest_mem = get_memory_rtx (dest, len); | |
3606 | val_mode = TYPE_MODE (unsigned_char_type_node); | |
3607 | ||
3608 | if (TREE_CODE (val) != INTEGER_CST) | |
3609 | { | |
3610 | rtx val_rtx; | |
3611 | ||
3612 | val_rtx = expand_normal (val); | |
3613 | val_rtx = convert_to_mode (val_mode, val_rtx, 0); | |
3614 | ||
3615 | /* Assume that we can memset by pieces if we can store | |
3616 | * the coefficients by pieces (in the required modes). | |
3617 | * We can't pass builtin_memset_gen_str as that emits RTL. */ | |
3618 | c = 1; | |
3619 | if (host_integerp (len, 1) | |
3620 | && can_store_by_pieces (tree_low_cst (len, 1), | |
3621 | builtin_memset_read_str, &c, dest_align, | |
3622 | true)) | |
3623 | { | |
3624 | val_rtx = force_reg (val_mode, val_rtx); | |
3625 | store_by_pieces (dest_mem, tree_low_cst (len, 1), | |
3626 | builtin_memset_gen_str, val_rtx, dest_align, | |
3627 | true, 0); | |
3628 | } | |
3629 | else if (!set_storage_via_setmem (dest_mem, len_rtx, val_rtx, | |
3630 | dest_align, expected_align, | |
3631 | expected_size)) | |
3632 | goto do_libcall; | |
3633 | ||
3634 | dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX); | |
3635 | dest_mem = convert_memory_address (ptr_mode, dest_mem); | |
3636 | return dest_mem; | |
3637 | } | |
3638 | ||
3639 | if (target_char_cast (val, &c)) | |
3640 | goto do_libcall; | |
3641 | ||
3642 | if (c) | |
3643 | { | |
3644 | if (host_integerp (len, 1) | |
3645 | && can_store_by_pieces (tree_low_cst (len, 1), | |
3646 | builtin_memset_read_str, &c, dest_align, | |
3647 | true)) | |
3648 | store_by_pieces (dest_mem, tree_low_cst (len, 1), | |
3649 | builtin_memset_read_str, &c, dest_align, true, 0); | |
3650 | else if (!set_storage_via_setmem (dest_mem, len_rtx, | |
3651 | gen_int_mode (c, val_mode), | |
3652 | dest_align, expected_align, | |
3653 | expected_size)) | |
3654 | goto do_libcall; | |
3655 | ||
3656 | dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX); | |
3657 | dest_mem = convert_memory_address (ptr_mode, dest_mem); | |
3658 | return dest_mem; | |
3659 | } | |
3660 | ||
3661 | set_mem_align (dest_mem, dest_align); | |
3662 | dest_addr = clear_storage_hints (dest_mem, len_rtx, | |
3663 | CALL_EXPR_TAILCALL (orig_exp) | |
3664 | ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL, | |
3665 | expected_align, expected_size); | |
3666 | ||
3667 | if (dest_addr == 0) | |
3668 | { | |
3669 | dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX); | |
3670 | dest_addr = convert_memory_address (ptr_mode, dest_addr); | |
3671 | } | |
3672 | ||
3673 | return dest_addr; | |
3674 | ||
3675 | do_libcall: | |
3676 | fndecl = get_callee_fndecl (orig_exp); | |
3677 | fcode = DECL_FUNCTION_CODE (fndecl); | |
3678 | if (fcode == BUILT_IN_MEMSET) | |
3679 | fn = build_call_nofold_loc (EXPR_LOCATION (orig_exp), fndecl, 3, | |
3680 | dest, val, len); | |
3681 | else if (fcode == BUILT_IN_BZERO) | |
3682 | fn = build_call_nofold_loc (EXPR_LOCATION (orig_exp), fndecl, 2, | |
3683 | dest, len); | |
3684 | else | |
3685 | gcc_unreachable (); | |
3686 | gcc_assert (TREE_CODE (fn) == CALL_EXPR); | |
3687 | CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (orig_exp); | |
3688 | return expand_call (fn, target, target == const0_rtx); | |
3689 | } | |
3690 | ||
3691 | /* Expand expression EXP, which is a call to the bzero builtin. Return | |
3692 | NULL_RTX if we failed the caller should emit a normal call. */ | |
3693 | ||
3694 | static rtx | |
3695 | expand_builtin_bzero (tree exp) | |
3696 | { | |
3697 | tree dest, size; | |
3698 | location_t loc = EXPR_LOCATION (exp); | |
3699 | ||
3700 | if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)) | |
3701 | return NULL_RTX; | |
3702 | ||
3703 | dest = CALL_EXPR_ARG (exp, 0); | |
3704 | size = CALL_EXPR_ARG (exp, 1); | |
3705 | ||
3706 | /* New argument list transforming bzero(ptr x, int y) to | |
3707 | memset(ptr x, int 0, size_t y). This is done this way | |
3708 | so that if it isn't expanded inline, we fallback to | |
3709 | calling bzero instead of memset. */ | |
3710 | ||
3711 | return expand_builtin_memset_args (dest, integer_zero_node, | |
3712 | fold_convert_loc (loc, | |
3713 | size_type_node, size), | |
3714 | const0_rtx, VOIDmode, exp); | |
3715 | } | |
3716 | ||
3717 | /* Expand expression EXP, which is a call to the memcmp built-in function. | |
3718 | Return NULL_RTX if we failed and the caller should emit a normal call, | |
3719 | otherwise try to get the result in TARGET, if convenient (and in mode | |
3720 | MODE, if that's convenient). */ | |
3721 | ||
3722 | static rtx | |
3723 | expand_builtin_memcmp (tree exp, ATTRIBUTE_UNUSED rtx target, | |
3724 | ATTRIBUTE_UNUSED enum machine_mode mode) | |
3725 | { | |
3726 | location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp); | |
3727 | ||
3728 | if (!validate_arglist (exp, | |
3729 | POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)) | |
3730 | return NULL_RTX; | |
3731 | ||
3732 | /* Note: The cmpstrnsi pattern, if it exists, is not suitable for | |
3733 | implementing memcmp because it will stop if it encounters two | |
3734 | zero bytes. */ | |
3735 | #if defined HAVE_cmpmemsi | |
3736 | { | |
3737 | rtx arg1_rtx, arg2_rtx, arg3_rtx; | |
3738 | rtx result; | |
3739 | rtx insn; | |
3740 | tree arg1 = CALL_EXPR_ARG (exp, 0); | |
3741 | tree arg2 = CALL_EXPR_ARG (exp, 1); | |
3742 | tree len = CALL_EXPR_ARG (exp, 2); | |
3743 | ||
3744 | unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT; | |
3745 | unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT; | |
3746 | enum machine_mode insn_mode; | |
3747 | ||
3748 | if (HAVE_cmpmemsi) | |
3749 | insn_mode = insn_data[(int) CODE_FOR_cmpmemsi].operand[0].mode; | |
3750 | else | |
3751 | return NULL_RTX; | |
3752 | ||
3753 | /* If we don't have POINTER_TYPE, call the function. */ | |
3754 | if (arg1_align == 0 || arg2_align == 0) | |
3755 | return NULL_RTX; | |
3756 | ||
3757 | /* Make a place to write the result of the instruction. */ | |
3758 | result = target; | |
3759 | if (! (result != 0 | |
3760 | && REG_P (result) && GET_MODE (result) == insn_mode | |
3761 | && REGNO (result) >= FIRST_PSEUDO_REGISTER)) | |
3762 | result = gen_reg_rtx (insn_mode); | |
3763 | ||
3764 | arg1_rtx = get_memory_rtx (arg1, len); | |
3765 | arg2_rtx = get_memory_rtx (arg2, len); | |
3766 | arg3_rtx = expand_normal (fold_convert_loc (loc, sizetype, len)); | |
3767 | ||
3768 | /* Set MEM_SIZE as appropriate. */ | |
3769 | if (CONST_INT_P (arg3_rtx)) | |
3770 | { | |
3771 | set_mem_size (arg1_rtx, INTVAL (arg3_rtx)); | |
3772 | set_mem_size (arg2_rtx, INTVAL (arg3_rtx)); | |
3773 | } | |
3774 | ||
3775 | if (HAVE_cmpmemsi) | |
3776 | insn = gen_cmpmemsi (result, arg1_rtx, arg2_rtx, arg3_rtx, | |
3777 | GEN_INT (MIN (arg1_align, arg2_align))); | |
3778 | else | |
3779 | gcc_unreachable (); | |
3780 | ||
3781 | if (insn) | |
3782 | emit_insn (insn); | |
3783 | else | |
3784 | emit_library_call_value (memcmp_libfunc, result, LCT_PURE, | |
3785 | TYPE_MODE (integer_type_node), 3, | |
3786 | XEXP (arg1_rtx, 0), Pmode, | |
3787 | XEXP (arg2_rtx, 0), Pmode, | |
3788 | convert_to_mode (TYPE_MODE (sizetype), arg3_rtx, | |
3789 | TYPE_UNSIGNED (sizetype)), | |
3790 | TYPE_MODE (sizetype)); | |
3791 | ||
3792 | /* Return the value in the proper mode for this function. */ | |
3793 | mode = TYPE_MODE (TREE_TYPE (exp)); | |
3794 | if (GET_MODE (result) == mode) | |
3795 | return result; | |
3796 | else if (target != 0) | |
3797 | { | |
3798 | convert_move (target, result, 0); | |
3799 | return target; | |
3800 | } | |
3801 | else | |
3802 | return convert_to_mode (mode, result, 0); | |
3803 | } | |
3804 | #endif /* HAVE_cmpmemsi. */ | |
3805 | ||
3806 | return NULL_RTX; | |
3807 | } | |
3808 | ||
3809 | /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX | |
3810 | if we failed the caller should emit a normal call, otherwise try to get | |
3811 | the result in TARGET, if convenient. */ | |
3812 | ||
3813 | static rtx | |
3814 | expand_builtin_strcmp (tree exp, ATTRIBUTE_UNUSED rtx target) | |
3815 | { | |
3816 | if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE)) | |
3817 | return NULL_RTX; | |
3818 | ||
3819 | #if defined HAVE_cmpstrsi || defined HAVE_cmpstrnsi | |
3820 | if (direct_optab_handler (cmpstr_optab, SImode) != CODE_FOR_nothing | |
3821 | || direct_optab_handler (cmpstrn_optab, SImode) != CODE_FOR_nothing) | |
3822 | { | |
3823 | rtx arg1_rtx, arg2_rtx; | |
3824 | rtx result, insn = NULL_RTX; | |
3825 | tree fndecl, fn; | |
3826 | tree arg1 = CALL_EXPR_ARG (exp, 0); | |
3827 | tree arg2 = CALL_EXPR_ARG (exp, 1); | |
3828 | ||
3829 | unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT; | |
3830 | unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT; | |
3831 | ||
3832 | /* If we don't have POINTER_TYPE, call the function. */ | |
3833 | if (arg1_align == 0 || arg2_align == 0) | |
3834 | return NULL_RTX; | |
3835 | ||
3836 | /* Stabilize the arguments in case gen_cmpstr(n)si fail. */ | |
3837 | arg1 = builtin_save_expr (arg1); | |
3838 | arg2 = builtin_save_expr (arg2); | |
3839 | ||
3840 | arg1_rtx = get_memory_rtx (arg1, NULL); | |
3841 | arg2_rtx = get_memory_rtx (arg2, NULL); | |
3842 | ||
3843 | #ifdef HAVE_cmpstrsi | |
3844 | /* Try to call cmpstrsi. */ | |
3845 | if (HAVE_cmpstrsi) | |
3846 | { | |
3847 | enum machine_mode insn_mode | |
3848 | = insn_data[(int) CODE_FOR_cmpstrsi].operand[0].mode; | |
3849 | ||
3850 | /* Make a place to write the result of the instruction. */ | |
3851 | result = target; | |
3852 | if (! (result != 0 | |
3853 | && REG_P (result) && GET_MODE (result) == insn_mode | |
3854 | && REGNO (result) >= FIRST_PSEUDO_REGISTER)) | |
3855 | result = gen_reg_rtx (insn_mode); | |
3856 | ||
3857 | insn = gen_cmpstrsi (result, arg1_rtx, arg2_rtx, | |
3858 | GEN_INT (MIN (arg1_align, arg2_align))); | |
3859 | } | |
3860 | #endif | |
3861 | #ifdef HAVE_cmpstrnsi | |
3862 | /* Try to determine at least one length and call cmpstrnsi. */ | |
3863 | if (!insn && HAVE_cmpstrnsi) | |
3864 | { | |
3865 | tree len; | |
3866 | rtx arg3_rtx; | |
3867 | ||
3868 | enum machine_mode insn_mode | |
3869 | = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode; | |
3870 | tree len1 = c_strlen (arg1, 1); | |
3871 | tree len2 = c_strlen (arg2, 1); | |
3872 | ||
3873 | if (len1) | |
3874 | len1 = size_binop (PLUS_EXPR, ssize_int (1), len1); | |
3875 | if (len2) | |
3876 | len2 = size_binop (PLUS_EXPR, ssize_int (1), len2); | |
3877 | ||
3878 | /* If we don't have a constant length for the first, use the length | |
3879 | of the second, if we know it. We don't require a constant for | |
3880 | this case; some cost analysis could be done if both are available | |
3881 | but neither is constant. For now, assume they're equally cheap, | |
3882 | unless one has side effects. If both strings have constant lengths, | |
3883 | use the smaller. */ | |
3884 | ||
3885 | if (!len1) | |
3886 | len = len2; | |
3887 | else if (!len2) | |
3888 | len = len1; | |
3889 | else if (TREE_SIDE_EFFECTS (len1)) | |
3890 | len = len2; | |
3891 | else if (TREE_SIDE_EFFECTS (len2)) | |
3892 | len = len1; | |
3893 | else if (TREE_CODE (len1) != INTEGER_CST) | |
3894 | len = len2; | |
3895 | else if (TREE_CODE (len2) != INTEGER_CST) | |
3896 | len = len1; | |
3897 | else if (tree_int_cst_lt (len1, len2)) | |
3898 | len = len1; | |
3899 | else | |
3900 | len = len2; | |
3901 | ||
3902 | /* If both arguments have side effects, we cannot optimize. */ | |
3903 | if (!len || TREE_SIDE_EFFECTS (len)) | |
3904 | goto do_libcall; | |
3905 | ||
3906 | arg3_rtx = expand_normal (len); | |
3907 | ||
3908 | /* Make a place to write the result of the instruction. */ | |
3909 | result = target; | |
3910 | if (! (result != 0 | |
3911 | && REG_P (result) && GET_MODE (result) == insn_mode | |
3912 | && REGNO (result) >= FIRST_PSEUDO_REGISTER)) | |
3913 | result = gen_reg_rtx (insn_mode); | |
3914 | ||
3915 | insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx, | |
3916 | GEN_INT (MIN (arg1_align, arg2_align))); | |
3917 | } | |
3918 | #endif | |
3919 | ||
3920 | if (insn) | |
3921 | { | |
3922 | enum machine_mode mode; | |
3923 | emit_insn (insn); | |
3924 | ||
3925 | /* Return the value in the proper mode for this function. */ | |
3926 | mode = TYPE_MODE (TREE_TYPE (exp)); | |
3927 | if (GET_MODE (result) == mode) | |
3928 | return result; | |
3929 | if (target == 0) | |
3930 | return convert_to_mode (mode, result, 0); | |
3931 | convert_move (target, result, 0); | |
3932 | return target; | |
3933 | } | |
3934 | ||
3935 | /* Expand the library call ourselves using a stabilized argument | |
3936 | list to avoid re-evaluating the function's arguments twice. */ | |
3937 | #ifdef HAVE_cmpstrnsi | |
3938 | do_libcall: | |
3939 | #endif | |
3940 | fndecl = get_callee_fndecl (exp); | |
3941 | fn = build_call_nofold_loc (EXPR_LOCATION (exp), fndecl, 2, arg1, arg2); | |
3942 | gcc_assert (TREE_CODE (fn) == CALL_EXPR); | |
3943 | CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp); | |
3944 | return expand_call (fn, target, target == const0_rtx); | |
3945 | } | |
3946 | #endif | |
3947 | return NULL_RTX; | |
3948 | } | |
3949 | ||
3950 | /* Expand expression EXP, which is a call to the strncmp builtin. Return | |
3951 | NULL_RTX if we failed the caller should emit a normal call, otherwise try to get | |
3952 | the result in TARGET, if convenient. */ | |
3953 | ||
3954 | static rtx | |
3955 | expand_builtin_strncmp (tree exp, ATTRIBUTE_UNUSED rtx target, | |
3956 | ATTRIBUTE_UNUSED enum machine_mode mode) | |
3957 | { | |
3958 | location_t loc ATTRIBUTE_UNUSED = EXPR_LOCATION (exp); | |
3959 | ||
3960 | if (!validate_arglist (exp, | |
3961 | POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)) | |
3962 | return NULL_RTX; | |
3963 | ||
3964 | /* If c_strlen can determine an expression for one of the string | |
3965 | lengths, and it doesn't have side effects, then emit cmpstrnsi | |
3966 | using length MIN(strlen(string)+1, arg3). */ | |
3967 | #ifdef HAVE_cmpstrnsi | |
3968 | if (HAVE_cmpstrnsi) | |
3969 | { | |
3970 | tree len, len1, len2; | |
3971 | rtx arg1_rtx, arg2_rtx, arg3_rtx; | |
3972 | rtx result, insn; | |
3973 | tree fndecl, fn; | |
3974 | tree arg1 = CALL_EXPR_ARG (exp, 0); | |
3975 | tree arg2 = CALL_EXPR_ARG (exp, 1); | |
3976 | tree arg3 = CALL_EXPR_ARG (exp, 2); | |
3977 | ||
3978 | unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT; | |
3979 | unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT; | |
3980 | enum machine_mode insn_mode | |
3981 | = insn_data[(int) CODE_FOR_cmpstrnsi].operand[0].mode; | |
3982 | ||
3983 | len1 = c_strlen (arg1, 1); | |
3984 | len2 = c_strlen (arg2, 1); | |
3985 | ||
3986 | if (len1) | |
3987 | len1 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len1); | |
3988 | if (len2) | |
3989 | len2 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len2); | |
3990 | ||
3991 | /* If we don't have a constant length for the first, use the length | |
3992 | of the second, if we know it. We don't require a constant for | |
3993 | this case; some cost analysis could be done if both are available | |
3994 | but neither is constant. For now, assume they're equally cheap, | |
3995 | unless one has side effects. If both strings have constant lengths, | |
3996 | use the smaller. */ | |
3997 | ||
3998 | if (!len1) | |
3999 | len = len2; | |
4000 | else if (!len2) | |
4001 | len = len1; | |
4002 | else if (TREE_SIDE_EFFECTS (len1)) | |
4003 | len = len2; | |
4004 | else if (TREE_SIDE_EFFECTS (len2)) | |
4005 | len = len1; | |
4006 | else if (TREE_CODE (len1) != INTEGER_CST) | |
4007 | len = len2; | |
4008 | else if (TREE_CODE (len2) != INTEGER_CST) | |
4009 | len = len1; | |
4010 | else if (tree_int_cst_lt (len1, len2)) | |
4011 | len = len1; | |
4012 | else | |
4013 | len = len2; | |
4014 | ||
4015 | /* If both arguments have side effects, we cannot optimize. */ | |
4016 | if (!len || TREE_SIDE_EFFECTS (len)) | |
4017 | return NULL_RTX; | |
4018 | ||
4019 | /* The actual new length parameter is MIN(len,arg3). */ | |
4020 | len = fold_build2_loc (loc, MIN_EXPR, TREE_TYPE (len), len, | |
4021 | fold_convert_loc (loc, TREE_TYPE (len), arg3)); | |
4022 | ||
4023 | /* If we don't have POINTER_TYPE, call the function. */ | |
4024 | if (arg1_align == 0 || arg2_align == 0) | |
4025 | return NULL_RTX; | |
4026 | ||
4027 | /* Make a place to write the result of the instruction. */ | |
4028 | result = target; | |
4029 | if (! (result != 0 | |
4030 | && REG_P (result) && GET_MODE (result) == insn_mode | |
4031 | && REGNO (result) >= FIRST_PSEUDO_REGISTER)) | |
4032 | result = gen_reg_rtx (insn_mode); | |
4033 | ||
4034 | /* Stabilize the arguments in case gen_cmpstrnsi fails. */ | |
4035 | arg1 = builtin_save_expr (arg1); | |
4036 | arg2 = builtin_save_expr (arg2); | |
4037 | len = builtin_save_expr (len); | |
4038 | ||
4039 | arg1_rtx = get_memory_rtx (arg1, len); | |
4040 | arg2_rtx = get_memory_rtx (arg2, len); | |
4041 | arg3_rtx = expand_normal (len); | |
4042 | insn = gen_cmpstrnsi (result, arg1_rtx, arg2_rtx, arg3_rtx, | |
4043 | GEN_INT (MIN (arg1_align, arg2_align))); | |
4044 | if (insn) | |
4045 | { | |
4046 | emit_insn (insn); | |
4047 | ||
4048 | /* Return the value in the proper mode for this function. */ | |
4049 | mode = TYPE_MODE (TREE_TYPE (exp)); | |
4050 | if (GET_MODE (result) == mode) | |
4051 | return result; | |
4052 | if (target == 0) | |
4053 | return convert_to_mode (mode, result, 0); | |
4054 | convert_move (target, result, 0); | |
4055 | return target; | |
4056 | } | |
4057 | ||
4058 | /* Expand the library call ourselves using a stabilized argument | |
4059 | list to avoid re-evaluating the function's arguments twice. */ | |
4060 | fndecl = get_callee_fndecl (exp); | |
4061 | fn = build_call_nofold_loc (EXPR_LOCATION (exp), fndecl, 3, | |
4062 | arg1, arg2, len); | |
4063 | gcc_assert (TREE_CODE (fn) == CALL_EXPR); | |
4064 | CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp); | |
4065 | return expand_call (fn, target, target == const0_rtx); | |
4066 | } | |
4067 | #endif | |
4068 | return NULL_RTX; | |
4069 | } | |
4070 | ||
4071 | /* Expand a call to __builtin_saveregs, generating the result in TARGET, | |
4072 | if that's convenient. */ | |
4073 | ||
4074 | rtx | |
4075 | expand_builtin_saveregs (void) | |
4076 | { | |
4077 | rtx val, seq; | |
4078 | ||
4079 | /* Don't do __builtin_saveregs more than once in a function. | |
4080 | Save the result of the first call and reuse it. */ | |
4081 | if (saveregs_value != 0) | |
4082 | return saveregs_value; | |
4083 | ||
4084 | /* When this function is called, it means that registers must be | |
4085 | saved on entry to this function. So we migrate the call to the | |
4086 | first insn of this function. */ | |
4087 | ||
4088 | start_sequence (); | |
4089 | ||
4090 | /* Do whatever the machine needs done in this case. */ | |
4091 | val = targetm.calls.expand_builtin_saveregs (); | |
4092 | ||
4093 | seq = get_insns (); | |
4094 | end_sequence (); | |
4095 | ||
4096 | saveregs_value = val; | |
4097 | ||
4098 | /* Put the insns after the NOTE that starts the function. If this | |
4099 | is inside a start_sequence, make the outer-level insn chain current, so | |
4100 | the code is placed at the start of the function. */ | |
4101 | push_topmost_sequence (); | |
4102 | emit_insn_after (seq, entry_of_function ()); | |
4103 | pop_topmost_sequence (); | |
4104 | ||
4105 | return val; | |
4106 | } | |
4107 | ||
4108 | /* Expand a call to __builtin_next_arg. */ | |
4109 | ||
4110 | static rtx | |
4111 | expand_builtin_next_arg (void) | |
4112 | { | |
4113 | /* Checking arguments is already done in fold_builtin_next_arg | |
4114 | that must be called before this function. */ | |
4115 | return expand_binop (ptr_mode, add_optab, | |
4116 | crtl->args.internal_arg_pointer, | |
4117 | crtl->args.arg_offset_rtx, | |
4118 | NULL_RTX, 0, OPTAB_LIB_WIDEN); | |
4119 | } | |
4120 | ||
4121 | /* Make it easier for the backends by protecting the valist argument | |
4122 | from multiple evaluations. */ | |
4123 | ||
4124 | static tree | |
4125 | stabilize_va_list_loc (location_t loc, tree valist, int needs_lvalue) | |
4126 | { | |
4127 | tree vatype = targetm.canonical_va_list_type (TREE_TYPE (valist)); | |
4128 | ||
4129 | /* The current way of determining the type of valist is completely | |
4130 | bogus. We should have the information on the va builtin instead. */ | |
4131 | if (!vatype) | |
4132 | vatype = targetm.fn_abi_va_list (cfun->decl); | |
4133 | ||
4134 | if (TREE_CODE (vatype) == ARRAY_TYPE) | |
4135 | { | |
4136 | if (TREE_SIDE_EFFECTS (valist)) | |
4137 | valist = save_expr (valist); | |
4138 | ||
4139 | /* For this case, the backends will be expecting a pointer to | |
4140 | vatype, but it's possible we've actually been given an array | |
4141 | (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)). | |
4142 | So fix it. */ | |
4143 | if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE) | |
4144 | { | |
4145 | tree p1 = build_pointer_type (TREE_TYPE (vatype)); | |
4146 | valist = build_fold_addr_expr_with_type_loc (loc, valist, p1); | |
4147 | } | |
4148 | } | |
4149 | else | |
4150 | { | |
4151 | tree pt = build_pointer_type (vatype); | |
4152 | ||
4153 | if (! needs_lvalue) | |
4154 | { | |
4155 | if (! TREE_SIDE_EFFECTS (valist)) | |
4156 | return valist; | |
4157 | ||
4158 | valist = fold_build1_loc (loc, ADDR_EXPR, pt, valist); | |
4159 | TREE_SIDE_EFFECTS (valist) = 1; | |
4160 | } | |
4161 | ||
4162 | if (TREE_SIDE_EFFECTS (valist)) | |
4163 | valist = save_expr (valist); | |
4164 | valist = fold_build2_loc (loc, MEM_REF, | |
4165 | vatype, valist, build_int_cst (pt, 0)); | |
4166 | } | |
4167 | ||
4168 | return valist; | |
4169 | } | |
4170 | ||
4171 | /* The "standard" definition of va_list is void*. */ | |
4172 | ||
4173 | tree | |
4174 | std_build_builtin_va_list (void) | |
4175 | { | |
4176 | return ptr_type_node; | |
4177 | } | |
4178 | ||
4179 | /* The "standard" abi va_list is va_list_type_node. */ | |
4180 | ||
4181 | tree | |
4182 | std_fn_abi_va_list (tree fndecl ATTRIBUTE_UNUSED) | |
4183 | { | |
4184 | return va_list_type_node; | |
4185 | } | |
4186 | ||
4187 | /* The "standard" type of va_list is va_list_type_node. */ | |
4188 | ||
4189 | tree | |
4190 | std_canonical_va_list_type (tree type) | |
4191 | { | |
4192 | tree wtype, htype; | |
4193 | ||
4194 | if (INDIRECT_REF_P (type)) | |
4195 | type = TREE_TYPE (type); | |
4196 | else if (POINTER_TYPE_P (type) && POINTER_TYPE_P (TREE_TYPE(type))) | |
4197 | type = TREE_TYPE (type); | |
4198 | wtype = va_list_type_node; | |
4199 | htype = type; | |
4200 | /* Treat structure va_list types. */ | |
4201 | if (TREE_CODE (wtype) == RECORD_TYPE && POINTER_TYPE_P (htype)) | |
4202 | htype = TREE_TYPE (htype); | |
4203 | else if (TREE_CODE (wtype) == ARRAY_TYPE) | |
4204 | { | |
4205 | /* If va_list is an array type, the argument may have decayed | |
4206 | to a pointer type, e.g. by being passed to another function. | |
4207 | In that case, unwrap both types so that we can compare the | |
4208 | underlying records. */ | |
4209 | if (TREE_CODE (htype) == ARRAY_TYPE | |
4210 | || POINTER_TYPE_P (htype)) | |
4211 | { | |
4212 | wtype = TREE_TYPE (wtype); | |
4213 | htype = TREE_TYPE (htype); | |
4214 | } | |
4215 | } | |
4216 | if (TYPE_MAIN_VARIANT (wtype) == TYPE_MAIN_VARIANT (htype)) | |
4217 | return va_list_type_node; | |
4218 | ||
4219 | return NULL_TREE; | |
4220 | } | |
4221 | ||
4222 | /* The "standard" implementation of va_start: just assign `nextarg' to | |
4223 | the variable. */ | |
4224 | ||
4225 | void | |
4226 | std_expand_builtin_va_start (tree valist, rtx nextarg) | |
4227 | { | |
4228 | rtx va_r = expand_expr (valist, NULL_RTX, VOIDmode, EXPAND_WRITE); | |
4229 | convert_move (va_r, nextarg, 0); | |
4230 | } | |
4231 | ||
4232 | /* Expand EXP, a call to __builtin_va_start. */ | |
4233 | ||
4234 | static rtx | |
4235 | expand_builtin_va_start (tree exp) | |
4236 | { | |
4237 | rtx nextarg; | |
4238 | tree valist; | |
4239 | location_t loc = EXPR_LOCATION (exp); | |
4240 | ||
4241 | if (call_expr_nargs (exp) < 2) | |
4242 | { | |
4243 | error_at (loc, "too few arguments to function %<va_start%>"); | |
4244 | return const0_rtx; | |
4245 | } | |
4246 | ||
4247 | if (fold_builtin_next_arg (exp, true)) | |
4248 | return const0_rtx; | |
4249 | ||
4250 | nextarg = expand_builtin_next_arg (); | |
4251 | valist = stabilize_va_list_loc (loc, CALL_EXPR_ARG (exp, 0), 1); | |
4252 | ||
4253 | if (targetm.expand_builtin_va_start) | |
4254 | targetm.expand_builtin_va_start (valist, nextarg); | |
4255 | else | |
4256 | std_expand_builtin_va_start (valist, nextarg); | |
4257 | ||
4258 | return const0_rtx; | |
4259 | } | |
4260 | ||
4261 | /* The "standard" implementation of va_arg: read the value from the | |
4262 | current (padded) address and increment by the (padded) size. */ | |
4263 | ||
4264 | tree | |
4265 | std_gimplify_va_arg_expr (tree valist, tree type, gimple_seq *pre_p, | |
4266 | gimple_seq *post_p) | |
4267 | { | |
4268 | tree addr, t, type_size, rounded_size, valist_tmp; | |
4269 | unsigned HOST_WIDE_INT align, boundary; | |
4270 | bool indirect; | |
4271 | ||
4272 | #ifdef ARGS_GROW_DOWNWARD | |
4273 | /* All of the alignment and movement below is for args-grow-up machines. | |
4274 | As of 2004, there are only 3 ARGS_GROW_DOWNWARD targets, and they all | |
4275 | implement their own specialized gimplify_va_arg_expr routines. */ | |
4276 | gcc_unreachable (); | |
4277 | #endif | |
4278 | ||
4279 | indirect = pass_by_reference (NULL, TYPE_MODE (type), type, false); | |
4280 | if (indirect) | |
4281 | type = build_pointer_type (type); | |
4282 | ||
4283 | align = PARM_BOUNDARY / BITS_PER_UNIT; | |
4284 | boundary = targetm.calls.function_arg_boundary (TYPE_MODE (type), type); | |
4285 | ||
4286 | /* When we align parameter on stack for caller, if the parameter | |
4287 | alignment is beyond MAX_SUPPORTED_STACK_ALIGNMENT, it will be | |
4288 | aligned at MAX_SUPPORTED_STACK_ALIGNMENT. We will match callee | |
4289 | here with caller. */ | |
4290 | if (boundary > MAX_SUPPORTED_STACK_ALIGNMENT) | |
4291 | boundary = MAX_SUPPORTED_STACK_ALIGNMENT; | |
4292 | ||
4293 | boundary /= BITS_PER_UNIT; | |
4294 | ||
4295 | /* Hoist the valist value into a temporary for the moment. */ | |
4296 | valist_tmp = get_initialized_tmp_var (valist, pre_p, NULL); | |
4297 | ||
4298 | /* va_list pointer is aligned to PARM_BOUNDARY. If argument actually | |
4299 | requires greater alignment, we must perform dynamic alignment. */ | |
4300 | if (boundary > align | |
4301 | && !integer_zerop (TYPE_SIZE (type))) | |
4302 | { | |
4303 | t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp, | |
4304 | fold_build_pointer_plus_hwi (valist_tmp, boundary - 1)); | |
4305 | gimplify_and_add (t, pre_p); | |
4306 | ||
4307 | t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist_tmp, | |
4308 | fold_build2 (BIT_AND_EXPR, TREE_TYPE (valist), | |
4309 | valist_tmp, | |
4310 | build_int_cst (TREE_TYPE (valist), -boundary))); | |
4311 | gimplify_and_add (t, pre_p); | |
4312 | } | |
4313 | else | |
4314 | boundary = align; | |
4315 | ||
4316 | /* If the actual alignment is less than the alignment of the type, | |
4317 | adjust the type accordingly so that we don't assume strict alignment | |
4318 | when dereferencing the pointer. */ | |
4319 | boundary *= BITS_PER_UNIT; | |
4320 | if (boundary < TYPE_ALIGN (type)) | |
4321 | { | |
4322 | type = build_variant_type_copy (type); | |
4323 | TYPE_ALIGN (type) = boundary; | |
4324 | } | |
4325 | ||
4326 | /* Compute the rounded size of the type. */ | |
4327 | type_size = size_in_bytes (type); | |
4328 | rounded_size = round_up (type_size, align); | |
4329 | ||
4330 | /* Reduce rounded_size so it's sharable with the postqueue. */ | |
4331 | gimplify_expr (&rounded_size, pre_p, post_p, is_gimple_val, fb_rvalue); | |
4332 | ||
4333 | /* Get AP. */ | |
4334 | addr = valist_tmp; | |
4335 | if (PAD_VARARGS_DOWN && !integer_zerop (rounded_size)) | |
4336 | { | |
4337 | /* Small args are padded downward. */ | |
4338 | t = fold_build2_loc (input_location, GT_EXPR, sizetype, | |
4339 | rounded_size, size_int (align)); | |
4340 | t = fold_build3 (COND_EXPR, sizetype, t, size_zero_node, | |
4341 | size_binop (MINUS_EXPR, rounded_size, type_size)); | |
4342 | addr = fold_build_pointer_plus (addr, t); | |
4343 | } | |
4344 | ||
4345 | /* Compute new value for AP. */ | |
4346 | t = fold_build_pointer_plus (valist_tmp, rounded_size); | |
4347 | t = build2 (MODIFY_EXPR, TREE_TYPE (valist), valist, t); | |
4348 | gimplify_and_add (t, pre_p); | |
4349 | ||
4350 | addr = fold_convert (build_pointer_type (type), addr); | |
4351 | ||
4352 | if (indirect) | |
4353 | addr = build_va_arg_indirect_ref (addr); | |
4354 | ||
4355 | return build_va_arg_indirect_ref (addr); | |
4356 | } | |
4357 | ||
4358 | /* Build an indirect-ref expression over the given TREE, which represents a | |
4359 | piece of a va_arg() expansion. */ | |
4360 | tree | |
4361 | build_va_arg_indirect_ref (tree addr) | |
4362 | { | |
4363 | addr = build_simple_mem_ref_loc (EXPR_LOCATION (addr), addr); | |
4364 | ||
4365 | if (flag_mudflap) /* Don't instrument va_arg INDIRECT_REF. */ | |
4366 | mf_mark (addr); | |
4367 | ||
4368 | return addr; | |
4369 | } | |
4370 | ||
4371 | /* Return a dummy expression of type TYPE in order to keep going after an | |
4372 | error. */ | |
4373 | ||
4374 | static tree | |
4375 | dummy_object (tree type) | |
4376 | { | |
4377 | tree t = build_int_cst (build_pointer_type (type), 0); | |
4378 | return build2 (MEM_REF, type, t, t); | |
4379 | } | |
4380 | ||
4381 | /* Gimplify __builtin_va_arg, aka VA_ARG_EXPR, which is not really a | |
4382 | builtin function, but a very special sort of operator. */ | |
4383 | ||
4384 | enum gimplify_status | |
4385 | gimplify_va_arg_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p) | |
4386 | { | |
4387 | tree promoted_type, have_va_type; | |
4388 | tree valist = TREE_OPERAND (*expr_p, 0); | |
4389 | tree type = TREE_TYPE (*expr_p); | |
4390 | tree t; | |
4391 | location_t loc = EXPR_LOCATION (*expr_p); | |
4392 | ||
4393 | /* Verify that valist is of the proper type. */ | |
4394 | have_va_type = TREE_TYPE (valist); | |
4395 | if (have_va_type == error_mark_node) | |
4396 | return GS_ERROR; | |
4397 | have_va_type = targetm.canonical_va_list_type (have_va_type); | |
4398 | ||
4399 | if (have_va_type == NULL_TREE) | |
4400 | { | |
4401 | error_at (loc, "first argument to %<va_arg%> not of type %<va_list%>"); | |
4402 | return GS_ERROR; | |
4403 | } | |
4404 | ||
4405 | /* Generate a diagnostic for requesting data of a type that cannot | |
4406 | be passed through `...' due to type promotion at the call site. */ | |
4407 | if ((promoted_type = lang_hooks.types.type_promotes_to (type)) | |
4408 | != type) | |
4409 | { | |
4410 | static bool gave_help; | |
4411 | bool warned; | |
4412 | ||
4413 | /* Unfortunately, this is merely undefined, rather than a constraint | |
4414 | violation, so we cannot make this an error. If this call is never | |
4415 | executed, the program is still strictly conforming. */ | |
4416 | warned = warning_at (loc, 0, | |
4417 | "%qT is promoted to %qT when passed through %<...%>", | |
4418 | type, promoted_type); | |
4419 | if (!gave_help && warned) | |
4420 | { | |
4421 | gave_help = true; | |
4422 | inform (loc, "(so you should pass %qT not %qT to %<va_arg%>)", | |
4423 | promoted_type, type); | |
4424 | } | |
4425 | ||
4426 | /* We can, however, treat "undefined" any way we please. | |
4427 | Call abort to encourage the user to fix the program. */ | |
4428 | if (warned) | |
4429 | inform (loc, "if this code is reached, the program will abort"); | |
4430 | /* Before the abort, allow the evaluation of the va_list | |
4431 | expression to exit or longjmp. */ | |
4432 | gimplify_and_add (valist, pre_p); | |
4433 | t = build_call_expr_loc (loc, | |
4434 | builtin_decl_implicit (BUILT_IN_TRAP), 0); | |
4435 | gimplify_and_add (t, pre_p); | |
4436 | ||
4437 | /* This is dead code, but go ahead and finish so that the | |
4438 | mode of the result comes out right. */ | |
4439 | *expr_p = dummy_object (type); | |
4440 | return GS_ALL_DONE; | |
4441 | } | |
4442 | else | |
4443 | { | |
4444 | /* Make it easier for the backends by protecting the valist argument | |
4445 | from multiple evaluations. */ | |
4446 | if (TREE_CODE (have_va_type) == ARRAY_TYPE) | |
4447 | { | |
4448 | /* For this case, the backends will be expecting a pointer to | |
4449 | TREE_TYPE (abi), but it's possible we've | |
4450 | actually been given an array (an actual TARGET_FN_ABI_VA_LIST). | |
4451 | So fix it. */ | |
4452 | if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE) | |
4453 | { | |
4454 | tree p1 = build_pointer_type (TREE_TYPE (have_va_type)); | |
4455 | valist = fold_convert_loc (loc, p1, | |
4456 | build_fold_addr_expr_loc (loc, valist)); | |
4457 | } | |
4458 | ||
4459 | gimplify_expr (&valist, pre_p, post_p, is_gimple_val, fb_rvalue); | |
4460 | } | |
4461 | else | |
4462 | gimplify_expr (&valist, pre_p, post_p, is_gimple_min_lval, fb_lvalue); | |
4463 | ||
4464 | if (!targetm.gimplify_va_arg_expr) | |
4465 | /* FIXME: Once most targets are converted we should merely | |
4466 | assert this is non-null. */ | |
4467 | return GS_ALL_DONE; | |
4468 | ||
4469 | *expr_p = targetm.gimplify_va_arg_expr (valist, type, pre_p, post_p); | |
4470 | return GS_OK; | |
4471 | } | |
4472 | } | |
4473 | ||
4474 | /* Expand EXP, a call to __builtin_va_end. */ | |
4475 | ||
4476 | static rtx | |
4477 | expand_builtin_va_end (tree exp) | |
4478 | { | |
4479 | tree valist = CALL_EXPR_ARG (exp, 0); | |
4480 | ||
4481 | /* Evaluate for side effects, if needed. I hate macros that don't | |
4482 | do that. */ | |
4483 | if (TREE_SIDE_EFFECTS (valist)) | |
4484 | expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL); | |
4485 | ||
4486 | return const0_rtx; | |
4487 | } | |
4488 | ||
4489 | /* Expand EXP, a call to __builtin_va_copy. We do this as a | |
4490 | builtin rather than just as an assignment in stdarg.h because of the | |
4491 | nastiness of array-type va_list types. */ | |
4492 | ||
4493 | static rtx | |
4494 | expand_builtin_va_copy (tree exp) | |
4495 | { | |
4496 | tree dst, src, t; | |
4497 | location_t loc = EXPR_LOCATION (exp); | |
4498 | ||
4499 | dst = CALL_EXPR_ARG (exp, 0); | |
4500 | src = CALL_EXPR_ARG (exp, 1); | |
4501 | ||
4502 | dst = stabilize_va_list_loc (loc, dst, 1); | |
4503 | src = stabilize_va_list_loc (loc, src, 0); | |
4504 | ||
4505 | gcc_assert (cfun != NULL && cfun->decl != NULL_TREE); | |
4506 | ||
4507 | if (TREE_CODE (targetm.fn_abi_va_list (cfun->decl)) != ARRAY_TYPE) | |
4508 | { | |
4509 | t = build2 (MODIFY_EXPR, targetm.fn_abi_va_list (cfun->decl), dst, src); | |
4510 | TREE_SIDE_EFFECTS (t) = 1; | |
4511 | expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL); | |
4512 | } | |
4513 | else | |
4514 | { | |
4515 | rtx dstb, srcb, size; | |
4516 | ||
4517 | /* Evaluate to pointers. */ | |
4518 | dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL); | |
4519 | srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL); | |
4520 | size = expand_expr (TYPE_SIZE_UNIT (targetm.fn_abi_va_list (cfun->decl)), | |
4521 | NULL_RTX, VOIDmode, EXPAND_NORMAL); | |
4522 | ||
4523 | dstb = convert_memory_address (Pmode, dstb); | |
4524 | srcb = convert_memory_address (Pmode, srcb); | |
4525 | ||
4526 | /* "Dereference" to BLKmode memories. */ | |
4527 | dstb = gen_rtx_MEM (BLKmode, dstb); | |
4528 | set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst)))); | |
4529 | set_mem_align (dstb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl))); | |
4530 | srcb = gen_rtx_MEM (BLKmode, srcb); | |
4531 | set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src)))); | |
4532 | set_mem_align (srcb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl))); | |
4533 | ||
4534 | /* Copy. */ | |
4535 | emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL); | |
4536 | } | |
4537 | ||
4538 | return const0_rtx; | |
4539 | } | |
4540 | ||
4541 | /* Expand a call to one of the builtin functions __builtin_frame_address or | |
4542 | __builtin_return_address. */ | |
4543 | ||
4544 | static rtx | |
4545 | expand_builtin_frame_address (tree fndecl, tree exp) | |
4546 | { | |
4547 | /* The argument must be a nonnegative integer constant. | |
4548 | It counts the number of frames to scan up the stack. | |
4549 | The value is the return address saved in that frame. */ | |
4550 | if (call_expr_nargs (exp) == 0) | |
4551 | /* Warning about missing arg was already issued. */ | |
4552 | return const0_rtx; | |
4553 | else if (! host_integerp (CALL_EXPR_ARG (exp, 0), 1)) | |
4554 | { | |
4555 | if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS) | |
4556 | error ("invalid argument to %<__builtin_frame_address%>"); | |
4557 | else | |
4558 | error ("invalid argument to %<__builtin_return_address%>"); | |
4559 | return const0_rtx; | |
4560 | } | |
4561 | else | |
4562 | { | |
4563 | rtx tem | |
4564 | = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl), | |
4565 | tree_low_cst (CALL_EXPR_ARG (exp, 0), 1)); | |
4566 | ||
4567 | /* Some ports cannot access arbitrary stack frames. */ | |
4568 | if (tem == NULL) | |
4569 | { | |
4570 | if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS) | |
4571 | warning (0, "unsupported argument to %<__builtin_frame_address%>"); | |
4572 | else | |
4573 | warning (0, "unsupported argument to %<__builtin_return_address%>"); | |
4574 | return const0_rtx; | |
4575 | } | |
4576 | ||
4577 | /* For __builtin_frame_address, return what we've got. */ | |
4578 | if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS) | |
4579 | return tem; | |
4580 | ||
4581 | if (!REG_P (tem) | |
4582 | && ! CONSTANT_P (tem)) | |
4583 | tem = copy_to_mode_reg (Pmode, tem); | |
4584 | return tem; | |
4585 | } | |
4586 | } | |
4587 | ||
4588 | /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we | |
4589 | failed and the caller should emit a normal call. CANNOT_ACCUMULATE | |
4590 | is the same as for allocate_dynamic_stack_space. */ | |
4591 | ||
4592 | static rtx | |
4593 | expand_builtin_alloca (tree exp, bool cannot_accumulate) | |
4594 | { | |
4595 | rtx op0; | |
4596 | rtx result; | |
4597 | bool valid_arglist; | |
4598 | unsigned int align; | |
4599 | bool alloca_with_align = (DECL_FUNCTION_CODE (get_callee_fndecl (exp)) | |
4600 | == BUILT_IN_ALLOCA_WITH_ALIGN); | |
4601 | ||
4602 | /* Emit normal call if we use mudflap. */ | |
4603 | if (flag_mudflap) | |
4604 | return NULL_RTX; | |
4605 | ||
4606 | valid_arglist | |
4607 | = (alloca_with_align | |
4608 | ? validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE) | |
4609 | : validate_arglist (exp, INTEGER_TYPE, VOID_TYPE)); | |
4610 | ||
4611 | if (!valid_arglist) | |
4612 | return NULL_RTX; | |
4613 | ||
4614 | /* Compute the argument. */ | |
4615 | op0 = expand_normal (CALL_EXPR_ARG (exp, 0)); | |
4616 | ||
4617 | /* Compute the alignment. */ | |
4618 | align = (alloca_with_align | |
4619 | ? TREE_INT_CST_LOW (CALL_EXPR_ARG (exp, 1)) | |
4620 | : BIGGEST_ALIGNMENT); | |
4621 | ||
4622 | /* Allocate the desired space. */ | |
4623 | result = allocate_dynamic_stack_space (op0, 0, align, cannot_accumulate); | |
4624 | result = convert_memory_address (ptr_mode, result); | |
4625 | ||
4626 | return result; | |
4627 | } | |
4628 | ||
4629 | /* Expand a call to a bswap builtin with argument ARG0. MODE | |
4630 | is the mode to expand with. */ | |
4631 | ||
4632 | static rtx | |
4633 | expand_builtin_bswap (tree exp, rtx target, rtx subtarget) | |
4634 | { | |
4635 | enum machine_mode mode; | |
4636 | tree arg; | |
4637 | rtx op0; | |
4638 | ||
4639 | if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE)) | |
4640 | return NULL_RTX; | |
4641 | ||
4642 | arg = CALL_EXPR_ARG (exp, 0); | |
4643 | mode = TYPE_MODE (TREE_TYPE (arg)); | |
4644 | op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL); | |
4645 | ||
4646 | target = expand_unop (mode, bswap_optab, op0, target, 1); | |
4647 | ||
4648 | gcc_assert (target); | |
4649 | ||
4650 | return convert_to_mode (mode, target, 0); | |
4651 | } | |
4652 | ||
4653 | /* Expand a call to a unary builtin in EXP. | |
4654 | Return NULL_RTX if a normal call should be emitted rather than expanding the | |
4655 | function in-line. If convenient, the result should be placed in TARGET. | |
4656 | SUBTARGET may be used as the target for computing one of EXP's operands. */ | |
4657 | ||
4658 | static rtx | |
4659 | expand_builtin_unop (enum machine_mode target_mode, tree exp, rtx target, | |
4660 | rtx subtarget, optab op_optab) | |
4661 | { | |
4662 | rtx op0; | |
4663 | ||
4664 | if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE)) | |
4665 | return NULL_RTX; | |
4666 | ||
4667 | /* Compute the argument. */ | |
4668 | op0 = expand_expr (CALL_EXPR_ARG (exp, 0), | |
4669 | (subtarget | |
4670 | && (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0))) | |
4671 | == GET_MODE (subtarget))) ? subtarget : NULL_RTX, | |
4672 | VOIDmode, EXPAND_NORMAL); | |
4673 | /* Compute op, into TARGET if possible. | |
4674 | Set TARGET to wherever the result comes back. */ | |
4675 | target = expand_unop (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0))), | |
4676 | op_optab, op0, target, op_optab != clrsb_optab); | |
4677 | gcc_assert (target); | |
4678 | ||
4679 | return convert_to_mode (target_mode, target, 0); | |
4680 | } | |
4681 | ||
4682 | /* Expand a call to __builtin_expect. We just return our argument | |
4683 | as the builtin_expect semantic should've been already executed by | |
4684 | tree branch prediction pass. */ | |
4685 | ||
4686 | static rtx | |
4687 | expand_builtin_expect (tree exp, rtx target) | |
4688 | { | |
4689 | tree arg; | |
4690 | ||
4691 | if (call_expr_nargs (exp) < 2) | |
4692 | return const0_rtx; | |
4693 | arg = CALL_EXPR_ARG (exp, 0); | |
4694 | ||
4695 | target = expand_expr (arg, target, VOIDmode, EXPAND_NORMAL); | |
4696 | /* When guessing was done, the hints should be already stripped away. */ | |
4697 | gcc_assert (!flag_guess_branch_prob | |
4698 | || optimize == 0 || seen_error ()); | |
4699 | return target; | |
4700 | } | |
4701 | ||
4702 | /* Expand a call to __builtin_assume_aligned. We just return our first | |
4703 | argument as the builtin_assume_aligned semantic should've been already | |
4704 | executed by CCP. */ | |
4705 | ||
4706 | static rtx | |
4707 | expand_builtin_assume_aligned (tree exp, rtx target) | |
4708 | { | |
4709 | if (call_expr_nargs (exp) < 2) | |
4710 | return const0_rtx; | |
4711 | target = expand_expr (CALL_EXPR_ARG (exp, 0), target, VOIDmode, | |
4712 | EXPAND_NORMAL); | |
4713 | gcc_assert (!TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp, 1)) | |
4714 | && (call_expr_nargs (exp) < 3 | |
4715 | || !TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp, 2)))); | |
4716 | return target; | |
4717 | } | |
4718 | ||
4719 | void | |
4720 | expand_builtin_trap (void) | |
4721 | { | |
4722 | #ifdef HAVE_trap | |
4723 | if (HAVE_trap) | |
5ce9237c JM |
4724 | { |
4725 | rtx insn = emit_insn (gen_trap ()); | |
4726 | /* For trap insns when not accumulating outgoing args force | |
4727 | REG_ARGS_SIZE note to prevent crossjumping of calls with | |
4728 | different args sizes. */ | |
4729 | if (!ACCUMULATE_OUTGOING_ARGS) | |
4730 | add_reg_note (insn, REG_ARGS_SIZE, GEN_INT (stack_pointer_delta)); | |
4731 | } | |
e4b17023 JM |
4732 | else |
4733 | #endif | |
4734 | emit_library_call (abort_libfunc, LCT_NORETURN, VOIDmode, 0); | |
4735 | emit_barrier (); | |
4736 | } | |
4737 | ||
4738 | /* Expand a call to __builtin_unreachable. We do nothing except emit | |
4739 | a barrier saying that control flow will not pass here. | |
4740 | ||
4741 | It is the responsibility of the program being compiled to ensure | |
4742 | that control flow does never reach __builtin_unreachable. */ | |
4743 | static void | |
4744 | expand_builtin_unreachable (void) | |
4745 | { | |
4746 | emit_barrier (); | |
4747 | } | |
4748 | ||
4749 | /* Expand EXP, a call to fabs, fabsf or fabsl. | |
4750 | Return NULL_RTX if a normal call should be emitted rather than expanding | |
4751 | the function inline. If convenient, the result should be placed | |
4752 | in TARGET. SUBTARGET may be used as the target for computing | |
4753 | the operand. */ | |
4754 | ||
4755 | static rtx | |
4756 | expand_builtin_fabs (tree exp, rtx target, rtx subtarget) | |
4757 | { | |
4758 | enum machine_mode mode; | |
4759 | tree arg; | |
4760 | rtx op0; | |
4761 | ||
4762 | if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE)) | |
4763 | return NULL_RTX; | |
4764 | ||
4765 | arg = CALL_EXPR_ARG (exp, 0); | |
4766 | CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg); | |
4767 | mode = TYPE_MODE (TREE_TYPE (arg)); | |
4768 | op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL); | |
4769 | return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1)); | |
4770 | } | |
4771 | ||
4772 | /* Expand EXP, a call to copysign, copysignf, or copysignl. | |
4773 | Return NULL is a normal call should be emitted rather than expanding the | |
4774 | function inline. If convenient, the result should be placed in TARGET. | |
4775 | SUBTARGET may be used as the target for computing the operand. */ | |
4776 | ||
4777 | static rtx | |
4778 | expand_builtin_copysign (tree exp, rtx target, rtx subtarget) | |
4779 | { | |
4780 | rtx op0, op1; | |
4781 | tree arg; | |
4782 | ||
4783 | if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE)) | |
4784 | return NULL_RTX; | |
4785 | ||
4786 | arg = CALL_EXPR_ARG (exp, 0); | |
4787 | op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL); | |
4788 | ||
4789 | arg = CALL_EXPR_ARG (exp, 1); | |
4790 | op1 = expand_normal (arg); | |
4791 | ||
4792 | return expand_copysign (op0, op1, target); | |
4793 | } | |
4794 | ||
4795 | /* Create a new constant string literal and return a char* pointer to it. | |
4796 | The STRING_CST value is the LEN characters at STR. */ | |
4797 | tree | |
4798 | build_string_literal (int len, const char *str) | |
4799 | { | |
4800 | tree t, elem, index, type; | |
4801 | ||
4802 | t = build_string (len, str); | |
4803 | elem = build_type_variant (char_type_node, 1, 0); | |
4804 | index = build_index_type (size_int (len - 1)); | |
4805 | type = build_array_type (elem, index); | |
4806 | TREE_TYPE (t) = type; | |
4807 | TREE_CONSTANT (t) = 1; | |
4808 | TREE_READONLY (t) = 1; | |
4809 | TREE_STATIC (t) = 1; | |
4810 | ||
4811 | type = build_pointer_type (elem); | |
4812 | t = build1 (ADDR_EXPR, type, | |
4813 | build4 (ARRAY_REF, elem, | |
4814 | t, integer_zero_node, NULL_TREE, NULL_TREE)); | |
4815 | return t; | |
4816 | } | |
4817 | ||
4818 | /* Expand a call to __builtin___clear_cache. */ | |
4819 | ||
4820 | static rtx | |
4821 | expand_builtin___clear_cache (tree exp ATTRIBUTE_UNUSED) | |
4822 | { | |
4823 | #ifndef HAVE_clear_cache | |
4824 | #ifdef CLEAR_INSN_CACHE | |
4825 | /* There is no "clear_cache" insn, and __clear_cache() in libgcc | |
4826 | does something. Just do the default expansion to a call to | |
4827 | __clear_cache(). */ | |
4828 | return NULL_RTX; | |
4829 | #else | |
4830 | /* There is no "clear_cache" insn, and __clear_cache() in libgcc | |
4831 | does nothing. There is no need to call it. Do nothing. */ | |
4832 | return const0_rtx; | |
4833 | #endif /* CLEAR_INSN_CACHE */ | |
4834 | #else | |
4835 | /* We have a "clear_cache" insn, and it will handle everything. */ | |
4836 | tree begin, end; | |
4837 | rtx begin_rtx, end_rtx; | |
4838 | ||
4839 | /* We must not expand to a library call. If we did, any | |
4840 | fallback library function in libgcc that might contain a call to | |
4841 | __builtin___clear_cache() would recurse infinitely. */ | |
4842 | if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE)) | |
4843 | { | |
4844 | error ("both arguments to %<__builtin___clear_cache%> must be pointers"); | |
4845 | return const0_rtx; | |
4846 | } | |
4847 | ||
4848 | if (HAVE_clear_cache) | |
4849 | { | |
4850 | struct expand_operand ops[2]; | |
4851 | ||
4852 | begin = CALL_EXPR_ARG (exp, 0); | |
4853 | begin_rtx = expand_expr (begin, NULL_RTX, Pmode, EXPAND_NORMAL); | |
4854 | ||
4855 | end = CALL_EXPR_ARG (exp, 1); | |
4856 | end_rtx = expand_expr (end, NULL_RTX, Pmode, EXPAND_NORMAL); | |
4857 | ||
4858 | create_address_operand (&ops[0], begin_rtx); | |
4859 | create_address_operand (&ops[1], end_rtx); | |
4860 | if (maybe_expand_insn (CODE_FOR_clear_cache, 2, ops)) | |
4861 | return const0_rtx; | |
4862 | } | |
4863 | return const0_rtx; | |
4864 | #endif /* HAVE_clear_cache */ | |
4865 | } | |
4866 | ||
4867 | /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */ | |
4868 | ||
4869 | static rtx | |
4870 | round_trampoline_addr (rtx tramp) | |
4871 | { | |
4872 | rtx temp, addend, mask; | |
4873 | ||
4874 | /* If we don't need too much alignment, we'll have been guaranteed | |
4875 | proper alignment by get_trampoline_type. */ | |
4876 | if (TRAMPOLINE_ALIGNMENT <= STACK_BOUNDARY) | |
4877 | return tramp; | |
4878 | ||
4879 | /* Round address up to desired boundary. */ | |
4880 | temp = gen_reg_rtx (Pmode); | |
4881 | addend = GEN_INT (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1); | |
4882 | mask = GEN_INT (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT); | |
4883 | ||
4884 | temp = expand_simple_binop (Pmode, PLUS, tramp, addend, | |
4885 | temp, 0, OPTAB_LIB_WIDEN); | |
4886 | tramp = expand_simple_binop (Pmode, AND, temp, mask, | |
4887 | temp, 0, OPTAB_LIB_WIDEN); | |
4888 | ||
4889 | return tramp; | |
4890 | } | |
4891 | ||
4892 | static rtx | |
4893 | expand_builtin_init_trampoline (tree exp, bool onstack) | |
4894 | { | |
4895 | tree t_tramp, t_func, t_chain; | |
4896 | rtx m_tramp, r_tramp, r_chain, tmp; | |
4897 | ||
4898 | if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, | |
4899 | POINTER_TYPE, VOID_TYPE)) | |
4900 | return NULL_RTX; | |
4901 | ||
4902 | t_tramp = CALL_EXPR_ARG (exp, 0); | |
4903 | t_func = CALL_EXPR_ARG (exp, 1); | |
4904 | t_chain = CALL_EXPR_ARG (exp, 2); | |
4905 | ||
4906 | r_tramp = expand_normal (t_tramp); | |
4907 | m_tramp = gen_rtx_MEM (BLKmode, r_tramp); | |
4908 | MEM_NOTRAP_P (m_tramp) = 1; | |
4909 | ||
4910 | /* If ONSTACK, the TRAMP argument should be the address of a field | |
4911 | within the local function's FRAME decl. Either way, let's see if | |
4912 | we can fill in the MEM_ATTRs for this memory. */ | |
4913 | if (TREE_CODE (t_tramp) == ADDR_EXPR) | |
4914 | set_mem_attributes_minus_bitpos (m_tramp, TREE_OPERAND (t_tramp, 0), | |
4915 | true, 0); | |
4916 | ||
4917 | /* Creator of a heap trampoline is responsible for making sure the | |
4918 | address is aligned to at least STACK_BOUNDARY. Normally malloc | |
4919 | will ensure this anyhow. */ | |
4920 | tmp = round_trampoline_addr (r_tramp); | |
4921 | if (tmp != r_tramp) | |
4922 | { | |
4923 | m_tramp = change_address (m_tramp, BLKmode, tmp); | |
4924 | set_mem_align (m_tramp, TRAMPOLINE_ALIGNMENT); | |
4925 | set_mem_size (m_tramp, TRAMPOLINE_SIZE); | |
4926 | } | |
4927 | ||
4928 | /* The FUNC argument should be the address of the nested function. | |
4929 | Extract the actual function decl to pass to the hook. */ | |
4930 | gcc_assert (TREE_CODE (t_func) == ADDR_EXPR); | |
4931 | t_func = TREE_OPERAND (t_func, 0); | |
4932 | gcc_assert (TREE_CODE (t_func) == FUNCTION_DECL); | |
4933 | ||
4934 | r_chain = expand_normal (t_chain); | |
4935 | ||
4936 | /* Generate insns to initialize the trampoline. */ | |
4937 | targetm.calls.trampoline_init (m_tramp, t_func, r_chain); | |
4938 | ||
4939 | if (onstack) | |
4940 | { | |
4941 | trampolines_created = 1; | |
4942 | ||
4943 | warning_at (DECL_SOURCE_LOCATION (t_func), OPT_Wtrampolines, | |
4944 | "trampoline generated for nested function %qD", t_func); | |
4945 | } | |
4946 | ||
4947 | return const0_rtx; | |
4948 | } | |
4949 | ||
4950 | static rtx | |
4951 | expand_builtin_adjust_trampoline (tree exp) | |
4952 | { | |
4953 | rtx tramp; | |
4954 | ||
4955 | if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE)) | |
4956 | return NULL_RTX; | |
4957 | ||
4958 | tramp = expand_normal (CALL_EXPR_ARG (exp, 0)); | |
4959 | tramp = round_trampoline_addr (tramp); | |
4960 | if (targetm.calls.trampoline_adjust_address) | |
4961 | tramp = targetm.calls.trampoline_adjust_address (tramp); | |
4962 | ||
4963 | return tramp; | |
4964 | } | |
4965 | ||
4966 | /* Expand the call EXP to the built-in signbit, signbitf or signbitl | |
4967 | function. The function first checks whether the back end provides | |
4968 | an insn to implement signbit for the respective mode. If not, it | |
4969 | checks whether the floating point format of the value is such that | |
4970 | the sign bit can be extracted. If that is not the case, the | |
4971 | function returns NULL_RTX to indicate that a normal call should be | |
4972 | emitted rather than expanding the function in-line. EXP is the | |
4973 | expression that is a call to the builtin function; if convenient, | |
4974 | the result should be placed in TARGET. */ | |
4975 | static rtx | |
4976 | expand_builtin_signbit (tree exp, rtx target) | |
4977 | { | |
4978 | const struct real_format *fmt; | |
4979 | enum machine_mode fmode, imode, rmode; | |
4980 | tree arg; | |
4981 | int word, bitpos; | |
4982 | enum insn_code icode; | |
4983 | rtx temp; | |
4984 | location_t loc = EXPR_LOCATION (exp); | |
4985 | ||
4986 | if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE)) | |
4987 | return NULL_RTX; | |
4988 | ||
4989 | arg = CALL_EXPR_ARG (exp, 0); | |
4990 | fmode = TYPE_MODE (TREE_TYPE (arg)); | |
4991 | rmode = TYPE_MODE (TREE_TYPE (exp)); | |
4992 | fmt = REAL_MODE_FORMAT (fmode); | |
4993 | ||
4994 | arg = builtin_save_expr (arg); | |
4995 | ||
4996 | /* Expand the argument yielding a RTX expression. */ | |
4997 | temp = expand_normal (arg); | |
4998 | ||
4999 | /* Check if the back end provides an insn that handles signbit for the | |
5000 | argument's mode. */ | |
5001 | icode = optab_handler (signbit_optab, fmode); | |
5002 | if (icode != CODE_FOR_nothing) | |
5003 | { | |
5004 | rtx last = get_last_insn (); | |
5005 | target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp))); | |
5006 | if (maybe_emit_unop_insn (icode, target, temp, UNKNOWN)) | |
5007 | return target; | |
5008 | delete_insns_since (last); | |
5009 | } | |
5010 | ||
5011 | /* For floating point formats without a sign bit, implement signbit | |
5012 | as "ARG < 0.0". */ | |
5013 | bitpos = fmt->signbit_ro; | |
5014 | if (bitpos < 0) | |
5015 | { | |
5016 | /* But we can't do this if the format supports signed zero. */ | |
5017 | if (fmt->has_signed_zero && HONOR_SIGNED_ZEROS (fmode)) | |
5018 | return NULL_RTX; | |
5019 | ||
5020 | arg = fold_build2_loc (loc, LT_EXPR, TREE_TYPE (exp), arg, | |
5021 | build_real (TREE_TYPE (arg), dconst0)); | |
5022 | return expand_expr (arg, target, VOIDmode, EXPAND_NORMAL); | |
5023 | } | |
5024 | ||
5025 | if (GET_MODE_SIZE (fmode) <= UNITS_PER_WORD) | |
5026 | { | |
5027 | imode = int_mode_for_mode (fmode); | |
5028 | if (imode == BLKmode) | |
5029 | return NULL_RTX; | |
5030 | temp = gen_lowpart (imode, temp); | |
5031 | } | |
5032 | else | |
5033 | { | |
5034 | imode = word_mode; | |
5035 | /* Handle targets with different FP word orders. */ | |
5036 | if (FLOAT_WORDS_BIG_ENDIAN) | |
5037 | word = (GET_MODE_BITSIZE (fmode) - bitpos) / BITS_PER_WORD; | |
5038 | else | |
5039 | word = bitpos / BITS_PER_WORD; | |
5040 | temp = operand_subword_force (temp, word, fmode); | |
5041 | bitpos = bitpos % BITS_PER_WORD; | |
5042 | } | |
5043 | ||
5044 | /* Force the intermediate word_mode (or narrower) result into a | |
5045 | register. This avoids attempting to create paradoxical SUBREGs | |
5046 | of floating point modes below. */ | |
5047 | temp = force_reg (imode, temp); | |
5048 | ||
5049 | /* If the bitpos is within the "result mode" lowpart, the operation | |
5050 | can be implement with a single bitwise AND. Otherwise, we need | |
5051 | a right shift and an AND. */ | |
5052 | ||
5053 | if (bitpos < GET_MODE_BITSIZE (rmode)) | |
5054 | { | |
5055 | double_int mask = double_int_setbit (double_int_zero, bitpos); | |
5056 | ||
5057 | if (GET_MODE_SIZE (imode) > GET_MODE_SIZE (rmode)) | |
5058 | temp = gen_lowpart (rmode, temp); | |
5059 | temp = expand_binop (rmode, and_optab, temp, | |
5060 | immed_double_int_const (mask, rmode), | |
5061 | NULL_RTX, 1, OPTAB_LIB_WIDEN); | |
5062 | } | |
5063 | else | |
5064 | { | |
5065 | /* Perform a logical right shift to place the signbit in the least | |
5066 | significant bit, then truncate the result to the desired mode | |
5067 | and mask just this bit. */ | |
5068 | temp = expand_shift (RSHIFT_EXPR, imode, temp, bitpos, NULL_RTX, 1); | |
5069 | temp = gen_lowpart (rmode, temp); | |
5070 | temp = expand_binop (rmode, and_optab, temp, const1_rtx, | |
5071 | NULL_RTX, 1, OPTAB_LIB_WIDEN); | |
5072 | } | |
5073 | ||
5074 | return temp; | |
5075 | } | |
5076 | ||
5077 | /* Expand fork or exec calls. TARGET is the desired target of the | |
5078 | call. EXP is the call. FN is the | |
5079 | identificator of the actual function. IGNORE is nonzero if the | |
5080 | value is to be ignored. */ | |
5081 | ||
5082 | static rtx | |
5083 | expand_builtin_fork_or_exec (tree fn, tree exp, rtx target, int ignore) | |
5084 | { | |
5085 | tree id, decl; | |
5086 | tree call; | |
5087 | ||
5088 | /* If we are not profiling, just call the function. */ | |
5089 | if (!profile_arc_flag) | |
5090 | return NULL_RTX; | |
5091 | ||
5092 | /* Otherwise call the wrapper. This should be equivalent for the rest of | |
5093 | compiler, so the code does not diverge, and the wrapper may run the | |
5094 | code necessary for keeping the profiling sane. */ | |
5095 | ||
5096 | switch (DECL_FUNCTION_CODE (fn)) | |
5097 | { | |
5098 | case BUILT_IN_FORK: | |
5099 | id = get_identifier ("__gcov_fork"); | |
5100 | break; | |
5101 | ||
5102 | case BUILT_IN_EXECL: | |
5103 | id = get_identifier ("__gcov_execl"); | |
5104 | break; | |
5105 | ||
5106 | case BUILT_IN_EXECV: | |
5107 | id = get_identifier ("__gcov_execv"); | |
5108 | break; | |
5109 | ||
5110 | case BUILT_IN_EXECLP: | |
5111 | id = get_identifier ("__gcov_execlp"); | |
5112 | break; | |
5113 | ||
5114 | case BUILT_IN_EXECLE: | |
5115 | id = get_identifier ("__gcov_execle"); | |
5116 | break; | |
5117 | ||
5118 | case BUILT_IN_EXECVP: | |
5119 | id = get_identifier ("__gcov_execvp"); | |
5120 | break; | |
5121 | ||
5122 | case BUILT_IN_EXECVE: | |
5123 | id = get_identifier ("__gcov_execve"); | |
5124 | break; | |
5125 | ||
5126 | default: | |
5127 | gcc_unreachable (); | |
5128 | } | |
5129 | ||
5130 | decl = build_decl (DECL_SOURCE_LOCATION (fn), | |
5131 | FUNCTION_DECL, id, TREE_TYPE (fn)); | |
5132 | DECL_EXTERNAL (decl) = 1; | |
5133 | TREE_PUBLIC (decl) = 1; | |
5134 | DECL_ARTIFICIAL (decl) = 1; | |
5135 | TREE_NOTHROW (decl) = 1; | |
5136 | DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT; | |
5137 | DECL_VISIBILITY_SPECIFIED (decl) = 1; | |
5138 | call = rewrite_call_expr (EXPR_LOCATION (exp), exp, 0, decl, 0); | |
5139 | return expand_call (call, target, ignore); | |
5140 | } | |
5141 | ||
5142 | ||
5143 | \f | |
5144 | /* Reconstitute a mode for a __sync intrinsic operation. Since the type of | |
5145 | the pointer in these functions is void*, the tree optimizers may remove | |
5146 | casts. The mode computed in expand_builtin isn't reliable either, due | |
5147 | to __sync_bool_compare_and_swap. | |
5148 | ||
5149 | FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the | |
5150 | group of builtins. This gives us log2 of the mode size. */ | |
5151 | ||
5152 | static inline enum machine_mode | |
5153 | get_builtin_sync_mode (int fcode_diff) | |
5154 | { | |
5155 | /* The size is not negotiable, so ask not to get BLKmode in return | |
5156 | if the target indicates that a smaller size would be better. */ | |
5157 | return mode_for_size (BITS_PER_UNIT << fcode_diff, MODE_INT, 0); | |
5158 | } | |
5159 | ||
5160 | /* Expand the memory expression LOC and return the appropriate memory operand | |
5161 | for the builtin_sync operations. */ | |
5162 | ||
5163 | static rtx | |
5164 | get_builtin_sync_mem (tree loc, enum machine_mode mode) | |
5165 | { | |
5166 | rtx addr, mem; | |
5167 | ||
5168 | addr = expand_expr (loc, NULL_RTX, ptr_mode, EXPAND_SUM); | |
5169 | addr = convert_memory_address (Pmode, addr); | |
5170 | ||
5171 | /* Note that we explicitly do not want any alias information for this | |
5172 | memory, so that we kill all other live memories. Otherwise we don't | |
5173 | satisfy the full barrier semantics of the intrinsic. */ | |
5174 | mem = validize_mem (gen_rtx_MEM (mode, addr)); | |
5175 | ||
5176 | /* The alignment needs to be at least according to that of the mode. */ | |
5177 | set_mem_align (mem, MAX (GET_MODE_ALIGNMENT (mode), | |
5178 | get_pointer_alignment (loc))); | |
5179 | set_mem_alias_set (mem, ALIAS_SET_MEMORY_BARRIER); | |
5180 | MEM_VOLATILE_P (mem) = 1; | |
5181 | ||
5182 | return mem; | |
5183 | } | |
5184 | ||
5185 | /* Make sure an argument is in the right mode. | |
5186 | EXP is the tree argument. | |
5187 | MODE is the mode it should be in. */ | |
5188 | ||
5189 | static rtx | |
5190 | expand_expr_force_mode (tree exp, enum machine_mode mode) | |
5191 | { | |
5192 | rtx val; | |
5193 | enum machine_mode old_mode; | |
5194 | ||
5195 | val = expand_expr (exp, NULL_RTX, mode, EXPAND_NORMAL); | |
5196 | /* If VAL is promoted to a wider mode, convert it back to MODE. Take care | |
5197 | of CONST_INTs, where we know the old_mode only from the call argument. */ | |
5198 | ||
5199 | old_mode = GET_MODE (val); | |
5200 | if (old_mode == VOIDmode) | |
5201 | old_mode = TYPE_MODE (TREE_TYPE (exp)); | |
5202 | val = convert_modes (mode, old_mode, val, 1); | |
5203 | return val; | |
5204 | } | |
5205 | ||
5206 | ||
5207 | /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics. | |
5208 | EXP is the CALL_EXPR. CODE is the rtx code | |
5209 | that corresponds to the arithmetic or logical operation from the name; | |
5210 | an exception here is that NOT actually means NAND. TARGET is an optional | |
5211 | place for us to store the results; AFTER is true if this is the | |
5212 | fetch_and_xxx form. */ | |
5213 | ||
5214 | static rtx | |
5215 | expand_builtin_sync_operation (enum machine_mode mode, tree exp, | |
5216 | enum rtx_code code, bool after, | |
5217 | rtx target) | |
5218 | { | |
5219 | rtx val, mem; | |
5220 | location_t loc = EXPR_LOCATION (exp); | |
5221 | ||
5222 | if (code == NOT && warn_sync_nand) | |
5223 | { | |
5224 | tree fndecl = get_callee_fndecl (exp); | |
5225 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
5226 | ||
5227 | static bool warned_f_a_n, warned_n_a_f; | |
5228 | ||
5229 | switch (fcode) | |
5230 | { | |
5231 | case BUILT_IN_SYNC_FETCH_AND_NAND_1: | |
5232 | case BUILT_IN_SYNC_FETCH_AND_NAND_2: | |
5233 | case BUILT_IN_SYNC_FETCH_AND_NAND_4: | |
5234 | case BUILT_IN_SYNC_FETCH_AND_NAND_8: | |
5235 | case BUILT_IN_SYNC_FETCH_AND_NAND_16: | |
5236 | if (warned_f_a_n) | |
5237 | break; | |
5238 | ||
5239 | fndecl = builtin_decl_implicit (BUILT_IN_SYNC_FETCH_AND_NAND_N); | |
5240 | inform (loc, "%qD changed semantics in GCC 4.4", fndecl); | |
5241 | warned_f_a_n = true; | |
5242 | break; | |
5243 | ||
5244 | case BUILT_IN_SYNC_NAND_AND_FETCH_1: | |
5245 | case BUILT_IN_SYNC_NAND_AND_FETCH_2: | |
5246 | case BUILT_IN_SYNC_NAND_AND_FETCH_4: | |
5247 | case BUILT_IN_SYNC_NAND_AND_FETCH_8: | |
5248 | case BUILT_IN_SYNC_NAND_AND_FETCH_16: | |
5249 | if (warned_n_a_f) | |
5250 | break; | |
5251 | ||
5252 | fndecl = builtin_decl_implicit (BUILT_IN_SYNC_NAND_AND_FETCH_N); | |
5253 | inform (loc, "%qD changed semantics in GCC 4.4", fndecl); | |
5254 | warned_n_a_f = true; | |
5255 | break; | |
5256 | ||
5257 | default: | |
5258 | gcc_unreachable (); | |
5259 | } | |
5260 | } | |
5261 | ||
5262 | /* Expand the operands. */ | |
5263 | mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode); | |
5264 | val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode); | |
5265 | ||
5266 | return expand_atomic_fetch_op (target, mem, val, code, MEMMODEL_SEQ_CST, | |
5267 | after); | |
5268 | } | |
5269 | ||
5270 | /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap | |
5271 | intrinsics. EXP is the CALL_EXPR. IS_BOOL is | |
5272 | true if this is the boolean form. TARGET is a place for us to store the | |
5273 | results; this is NOT optional if IS_BOOL is true. */ | |
5274 | ||
5275 | static rtx | |
5276 | expand_builtin_compare_and_swap (enum machine_mode mode, tree exp, | |
5277 | bool is_bool, rtx target) | |
5278 | { | |
5279 | rtx old_val, new_val, mem; | |
5280 | rtx *pbool, *poval; | |
5281 | ||
5282 | /* Expand the operands. */ | |
5283 | mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode); | |
5284 | old_val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode); | |
5285 | new_val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 2), mode); | |
5286 | ||
5287 | pbool = poval = NULL; | |
5288 | if (target != const0_rtx) | |
5289 | { | |
5290 | if (is_bool) | |
5291 | pbool = ⌖ | |
5292 | else | |
5293 | poval = ⌖ | |
5294 | } | |
5295 | if (!expand_atomic_compare_and_swap (pbool, poval, mem, old_val, new_val, | |
5296 | false, MEMMODEL_SEQ_CST, | |
5297 | MEMMODEL_SEQ_CST)) | |
5298 | return NULL_RTX; | |
5299 | ||
5300 | return target; | |
5301 | } | |
5302 | ||
5303 | /* Expand the __sync_lock_test_and_set intrinsic. Note that the most | |
5304 | general form is actually an atomic exchange, and some targets only | |
5305 | support a reduced form with the second argument being a constant 1. | |
5306 | EXP is the CALL_EXPR; TARGET is an optional place for us to store | |
5307 | the results. */ | |
5308 | ||
5309 | static rtx | |
5310 | expand_builtin_sync_lock_test_and_set (enum machine_mode mode, tree exp, | |
5311 | rtx target) | |
5312 | { | |
5313 | rtx val, mem; | |
5314 | ||
5315 | /* Expand the operands. */ | |
5316 | mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode); | |
5317 | val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode); | |
5318 | ||
5319 | return expand_sync_lock_test_and_set (target, mem, val); | |
5320 | } | |
5321 | ||
5322 | /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */ | |
5323 | ||
5324 | static void | |
5325 | expand_builtin_sync_lock_release (enum machine_mode mode, tree exp) | |
5326 | { | |
5327 | rtx mem; | |
5328 | ||
5329 | /* Expand the operands. */ | |
5330 | mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode); | |
5331 | ||
5332 | expand_atomic_store (mem, const0_rtx, MEMMODEL_RELEASE, true); | |
5333 | } | |
5334 | ||
5335 | /* Given an integer representing an ``enum memmodel'', verify its | |
5336 | correctness and return the memory model enum. */ | |
5337 | ||
5338 | static enum memmodel | |
5339 | get_memmodel (tree exp) | |
5340 | { | |
5341 | rtx op; | |
5342 | ||
5343 | /* If the parameter is not a constant, it's a run time value so we'll just | |
5344 | convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */ | |
5345 | if (TREE_CODE (exp) != INTEGER_CST) | |
5346 | return MEMMODEL_SEQ_CST; | |
5347 | ||
5348 | op = expand_normal (exp); | |
5349 | if (INTVAL (op) < 0 || INTVAL (op) >= MEMMODEL_LAST) | |
5350 | { | |
5351 | warning (OPT_Winvalid_memory_model, | |
5352 | "invalid memory model argument to builtin"); | |
5353 | return MEMMODEL_SEQ_CST; | |
5354 | } | |
5355 | return (enum memmodel) INTVAL (op); | |
5356 | } | |
5357 | ||
5358 | /* Expand the __atomic_exchange intrinsic: | |
5359 | TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel) | |
5360 | EXP is the CALL_EXPR. | |
5361 | TARGET is an optional place for us to store the results. */ | |
5362 | ||
5363 | static rtx | |
5364 | expand_builtin_atomic_exchange (enum machine_mode mode, tree exp, rtx target) | |
5365 | { | |
5366 | rtx val, mem; | |
5367 | enum memmodel model; | |
5368 | ||
5369 | model = get_memmodel (CALL_EXPR_ARG (exp, 2)); | |
5370 | if (model == MEMMODEL_CONSUME) | |
5371 | { | |
5372 | error ("invalid memory model for %<__atomic_exchange%>"); | |
5373 | return NULL_RTX; | |
5374 | } | |
5375 | ||
5376 | if (!flag_inline_atomics) | |
5377 | return NULL_RTX; | |
5378 | ||
5379 | /* Expand the operands. */ | |
5380 | mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode); | |
5381 | val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode); | |
5382 | ||
5383 | return expand_atomic_exchange (target, mem, val, model); | |
5384 | } | |
5385 | ||
5386 | /* Expand the __atomic_compare_exchange intrinsic: | |
5387 | bool __atomic_compare_exchange (TYPE *object, TYPE *expect, | |
5388 | TYPE desired, BOOL weak, | |
5389 | enum memmodel success, | |
5390 | enum memmodel failure) | |
5391 | EXP is the CALL_EXPR. | |
5392 | TARGET is an optional place for us to store the results. */ | |
5393 | ||
5394 | static rtx | |
5395 | expand_builtin_atomic_compare_exchange (enum machine_mode mode, tree exp, | |
5396 | rtx target) | |
5397 | { | |
5398 | rtx expect, desired, mem, oldval; | |
5399 | enum memmodel success, failure; | |
5400 | tree weak; | |
5401 | bool is_weak; | |
5402 | ||
5403 | success = get_memmodel (CALL_EXPR_ARG (exp, 4)); | |
5404 | failure = get_memmodel (CALL_EXPR_ARG (exp, 5)); | |
5405 | ||
5406 | if (failure == MEMMODEL_RELEASE || failure == MEMMODEL_ACQ_REL) | |
5407 | { | |
5408 | error ("invalid failure memory model for %<__atomic_compare_exchange%>"); | |
5409 | return NULL_RTX; | |
5410 | } | |
5411 | ||
5412 | if (failure > success) | |
5413 | { | |
5414 | error ("failure memory model cannot be stronger than success " | |
5415 | "memory model for %<__atomic_compare_exchange%>"); | |
5416 | return NULL_RTX; | |
5417 | } | |
5418 | ||
5419 | if (!flag_inline_atomics) | |
5420 | return NULL_RTX; | |
5421 | ||
5422 | /* Expand the operands. */ | |
5423 | mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode); | |
5424 | ||
5425 | expect = expand_normal (CALL_EXPR_ARG (exp, 1)); | |
5426 | expect = convert_memory_address (Pmode, expect); | |
5427 | desired = expand_expr_force_mode (CALL_EXPR_ARG (exp, 2), mode); | |
5428 | ||
5429 | weak = CALL_EXPR_ARG (exp, 3); | |
5430 | is_weak = false; | |
5431 | if (host_integerp (weak, 0) && tree_low_cst (weak, 0) != 0) | |
5432 | is_weak = true; | |
5433 | ||
5434 | oldval = copy_to_reg (gen_rtx_MEM (mode, expect)); | |
5435 | ||
5436 | if (!expand_atomic_compare_and_swap ((target == const0_rtx ? NULL : &target), | |
5437 | &oldval, mem, oldval, desired, | |
5438 | is_weak, success, failure)) | |
5439 | return NULL_RTX; | |
5440 | ||
5441 | emit_move_insn (gen_rtx_MEM (mode, expect), oldval); | |
5442 | return target; | |
5443 | } | |
5444 | ||
5445 | /* Expand the __atomic_load intrinsic: | |
5446 | TYPE __atomic_load (TYPE *object, enum memmodel) | |
5447 | EXP is the CALL_EXPR. | |
5448 | TARGET is an optional place for us to store the results. */ | |
5449 | ||
5450 | static rtx | |
5451 | expand_builtin_atomic_load (enum machine_mode mode, tree exp, rtx target) | |
5452 | { | |
5453 | rtx mem; | |
5454 | enum memmodel model; | |
5455 | ||
5456 | model = get_memmodel (CALL_EXPR_ARG (exp, 1)); | |
5457 | if (model == MEMMODEL_RELEASE | |
5458 | || model == MEMMODEL_ACQ_REL) | |
5459 | { | |
5460 | error ("invalid memory model for %<__atomic_load%>"); | |
5461 | return NULL_RTX; | |
5462 | } | |
5463 | ||
5464 | if (!flag_inline_atomics) | |
5465 | return NULL_RTX; | |
5466 | ||
5467 | /* Expand the operand. */ | |
5468 | mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode); | |
5469 | ||
5470 | return expand_atomic_load (target, mem, model); | |
5471 | } | |
5472 | ||
5473 | ||
5474 | /* Expand the __atomic_store intrinsic: | |
5475 | void __atomic_store (TYPE *object, TYPE desired, enum memmodel) | |
5476 | EXP is the CALL_EXPR. | |
5477 | TARGET is an optional place for us to store the results. */ | |
5478 | ||
5479 | static rtx | |
5480 | expand_builtin_atomic_store (enum machine_mode mode, tree exp) | |
5481 | { | |
5482 | rtx mem, val; | |
5483 | enum memmodel model; | |
5484 | ||
5485 | model = get_memmodel (CALL_EXPR_ARG (exp, 2)); | |
5486 | if (model != MEMMODEL_RELAXED | |
5487 | && model != MEMMODEL_SEQ_CST | |
5488 | && model != MEMMODEL_RELEASE) | |
5489 | { | |
5490 | error ("invalid memory model for %<__atomic_store%>"); | |
5491 | return NULL_RTX; | |
5492 | } | |
5493 | ||
5494 | if (!flag_inline_atomics) | |
5495 | return NULL_RTX; | |
5496 | ||
5497 | /* Expand the operands. */ | |
5498 | mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode); | |
5499 | val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode); | |
5500 | ||
5501 | return expand_atomic_store (mem, val, model, false); | |
5502 | } | |
5503 | ||
5504 | /* Expand the __atomic_fetch_XXX intrinsic: | |
5505 | TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel) | |
5506 | EXP is the CALL_EXPR. | |
5507 | TARGET is an optional place for us to store the results. | |
5508 | CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR. | |
5509 | FETCH_AFTER is true if returning the result of the operation. | |
5510 | FETCH_AFTER is false if returning the value before the operation. | |
5511 | IGNORE is true if the result is not used. | |
5512 | EXT_CALL is the correct builtin for an external call if this cannot be | |
5513 | resolved to an instruction sequence. */ | |
5514 | ||
5515 | static rtx | |
5516 | expand_builtin_atomic_fetch_op (enum machine_mode mode, tree exp, rtx target, | |
5517 | enum rtx_code code, bool fetch_after, | |
5518 | bool ignore, enum built_in_function ext_call) | |
5519 | { | |
5520 | rtx val, mem, ret; | |
5521 | enum memmodel model; | |
5522 | tree fndecl; | |
5523 | tree addr; | |
5524 | ||
5525 | model = get_memmodel (CALL_EXPR_ARG (exp, 2)); | |
5526 | ||
5527 | /* Expand the operands. */ | |
5528 | mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode); | |
5529 | val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode); | |
5530 | ||
5531 | /* Only try generating instructions if inlining is turned on. */ | |
5532 | if (flag_inline_atomics) | |
5533 | { | |
5534 | ret = expand_atomic_fetch_op (target, mem, val, code, model, fetch_after); | |
5535 | if (ret) | |
5536 | return ret; | |
5537 | } | |
5538 | ||
5539 | /* Return if a different routine isn't needed for the library call. */ | |
5540 | if (ext_call == BUILT_IN_NONE) | |
5541 | return NULL_RTX; | |
5542 | ||
5543 | /* Change the call to the specified function. */ | |
5544 | fndecl = get_callee_fndecl (exp); | |
5545 | addr = CALL_EXPR_FN (exp); | |
5546 | STRIP_NOPS (addr); | |
5547 | ||
5548 | gcc_assert (TREE_OPERAND (addr, 0) == fndecl); | |
5549 | TREE_OPERAND (addr, 0) = builtin_decl_explicit(ext_call); | |
5550 | ||
5551 | /* Expand the call here so we can emit trailing code. */ | |
5552 | ret = expand_call (exp, target, ignore); | |
5553 | ||
5554 | /* Replace the original function just in case it matters. */ | |
5555 | TREE_OPERAND (addr, 0) = fndecl; | |
5556 | ||
5557 | /* Then issue the arithmetic correction to return the right result. */ | |
5558 | if (!ignore) | |
5559 | { | |
5560 | if (code == NOT) | |
5561 | { | |
5562 | ret = expand_simple_binop (mode, AND, ret, val, NULL_RTX, true, | |
5563 | OPTAB_LIB_WIDEN); | |
5564 | ret = expand_simple_unop (mode, NOT, ret, target, true); | |
5565 | } | |
5566 | else | |
5567 | ret = expand_simple_binop (mode, code, ret, val, target, true, | |
5568 | OPTAB_LIB_WIDEN); | |
5569 | } | |
5570 | return ret; | |
5571 | } | |
5572 | ||
5573 | ||
5574 | #ifndef HAVE_atomic_clear | |
5575 | # define HAVE_atomic_clear 0 | |
5576 | # define gen_atomic_clear(x,y) (gcc_unreachable (), NULL_RTX) | |
5577 | #endif | |
5578 | ||
5579 | /* Expand an atomic clear operation. | |
5580 | void _atomic_clear (BOOL *obj, enum memmodel) | |
5581 | EXP is the call expression. */ | |
5582 | ||
5583 | static rtx | |
5584 | expand_builtin_atomic_clear (tree exp) | |
5585 | { | |
5586 | enum machine_mode mode; | |
5587 | rtx mem, ret; | |
5588 | enum memmodel model; | |
5589 | ||
5590 | mode = mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0); | |
5591 | mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode); | |
5592 | model = get_memmodel (CALL_EXPR_ARG (exp, 1)); | |
5593 | ||
5594 | if (model == MEMMODEL_ACQUIRE || model == MEMMODEL_ACQ_REL) | |
5595 | { | |
5596 | error ("invalid memory model for %<__atomic_store%>"); | |
5597 | return const0_rtx; | |
5598 | } | |
5599 | ||
5600 | if (HAVE_atomic_clear) | |
5601 | { | |
5602 | emit_insn (gen_atomic_clear (mem, model)); | |
5603 | return const0_rtx; | |
5604 | } | |
5605 | ||
5606 | /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release. | |
5607 | Failing that, a store is issued by __atomic_store. The only way this can | |
5608 | fail is if the bool type is larger than a word size. Unlikely, but | |
5609 | handle it anyway for completeness. Assume a single threaded model since | |
5610 | there is no atomic support in this case, and no barriers are required. */ | |
5611 | ret = expand_atomic_store (mem, const0_rtx, model, true); | |
5612 | if (!ret) | |
5613 | emit_move_insn (mem, const0_rtx); | |
5614 | return const0_rtx; | |
5615 | } | |
5616 | ||
5617 | /* Expand an atomic test_and_set operation. | |
5618 | bool _atomic_test_and_set (BOOL *obj, enum memmodel) | |
5619 | EXP is the call expression. */ | |
5620 | ||
5621 | static rtx | |
5622 | expand_builtin_atomic_test_and_set (tree exp, rtx target) | |
5623 | { | |
5624 | rtx mem; | |
5625 | enum memmodel model; | |
5626 | enum machine_mode mode; | |
5627 | ||
5628 | mode = mode_for_size (BOOL_TYPE_SIZE, MODE_INT, 0); | |
5629 | mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode); | |
5630 | model = get_memmodel (CALL_EXPR_ARG (exp, 1)); | |
5631 | ||
5632 | return expand_atomic_test_and_set (target, mem, model); | |
5633 | } | |
5634 | ||
5635 | ||
5636 | /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on | |
5637 | this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */ | |
5638 | ||
5639 | static tree | |
5640 | fold_builtin_atomic_always_lock_free (tree arg0, tree arg1) | |
5641 | { | |
5642 | int size; | |
5643 | enum machine_mode mode; | |
5644 | unsigned int mode_align, type_align; | |
5645 | ||
5646 | if (TREE_CODE (arg0) != INTEGER_CST) | |
5647 | return NULL_TREE; | |
5648 | ||
5649 | size = INTVAL (expand_normal (arg0)) * BITS_PER_UNIT; | |
5650 | mode = mode_for_size (size, MODE_INT, 0); | |
5651 | mode_align = GET_MODE_ALIGNMENT (mode); | |
5652 | ||
5653 | if (TREE_CODE (arg1) == INTEGER_CST && INTVAL (expand_normal (arg1)) == 0) | |
5654 | type_align = mode_align; | |
5655 | else | |
5656 | { | |
5657 | tree ttype = TREE_TYPE (arg1); | |
5658 | ||
5659 | /* This function is usually invoked and folded immediately by the front | |
5660 | end before anything else has a chance to look at it. The pointer | |
5661 | parameter at this point is usually cast to a void *, so check for that | |
5662 | and look past the cast. */ | |
5663 | if (TREE_CODE (arg1) == NOP_EXPR && POINTER_TYPE_P (ttype) | |
5664 | && VOID_TYPE_P (TREE_TYPE (ttype))) | |
5665 | arg1 = TREE_OPERAND (arg1, 0); | |
5666 | ||
5667 | ttype = TREE_TYPE (arg1); | |
5668 | gcc_assert (POINTER_TYPE_P (ttype)); | |
5669 | ||
5670 | /* Get the underlying type of the object. */ | |
5671 | ttype = TREE_TYPE (ttype); | |
5672 | type_align = TYPE_ALIGN (ttype); | |
5673 | } | |
5674 | ||
5675 | /* If the object has smaller alignment, the the lock free routines cannot | |
5676 | be used. */ | |
5677 | if (type_align < mode_align) | |
5678 | return boolean_false_node; | |
5679 | ||
5680 | /* Check if a compare_and_swap pattern exists for the mode which represents | |
5681 | the required size. The pattern is not allowed to fail, so the existence | |
5682 | of the pattern indicates support is present. */ | |
5683 | if (can_compare_and_swap_p (mode, true)) | |
5684 | return boolean_true_node; | |
5685 | else | |
5686 | return boolean_false_node; | |
5687 | } | |
5688 | ||
5689 | /* Return true if the parameters to call EXP represent an object which will | |
5690 | always generate lock free instructions. The first argument represents the | |
5691 | size of the object, and the second parameter is a pointer to the object | |
5692 | itself. If NULL is passed for the object, then the result is based on | |
5693 | typical alignment for an object of the specified size. Otherwise return | |
5694 | false. */ | |
5695 | ||
5696 | static rtx | |
5697 | expand_builtin_atomic_always_lock_free (tree exp) | |
5698 | { | |
5699 | tree size; | |
5700 | tree arg0 = CALL_EXPR_ARG (exp, 0); | |
5701 | tree arg1 = CALL_EXPR_ARG (exp, 1); | |
5702 | ||
5703 | if (TREE_CODE (arg0) != INTEGER_CST) | |
5704 | { | |
5705 | error ("non-constant argument 1 to __atomic_always_lock_free"); | |
5706 | return const0_rtx; | |
5707 | } | |
5708 | ||
5709 | size = fold_builtin_atomic_always_lock_free (arg0, arg1); | |
5710 | if (size == boolean_true_node) | |
5711 | return const1_rtx; | |
5712 | return const0_rtx; | |
5713 | } | |
5714 | ||
5715 | /* Return a one or zero if it can be determined that object ARG1 of size ARG | |
5716 | is lock free on this architecture. */ | |
5717 | ||
5718 | static tree | |
5719 | fold_builtin_atomic_is_lock_free (tree arg0, tree arg1) | |
5720 | { | |
5721 | if (!flag_inline_atomics) | |
5722 | return NULL_TREE; | |
5723 | ||
5724 | /* If it isn't always lock free, don't generate a result. */ | |
5725 | if (fold_builtin_atomic_always_lock_free (arg0, arg1) == boolean_true_node) | |
5726 | return boolean_true_node; | |
5727 | ||
5728 | return NULL_TREE; | |
5729 | } | |
5730 | ||
5731 | /* Return true if the parameters to call EXP represent an object which will | |
5732 | always generate lock free instructions. The first argument represents the | |
5733 | size of the object, and the second parameter is a pointer to the object | |
5734 | itself. If NULL is passed for the object, then the result is based on | |
5735 | typical alignment for an object of the specified size. Otherwise return | |
5736 | NULL*/ | |
5737 | ||
5738 | static rtx | |
5739 | expand_builtin_atomic_is_lock_free (tree exp) | |
5740 | { | |
5741 | tree size; | |
5742 | tree arg0 = CALL_EXPR_ARG (exp, 0); | |
5743 | tree arg1 = CALL_EXPR_ARG (exp, 1); | |
5744 | ||
5745 | if (!INTEGRAL_TYPE_P (TREE_TYPE (arg0))) | |
5746 | { | |
5747 | error ("non-integer argument 1 to __atomic_is_lock_free"); | |
5748 | return NULL_RTX; | |
5749 | } | |
5750 | ||
5751 | if (!flag_inline_atomics) | |
5752 | return NULL_RTX; | |
5753 | ||
5754 | /* If the value is known at compile time, return the RTX for it. */ | |
5755 | size = fold_builtin_atomic_is_lock_free (arg0, arg1); | |
5756 | if (size == boolean_true_node) | |
5757 | return const1_rtx; | |
5758 | ||
5759 | return NULL_RTX; | |
5760 | } | |
5761 | ||
5762 | /* Expand the __atomic_thread_fence intrinsic: | |
5763 | void __atomic_thread_fence (enum memmodel) | |
5764 | EXP is the CALL_EXPR. */ | |
5765 | ||
5766 | static void | |
5767 | expand_builtin_atomic_thread_fence (tree exp) | |
5768 | { | |
5769 | enum memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 0)); | |
5770 | expand_mem_thread_fence (model); | |
5771 | } | |
5772 | ||
5773 | /* Expand the __atomic_signal_fence intrinsic: | |
5774 | void __atomic_signal_fence (enum memmodel) | |
5775 | EXP is the CALL_EXPR. */ | |
5776 | ||
5777 | static void | |
5778 | expand_builtin_atomic_signal_fence (tree exp) | |
5779 | { | |
5780 | enum memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 0)); | |
5781 | expand_mem_signal_fence (model); | |
5782 | } | |
5783 | ||
5784 | /* Expand the __sync_synchronize intrinsic. */ | |
5785 | ||
5786 | static void | |
5787 | expand_builtin_sync_synchronize (void) | |
5788 | { | |
5789 | expand_mem_thread_fence (MEMMODEL_SEQ_CST); | |
5790 | } | |
5791 | ||
5792 | \f | |
5793 | /* Expand an expression EXP that calls a built-in function, | |
5794 | with result going to TARGET if that's convenient | |
5795 | (and in mode MODE if that's convenient). | |
5796 | SUBTARGET may be used as the target for computing one of EXP's operands. | |
5797 | IGNORE is nonzero if the value is to be ignored. */ | |
5798 | ||
5799 | rtx | |
5800 | expand_builtin (tree exp, rtx target, rtx subtarget, enum machine_mode mode, | |
5801 | int ignore) | |
5802 | { | |
5803 | tree fndecl = get_callee_fndecl (exp); | |
5804 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
5805 | enum machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp)); | |
5806 | int flags; | |
5807 | ||
5808 | if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD) | |
5809 | return targetm.expand_builtin (exp, target, subtarget, mode, ignore); | |
5810 | ||
5811 | /* When not optimizing, generate calls to library functions for a certain | |
5812 | set of builtins. */ | |
5813 | if (!optimize | |
5814 | && !called_as_built_in (fndecl) | |
5815 | && fcode != BUILT_IN_ALLOCA | |
5816 | && fcode != BUILT_IN_ALLOCA_WITH_ALIGN | |
5817 | && fcode != BUILT_IN_FREE) | |
5818 | return expand_call (exp, target, ignore); | |
5819 | ||
5820 | /* The built-in function expanders test for target == const0_rtx | |
5821 | to determine whether the function's result will be ignored. */ | |
5822 | if (ignore) | |
5823 | target = const0_rtx; | |
5824 | ||
5825 | /* If the result of a pure or const built-in function is ignored, and | |
5826 | none of its arguments are volatile, we can avoid expanding the | |
5827 | built-in call and just evaluate the arguments for side-effects. */ | |
5828 | if (target == const0_rtx | |
5829 | && ((flags = flags_from_decl_or_type (fndecl)) & (ECF_CONST | ECF_PURE)) | |
5830 | && !(flags & ECF_LOOPING_CONST_OR_PURE)) | |
5831 | { | |
5832 | bool volatilep = false; | |
5833 | tree arg; | |
5834 | call_expr_arg_iterator iter; | |
5835 | ||
5836 | FOR_EACH_CALL_EXPR_ARG (arg, iter, exp) | |
5837 | if (TREE_THIS_VOLATILE (arg)) | |
5838 | { | |
5839 | volatilep = true; | |
5840 | break; | |
5841 | } | |
5842 | ||
5843 | if (! volatilep) | |
5844 | { | |
5845 | FOR_EACH_CALL_EXPR_ARG (arg, iter, exp) | |
5846 | expand_expr (arg, const0_rtx, VOIDmode, EXPAND_NORMAL); | |
5847 | return const0_rtx; | |
5848 | } | |
5849 | } | |
5850 | ||
5851 | switch (fcode) | |
5852 | { | |
5853 | CASE_FLT_FN (BUILT_IN_FABS): | |
5854 | target = expand_builtin_fabs (exp, target, subtarget); | |
5855 | if (target) | |
5856 | return target; | |
5857 | break; | |
5858 | ||
5859 | CASE_FLT_FN (BUILT_IN_COPYSIGN): | |
5860 | target = expand_builtin_copysign (exp, target, subtarget); | |
5861 | if (target) | |
5862 | return target; | |
5863 | break; | |
5864 | ||
5865 | /* Just do a normal library call if we were unable to fold | |
5866 | the values. */ | |
5867 | CASE_FLT_FN (BUILT_IN_CABS): | |
5868 | break; | |
5869 | ||
5870 | CASE_FLT_FN (BUILT_IN_EXP): | |
5871 | CASE_FLT_FN (BUILT_IN_EXP10): | |
5872 | CASE_FLT_FN (BUILT_IN_POW10): | |
5873 | CASE_FLT_FN (BUILT_IN_EXP2): | |
5874 | CASE_FLT_FN (BUILT_IN_EXPM1): | |
5875 | CASE_FLT_FN (BUILT_IN_LOGB): | |
5876 | CASE_FLT_FN (BUILT_IN_LOG): | |
5877 | CASE_FLT_FN (BUILT_IN_LOG10): | |
5878 | CASE_FLT_FN (BUILT_IN_LOG2): | |
5879 | CASE_FLT_FN (BUILT_IN_LOG1P): | |
5880 | CASE_FLT_FN (BUILT_IN_TAN): | |
5881 | CASE_FLT_FN (BUILT_IN_ASIN): | |
5882 | CASE_FLT_FN (BUILT_IN_ACOS): | |
5883 | CASE_FLT_FN (BUILT_IN_ATAN): | |
5884 | CASE_FLT_FN (BUILT_IN_SIGNIFICAND): | |
5885 | /* Treat these like sqrt only if unsafe math optimizations are allowed, | |
5886 | because of possible accuracy problems. */ | |
5887 | if (! flag_unsafe_math_optimizations) | |
5888 | break; | |
5889 | CASE_FLT_FN (BUILT_IN_SQRT): | |
5890 | CASE_FLT_FN (BUILT_IN_FLOOR): | |
5891 | CASE_FLT_FN (BUILT_IN_CEIL): | |
5892 | CASE_FLT_FN (BUILT_IN_TRUNC): | |
5893 | CASE_FLT_FN (BUILT_IN_ROUND): | |
5894 | CASE_FLT_FN (BUILT_IN_NEARBYINT): | |
5895 | CASE_FLT_FN (BUILT_IN_RINT): | |
5896 | target = expand_builtin_mathfn (exp, target, subtarget); | |
5897 | if (target) | |
5898 | return target; | |
5899 | break; | |
5900 | ||
5901 | CASE_FLT_FN (BUILT_IN_FMA): | |
5902 | target = expand_builtin_mathfn_ternary (exp, target, subtarget); | |
5903 | if (target) | |
5904 | return target; | |
5905 | break; | |
5906 | ||
5907 | CASE_FLT_FN (BUILT_IN_ILOGB): | |
5908 | if (! flag_unsafe_math_optimizations) | |
5909 | break; | |
5910 | CASE_FLT_FN (BUILT_IN_ISINF): | |
5911 | CASE_FLT_FN (BUILT_IN_FINITE): | |
5912 | case BUILT_IN_ISFINITE: | |
5913 | case BUILT_IN_ISNORMAL: | |
5914 | target = expand_builtin_interclass_mathfn (exp, target); | |
5915 | if (target) | |
5916 | return target; | |
5917 | break; | |
5918 | ||
5919 | CASE_FLT_FN (BUILT_IN_ICEIL): | |
5920 | CASE_FLT_FN (BUILT_IN_LCEIL): | |
5921 | CASE_FLT_FN (BUILT_IN_LLCEIL): | |
5922 | CASE_FLT_FN (BUILT_IN_LFLOOR): | |
5923 | CASE_FLT_FN (BUILT_IN_IFLOOR): | |
5924 | CASE_FLT_FN (BUILT_IN_LLFLOOR): | |
5925 | target = expand_builtin_int_roundingfn (exp, target); | |
5926 | if (target) | |
5927 | return target; | |
5928 | break; | |
5929 | ||
5930 | CASE_FLT_FN (BUILT_IN_IRINT): | |
5931 | CASE_FLT_FN (BUILT_IN_LRINT): | |
5932 | CASE_FLT_FN (BUILT_IN_LLRINT): | |
5933 | CASE_FLT_FN (BUILT_IN_IROUND): | |
5934 | CASE_FLT_FN (BUILT_IN_LROUND): | |
5935 | CASE_FLT_FN (BUILT_IN_LLROUND): | |
5936 | target = expand_builtin_int_roundingfn_2 (exp, target); | |
5937 | if (target) | |
5938 | return target; | |
5939 | break; | |
5940 | ||
5941 | CASE_FLT_FN (BUILT_IN_POWI): | |
5942 | target = expand_builtin_powi (exp, target); | |
5943 | if (target) | |
5944 | return target; | |
5945 | break; | |
5946 | ||
5947 | CASE_FLT_FN (BUILT_IN_ATAN2): | |
5948 | CASE_FLT_FN (BUILT_IN_LDEXP): | |
5949 | CASE_FLT_FN (BUILT_IN_SCALB): | |
5950 | CASE_FLT_FN (BUILT_IN_SCALBN): | |
5951 | CASE_FLT_FN (BUILT_IN_SCALBLN): | |
5952 | if (! flag_unsafe_math_optimizations) | |
5953 | break; | |
5954 | ||
5955 | CASE_FLT_FN (BUILT_IN_FMOD): | |
5956 | CASE_FLT_FN (BUILT_IN_REMAINDER): | |
5957 | CASE_FLT_FN (BUILT_IN_DREM): | |
5958 | CASE_FLT_FN (BUILT_IN_POW): | |
5959 | target = expand_builtin_mathfn_2 (exp, target, subtarget); | |
5960 | if (target) | |
5961 | return target; | |
5962 | break; | |
5963 | ||
5964 | CASE_FLT_FN (BUILT_IN_CEXPI): | |
5965 | target = expand_builtin_cexpi (exp, target); | |
5966 | gcc_assert (target); | |
5967 | return target; | |
5968 | ||
5969 | CASE_FLT_FN (BUILT_IN_SIN): | |
5970 | CASE_FLT_FN (BUILT_IN_COS): | |
5971 | if (! flag_unsafe_math_optimizations) | |
5972 | break; | |
5973 | target = expand_builtin_mathfn_3 (exp, target, subtarget); | |
5974 | if (target) | |
5975 | return target; | |
5976 | break; | |
5977 | ||
5978 | CASE_FLT_FN (BUILT_IN_SINCOS): | |
5979 | if (! flag_unsafe_math_optimizations) | |
5980 | break; | |
5981 | target = expand_builtin_sincos (exp); | |
5982 | if (target) | |
5983 | return target; | |
5984 | break; | |
5985 | ||
5986 | case BUILT_IN_APPLY_ARGS: | |
5987 | return expand_builtin_apply_args (); | |
5988 | ||
5989 | /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes | |
5990 | FUNCTION with a copy of the parameters described by | |
5991 | ARGUMENTS, and ARGSIZE. It returns a block of memory | |
5992 | allocated on the stack into which is stored all the registers | |
5993 | that might possibly be used for returning the result of a | |
5994 | function. ARGUMENTS is the value returned by | |
5995 | __builtin_apply_args. ARGSIZE is the number of bytes of | |
5996 | arguments that must be copied. ??? How should this value be | |
5997 | computed? We'll also need a safe worst case value for varargs | |
5998 | functions. */ | |
5999 | case BUILT_IN_APPLY: | |
6000 | if (!validate_arglist (exp, POINTER_TYPE, | |
6001 | POINTER_TYPE, INTEGER_TYPE, VOID_TYPE) | |
6002 | && !validate_arglist (exp, REFERENCE_TYPE, | |
6003 | POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)) | |
6004 | return const0_rtx; | |
6005 | else | |
6006 | { | |
6007 | rtx ops[3]; | |
6008 | ||
6009 | ops[0] = expand_normal (CALL_EXPR_ARG (exp, 0)); | |
6010 | ops[1] = expand_normal (CALL_EXPR_ARG (exp, 1)); | |
6011 | ops[2] = expand_normal (CALL_EXPR_ARG (exp, 2)); | |
6012 | ||
6013 | return expand_builtin_apply (ops[0], ops[1], ops[2]); | |
6014 | } | |
6015 | ||
6016 | /* __builtin_return (RESULT) causes the function to return the | |
6017 | value described by RESULT. RESULT is address of the block of | |
6018 | memory returned by __builtin_apply. */ | |
6019 | case BUILT_IN_RETURN: | |
6020 | if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE)) | |
6021 | expand_builtin_return (expand_normal (CALL_EXPR_ARG (exp, 0))); | |
6022 | return const0_rtx; | |
6023 | ||
6024 | case BUILT_IN_SAVEREGS: | |
6025 | return expand_builtin_saveregs (); | |
6026 | ||
6027 | case BUILT_IN_VA_ARG_PACK: | |
6028 | /* All valid uses of __builtin_va_arg_pack () are removed during | |
6029 | inlining. */ | |
6030 | error ("%Kinvalid use of %<__builtin_va_arg_pack ()%>", exp); | |
6031 | return const0_rtx; | |
6032 | ||
6033 | case BUILT_IN_VA_ARG_PACK_LEN: | |
6034 | /* All valid uses of __builtin_va_arg_pack_len () are removed during | |
6035 | inlining. */ | |
6036 | error ("%Kinvalid use of %<__builtin_va_arg_pack_len ()%>", exp); | |
6037 | return const0_rtx; | |
6038 | ||
6039 | /* Return the address of the first anonymous stack arg. */ | |
6040 | case BUILT_IN_NEXT_ARG: | |
6041 | if (fold_builtin_next_arg (exp, false)) | |
6042 | return const0_rtx; | |
6043 | return expand_builtin_next_arg (); | |
6044 | ||
6045 | case BUILT_IN_CLEAR_CACHE: | |
6046 | target = expand_builtin___clear_cache (exp); | |
6047 | if (target) | |
6048 | return target; | |
6049 | break; | |
6050 | ||
6051 | case BUILT_IN_CLASSIFY_TYPE: | |
6052 | return expand_builtin_classify_type (exp); | |
6053 | ||
6054 | case BUILT_IN_CONSTANT_P: | |
6055 | return const0_rtx; | |
6056 | ||
6057 | case BUILT_IN_FRAME_ADDRESS: | |
6058 | case BUILT_IN_RETURN_ADDRESS: | |
6059 | return expand_builtin_frame_address (fndecl, exp); | |
6060 | ||
6061 | /* Returns the address of the area where the structure is returned. | |
6062 | 0 otherwise. */ | |
6063 | case BUILT_IN_AGGREGATE_INCOMING_ADDRESS: | |
6064 | if (call_expr_nargs (exp) != 0 | |
6065 | || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))) | |
6066 | || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl)))) | |
6067 | return const0_rtx; | |
6068 | else | |
6069 | return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0); | |
6070 | ||
6071 | case BUILT_IN_ALLOCA: | |
6072 | case BUILT_IN_ALLOCA_WITH_ALIGN: | |
6073 | /* If the allocation stems from the declaration of a variable-sized | |
6074 | object, it cannot accumulate. */ | |
6075 | target = expand_builtin_alloca (exp, CALL_ALLOCA_FOR_VAR_P (exp)); | |
6076 | if (target) | |
6077 | return target; | |
6078 | break; | |
6079 | ||
6080 | case BUILT_IN_STACK_SAVE: | |
6081 | return expand_stack_save (); | |
6082 | ||
6083 | case BUILT_IN_STACK_RESTORE: | |
6084 | expand_stack_restore (CALL_EXPR_ARG (exp, 0)); | |
6085 | return const0_rtx; | |
6086 | ||
6087 | case BUILT_IN_BSWAP32: | |
6088 | case BUILT_IN_BSWAP64: | |
6089 | target = expand_builtin_bswap (exp, target, subtarget); | |
6090 | ||
6091 | if (target) | |
6092 | return target; | |
6093 | break; | |
6094 | ||
6095 | CASE_INT_FN (BUILT_IN_FFS): | |
6096 | case BUILT_IN_FFSIMAX: | |
6097 | target = expand_builtin_unop (target_mode, exp, target, | |
6098 | subtarget, ffs_optab); | |
6099 | if (target) | |
6100 | return target; | |
6101 | break; | |
6102 | ||
6103 | CASE_INT_FN (BUILT_IN_CLZ): | |
6104 | case BUILT_IN_CLZIMAX: | |
6105 | target = expand_builtin_unop (target_mode, exp, target, | |
6106 | subtarget, clz_optab); | |
6107 | if (target) | |
6108 | return target; | |
6109 | break; | |
6110 | ||
6111 | CASE_INT_FN (BUILT_IN_CTZ): | |
6112 | case BUILT_IN_CTZIMAX: | |
6113 | target = expand_builtin_unop (target_mode, exp, target, | |
6114 | subtarget, ctz_optab); | |
6115 | if (target) | |
6116 | return target; | |
6117 | break; | |
6118 | ||
6119 | CASE_INT_FN (BUILT_IN_CLRSB): | |
6120 | case BUILT_IN_CLRSBIMAX: | |
6121 | target = expand_builtin_unop (target_mode, exp, target, | |
6122 | subtarget, clrsb_optab); | |
6123 | if (target) | |
6124 | return target; | |
6125 | break; | |
6126 | ||
6127 | CASE_INT_FN (BUILT_IN_POPCOUNT): | |
6128 | case BUILT_IN_POPCOUNTIMAX: | |
6129 | target = expand_builtin_unop (target_mode, exp, target, | |
6130 | subtarget, popcount_optab); | |
6131 | if (target) | |
6132 | return target; | |
6133 | break; | |
6134 | ||
6135 | CASE_INT_FN (BUILT_IN_PARITY): | |
6136 | case BUILT_IN_PARITYIMAX: | |
6137 | target = expand_builtin_unop (target_mode, exp, target, | |
6138 | subtarget, parity_optab); | |
6139 | if (target) | |
6140 | return target; | |
6141 | break; | |
6142 | ||
6143 | case BUILT_IN_STRLEN: | |
6144 | target = expand_builtin_strlen (exp, target, target_mode); | |
6145 | if (target) | |
6146 | return target; | |
6147 | break; | |
6148 | ||
6149 | case BUILT_IN_STRCPY: | |
6150 | target = expand_builtin_strcpy (exp, target); | |
6151 | if (target) | |
6152 | return target; | |
6153 | break; | |
6154 | ||
6155 | case BUILT_IN_STRNCPY: | |
6156 | target = expand_builtin_strncpy (exp, target); | |
6157 | if (target) | |
6158 | return target; | |
6159 | break; | |
6160 | ||
6161 | case BUILT_IN_STPCPY: | |
6162 | target = expand_builtin_stpcpy (exp, target, mode); | |
6163 | if (target) | |
6164 | return target; | |
6165 | break; | |
6166 | ||
6167 | case BUILT_IN_MEMCPY: | |
6168 | target = expand_builtin_memcpy (exp, target); | |
6169 | if (target) | |
6170 | return target; | |
6171 | break; | |
6172 | ||
6173 | case BUILT_IN_MEMPCPY: | |
6174 | target = expand_builtin_mempcpy (exp, target, mode); | |
6175 | if (target) | |
6176 | return target; | |
6177 | break; | |
6178 | ||
6179 | case BUILT_IN_MEMSET: | |
6180 | target = expand_builtin_memset (exp, target, mode); | |
6181 | if (target) | |
6182 | return target; | |
6183 | break; | |
6184 | ||
6185 | case BUILT_IN_BZERO: | |
6186 | target = expand_builtin_bzero (exp); | |
6187 | if (target) | |
6188 | return target; | |
6189 | break; | |
6190 | ||
6191 | case BUILT_IN_STRCMP: | |
6192 | target = expand_builtin_strcmp (exp, target); | |
6193 | if (target) | |
6194 | return target; | |
6195 | break; | |
6196 | ||
6197 | case BUILT_IN_STRNCMP: | |
6198 | target = expand_builtin_strncmp (exp, target, mode); | |
6199 | if (target) | |
6200 | return target; | |
6201 | break; | |
6202 | ||
6203 | case BUILT_IN_BCMP: | |
6204 | case BUILT_IN_MEMCMP: | |
6205 | target = expand_builtin_memcmp (exp, target, mode); | |
6206 | if (target) | |
6207 | return target; | |
6208 | break; | |
6209 | ||
6210 | case BUILT_IN_SETJMP: | |
6211 | /* This should have been lowered to the builtins below. */ | |
6212 | gcc_unreachable (); | |
6213 | ||
6214 | case BUILT_IN_SETJMP_SETUP: | |
6215 | /* __builtin_setjmp_setup is passed a pointer to an array of five words | |
6216 | and the receiver label. */ | |
6217 | if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE)) | |
6218 | { | |
6219 | rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget, | |
6220 | VOIDmode, EXPAND_NORMAL); | |
6221 | tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 1), 0); | |
6222 | rtx label_r = label_rtx (label); | |
6223 | ||
6224 | /* This is copied from the handling of non-local gotos. */ | |
6225 | expand_builtin_setjmp_setup (buf_addr, label_r); | |
6226 | nonlocal_goto_handler_labels | |
6227 | = gen_rtx_EXPR_LIST (VOIDmode, label_r, | |
6228 | nonlocal_goto_handler_labels); | |
6229 | /* ??? Do not let expand_label treat us as such since we would | |
6230 | not want to be both on the list of non-local labels and on | |
6231 | the list of forced labels. */ | |
6232 | FORCED_LABEL (label) = 0; | |
6233 | return const0_rtx; | |
6234 | } | |
6235 | break; | |
6236 | ||
6237 | case BUILT_IN_SETJMP_DISPATCHER: | |
6238 | /* __builtin_setjmp_dispatcher is passed the dispatcher label. */ | |
6239 | if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE)) | |
6240 | { | |
6241 | tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0); | |
6242 | rtx label_r = label_rtx (label); | |
6243 | ||
6244 | /* Remove the dispatcher label from the list of non-local labels | |
6245 | since the receiver labels have been added to it above. */ | |
6246 | remove_node_from_expr_list (label_r, &nonlocal_goto_handler_labels); | |
6247 | return const0_rtx; | |
6248 | } | |
6249 | break; | |
6250 | ||
6251 | case BUILT_IN_SETJMP_RECEIVER: | |
6252 | /* __builtin_setjmp_receiver is passed the receiver label. */ | |
6253 | if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE)) | |
6254 | { | |
6255 | tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0); | |
6256 | rtx label_r = label_rtx (label); | |
6257 | ||
6258 | expand_builtin_setjmp_receiver (label_r); | |
6259 | return const0_rtx; | |
6260 | } | |
6261 | break; | |
6262 | ||
6263 | /* __builtin_longjmp is passed a pointer to an array of five words. | |
6264 | It's similar to the C library longjmp function but works with | |
6265 | __builtin_setjmp above. */ | |
6266 | case BUILT_IN_LONGJMP: | |
6267 | if (validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)) | |
6268 | { | |
6269 | rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget, | |
6270 | VOIDmode, EXPAND_NORMAL); | |
6271 | rtx value = expand_normal (CALL_EXPR_ARG (exp, 1)); | |
6272 | ||
6273 | if (value != const1_rtx) | |
6274 | { | |
6275 | error ("%<__builtin_longjmp%> second argument must be 1"); | |
6276 | return const0_rtx; | |
6277 | } | |
6278 | ||
6279 | expand_builtin_longjmp (buf_addr, value); | |
6280 | return const0_rtx; | |
6281 | } | |
6282 | break; | |
6283 | ||
6284 | case BUILT_IN_NONLOCAL_GOTO: | |
6285 | target = expand_builtin_nonlocal_goto (exp); | |
6286 | if (target) | |
6287 | return target; | |
6288 | break; | |
6289 | ||
6290 | /* This updates the setjmp buffer that is its argument with the value | |
6291 | of the current stack pointer. */ | |
6292 | case BUILT_IN_UPDATE_SETJMP_BUF: | |
6293 | if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE)) | |
6294 | { | |
6295 | rtx buf_addr | |
6296 | = expand_normal (CALL_EXPR_ARG (exp, 0)); | |
6297 | ||
6298 | expand_builtin_update_setjmp_buf (buf_addr); | |
6299 | return const0_rtx; | |
6300 | } | |
6301 | break; | |
6302 | ||
6303 | case BUILT_IN_TRAP: | |
6304 | expand_builtin_trap (); | |
6305 | return const0_rtx; | |
6306 | ||
6307 | case BUILT_IN_UNREACHABLE: | |
6308 | expand_builtin_unreachable (); | |
6309 | return const0_rtx; | |
6310 | ||
6311 | CASE_FLT_FN (BUILT_IN_SIGNBIT): | |
6312 | case BUILT_IN_SIGNBITD32: | |
6313 | case BUILT_IN_SIGNBITD64: | |
6314 | case BUILT_IN_SIGNBITD128: | |
6315 | target = expand_builtin_signbit (exp, target); | |
6316 | if (target) | |
6317 | return target; | |
6318 | break; | |
6319 | ||
6320 | /* Various hooks for the DWARF 2 __throw routine. */ | |
6321 | case BUILT_IN_UNWIND_INIT: | |
6322 | expand_builtin_unwind_init (); | |
6323 | return const0_rtx; | |
6324 | case BUILT_IN_DWARF_CFA: | |
6325 | return virtual_cfa_rtx; | |
6326 | #ifdef DWARF2_UNWIND_INFO | |
6327 | case BUILT_IN_DWARF_SP_COLUMN: | |
6328 | return expand_builtin_dwarf_sp_column (); | |
6329 | case BUILT_IN_INIT_DWARF_REG_SIZES: | |
6330 | expand_builtin_init_dwarf_reg_sizes (CALL_EXPR_ARG (exp, 0)); | |
6331 | return const0_rtx; | |
6332 | #endif | |
6333 | case BUILT_IN_FROB_RETURN_ADDR: | |
6334 | return expand_builtin_frob_return_addr (CALL_EXPR_ARG (exp, 0)); | |
6335 | case BUILT_IN_EXTRACT_RETURN_ADDR: | |
6336 | return expand_builtin_extract_return_addr (CALL_EXPR_ARG (exp, 0)); | |
6337 | case BUILT_IN_EH_RETURN: | |
6338 | expand_builtin_eh_return (CALL_EXPR_ARG (exp, 0), | |
6339 | CALL_EXPR_ARG (exp, 1)); | |
6340 | return const0_rtx; | |
6341 | #ifdef EH_RETURN_DATA_REGNO | |
6342 | case BUILT_IN_EH_RETURN_DATA_REGNO: | |
6343 | return expand_builtin_eh_return_data_regno (exp); | |
6344 | #endif | |
6345 | case BUILT_IN_EXTEND_POINTER: | |
6346 | return expand_builtin_extend_pointer (CALL_EXPR_ARG (exp, 0)); | |
6347 | case BUILT_IN_EH_POINTER: | |
6348 | return expand_builtin_eh_pointer (exp); | |
6349 | case BUILT_IN_EH_FILTER: | |
6350 | return expand_builtin_eh_filter (exp); | |
6351 | case BUILT_IN_EH_COPY_VALUES: | |
6352 | return expand_builtin_eh_copy_values (exp); | |
6353 | ||
6354 | case BUILT_IN_VA_START: | |
6355 | return expand_builtin_va_start (exp); | |
6356 | case BUILT_IN_VA_END: | |
6357 | return expand_builtin_va_end (exp); | |
6358 | case BUILT_IN_VA_COPY: | |
6359 | return expand_builtin_va_copy (exp); | |
6360 | case BUILT_IN_EXPECT: | |
6361 | return expand_builtin_expect (exp, target); | |
6362 | case BUILT_IN_ASSUME_ALIGNED: | |
6363 | return expand_builtin_assume_aligned (exp, target); | |
6364 | case BUILT_IN_PREFETCH: | |
6365 | expand_builtin_prefetch (exp); | |
6366 | return const0_rtx; | |
6367 | ||
6368 | case BUILT_IN_INIT_TRAMPOLINE: | |
6369 | return expand_builtin_init_trampoline (exp, true); | |
6370 | case BUILT_IN_INIT_HEAP_TRAMPOLINE: | |
6371 | return expand_builtin_init_trampoline (exp, false); | |
6372 | case BUILT_IN_ADJUST_TRAMPOLINE: | |
6373 | return expand_builtin_adjust_trampoline (exp); | |
6374 | ||
6375 | case BUILT_IN_FORK: | |
6376 | case BUILT_IN_EXECL: | |
6377 | case BUILT_IN_EXECV: | |
6378 | case BUILT_IN_EXECLP: | |
6379 | case BUILT_IN_EXECLE: | |
6380 | case BUILT_IN_EXECVP: | |
6381 | case BUILT_IN_EXECVE: | |
6382 | target = expand_builtin_fork_or_exec (fndecl, exp, target, ignore); | |
6383 | if (target) | |
6384 | return target; | |
6385 | break; | |
6386 | ||
6387 | case BUILT_IN_SYNC_FETCH_AND_ADD_1: | |
6388 | case BUILT_IN_SYNC_FETCH_AND_ADD_2: | |
6389 | case BUILT_IN_SYNC_FETCH_AND_ADD_4: | |
6390 | case BUILT_IN_SYNC_FETCH_AND_ADD_8: | |
6391 | case BUILT_IN_SYNC_FETCH_AND_ADD_16: | |
6392 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_ADD_1); | |
6393 | target = expand_builtin_sync_operation (mode, exp, PLUS, false, target); | |
6394 | if (target) | |
6395 | return target; | |
6396 | break; | |
6397 | ||
6398 | case BUILT_IN_SYNC_FETCH_AND_SUB_1: | |
6399 | case BUILT_IN_SYNC_FETCH_AND_SUB_2: | |
6400 | case BUILT_IN_SYNC_FETCH_AND_SUB_4: | |
6401 | case BUILT_IN_SYNC_FETCH_AND_SUB_8: | |
6402 | case BUILT_IN_SYNC_FETCH_AND_SUB_16: | |
6403 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_SUB_1); | |
6404 | target = expand_builtin_sync_operation (mode, exp, MINUS, false, target); | |
6405 | if (target) | |
6406 | return target; | |
6407 | break; | |
6408 | ||
6409 | case BUILT_IN_SYNC_FETCH_AND_OR_1: | |
6410 | case BUILT_IN_SYNC_FETCH_AND_OR_2: | |
6411 | case BUILT_IN_SYNC_FETCH_AND_OR_4: | |
6412 | case BUILT_IN_SYNC_FETCH_AND_OR_8: | |
6413 | case BUILT_IN_SYNC_FETCH_AND_OR_16: | |
6414 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_OR_1); | |
6415 | target = expand_builtin_sync_operation (mode, exp, IOR, false, target); | |
6416 | if (target) | |
6417 | return target; | |
6418 | break; | |
6419 | ||
6420 | case BUILT_IN_SYNC_FETCH_AND_AND_1: | |
6421 | case BUILT_IN_SYNC_FETCH_AND_AND_2: | |
6422 | case BUILT_IN_SYNC_FETCH_AND_AND_4: | |
6423 | case BUILT_IN_SYNC_FETCH_AND_AND_8: | |
6424 | case BUILT_IN_SYNC_FETCH_AND_AND_16: | |
6425 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_AND_1); | |
6426 | target = expand_builtin_sync_operation (mode, exp, AND, false, target); | |
6427 | if (target) | |
6428 | return target; | |
6429 | break; | |
6430 | ||
6431 | case BUILT_IN_SYNC_FETCH_AND_XOR_1: | |
6432 | case BUILT_IN_SYNC_FETCH_AND_XOR_2: | |
6433 | case BUILT_IN_SYNC_FETCH_AND_XOR_4: | |
6434 | case BUILT_IN_SYNC_FETCH_AND_XOR_8: | |
6435 | case BUILT_IN_SYNC_FETCH_AND_XOR_16: | |
6436 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_XOR_1); | |
6437 | target = expand_builtin_sync_operation (mode, exp, XOR, false, target); | |
6438 | if (target) | |
6439 | return target; | |
6440 | break; | |
6441 | ||
6442 | case BUILT_IN_SYNC_FETCH_AND_NAND_1: | |
6443 | case BUILT_IN_SYNC_FETCH_AND_NAND_2: | |
6444 | case BUILT_IN_SYNC_FETCH_AND_NAND_4: | |
6445 | case BUILT_IN_SYNC_FETCH_AND_NAND_8: | |
6446 | case BUILT_IN_SYNC_FETCH_AND_NAND_16: | |
6447 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_NAND_1); | |
6448 | target = expand_builtin_sync_operation (mode, exp, NOT, false, target); | |
6449 | if (target) | |
6450 | return target; | |
6451 | break; | |
6452 | ||
6453 | case BUILT_IN_SYNC_ADD_AND_FETCH_1: | |
6454 | case BUILT_IN_SYNC_ADD_AND_FETCH_2: | |
6455 | case BUILT_IN_SYNC_ADD_AND_FETCH_4: | |
6456 | case BUILT_IN_SYNC_ADD_AND_FETCH_8: | |
6457 | case BUILT_IN_SYNC_ADD_AND_FETCH_16: | |
6458 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_ADD_AND_FETCH_1); | |
6459 | target = expand_builtin_sync_operation (mode, exp, PLUS, true, target); | |
6460 | if (target) | |
6461 | return target; | |
6462 | break; | |
6463 | ||
6464 | case BUILT_IN_SYNC_SUB_AND_FETCH_1: | |
6465 | case BUILT_IN_SYNC_SUB_AND_FETCH_2: | |
6466 | case BUILT_IN_SYNC_SUB_AND_FETCH_4: | |
6467 | case BUILT_IN_SYNC_SUB_AND_FETCH_8: | |
6468 | case BUILT_IN_SYNC_SUB_AND_FETCH_16: | |
6469 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_SUB_AND_FETCH_1); | |
6470 | target = expand_builtin_sync_operation (mode, exp, MINUS, true, target); | |
6471 | if (target) | |
6472 | return target; | |
6473 | break; | |
6474 | ||
6475 | case BUILT_IN_SYNC_OR_AND_FETCH_1: | |
6476 | case BUILT_IN_SYNC_OR_AND_FETCH_2: | |
6477 | case BUILT_IN_SYNC_OR_AND_FETCH_4: | |
6478 | case BUILT_IN_SYNC_OR_AND_FETCH_8: | |
6479 | case BUILT_IN_SYNC_OR_AND_FETCH_16: | |
6480 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_OR_AND_FETCH_1); | |
6481 | target = expand_builtin_sync_operation (mode, exp, IOR, true, target); | |
6482 | if (target) | |
6483 | return target; | |
6484 | break; | |
6485 | ||
6486 | case BUILT_IN_SYNC_AND_AND_FETCH_1: | |
6487 | case BUILT_IN_SYNC_AND_AND_FETCH_2: | |
6488 | case BUILT_IN_SYNC_AND_AND_FETCH_4: | |
6489 | case BUILT_IN_SYNC_AND_AND_FETCH_8: | |
6490 | case BUILT_IN_SYNC_AND_AND_FETCH_16: | |
6491 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_AND_AND_FETCH_1); | |
6492 | target = expand_builtin_sync_operation (mode, exp, AND, true, target); | |
6493 | if (target) | |
6494 | return target; | |
6495 | break; | |
6496 | ||
6497 | case BUILT_IN_SYNC_XOR_AND_FETCH_1: | |
6498 | case BUILT_IN_SYNC_XOR_AND_FETCH_2: | |
6499 | case BUILT_IN_SYNC_XOR_AND_FETCH_4: | |
6500 | case BUILT_IN_SYNC_XOR_AND_FETCH_8: | |
6501 | case BUILT_IN_SYNC_XOR_AND_FETCH_16: | |
6502 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_XOR_AND_FETCH_1); | |
6503 | target = expand_builtin_sync_operation (mode, exp, XOR, true, target); | |
6504 | if (target) | |
6505 | return target; | |
6506 | break; | |
6507 | ||
6508 | case BUILT_IN_SYNC_NAND_AND_FETCH_1: | |
6509 | case BUILT_IN_SYNC_NAND_AND_FETCH_2: | |
6510 | case BUILT_IN_SYNC_NAND_AND_FETCH_4: | |
6511 | case BUILT_IN_SYNC_NAND_AND_FETCH_8: | |
6512 | case BUILT_IN_SYNC_NAND_AND_FETCH_16: | |
6513 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_NAND_AND_FETCH_1); | |
6514 | target = expand_builtin_sync_operation (mode, exp, NOT, true, target); | |
6515 | if (target) | |
6516 | return target; | |
6517 | break; | |
6518 | ||
6519 | case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1: | |
6520 | case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_2: | |
6521 | case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_4: | |
6522 | case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_8: | |
6523 | case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_16: | |
6524 | if (mode == VOIDmode) | |
6525 | mode = TYPE_MODE (boolean_type_node); | |
6526 | if (!target || !register_operand (target, mode)) | |
6527 | target = gen_reg_rtx (mode); | |
6528 | ||
6529 | mode = get_builtin_sync_mode | |
6530 | (fcode - BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1); | |
6531 | target = expand_builtin_compare_and_swap (mode, exp, true, target); | |
6532 | if (target) | |
6533 | return target; | |
6534 | break; | |
6535 | ||
6536 | case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1: | |
6537 | case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_2: | |
6538 | case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_4: | |
6539 | case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_8: | |
6540 | case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_16: | |
6541 | mode = get_builtin_sync_mode | |
6542 | (fcode - BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1); | |
6543 | target = expand_builtin_compare_and_swap (mode, exp, false, target); | |
6544 | if (target) | |
6545 | return target; | |
6546 | break; | |
6547 | ||
6548 | case BUILT_IN_SYNC_LOCK_TEST_AND_SET_1: | |
6549 | case BUILT_IN_SYNC_LOCK_TEST_AND_SET_2: | |
6550 | case BUILT_IN_SYNC_LOCK_TEST_AND_SET_4: | |
6551 | case BUILT_IN_SYNC_LOCK_TEST_AND_SET_8: | |
6552 | case BUILT_IN_SYNC_LOCK_TEST_AND_SET_16: | |
6553 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_TEST_AND_SET_1); | |
6554 | target = expand_builtin_sync_lock_test_and_set (mode, exp, target); | |
6555 | if (target) | |
6556 | return target; | |
6557 | break; | |
6558 | ||
6559 | case BUILT_IN_SYNC_LOCK_RELEASE_1: | |
6560 | case BUILT_IN_SYNC_LOCK_RELEASE_2: | |
6561 | case BUILT_IN_SYNC_LOCK_RELEASE_4: | |
6562 | case BUILT_IN_SYNC_LOCK_RELEASE_8: | |
6563 | case BUILT_IN_SYNC_LOCK_RELEASE_16: | |
6564 | mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_RELEASE_1); | |
6565 | expand_builtin_sync_lock_release (mode, exp); | |
6566 | return const0_rtx; | |
6567 | ||
6568 | case BUILT_IN_SYNC_SYNCHRONIZE: | |
6569 | expand_builtin_sync_synchronize (); | |
6570 | return const0_rtx; | |
6571 | ||
6572 | case BUILT_IN_ATOMIC_EXCHANGE_1: | |
6573 | case BUILT_IN_ATOMIC_EXCHANGE_2: | |
6574 | case BUILT_IN_ATOMIC_EXCHANGE_4: | |
6575 | case BUILT_IN_ATOMIC_EXCHANGE_8: | |
6576 | case BUILT_IN_ATOMIC_EXCHANGE_16: | |
6577 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_EXCHANGE_1); | |
6578 | target = expand_builtin_atomic_exchange (mode, exp, target); | |
6579 | if (target) | |
6580 | return target; | |
6581 | break; | |
6582 | ||
6583 | case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1: | |
6584 | case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_2: | |
6585 | case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_4: | |
6586 | case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_8: | |
6587 | case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_16: | |
6588 | { | |
6589 | unsigned int nargs, z; | |
6590 | VEC(tree,gc) *vec; | |
6591 | ||
6592 | mode = | |
6593 | get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1); | |
6594 | target = expand_builtin_atomic_compare_exchange (mode, exp, target); | |
6595 | if (target) | |
6596 | return target; | |
6597 | ||
6598 | /* If this is turned into an external library call, the weak parameter | |
6599 | must be dropped to match the expected parameter list. */ | |
6600 | nargs = call_expr_nargs (exp); | |
6601 | vec = VEC_alloc (tree, gc, nargs - 1); | |
6602 | for (z = 0; z < 3; z++) | |
6603 | VEC_quick_push (tree, vec, CALL_EXPR_ARG (exp, z)); | |
6604 | /* Skip the boolean weak parameter. */ | |
6605 | for (z = 4; z < 6; z++) | |
6606 | VEC_quick_push (tree, vec, CALL_EXPR_ARG (exp, z)); | |
6607 | exp = build_call_vec (TREE_TYPE (exp), CALL_EXPR_FN (exp), vec); | |
6608 | break; | |
6609 | } | |
6610 | ||
6611 | case BUILT_IN_ATOMIC_LOAD_1: | |
6612 | case BUILT_IN_ATOMIC_LOAD_2: | |
6613 | case BUILT_IN_ATOMIC_LOAD_4: | |
6614 | case BUILT_IN_ATOMIC_LOAD_8: | |
6615 | case BUILT_IN_ATOMIC_LOAD_16: | |
6616 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_LOAD_1); | |
6617 | target = expand_builtin_atomic_load (mode, exp, target); | |
6618 | if (target) | |
6619 | return target; | |
6620 | break; | |
6621 | ||
6622 | case BUILT_IN_ATOMIC_STORE_1: | |
6623 | case BUILT_IN_ATOMIC_STORE_2: | |
6624 | case BUILT_IN_ATOMIC_STORE_4: | |
6625 | case BUILT_IN_ATOMIC_STORE_8: | |
6626 | case BUILT_IN_ATOMIC_STORE_16: | |
6627 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_STORE_1); | |
6628 | target = expand_builtin_atomic_store (mode, exp); | |
6629 | if (target) | |
6630 | return const0_rtx; | |
6631 | break; | |
6632 | ||
6633 | case BUILT_IN_ATOMIC_ADD_FETCH_1: | |
6634 | case BUILT_IN_ATOMIC_ADD_FETCH_2: | |
6635 | case BUILT_IN_ATOMIC_ADD_FETCH_4: | |
6636 | case BUILT_IN_ATOMIC_ADD_FETCH_8: | |
6637 | case BUILT_IN_ATOMIC_ADD_FETCH_16: | |
6638 | { | |
6639 | enum built_in_function lib; | |
6640 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_ADD_FETCH_1); | |
6641 | lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_ADD_1 + | |
6642 | (fcode - BUILT_IN_ATOMIC_ADD_FETCH_1)); | |
6643 | target = expand_builtin_atomic_fetch_op (mode, exp, target, PLUS, true, | |
6644 | ignore, lib); | |
6645 | if (target) | |
6646 | return target; | |
6647 | break; | |
6648 | } | |
6649 | case BUILT_IN_ATOMIC_SUB_FETCH_1: | |
6650 | case BUILT_IN_ATOMIC_SUB_FETCH_2: | |
6651 | case BUILT_IN_ATOMIC_SUB_FETCH_4: | |
6652 | case BUILT_IN_ATOMIC_SUB_FETCH_8: | |
6653 | case BUILT_IN_ATOMIC_SUB_FETCH_16: | |
6654 | { | |
6655 | enum built_in_function lib; | |
6656 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_SUB_FETCH_1); | |
6657 | lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_SUB_1 + | |
6658 | (fcode - BUILT_IN_ATOMIC_SUB_FETCH_1)); | |
6659 | target = expand_builtin_atomic_fetch_op (mode, exp, target, MINUS, true, | |
6660 | ignore, lib); | |
6661 | if (target) | |
6662 | return target; | |
6663 | break; | |
6664 | } | |
6665 | case BUILT_IN_ATOMIC_AND_FETCH_1: | |
6666 | case BUILT_IN_ATOMIC_AND_FETCH_2: | |
6667 | case BUILT_IN_ATOMIC_AND_FETCH_4: | |
6668 | case BUILT_IN_ATOMIC_AND_FETCH_8: | |
6669 | case BUILT_IN_ATOMIC_AND_FETCH_16: | |
6670 | { | |
6671 | enum built_in_function lib; | |
6672 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_AND_FETCH_1); | |
6673 | lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_AND_1 + | |
6674 | (fcode - BUILT_IN_ATOMIC_AND_FETCH_1)); | |
6675 | target = expand_builtin_atomic_fetch_op (mode, exp, target, AND, true, | |
6676 | ignore, lib); | |
6677 | if (target) | |
6678 | return target; | |
6679 | break; | |
6680 | } | |
6681 | case BUILT_IN_ATOMIC_NAND_FETCH_1: | |
6682 | case BUILT_IN_ATOMIC_NAND_FETCH_2: | |
6683 | case BUILT_IN_ATOMIC_NAND_FETCH_4: | |
6684 | case BUILT_IN_ATOMIC_NAND_FETCH_8: | |
6685 | case BUILT_IN_ATOMIC_NAND_FETCH_16: | |
6686 | { | |
6687 | enum built_in_function lib; | |
6688 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_NAND_FETCH_1); | |
6689 | lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_NAND_1 + | |
6690 | (fcode - BUILT_IN_ATOMIC_NAND_FETCH_1)); | |
6691 | target = expand_builtin_atomic_fetch_op (mode, exp, target, NOT, true, | |
6692 | ignore, lib); | |
6693 | if (target) | |
6694 | return target; | |
6695 | break; | |
6696 | } | |
6697 | case BUILT_IN_ATOMIC_XOR_FETCH_1: | |
6698 | case BUILT_IN_ATOMIC_XOR_FETCH_2: | |
6699 | case BUILT_IN_ATOMIC_XOR_FETCH_4: | |
6700 | case BUILT_IN_ATOMIC_XOR_FETCH_8: | |
6701 | case BUILT_IN_ATOMIC_XOR_FETCH_16: | |
6702 | { | |
6703 | enum built_in_function lib; | |
6704 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_XOR_FETCH_1); | |
6705 | lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_XOR_1 + | |
6706 | (fcode - BUILT_IN_ATOMIC_XOR_FETCH_1)); | |
6707 | target = expand_builtin_atomic_fetch_op (mode, exp, target, XOR, true, | |
6708 | ignore, lib); | |
6709 | if (target) | |
6710 | return target; | |
6711 | break; | |
6712 | } | |
6713 | case BUILT_IN_ATOMIC_OR_FETCH_1: | |
6714 | case BUILT_IN_ATOMIC_OR_FETCH_2: | |
6715 | case BUILT_IN_ATOMIC_OR_FETCH_4: | |
6716 | case BUILT_IN_ATOMIC_OR_FETCH_8: | |
6717 | case BUILT_IN_ATOMIC_OR_FETCH_16: | |
6718 | { | |
6719 | enum built_in_function lib; | |
6720 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_OR_FETCH_1); | |
6721 | lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_OR_1 + | |
6722 | (fcode - BUILT_IN_ATOMIC_OR_FETCH_1)); | |
6723 | target = expand_builtin_atomic_fetch_op (mode, exp, target, IOR, true, | |
6724 | ignore, lib); | |
6725 | if (target) | |
6726 | return target; | |
6727 | break; | |
6728 | } | |
6729 | case BUILT_IN_ATOMIC_FETCH_ADD_1: | |
6730 | case BUILT_IN_ATOMIC_FETCH_ADD_2: | |
6731 | case BUILT_IN_ATOMIC_FETCH_ADD_4: | |
6732 | case BUILT_IN_ATOMIC_FETCH_ADD_8: | |
6733 | case BUILT_IN_ATOMIC_FETCH_ADD_16: | |
6734 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_ADD_1); | |
6735 | target = expand_builtin_atomic_fetch_op (mode, exp, target, PLUS, false, | |
6736 | ignore, BUILT_IN_NONE); | |
6737 | if (target) | |
6738 | return target; | |
6739 | break; | |
6740 | ||
6741 | case BUILT_IN_ATOMIC_FETCH_SUB_1: | |
6742 | case BUILT_IN_ATOMIC_FETCH_SUB_2: | |
6743 | case BUILT_IN_ATOMIC_FETCH_SUB_4: | |
6744 | case BUILT_IN_ATOMIC_FETCH_SUB_8: | |
6745 | case BUILT_IN_ATOMIC_FETCH_SUB_16: | |
6746 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_SUB_1); | |
6747 | target = expand_builtin_atomic_fetch_op (mode, exp, target, MINUS, false, | |
6748 | ignore, BUILT_IN_NONE); | |
6749 | if (target) | |
6750 | return target; | |
6751 | break; | |
6752 | ||
6753 | case BUILT_IN_ATOMIC_FETCH_AND_1: | |
6754 | case BUILT_IN_ATOMIC_FETCH_AND_2: | |
6755 | case BUILT_IN_ATOMIC_FETCH_AND_4: | |
6756 | case BUILT_IN_ATOMIC_FETCH_AND_8: | |
6757 | case BUILT_IN_ATOMIC_FETCH_AND_16: | |
6758 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_AND_1); | |
6759 | target = expand_builtin_atomic_fetch_op (mode, exp, target, AND, false, | |
6760 | ignore, BUILT_IN_NONE); | |
6761 | if (target) | |
6762 | return target; | |
6763 | break; | |
6764 | ||
6765 | case BUILT_IN_ATOMIC_FETCH_NAND_1: | |
6766 | case BUILT_IN_ATOMIC_FETCH_NAND_2: | |
6767 | case BUILT_IN_ATOMIC_FETCH_NAND_4: | |
6768 | case BUILT_IN_ATOMIC_FETCH_NAND_8: | |
6769 | case BUILT_IN_ATOMIC_FETCH_NAND_16: | |
6770 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_NAND_1); | |
6771 | target = expand_builtin_atomic_fetch_op (mode, exp, target, NOT, false, | |
6772 | ignore, BUILT_IN_NONE); | |
6773 | if (target) | |
6774 | return target; | |
6775 | break; | |
6776 | ||
6777 | case BUILT_IN_ATOMIC_FETCH_XOR_1: | |
6778 | case BUILT_IN_ATOMIC_FETCH_XOR_2: | |
6779 | case BUILT_IN_ATOMIC_FETCH_XOR_4: | |
6780 | case BUILT_IN_ATOMIC_FETCH_XOR_8: | |
6781 | case BUILT_IN_ATOMIC_FETCH_XOR_16: | |
6782 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_XOR_1); | |
6783 | target = expand_builtin_atomic_fetch_op (mode, exp, target, XOR, false, | |
6784 | ignore, BUILT_IN_NONE); | |
6785 | if (target) | |
6786 | return target; | |
6787 | break; | |
6788 | ||
6789 | case BUILT_IN_ATOMIC_FETCH_OR_1: | |
6790 | case BUILT_IN_ATOMIC_FETCH_OR_2: | |
6791 | case BUILT_IN_ATOMIC_FETCH_OR_4: | |
6792 | case BUILT_IN_ATOMIC_FETCH_OR_8: | |
6793 | case BUILT_IN_ATOMIC_FETCH_OR_16: | |
6794 | mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_OR_1); | |
6795 | target = expand_builtin_atomic_fetch_op (mode, exp, target, IOR, false, | |
6796 | ignore, BUILT_IN_NONE); | |
6797 | if (target) | |
6798 | return target; | |
6799 | break; | |
6800 | ||
6801 | case BUILT_IN_ATOMIC_TEST_AND_SET: | |
6802 | return expand_builtin_atomic_test_and_set (exp, target); | |
6803 | ||
6804 | case BUILT_IN_ATOMIC_CLEAR: | |
6805 | return expand_builtin_atomic_clear (exp); | |
6806 | ||
6807 | case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE: | |
6808 | return expand_builtin_atomic_always_lock_free (exp); | |
6809 | ||
6810 | case BUILT_IN_ATOMIC_IS_LOCK_FREE: | |
6811 | target = expand_builtin_atomic_is_lock_free (exp); | |
6812 | if (target) | |
6813 | return target; | |
6814 | break; | |
6815 | ||
6816 | case BUILT_IN_ATOMIC_THREAD_FENCE: | |
6817 | expand_builtin_atomic_thread_fence (exp); | |
6818 | return const0_rtx; | |
6819 | ||
6820 | case BUILT_IN_ATOMIC_SIGNAL_FENCE: | |
6821 | expand_builtin_atomic_signal_fence (exp); | |
6822 | return const0_rtx; | |
6823 | ||
6824 | case BUILT_IN_OBJECT_SIZE: | |
6825 | return expand_builtin_object_size (exp); | |
6826 | ||
6827 | case BUILT_IN_MEMCPY_CHK: | |
6828 | case BUILT_IN_MEMPCPY_CHK: | |
6829 | case BUILT_IN_MEMMOVE_CHK: | |
6830 | case BUILT_IN_MEMSET_CHK: | |
6831 | target = expand_builtin_memory_chk (exp, target, mode, fcode); | |
6832 | if (target) | |
6833 | return target; | |
6834 | break; | |
6835 | ||
6836 | case BUILT_IN_STRCPY_CHK: | |
6837 | case BUILT_IN_STPCPY_CHK: | |
6838 | case BUILT_IN_STRNCPY_CHK: | |
6839 | case BUILT_IN_STPNCPY_CHK: | |
6840 | case BUILT_IN_STRCAT_CHK: | |
6841 | case BUILT_IN_STRNCAT_CHK: | |
6842 | case BUILT_IN_SNPRINTF_CHK: | |
6843 | case BUILT_IN_VSNPRINTF_CHK: | |
6844 | maybe_emit_chk_warning (exp, fcode); | |
6845 | break; | |
6846 | ||
6847 | case BUILT_IN_SPRINTF_CHK: | |
6848 | case BUILT_IN_VSPRINTF_CHK: | |
6849 | maybe_emit_sprintf_chk_warning (exp, fcode); | |
6850 | break; | |
6851 | ||
6852 | case BUILT_IN_FREE: | |
6853 | if (warn_free_nonheap_object) | |
6854 | maybe_emit_free_warning (exp); | |
6855 | break; | |
6856 | ||
6857 | default: /* just do library call, if unknown builtin */ | |
6858 | break; | |
6859 | } | |
6860 | ||
6861 | /* The switch statement above can drop through to cause the function | |
6862 | to be called normally. */ | |
6863 | return expand_call (exp, target, ignore); | |
6864 | } | |
6865 | ||
6866 | /* Determine whether a tree node represents a call to a built-in | |
6867 | function. If the tree T is a call to a built-in function with | |
6868 | the right number of arguments of the appropriate types, return | |
6869 | the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT. | |
6870 | Otherwise the return value is END_BUILTINS. */ | |
6871 | ||
6872 | enum built_in_function | |
6873 | builtin_mathfn_code (const_tree t) | |
6874 | { | |
6875 | const_tree fndecl, arg, parmlist; | |
6876 | const_tree argtype, parmtype; | |
6877 | const_call_expr_arg_iterator iter; | |
6878 | ||
6879 | if (TREE_CODE (t) != CALL_EXPR | |
6880 | || TREE_CODE (CALL_EXPR_FN (t)) != ADDR_EXPR) | |
6881 | return END_BUILTINS; | |
6882 | ||
6883 | fndecl = get_callee_fndecl (t); | |
6884 | if (fndecl == NULL_TREE | |
6885 | || TREE_CODE (fndecl) != FUNCTION_DECL | |
6886 | || ! DECL_BUILT_IN (fndecl) | |
6887 | || DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD) | |
6888 | return END_BUILTINS; | |
6889 | ||
6890 | parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl)); | |
6891 | init_const_call_expr_arg_iterator (t, &iter); | |
6892 | for (; parmlist; parmlist = TREE_CHAIN (parmlist)) | |
6893 | { | |
6894 | /* If a function doesn't take a variable number of arguments, | |
6895 | the last element in the list will have type `void'. */ | |
6896 | parmtype = TREE_VALUE (parmlist); | |
6897 | if (VOID_TYPE_P (parmtype)) | |
6898 | { | |
6899 | if (more_const_call_expr_args_p (&iter)) | |
6900 | return END_BUILTINS; | |
6901 | return DECL_FUNCTION_CODE (fndecl); | |
6902 | } | |
6903 | ||
6904 | if (! more_const_call_expr_args_p (&iter)) | |
6905 | return END_BUILTINS; | |
6906 | ||
6907 | arg = next_const_call_expr_arg (&iter); | |
6908 | argtype = TREE_TYPE (arg); | |
6909 | ||
6910 | if (SCALAR_FLOAT_TYPE_P (parmtype)) | |
6911 | { | |
6912 | if (! SCALAR_FLOAT_TYPE_P (argtype)) | |
6913 | return END_BUILTINS; | |
6914 | } | |
6915 | else if (COMPLEX_FLOAT_TYPE_P (parmtype)) | |
6916 | { | |
6917 | if (! COMPLEX_FLOAT_TYPE_P (argtype)) | |
6918 | return END_BUILTINS; | |
6919 | } | |
6920 | else if (POINTER_TYPE_P (parmtype)) | |
6921 | { | |
6922 | if (! POINTER_TYPE_P (argtype)) | |
6923 | return END_BUILTINS; | |
6924 | } | |
6925 | else if (INTEGRAL_TYPE_P (parmtype)) | |
6926 | { | |
6927 | if (! INTEGRAL_TYPE_P (argtype)) | |
6928 | return END_BUILTINS; | |
6929 | } | |
6930 | else | |
6931 | return END_BUILTINS; | |
6932 | } | |
6933 | ||
6934 | /* Variable-length argument list. */ | |
6935 | return DECL_FUNCTION_CODE (fndecl); | |
6936 | } | |
6937 | ||
6938 | /* Fold a call to __builtin_constant_p, if we know its argument ARG will | |
6939 | evaluate to a constant. */ | |
6940 | ||
6941 | static tree | |
6942 | fold_builtin_constant_p (tree arg) | |
6943 | { | |
6944 | /* We return 1 for a numeric type that's known to be a constant | |
6945 | value at compile-time or for an aggregate type that's a | |
6946 | literal constant. */ | |
6947 | STRIP_NOPS (arg); | |
6948 | ||
6949 | /* If we know this is a constant, emit the constant of one. */ | |
6950 | if (CONSTANT_CLASS_P (arg) | |
6951 | || (TREE_CODE (arg) == CONSTRUCTOR | |
6952 | && TREE_CONSTANT (arg))) | |
6953 | return integer_one_node; | |
6954 | if (TREE_CODE (arg) == ADDR_EXPR) | |
6955 | { | |
6956 | tree op = TREE_OPERAND (arg, 0); | |
6957 | if (TREE_CODE (op) == STRING_CST | |
6958 | || (TREE_CODE (op) == ARRAY_REF | |
6959 | && integer_zerop (TREE_OPERAND (op, 1)) | |
6960 | && TREE_CODE (TREE_OPERAND (op, 0)) == STRING_CST)) | |
6961 | return integer_one_node; | |
6962 | } | |
6963 | ||
6964 | /* If this expression has side effects, show we don't know it to be a | |
6965 | constant. Likewise if it's a pointer or aggregate type since in | |
6966 | those case we only want literals, since those are only optimized | |
6967 | when generating RTL, not later. | |
6968 | And finally, if we are compiling an initializer, not code, we | |
6969 | need to return a definite result now; there's not going to be any | |
6970 | more optimization done. */ | |
6971 | if (TREE_SIDE_EFFECTS (arg) | |
6972 | || AGGREGATE_TYPE_P (TREE_TYPE (arg)) | |
6973 | || POINTER_TYPE_P (TREE_TYPE (arg)) | |
6974 | || cfun == 0 | |
6975 | || folding_initializer) | |
6976 | return integer_zero_node; | |
6977 | ||
6978 | return NULL_TREE; | |
6979 | } | |
6980 | ||
6981 | /* Create builtin_expect with PRED and EXPECTED as its arguments and | |
6982 | return it as a truthvalue. */ | |
6983 | ||
6984 | static tree | |
6985 | build_builtin_expect_predicate (location_t loc, tree pred, tree expected) | |
6986 | { | |
6987 | tree fn, arg_types, pred_type, expected_type, call_expr, ret_type; | |
6988 | ||
6989 | fn = builtin_decl_explicit (BUILT_IN_EXPECT); | |
6990 | arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
6991 | ret_type = TREE_TYPE (TREE_TYPE (fn)); | |
6992 | pred_type = TREE_VALUE (arg_types); | |
6993 | expected_type = TREE_VALUE (TREE_CHAIN (arg_types)); | |
6994 | ||
6995 | pred = fold_convert_loc (loc, pred_type, pred); | |
6996 | expected = fold_convert_loc (loc, expected_type, expected); | |
6997 | call_expr = build_call_expr_loc (loc, fn, 2, pred, expected); | |
6998 | ||
6999 | return build2 (NE_EXPR, TREE_TYPE (pred), call_expr, | |
7000 | build_int_cst (ret_type, 0)); | |
7001 | } | |
7002 | ||
7003 | /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return | |
7004 | NULL_TREE if no simplification is possible. */ | |
7005 | ||
7006 | static tree | |
7007 | fold_builtin_expect (location_t loc, tree arg0, tree arg1) | |
7008 | { | |
7009 | tree inner, fndecl, inner_arg0; | |
7010 | enum tree_code code; | |
7011 | ||
7012 | /* Distribute the expected value over short-circuiting operators. | |
7013 | See through the cast from truthvalue_type_node to long. */ | |
7014 | inner_arg0 = arg0; | |
7015 | while (TREE_CODE (inner_arg0) == NOP_EXPR | |
7016 | && INTEGRAL_TYPE_P (TREE_TYPE (inner_arg0)) | |
7017 | && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (inner_arg0, 0)))) | |
7018 | inner_arg0 = TREE_OPERAND (inner_arg0, 0); | |
7019 | ||
7020 | /* If this is a builtin_expect within a builtin_expect keep the | |
7021 | inner one. See through a comparison against a constant. It | |
7022 | might have been added to create a thruthvalue. */ | |
7023 | inner = inner_arg0; | |
7024 | ||
7025 | if (COMPARISON_CLASS_P (inner) | |
7026 | && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST) | |
7027 | inner = TREE_OPERAND (inner, 0); | |
7028 | ||
7029 | if (TREE_CODE (inner) == CALL_EXPR | |
7030 | && (fndecl = get_callee_fndecl (inner)) | |
7031 | && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL | |
7032 | && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_EXPECT) | |
7033 | return arg0; | |
7034 | ||
7035 | inner = inner_arg0; | |
7036 | code = TREE_CODE (inner); | |
7037 | if (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR) | |
7038 | { | |
7039 | tree op0 = TREE_OPERAND (inner, 0); | |
7040 | tree op1 = TREE_OPERAND (inner, 1); | |
7041 | ||
7042 | op0 = build_builtin_expect_predicate (loc, op0, arg1); | |
7043 | op1 = build_builtin_expect_predicate (loc, op1, arg1); | |
7044 | inner = build2 (code, TREE_TYPE (inner), op0, op1); | |
7045 | ||
7046 | return fold_convert_loc (loc, TREE_TYPE (arg0), inner); | |
7047 | } | |
7048 | ||
7049 | /* If the argument isn't invariant then there's nothing else we can do. */ | |
7050 | if (!TREE_CONSTANT (inner_arg0)) | |
7051 | return NULL_TREE; | |
7052 | ||
7053 | /* If we expect that a comparison against the argument will fold to | |
7054 | a constant return the constant. In practice, this means a true | |
7055 | constant or the address of a non-weak symbol. */ | |
7056 | inner = inner_arg0; | |
7057 | STRIP_NOPS (inner); | |
7058 | if (TREE_CODE (inner) == ADDR_EXPR) | |
7059 | { | |
7060 | do | |
7061 | { | |
7062 | inner = TREE_OPERAND (inner, 0); | |
7063 | } | |
7064 | while (TREE_CODE (inner) == COMPONENT_REF | |
7065 | || TREE_CODE (inner) == ARRAY_REF); | |
7066 | if ((TREE_CODE (inner) == VAR_DECL | |
7067 | || TREE_CODE (inner) == FUNCTION_DECL) | |
7068 | && DECL_WEAK (inner)) | |
7069 | return NULL_TREE; | |
7070 | } | |
7071 | ||
7072 | /* Otherwise, ARG0 already has the proper type for the return value. */ | |
7073 | return arg0; | |
7074 | } | |
7075 | ||
7076 | /* Fold a call to __builtin_classify_type with argument ARG. */ | |
7077 | ||
7078 | static tree | |
7079 | fold_builtin_classify_type (tree arg) | |
7080 | { | |
7081 | if (arg == 0) | |
7082 | return build_int_cst (integer_type_node, no_type_class); | |
7083 | ||
7084 | return build_int_cst (integer_type_node, type_to_class (TREE_TYPE (arg))); | |
7085 | } | |
7086 | ||
7087 | /* Fold a call to __builtin_strlen with argument ARG. */ | |
7088 | ||
7089 | static tree | |
7090 | fold_builtin_strlen (location_t loc, tree type, tree arg) | |
7091 | { | |
7092 | if (!validate_arg (arg, POINTER_TYPE)) | |
7093 | return NULL_TREE; | |
7094 | else | |
7095 | { | |
7096 | tree len = c_strlen (arg, 0); | |
7097 | ||
7098 | if (len) | |
7099 | return fold_convert_loc (loc, type, len); | |
7100 | ||
7101 | return NULL_TREE; | |
7102 | } | |
7103 | } | |
7104 | ||
7105 | /* Fold a call to __builtin_inf or __builtin_huge_val. */ | |
7106 | ||
7107 | static tree | |
7108 | fold_builtin_inf (location_t loc, tree type, int warn) | |
7109 | { | |
7110 | REAL_VALUE_TYPE real; | |
7111 | ||
7112 | /* __builtin_inff is intended to be usable to define INFINITY on all | |
7113 | targets. If an infinity is not available, INFINITY expands "to a | |
7114 | positive constant of type float that overflows at translation | |
7115 | time", footnote "In this case, using INFINITY will violate the | |
7116 | constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4). | |
7117 | Thus we pedwarn to ensure this constraint violation is | |
7118 | diagnosed. */ | |
7119 | if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn) | |
7120 | pedwarn (loc, 0, "target format does not support infinity"); | |
7121 | ||
7122 | real_inf (&real); | |
7123 | return build_real (type, real); | |
7124 | } | |
7125 | ||
7126 | /* Fold a call to __builtin_nan or __builtin_nans with argument ARG. */ | |
7127 | ||
7128 | static tree | |
7129 | fold_builtin_nan (tree arg, tree type, int quiet) | |
7130 | { | |
7131 | REAL_VALUE_TYPE real; | |
7132 | const char *str; | |
7133 | ||
7134 | if (!validate_arg (arg, POINTER_TYPE)) | |
7135 | return NULL_TREE; | |
7136 | str = c_getstr (arg); | |
7137 | if (!str) | |
7138 | return NULL_TREE; | |
7139 | ||
7140 | if (!real_nan (&real, str, quiet, TYPE_MODE (type))) | |
7141 | return NULL_TREE; | |
7142 | ||
7143 | return build_real (type, real); | |
7144 | } | |
7145 | ||
7146 | /* Return true if the floating point expression T has an integer value. | |
7147 | We also allow +Inf, -Inf and NaN to be considered integer values. */ | |
7148 | ||
7149 | static bool | |
7150 | integer_valued_real_p (tree t) | |
7151 | { | |
7152 | switch (TREE_CODE (t)) | |
7153 | { | |
7154 | case FLOAT_EXPR: | |
7155 | return true; | |
7156 | ||
7157 | case ABS_EXPR: | |
7158 | case SAVE_EXPR: | |
7159 | return integer_valued_real_p (TREE_OPERAND (t, 0)); | |
7160 | ||
7161 | case COMPOUND_EXPR: | |
7162 | case MODIFY_EXPR: | |
7163 | case BIND_EXPR: | |
7164 | return integer_valued_real_p (TREE_OPERAND (t, 1)); | |
7165 | ||
7166 | case PLUS_EXPR: | |
7167 | case MINUS_EXPR: | |
7168 | case MULT_EXPR: | |
7169 | case MIN_EXPR: | |
7170 | case MAX_EXPR: | |
7171 | return integer_valued_real_p (TREE_OPERAND (t, 0)) | |
7172 | && integer_valued_real_p (TREE_OPERAND (t, 1)); | |
7173 | ||
7174 | case COND_EXPR: | |
7175 | return integer_valued_real_p (TREE_OPERAND (t, 1)) | |
7176 | && integer_valued_real_p (TREE_OPERAND (t, 2)); | |
7177 | ||
7178 | case REAL_CST: | |
7179 | return real_isinteger (TREE_REAL_CST_PTR (t), TYPE_MODE (TREE_TYPE (t))); | |
7180 | ||
7181 | case NOP_EXPR: | |
7182 | { | |
7183 | tree type = TREE_TYPE (TREE_OPERAND (t, 0)); | |
7184 | if (TREE_CODE (type) == INTEGER_TYPE) | |
7185 | return true; | |
7186 | if (TREE_CODE (type) == REAL_TYPE) | |
7187 | return integer_valued_real_p (TREE_OPERAND (t, 0)); | |
7188 | break; | |
7189 | } | |
7190 | ||
7191 | case CALL_EXPR: | |
7192 | switch (builtin_mathfn_code (t)) | |
7193 | { | |
7194 | CASE_FLT_FN (BUILT_IN_CEIL): | |
7195 | CASE_FLT_FN (BUILT_IN_FLOOR): | |
7196 | CASE_FLT_FN (BUILT_IN_NEARBYINT): | |
7197 | CASE_FLT_FN (BUILT_IN_RINT): | |
7198 | CASE_FLT_FN (BUILT_IN_ROUND): | |
7199 | CASE_FLT_FN (BUILT_IN_TRUNC): | |
7200 | return true; | |
7201 | ||
7202 | CASE_FLT_FN (BUILT_IN_FMIN): | |
7203 | CASE_FLT_FN (BUILT_IN_FMAX): | |
7204 | return integer_valued_real_p (CALL_EXPR_ARG (t, 0)) | |
7205 | && integer_valued_real_p (CALL_EXPR_ARG (t, 1)); | |
7206 | ||
7207 | default: | |
7208 | break; | |
7209 | } | |
7210 | break; | |
7211 | ||
7212 | default: | |
7213 | break; | |
7214 | } | |
7215 | return false; | |
7216 | } | |
7217 | ||
7218 | /* FNDECL is assumed to be a builtin where truncation can be propagated | |
7219 | across (for instance floor((double)f) == (double)floorf (f). | |
7220 | Do the transformation for a call with argument ARG. */ | |
7221 | ||
7222 | static tree | |
7223 | fold_trunc_transparent_mathfn (location_t loc, tree fndecl, tree arg) | |
7224 | { | |
7225 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
7226 | ||
7227 | if (!validate_arg (arg, REAL_TYPE)) | |
7228 | return NULL_TREE; | |
7229 | ||
7230 | /* Integer rounding functions are idempotent. */ | |
7231 | if (fcode == builtin_mathfn_code (arg)) | |
7232 | return arg; | |
7233 | ||
7234 | /* If argument is already integer valued, and we don't need to worry | |
7235 | about setting errno, there's no need to perform rounding. */ | |
7236 | if (! flag_errno_math && integer_valued_real_p (arg)) | |
7237 | return arg; | |
7238 | ||
7239 | if (optimize) | |
7240 | { | |
7241 | tree arg0 = strip_float_extensions (arg); | |
7242 | tree ftype = TREE_TYPE (TREE_TYPE (fndecl)); | |
7243 | tree newtype = TREE_TYPE (arg0); | |
7244 | tree decl; | |
7245 | ||
7246 | if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype) | |
7247 | && (decl = mathfn_built_in (newtype, fcode))) | |
7248 | return fold_convert_loc (loc, ftype, | |
7249 | build_call_expr_loc (loc, decl, 1, | |
7250 | fold_convert_loc (loc, | |
7251 | newtype, | |
7252 | arg0))); | |
7253 | } | |
7254 | return NULL_TREE; | |
7255 | } | |
7256 | ||
7257 | /* FNDECL is assumed to be builtin which can narrow the FP type of | |
7258 | the argument, for instance lround((double)f) -> lroundf (f). | |
7259 | Do the transformation for a call with argument ARG. */ | |
7260 | ||
7261 | static tree | |
7262 | fold_fixed_mathfn (location_t loc, tree fndecl, tree arg) | |
7263 | { | |
7264 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
7265 | ||
7266 | if (!validate_arg (arg, REAL_TYPE)) | |
7267 | return NULL_TREE; | |
7268 | ||
7269 | /* If argument is already integer valued, and we don't need to worry | |
7270 | about setting errno, there's no need to perform rounding. */ | |
7271 | if (! flag_errno_math && integer_valued_real_p (arg)) | |
7272 | return fold_build1_loc (loc, FIX_TRUNC_EXPR, | |
7273 | TREE_TYPE (TREE_TYPE (fndecl)), arg); | |
7274 | ||
7275 | if (optimize) | |
7276 | { | |
7277 | tree ftype = TREE_TYPE (arg); | |
7278 | tree arg0 = strip_float_extensions (arg); | |
7279 | tree newtype = TREE_TYPE (arg0); | |
7280 | tree decl; | |
7281 | ||
7282 | if (TYPE_PRECISION (newtype) < TYPE_PRECISION (ftype) | |
7283 | && (decl = mathfn_built_in (newtype, fcode))) | |
7284 | return build_call_expr_loc (loc, decl, 1, | |
7285 | fold_convert_loc (loc, newtype, arg0)); | |
7286 | } | |
7287 | ||
7288 | /* Canonicalize iround (x) to lround (x) on ILP32 targets where | |
7289 | sizeof (int) == sizeof (long). */ | |
7290 | if (TYPE_PRECISION (integer_type_node) | |
7291 | == TYPE_PRECISION (long_integer_type_node)) | |
7292 | { | |
7293 | tree newfn = NULL_TREE; | |
7294 | switch (fcode) | |
7295 | { | |
7296 | CASE_FLT_FN (BUILT_IN_ICEIL): | |
7297 | newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LCEIL); | |
7298 | break; | |
7299 | ||
7300 | CASE_FLT_FN (BUILT_IN_IFLOOR): | |
7301 | newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LFLOOR); | |
7302 | break; | |
7303 | ||
7304 | CASE_FLT_FN (BUILT_IN_IROUND): | |
7305 | newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LROUND); | |
7306 | break; | |
7307 | ||
7308 | CASE_FLT_FN (BUILT_IN_IRINT): | |
7309 | newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LRINT); | |
7310 | break; | |
7311 | ||
7312 | default: | |
7313 | break; | |
7314 | } | |
7315 | ||
7316 | if (newfn) | |
7317 | { | |
7318 | tree newcall = build_call_expr_loc (loc, newfn, 1, arg); | |
7319 | return fold_convert_loc (loc, | |
7320 | TREE_TYPE (TREE_TYPE (fndecl)), newcall); | |
7321 | } | |
7322 | } | |
7323 | ||
7324 | /* Canonicalize llround (x) to lround (x) on LP64 targets where | |
7325 | sizeof (long long) == sizeof (long). */ | |
7326 | if (TYPE_PRECISION (long_long_integer_type_node) | |
7327 | == TYPE_PRECISION (long_integer_type_node)) | |
7328 | { | |
7329 | tree newfn = NULL_TREE; | |
7330 | switch (fcode) | |
7331 | { | |
7332 | CASE_FLT_FN (BUILT_IN_LLCEIL): | |
7333 | newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LCEIL); | |
7334 | break; | |
7335 | ||
7336 | CASE_FLT_FN (BUILT_IN_LLFLOOR): | |
7337 | newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LFLOOR); | |
7338 | break; | |
7339 | ||
7340 | CASE_FLT_FN (BUILT_IN_LLROUND): | |
7341 | newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LROUND); | |
7342 | break; | |
7343 | ||
7344 | CASE_FLT_FN (BUILT_IN_LLRINT): | |
7345 | newfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_LRINT); | |
7346 | break; | |
7347 | ||
7348 | default: | |
7349 | break; | |
7350 | } | |
7351 | ||
7352 | if (newfn) | |
7353 | { | |
7354 | tree newcall = build_call_expr_loc (loc, newfn, 1, arg); | |
7355 | return fold_convert_loc (loc, | |
7356 | TREE_TYPE (TREE_TYPE (fndecl)), newcall); | |
7357 | } | |
7358 | } | |
7359 | ||
7360 | return NULL_TREE; | |
7361 | } | |
7362 | ||
7363 | /* Fold call to builtin cabs, cabsf or cabsl with argument ARG. TYPE is the | |
7364 | return type. Return NULL_TREE if no simplification can be made. */ | |
7365 | ||
7366 | static tree | |
7367 | fold_builtin_cabs (location_t loc, tree arg, tree type, tree fndecl) | |
7368 | { | |
7369 | tree res; | |
7370 | ||
7371 | if (!validate_arg (arg, COMPLEX_TYPE) | |
7372 | || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE) | |
7373 | return NULL_TREE; | |
7374 | ||
7375 | /* Calculate the result when the argument is a constant. */ | |
7376 | if (TREE_CODE (arg) == COMPLEX_CST | |
7377 | && (res = do_mpfr_arg2 (TREE_REALPART (arg), TREE_IMAGPART (arg), | |
7378 | type, mpfr_hypot))) | |
7379 | return res; | |
7380 | ||
7381 | if (TREE_CODE (arg) == COMPLEX_EXPR) | |
7382 | { | |
7383 | tree real = TREE_OPERAND (arg, 0); | |
7384 | tree imag = TREE_OPERAND (arg, 1); | |
7385 | ||
7386 | /* If either part is zero, cabs is fabs of the other. */ | |
7387 | if (real_zerop (real)) | |
7388 | return fold_build1_loc (loc, ABS_EXPR, type, imag); | |
7389 | if (real_zerop (imag)) | |
7390 | return fold_build1_loc (loc, ABS_EXPR, type, real); | |
7391 | ||
7392 | /* cabs(x+xi) -> fabs(x)*sqrt(2). */ | |
7393 | if (flag_unsafe_math_optimizations | |
7394 | && operand_equal_p (real, imag, OEP_PURE_SAME)) | |
7395 | { | |
7396 | const REAL_VALUE_TYPE sqrt2_trunc | |
7397 | = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ()); | |
7398 | STRIP_NOPS (real); | |
7399 | return fold_build2_loc (loc, MULT_EXPR, type, | |
7400 | fold_build1_loc (loc, ABS_EXPR, type, real), | |
7401 | build_real (type, sqrt2_trunc)); | |
7402 | } | |
7403 | } | |
7404 | ||
7405 | /* Optimize cabs(-z) and cabs(conj(z)) as cabs(z). */ | |
7406 | if (TREE_CODE (arg) == NEGATE_EXPR | |
7407 | || TREE_CODE (arg) == CONJ_EXPR) | |
7408 | return build_call_expr_loc (loc, fndecl, 1, TREE_OPERAND (arg, 0)); | |
7409 | ||
7410 | /* Don't do this when optimizing for size. */ | |
7411 | if (flag_unsafe_math_optimizations | |
7412 | && optimize && optimize_function_for_speed_p (cfun)) | |
7413 | { | |
7414 | tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT); | |
7415 | ||
7416 | if (sqrtfn != NULL_TREE) | |
7417 | { | |
7418 | tree rpart, ipart, result; | |
7419 | ||
7420 | arg = builtin_save_expr (arg); | |
7421 | ||
7422 | rpart = fold_build1_loc (loc, REALPART_EXPR, type, arg); | |
7423 | ipart = fold_build1_loc (loc, IMAGPART_EXPR, type, arg); | |
7424 | ||
7425 | rpart = builtin_save_expr (rpart); | |
7426 | ipart = builtin_save_expr (ipart); | |
7427 | ||
7428 | result = fold_build2_loc (loc, PLUS_EXPR, type, | |
7429 | fold_build2_loc (loc, MULT_EXPR, type, | |
7430 | rpart, rpart), | |
7431 | fold_build2_loc (loc, MULT_EXPR, type, | |
7432 | ipart, ipart)); | |
7433 | ||
7434 | return build_call_expr_loc (loc, sqrtfn, 1, result); | |
7435 | } | |
7436 | } | |
7437 | ||
7438 | return NULL_TREE; | |
7439 | } | |
7440 | ||
7441 | /* Build a complex (inf +- 0i) for the result of cproj. TYPE is the | |
7442 | complex tree type of the result. If NEG is true, the imaginary | |
7443 | zero is negative. */ | |
7444 | ||
7445 | static tree | |
7446 | build_complex_cproj (tree type, bool neg) | |
7447 | { | |
7448 | REAL_VALUE_TYPE rinf, rzero = dconst0; | |
7449 | ||
7450 | real_inf (&rinf); | |
7451 | rzero.sign = neg; | |
7452 | return build_complex (type, build_real (TREE_TYPE (type), rinf), | |
7453 | build_real (TREE_TYPE (type), rzero)); | |
7454 | } | |
7455 | ||
7456 | /* Fold call to builtin cproj, cprojf or cprojl with argument ARG. TYPE is the | |
7457 | return type. Return NULL_TREE if no simplification can be made. */ | |
7458 | ||
7459 | static tree | |
7460 | fold_builtin_cproj (location_t loc, tree arg, tree type) | |
7461 | { | |
7462 | if (!validate_arg (arg, COMPLEX_TYPE) | |
7463 | || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != REAL_TYPE) | |
7464 | return NULL_TREE; | |
7465 | ||
7466 | /* If there are no infinities, return arg. */ | |
7467 | if (! HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (type)))) | |
7468 | return non_lvalue_loc (loc, arg); | |
7469 | ||
7470 | /* Calculate the result when the argument is a constant. */ | |
7471 | if (TREE_CODE (arg) == COMPLEX_CST) | |
7472 | { | |
7473 | const REAL_VALUE_TYPE *real = TREE_REAL_CST_PTR (TREE_REALPART (arg)); | |
7474 | const REAL_VALUE_TYPE *imag = TREE_REAL_CST_PTR (TREE_IMAGPART (arg)); | |
7475 | ||
7476 | if (real_isinf (real) || real_isinf (imag)) | |
7477 | return build_complex_cproj (type, imag->sign); | |
7478 | else | |
7479 | return arg; | |
7480 | } | |
7481 | else if (TREE_CODE (arg) == COMPLEX_EXPR) | |
7482 | { | |
7483 | tree real = TREE_OPERAND (arg, 0); | |
7484 | tree imag = TREE_OPERAND (arg, 1); | |
7485 | ||
7486 | STRIP_NOPS (real); | |
7487 | STRIP_NOPS (imag); | |
7488 | ||
7489 | /* If the real part is inf and the imag part is known to be | |
7490 | nonnegative, return (inf + 0i). Remember side-effects are | |
7491 | possible in the imag part. */ | |
7492 | if (TREE_CODE (real) == REAL_CST | |
7493 | && real_isinf (TREE_REAL_CST_PTR (real)) | |
7494 | && tree_expr_nonnegative_p (imag)) | |
7495 | return omit_one_operand_loc (loc, type, | |
7496 | build_complex_cproj (type, false), | |
7497 | arg); | |
7498 | ||
7499 | /* If the imag part is inf, return (inf+I*copysign(0,imag)). | |
7500 | Remember side-effects are possible in the real part. */ | |
7501 | if (TREE_CODE (imag) == REAL_CST | |
7502 | && real_isinf (TREE_REAL_CST_PTR (imag))) | |
7503 | return | |
7504 | omit_one_operand_loc (loc, type, | |
7505 | build_complex_cproj (type, TREE_REAL_CST_PTR | |
7506 | (imag)->sign), arg); | |
7507 | } | |
7508 | ||
7509 | return NULL_TREE; | |
7510 | } | |
7511 | ||
7512 | /* Fold a builtin function call to sqrt, sqrtf, or sqrtl with argument ARG. | |
7513 | Return NULL_TREE if no simplification can be made. */ | |
7514 | ||
7515 | static tree | |
7516 | fold_builtin_sqrt (location_t loc, tree arg, tree type) | |
7517 | { | |
7518 | ||
7519 | enum built_in_function fcode; | |
7520 | tree res; | |
7521 | ||
7522 | if (!validate_arg (arg, REAL_TYPE)) | |
7523 | return NULL_TREE; | |
7524 | ||
7525 | /* Calculate the result when the argument is a constant. */ | |
7526 | if ((res = do_mpfr_arg1 (arg, type, mpfr_sqrt, &dconst0, NULL, true))) | |
7527 | return res; | |
7528 | ||
7529 | /* Optimize sqrt(expN(x)) = expN(x*0.5). */ | |
7530 | fcode = builtin_mathfn_code (arg); | |
7531 | if (flag_unsafe_math_optimizations && BUILTIN_EXPONENT_P (fcode)) | |
7532 | { | |
7533 | tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0); | |
7534 | arg = fold_build2_loc (loc, MULT_EXPR, type, | |
7535 | CALL_EXPR_ARG (arg, 0), | |
7536 | build_real (type, dconsthalf)); | |
7537 | return build_call_expr_loc (loc, expfn, 1, arg); | |
7538 | } | |
7539 | ||
7540 | /* Optimize sqrt(Nroot(x)) -> pow(x,1/(2*N)). */ | |
7541 | if (flag_unsafe_math_optimizations && BUILTIN_ROOT_P (fcode)) | |
7542 | { | |
7543 | tree powfn = mathfn_built_in (type, BUILT_IN_POW); | |
7544 | ||
7545 | if (powfn) | |
7546 | { | |
7547 | tree arg0 = CALL_EXPR_ARG (arg, 0); | |
7548 | tree tree_root; | |
7549 | /* The inner root was either sqrt or cbrt. */ | |
7550 | /* This was a conditional expression but it triggered a bug | |
7551 | in Sun C 5.5. */ | |
7552 | REAL_VALUE_TYPE dconstroot; | |
7553 | if (BUILTIN_SQRT_P (fcode)) | |
7554 | dconstroot = dconsthalf; | |
7555 | else | |
7556 | dconstroot = dconst_third (); | |
7557 | ||
7558 | /* Adjust for the outer root. */ | |
7559 | SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1); | |
7560 | dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot); | |
7561 | tree_root = build_real (type, dconstroot); | |
7562 | return build_call_expr_loc (loc, powfn, 2, arg0, tree_root); | |
7563 | } | |
7564 | } | |
7565 | ||
7566 | /* Optimize sqrt(pow(x,y)) = pow(|x|,y*0.5). */ | |
7567 | if (flag_unsafe_math_optimizations | |
7568 | && (fcode == BUILT_IN_POW | |
7569 | || fcode == BUILT_IN_POWF | |
7570 | || fcode == BUILT_IN_POWL)) | |
7571 | { | |
7572 | tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0); | |
7573 | tree arg0 = CALL_EXPR_ARG (arg, 0); | |
7574 | tree arg1 = CALL_EXPR_ARG (arg, 1); | |
7575 | tree narg1; | |
7576 | if (!tree_expr_nonnegative_p (arg0)) | |
7577 | arg0 = build1 (ABS_EXPR, type, arg0); | |
7578 | narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1, | |
7579 | build_real (type, dconsthalf)); | |
7580 | return build_call_expr_loc (loc, powfn, 2, arg0, narg1); | |
7581 | } | |
7582 | ||
7583 | return NULL_TREE; | |
7584 | } | |
7585 | ||
7586 | /* Fold a builtin function call to cbrt, cbrtf, or cbrtl with argument ARG. | |
7587 | Return NULL_TREE if no simplification can be made. */ | |
7588 | ||
7589 | static tree | |
7590 | fold_builtin_cbrt (location_t loc, tree arg, tree type) | |
7591 | { | |
7592 | const enum built_in_function fcode = builtin_mathfn_code (arg); | |
7593 | tree res; | |
7594 | ||
7595 | if (!validate_arg (arg, REAL_TYPE)) | |
7596 | return NULL_TREE; | |
7597 | ||
7598 | /* Calculate the result when the argument is a constant. */ | |
7599 | if ((res = do_mpfr_arg1 (arg, type, mpfr_cbrt, NULL, NULL, 0))) | |
7600 | return res; | |
7601 | ||
7602 | if (flag_unsafe_math_optimizations) | |
7603 | { | |
7604 | /* Optimize cbrt(expN(x)) -> expN(x/3). */ | |
7605 | if (BUILTIN_EXPONENT_P (fcode)) | |
7606 | { | |
7607 | tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0); | |
7608 | const REAL_VALUE_TYPE third_trunc = | |
7609 | real_value_truncate (TYPE_MODE (type), dconst_third ()); | |
7610 | arg = fold_build2_loc (loc, MULT_EXPR, type, | |
7611 | CALL_EXPR_ARG (arg, 0), | |
7612 | build_real (type, third_trunc)); | |
7613 | return build_call_expr_loc (loc, expfn, 1, arg); | |
7614 | } | |
7615 | ||
7616 | /* Optimize cbrt(sqrt(x)) -> pow(x,1/6). */ | |
7617 | if (BUILTIN_SQRT_P (fcode)) | |
7618 | { | |
7619 | tree powfn = mathfn_built_in (type, BUILT_IN_POW); | |
7620 | ||
7621 | if (powfn) | |
7622 | { | |
7623 | tree arg0 = CALL_EXPR_ARG (arg, 0); | |
7624 | tree tree_root; | |
7625 | REAL_VALUE_TYPE dconstroot = dconst_third (); | |
7626 | ||
7627 | SET_REAL_EXP (&dconstroot, REAL_EXP (&dconstroot) - 1); | |
7628 | dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot); | |
7629 | tree_root = build_real (type, dconstroot); | |
7630 | return build_call_expr_loc (loc, powfn, 2, arg0, tree_root); | |
7631 | } | |
7632 | } | |
7633 | ||
7634 | /* Optimize cbrt(cbrt(x)) -> pow(x,1/9) iff x is nonnegative. */ | |
7635 | if (BUILTIN_CBRT_P (fcode)) | |
7636 | { | |
7637 | tree arg0 = CALL_EXPR_ARG (arg, 0); | |
7638 | if (tree_expr_nonnegative_p (arg0)) | |
7639 | { | |
7640 | tree powfn = mathfn_built_in (type, BUILT_IN_POW); | |
7641 | ||
7642 | if (powfn) | |
7643 | { | |
7644 | tree tree_root; | |
7645 | REAL_VALUE_TYPE dconstroot; | |
7646 | ||
7647 | real_arithmetic (&dconstroot, MULT_EXPR, | |
7648 | dconst_third_ptr (), dconst_third_ptr ()); | |
7649 | dconstroot = real_value_truncate (TYPE_MODE (type), dconstroot); | |
7650 | tree_root = build_real (type, dconstroot); | |
7651 | return build_call_expr_loc (loc, powfn, 2, arg0, tree_root); | |
7652 | } | |
7653 | } | |
7654 | } | |
7655 | ||
7656 | /* Optimize cbrt(pow(x,y)) -> pow(x,y/3) iff x is nonnegative. */ | |
7657 | if (fcode == BUILT_IN_POW | |
7658 | || fcode == BUILT_IN_POWF | |
7659 | || fcode == BUILT_IN_POWL) | |
7660 | { | |
7661 | tree arg00 = CALL_EXPR_ARG (arg, 0); | |
7662 | tree arg01 = CALL_EXPR_ARG (arg, 1); | |
7663 | if (tree_expr_nonnegative_p (arg00)) | |
7664 | { | |
7665 | tree powfn = TREE_OPERAND (CALL_EXPR_FN (arg), 0); | |
7666 | const REAL_VALUE_TYPE dconstroot | |
7667 | = real_value_truncate (TYPE_MODE (type), dconst_third ()); | |
7668 | tree narg01 = fold_build2_loc (loc, MULT_EXPR, type, arg01, | |
7669 | build_real (type, dconstroot)); | |
7670 | return build_call_expr_loc (loc, powfn, 2, arg00, narg01); | |
7671 | } | |
7672 | } | |
7673 | } | |
7674 | return NULL_TREE; | |
7675 | } | |
7676 | ||
7677 | /* Fold function call to builtin cos, cosf, or cosl with argument ARG. | |
7678 | TYPE is the type of the return value. Return NULL_TREE if no | |
7679 | simplification can be made. */ | |
7680 | ||
7681 | static tree | |
7682 | fold_builtin_cos (location_t loc, | |
7683 | tree arg, tree type, tree fndecl) | |
7684 | { | |
7685 | tree res, narg; | |
7686 | ||
7687 | if (!validate_arg (arg, REAL_TYPE)) | |
7688 | return NULL_TREE; | |
7689 | ||
7690 | /* Calculate the result when the argument is a constant. */ | |
7691 | if ((res = do_mpfr_arg1 (arg, type, mpfr_cos, NULL, NULL, 0))) | |
7692 | return res; | |
7693 | ||
7694 | /* Optimize cos(-x) into cos (x). */ | |
7695 | if ((narg = fold_strip_sign_ops (arg))) | |
7696 | return build_call_expr_loc (loc, fndecl, 1, narg); | |
7697 | ||
7698 | return NULL_TREE; | |
7699 | } | |
7700 | ||
7701 | /* Fold function call to builtin cosh, coshf, or coshl with argument ARG. | |
7702 | Return NULL_TREE if no simplification can be made. */ | |
7703 | ||
7704 | static tree | |
7705 | fold_builtin_cosh (location_t loc, tree arg, tree type, tree fndecl) | |
7706 | { | |
7707 | if (validate_arg (arg, REAL_TYPE)) | |
7708 | { | |
7709 | tree res, narg; | |
7710 | ||
7711 | /* Calculate the result when the argument is a constant. */ | |
7712 | if ((res = do_mpfr_arg1 (arg, type, mpfr_cosh, NULL, NULL, 0))) | |
7713 | return res; | |
7714 | ||
7715 | /* Optimize cosh(-x) into cosh (x). */ | |
7716 | if ((narg = fold_strip_sign_ops (arg))) | |
7717 | return build_call_expr_loc (loc, fndecl, 1, narg); | |
7718 | } | |
7719 | ||
7720 | return NULL_TREE; | |
7721 | } | |
7722 | ||
7723 | /* Fold function call to builtin ccos (or ccosh if HYPER is TRUE) with | |
7724 | argument ARG. TYPE is the type of the return value. Return | |
7725 | NULL_TREE if no simplification can be made. */ | |
7726 | ||
7727 | static tree | |
7728 | fold_builtin_ccos (location_t loc, tree arg, tree type, tree fndecl, | |
7729 | bool hyper) | |
7730 | { | |
7731 | if (validate_arg (arg, COMPLEX_TYPE) | |
7732 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE) | |
7733 | { | |
7734 | tree tmp; | |
7735 | ||
7736 | /* Calculate the result when the argument is a constant. */ | |
7737 | if ((tmp = do_mpc_arg1 (arg, type, (hyper ? mpc_cosh : mpc_cos)))) | |
7738 | return tmp; | |
7739 | ||
7740 | /* Optimize fn(-x) into fn(x). */ | |
7741 | if ((tmp = fold_strip_sign_ops (arg))) | |
7742 | return build_call_expr_loc (loc, fndecl, 1, tmp); | |
7743 | } | |
7744 | ||
7745 | return NULL_TREE; | |
7746 | } | |
7747 | ||
7748 | /* Fold function call to builtin tan, tanf, or tanl with argument ARG. | |
7749 | Return NULL_TREE if no simplification can be made. */ | |
7750 | ||
7751 | static tree | |
7752 | fold_builtin_tan (tree arg, tree type) | |
7753 | { | |
7754 | enum built_in_function fcode; | |
7755 | tree res; | |
7756 | ||
7757 | if (!validate_arg (arg, REAL_TYPE)) | |
7758 | return NULL_TREE; | |
7759 | ||
7760 | /* Calculate the result when the argument is a constant. */ | |
7761 | if ((res = do_mpfr_arg1 (arg, type, mpfr_tan, NULL, NULL, 0))) | |
7762 | return res; | |
7763 | ||
7764 | /* Optimize tan(atan(x)) = x. */ | |
7765 | fcode = builtin_mathfn_code (arg); | |
7766 | if (flag_unsafe_math_optimizations | |
7767 | && (fcode == BUILT_IN_ATAN | |
7768 | || fcode == BUILT_IN_ATANF | |
7769 | || fcode == BUILT_IN_ATANL)) | |
7770 | return CALL_EXPR_ARG (arg, 0); | |
7771 | ||
7772 | return NULL_TREE; | |
7773 | } | |
7774 | ||
7775 | /* Fold function call to builtin sincos, sincosf, or sincosl. Return | |
7776 | NULL_TREE if no simplification can be made. */ | |
7777 | ||
7778 | static tree | |
7779 | fold_builtin_sincos (location_t loc, | |
7780 | tree arg0, tree arg1, tree arg2) | |
7781 | { | |
7782 | tree type; | |
7783 | tree res, fn, call; | |
7784 | ||
7785 | if (!validate_arg (arg0, REAL_TYPE) | |
7786 | || !validate_arg (arg1, POINTER_TYPE) | |
7787 | || !validate_arg (arg2, POINTER_TYPE)) | |
7788 | return NULL_TREE; | |
7789 | ||
7790 | type = TREE_TYPE (arg0); | |
7791 | ||
7792 | /* Calculate the result when the argument is a constant. */ | |
7793 | if ((res = do_mpfr_sincos (arg0, arg1, arg2))) | |
7794 | return res; | |
7795 | ||
7796 | /* Canonicalize sincos to cexpi. */ | |
7797 | if (!TARGET_C99_FUNCTIONS) | |
7798 | return NULL_TREE; | |
7799 | fn = mathfn_built_in (type, BUILT_IN_CEXPI); | |
7800 | if (!fn) | |
7801 | return NULL_TREE; | |
7802 | ||
7803 | call = build_call_expr_loc (loc, fn, 1, arg0); | |
7804 | call = builtin_save_expr (call); | |
7805 | ||
7806 | return build2 (COMPOUND_EXPR, void_type_node, | |
7807 | build2 (MODIFY_EXPR, void_type_node, | |
7808 | build_fold_indirect_ref_loc (loc, arg1), | |
7809 | build1 (IMAGPART_EXPR, type, call)), | |
7810 | build2 (MODIFY_EXPR, void_type_node, | |
7811 | build_fold_indirect_ref_loc (loc, arg2), | |
7812 | build1 (REALPART_EXPR, type, call))); | |
7813 | } | |
7814 | ||
7815 | /* Fold function call to builtin cexp, cexpf, or cexpl. Return | |
7816 | NULL_TREE if no simplification can be made. */ | |
7817 | ||
7818 | static tree | |
7819 | fold_builtin_cexp (location_t loc, tree arg0, tree type) | |
7820 | { | |
7821 | tree rtype; | |
7822 | tree realp, imagp, ifn; | |
7823 | tree res; | |
7824 | ||
7825 | if (!validate_arg (arg0, COMPLEX_TYPE) | |
7826 | || TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) != REAL_TYPE) | |
7827 | return NULL_TREE; | |
7828 | ||
7829 | /* Calculate the result when the argument is a constant. */ | |
7830 | if ((res = do_mpc_arg1 (arg0, type, mpc_exp))) | |
7831 | return res; | |
7832 | ||
7833 | rtype = TREE_TYPE (TREE_TYPE (arg0)); | |
7834 | ||
7835 | /* In case we can figure out the real part of arg0 and it is constant zero | |
7836 | fold to cexpi. */ | |
7837 | if (!TARGET_C99_FUNCTIONS) | |
7838 | return NULL_TREE; | |
7839 | ifn = mathfn_built_in (rtype, BUILT_IN_CEXPI); | |
7840 | if (!ifn) | |
7841 | return NULL_TREE; | |
7842 | ||
7843 | if ((realp = fold_unary_loc (loc, REALPART_EXPR, rtype, arg0)) | |
7844 | && real_zerop (realp)) | |
7845 | { | |
7846 | tree narg = fold_build1_loc (loc, IMAGPART_EXPR, rtype, arg0); | |
7847 | return build_call_expr_loc (loc, ifn, 1, narg); | |
7848 | } | |
7849 | ||
7850 | /* In case we can easily decompose real and imaginary parts split cexp | |
7851 | to exp (r) * cexpi (i). */ | |
7852 | if (flag_unsafe_math_optimizations | |
7853 | && realp) | |
7854 | { | |
7855 | tree rfn, rcall, icall; | |
7856 | ||
7857 | rfn = mathfn_built_in (rtype, BUILT_IN_EXP); | |
7858 | if (!rfn) | |
7859 | return NULL_TREE; | |
7860 | ||
7861 | imagp = fold_unary_loc (loc, IMAGPART_EXPR, rtype, arg0); | |
7862 | if (!imagp) | |
7863 | return NULL_TREE; | |
7864 | ||
7865 | icall = build_call_expr_loc (loc, ifn, 1, imagp); | |
7866 | icall = builtin_save_expr (icall); | |
7867 | rcall = build_call_expr_loc (loc, rfn, 1, realp); | |
7868 | rcall = builtin_save_expr (rcall); | |
7869 | return fold_build2_loc (loc, COMPLEX_EXPR, type, | |
7870 | fold_build2_loc (loc, MULT_EXPR, rtype, | |
7871 | rcall, | |
7872 | fold_build1_loc (loc, REALPART_EXPR, | |
7873 | rtype, icall)), | |
7874 | fold_build2_loc (loc, MULT_EXPR, rtype, | |
7875 | rcall, | |
7876 | fold_build1_loc (loc, IMAGPART_EXPR, | |
7877 | rtype, icall))); | |
7878 | } | |
7879 | ||
7880 | return NULL_TREE; | |
7881 | } | |
7882 | ||
7883 | /* Fold function call to builtin trunc, truncf or truncl with argument ARG. | |
7884 | Return NULL_TREE if no simplification can be made. */ | |
7885 | ||
7886 | static tree | |
7887 | fold_builtin_trunc (location_t loc, tree fndecl, tree arg) | |
7888 | { | |
7889 | if (!validate_arg (arg, REAL_TYPE)) | |
7890 | return NULL_TREE; | |
7891 | ||
7892 | /* Optimize trunc of constant value. */ | |
7893 | if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)) | |
7894 | { | |
7895 | REAL_VALUE_TYPE r, x; | |
7896 | tree type = TREE_TYPE (TREE_TYPE (fndecl)); | |
7897 | ||
7898 | x = TREE_REAL_CST (arg); | |
7899 | real_trunc (&r, TYPE_MODE (type), &x); | |
7900 | return build_real (type, r); | |
7901 | } | |
7902 | ||
7903 | return fold_trunc_transparent_mathfn (loc, fndecl, arg); | |
7904 | } | |
7905 | ||
7906 | /* Fold function call to builtin floor, floorf or floorl with argument ARG. | |
7907 | Return NULL_TREE if no simplification can be made. */ | |
7908 | ||
7909 | static tree | |
7910 | fold_builtin_floor (location_t loc, tree fndecl, tree arg) | |
7911 | { | |
7912 | if (!validate_arg (arg, REAL_TYPE)) | |
7913 | return NULL_TREE; | |
7914 | ||
7915 | /* Optimize floor of constant value. */ | |
7916 | if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)) | |
7917 | { | |
7918 | REAL_VALUE_TYPE x; | |
7919 | ||
7920 | x = TREE_REAL_CST (arg); | |
7921 | if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math) | |
7922 | { | |
7923 | tree type = TREE_TYPE (TREE_TYPE (fndecl)); | |
7924 | REAL_VALUE_TYPE r; | |
7925 | ||
7926 | real_floor (&r, TYPE_MODE (type), &x); | |
7927 | return build_real (type, r); | |
7928 | } | |
7929 | } | |
7930 | ||
7931 | /* Fold floor (x) where x is nonnegative to trunc (x). */ | |
7932 | if (tree_expr_nonnegative_p (arg)) | |
7933 | { | |
7934 | tree truncfn = mathfn_built_in (TREE_TYPE (arg), BUILT_IN_TRUNC); | |
7935 | if (truncfn) | |
7936 | return build_call_expr_loc (loc, truncfn, 1, arg); | |
7937 | } | |
7938 | ||
7939 | return fold_trunc_transparent_mathfn (loc, fndecl, arg); | |
7940 | } | |
7941 | ||
7942 | /* Fold function call to builtin ceil, ceilf or ceill with argument ARG. | |
7943 | Return NULL_TREE if no simplification can be made. */ | |
7944 | ||
7945 | static tree | |
7946 | fold_builtin_ceil (location_t loc, tree fndecl, tree arg) | |
7947 | { | |
7948 | if (!validate_arg (arg, REAL_TYPE)) | |
7949 | return NULL_TREE; | |
7950 | ||
7951 | /* Optimize ceil of constant value. */ | |
7952 | if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)) | |
7953 | { | |
7954 | REAL_VALUE_TYPE x; | |
7955 | ||
7956 | x = TREE_REAL_CST (arg); | |
7957 | if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math) | |
7958 | { | |
7959 | tree type = TREE_TYPE (TREE_TYPE (fndecl)); | |
7960 | REAL_VALUE_TYPE r; | |
7961 | ||
7962 | real_ceil (&r, TYPE_MODE (type), &x); | |
7963 | return build_real (type, r); | |
7964 | } | |
7965 | } | |
7966 | ||
7967 | return fold_trunc_transparent_mathfn (loc, fndecl, arg); | |
7968 | } | |
7969 | ||
7970 | /* Fold function call to builtin round, roundf or roundl with argument ARG. | |
7971 | Return NULL_TREE if no simplification can be made. */ | |
7972 | ||
7973 | static tree | |
7974 | fold_builtin_round (location_t loc, tree fndecl, tree arg) | |
7975 | { | |
7976 | if (!validate_arg (arg, REAL_TYPE)) | |
7977 | return NULL_TREE; | |
7978 | ||
7979 | /* Optimize round of constant value. */ | |
7980 | if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)) | |
7981 | { | |
7982 | REAL_VALUE_TYPE x; | |
7983 | ||
7984 | x = TREE_REAL_CST (arg); | |
7985 | if (! REAL_VALUE_ISNAN (x) || ! flag_errno_math) | |
7986 | { | |
7987 | tree type = TREE_TYPE (TREE_TYPE (fndecl)); | |
7988 | REAL_VALUE_TYPE r; | |
7989 | ||
7990 | real_round (&r, TYPE_MODE (type), &x); | |
7991 | return build_real (type, r); | |
7992 | } | |
7993 | } | |
7994 | ||
7995 | return fold_trunc_transparent_mathfn (loc, fndecl, arg); | |
7996 | } | |
7997 | ||
7998 | /* Fold function call to builtin lround, lroundf or lroundl (or the | |
7999 | corresponding long long versions) and other rounding functions. ARG | |
8000 | is the argument to the call. Return NULL_TREE if no simplification | |
8001 | can be made. */ | |
8002 | ||
8003 | static tree | |
8004 | fold_builtin_int_roundingfn (location_t loc, tree fndecl, tree arg) | |
8005 | { | |
8006 | if (!validate_arg (arg, REAL_TYPE)) | |
8007 | return NULL_TREE; | |
8008 | ||
8009 | /* Optimize lround of constant value. */ | |
8010 | if (TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)) | |
8011 | { | |
8012 | const REAL_VALUE_TYPE x = TREE_REAL_CST (arg); | |
8013 | ||
8014 | if (real_isfinite (&x)) | |
8015 | { | |
8016 | tree itype = TREE_TYPE (TREE_TYPE (fndecl)); | |
8017 | tree ftype = TREE_TYPE (arg); | |
8018 | double_int val; | |
8019 | REAL_VALUE_TYPE r; | |
8020 | ||
8021 | switch (DECL_FUNCTION_CODE (fndecl)) | |
8022 | { | |
8023 | CASE_FLT_FN (BUILT_IN_IFLOOR): | |
8024 | CASE_FLT_FN (BUILT_IN_LFLOOR): | |
8025 | CASE_FLT_FN (BUILT_IN_LLFLOOR): | |
8026 | real_floor (&r, TYPE_MODE (ftype), &x); | |
8027 | break; | |
8028 | ||
8029 | CASE_FLT_FN (BUILT_IN_ICEIL): | |
8030 | CASE_FLT_FN (BUILT_IN_LCEIL): | |
8031 | CASE_FLT_FN (BUILT_IN_LLCEIL): | |
8032 | real_ceil (&r, TYPE_MODE (ftype), &x); | |
8033 | break; | |
8034 | ||
8035 | CASE_FLT_FN (BUILT_IN_IROUND): | |
8036 | CASE_FLT_FN (BUILT_IN_LROUND): | |
8037 | CASE_FLT_FN (BUILT_IN_LLROUND): | |
8038 | real_round (&r, TYPE_MODE (ftype), &x); | |
8039 | break; | |
8040 | ||
8041 | default: | |
8042 | gcc_unreachable (); | |
8043 | } | |
8044 | ||
8045 | real_to_integer2 ((HOST_WIDE_INT *)&val.low, &val.high, &r); | |
8046 | if (double_int_fits_to_tree_p (itype, val)) | |
8047 | return double_int_to_tree (itype, val); | |
8048 | } | |
8049 | } | |
8050 | ||
8051 | switch (DECL_FUNCTION_CODE (fndecl)) | |
8052 | { | |
8053 | CASE_FLT_FN (BUILT_IN_LFLOOR): | |
8054 | CASE_FLT_FN (BUILT_IN_LLFLOOR): | |
8055 | /* Fold lfloor (x) where x is nonnegative to FIX_TRUNC (x). */ | |
8056 | if (tree_expr_nonnegative_p (arg)) | |
8057 | return fold_build1_loc (loc, FIX_TRUNC_EXPR, | |
8058 | TREE_TYPE (TREE_TYPE (fndecl)), arg); | |
8059 | break; | |
8060 | default:; | |
8061 | } | |
8062 | ||
8063 | return fold_fixed_mathfn (loc, fndecl, arg); | |
8064 | } | |
8065 | ||
8066 | /* Fold function call to builtin ffs, clz, ctz, popcount and parity | |
8067 | and their long and long long variants (i.e. ffsl and ffsll). ARG is | |
8068 | the argument to the call. Return NULL_TREE if no simplification can | |
8069 | be made. */ | |
8070 | ||
8071 | static tree | |
8072 | fold_builtin_bitop (tree fndecl, tree arg) | |
8073 | { | |
8074 | if (!validate_arg (arg, INTEGER_TYPE)) | |
8075 | return NULL_TREE; | |
8076 | ||
8077 | /* Optimize for constant argument. */ | |
8078 | if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg)) | |
8079 | { | |
8080 | HOST_WIDE_INT hi, width, result; | |
8081 | unsigned HOST_WIDE_INT lo; | |
8082 | tree type; | |
8083 | ||
8084 | type = TREE_TYPE (arg); | |
8085 | width = TYPE_PRECISION (type); | |
8086 | lo = TREE_INT_CST_LOW (arg); | |
8087 | ||
8088 | /* Clear all the bits that are beyond the type's precision. */ | |
8089 | if (width > HOST_BITS_PER_WIDE_INT) | |
8090 | { | |
8091 | hi = TREE_INT_CST_HIGH (arg); | |
8092 | if (width < 2 * HOST_BITS_PER_WIDE_INT) | |
8093 | hi &= ~((unsigned HOST_WIDE_INT) (-1) | |
8094 | << (width - HOST_BITS_PER_WIDE_INT)); | |
8095 | } | |
8096 | else | |
8097 | { | |
8098 | hi = 0; | |
8099 | if (width < HOST_BITS_PER_WIDE_INT) | |
8100 | lo &= ~((unsigned HOST_WIDE_INT) (-1) << width); | |
8101 | } | |
8102 | ||
8103 | switch (DECL_FUNCTION_CODE (fndecl)) | |
8104 | { | |
8105 | CASE_INT_FN (BUILT_IN_FFS): | |
8106 | if (lo != 0) | |
8107 | result = ffs_hwi (lo); | |
8108 | else if (hi != 0) | |
8109 | result = HOST_BITS_PER_WIDE_INT + ffs_hwi (hi); | |
8110 | else | |
8111 | result = 0; | |
8112 | break; | |
8113 | ||
8114 | CASE_INT_FN (BUILT_IN_CLZ): | |
8115 | if (hi != 0) | |
8116 | result = width - floor_log2 (hi) - 1 - HOST_BITS_PER_WIDE_INT; | |
8117 | else if (lo != 0) | |
8118 | result = width - floor_log2 (lo) - 1; | |
8119 | else if (! CLZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result)) | |
8120 | result = width; | |
8121 | break; | |
8122 | ||
8123 | CASE_INT_FN (BUILT_IN_CTZ): | |
8124 | if (lo != 0) | |
8125 | result = ctz_hwi (lo); | |
8126 | else if (hi != 0) | |
8127 | result = HOST_BITS_PER_WIDE_INT + ctz_hwi (hi); | |
8128 | else if (! CTZ_DEFINED_VALUE_AT_ZERO (TYPE_MODE (type), result)) | |
8129 | result = width; | |
8130 | break; | |
8131 | ||
8132 | CASE_INT_FN (BUILT_IN_CLRSB): | |
8133 | if (width > HOST_BITS_PER_WIDE_INT | |
8134 | && (hi & ((unsigned HOST_WIDE_INT) 1 | |
8135 | << (width - HOST_BITS_PER_WIDE_INT - 1))) != 0) | |
8136 | { | |
8137 | hi = ~hi & ~((unsigned HOST_WIDE_INT) (-1) | |
8138 | << (width - HOST_BITS_PER_WIDE_INT - 1)); | |
8139 | lo = ~lo; | |
8140 | } | |
8141 | else if (width <= HOST_BITS_PER_WIDE_INT | |
8142 | && (lo & ((unsigned HOST_WIDE_INT) 1 << (width - 1))) != 0) | |
8143 | lo = ~lo & ~((unsigned HOST_WIDE_INT) (-1) << (width - 1)); | |
8144 | if (hi != 0) | |
8145 | result = width - floor_log2 (hi) - 2 - HOST_BITS_PER_WIDE_INT; | |
8146 | else if (lo != 0) | |
8147 | result = width - floor_log2 (lo) - 2; | |
8148 | else | |
8149 | result = width - 1; | |
8150 | break; | |
8151 | ||
8152 | CASE_INT_FN (BUILT_IN_POPCOUNT): | |
8153 | result = 0; | |
8154 | while (lo) | |
8155 | result++, lo &= lo - 1; | |
8156 | while (hi) | |
8157 | result++, hi &= (unsigned HOST_WIDE_INT) hi - 1; | |
8158 | break; | |
8159 | ||
8160 | CASE_INT_FN (BUILT_IN_PARITY): | |
8161 | result = 0; | |
8162 | while (lo) | |
8163 | result++, lo &= lo - 1; | |
8164 | while (hi) | |
8165 | result++, hi &= (unsigned HOST_WIDE_INT) hi - 1; | |
8166 | result &= 1; | |
8167 | break; | |
8168 | ||
8169 | default: | |
8170 | gcc_unreachable (); | |
8171 | } | |
8172 | ||
8173 | return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), result); | |
8174 | } | |
8175 | ||
8176 | return NULL_TREE; | |
8177 | } | |
8178 | ||
8179 | /* Fold function call to builtin_bswap and the long and long long | |
8180 | variants. Return NULL_TREE if no simplification can be made. */ | |
8181 | static tree | |
8182 | fold_builtin_bswap (tree fndecl, tree arg) | |
8183 | { | |
8184 | if (! validate_arg (arg, INTEGER_TYPE)) | |
8185 | return NULL_TREE; | |
8186 | ||
8187 | /* Optimize constant value. */ | |
8188 | if (TREE_CODE (arg) == INTEGER_CST && !TREE_OVERFLOW (arg)) | |
8189 | { | |
8190 | HOST_WIDE_INT hi, width, r_hi = 0; | |
8191 | unsigned HOST_WIDE_INT lo, r_lo = 0; | |
8192 | tree type; | |
8193 | ||
8194 | type = TREE_TYPE (arg); | |
8195 | width = TYPE_PRECISION (type); | |
8196 | lo = TREE_INT_CST_LOW (arg); | |
8197 | hi = TREE_INT_CST_HIGH (arg); | |
8198 | ||
8199 | switch (DECL_FUNCTION_CODE (fndecl)) | |
8200 | { | |
8201 | case BUILT_IN_BSWAP32: | |
8202 | case BUILT_IN_BSWAP64: | |
8203 | { | |
8204 | int s; | |
8205 | ||
8206 | for (s = 0; s < width; s += 8) | |
8207 | { | |
8208 | int d = width - s - 8; | |
8209 | unsigned HOST_WIDE_INT byte; | |
8210 | ||
8211 | if (s < HOST_BITS_PER_WIDE_INT) | |
8212 | byte = (lo >> s) & 0xff; | |
8213 | else | |
8214 | byte = (hi >> (s - HOST_BITS_PER_WIDE_INT)) & 0xff; | |
8215 | ||
8216 | if (d < HOST_BITS_PER_WIDE_INT) | |
8217 | r_lo |= byte << d; | |
8218 | else | |
8219 | r_hi |= byte << (d - HOST_BITS_PER_WIDE_INT); | |
8220 | } | |
8221 | } | |
8222 | ||
8223 | break; | |
8224 | ||
8225 | default: | |
8226 | gcc_unreachable (); | |
8227 | } | |
8228 | ||
8229 | if (width < HOST_BITS_PER_WIDE_INT) | |
8230 | return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), r_lo); | |
8231 | else | |
8232 | return build_int_cst_wide (TREE_TYPE (TREE_TYPE (fndecl)), r_lo, r_hi); | |
8233 | } | |
8234 | ||
8235 | return NULL_TREE; | |
8236 | } | |
8237 | ||
8238 | /* A subroutine of fold_builtin to fold the various logarithmic | |
8239 | functions. Return NULL_TREE if no simplification can me made. | |
8240 | FUNC is the corresponding MPFR logarithm function. */ | |
8241 | ||
8242 | static tree | |
8243 | fold_builtin_logarithm (location_t loc, tree fndecl, tree arg, | |
8244 | int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t)) | |
8245 | { | |
8246 | if (validate_arg (arg, REAL_TYPE)) | |
8247 | { | |
8248 | tree type = TREE_TYPE (TREE_TYPE (fndecl)); | |
8249 | tree res; | |
8250 | const enum built_in_function fcode = builtin_mathfn_code (arg); | |
8251 | ||
8252 | /* Calculate the result when the argument is a constant. */ | |
8253 | if ((res = do_mpfr_arg1 (arg, type, func, &dconst0, NULL, false))) | |
8254 | return res; | |
8255 | ||
8256 | /* Special case, optimize logN(expN(x)) = x. */ | |
8257 | if (flag_unsafe_math_optimizations | |
8258 | && ((func == mpfr_log | |
8259 | && (fcode == BUILT_IN_EXP | |
8260 | || fcode == BUILT_IN_EXPF | |
8261 | || fcode == BUILT_IN_EXPL)) | |
8262 | || (func == mpfr_log2 | |
8263 | && (fcode == BUILT_IN_EXP2 | |
8264 | || fcode == BUILT_IN_EXP2F | |
8265 | || fcode == BUILT_IN_EXP2L)) | |
8266 | || (func == mpfr_log10 && (BUILTIN_EXP10_P (fcode))))) | |
8267 | return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0)); | |
8268 | ||
8269 | /* Optimize logN(func()) for various exponential functions. We | |
8270 | want to determine the value "x" and the power "exponent" in | |
8271 | order to transform logN(x**exponent) into exponent*logN(x). */ | |
8272 | if (flag_unsafe_math_optimizations) | |
8273 | { | |
8274 | tree exponent = 0, x = 0; | |
8275 | ||
8276 | switch (fcode) | |
8277 | { | |
8278 | CASE_FLT_FN (BUILT_IN_EXP): | |
8279 | /* Prepare to do logN(exp(exponent) -> exponent*logN(e). */ | |
8280 | x = build_real (type, real_value_truncate (TYPE_MODE (type), | |
8281 | dconst_e ())); | |
8282 | exponent = CALL_EXPR_ARG (arg, 0); | |
8283 | break; | |
8284 | CASE_FLT_FN (BUILT_IN_EXP2): | |
8285 | /* Prepare to do logN(exp2(exponent) -> exponent*logN(2). */ | |
8286 | x = build_real (type, dconst2); | |
8287 | exponent = CALL_EXPR_ARG (arg, 0); | |
8288 | break; | |
8289 | CASE_FLT_FN (BUILT_IN_EXP10): | |
8290 | CASE_FLT_FN (BUILT_IN_POW10): | |
8291 | /* Prepare to do logN(exp10(exponent) -> exponent*logN(10). */ | |
8292 | { | |
8293 | REAL_VALUE_TYPE dconst10; | |
8294 | real_from_integer (&dconst10, VOIDmode, 10, 0, 0); | |
8295 | x = build_real (type, dconst10); | |
8296 | } | |
8297 | exponent = CALL_EXPR_ARG (arg, 0); | |
8298 | break; | |
8299 | CASE_FLT_FN (BUILT_IN_SQRT): | |
8300 | /* Prepare to do logN(sqrt(x) -> 0.5*logN(x). */ | |
8301 | x = CALL_EXPR_ARG (arg, 0); | |
8302 | exponent = build_real (type, dconsthalf); | |
8303 | break; | |
8304 | CASE_FLT_FN (BUILT_IN_CBRT): | |
8305 | /* Prepare to do logN(cbrt(x) -> (1/3)*logN(x). */ | |
8306 | x = CALL_EXPR_ARG (arg, 0); | |
8307 | exponent = build_real (type, real_value_truncate (TYPE_MODE (type), | |
8308 | dconst_third ())); | |
8309 | break; | |
8310 | CASE_FLT_FN (BUILT_IN_POW): | |
8311 | /* Prepare to do logN(pow(x,exponent) -> exponent*logN(x). */ | |
8312 | x = CALL_EXPR_ARG (arg, 0); | |
8313 | exponent = CALL_EXPR_ARG (arg, 1); | |
8314 | break; | |
8315 | default: | |
8316 | break; | |
8317 | } | |
8318 | ||
8319 | /* Now perform the optimization. */ | |
8320 | if (x && exponent) | |
8321 | { | |
8322 | tree logfn = build_call_expr_loc (loc, fndecl, 1, x); | |
8323 | return fold_build2_loc (loc, MULT_EXPR, type, exponent, logfn); | |
8324 | } | |
8325 | } | |
8326 | } | |
8327 | ||
8328 | return NULL_TREE; | |
8329 | } | |
8330 | ||
8331 | /* Fold a builtin function call to hypot, hypotf, or hypotl. Return | |
8332 | NULL_TREE if no simplification can be made. */ | |
8333 | ||
8334 | static tree | |
8335 | fold_builtin_hypot (location_t loc, tree fndecl, | |
8336 | tree arg0, tree arg1, tree type) | |
8337 | { | |
8338 | tree res, narg0, narg1; | |
8339 | ||
8340 | if (!validate_arg (arg0, REAL_TYPE) | |
8341 | || !validate_arg (arg1, REAL_TYPE)) | |
8342 | return NULL_TREE; | |
8343 | ||
8344 | /* Calculate the result when the argument is a constant. */ | |
8345 | if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_hypot))) | |
8346 | return res; | |
8347 | ||
8348 | /* If either argument to hypot has a negate or abs, strip that off. | |
8349 | E.g. hypot(-x,fabs(y)) -> hypot(x,y). */ | |
8350 | narg0 = fold_strip_sign_ops (arg0); | |
8351 | narg1 = fold_strip_sign_ops (arg1); | |
8352 | if (narg0 || narg1) | |
8353 | { | |
8354 | return build_call_expr_loc (loc, fndecl, 2, narg0 ? narg0 : arg0, | |
8355 | narg1 ? narg1 : arg1); | |
8356 | } | |
8357 | ||
8358 | /* If either argument is zero, hypot is fabs of the other. */ | |
8359 | if (real_zerop (arg0)) | |
8360 | return fold_build1_loc (loc, ABS_EXPR, type, arg1); | |
8361 | else if (real_zerop (arg1)) | |
8362 | return fold_build1_loc (loc, ABS_EXPR, type, arg0); | |
8363 | ||
8364 | /* hypot(x,x) -> fabs(x)*sqrt(2). */ | |
8365 | if (flag_unsafe_math_optimizations | |
8366 | && operand_equal_p (arg0, arg1, OEP_PURE_SAME)) | |
8367 | { | |
8368 | const REAL_VALUE_TYPE sqrt2_trunc | |
8369 | = real_value_truncate (TYPE_MODE (type), dconst_sqrt2 ()); | |
8370 | return fold_build2_loc (loc, MULT_EXPR, type, | |
8371 | fold_build1_loc (loc, ABS_EXPR, type, arg0), | |
8372 | build_real (type, sqrt2_trunc)); | |
8373 | } | |
8374 | ||
8375 | return NULL_TREE; | |
8376 | } | |
8377 | ||
8378 | ||
8379 | /* Fold a builtin function call to pow, powf, or powl. Return | |
8380 | NULL_TREE if no simplification can be made. */ | |
8381 | static tree | |
8382 | fold_builtin_pow (location_t loc, tree fndecl, tree arg0, tree arg1, tree type) | |
8383 | { | |
8384 | tree res; | |
8385 | ||
8386 | if (!validate_arg (arg0, REAL_TYPE) | |
8387 | || !validate_arg (arg1, REAL_TYPE)) | |
8388 | return NULL_TREE; | |
8389 | ||
8390 | /* Calculate the result when the argument is a constant. */ | |
8391 | if ((res = do_mpfr_arg2 (arg0, arg1, type, mpfr_pow))) | |
8392 | return res; | |
8393 | ||
8394 | /* Optimize pow(1.0,y) = 1.0. */ | |
8395 | if (real_onep (arg0)) | |
8396 | return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1); | |
8397 | ||
8398 | if (TREE_CODE (arg1) == REAL_CST | |
8399 | && !TREE_OVERFLOW (arg1)) | |
8400 | { | |
8401 | REAL_VALUE_TYPE cint; | |
8402 | REAL_VALUE_TYPE c; | |
8403 | HOST_WIDE_INT n; | |
8404 | ||
8405 | c = TREE_REAL_CST (arg1); | |
8406 | ||
8407 | /* Optimize pow(x,0.0) = 1.0. */ | |
8408 | if (REAL_VALUES_EQUAL (c, dconst0)) | |
8409 | return omit_one_operand_loc (loc, type, build_real (type, dconst1), | |
8410 | arg0); | |
8411 | ||
8412 | /* Optimize pow(x,1.0) = x. */ | |
8413 | if (REAL_VALUES_EQUAL (c, dconst1)) | |
8414 | return arg0; | |
8415 | ||
8416 | /* Optimize pow(x,-1.0) = 1.0/x. */ | |
8417 | if (REAL_VALUES_EQUAL (c, dconstm1)) | |
8418 | return fold_build2_loc (loc, RDIV_EXPR, type, | |
8419 | build_real (type, dconst1), arg0); | |
8420 | ||
8421 | /* Optimize pow(x,0.5) = sqrt(x). */ | |
8422 | if (flag_unsafe_math_optimizations | |
8423 | && REAL_VALUES_EQUAL (c, dconsthalf)) | |
8424 | { | |
8425 | tree sqrtfn = mathfn_built_in (type, BUILT_IN_SQRT); | |
8426 | ||
8427 | if (sqrtfn != NULL_TREE) | |
8428 | return build_call_expr_loc (loc, sqrtfn, 1, arg0); | |
8429 | } | |
8430 | ||
8431 | /* Optimize pow(x,1.0/3.0) = cbrt(x). */ | |
8432 | if (flag_unsafe_math_optimizations) | |
8433 | { | |
8434 | const REAL_VALUE_TYPE dconstroot | |
8435 | = real_value_truncate (TYPE_MODE (type), dconst_third ()); | |
8436 | ||
8437 | if (REAL_VALUES_EQUAL (c, dconstroot)) | |
8438 | { | |
8439 | tree cbrtfn = mathfn_built_in (type, BUILT_IN_CBRT); | |
8440 | if (cbrtfn != NULL_TREE) | |
8441 | return build_call_expr_loc (loc, cbrtfn, 1, arg0); | |
8442 | } | |
8443 | } | |
8444 | ||
8445 | /* Check for an integer exponent. */ | |
8446 | n = real_to_integer (&c); | |
8447 | real_from_integer (&cint, VOIDmode, n, n < 0 ? -1 : 0, 0); | |
8448 | if (real_identical (&c, &cint)) | |
8449 | { | |
8450 | /* Attempt to evaluate pow at compile-time, unless this should | |
8451 | raise an exception. */ | |
8452 | if (TREE_CODE (arg0) == REAL_CST | |
8453 | && !TREE_OVERFLOW (arg0) | |
8454 | && (n > 0 | |
8455 | || (!flag_trapping_math && !flag_errno_math) | |
8456 | || !REAL_VALUES_EQUAL (TREE_REAL_CST (arg0), dconst0))) | |
8457 | { | |
8458 | REAL_VALUE_TYPE x; | |
8459 | bool inexact; | |
8460 | ||
8461 | x = TREE_REAL_CST (arg0); | |
8462 | inexact = real_powi (&x, TYPE_MODE (type), &x, n); | |
8463 | if (flag_unsafe_math_optimizations || !inexact) | |
8464 | return build_real (type, x); | |
8465 | } | |
8466 | ||
8467 | /* Strip sign ops from even integer powers. */ | |
8468 | if ((n & 1) == 0 && flag_unsafe_math_optimizations) | |
8469 | { | |
8470 | tree narg0 = fold_strip_sign_ops (arg0); | |
8471 | if (narg0) | |
8472 | return build_call_expr_loc (loc, fndecl, 2, narg0, arg1); | |
8473 | } | |
8474 | } | |
8475 | } | |
8476 | ||
8477 | if (flag_unsafe_math_optimizations) | |
8478 | { | |
8479 | const enum built_in_function fcode = builtin_mathfn_code (arg0); | |
8480 | ||
8481 | /* Optimize pow(expN(x),y) = expN(x*y). */ | |
8482 | if (BUILTIN_EXPONENT_P (fcode)) | |
8483 | { | |
8484 | tree expfn = TREE_OPERAND (CALL_EXPR_FN (arg0), 0); | |
8485 | tree arg = CALL_EXPR_ARG (arg0, 0); | |
8486 | arg = fold_build2_loc (loc, MULT_EXPR, type, arg, arg1); | |
8487 | return build_call_expr_loc (loc, expfn, 1, arg); | |
8488 | } | |
8489 | ||
8490 | /* Optimize pow(sqrt(x),y) = pow(x,y*0.5). */ | |
8491 | if (BUILTIN_SQRT_P (fcode)) | |
8492 | { | |
8493 | tree narg0 = CALL_EXPR_ARG (arg0, 0); | |
8494 | tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1, | |
8495 | build_real (type, dconsthalf)); | |
8496 | return build_call_expr_loc (loc, fndecl, 2, narg0, narg1); | |
8497 | } | |
8498 | ||
8499 | /* Optimize pow(cbrt(x),y) = pow(x,y/3) iff x is nonnegative. */ | |
8500 | if (BUILTIN_CBRT_P (fcode)) | |
8501 | { | |
8502 | tree arg = CALL_EXPR_ARG (arg0, 0); | |
8503 | if (tree_expr_nonnegative_p (arg)) | |
8504 | { | |
8505 | const REAL_VALUE_TYPE dconstroot | |
8506 | = real_value_truncate (TYPE_MODE (type), dconst_third ()); | |
8507 | tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg1, | |
8508 | build_real (type, dconstroot)); | |
8509 | return build_call_expr_loc (loc, fndecl, 2, arg, narg1); | |
8510 | } | |
8511 | } | |
8512 | ||
8513 | /* Optimize pow(pow(x,y),z) = pow(x,y*z) iff x is nonnegative. */ | |
8514 | if (fcode == BUILT_IN_POW | |
8515 | || fcode == BUILT_IN_POWF | |
8516 | || fcode == BUILT_IN_POWL) | |
8517 | { | |
8518 | tree arg00 = CALL_EXPR_ARG (arg0, 0); | |
8519 | if (tree_expr_nonnegative_p (arg00)) | |
8520 | { | |
8521 | tree arg01 = CALL_EXPR_ARG (arg0, 1); | |
8522 | tree narg1 = fold_build2_loc (loc, MULT_EXPR, type, arg01, arg1); | |
8523 | return build_call_expr_loc (loc, fndecl, 2, arg00, narg1); | |
8524 | } | |
8525 | } | |
8526 | } | |
8527 | ||
8528 | return NULL_TREE; | |
8529 | } | |
8530 | ||
8531 | /* Fold a builtin function call to powi, powif, or powil with argument ARG. | |
8532 | Return NULL_TREE if no simplification can be made. */ | |
8533 | static tree | |
8534 | fold_builtin_powi (location_t loc, tree fndecl ATTRIBUTE_UNUSED, | |
8535 | tree arg0, tree arg1, tree type) | |
8536 | { | |
8537 | if (!validate_arg (arg0, REAL_TYPE) | |
8538 | || !validate_arg (arg1, INTEGER_TYPE)) | |
8539 | return NULL_TREE; | |
8540 | ||
8541 | /* Optimize pow(1.0,y) = 1.0. */ | |
8542 | if (real_onep (arg0)) | |
8543 | return omit_one_operand_loc (loc, type, build_real (type, dconst1), arg1); | |
8544 | ||
8545 | if (host_integerp (arg1, 0)) | |
8546 | { | |
8547 | HOST_WIDE_INT c = TREE_INT_CST_LOW (arg1); | |
8548 | ||
8549 | /* Evaluate powi at compile-time. */ | |
8550 | if (TREE_CODE (arg0) == REAL_CST | |
8551 | && !TREE_OVERFLOW (arg0)) | |
8552 | { | |
8553 | REAL_VALUE_TYPE x; | |
8554 | x = TREE_REAL_CST (arg0); | |
8555 | real_powi (&x, TYPE_MODE (type), &x, c); | |
8556 | return build_real (type, x); | |
8557 | } | |
8558 | ||
8559 | /* Optimize pow(x,0) = 1.0. */ | |
8560 | if (c == 0) | |
8561 | return omit_one_operand_loc (loc, type, build_real (type, dconst1), | |
8562 | arg0); | |
8563 | ||
8564 | /* Optimize pow(x,1) = x. */ | |
8565 | if (c == 1) | |
8566 | return arg0; | |
8567 | ||
8568 | /* Optimize pow(x,-1) = 1.0/x. */ | |
8569 | if (c == -1) | |
8570 | return fold_build2_loc (loc, RDIV_EXPR, type, | |
8571 | build_real (type, dconst1), arg0); | |
8572 | } | |
8573 | ||
8574 | return NULL_TREE; | |
8575 | } | |
8576 | ||
8577 | /* A subroutine of fold_builtin to fold the various exponent | |
8578 | functions. Return NULL_TREE if no simplification can be made. | |
8579 | FUNC is the corresponding MPFR exponent function. */ | |
8580 | ||
8581 | static tree | |
8582 | fold_builtin_exponent (location_t loc, tree fndecl, tree arg, | |
8583 | int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t)) | |
8584 | { | |
8585 | if (validate_arg (arg, REAL_TYPE)) | |
8586 | { | |
8587 | tree type = TREE_TYPE (TREE_TYPE (fndecl)); | |
8588 | tree res; | |
8589 | ||
8590 | /* Calculate the result when the argument is a constant. */ | |
8591 | if ((res = do_mpfr_arg1 (arg, type, func, NULL, NULL, 0))) | |
8592 | return res; | |
8593 | ||
8594 | /* Optimize expN(logN(x)) = x. */ | |
8595 | if (flag_unsafe_math_optimizations) | |
8596 | { | |
8597 | const enum built_in_function fcode = builtin_mathfn_code (arg); | |
8598 | ||
8599 | if ((func == mpfr_exp | |
8600 | && (fcode == BUILT_IN_LOG | |
8601 | || fcode == BUILT_IN_LOGF | |
8602 | || fcode == BUILT_IN_LOGL)) | |
8603 | || (func == mpfr_exp2 | |
8604 | && (fcode == BUILT_IN_LOG2 | |
8605 | || fcode == BUILT_IN_LOG2F | |
8606 | || fcode == BUILT_IN_LOG2L)) | |
8607 | || (func == mpfr_exp10 | |
8608 | && (fcode == BUILT_IN_LOG10 | |
8609 | || fcode == BUILT_IN_LOG10F | |
8610 | || fcode == BUILT_IN_LOG10L))) | |
8611 | return fold_convert_loc (loc, type, CALL_EXPR_ARG (arg, 0)); | |
8612 | } | |
8613 | } | |
8614 | ||
8615 | return NULL_TREE; | |
8616 | } | |
8617 | ||
8618 | /* Return true if VAR is a VAR_DECL or a component thereof. */ | |
8619 | ||
8620 | static bool | |
8621 | var_decl_component_p (tree var) | |
8622 | { | |
8623 | tree inner = var; | |
8624 | while (handled_component_p (inner)) | |
8625 | inner = TREE_OPERAND (inner, 0); | |
8626 | return SSA_VAR_P (inner); | |
8627 | } | |
8628 | ||
8629 | /* Fold function call to builtin memset. Return | |
8630 | NULL_TREE if no simplification can be made. */ | |
8631 | ||
8632 | static tree | |
8633 | fold_builtin_memset (location_t loc, tree dest, tree c, tree len, | |
8634 | tree type, bool ignore) | |
8635 | { | |
8636 | tree var, ret, etype; | |
8637 | unsigned HOST_WIDE_INT length, cval; | |
8638 | ||
8639 | if (! validate_arg (dest, POINTER_TYPE) | |
8640 | || ! validate_arg (c, INTEGER_TYPE) | |
8641 | || ! validate_arg (len, INTEGER_TYPE)) | |
8642 | return NULL_TREE; | |
8643 | ||
8644 | if (! host_integerp (len, 1)) | |
8645 | return NULL_TREE; | |
8646 | ||
8647 | /* If the LEN parameter is zero, return DEST. */ | |
8648 | if (integer_zerop (len)) | |
8649 | return omit_one_operand_loc (loc, type, dest, c); | |
8650 | ||
8651 | if (TREE_CODE (c) != INTEGER_CST || TREE_SIDE_EFFECTS (dest)) | |
8652 | return NULL_TREE; | |
8653 | ||
8654 | var = dest; | |
8655 | STRIP_NOPS (var); | |
8656 | if (TREE_CODE (var) != ADDR_EXPR) | |
8657 | return NULL_TREE; | |
8658 | ||
8659 | var = TREE_OPERAND (var, 0); | |
8660 | if (TREE_THIS_VOLATILE (var)) | |
8661 | return NULL_TREE; | |
8662 | ||
8663 | etype = TREE_TYPE (var); | |
8664 | if (TREE_CODE (etype) == ARRAY_TYPE) | |
8665 | etype = TREE_TYPE (etype); | |
8666 | ||
8667 | if (!INTEGRAL_TYPE_P (etype) | |
8668 | && !POINTER_TYPE_P (etype)) | |
8669 | return NULL_TREE; | |
8670 | ||
8671 | if (! var_decl_component_p (var)) | |
8672 | return NULL_TREE; | |
8673 | ||
8674 | length = tree_low_cst (len, 1); | |
8675 | if (GET_MODE_SIZE (TYPE_MODE (etype)) != length | |
8676 | || get_pointer_alignment (dest) / BITS_PER_UNIT < length) | |
8677 | return NULL_TREE; | |
8678 | ||
8679 | if (length > HOST_BITS_PER_WIDE_INT / BITS_PER_UNIT) | |
8680 | return NULL_TREE; | |
8681 | ||
8682 | if (integer_zerop (c)) | |
8683 | cval = 0; | |
8684 | else | |
8685 | { | |
8686 | if (CHAR_BIT != 8 || BITS_PER_UNIT != 8 || HOST_BITS_PER_WIDE_INT > 64) | |
8687 | return NULL_TREE; | |
8688 | ||
8689 | cval = TREE_INT_CST_LOW (c); | |
8690 | cval &= 0xff; | |
8691 | cval |= cval << 8; | |
8692 | cval |= cval << 16; | |
8693 | cval |= (cval << 31) << 1; | |
8694 | } | |
8695 | ||
8696 | ret = build_int_cst_type (etype, cval); | |
8697 | var = build_fold_indirect_ref_loc (loc, | |
8698 | fold_convert_loc (loc, | |
8699 | build_pointer_type (etype), | |
8700 | dest)); | |
8701 | ret = build2 (MODIFY_EXPR, etype, var, ret); | |
8702 | if (ignore) | |
8703 | return ret; | |
8704 | ||
8705 | return omit_one_operand_loc (loc, type, dest, ret); | |
8706 | } | |
8707 | ||
8708 | /* Fold function call to builtin memset. Return | |
8709 | NULL_TREE if no simplification can be made. */ | |
8710 | ||
8711 | static tree | |
8712 | fold_builtin_bzero (location_t loc, tree dest, tree size, bool ignore) | |
8713 | { | |
8714 | if (! validate_arg (dest, POINTER_TYPE) | |
8715 | || ! validate_arg (size, INTEGER_TYPE)) | |
8716 | return NULL_TREE; | |
8717 | ||
8718 | if (!ignore) | |
8719 | return NULL_TREE; | |
8720 | ||
8721 | /* New argument list transforming bzero(ptr x, int y) to | |
8722 | memset(ptr x, int 0, size_t y). This is done this way | |
8723 | so that if it isn't expanded inline, we fallback to | |
8724 | calling bzero instead of memset. */ | |
8725 | ||
8726 | return fold_builtin_memset (loc, dest, integer_zero_node, | |
8727 | fold_convert_loc (loc, size_type_node, size), | |
8728 | void_type_node, ignore); | |
8729 | } | |
8730 | ||
8731 | /* Fold function call to builtin mem{{,p}cpy,move}. Return | |
8732 | NULL_TREE if no simplification can be made. | |
8733 | If ENDP is 0, return DEST (like memcpy). | |
8734 | If ENDP is 1, return DEST+LEN (like mempcpy). | |
8735 | If ENDP is 2, return DEST+LEN-1 (like stpcpy). | |
8736 | If ENDP is 3, return DEST, additionally *SRC and *DEST may overlap | |
8737 | (memmove). */ | |
8738 | ||
8739 | static tree | |
8740 | fold_builtin_memory_op (location_t loc, tree dest, tree src, | |
8741 | tree len, tree type, bool ignore, int endp) | |
8742 | { | |
8743 | tree destvar, srcvar, expr; | |
8744 | ||
8745 | if (! validate_arg (dest, POINTER_TYPE) | |
8746 | || ! validate_arg (src, POINTER_TYPE) | |
8747 | || ! validate_arg (len, INTEGER_TYPE)) | |
8748 | return NULL_TREE; | |
8749 | ||
8750 | /* If the LEN parameter is zero, return DEST. */ | |
8751 | if (integer_zerop (len)) | |
8752 | return omit_one_operand_loc (loc, type, dest, src); | |
8753 | ||
8754 | /* If SRC and DEST are the same (and not volatile), return | |
8755 | DEST{,+LEN,+LEN-1}. */ | |
8756 | if (operand_equal_p (src, dest, 0)) | |
8757 | expr = len; | |
8758 | else | |
8759 | { | |
8760 | tree srctype, desttype; | |
8761 | unsigned int src_align, dest_align; | |
8762 | tree off0; | |
8763 | ||
8764 | if (endp == 3) | |
8765 | { | |
8766 | src_align = get_pointer_alignment (src); | |
8767 | dest_align = get_pointer_alignment (dest); | |
8768 | ||
8769 | /* Both DEST and SRC must be pointer types. | |
8770 | ??? This is what old code did. Is the testing for pointer types | |
8771 | really mandatory? | |
8772 | ||
8773 | If either SRC is readonly or length is 1, we can use memcpy. */ | |
8774 | if (!dest_align || !src_align) | |
8775 | return NULL_TREE; | |
8776 | if (readonly_data_expr (src) | |
8777 | || (host_integerp (len, 1) | |
8778 | && (MIN (src_align, dest_align) / BITS_PER_UNIT | |
8779 | >= (unsigned HOST_WIDE_INT) tree_low_cst (len, 1)))) | |
8780 | { | |
8781 | tree fn = builtin_decl_implicit (BUILT_IN_MEMCPY); | |
8782 | if (!fn) | |
8783 | return NULL_TREE; | |
8784 | return build_call_expr_loc (loc, fn, 3, dest, src, len); | |
8785 | } | |
8786 | ||
8787 | /* If *src and *dest can't overlap, optimize into memcpy as well. */ | |
8788 | if (TREE_CODE (src) == ADDR_EXPR | |
8789 | && TREE_CODE (dest) == ADDR_EXPR) | |
8790 | { | |
8791 | tree src_base, dest_base, fn; | |
8792 | HOST_WIDE_INT src_offset = 0, dest_offset = 0; | |
8793 | HOST_WIDE_INT size = -1; | |
8794 | HOST_WIDE_INT maxsize = -1; | |
8795 | ||
8796 | srcvar = TREE_OPERAND (src, 0); | |
8797 | src_base = get_ref_base_and_extent (srcvar, &src_offset, | |
8798 | &size, &maxsize); | |
8799 | destvar = TREE_OPERAND (dest, 0); | |
8800 | dest_base = get_ref_base_and_extent (destvar, &dest_offset, | |
8801 | &size, &maxsize); | |
8802 | if (host_integerp (len, 1)) | |
8803 | maxsize = tree_low_cst (len, 1); | |
8804 | else | |
8805 | maxsize = -1; | |
8806 | src_offset /= BITS_PER_UNIT; | |
8807 | dest_offset /= BITS_PER_UNIT; | |
8808 | if (SSA_VAR_P (src_base) | |
8809 | && SSA_VAR_P (dest_base)) | |
8810 | { | |
8811 | if (operand_equal_p (src_base, dest_base, 0) | |
8812 | && ranges_overlap_p (src_offset, maxsize, | |
8813 | dest_offset, maxsize)) | |
8814 | return NULL_TREE; | |
8815 | } | |
8816 | else if (TREE_CODE (src_base) == MEM_REF | |
8817 | && TREE_CODE (dest_base) == MEM_REF) | |
8818 | { | |
8819 | double_int off; | |
8820 | if (! operand_equal_p (TREE_OPERAND (src_base, 0), | |
8821 | TREE_OPERAND (dest_base, 0), 0)) | |
8822 | return NULL_TREE; | |
8823 | off = double_int_add (mem_ref_offset (src_base), | |
8824 | shwi_to_double_int (src_offset)); | |
8825 | if (!double_int_fits_in_shwi_p (off)) | |
8826 | return NULL_TREE; | |
8827 | src_offset = off.low; | |
8828 | off = double_int_add (mem_ref_offset (dest_base), | |
8829 | shwi_to_double_int (dest_offset)); | |
8830 | if (!double_int_fits_in_shwi_p (off)) | |
8831 | return NULL_TREE; | |
8832 | dest_offset = off.low; | |
8833 | if (ranges_overlap_p (src_offset, maxsize, | |
8834 | dest_offset, maxsize)) | |
8835 | return NULL_TREE; | |
8836 | } | |
8837 | else | |
8838 | return NULL_TREE; | |
8839 | ||
8840 | fn = builtin_decl_implicit (BUILT_IN_MEMCPY); | |
8841 | if (!fn) | |
8842 | return NULL_TREE; | |
8843 | return build_call_expr_loc (loc, fn, 3, dest, src, len); | |
8844 | } | |
8845 | ||
8846 | /* If the destination and source do not alias optimize into | |
8847 | memcpy as well. */ | |
8848 | if ((is_gimple_min_invariant (dest) | |
8849 | || TREE_CODE (dest) == SSA_NAME) | |
8850 | && (is_gimple_min_invariant (src) | |
8851 | || TREE_CODE (src) == SSA_NAME)) | |
8852 | { | |
8853 | ao_ref destr, srcr; | |
8854 | ao_ref_init_from_ptr_and_size (&destr, dest, len); | |
8855 | ao_ref_init_from_ptr_and_size (&srcr, src, len); | |
8856 | if (!refs_may_alias_p_1 (&destr, &srcr, false)) | |
8857 | { | |
8858 | tree fn; | |
8859 | fn = builtin_decl_implicit (BUILT_IN_MEMCPY); | |
8860 | if (!fn) | |
8861 | return NULL_TREE; | |
8862 | return build_call_expr_loc (loc, fn, 3, dest, src, len); | |
8863 | } | |
8864 | } | |
8865 | ||
8866 | return NULL_TREE; | |
8867 | } | |
8868 | ||
8869 | if (!host_integerp (len, 0)) | |
8870 | return NULL_TREE; | |
8871 | /* FIXME: | |
8872 | This logic lose for arguments like (type *)malloc (sizeof (type)), | |
8873 | since we strip the casts of up to VOID return value from malloc. | |
8874 | Perhaps we ought to inherit type from non-VOID argument here? */ | |
8875 | STRIP_NOPS (src); | |
8876 | STRIP_NOPS (dest); | |
8877 | if (!POINTER_TYPE_P (TREE_TYPE (src)) | |
8878 | || !POINTER_TYPE_P (TREE_TYPE (dest))) | |
8879 | return NULL_TREE; | |
8880 | /* As we fold (void *)(p + CST) to (void *)p + CST undo this here. */ | |
8881 | if (TREE_CODE (src) == POINTER_PLUS_EXPR) | |
8882 | { | |
8883 | tree tem = TREE_OPERAND (src, 0); | |
8884 | STRIP_NOPS (tem); | |
8885 | if (tem != TREE_OPERAND (src, 0)) | |
8886 | src = build1 (NOP_EXPR, TREE_TYPE (tem), src); | |
8887 | } | |
8888 | if (TREE_CODE (dest) == POINTER_PLUS_EXPR) | |
8889 | { | |
8890 | tree tem = TREE_OPERAND (dest, 0); | |
8891 | STRIP_NOPS (tem); | |
8892 | if (tem != TREE_OPERAND (dest, 0)) | |
8893 | dest = build1 (NOP_EXPR, TREE_TYPE (tem), dest); | |
8894 | } | |
8895 | srctype = TREE_TYPE (TREE_TYPE (src)); | |
8896 | if (TREE_CODE (srctype) == ARRAY_TYPE | |
8897 | && !tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len)) | |
8898 | { | |
8899 | srctype = TREE_TYPE (srctype); | |
8900 | STRIP_NOPS (src); | |
8901 | src = build1 (NOP_EXPR, build_pointer_type (srctype), src); | |
8902 | } | |
8903 | desttype = TREE_TYPE (TREE_TYPE (dest)); | |
8904 | if (TREE_CODE (desttype) == ARRAY_TYPE | |
8905 | && !tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len)) | |
8906 | { | |
8907 | desttype = TREE_TYPE (desttype); | |
8908 | STRIP_NOPS (dest); | |
8909 | dest = build1 (NOP_EXPR, build_pointer_type (desttype), dest); | |
8910 | } | |
8911 | if (TREE_ADDRESSABLE (srctype) | |
8912 | || TREE_ADDRESSABLE (desttype)) | |
8913 | return NULL_TREE; | |
8914 | ||
8915 | src_align = get_pointer_alignment (src); | |
8916 | dest_align = get_pointer_alignment (dest); | |
8917 | if (dest_align < TYPE_ALIGN (desttype) | |
8918 | || src_align < TYPE_ALIGN (srctype)) | |
8919 | return NULL_TREE; | |
8920 | ||
8921 | if (!ignore) | |
8922 | dest = builtin_save_expr (dest); | |
8923 | ||
8924 | /* Build accesses at offset zero with a ref-all character type. */ | |
8925 | off0 = build_int_cst (build_pointer_type_for_mode (char_type_node, | |
8926 | ptr_mode, true), 0); | |
8927 | ||
8928 | destvar = dest; | |
8929 | STRIP_NOPS (destvar); | |
8930 | if (TREE_CODE (destvar) == ADDR_EXPR | |
8931 | && var_decl_component_p (TREE_OPERAND (destvar, 0)) | |
8932 | && tree_int_cst_equal (TYPE_SIZE_UNIT (desttype), len)) | |
8933 | destvar = fold_build2 (MEM_REF, desttype, destvar, off0); | |
8934 | else | |
8935 | destvar = NULL_TREE; | |
8936 | ||
8937 | srcvar = src; | |
8938 | STRIP_NOPS (srcvar); | |
8939 | if (TREE_CODE (srcvar) == ADDR_EXPR | |
8940 | && var_decl_component_p (TREE_OPERAND (srcvar, 0)) | |
8941 | && tree_int_cst_equal (TYPE_SIZE_UNIT (srctype), len)) | |
8942 | { | |
8943 | if (!destvar | |
8944 | || src_align >= TYPE_ALIGN (desttype)) | |
8945 | srcvar = fold_build2 (MEM_REF, destvar ? desttype : srctype, | |
8946 | srcvar, off0); | |
8947 | else if (!STRICT_ALIGNMENT) | |
8948 | { | |
8949 | srctype = build_aligned_type (TYPE_MAIN_VARIANT (desttype), | |
8950 | src_align); | |
8951 | srcvar = fold_build2 (MEM_REF, srctype, srcvar, off0); | |
8952 | } | |
8953 | else | |
8954 | srcvar = NULL_TREE; | |
8955 | } | |
8956 | else | |
8957 | srcvar = NULL_TREE; | |
8958 | ||
8959 | if (srcvar == NULL_TREE && destvar == NULL_TREE) | |
8960 | return NULL_TREE; | |
8961 | ||
8962 | if (srcvar == NULL_TREE) | |
8963 | { | |
8964 | STRIP_NOPS (src); | |
8965 | if (src_align >= TYPE_ALIGN (desttype)) | |
8966 | srcvar = fold_build2 (MEM_REF, desttype, src, off0); | |
8967 | else | |
8968 | { | |
8969 | if (STRICT_ALIGNMENT) | |
8970 | return NULL_TREE; | |
8971 | srctype = build_aligned_type (TYPE_MAIN_VARIANT (desttype), | |
8972 | src_align); | |
8973 | srcvar = fold_build2 (MEM_REF, srctype, src, off0); | |
8974 | } | |
8975 | } | |
8976 | else if (destvar == NULL_TREE) | |
8977 | { | |
8978 | STRIP_NOPS (dest); | |
8979 | if (dest_align >= TYPE_ALIGN (srctype)) | |
8980 | destvar = fold_build2 (MEM_REF, srctype, dest, off0); | |
8981 | else | |
8982 | { | |
8983 | if (STRICT_ALIGNMENT) | |
8984 | return NULL_TREE; | |
8985 | desttype = build_aligned_type (TYPE_MAIN_VARIANT (srctype), | |
8986 | dest_align); | |
8987 | destvar = fold_build2 (MEM_REF, desttype, dest, off0); | |
8988 | } | |
8989 | } | |
8990 | ||
8991 | expr = build2 (MODIFY_EXPR, TREE_TYPE (destvar), destvar, srcvar); | |
8992 | } | |
8993 | ||
8994 | if (ignore) | |
8995 | return expr; | |
8996 | ||
8997 | if (endp == 0 || endp == 3) | |
8998 | return omit_one_operand_loc (loc, type, dest, expr); | |
8999 | ||
9000 | if (expr == len) | |
9001 | expr = NULL_TREE; | |
9002 | ||
9003 | if (endp == 2) | |
9004 | len = fold_build2_loc (loc, MINUS_EXPR, TREE_TYPE (len), len, | |
9005 | ssize_int (1)); | |
9006 | ||
9007 | dest = fold_build_pointer_plus_loc (loc, dest, len); | |
9008 | dest = fold_convert_loc (loc, type, dest); | |
9009 | if (expr) | |
9010 | dest = omit_one_operand_loc (loc, type, dest, expr); | |
9011 | return dest; | |
9012 | } | |
9013 | ||
9014 | /* Fold function call to builtin strcpy with arguments DEST and SRC. | |
9015 | If LEN is not NULL, it represents the length of the string to be | |
9016 | copied. Return NULL_TREE if no simplification can be made. */ | |
9017 | ||
9018 | tree | |
9019 | fold_builtin_strcpy (location_t loc, tree fndecl, tree dest, tree src, tree len) | |
9020 | { | |
9021 | tree fn; | |
9022 | ||
9023 | if (!validate_arg (dest, POINTER_TYPE) | |
9024 | || !validate_arg (src, POINTER_TYPE)) | |
9025 | return NULL_TREE; | |
9026 | ||
9027 | /* If SRC and DEST are the same (and not volatile), return DEST. */ | |
9028 | if (operand_equal_p (src, dest, 0)) | |
9029 | return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest); | |
9030 | ||
9031 | if (optimize_function_for_size_p (cfun)) | |
9032 | return NULL_TREE; | |
9033 | ||
9034 | fn = builtin_decl_implicit (BUILT_IN_MEMCPY); | |
9035 | if (!fn) | |
9036 | return NULL_TREE; | |
9037 | ||
9038 | if (!len) | |
9039 | { | |
9040 | len = c_strlen (src, 1); | |
9041 | if (! len || TREE_SIDE_EFFECTS (len)) | |
9042 | return NULL_TREE; | |
9043 | } | |
9044 | ||
9045 | len = fold_convert_loc (loc, size_type_node, len); | |
9046 | len = size_binop_loc (loc, PLUS_EXPR, len, build_int_cst (size_type_node, 1)); | |
9047 | return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), | |
9048 | build_call_expr_loc (loc, fn, 3, dest, src, len)); | |
9049 | } | |
9050 | ||
9051 | /* Fold function call to builtin stpcpy with arguments DEST and SRC. | |
9052 | Return NULL_TREE if no simplification can be made. */ | |
9053 | ||
9054 | static tree | |
9055 | fold_builtin_stpcpy (location_t loc, tree fndecl, tree dest, tree src) | |
9056 | { | |
9057 | tree fn, len, lenp1, call, type; | |
9058 | ||
9059 | if (!validate_arg (dest, POINTER_TYPE) | |
9060 | || !validate_arg (src, POINTER_TYPE)) | |
9061 | return NULL_TREE; | |
9062 | ||
9063 | len = c_strlen (src, 1); | |
9064 | if (!len | |
9065 | || TREE_CODE (len) != INTEGER_CST) | |
9066 | return NULL_TREE; | |
9067 | ||
9068 | if (optimize_function_for_size_p (cfun) | |
9069 | /* If length is zero it's small enough. */ | |
9070 | && !integer_zerop (len)) | |
9071 | return NULL_TREE; | |
9072 | ||
9073 | fn = builtin_decl_implicit (BUILT_IN_MEMCPY); | |
9074 | if (!fn) | |
9075 | return NULL_TREE; | |
9076 | ||
9077 | lenp1 = size_binop_loc (loc, PLUS_EXPR, | |
9078 | fold_convert_loc (loc, size_type_node, len), | |
9079 | build_int_cst (size_type_node, 1)); | |
9080 | /* We use dest twice in building our expression. Save it from | |
9081 | multiple expansions. */ | |
9082 | dest = builtin_save_expr (dest); | |
9083 | call = build_call_expr_loc (loc, fn, 3, dest, src, lenp1); | |
9084 | ||
9085 | type = TREE_TYPE (TREE_TYPE (fndecl)); | |
9086 | dest = fold_build_pointer_plus_loc (loc, dest, len); | |
9087 | dest = fold_convert_loc (loc, type, dest); | |
9088 | dest = omit_one_operand_loc (loc, type, dest, call); | |
9089 | return dest; | |
9090 | } | |
9091 | ||
9092 | /* Fold function call to builtin strncpy with arguments DEST, SRC, and LEN. | |
9093 | If SLEN is not NULL, it represents the length of the source string. | |
9094 | Return NULL_TREE if no simplification can be made. */ | |
9095 | ||
9096 | tree | |
9097 | fold_builtin_strncpy (location_t loc, tree fndecl, tree dest, | |
9098 | tree src, tree len, tree slen) | |
9099 | { | |
9100 | tree fn; | |
9101 | ||
9102 | if (!validate_arg (dest, POINTER_TYPE) | |
9103 | || !validate_arg (src, POINTER_TYPE) | |
9104 | || !validate_arg (len, INTEGER_TYPE)) | |
9105 | return NULL_TREE; | |
9106 | ||
9107 | /* If the LEN parameter is zero, return DEST. */ | |
9108 | if (integer_zerop (len)) | |
9109 | return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src); | |
9110 | ||
9111 | /* We can't compare slen with len as constants below if len is not a | |
9112 | constant. */ | |
9113 | if (len == 0 || TREE_CODE (len) != INTEGER_CST) | |
9114 | return NULL_TREE; | |
9115 | ||
9116 | if (!slen) | |
9117 | slen = c_strlen (src, 1); | |
9118 | ||
9119 | /* Now, we must be passed a constant src ptr parameter. */ | |
9120 | if (slen == 0 || TREE_CODE (slen) != INTEGER_CST) | |
9121 | return NULL_TREE; | |
9122 | ||
9123 | slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1)); | |
9124 | ||
9125 | /* We do not support simplification of this case, though we do | |
9126 | support it when expanding trees into RTL. */ | |
9127 | /* FIXME: generate a call to __builtin_memset. */ | |
9128 | if (tree_int_cst_lt (slen, len)) | |
9129 | return NULL_TREE; | |
9130 | ||
9131 | /* OK transform into builtin memcpy. */ | |
9132 | fn = builtin_decl_implicit (BUILT_IN_MEMCPY); | |
9133 | if (!fn) | |
9134 | return NULL_TREE; | |
9135 | ||
9136 | len = fold_convert_loc (loc, size_type_node, len); | |
9137 | return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), | |
9138 | build_call_expr_loc (loc, fn, 3, dest, src, len)); | |
9139 | } | |
9140 | ||
9141 | /* Fold function call to builtin memchr. ARG1, ARG2 and LEN are the | |
9142 | arguments to the call, and TYPE is its return type. | |
9143 | Return NULL_TREE if no simplification can be made. */ | |
9144 | ||
9145 | static tree | |
9146 | fold_builtin_memchr (location_t loc, tree arg1, tree arg2, tree len, tree type) | |
9147 | { | |
9148 | if (!validate_arg (arg1, POINTER_TYPE) | |
9149 | || !validate_arg (arg2, INTEGER_TYPE) | |
9150 | || !validate_arg (len, INTEGER_TYPE)) | |
9151 | return NULL_TREE; | |
9152 | else | |
9153 | { | |
9154 | const char *p1; | |
9155 | ||
9156 | if (TREE_CODE (arg2) != INTEGER_CST | |
9157 | || !host_integerp (len, 1)) | |
9158 | return NULL_TREE; | |
9159 | ||
9160 | p1 = c_getstr (arg1); | |
9161 | if (p1 && compare_tree_int (len, strlen (p1) + 1) <= 0) | |
9162 | { | |
9163 | char c; | |
9164 | const char *r; | |
9165 | tree tem; | |
9166 | ||
9167 | if (target_char_cast (arg2, &c)) | |
9168 | return NULL_TREE; | |
9169 | ||
9170 | r = (const char *) memchr (p1, c, tree_low_cst (len, 1)); | |
9171 | ||
9172 | if (r == NULL) | |
9173 | return build_int_cst (TREE_TYPE (arg1), 0); | |
9174 | ||
9175 | tem = fold_build_pointer_plus_hwi_loc (loc, arg1, r - p1); | |
9176 | return fold_convert_loc (loc, type, tem); | |
9177 | } | |
9178 | return NULL_TREE; | |
9179 | } | |
9180 | } | |
9181 | ||
9182 | /* Fold function call to builtin memcmp with arguments ARG1 and ARG2. | |
9183 | Return NULL_TREE if no simplification can be made. */ | |
9184 | ||
9185 | static tree | |
9186 | fold_builtin_memcmp (location_t loc, tree arg1, tree arg2, tree len) | |
9187 | { | |
9188 | const char *p1, *p2; | |
9189 | ||
9190 | if (!validate_arg (arg1, POINTER_TYPE) | |
9191 | || !validate_arg (arg2, POINTER_TYPE) | |
9192 | || !validate_arg (len, INTEGER_TYPE)) | |
9193 | return NULL_TREE; | |
9194 | ||
9195 | /* If the LEN parameter is zero, return zero. */ | |
9196 | if (integer_zerop (len)) | |
9197 | return omit_two_operands_loc (loc, integer_type_node, integer_zero_node, | |
9198 | arg1, arg2); | |
9199 | ||
9200 | /* If ARG1 and ARG2 are the same (and not volatile), return zero. */ | |
9201 | if (operand_equal_p (arg1, arg2, 0)) | |
9202 | return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len); | |
9203 | ||
9204 | p1 = c_getstr (arg1); | |
9205 | p2 = c_getstr (arg2); | |
9206 | ||
9207 | /* If all arguments are constant, and the value of len is not greater | |
9208 | than the lengths of arg1 and arg2, evaluate at compile-time. */ | |
9209 | if (host_integerp (len, 1) && p1 && p2 | |
9210 | && compare_tree_int (len, strlen (p1) + 1) <= 0 | |
9211 | && compare_tree_int (len, strlen (p2) + 1) <= 0) | |
9212 | { | |
9213 | const int r = memcmp (p1, p2, tree_low_cst (len, 1)); | |
9214 | ||
9215 | if (r > 0) | |
9216 | return integer_one_node; | |
9217 | else if (r < 0) | |
9218 | return integer_minus_one_node; | |
9219 | else | |
9220 | return integer_zero_node; | |
9221 | } | |
9222 | ||
9223 | /* If len parameter is one, return an expression corresponding to | |
9224 | (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */ | |
9225 | if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1) | |
9226 | { | |
9227 | tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0); | |
9228 | tree cst_uchar_ptr_node | |
9229 | = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true); | |
9230 | ||
9231 | tree ind1 | |
9232 | = fold_convert_loc (loc, integer_type_node, | |
9233 | build1 (INDIRECT_REF, cst_uchar_node, | |
9234 | fold_convert_loc (loc, | |
9235 | cst_uchar_ptr_node, | |
9236 | arg1))); | |
9237 | tree ind2 | |
9238 | = fold_convert_loc (loc, integer_type_node, | |
9239 | build1 (INDIRECT_REF, cst_uchar_node, | |
9240 | fold_convert_loc (loc, | |
9241 | cst_uchar_ptr_node, | |
9242 | arg2))); | |
9243 | return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2); | |
9244 | } | |
9245 | ||
9246 | return NULL_TREE; | |
9247 | } | |
9248 | ||
9249 | /* Fold function call to builtin strcmp with arguments ARG1 and ARG2. | |
9250 | Return NULL_TREE if no simplification can be made. */ | |
9251 | ||
9252 | static tree | |
9253 | fold_builtin_strcmp (location_t loc, tree arg1, tree arg2) | |
9254 | { | |
9255 | const char *p1, *p2; | |
9256 | ||
9257 | if (!validate_arg (arg1, POINTER_TYPE) | |
9258 | || !validate_arg (arg2, POINTER_TYPE)) | |
9259 | return NULL_TREE; | |
9260 | ||
9261 | /* If ARG1 and ARG2 are the same (and not volatile), return zero. */ | |
9262 | if (operand_equal_p (arg1, arg2, 0)) | |
9263 | return integer_zero_node; | |
9264 | ||
9265 | p1 = c_getstr (arg1); | |
9266 | p2 = c_getstr (arg2); | |
9267 | ||
9268 | if (p1 && p2) | |
9269 | { | |
9270 | const int i = strcmp (p1, p2); | |
9271 | if (i < 0) | |
9272 | return integer_minus_one_node; | |
9273 | else if (i > 0) | |
9274 | return integer_one_node; | |
9275 | else | |
9276 | return integer_zero_node; | |
9277 | } | |
9278 | ||
9279 | /* If the second arg is "", return *(const unsigned char*)arg1. */ | |
9280 | if (p2 && *p2 == '\0') | |
9281 | { | |
9282 | tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0); | |
9283 | tree cst_uchar_ptr_node | |
9284 | = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true); | |
9285 | ||
9286 | return fold_convert_loc (loc, integer_type_node, | |
9287 | build1 (INDIRECT_REF, cst_uchar_node, | |
9288 | fold_convert_loc (loc, | |
9289 | cst_uchar_ptr_node, | |
9290 | arg1))); | |
9291 | } | |
9292 | ||
9293 | /* If the first arg is "", return -*(const unsigned char*)arg2. */ | |
9294 | if (p1 && *p1 == '\0') | |
9295 | { | |
9296 | tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0); | |
9297 | tree cst_uchar_ptr_node | |
9298 | = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true); | |
9299 | ||
9300 | tree temp | |
9301 | = fold_convert_loc (loc, integer_type_node, | |
9302 | build1 (INDIRECT_REF, cst_uchar_node, | |
9303 | fold_convert_loc (loc, | |
9304 | cst_uchar_ptr_node, | |
9305 | arg2))); | |
9306 | return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp); | |
9307 | } | |
9308 | ||
9309 | return NULL_TREE; | |
9310 | } | |
9311 | ||
9312 | /* Fold function call to builtin strncmp with arguments ARG1, ARG2, and LEN. | |
9313 | Return NULL_TREE if no simplification can be made. */ | |
9314 | ||
9315 | static tree | |
9316 | fold_builtin_strncmp (location_t loc, tree arg1, tree arg2, tree len) | |
9317 | { | |
9318 | const char *p1, *p2; | |
9319 | ||
9320 | if (!validate_arg (arg1, POINTER_TYPE) | |
9321 | || !validate_arg (arg2, POINTER_TYPE) | |
9322 | || !validate_arg (len, INTEGER_TYPE)) | |
9323 | return NULL_TREE; | |
9324 | ||
9325 | /* If the LEN parameter is zero, return zero. */ | |
9326 | if (integer_zerop (len)) | |
9327 | return omit_two_operands_loc (loc, integer_type_node, integer_zero_node, | |
9328 | arg1, arg2); | |
9329 | ||
9330 | /* If ARG1 and ARG2 are the same (and not volatile), return zero. */ | |
9331 | if (operand_equal_p (arg1, arg2, 0)) | |
9332 | return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len); | |
9333 | ||
9334 | p1 = c_getstr (arg1); | |
9335 | p2 = c_getstr (arg2); | |
9336 | ||
9337 | if (host_integerp (len, 1) && p1 && p2) | |
9338 | { | |
9339 | const int i = strncmp (p1, p2, tree_low_cst (len, 1)); | |
9340 | if (i > 0) | |
9341 | return integer_one_node; | |
9342 | else if (i < 0) | |
9343 | return integer_minus_one_node; | |
9344 | else | |
9345 | return integer_zero_node; | |
9346 | } | |
9347 | ||
9348 | /* If the second arg is "", and the length is greater than zero, | |
9349 | return *(const unsigned char*)arg1. */ | |
9350 | if (p2 && *p2 == '\0' | |
9351 | && TREE_CODE (len) == INTEGER_CST | |
9352 | && tree_int_cst_sgn (len) == 1) | |
9353 | { | |
9354 | tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0); | |
9355 | tree cst_uchar_ptr_node | |
9356 | = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true); | |
9357 | ||
9358 | return fold_convert_loc (loc, integer_type_node, | |
9359 | build1 (INDIRECT_REF, cst_uchar_node, | |
9360 | fold_convert_loc (loc, | |
9361 | cst_uchar_ptr_node, | |
9362 | arg1))); | |
9363 | } | |
9364 | ||
9365 | /* If the first arg is "", and the length is greater than zero, | |
9366 | return -*(const unsigned char*)arg2. */ | |
9367 | if (p1 && *p1 == '\0' | |
9368 | && TREE_CODE (len) == INTEGER_CST | |
9369 | && tree_int_cst_sgn (len) == 1) | |
9370 | { | |
9371 | tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0); | |
9372 | tree cst_uchar_ptr_node | |
9373 | = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true); | |
9374 | ||
9375 | tree temp = fold_convert_loc (loc, integer_type_node, | |
9376 | build1 (INDIRECT_REF, cst_uchar_node, | |
9377 | fold_convert_loc (loc, | |
9378 | cst_uchar_ptr_node, | |
9379 | arg2))); | |
9380 | return fold_build1_loc (loc, NEGATE_EXPR, integer_type_node, temp); | |
9381 | } | |
9382 | ||
9383 | /* If len parameter is one, return an expression corresponding to | |
9384 | (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */ | |
9385 | if (host_integerp (len, 1) && tree_low_cst (len, 1) == 1) | |
9386 | { | |
9387 | tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0); | |
9388 | tree cst_uchar_ptr_node | |
9389 | = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true); | |
9390 | ||
9391 | tree ind1 = fold_convert_loc (loc, integer_type_node, | |
9392 | build1 (INDIRECT_REF, cst_uchar_node, | |
9393 | fold_convert_loc (loc, | |
9394 | cst_uchar_ptr_node, | |
9395 | arg1))); | |
9396 | tree ind2 = fold_convert_loc (loc, integer_type_node, | |
9397 | build1 (INDIRECT_REF, cst_uchar_node, | |
9398 | fold_convert_loc (loc, | |
9399 | cst_uchar_ptr_node, | |
9400 | arg2))); | |
9401 | return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2); | |
9402 | } | |
9403 | ||
9404 | return NULL_TREE; | |
9405 | } | |
9406 | ||
9407 | /* Fold function call to builtin signbit, signbitf or signbitl with argument | |
9408 | ARG. Return NULL_TREE if no simplification can be made. */ | |
9409 | ||
9410 | static tree | |
9411 | fold_builtin_signbit (location_t loc, tree arg, tree type) | |
9412 | { | |
9413 | if (!validate_arg (arg, REAL_TYPE)) | |
9414 | return NULL_TREE; | |
9415 | ||
9416 | /* If ARG is a compile-time constant, determine the result. */ | |
9417 | if (TREE_CODE (arg) == REAL_CST | |
9418 | && !TREE_OVERFLOW (arg)) | |
9419 | { | |
9420 | REAL_VALUE_TYPE c; | |
9421 | ||
9422 | c = TREE_REAL_CST (arg); | |
9423 | return (REAL_VALUE_NEGATIVE (c) | |
9424 | ? build_one_cst (type) | |
9425 | : build_zero_cst (type)); | |
9426 | } | |
9427 | ||
9428 | /* If ARG is non-negative, the result is always zero. */ | |
9429 | if (tree_expr_nonnegative_p (arg)) | |
9430 | return omit_one_operand_loc (loc, type, integer_zero_node, arg); | |
9431 | ||
9432 | /* If ARG's format doesn't have signed zeros, return "arg < 0.0". */ | |
9433 | if (!HONOR_SIGNED_ZEROS (TYPE_MODE (TREE_TYPE (arg)))) | |
9434 | return fold_convert (type, | |
9435 | fold_build2_loc (loc, LT_EXPR, boolean_type_node, arg, | |
9436 | build_real (TREE_TYPE (arg), dconst0))); | |
9437 | ||
9438 | return NULL_TREE; | |
9439 | } | |
9440 | ||
9441 | /* Fold function call to builtin copysign, copysignf or copysignl with | |
9442 | arguments ARG1 and ARG2. Return NULL_TREE if no simplification can | |
9443 | be made. */ | |
9444 | ||
9445 | static tree | |
9446 | fold_builtin_copysign (location_t loc, tree fndecl, | |
9447 | tree arg1, tree arg2, tree type) | |
9448 | { | |
9449 | tree tem; | |
9450 | ||
9451 | if (!validate_arg (arg1, REAL_TYPE) | |
9452 | || !validate_arg (arg2, REAL_TYPE)) | |
9453 | return NULL_TREE; | |
9454 | ||
9455 | /* copysign(X,X) is X. */ | |
9456 | if (operand_equal_p (arg1, arg2, 0)) | |
9457 | return fold_convert_loc (loc, type, arg1); | |
9458 | ||
9459 | /* If ARG1 and ARG2 are compile-time constants, determine the result. */ | |
9460 | if (TREE_CODE (arg1) == REAL_CST | |
9461 | && TREE_CODE (arg2) == REAL_CST | |
9462 | && !TREE_OVERFLOW (arg1) | |
9463 | && !TREE_OVERFLOW (arg2)) | |
9464 | { | |
9465 | REAL_VALUE_TYPE c1, c2; | |
9466 | ||
9467 | c1 = TREE_REAL_CST (arg1); | |
9468 | c2 = TREE_REAL_CST (arg2); | |
9469 | /* c1.sign := c2.sign. */ | |
9470 | real_copysign (&c1, &c2); | |
9471 | return build_real (type, c1); | |
9472 | } | |
9473 | ||
9474 | /* copysign(X, Y) is fabs(X) when Y is always non-negative. | |
9475 | Remember to evaluate Y for side-effects. */ | |
9476 | if (tree_expr_nonnegative_p (arg2)) | |
9477 | return omit_one_operand_loc (loc, type, | |
9478 | fold_build1_loc (loc, ABS_EXPR, type, arg1), | |
9479 | arg2); | |
9480 | ||
9481 | /* Strip sign changing operations for the first argument. */ | |
9482 | tem = fold_strip_sign_ops (arg1); | |
9483 | if (tem) | |
9484 | return build_call_expr_loc (loc, fndecl, 2, tem, arg2); | |
9485 | ||
9486 | return NULL_TREE; | |
9487 | } | |
9488 | ||
9489 | /* Fold a call to builtin isascii with argument ARG. */ | |
9490 | ||
9491 | static tree | |
9492 | fold_builtin_isascii (location_t loc, tree arg) | |
9493 | { | |
9494 | if (!validate_arg (arg, INTEGER_TYPE)) | |
9495 | return NULL_TREE; | |
9496 | else | |
9497 | { | |
9498 | /* Transform isascii(c) -> ((c & ~0x7f) == 0). */ | |
9499 | arg = fold_build2 (BIT_AND_EXPR, integer_type_node, arg, | |
9500 | build_int_cst (integer_type_node, | |
9501 | ~ (unsigned HOST_WIDE_INT) 0x7f)); | |
9502 | return fold_build2_loc (loc, EQ_EXPR, integer_type_node, | |
9503 | arg, integer_zero_node); | |
9504 | } | |
9505 | } | |
9506 | ||
9507 | /* Fold a call to builtin toascii with argument ARG. */ | |
9508 | ||
9509 | static tree | |
9510 | fold_builtin_toascii (location_t loc, tree arg) | |
9511 | { | |
9512 | if (!validate_arg (arg, INTEGER_TYPE)) | |
9513 | return NULL_TREE; | |
9514 | ||
9515 | /* Transform toascii(c) -> (c & 0x7f). */ | |
9516 | return fold_build2_loc (loc, BIT_AND_EXPR, integer_type_node, arg, | |
9517 | build_int_cst (integer_type_node, 0x7f)); | |
9518 | } | |
9519 | ||
9520 | /* Fold a call to builtin isdigit with argument ARG. */ | |
9521 | ||
9522 | static tree | |
9523 | fold_builtin_isdigit (location_t loc, tree arg) | |
9524 | { | |
9525 | if (!validate_arg (arg, INTEGER_TYPE)) | |
9526 | return NULL_TREE; | |
9527 | else | |
9528 | { | |
9529 | /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */ | |
9530 | /* According to the C standard, isdigit is unaffected by locale. | |
9531 | However, it definitely is affected by the target character set. */ | |
9532 | unsigned HOST_WIDE_INT target_digit0 | |
9533 | = lang_hooks.to_target_charset ('0'); | |
9534 | ||
9535 | if (target_digit0 == 0) | |
9536 | return NULL_TREE; | |
9537 | ||
9538 | arg = fold_convert_loc (loc, unsigned_type_node, arg); | |
9539 | arg = fold_build2 (MINUS_EXPR, unsigned_type_node, arg, | |
9540 | build_int_cst (unsigned_type_node, target_digit0)); | |
9541 | return fold_build2_loc (loc, LE_EXPR, integer_type_node, arg, | |
9542 | build_int_cst (unsigned_type_node, 9)); | |
9543 | } | |
9544 | } | |
9545 | ||
9546 | /* Fold a call to fabs, fabsf or fabsl with argument ARG. */ | |
9547 | ||
9548 | static tree | |
9549 | fold_builtin_fabs (location_t loc, tree arg, tree type) | |
9550 | { | |
9551 | if (!validate_arg (arg, REAL_TYPE)) | |
9552 | return NULL_TREE; | |
9553 | ||
9554 | arg = fold_convert_loc (loc, type, arg); | |
9555 | if (TREE_CODE (arg) == REAL_CST) | |
9556 | return fold_abs_const (arg, type); | |
9557 | return fold_build1_loc (loc, ABS_EXPR, type, arg); | |
9558 | } | |
9559 | ||
9560 | /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */ | |
9561 | ||
9562 | static tree | |
9563 | fold_builtin_abs (location_t loc, tree arg, tree type) | |
9564 | { | |
9565 | if (!validate_arg (arg, INTEGER_TYPE)) | |
9566 | return NULL_TREE; | |
9567 | ||
9568 | arg = fold_convert_loc (loc, type, arg); | |
9569 | if (TREE_CODE (arg) == INTEGER_CST) | |
9570 | return fold_abs_const (arg, type); | |
9571 | return fold_build1_loc (loc, ABS_EXPR, type, arg); | |
9572 | } | |
9573 | ||
9574 | /* Fold a fma operation with arguments ARG[012]. */ | |
9575 | ||
9576 | tree | |
9577 | fold_fma (location_t loc ATTRIBUTE_UNUSED, | |
9578 | tree type, tree arg0, tree arg1, tree arg2) | |
9579 | { | |
9580 | if (TREE_CODE (arg0) == REAL_CST | |
9581 | && TREE_CODE (arg1) == REAL_CST | |
9582 | && TREE_CODE (arg2) == REAL_CST) | |
9583 | return do_mpfr_arg3 (arg0, arg1, arg2, type, mpfr_fma); | |
9584 | ||
9585 | return NULL_TREE; | |
9586 | } | |
9587 | ||
9588 | /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */ | |
9589 | ||
9590 | static tree | |
9591 | fold_builtin_fma (location_t loc, tree arg0, tree arg1, tree arg2, tree type) | |
9592 | { | |
9593 | if (validate_arg (arg0, REAL_TYPE) | |
9594 | && validate_arg(arg1, REAL_TYPE) | |
9595 | && validate_arg(arg2, REAL_TYPE)) | |
9596 | { | |
9597 | tree tem = fold_fma (loc, type, arg0, arg1, arg2); | |
9598 | if (tem) | |
9599 | return tem; | |
9600 | ||
9601 | /* ??? Only expand to FMA_EXPR if it's directly supported. */ | |
9602 | if (optab_handler (fma_optab, TYPE_MODE (type)) != CODE_FOR_nothing) | |
9603 | return fold_build3_loc (loc, FMA_EXPR, type, arg0, arg1, arg2); | |
9604 | } | |
9605 | return NULL_TREE; | |
9606 | } | |
9607 | ||
9608 | /* Fold a call to builtin fmin or fmax. */ | |
9609 | ||
9610 | static tree | |
9611 | fold_builtin_fmin_fmax (location_t loc, tree arg0, tree arg1, | |
9612 | tree type, bool max) | |
9613 | { | |
9614 | if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, REAL_TYPE)) | |
9615 | { | |
9616 | /* Calculate the result when the argument is a constant. */ | |
9617 | tree res = do_mpfr_arg2 (arg0, arg1, type, (max ? mpfr_max : mpfr_min)); | |
9618 | ||
9619 | if (res) | |
9620 | return res; | |
9621 | ||
9622 | /* If either argument is NaN, return the other one. Avoid the | |
9623 | transformation if we get (and honor) a signalling NaN. Using | |
9624 | omit_one_operand() ensures we create a non-lvalue. */ | |
9625 | if (TREE_CODE (arg0) == REAL_CST | |
9626 | && real_isnan (&TREE_REAL_CST (arg0)) | |
9627 | && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg0))) | |
9628 | || ! TREE_REAL_CST (arg0).signalling)) | |
9629 | return omit_one_operand_loc (loc, type, arg1, arg0); | |
9630 | if (TREE_CODE (arg1) == REAL_CST | |
9631 | && real_isnan (&TREE_REAL_CST (arg1)) | |
9632 | && (! HONOR_SNANS (TYPE_MODE (TREE_TYPE (arg1))) | |
9633 | || ! TREE_REAL_CST (arg1).signalling)) | |
9634 | return omit_one_operand_loc (loc, type, arg0, arg1); | |
9635 | ||
9636 | /* Transform fmin/fmax(x,x) -> x. */ | |
9637 | if (operand_equal_p (arg0, arg1, OEP_PURE_SAME)) | |
9638 | return omit_one_operand_loc (loc, type, arg0, arg1); | |
9639 | ||
9640 | /* Convert fmin/fmax to MIN_EXPR/MAX_EXPR. C99 requires these | |
9641 | functions to return the numeric arg if the other one is NaN. | |
9642 | These tree codes don't honor that, so only transform if | |
9643 | -ffinite-math-only is set. C99 doesn't require -0.0 to be | |
9644 | handled, so we don't have to worry about it either. */ | |
9645 | if (flag_finite_math_only) | |
9646 | return fold_build2_loc (loc, (max ? MAX_EXPR : MIN_EXPR), type, | |
9647 | fold_convert_loc (loc, type, arg0), | |
9648 | fold_convert_loc (loc, type, arg1)); | |
9649 | } | |
9650 | return NULL_TREE; | |
9651 | } | |
9652 | ||
9653 | /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */ | |
9654 | ||
9655 | static tree | |
9656 | fold_builtin_carg (location_t loc, tree arg, tree type) | |
9657 | { | |
9658 | if (validate_arg (arg, COMPLEX_TYPE) | |
9659 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE) | |
9660 | { | |
9661 | tree atan2_fn = mathfn_built_in (type, BUILT_IN_ATAN2); | |
9662 | ||
9663 | if (atan2_fn) | |
9664 | { | |
9665 | tree new_arg = builtin_save_expr (arg); | |
9666 | tree r_arg = fold_build1_loc (loc, REALPART_EXPR, type, new_arg); | |
9667 | tree i_arg = fold_build1_loc (loc, IMAGPART_EXPR, type, new_arg); | |
9668 | return build_call_expr_loc (loc, atan2_fn, 2, i_arg, r_arg); | |
9669 | } | |
9670 | } | |
9671 | ||
9672 | return NULL_TREE; | |
9673 | } | |
9674 | ||
9675 | /* Fold a call to builtin logb/ilogb. */ | |
9676 | ||
9677 | static tree | |
9678 | fold_builtin_logb (location_t loc, tree arg, tree rettype) | |
9679 | { | |
9680 | if (! validate_arg (arg, REAL_TYPE)) | |
9681 | return NULL_TREE; | |
9682 | ||
9683 | STRIP_NOPS (arg); | |
9684 | ||
9685 | if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg)) | |
9686 | { | |
9687 | const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg); | |
9688 | ||
9689 | switch (value->cl) | |
9690 | { | |
9691 | case rvc_nan: | |
9692 | case rvc_inf: | |
9693 | /* If arg is Inf or NaN and we're logb, return it. */ | |
9694 | if (TREE_CODE (rettype) == REAL_TYPE) | |
95d28233 JM |
9695 | { |
9696 | /* For logb(-Inf) we have to return +Inf. */ | |
9697 | if (real_isinf (value) && real_isneg (value)) | |
9698 | { | |
9699 | REAL_VALUE_TYPE tem; | |
9700 | real_inf (&tem); | |
9701 | return build_real (rettype, tem); | |
9702 | } | |
9703 | return fold_convert_loc (loc, rettype, arg); | |
9704 | } | |
e4b17023 JM |
9705 | /* Fall through... */ |
9706 | case rvc_zero: | |
9707 | /* Zero may set errno and/or raise an exception for logb, also | |
9708 | for ilogb we don't know FP_ILOGB0. */ | |
9709 | return NULL_TREE; | |
9710 | case rvc_normal: | |
9711 | /* For normal numbers, proceed iff radix == 2. In GCC, | |
9712 | normalized significands are in the range [0.5, 1.0). We | |
9713 | want the exponent as if they were [1.0, 2.0) so get the | |
9714 | exponent and subtract 1. */ | |
9715 | if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2) | |
9716 | return fold_convert_loc (loc, rettype, | |
9717 | build_int_cst (integer_type_node, | |
9718 | REAL_EXP (value)-1)); | |
9719 | break; | |
9720 | } | |
9721 | } | |
9722 | ||
9723 | return NULL_TREE; | |
9724 | } | |
9725 | ||
9726 | /* Fold a call to builtin significand, if radix == 2. */ | |
9727 | ||
9728 | static tree | |
9729 | fold_builtin_significand (location_t loc, tree arg, tree rettype) | |
9730 | { | |
9731 | if (! validate_arg (arg, REAL_TYPE)) | |
9732 | return NULL_TREE; | |
9733 | ||
9734 | STRIP_NOPS (arg); | |
9735 | ||
9736 | if (TREE_CODE (arg) == REAL_CST && ! TREE_OVERFLOW (arg)) | |
9737 | { | |
9738 | const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg); | |
9739 | ||
9740 | switch (value->cl) | |
9741 | { | |
9742 | case rvc_zero: | |
9743 | case rvc_nan: | |
9744 | case rvc_inf: | |
9745 | /* If arg is +-0, +-Inf or +-NaN, then return it. */ | |
9746 | return fold_convert_loc (loc, rettype, arg); | |
9747 | case rvc_normal: | |
9748 | /* For normal numbers, proceed iff radix == 2. */ | |
9749 | if (REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (arg)))->b == 2) | |
9750 | { | |
9751 | REAL_VALUE_TYPE result = *value; | |
9752 | /* In GCC, normalized significands are in the range [0.5, | |
9753 | 1.0). We want them to be [1.0, 2.0) so set the | |
9754 | exponent to 1. */ | |
9755 | SET_REAL_EXP (&result, 1); | |
9756 | return build_real (rettype, result); | |
9757 | } | |
9758 | break; | |
9759 | } | |
9760 | } | |
9761 | ||
9762 | return NULL_TREE; | |
9763 | } | |
9764 | ||
9765 | /* Fold a call to builtin frexp, we can assume the base is 2. */ | |
9766 | ||
9767 | static tree | |
9768 | fold_builtin_frexp (location_t loc, tree arg0, tree arg1, tree rettype) | |
9769 | { | |
9770 | if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE)) | |
9771 | return NULL_TREE; | |
9772 | ||
9773 | STRIP_NOPS (arg0); | |
9774 | ||
9775 | if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0))) | |
9776 | return NULL_TREE; | |
9777 | ||
9778 | arg1 = build_fold_indirect_ref_loc (loc, arg1); | |
9779 | ||
9780 | /* Proceed if a valid pointer type was passed in. */ | |
9781 | if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == integer_type_node) | |
9782 | { | |
9783 | const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0); | |
9784 | tree frac, exp; | |
9785 | ||
9786 | switch (value->cl) | |
9787 | { | |
9788 | case rvc_zero: | |
9789 | /* For +-0, return (*exp = 0, +-0). */ | |
9790 | exp = integer_zero_node; | |
9791 | frac = arg0; | |
9792 | break; | |
9793 | case rvc_nan: | |
9794 | case rvc_inf: | |
9795 | /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */ | |
9796 | return omit_one_operand_loc (loc, rettype, arg0, arg1); | |
9797 | case rvc_normal: | |
9798 | { | |
9799 | /* Since the frexp function always expects base 2, and in | |
9800 | GCC normalized significands are already in the range | |
9801 | [0.5, 1.0), we have exactly what frexp wants. */ | |
9802 | REAL_VALUE_TYPE frac_rvt = *value; | |
9803 | SET_REAL_EXP (&frac_rvt, 0); | |
9804 | frac = build_real (rettype, frac_rvt); | |
9805 | exp = build_int_cst (integer_type_node, REAL_EXP (value)); | |
9806 | } | |
9807 | break; | |
9808 | default: | |
9809 | gcc_unreachable (); | |
9810 | } | |
9811 | ||
9812 | /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */ | |
9813 | arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1, exp); | |
9814 | TREE_SIDE_EFFECTS (arg1) = 1; | |
9815 | return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1, frac); | |
9816 | } | |
9817 | ||
9818 | return NULL_TREE; | |
9819 | } | |
9820 | ||
9821 | /* Fold a call to builtin ldexp or scalbn/scalbln. If LDEXP is true | |
9822 | then we can assume the base is two. If it's false, then we have to | |
9823 | check the mode of the TYPE parameter in certain cases. */ | |
9824 | ||
9825 | static tree | |
9826 | fold_builtin_load_exponent (location_t loc, tree arg0, tree arg1, | |
9827 | tree type, bool ldexp) | |
9828 | { | |
9829 | if (validate_arg (arg0, REAL_TYPE) && validate_arg (arg1, INTEGER_TYPE)) | |
9830 | { | |
9831 | STRIP_NOPS (arg0); | |
9832 | STRIP_NOPS (arg1); | |
9833 | ||
9834 | /* If arg0 is 0, Inf or NaN, or if arg1 is 0, then return arg0. */ | |
9835 | if (real_zerop (arg0) || integer_zerop (arg1) | |
9836 | || (TREE_CODE (arg0) == REAL_CST | |
9837 | && !real_isfinite (&TREE_REAL_CST (arg0)))) | |
9838 | return omit_one_operand_loc (loc, type, arg0, arg1); | |
9839 | ||
9840 | /* If both arguments are constant, then try to evaluate it. */ | |
9841 | if ((ldexp || REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2) | |
9842 | && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0) | |
9843 | && host_integerp (arg1, 0)) | |
9844 | { | |
9845 | /* Bound the maximum adjustment to twice the range of the | |
9846 | mode's valid exponents. Use abs to ensure the range is | |
9847 | positive as a sanity check. */ | |
9848 | const long max_exp_adj = 2 * | |
9849 | labs (REAL_MODE_FORMAT (TYPE_MODE (type))->emax | |
9850 | - REAL_MODE_FORMAT (TYPE_MODE (type))->emin); | |
9851 | ||
9852 | /* Get the user-requested adjustment. */ | |
9853 | const HOST_WIDE_INT req_exp_adj = tree_low_cst (arg1, 0); | |
9854 | ||
9855 | /* The requested adjustment must be inside this range. This | |
9856 | is a preliminary cap to avoid things like overflow, we | |
9857 | may still fail to compute the result for other reasons. */ | |
9858 | if (-max_exp_adj < req_exp_adj && req_exp_adj < max_exp_adj) | |
9859 | { | |
9860 | REAL_VALUE_TYPE initial_result; | |
9861 | ||
9862 | real_ldexp (&initial_result, &TREE_REAL_CST (arg0), req_exp_adj); | |
9863 | ||
9864 | /* Ensure we didn't overflow. */ | |
9865 | if (! real_isinf (&initial_result)) | |
9866 | { | |
9867 | const REAL_VALUE_TYPE trunc_result | |
9868 | = real_value_truncate (TYPE_MODE (type), initial_result); | |
9869 | ||
9870 | /* Only proceed if the target mode can hold the | |
9871 | resulting value. */ | |
9872 | if (REAL_VALUES_EQUAL (initial_result, trunc_result)) | |
9873 | return build_real (type, trunc_result); | |
9874 | } | |
9875 | } | |
9876 | } | |
9877 | } | |
9878 | ||
9879 | return NULL_TREE; | |
9880 | } | |
9881 | ||
9882 | /* Fold a call to builtin modf. */ | |
9883 | ||
9884 | static tree | |
9885 | fold_builtin_modf (location_t loc, tree arg0, tree arg1, tree rettype) | |
9886 | { | |
9887 | if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE)) | |
9888 | return NULL_TREE; | |
9889 | ||
9890 | STRIP_NOPS (arg0); | |
9891 | ||
9892 | if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0))) | |
9893 | return NULL_TREE; | |
9894 | ||
9895 | arg1 = build_fold_indirect_ref_loc (loc, arg1); | |
9896 | ||
9897 | /* Proceed if a valid pointer type was passed in. */ | |
9898 | if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == TYPE_MAIN_VARIANT (rettype)) | |
9899 | { | |
9900 | const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0); | |
9901 | REAL_VALUE_TYPE trunc, frac; | |
9902 | ||
9903 | switch (value->cl) | |
9904 | { | |
9905 | case rvc_nan: | |
9906 | case rvc_zero: | |
9907 | /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */ | |
9908 | trunc = frac = *value; | |
9909 | break; | |
9910 | case rvc_inf: | |
9911 | /* For +-Inf, return (*arg1 = arg0, +-0). */ | |
9912 | frac = dconst0; | |
9913 | frac.sign = value->sign; | |
9914 | trunc = *value; | |
9915 | break; | |
9916 | case rvc_normal: | |
9917 | /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */ | |
9918 | real_trunc (&trunc, VOIDmode, value); | |
9919 | real_arithmetic (&frac, MINUS_EXPR, value, &trunc); | |
9920 | /* If the original number was negative and already | |
9921 | integral, then the fractional part is -0.0. */ | |
9922 | if (value->sign && frac.cl == rvc_zero) | |
9923 | frac.sign = value->sign; | |
9924 | break; | |
9925 | } | |
9926 | ||
9927 | /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */ | |
9928 | arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1, | |
9929 | build_real (rettype, trunc)); | |
9930 | TREE_SIDE_EFFECTS (arg1) = 1; | |
9931 | return fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1, | |
9932 | build_real (rettype, frac)); | |
9933 | } | |
9934 | ||
9935 | return NULL_TREE; | |
9936 | } | |
9937 | ||
9938 | /* Given a location LOC, an interclass builtin function decl FNDECL | |
9939 | and its single argument ARG, return an folded expression computing | |
9940 | the same, or NULL_TREE if we either couldn't or didn't want to fold | |
9941 | (the latter happen if there's an RTL instruction available). */ | |
9942 | ||
9943 | static tree | |
9944 | fold_builtin_interclass_mathfn (location_t loc, tree fndecl, tree arg) | |
9945 | { | |
9946 | enum machine_mode mode; | |
9947 | ||
9948 | if (!validate_arg (arg, REAL_TYPE)) | |
9949 | return NULL_TREE; | |
9950 | ||
9951 | if (interclass_mathfn_icode (arg, fndecl) != CODE_FOR_nothing) | |
9952 | return NULL_TREE; | |
9953 | ||
9954 | mode = TYPE_MODE (TREE_TYPE (arg)); | |
9955 | ||
9956 | /* If there is no optab, try generic code. */ | |
9957 | switch (DECL_FUNCTION_CODE (fndecl)) | |
9958 | { | |
9959 | tree result; | |
9960 | ||
9961 | CASE_FLT_FN (BUILT_IN_ISINF): | |
9962 | { | |
9963 | /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */ | |
9964 | tree const isgr_fn = builtin_decl_explicit (BUILT_IN_ISGREATER); | |
9965 | tree const type = TREE_TYPE (arg); | |
9966 | REAL_VALUE_TYPE r; | |
9967 | char buf[128]; | |
9968 | ||
9969 | get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf)); | |
9970 | real_from_string (&r, buf); | |
9971 | result = build_call_expr (isgr_fn, 2, | |
9972 | fold_build1_loc (loc, ABS_EXPR, type, arg), | |
9973 | build_real (type, r)); | |
9974 | return result; | |
9975 | } | |
9976 | CASE_FLT_FN (BUILT_IN_FINITE): | |
9977 | case BUILT_IN_ISFINITE: | |
9978 | { | |
9979 | /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */ | |
9980 | tree const isle_fn = builtin_decl_explicit (BUILT_IN_ISLESSEQUAL); | |
9981 | tree const type = TREE_TYPE (arg); | |
9982 | REAL_VALUE_TYPE r; | |
9983 | char buf[128]; | |
9984 | ||
9985 | get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf)); | |
9986 | real_from_string (&r, buf); | |
9987 | result = build_call_expr (isle_fn, 2, | |
9988 | fold_build1_loc (loc, ABS_EXPR, type, arg), | |
9989 | build_real (type, r)); | |
9990 | /*result = fold_build2_loc (loc, UNGT_EXPR, | |
9991 | TREE_TYPE (TREE_TYPE (fndecl)), | |
9992 | fold_build1_loc (loc, ABS_EXPR, type, arg), | |
9993 | build_real (type, r)); | |
9994 | result = fold_build1_loc (loc, TRUTH_NOT_EXPR, | |
9995 | TREE_TYPE (TREE_TYPE (fndecl)), | |
9996 | result);*/ | |
9997 | return result; | |
9998 | } | |
9999 | case BUILT_IN_ISNORMAL: | |
10000 | { | |
10001 | /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) & | |
10002 | islessequal(fabs(x),DBL_MAX). */ | |
10003 | tree const isle_fn = builtin_decl_explicit (BUILT_IN_ISLESSEQUAL); | |
10004 | tree const isge_fn = builtin_decl_explicit (BUILT_IN_ISGREATEREQUAL); | |
10005 | tree const type = TREE_TYPE (arg); | |
10006 | REAL_VALUE_TYPE rmax, rmin; | |
10007 | char buf[128]; | |
10008 | ||
10009 | get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf)); | |
10010 | real_from_string (&rmax, buf); | |
10011 | sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1); | |
10012 | real_from_string (&rmin, buf); | |
10013 | arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg)); | |
10014 | result = build_call_expr (isle_fn, 2, arg, | |
10015 | build_real (type, rmax)); | |
10016 | result = fold_build2 (BIT_AND_EXPR, integer_type_node, result, | |
10017 | build_call_expr (isge_fn, 2, arg, | |
10018 | build_real (type, rmin))); | |
10019 | return result; | |
10020 | } | |
10021 | default: | |
10022 | break; | |
10023 | } | |
10024 | ||
10025 | return NULL_TREE; | |
10026 | } | |
10027 | ||
10028 | /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite. | |
10029 | ARG is the argument for the call. */ | |
10030 | ||
10031 | static tree | |
10032 | fold_builtin_classify (location_t loc, tree fndecl, tree arg, int builtin_index) | |
10033 | { | |
10034 | tree type = TREE_TYPE (TREE_TYPE (fndecl)); | |
10035 | REAL_VALUE_TYPE r; | |
10036 | ||
10037 | if (!validate_arg (arg, REAL_TYPE)) | |
10038 | return NULL_TREE; | |
10039 | ||
10040 | switch (builtin_index) | |
10041 | { | |
10042 | case BUILT_IN_ISINF: | |
10043 | if (!HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg)))) | |
10044 | return omit_one_operand_loc (loc, type, integer_zero_node, arg); | |
10045 | ||
10046 | if (TREE_CODE (arg) == REAL_CST) | |
10047 | { | |
10048 | r = TREE_REAL_CST (arg); | |
10049 | if (real_isinf (&r)) | |
10050 | return real_compare (GT_EXPR, &r, &dconst0) | |
10051 | ? integer_one_node : integer_minus_one_node; | |
10052 | else | |
10053 | return integer_zero_node; | |
10054 | } | |
10055 | ||
10056 | return NULL_TREE; | |
10057 | ||
10058 | case BUILT_IN_ISINF_SIGN: | |
10059 | { | |
10060 | /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */ | |
10061 | /* In a boolean context, GCC will fold the inner COND_EXPR to | |
10062 | 1. So e.g. "if (isinf_sign(x))" would be folded to just | |
10063 | "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */ | |
10064 | tree signbit_fn = mathfn_built_in_1 (TREE_TYPE (arg), BUILT_IN_SIGNBIT, 0); | |
10065 | tree isinf_fn = builtin_decl_explicit (BUILT_IN_ISINF); | |
10066 | tree tmp = NULL_TREE; | |
10067 | ||
10068 | arg = builtin_save_expr (arg); | |
10069 | ||
10070 | if (signbit_fn && isinf_fn) | |
10071 | { | |
10072 | tree signbit_call = build_call_expr_loc (loc, signbit_fn, 1, arg); | |
10073 | tree isinf_call = build_call_expr_loc (loc, isinf_fn, 1, arg); | |
10074 | ||
10075 | signbit_call = fold_build2_loc (loc, NE_EXPR, integer_type_node, | |
10076 | signbit_call, integer_zero_node); | |
10077 | isinf_call = fold_build2_loc (loc, NE_EXPR, integer_type_node, | |
10078 | isinf_call, integer_zero_node); | |
10079 | ||
10080 | tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node, signbit_call, | |
10081 | integer_minus_one_node, integer_one_node); | |
10082 | tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node, | |
10083 | isinf_call, tmp, | |
10084 | integer_zero_node); | |
10085 | } | |
10086 | ||
10087 | return tmp; | |
10088 | } | |
10089 | ||
10090 | case BUILT_IN_ISFINITE: | |
10091 | if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg))) | |
10092 | && !HONOR_INFINITIES (TYPE_MODE (TREE_TYPE (arg)))) | |
10093 | return omit_one_operand_loc (loc, type, integer_one_node, arg); | |
10094 | ||
10095 | if (TREE_CODE (arg) == REAL_CST) | |
10096 | { | |
10097 | r = TREE_REAL_CST (arg); | |
10098 | return real_isfinite (&r) ? integer_one_node : integer_zero_node; | |
10099 | } | |
10100 | ||
10101 | return NULL_TREE; | |
10102 | ||
10103 | case BUILT_IN_ISNAN: | |
10104 | if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg)))) | |
10105 | return omit_one_operand_loc (loc, type, integer_zero_node, arg); | |
10106 | ||
10107 | if (TREE_CODE (arg) == REAL_CST) | |
10108 | { | |
10109 | r = TREE_REAL_CST (arg); | |
10110 | return real_isnan (&r) ? integer_one_node : integer_zero_node; | |
10111 | } | |
10112 | ||
10113 | arg = builtin_save_expr (arg); | |
10114 | return fold_build2_loc (loc, UNORDERED_EXPR, type, arg, arg); | |
10115 | ||
10116 | default: | |
10117 | gcc_unreachable (); | |
10118 | } | |
10119 | } | |
10120 | ||
10121 | /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...). | |
10122 | This builtin will generate code to return the appropriate floating | |
10123 | point classification depending on the value of the floating point | |
10124 | number passed in. The possible return values must be supplied as | |
10125 | int arguments to the call in the following order: FP_NAN, FP_INFINITE, | |
10126 | FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly | |
10127 | one floating point argument which is "type generic". */ | |
10128 | ||
10129 | static tree | |
10130 | fold_builtin_fpclassify (location_t loc, tree exp) | |
10131 | { | |
10132 | tree fp_nan, fp_infinite, fp_normal, fp_subnormal, fp_zero, | |
10133 | arg, type, res, tmp; | |
10134 | enum machine_mode mode; | |
10135 | REAL_VALUE_TYPE r; | |
10136 | char buf[128]; | |
10137 | ||
10138 | /* Verify the required arguments in the original call. */ | |
10139 | if (!validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE, | |
10140 | INTEGER_TYPE, INTEGER_TYPE, | |
10141 | INTEGER_TYPE, REAL_TYPE, VOID_TYPE)) | |
10142 | return NULL_TREE; | |
10143 | ||
10144 | fp_nan = CALL_EXPR_ARG (exp, 0); | |
10145 | fp_infinite = CALL_EXPR_ARG (exp, 1); | |
10146 | fp_normal = CALL_EXPR_ARG (exp, 2); | |
10147 | fp_subnormal = CALL_EXPR_ARG (exp, 3); | |
10148 | fp_zero = CALL_EXPR_ARG (exp, 4); | |
10149 | arg = CALL_EXPR_ARG (exp, 5); | |
10150 | type = TREE_TYPE (arg); | |
10151 | mode = TYPE_MODE (type); | |
10152 | arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg)); | |
10153 | ||
10154 | /* fpclassify(x) -> | |
10155 | isnan(x) ? FP_NAN : | |
10156 | (fabs(x) == Inf ? FP_INFINITE : | |
10157 | (fabs(x) >= DBL_MIN ? FP_NORMAL : | |
10158 | (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */ | |
10159 | ||
10160 | tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg, | |
10161 | build_real (type, dconst0)); | |
10162 | res = fold_build3_loc (loc, COND_EXPR, integer_type_node, | |
10163 | tmp, fp_zero, fp_subnormal); | |
10164 | ||
10165 | sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1); | |
10166 | real_from_string (&r, buf); | |
10167 | tmp = fold_build2_loc (loc, GE_EXPR, integer_type_node, | |
10168 | arg, build_real (type, r)); | |
10169 | res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, fp_normal, res); | |
10170 | ||
10171 | if (HONOR_INFINITIES (mode)) | |
10172 | { | |
10173 | real_inf (&r); | |
10174 | tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg, | |
10175 | build_real (type, r)); | |
10176 | res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, | |
10177 | fp_infinite, res); | |
10178 | } | |
10179 | ||
10180 | if (HONOR_NANS (mode)) | |
10181 | { | |
10182 | tmp = fold_build2_loc (loc, ORDERED_EXPR, integer_type_node, arg, arg); | |
10183 | res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp, res, fp_nan); | |
10184 | } | |
10185 | ||
10186 | return res; | |
10187 | } | |
10188 | ||
10189 | /* Fold a call to an unordered comparison function such as | |
10190 | __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function | |
10191 | being called and ARG0 and ARG1 are the arguments for the call. | |
10192 | UNORDERED_CODE and ORDERED_CODE are comparison codes that give | |
10193 | the opposite of the desired result. UNORDERED_CODE is used | |
10194 | for modes that can hold NaNs and ORDERED_CODE is used for | |
10195 | the rest. */ | |
10196 | ||
10197 | static tree | |
10198 | fold_builtin_unordered_cmp (location_t loc, tree fndecl, tree arg0, tree arg1, | |
10199 | enum tree_code unordered_code, | |
10200 | enum tree_code ordered_code) | |
10201 | { | |
10202 | tree type = TREE_TYPE (TREE_TYPE (fndecl)); | |
10203 | enum tree_code code; | |
10204 | tree type0, type1; | |
10205 | enum tree_code code0, code1; | |
10206 | tree cmp_type = NULL_TREE; | |
10207 | ||
10208 | type0 = TREE_TYPE (arg0); | |
10209 | type1 = TREE_TYPE (arg1); | |
10210 | ||
10211 | code0 = TREE_CODE (type0); | |
10212 | code1 = TREE_CODE (type1); | |
10213 | ||
10214 | if (code0 == REAL_TYPE && code1 == REAL_TYPE) | |
10215 | /* Choose the wider of two real types. */ | |
10216 | cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1) | |
10217 | ? type0 : type1; | |
10218 | else if (code0 == REAL_TYPE && code1 == INTEGER_TYPE) | |
10219 | cmp_type = type0; | |
10220 | else if (code0 == INTEGER_TYPE && code1 == REAL_TYPE) | |
10221 | cmp_type = type1; | |
10222 | ||
10223 | arg0 = fold_convert_loc (loc, cmp_type, arg0); | |
10224 | arg1 = fold_convert_loc (loc, cmp_type, arg1); | |
10225 | ||
10226 | if (unordered_code == UNORDERED_EXPR) | |
10227 | { | |
10228 | if (!HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0)))) | |
10229 | return omit_two_operands_loc (loc, type, integer_zero_node, arg0, arg1); | |
10230 | return fold_build2_loc (loc, UNORDERED_EXPR, type, arg0, arg1); | |
10231 | } | |
10232 | ||
10233 | code = HONOR_NANS (TYPE_MODE (TREE_TYPE (arg0))) ? unordered_code | |
10234 | : ordered_code; | |
10235 | return fold_build1_loc (loc, TRUTH_NOT_EXPR, type, | |
10236 | fold_build2_loc (loc, code, type, arg0, arg1)); | |
10237 | } | |
10238 | ||
10239 | /* Fold a call to built-in function FNDECL with 0 arguments. | |
10240 | IGNORE is true if the result of the function call is ignored. This | |
10241 | function returns NULL_TREE if no simplification was possible. */ | |
10242 | ||
10243 | static tree | |
10244 | fold_builtin_0 (location_t loc, tree fndecl, bool ignore ATTRIBUTE_UNUSED) | |
10245 | { | |
10246 | tree type = TREE_TYPE (TREE_TYPE (fndecl)); | |
10247 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
10248 | switch (fcode) | |
10249 | { | |
10250 | CASE_FLT_FN (BUILT_IN_INF): | |
10251 | case BUILT_IN_INFD32: | |
10252 | case BUILT_IN_INFD64: | |
10253 | case BUILT_IN_INFD128: | |
10254 | return fold_builtin_inf (loc, type, true); | |
10255 | ||
10256 | CASE_FLT_FN (BUILT_IN_HUGE_VAL): | |
10257 | return fold_builtin_inf (loc, type, false); | |
10258 | ||
10259 | case BUILT_IN_CLASSIFY_TYPE: | |
10260 | return fold_builtin_classify_type (NULL_TREE); | |
10261 | ||
10262 | default: | |
10263 | break; | |
10264 | } | |
10265 | return NULL_TREE; | |
10266 | } | |
10267 | ||
10268 | /* Fold a call to built-in function FNDECL with 1 argument, ARG0. | |
10269 | IGNORE is true if the result of the function call is ignored. This | |
10270 | function returns NULL_TREE if no simplification was possible. */ | |
10271 | ||
10272 | static tree | |
10273 | fold_builtin_1 (location_t loc, tree fndecl, tree arg0, bool ignore) | |
10274 | { | |
10275 | tree type = TREE_TYPE (TREE_TYPE (fndecl)); | |
10276 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
10277 | switch (fcode) | |
10278 | { | |
10279 | case BUILT_IN_CONSTANT_P: | |
10280 | { | |
10281 | tree val = fold_builtin_constant_p (arg0); | |
10282 | ||
10283 | /* Gimplification will pull the CALL_EXPR for the builtin out of | |
10284 | an if condition. When not optimizing, we'll not CSE it back. | |
10285 | To avoid link error types of regressions, return false now. */ | |
10286 | if (!val && !optimize) | |
10287 | val = integer_zero_node; | |
10288 | ||
10289 | return val; | |
10290 | } | |
10291 | ||
10292 | case BUILT_IN_CLASSIFY_TYPE: | |
10293 | return fold_builtin_classify_type (arg0); | |
10294 | ||
10295 | case BUILT_IN_STRLEN: | |
10296 | return fold_builtin_strlen (loc, type, arg0); | |
10297 | ||
10298 | CASE_FLT_FN (BUILT_IN_FABS): | |
10299 | return fold_builtin_fabs (loc, arg0, type); | |
10300 | ||
10301 | case BUILT_IN_ABS: | |
10302 | case BUILT_IN_LABS: | |
10303 | case BUILT_IN_LLABS: | |
10304 | case BUILT_IN_IMAXABS: | |
10305 | return fold_builtin_abs (loc, arg0, type); | |
10306 | ||
10307 | CASE_FLT_FN (BUILT_IN_CONJ): | |
10308 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10309 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10310 | return fold_build1_loc (loc, CONJ_EXPR, type, arg0); | |
10311 | break; | |
10312 | ||
10313 | CASE_FLT_FN (BUILT_IN_CREAL): | |
10314 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10315 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10316 | return non_lvalue_loc (loc, fold_build1_loc (loc, REALPART_EXPR, type, arg0));; | |
10317 | break; | |
10318 | ||
10319 | CASE_FLT_FN (BUILT_IN_CIMAG): | |
10320 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10321 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10322 | return non_lvalue_loc (loc, fold_build1_loc (loc, IMAGPART_EXPR, type, arg0)); | |
10323 | break; | |
10324 | ||
10325 | CASE_FLT_FN (BUILT_IN_CCOS): | |
10326 | return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ false); | |
10327 | ||
10328 | CASE_FLT_FN (BUILT_IN_CCOSH): | |
10329 | return fold_builtin_ccos(loc, arg0, type, fndecl, /*hyper=*/ true); | |
10330 | ||
10331 | CASE_FLT_FN (BUILT_IN_CPROJ): | |
10332 | return fold_builtin_cproj(loc, arg0, type); | |
10333 | ||
10334 | CASE_FLT_FN (BUILT_IN_CSIN): | |
10335 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10336 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10337 | return do_mpc_arg1 (arg0, type, mpc_sin); | |
10338 | break; | |
10339 | ||
10340 | CASE_FLT_FN (BUILT_IN_CSINH): | |
10341 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10342 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10343 | return do_mpc_arg1 (arg0, type, mpc_sinh); | |
10344 | break; | |
10345 | ||
10346 | CASE_FLT_FN (BUILT_IN_CTAN): | |
10347 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10348 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10349 | return do_mpc_arg1 (arg0, type, mpc_tan); | |
10350 | break; | |
10351 | ||
10352 | CASE_FLT_FN (BUILT_IN_CTANH): | |
10353 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10354 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10355 | return do_mpc_arg1 (arg0, type, mpc_tanh); | |
10356 | break; | |
10357 | ||
10358 | CASE_FLT_FN (BUILT_IN_CLOG): | |
10359 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10360 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10361 | return do_mpc_arg1 (arg0, type, mpc_log); | |
10362 | break; | |
10363 | ||
10364 | CASE_FLT_FN (BUILT_IN_CSQRT): | |
10365 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10366 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10367 | return do_mpc_arg1 (arg0, type, mpc_sqrt); | |
10368 | break; | |
10369 | ||
10370 | CASE_FLT_FN (BUILT_IN_CASIN): | |
10371 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10372 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10373 | return do_mpc_arg1 (arg0, type, mpc_asin); | |
10374 | break; | |
10375 | ||
10376 | CASE_FLT_FN (BUILT_IN_CACOS): | |
10377 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10378 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10379 | return do_mpc_arg1 (arg0, type, mpc_acos); | |
10380 | break; | |
10381 | ||
10382 | CASE_FLT_FN (BUILT_IN_CATAN): | |
10383 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10384 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10385 | return do_mpc_arg1 (arg0, type, mpc_atan); | |
10386 | break; | |
10387 | ||
10388 | CASE_FLT_FN (BUILT_IN_CASINH): | |
10389 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10390 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10391 | return do_mpc_arg1 (arg0, type, mpc_asinh); | |
10392 | break; | |
10393 | ||
10394 | CASE_FLT_FN (BUILT_IN_CACOSH): | |
10395 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10396 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10397 | return do_mpc_arg1 (arg0, type, mpc_acosh); | |
10398 | break; | |
10399 | ||
10400 | CASE_FLT_FN (BUILT_IN_CATANH): | |
10401 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10402 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE) | |
10403 | return do_mpc_arg1 (arg0, type, mpc_atanh); | |
10404 | break; | |
10405 | ||
10406 | CASE_FLT_FN (BUILT_IN_CABS): | |
10407 | return fold_builtin_cabs (loc, arg0, type, fndecl); | |
10408 | ||
10409 | CASE_FLT_FN (BUILT_IN_CARG): | |
10410 | return fold_builtin_carg (loc, arg0, type); | |
10411 | ||
10412 | CASE_FLT_FN (BUILT_IN_SQRT): | |
10413 | return fold_builtin_sqrt (loc, arg0, type); | |
10414 | ||
10415 | CASE_FLT_FN (BUILT_IN_CBRT): | |
10416 | return fold_builtin_cbrt (loc, arg0, type); | |
10417 | ||
10418 | CASE_FLT_FN (BUILT_IN_ASIN): | |
10419 | if (validate_arg (arg0, REAL_TYPE)) | |
10420 | return do_mpfr_arg1 (arg0, type, mpfr_asin, | |
10421 | &dconstm1, &dconst1, true); | |
10422 | break; | |
10423 | ||
10424 | CASE_FLT_FN (BUILT_IN_ACOS): | |
10425 | if (validate_arg (arg0, REAL_TYPE)) | |
10426 | return do_mpfr_arg1 (arg0, type, mpfr_acos, | |
10427 | &dconstm1, &dconst1, true); | |
10428 | break; | |
10429 | ||
10430 | CASE_FLT_FN (BUILT_IN_ATAN): | |
10431 | if (validate_arg (arg0, REAL_TYPE)) | |
10432 | return do_mpfr_arg1 (arg0, type, mpfr_atan, NULL, NULL, 0); | |
10433 | break; | |
10434 | ||
10435 | CASE_FLT_FN (BUILT_IN_ASINH): | |
10436 | if (validate_arg (arg0, REAL_TYPE)) | |
10437 | return do_mpfr_arg1 (arg0, type, mpfr_asinh, NULL, NULL, 0); | |
10438 | break; | |
10439 | ||
10440 | CASE_FLT_FN (BUILT_IN_ACOSH): | |
10441 | if (validate_arg (arg0, REAL_TYPE)) | |
10442 | return do_mpfr_arg1 (arg0, type, mpfr_acosh, | |
10443 | &dconst1, NULL, true); | |
10444 | break; | |
10445 | ||
10446 | CASE_FLT_FN (BUILT_IN_ATANH): | |
10447 | if (validate_arg (arg0, REAL_TYPE)) | |
10448 | return do_mpfr_arg1 (arg0, type, mpfr_atanh, | |
10449 | &dconstm1, &dconst1, false); | |
10450 | break; | |
10451 | ||
10452 | CASE_FLT_FN (BUILT_IN_SIN): | |
10453 | if (validate_arg (arg0, REAL_TYPE)) | |
10454 | return do_mpfr_arg1 (arg0, type, mpfr_sin, NULL, NULL, 0); | |
10455 | break; | |
10456 | ||
10457 | CASE_FLT_FN (BUILT_IN_COS): | |
10458 | return fold_builtin_cos (loc, arg0, type, fndecl); | |
10459 | ||
10460 | CASE_FLT_FN (BUILT_IN_TAN): | |
10461 | return fold_builtin_tan (arg0, type); | |
10462 | ||
10463 | CASE_FLT_FN (BUILT_IN_CEXP): | |
10464 | return fold_builtin_cexp (loc, arg0, type); | |
10465 | ||
10466 | CASE_FLT_FN (BUILT_IN_CEXPI): | |
10467 | if (validate_arg (arg0, REAL_TYPE)) | |
10468 | return do_mpfr_sincos (arg0, NULL_TREE, NULL_TREE); | |
10469 | break; | |
10470 | ||
10471 | CASE_FLT_FN (BUILT_IN_SINH): | |
10472 | if (validate_arg (arg0, REAL_TYPE)) | |
10473 | return do_mpfr_arg1 (arg0, type, mpfr_sinh, NULL, NULL, 0); | |
10474 | break; | |
10475 | ||
10476 | CASE_FLT_FN (BUILT_IN_COSH): | |
10477 | return fold_builtin_cosh (loc, arg0, type, fndecl); | |
10478 | ||
10479 | CASE_FLT_FN (BUILT_IN_TANH): | |
10480 | if (validate_arg (arg0, REAL_TYPE)) | |
10481 | return do_mpfr_arg1 (arg0, type, mpfr_tanh, NULL, NULL, 0); | |
10482 | break; | |
10483 | ||
10484 | CASE_FLT_FN (BUILT_IN_ERF): | |
10485 | if (validate_arg (arg0, REAL_TYPE)) | |
10486 | return do_mpfr_arg1 (arg0, type, mpfr_erf, NULL, NULL, 0); | |
10487 | break; | |
10488 | ||
10489 | CASE_FLT_FN (BUILT_IN_ERFC): | |
10490 | if (validate_arg (arg0, REAL_TYPE)) | |
10491 | return do_mpfr_arg1 (arg0, type, mpfr_erfc, NULL, NULL, 0); | |
10492 | break; | |
10493 | ||
10494 | CASE_FLT_FN (BUILT_IN_TGAMMA): | |
10495 | if (validate_arg (arg0, REAL_TYPE)) | |
10496 | return do_mpfr_arg1 (arg0, type, mpfr_gamma, NULL, NULL, 0); | |
10497 | break; | |
10498 | ||
10499 | CASE_FLT_FN (BUILT_IN_EXP): | |
10500 | return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp); | |
10501 | ||
10502 | CASE_FLT_FN (BUILT_IN_EXP2): | |
10503 | return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp2); | |
10504 | ||
10505 | CASE_FLT_FN (BUILT_IN_EXP10): | |
10506 | CASE_FLT_FN (BUILT_IN_POW10): | |
10507 | return fold_builtin_exponent (loc, fndecl, arg0, mpfr_exp10); | |
10508 | ||
10509 | CASE_FLT_FN (BUILT_IN_EXPM1): | |
10510 | if (validate_arg (arg0, REAL_TYPE)) | |
10511 | return do_mpfr_arg1 (arg0, type, mpfr_expm1, NULL, NULL, 0); | |
10512 | break; | |
10513 | ||
10514 | CASE_FLT_FN (BUILT_IN_LOG): | |
10515 | return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log); | |
10516 | ||
10517 | CASE_FLT_FN (BUILT_IN_LOG2): | |
10518 | return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log2); | |
10519 | ||
10520 | CASE_FLT_FN (BUILT_IN_LOG10): | |
10521 | return fold_builtin_logarithm (loc, fndecl, arg0, mpfr_log10); | |
10522 | ||
10523 | CASE_FLT_FN (BUILT_IN_LOG1P): | |
10524 | if (validate_arg (arg0, REAL_TYPE)) | |
10525 | return do_mpfr_arg1 (arg0, type, mpfr_log1p, | |
10526 | &dconstm1, NULL, false); | |
10527 | break; | |
10528 | ||
10529 | CASE_FLT_FN (BUILT_IN_J0): | |
10530 | if (validate_arg (arg0, REAL_TYPE)) | |
10531 | return do_mpfr_arg1 (arg0, type, mpfr_j0, | |
10532 | NULL, NULL, 0); | |
10533 | break; | |
10534 | ||
10535 | CASE_FLT_FN (BUILT_IN_J1): | |
10536 | if (validate_arg (arg0, REAL_TYPE)) | |
10537 | return do_mpfr_arg1 (arg0, type, mpfr_j1, | |
10538 | NULL, NULL, 0); | |
10539 | break; | |
10540 | ||
10541 | CASE_FLT_FN (BUILT_IN_Y0): | |
10542 | if (validate_arg (arg0, REAL_TYPE)) | |
10543 | return do_mpfr_arg1 (arg0, type, mpfr_y0, | |
10544 | &dconst0, NULL, false); | |
10545 | break; | |
10546 | ||
10547 | CASE_FLT_FN (BUILT_IN_Y1): | |
10548 | if (validate_arg (arg0, REAL_TYPE)) | |
10549 | return do_mpfr_arg1 (arg0, type, mpfr_y1, | |
10550 | &dconst0, NULL, false); | |
10551 | break; | |
10552 | ||
10553 | CASE_FLT_FN (BUILT_IN_NAN): | |
10554 | case BUILT_IN_NAND32: | |
10555 | case BUILT_IN_NAND64: | |
10556 | case BUILT_IN_NAND128: | |
10557 | return fold_builtin_nan (arg0, type, true); | |
10558 | ||
10559 | CASE_FLT_FN (BUILT_IN_NANS): | |
10560 | return fold_builtin_nan (arg0, type, false); | |
10561 | ||
10562 | CASE_FLT_FN (BUILT_IN_FLOOR): | |
10563 | return fold_builtin_floor (loc, fndecl, arg0); | |
10564 | ||
10565 | CASE_FLT_FN (BUILT_IN_CEIL): | |
10566 | return fold_builtin_ceil (loc, fndecl, arg0); | |
10567 | ||
10568 | CASE_FLT_FN (BUILT_IN_TRUNC): | |
10569 | return fold_builtin_trunc (loc, fndecl, arg0); | |
10570 | ||
10571 | CASE_FLT_FN (BUILT_IN_ROUND): | |
10572 | return fold_builtin_round (loc, fndecl, arg0); | |
10573 | ||
10574 | CASE_FLT_FN (BUILT_IN_NEARBYINT): | |
10575 | CASE_FLT_FN (BUILT_IN_RINT): | |
10576 | return fold_trunc_transparent_mathfn (loc, fndecl, arg0); | |
10577 | ||
10578 | CASE_FLT_FN (BUILT_IN_ICEIL): | |
10579 | CASE_FLT_FN (BUILT_IN_LCEIL): | |
10580 | CASE_FLT_FN (BUILT_IN_LLCEIL): | |
10581 | CASE_FLT_FN (BUILT_IN_LFLOOR): | |
10582 | CASE_FLT_FN (BUILT_IN_IFLOOR): | |
10583 | CASE_FLT_FN (BUILT_IN_LLFLOOR): | |
10584 | CASE_FLT_FN (BUILT_IN_IROUND): | |
10585 | CASE_FLT_FN (BUILT_IN_LROUND): | |
10586 | CASE_FLT_FN (BUILT_IN_LLROUND): | |
10587 | return fold_builtin_int_roundingfn (loc, fndecl, arg0); | |
10588 | ||
10589 | CASE_FLT_FN (BUILT_IN_IRINT): | |
10590 | CASE_FLT_FN (BUILT_IN_LRINT): | |
10591 | CASE_FLT_FN (BUILT_IN_LLRINT): | |
10592 | return fold_fixed_mathfn (loc, fndecl, arg0); | |
10593 | ||
10594 | case BUILT_IN_BSWAP32: | |
10595 | case BUILT_IN_BSWAP64: | |
10596 | return fold_builtin_bswap (fndecl, arg0); | |
10597 | ||
10598 | CASE_INT_FN (BUILT_IN_FFS): | |
10599 | CASE_INT_FN (BUILT_IN_CLZ): | |
10600 | CASE_INT_FN (BUILT_IN_CTZ): | |
10601 | CASE_INT_FN (BUILT_IN_CLRSB): | |
10602 | CASE_INT_FN (BUILT_IN_POPCOUNT): | |
10603 | CASE_INT_FN (BUILT_IN_PARITY): | |
10604 | return fold_builtin_bitop (fndecl, arg0); | |
10605 | ||
10606 | CASE_FLT_FN (BUILT_IN_SIGNBIT): | |
10607 | return fold_builtin_signbit (loc, arg0, type); | |
10608 | ||
10609 | CASE_FLT_FN (BUILT_IN_SIGNIFICAND): | |
10610 | return fold_builtin_significand (loc, arg0, type); | |
10611 | ||
10612 | CASE_FLT_FN (BUILT_IN_ILOGB): | |
10613 | CASE_FLT_FN (BUILT_IN_LOGB): | |
10614 | return fold_builtin_logb (loc, arg0, type); | |
10615 | ||
10616 | case BUILT_IN_ISASCII: | |
10617 | return fold_builtin_isascii (loc, arg0); | |
10618 | ||
10619 | case BUILT_IN_TOASCII: | |
10620 | return fold_builtin_toascii (loc, arg0); | |
10621 | ||
10622 | case BUILT_IN_ISDIGIT: | |
10623 | return fold_builtin_isdigit (loc, arg0); | |
10624 | ||
10625 | CASE_FLT_FN (BUILT_IN_FINITE): | |
10626 | case BUILT_IN_FINITED32: | |
10627 | case BUILT_IN_FINITED64: | |
10628 | case BUILT_IN_FINITED128: | |
10629 | case BUILT_IN_ISFINITE: | |
10630 | { | |
10631 | tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISFINITE); | |
10632 | if (ret) | |
10633 | return ret; | |
10634 | return fold_builtin_interclass_mathfn (loc, fndecl, arg0); | |
10635 | } | |
10636 | ||
10637 | CASE_FLT_FN (BUILT_IN_ISINF): | |
10638 | case BUILT_IN_ISINFD32: | |
10639 | case BUILT_IN_ISINFD64: | |
10640 | case BUILT_IN_ISINFD128: | |
10641 | { | |
10642 | tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF); | |
10643 | if (ret) | |
10644 | return ret; | |
10645 | return fold_builtin_interclass_mathfn (loc, fndecl, arg0); | |
10646 | } | |
10647 | ||
10648 | case BUILT_IN_ISNORMAL: | |
10649 | return fold_builtin_interclass_mathfn (loc, fndecl, arg0); | |
10650 | ||
10651 | case BUILT_IN_ISINF_SIGN: | |
10652 | return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF_SIGN); | |
10653 | ||
10654 | CASE_FLT_FN (BUILT_IN_ISNAN): | |
10655 | case BUILT_IN_ISNAND32: | |
10656 | case BUILT_IN_ISNAND64: | |
10657 | case BUILT_IN_ISNAND128: | |
10658 | return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISNAN); | |
10659 | ||
10660 | case BUILT_IN_PRINTF: | |
10661 | case BUILT_IN_PRINTF_UNLOCKED: | |
10662 | case BUILT_IN_VPRINTF: | |
10663 | return fold_builtin_printf (loc, fndecl, arg0, NULL_TREE, ignore, fcode); | |
10664 | ||
10665 | case BUILT_IN_FREE: | |
10666 | if (integer_zerop (arg0)) | |
10667 | return build_empty_stmt (loc); | |
10668 | break; | |
10669 | ||
10670 | default: | |
10671 | break; | |
10672 | } | |
10673 | ||
10674 | return NULL_TREE; | |
10675 | ||
10676 | } | |
10677 | ||
10678 | /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1. | |
10679 | IGNORE is true if the result of the function call is ignored. This | |
10680 | function returns NULL_TREE if no simplification was possible. */ | |
10681 | ||
10682 | static tree | |
10683 | fold_builtin_2 (location_t loc, tree fndecl, tree arg0, tree arg1, bool ignore) | |
10684 | { | |
10685 | tree type = TREE_TYPE (TREE_TYPE (fndecl)); | |
10686 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
10687 | ||
10688 | switch (fcode) | |
10689 | { | |
10690 | CASE_FLT_FN (BUILT_IN_JN): | |
10691 | if (validate_arg (arg0, INTEGER_TYPE) | |
10692 | && validate_arg (arg1, REAL_TYPE)) | |
10693 | return do_mpfr_bessel_n (arg0, arg1, type, mpfr_jn, NULL, 0); | |
10694 | break; | |
10695 | ||
10696 | CASE_FLT_FN (BUILT_IN_YN): | |
10697 | if (validate_arg (arg0, INTEGER_TYPE) | |
10698 | && validate_arg (arg1, REAL_TYPE)) | |
10699 | return do_mpfr_bessel_n (arg0, arg1, type, mpfr_yn, | |
10700 | &dconst0, false); | |
10701 | break; | |
10702 | ||
10703 | CASE_FLT_FN (BUILT_IN_DREM): | |
10704 | CASE_FLT_FN (BUILT_IN_REMAINDER): | |
10705 | if (validate_arg (arg0, REAL_TYPE) | |
10706 | && validate_arg(arg1, REAL_TYPE)) | |
10707 | return do_mpfr_arg2 (arg0, arg1, type, mpfr_remainder); | |
10708 | break; | |
10709 | ||
10710 | CASE_FLT_FN_REENT (BUILT_IN_GAMMA): /* GAMMA_R */ | |
10711 | CASE_FLT_FN_REENT (BUILT_IN_LGAMMA): /* LGAMMA_R */ | |
10712 | if (validate_arg (arg0, REAL_TYPE) | |
10713 | && validate_arg(arg1, POINTER_TYPE)) | |
10714 | return do_mpfr_lgamma_r (arg0, arg1, type); | |
10715 | break; | |
10716 | ||
10717 | CASE_FLT_FN (BUILT_IN_ATAN2): | |
10718 | if (validate_arg (arg0, REAL_TYPE) | |
10719 | && validate_arg(arg1, REAL_TYPE)) | |
10720 | return do_mpfr_arg2 (arg0, arg1, type, mpfr_atan2); | |
10721 | break; | |
10722 | ||
10723 | CASE_FLT_FN (BUILT_IN_FDIM): | |
10724 | if (validate_arg (arg0, REAL_TYPE) | |
10725 | && validate_arg(arg1, REAL_TYPE)) | |
10726 | return do_mpfr_arg2 (arg0, arg1, type, mpfr_dim); | |
10727 | break; | |
10728 | ||
10729 | CASE_FLT_FN (BUILT_IN_HYPOT): | |
10730 | return fold_builtin_hypot (loc, fndecl, arg0, arg1, type); | |
10731 | ||
10732 | CASE_FLT_FN (BUILT_IN_CPOW): | |
10733 | if (validate_arg (arg0, COMPLEX_TYPE) | |
10734 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE | |
10735 | && validate_arg (arg1, COMPLEX_TYPE) | |
10736 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE) | |
10737 | return do_mpc_arg2 (arg0, arg1, type, /*do_nonfinite=*/ 0, mpc_pow); | |
10738 | break; | |
10739 | ||
10740 | CASE_FLT_FN (BUILT_IN_LDEXP): | |
10741 | return fold_builtin_load_exponent (loc, arg0, arg1, type, /*ldexp=*/true); | |
10742 | CASE_FLT_FN (BUILT_IN_SCALBN): | |
10743 | CASE_FLT_FN (BUILT_IN_SCALBLN): | |
10744 | return fold_builtin_load_exponent (loc, arg0, arg1, | |
10745 | type, /*ldexp=*/false); | |
10746 | ||
10747 | CASE_FLT_FN (BUILT_IN_FREXP): | |
10748 | return fold_builtin_frexp (loc, arg0, arg1, type); | |
10749 | ||
10750 | CASE_FLT_FN (BUILT_IN_MODF): | |
10751 | return fold_builtin_modf (loc, arg0, arg1, type); | |
10752 | ||
10753 | case BUILT_IN_BZERO: | |
10754 | return fold_builtin_bzero (loc, arg0, arg1, ignore); | |
10755 | ||
10756 | case BUILT_IN_FPUTS: | |
10757 | return fold_builtin_fputs (loc, arg0, arg1, ignore, false, NULL_TREE); | |
10758 | ||
10759 | case BUILT_IN_FPUTS_UNLOCKED: | |
10760 | return fold_builtin_fputs (loc, arg0, arg1, ignore, true, NULL_TREE); | |
10761 | ||
10762 | case BUILT_IN_STRSTR: | |
10763 | return fold_builtin_strstr (loc, arg0, arg1, type); | |
10764 | ||
10765 | case BUILT_IN_STRCAT: | |
10766 | return fold_builtin_strcat (loc, arg0, arg1); | |
10767 | ||
10768 | case BUILT_IN_STRSPN: | |
10769 | return fold_builtin_strspn (loc, arg0, arg1); | |
10770 | ||
10771 | case BUILT_IN_STRCSPN: | |
10772 | return fold_builtin_strcspn (loc, arg0, arg1); | |
10773 | ||
10774 | case BUILT_IN_STRCHR: | |
10775 | case BUILT_IN_INDEX: | |
10776 | return fold_builtin_strchr (loc, arg0, arg1, type); | |
10777 | ||
10778 | case BUILT_IN_STRRCHR: | |
10779 | case BUILT_IN_RINDEX: | |
10780 | return fold_builtin_strrchr (loc, arg0, arg1, type); | |
10781 | ||
10782 | case BUILT_IN_STRCPY: | |
10783 | return fold_builtin_strcpy (loc, fndecl, arg0, arg1, NULL_TREE); | |
10784 | ||
10785 | case BUILT_IN_STPCPY: | |
10786 | if (ignore) | |
10787 | { | |
10788 | tree fn = builtin_decl_implicit (BUILT_IN_STRCPY); | |
10789 | if (!fn) | |
10790 | break; | |
10791 | ||
10792 | return build_call_expr_loc (loc, fn, 2, arg0, arg1); | |
10793 | } | |
10794 | else | |
10795 | return fold_builtin_stpcpy (loc, fndecl, arg0, arg1); | |
10796 | break; | |
10797 | ||
10798 | case BUILT_IN_STRCMP: | |
10799 | return fold_builtin_strcmp (loc, arg0, arg1); | |
10800 | ||
10801 | case BUILT_IN_STRPBRK: | |
10802 | return fold_builtin_strpbrk (loc, arg0, arg1, type); | |
10803 | ||
10804 | case BUILT_IN_EXPECT: | |
10805 | return fold_builtin_expect (loc, arg0, arg1); | |
10806 | ||
10807 | CASE_FLT_FN (BUILT_IN_POW): | |
10808 | return fold_builtin_pow (loc, fndecl, arg0, arg1, type); | |
10809 | ||
10810 | CASE_FLT_FN (BUILT_IN_POWI): | |
10811 | return fold_builtin_powi (loc, fndecl, arg0, arg1, type); | |
10812 | ||
10813 | CASE_FLT_FN (BUILT_IN_COPYSIGN): | |
10814 | return fold_builtin_copysign (loc, fndecl, arg0, arg1, type); | |
10815 | ||
10816 | CASE_FLT_FN (BUILT_IN_FMIN): | |
10817 | return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/false); | |
10818 | ||
10819 | CASE_FLT_FN (BUILT_IN_FMAX): | |
10820 | return fold_builtin_fmin_fmax (loc, arg0, arg1, type, /*max=*/true); | |
10821 | ||
10822 | case BUILT_IN_ISGREATER: | |
10823 | return fold_builtin_unordered_cmp (loc, fndecl, | |
10824 | arg0, arg1, UNLE_EXPR, LE_EXPR); | |
10825 | case BUILT_IN_ISGREATEREQUAL: | |
10826 | return fold_builtin_unordered_cmp (loc, fndecl, | |
10827 | arg0, arg1, UNLT_EXPR, LT_EXPR); | |
10828 | case BUILT_IN_ISLESS: | |
10829 | return fold_builtin_unordered_cmp (loc, fndecl, | |
10830 | arg0, arg1, UNGE_EXPR, GE_EXPR); | |
10831 | case BUILT_IN_ISLESSEQUAL: | |
10832 | return fold_builtin_unordered_cmp (loc, fndecl, | |
10833 | arg0, arg1, UNGT_EXPR, GT_EXPR); | |
10834 | case BUILT_IN_ISLESSGREATER: | |
10835 | return fold_builtin_unordered_cmp (loc, fndecl, | |
10836 | arg0, arg1, UNEQ_EXPR, EQ_EXPR); | |
10837 | case BUILT_IN_ISUNORDERED: | |
10838 | return fold_builtin_unordered_cmp (loc, fndecl, | |
10839 | arg0, arg1, UNORDERED_EXPR, | |
10840 | NOP_EXPR); | |
10841 | ||
10842 | /* We do the folding for va_start in the expander. */ | |
10843 | case BUILT_IN_VA_START: | |
10844 | break; | |
10845 | ||
10846 | case BUILT_IN_SPRINTF: | |
10847 | return fold_builtin_sprintf (loc, arg0, arg1, NULL_TREE, ignore); | |
10848 | ||
10849 | case BUILT_IN_OBJECT_SIZE: | |
10850 | return fold_builtin_object_size (arg0, arg1); | |
10851 | ||
10852 | case BUILT_IN_PRINTF: | |
10853 | case BUILT_IN_PRINTF_UNLOCKED: | |
10854 | case BUILT_IN_VPRINTF: | |
10855 | return fold_builtin_printf (loc, fndecl, arg0, arg1, ignore, fcode); | |
10856 | ||
10857 | case BUILT_IN_PRINTF_CHK: | |
10858 | case BUILT_IN_VPRINTF_CHK: | |
10859 | if (!validate_arg (arg0, INTEGER_TYPE) | |
10860 | || TREE_SIDE_EFFECTS (arg0)) | |
10861 | return NULL_TREE; | |
10862 | else | |
10863 | return fold_builtin_printf (loc, fndecl, | |
10864 | arg1, NULL_TREE, ignore, fcode); | |
10865 | break; | |
10866 | ||
10867 | case BUILT_IN_FPRINTF: | |
10868 | case BUILT_IN_FPRINTF_UNLOCKED: | |
10869 | case BUILT_IN_VFPRINTF: | |
10870 | return fold_builtin_fprintf (loc, fndecl, arg0, arg1, NULL_TREE, | |
10871 | ignore, fcode); | |
10872 | ||
10873 | case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE: | |
10874 | return fold_builtin_atomic_always_lock_free (arg0, arg1); | |
10875 | ||
10876 | case BUILT_IN_ATOMIC_IS_LOCK_FREE: | |
10877 | return fold_builtin_atomic_is_lock_free (arg0, arg1); | |
10878 | ||
10879 | default: | |
10880 | break; | |
10881 | } | |
10882 | return NULL_TREE; | |
10883 | } | |
10884 | ||
10885 | /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1, | |
10886 | and ARG2. IGNORE is true if the result of the function call is ignored. | |
10887 | This function returns NULL_TREE if no simplification was possible. */ | |
10888 | ||
10889 | static tree | |
10890 | fold_builtin_3 (location_t loc, tree fndecl, | |
10891 | tree arg0, tree arg1, tree arg2, bool ignore) | |
10892 | { | |
10893 | tree type = TREE_TYPE (TREE_TYPE (fndecl)); | |
10894 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
10895 | switch (fcode) | |
10896 | { | |
10897 | ||
10898 | CASE_FLT_FN (BUILT_IN_SINCOS): | |
10899 | return fold_builtin_sincos (loc, arg0, arg1, arg2); | |
10900 | ||
10901 | CASE_FLT_FN (BUILT_IN_FMA): | |
10902 | return fold_builtin_fma (loc, arg0, arg1, arg2, type); | |
10903 | break; | |
10904 | ||
10905 | CASE_FLT_FN (BUILT_IN_REMQUO): | |
10906 | if (validate_arg (arg0, REAL_TYPE) | |
10907 | && validate_arg(arg1, REAL_TYPE) | |
10908 | && validate_arg(arg2, POINTER_TYPE)) | |
10909 | return do_mpfr_remquo (arg0, arg1, arg2); | |
10910 | break; | |
10911 | ||
10912 | case BUILT_IN_MEMSET: | |
10913 | return fold_builtin_memset (loc, arg0, arg1, arg2, type, ignore); | |
10914 | ||
10915 | case BUILT_IN_BCOPY: | |
10916 | return fold_builtin_memory_op (loc, arg1, arg0, arg2, | |
10917 | void_type_node, true, /*endp=*/3); | |
10918 | ||
10919 | case BUILT_IN_MEMCPY: | |
10920 | return fold_builtin_memory_op (loc, arg0, arg1, arg2, | |
10921 | type, ignore, /*endp=*/0); | |
10922 | ||
10923 | case BUILT_IN_MEMPCPY: | |
10924 | return fold_builtin_memory_op (loc, arg0, arg1, arg2, | |
10925 | type, ignore, /*endp=*/1); | |
10926 | ||
10927 | case BUILT_IN_MEMMOVE: | |
10928 | return fold_builtin_memory_op (loc, arg0, arg1, arg2, | |
10929 | type, ignore, /*endp=*/3); | |
10930 | ||
10931 | case BUILT_IN_STRNCAT: | |
10932 | return fold_builtin_strncat (loc, arg0, arg1, arg2); | |
10933 | ||
10934 | case BUILT_IN_STRNCPY: | |
10935 | return fold_builtin_strncpy (loc, fndecl, arg0, arg1, arg2, NULL_TREE); | |
10936 | ||
10937 | case BUILT_IN_STRNCMP: | |
10938 | return fold_builtin_strncmp (loc, arg0, arg1, arg2); | |
10939 | ||
10940 | case BUILT_IN_MEMCHR: | |
10941 | return fold_builtin_memchr (loc, arg0, arg1, arg2, type); | |
10942 | ||
10943 | case BUILT_IN_BCMP: | |
10944 | case BUILT_IN_MEMCMP: | |
10945 | return fold_builtin_memcmp (loc, arg0, arg1, arg2);; | |
10946 | ||
10947 | case BUILT_IN_SPRINTF: | |
10948 | return fold_builtin_sprintf (loc, arg0, arg1, arg2, ignore); | |
10949 | ||
10950 | case BUILT_IN_SNPRINTF: | |
10951 | return fold_builtin_snprintf (loc, arg0, arg1, arg2, NULL_TREE, ignore); | |
10952 | ||
10953 | case BUILT_IN_STRCPY_CHK: | |
10954 | case BUILT_IN_STPCPY_CHK: | |
10955 | return fold_builtin_stxcpy_chk (loc, fndecl, arg0, arg1, arg2, NULL_TREE, | |
10956 | ignore, fcode); | |
10957 | ||
10958 | case BUILT_IN_STRCAT_CHK: | |
10959 | return fold_builtin_strcat_chk (loc, fndecl, arg0, arg1, arg2); | |
10960 | ||
10961 | case BUILT_IN_PRINTF_CHK: | |
10962 | case BUILT_IN_VPRINTF_CHK: | |
10963 | if (!validate_arg (arg0, INTEGER_TYPE) | |
10964 | || TREE_SIDE_EFFECTS (arg0)) | |
10965 | return NULL_TREE; | |
10966 | else | |
10967 | return fold_builtin_printf (loc, fndecl, arg1, arg2, ignore, fcode); | |
10968 | break; | |
10969 | ||
10970 | case BUILT_IN_FPRINTF: | |
10971 | case BUILT_IN_FPRINTF_UNLOCKED: | |
10972 | case BUILT_IN_VFPRINTF: | |
10973 | return fold_builtin_fprintf (loc, fndecl, arg0, arg1, arg2, | |
10974 | ignore, fcode); | |
10975 | ||
10976 | case BUILT_IN_FPRINTF_CHK: | |
10977 | case BUILT_IN_VFPRINTF_CHK: | |
10978 | if (!validate_arg (arg1, INTEGER_TYPE) | |
10979 | || TREE_SIDE_EFFECTS (arg1)) | |
10980 | return NULL_TREE; | |
10981 | else | |
10982 | return fold_builtin_fprintf (loc, fndecl, arg0, arg2, NULL_TREE, | |
10983 | ignore, fcode); | |
10984 | ||
10985 | default: | |
10986 | break; | |
10987 | } | |
10988 | return NULL_TREE; | |
10989 | } | |
10990 | ||
10991 | /* Fold a call to built-in function FNDECL with 4 arguments, ARG0, ARG1, | |
10992 | ARG2, and ARG3. IGNORE is true if the result of the function call is | |
10993 | ignored. This function returns NULL_TREE if no simplification was | |
10994 | possible. */ | |
10995 | ||
10996 | static tree | |
10997 | fold_builtin_4 (location_t loc, tree fndecl, | |
10998 | tree arg0, tree arg1, tree arg2, tree arg3, bool ignore) | |
10999 | { | |
11000 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
11001 | ||
11002 | switch (fcode) | |
11003 | { | |
11004 | case BUILT_IN_MEMCPY_CHK: | |
11005 | case BUILT_IN_MEMPCPY_CHK: | |
11006 | case BUILT_IN_MEMMOVE_CHK: | |
11007 | case BUILT_IN_MEMSET_CHK: | |
11008 | return fold_builtin_memory_chk (loc, fndecl, arg0, arg1, arg2, arg3, | |
11009 | NULL_TREE, ignore, | |
11010 | DECL_FUNCTION_CODE (fndecl)); | |
11011 | ||
11012 | case BUILT_IN_STRNCPY_CHK: | |
11013 | case BUILT_IN_STPNCPY_CHK: | |
11014 | return fold_builtin_stxncpy_chk (loc, arg0, arg1, arg2, arg3, NULL_TREE, | |
11015 | ignore, fcode); | |
11016 | ||
11017 | case BUILT_IN_STRNCAT_CHK: | |
11018 | return fold_builtin_strncat_chk (loc, fndecl, arg0, arg1, arg2, arg3); | |
11019 | ||
11020 | case BUILT_IN_SNPRINTF: | |
11021 | return fold_builtin_snprintf (loc, arg0, arg1, arg2, arg3, ignore); | |
11022 | ||
11023 | case BUILT_IN_FPRINTF_CHK: | |
11024 | case BUILT_IN_VFPRINTF_CHK: | |
11025 | if (!validate_arg (arg1, INTEGER_TYPE) | |
11026 | || TREE_SIDE_EFFECTS (arg1)) | |
11027 | return NULL_TREE; | |
11028 | else | |
11029 | return fold_builtin_fprintf (loc, fndecl, arg0, arg2, arg3, | |
11030 | ignore, fcode); | |
11031 | break; | |
11032 | ||
11033 | default: | |
11034 | break; | |
11035 | } | |
11036 | return NULL_TREE; | |
11037 | } | |
11038 | ||
11039 | /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS | |
11040 | arguments, where NARGS <= 4. IGNORE is true if the result of the | |
11041 | function call is ignored. This function returns NULL_TREE if no | |
11042 | simplification was possible. Note that this only folds builtins with | |
11043 | fixed argument patterns. Foldings that do varargs-to-varargs | |
11044 | transformations, or that match calls with more than 4 arguments, | |
11045 | need to be handled with fold_builtin_varargs instead. */ | |
11046 | ||
11047 | #define MAX_ARGS_TO_FOLD_BUILTIN 4 | |
11048 | ||
11049 | static tree | |
11050 | fold_builtin_n (location_t loc, tree fndecl, tree *args, int nargs, bool ignore) | |
11051 | { | |
11052 | tree ret = NULL_TREE; | |
11053 | ||
11054 | switch (nargs) | |
11055 | { | |
11056 | case 0: | |
11057 | ret = fold_builtin_0 (loc, fndecl, ignore); | |
11058 | break; | |
11059 | case 1: | |
11060 | ret = fold_builtin_1 (loc, fndecl, args[0], ignore); | |
11061 | break; | |
11062 | case 2: | |
11063 | ret = fold_builtin_2 (loc, fndecl, args[0], args[1], ignore); | |
11064 | break; | |
11065 | case 3: | |
11066 | ret = fold_builtin_3 (loc, fndecl, args[0], args[1], args[2], ignore); | |
11067 | break; | |
11068 | case 4: | |
11069 | ret = fold_builtin_4 (loc, fndecl, args[0], args[1], args[2], args[3], | |
11070 | ignore); | |
11071 | break; | |
11072 | default: | |
11073 | break; | |
11074 | } | |
11075 | if (ret) | |
11076 | { | |
11077 | ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret); | |
11078 | SET_EXPR_LOCATION (ret, loc); | |
11079 | TREE_NO_WARNING (ret) = 1; | |
11080 | return ret; | |
11081 | } | |
11082 | return NULL_TREE; | |
11083 | } | |
11084 | ||
11085 | /* Builtins with folding operations that operate on "..." arguments | |
11086 | need special handling; we need to store the arguments in a convenient | |
11087 | data structure before attempting any folding. Fortunately there are | |
11088 | only a few builtins that fall into this category. FNDECL is the | |
11089 | function, EXP is the CALL_EXPR for the call, and IGNORE is true if the | |
11090 | result of the function call is ignored. */ | |
11091 | ||
11092 | static tree | |
11093 | fold_builtin_varargs (location_t loc, tree fndecl, tree exp, | |
11094 | bool ignore ATTRIBUTE_UNUSED) | |
11095 | { | |
11096 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
11097 | tree ret = NULL_TREE; | |
11098 | ||
11099 | switch (fcode) | |
11100 | { | |
11101 | case BUILT_IN_SPRINTF_CHK: | |
11102 | case BUILT_IN_VSPRINTF_CHK: | |
11103 | ret = fold_builtin_sprintf_chk (loc, exp, fcode); | |
11104 | break; | |
11105 | ||
11106 | case BUILT_IN_SNPRINTF_CHK: | |
11107 | case BUILT_IN_VSNPRINTF_CHK: | |
11108 | ret = fold_builtin_snprintf_chk (loc, exp, NULL_TREE, fcode); | |
11109 | break; | |
11110 | ||
11111 | case BUILT_IN_FPCLASSIFY: | |
11112 | ret = fold_builtin_fpclassify (loc, exp); | |
11113 | break; | |
11114 | ||
11115 | default: | |
11116 | break; | |
11117 | } | |
11118 | if (ret) | |
11119 | { | |
11120 | ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret); | |
11121 | SET_EXPR_LOCATION (ret, loc); | |
11122 | TREE_NO_WARNING (ret) = 1; | |
11123 | return ret; | |
11124 | } | |
11125 | return NULL_TREE; | |
11126 | } | |
11127 | ||
11128 | /* Return true if FNDECL shouldn't be folded right now. | |
11129 | If a built-in function has an inline attribute always_inline | |
11130 | wrapper, defer folding it after always_inline functions have | |
11131 | been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking | |
11132 | might not be performed. */ | |
11133 | ||
11134 | bool | |
11135 | avoid_folding_inline_builtin (tree fndecl) | |
11136 | { | |
11137 | return (DECL_DECLARED_INLINE_P (fndecl) | |
11138 | && DECL_DISREGARD_INLINE_LIMITS (fndecl) | |
11139 | && cfun | |
11140 | && !cfun->always_inline_functions_inlined | |
11141 | && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fndecl))); | |
11142 | } | |
11143 | ||
11144 | /* A wrapper function for builtin folding that prevents warnings for | |
11145 | "statement without effect" and the like, caused by removing the | |
11146 | call node earlier than the warning is generated. */ | |
11147 | ||
11148 | tree | |
11149 | fold_call_expr (location_t loc, tree exp, bool ignore) | |
11150 | { | |
11151 | tree ret = NULL_TREE; | |
11152 | tree fndecl = get_callee_fndecl (exp); | |
11153 | if (fndecl | |
11154 | && TREE_CODE (fndecl) == FUNCTION_DECL | |
11155 | && DECL_BUILT_IN (fndecl) | |
11156 | /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized | |
11157 | yet. Defer folding until we see all the arguments | |
11158 | (after inlining). */ | |
11159 | && !CALL_EXPR_VA_ARG_PACK (exp)) | |
11160 | { | |
11161 | int nargs = call_expr_nargs (exp); | |
11162 | ||
11163 | /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but | |
11164 | instead last argument is __builtin_va_arg_pack (). Defer folding | |
11165 | even in that case, until arguments are finalized. */ | |
11166 | if (nargs && TREE_CODE (CALL_EXPR_ARG (exp, nargs - 1)) == CALL_EXPR) | |
11167 | { | |
11168 | tree fndecl2 = get_callee_fndecl (CALL_EXPR_ARG (exp, nargs - 1)); | |
11169 | if (fndecl2 | |
11170 | && TREE_CODE (fndecl2) == FUNCTION_DECL | |
11171 | && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL | |
11172 | && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK) | |
11173 | return NULL_TREE; | |
11174 | } | |
11175 | ||
11176 | if (avoid_folding_inline_builtin (fndecl)) | |
11177 | return NULL_TREE; | |
11178 | ||
11179 | if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD) | |
11180 | return targetm.fold_builtin (fndecl, call_expr_nargs (exp), | |
11181 | CALL_EXPR_ARGP (exp), ignore); | |
11182 | else | |
11183 | { | |
11184 | if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN) | |
11185 | { | |
11186 | tree *args = CALL_EXPR_ARGP (exp); | |
11187 | ret = fold_builtin_n (loc, fndecl, args, nargs, ignore); | |
11188 | } | |
11189 | if (!ret) | |
11190 | ret = fold_builtin_varargs (loc, fndecl, exp, ignore); | |
11191 | if (ret) | |
11192 | return ret; | |
11193 | } | |
11194 | } | |
11195 | return NULL_TREE; | |
11196 | } | |
11197 | ||
11198 | /* Conveniently construct a function call expression. FNDECL names the | |
11199 | function to be called and N arguments are passed in the array | |
11200 | ARGARRAY. */ | |
11201 | ||
11202 | tree | |
11203 | build_call_expr_loc_array (location_t loc, tree fndecl, int n, tree *argarray) | |
11204 | { | |
11205 | tree fntype = TREE_TYPE (fndecl); | |
11206 | tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl); | |
11207 | ||
11208 | return fold_builtin_call_array (loc, TREE_TYPE (fntype), fn, n, argarray); | |
11209 | } | |
11210 | ||
11211 | /* Conveniently construct a function call expression. FNDECL names the | |
11212 | function to be called and the arguments are passed in the vector | |
11213 | VEC. */ | |
11214 | ||
11215 | tree | |
11216 | build_call_expr_loc_vec (location_t loc, tree fndecl, VEC(tree,gc) *vec) | |
11217 | { | |
11218 | return build_call_expr_loc_array (loc, fndecl, VEC_length (tree, vec), | |
11219 | VEC_address (tree, vec)); | |
11220 | } | |
11221 | ||
11222 | ||
11223 | /* Conveniently construct a function call expression. FNDECL names the | |
11224 | function to be called, N is the number of arguments, and the "..." | |
11225 | parameters are the argument expressions. */ | |
11226 | ||
11227 | tree | |
11228 | build_call_expr_loc (location_t loc, tree fndecl, int n, ...) | |
11229 | { | |
11230 | va_list ap; | |
11231 | tree *argarray = XALLOCAVEC (tree, n); | |
11232 | int i; | |
11233 | ||
11234 | va_start (ap, n); | |
11235 | for (i = 0; i < n; i++) | |
11236 | argarray[i] = va_arg (ap, tree); | |
11237 | va_end (ap); | |
11238 | return build_call_expr_loc_array (loc, fndecl, n, argarray); | |
11239 | } | |
11240 | ||
11241 | /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because | |
11242 | varargs macros aren't supported by all bootstrap compilers. */ | |
11243 | ||
11244 | tree | |
11245 | build_call_expr (tree fndecl, int n, ...) | |
11246 | { | |
11247 | va_list ap; | |
11248 | tree *argarray = XALLOCAVEC (tree, n); | |
11249 | int i; | |
11250 | ||
11251 | va_start (ap, n); | |
11252 | for (i = 0; i < n; i++) | |
11253 | argarray[i] = va_arg (ap, tree); | |
11254 | va_end (ap); | |
11255 | return build_call_expr_loc_array (UNKNOWN_LOCATION, fndecl, n, argarray); | |
11256 | } | |
11257 | ||
11258 | /* Construct a CALL_EXPR with type TYPE with FN as the function expression. | |
11259 | N arguments are passed in the array ARGARRAY. */ | |
11260 | ||
11261 | tree | |
11262 | fold_builtin_call_array (location_t loc, tree type, | |
11263 | tree fn, | |
11264 | int n, | |
11265 | tree *argarray) | |
11266 | { | |
11267 | tree ret = NULL_TREE; | |
11268 | tree exp; | |
11269 | ||
11270 | if (TREE_CODE (fn) == ADDR_EXPR) | |
11271 | { | |
11272 | tree fndecl = TREE_OPERAND (fn, 0); | |
11273 | if (TREE_CODE (fndecl) == FUNCTION_DECL | |
11274 | && DECL_BUILT_IN (fndecl)) | |
11275 | { | |
11276 | /* If last argument is __builtin_va_arg_pack (), arguments to this | |
11277 | function are not finalized yet. Defer folding until they are. */ | |
11278 | if (n && TREE_CODE (argarray[n - 1]) == CALL_EXPR) | |
11279 | { | |
11280 | tree fndecl2 = get_callee_fndecl (argarray[n - 1]); | |
11281 | if (fndecl2 | |
11282 | && TREE_CODE (fndecl2) == FUNCTION_DECL | |
11283 | && DECL_BUILT_IN_CLASS (fndecl2) == BUILT_IN_NORMAL | |
11284 | && DECL_FUNCTION_CODE (fndecl2) == BUILT_IN_VA_ARG_PACK) | |
11285 | return build_call_array_loc (loc, type, fn, n, argarray); | |
11286 | } | |
11287 | if (avoid_folding_inline_builtin (fndecl)) | |
11288 | return build_call_array_loc (loc, type, fn, n, argarray); | |
11289 | if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD) | |
11290 | { | |
11291 | ret = targetm.fold_builtin (fndecl, n, argarray, false); | |
11292 | if (ret) | |
11293 | return ret; | |
11294 | ||
11295 | return build_call_array_loc (loc, type, fn, n, argarray); | |
11296 | } | |
11297 | else if (n <= MAX_ARGS_TO_FOLD_BUILTIN) | |
11298 | { | |
11299 | /* First try the transformations that don't require consing up | |
11300 | an exp. */ | |
11301 | ret = fold_builtin_n (loc, fndecl, argarray, n, false); | |
11302 | if (ret) | |
11303 | return ret; | |
11304 | } | |
11305 | ||
11306 | /* If we got this far, we need to build an exp. */ | |
11307 | exp = build_call_array_loc (loc, type, fn, n, argarray); | |
11308 | ret = fold_builtin_varargs (loc, fndecl, exp, false); | |
11309 | return ret ? ret : exp; | |
11310 | } | |
11311 | } | |
11312 | ||
11313 | return build_call_array_loc (loc, type, fn, n, argarray); | |
11314 | } | |
11315 | ||
11316 | /* Construct a new CALL_EXPR to FNDECL using the tail of the argument | |
11317 | list ARGS along with N new arguments in NEWARGS. SKIP is the number | |
11318 | of arguments in ARGS to be omitted. OLDNARGS is the number of | |
11319 | elements in ARGS. */ | |
11320 | ||
11321 | static tree | |
11322 | rewrite_call_expr_valist (location_t loc, int oldnargs, tree *args, | |
11323 | int skip, tree fndecl, int n, va_list newargs) | |
11324 | { | |
11325 | int nargs = oldnargs - skip + n; | |
11326 | tree *buffer; | |
11327 | ||
11328 | if (n > 0) | |
11329 | { | |
11330 | int i, j; | |
11331 | ||
11332 | buffer = XALLOCAVEC (tree, nargs); | |
11333 | for (i = 0; i < n; i++) | |
11334 | buffer[i] = va_arg (newargs, tree); | |
11335 | for (j = skip; j < oldnargs; j++, i++) | |
11336 | buffer[i] = args[j]; | |
11337 | } | |
11338 | else | |
11339 | buffer = args + skip; | |
11340 | ||
11341 | return build_call_expr_loc_array (loc, fndecl, nargs, buffer); | |
11342 | } | |
11343 | ||
11344 | /* Construct a new CALL_EXPR to FNDECL using the tail of the argument | |
11345 | list ARGS along with N new arguments specified as the "..." | |
11346 | parameters. SKIP is the number of arguments in ARGS to be omitted. | |
11347 | OLDNARGS is the number of elements in ARGS. */ | |
11348 | ||
11349 | static tree | |
11350 | rewrite_call_expr_array (location_t loc, int oldnargs, tree *args, | |
11351 | int skip, tree fndecl, int n, ...) | |
11352 | { | |
11353 | va_list ap; | |
11354 | tree t; | |
11355 | ||
11356 | va_start (ap, n); | |
11357 | t = rewrite_call_expr_valist (loc, oldnargs, args, skip, fndecl, n, ap); | |
11358 | va_end (ap); | |
11359 | ||
11360 | return t; | |
11361 | } | |
11362 | ||
11363 | /* Construct a new CALL_EXPR using the tail of the argument list of EXP | |
11364 | along with N new arguments specified as the "..." parameters. SKIP | |
11365 | is the number of arguments in EXP to be omitted. This function is used | |
11366 | to do varargs-to-varargs transformations. */ | |
11367 | ||
11368 | static tree | |
11369 | rewrite_call_expr (location_t loc, tree exp, int skip, tree fndecl, int n, ...) | |
11370 | { | |
11371 | va_list ap; | |
11372 | tree t; | |
11373 | ||
11374 | va_start (ap, n); | |
11375 | t = rewrite_call_expr_valist (loc, call_expr_nargs (exp), | |
11376 | CALL_EXPR_ARGP (exp), skip, fndecl, n, ap); | |
11377 | va_end (ap); | |
11378 | ||
11379 | return t; | |
11380 | } | |
11381 | ||
11382 | /* Validate a single argument ARG against a tree code CODE representing | |
11383 | a type. */ | |
11384 | ||
11385 | static bool | |
11386 | validate_arg (const_tree arg, enum tree_code code) | |
11387 | { | |
11388 | if (!arg) | |
11389 | return false; | |
11390 | else if (code == POINTER_TYPE) | |
11391 | return POINTER_TYPE_P (TREE_TYPE (arg)); | |
11392 | else if (code == INTEGER_TYPE) | |
11393 | return INTEGRAL_TYPE_P (TREE_TYPE (arg)); | |
11394 | return code == TREE_CODE (TREE_TYPE (arg)); | |
11395 | } | |
11396 | ||
11397 | /* This function validates the types of a function call argument list | |
11398 | against a specified list of tree_codes. If the last specifier is a 0, | |
11399 | that represents an ellipses, otherwise the last specifier must be a | |
11400 | VOID_TYPE. | |
11401 | ||
11402 | This is the GIMPLE version of validate_arglist. Eventually we want to | |
11403 | completely convert builtins.c to work from GIMPLEs and the tree based | |
11404 | validate_arglist will then be removed. */ | |
11405 | ||
11406 | bool | |
11407 | validate_gimple_arglist (const_gimple call, ...) | |
11408 | { | |
11409 | enum tree_code code; | |
11410 | bool res = 0; | |
11411 | va_list ap; | |
11412 | const_tree arg; | |
11413 | size_t i; | |
11414 | ||
11415 | va_start (ap, call); | |
11416 | i = 0; | |
11417 | ||
11418 | do | |
11419 | { | |
11420 | code = (enum tree_code) va_arg (ap, int); | |
11421 | switch (code) | |
11422 | { | |
11423 | case 0: | |
11424 | /* This signifies an ellipses, any further arguments are all ok. */ | |
11425 | res = true; | |
11426 | goto end; | |
11427 | case VOID_TYPE: | |
11428 | /* This signifies an endlink, if no arguments remain, return | |
11429 | true, otherwise return false. */ | |
11430 | res = (i == gimple_call_num_args (call)); | |
11431 | goto end; | |
11432 | default: | |
11433 | /* If no parameters remain or the parameter's code does not | |
11434 | match the specified code, return false. Otherwise continue | |
11435 | checking any remaining arguments. */ | |
11436 | arg = gimple_call_arg (call, i++); | |
11437 | if (!validate_arg (arg, code)) | |
11438 | goto end; | |
11439 | break; | |
11440 | } | |
11441 | } | |
11442 | while (1); | |
11443 | ||
11444 | /* We need gotos here since we can only have one VA_CLOSE in a | |
11445 | function. */ | |
11446 | end: ; | |
11447 | va_end (ap); | |
11448 | ||
11449 | return res; | |
11450 | } | |
11451 | ||
11452 | /* This function validates the types of a function call argument list | |
11453 | against a specified list of tree_codes. If the last specifier is a 0, | |
11454 | that represents an ellipses, otherwise the last specifier must be a | |
11455 | VOID_TYPE. */ | |
11456 | ||
11457 | bool | |
11458 | validate_arglist (const_tree callexpr, ...) | |
11459 | { | |
11460 | enum tree_code code; | |
11461 | bool res = 0; | |
11462 | va_list ap; | |
11463 | const_call_expr_arg_iterator iter; | |
11464 | const_tree arg; | |
11465 | ||
11466 | va_start (ap, callexpr); | |
11467 | init_const_call_expr_arg_iterator (callexpr, &iter); | |
11468 | ||
11469 | do | |
11470 | { | |
11471 | code = (enum tree_code) va_arg (ap, int); | |
11472 | switch (code) | |
11473 | { | |
11474 | case 0: | |
11475 | /* This signifies an ellipses, any further arguments are all ok. */ | |
11476 | res = true; | |
11477 | goto end; | |
11478 | case VOID_TYPE: | |
11479 | /* This signifies an endlink, if no arguments remain, return | |
11480 | true, otherwise return false. */ | |
11481 | res = !more_const_call_expr_args_p (&iter); | |
11482 | goto end; | |
11483 | default: | |
11484 | /* If no parameters remain or the parameter's code does not | |
11485 | match the specified code, return false. Otherwise continue | |
11486 | checking any remaining arguments. */ | |
11487 | arg = next_const_call_expr_arg (&iter); | |
11488 | if (!validate_arg (arg, code)) | |
11489 | goto end; | |
11490 | break; | |
11491 | } | |
11492 | } | |
11493 | while (1); | |
11494 | ||
11495 | /* We need gotos here since we can only have one VA_CLOSE in a | |
11496 | function. */ | |
11497 | end: ; | |
11498 | va_end (ap); | |
11499 | ||
11500 | return res; | |
11501 | } | |
11502 | ||
11503 | /* Default target-specific builtin expander that does nothing. */ | |
11504 | ||
11505 | rtx | |
11506 | default_expand_builtin (tree exp ATTRIBUTE_UNUSED, | |
11507 | rtx target ATTRIBUTE_UNUSED, | |
11508 | rtx subtarget ATTRIBUTE_UNUSED, | |
11509 | enum machine_mode mode ATTRIBUTE_UNUSED, | |
11510 | int ignore ATTRIBUTE_UNUSED) | |
11511 | { | |
11512 | return NULL_RTX; | |
11513 | } | |
11514 | ||
11515 | /* Returns true is EXP represents data that would potentially reside | |
11516 | in a readonly section. */ | |
11517 | ||
11518 | static bool | |
11519 | readonly_data_expr (tree exp) | |
11520 | { | |
11521 | STRIP_NOPS (exp); | |
11522 | ||
11523 | if (TREE_CODE (exp) != ADDR_EXPR) | |
11524 | return false; | |
11525 | ||
11526 | exp = get_base_address (TREE_OPERAND (exp, 0)); | |
11527 | if (!exp) | |
11528 | return false; | |
11529 | ||
11530 | /* Make sure we call decl_readonly_section only for trees it | |
11531 | can handle (since it returns true for everything it doesn't | |
11532 | understand). */ | |
11533 | if (TREE_CODE (exp) == STRING_CST | |
11534 | || TREE_CODE (exp) == CONSTRUCTOR | |
11535 | || (TREE_CODE (exp) == VAR_DECL && TREE_STATIC (exp))) | |
11536 | return decl_readonly_section (exp, 0); | |
11537 | else | |
11538 | return false; | |
11539 | } | |
11540 | ||
11541 | /* Simplify a call to the strstr builtin. S1 and S2 are the arguments | |
11542 | to the call, and TYPE is its return type. | |
11543 | ||
11544 | Return NULL_TREE if no simplification was possible, otherwise return the | |
11545 | simplified form of the call as a tree. | |
11546 | ||
11547 | The simplified form may be a constant or other expression which | |
11548 | computes the same value, but in a more efficient manner (including | |
11549 | calls to other builtin functions). | |
11550 | ||
11551 | The call may contain arguments which need to be evaluated, but | |
11552 | which are not useful to determine the result of the call. In | |
11553 | this case we return a chain of COMPOUND_EXPRs. The LHS of each | |
11554 | COMPOUND_EXPR will be an argument which must be evaluated. | |
11555 | COMPOUND_EXPRs are chained through their RHS. The RHS of the last | |
11556 | COMPOUND_EXPR in the chain will contain the tree for the simplified | |
11557 | form of the builtin function call. */ | |
11558 | ||
11559 | static tree | |
11560 | fold_builtin_strstr (location_t loc, tree s1, tree s2, tree type) | |
11561 | { | |
11562 | if (!validate_arg (s1, POINTER_TYPE) | |
11563 | || !validate_arg (s2, POINTER_TYPE)) | |
11564 | return NULL_TREE; | |
11565 | else | |
11566 | { | |
11567 | tree fn; | |
11568 | const char *p1, *p2; | |
11569 | ||
11570 | p2 = c_getstr (s2); | |
11571 | if (p2 == NULL) | |
11572 | return NULL_TREE; | |
11573 | ||
11574 | p1 = c_getstr (s1); | |
11575 | if (p1 != NULL) | |
11576 | { | |
11577 | const char *r = strstr (p1, p2); | |
11578 | tree tem; | |
11579 | ||
11580 | if (r == NULL) | |
11581 | return build_int_cst (TREE_TYPE (s1), 0); | |
11582 | ||
11583 | /* Return an offset into the constant string argument. */ | |
11584 | tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1); | |
11585 | return fold_convert_loc (loc, type, tem); | |
11586 | } | |
11587 | ||
11588 | /* The argument is const char *, and the result is char *, so we need | |
11589 | a type conversion here to avoid a warning. */ | |
11590 | if (p2[0] == '\0') | |
11591 | return fold_convert_loc (loc, type, s1); | |
11592 | ||
11593 | if (p2[1] != '\0') | |
11594 | return NULL_TREE; | |
11595 | ||
11596 | fn = builtin_decl_implicit (BUILT_IN_STRCHR); | |
11597 | if (!fn) | |
11598 | return NULL_TREE; | |
11599 | ||
11600 | /* New argument list transforming strstr(s1, s2) to | |
11601 | strchr(s1, s2[0]). */ | |
11602 | return build_call_expr_loc (loc, fn, 2, s1, | |
11603 | build_int_cst (integer_type_node, p2[0])); | |
11604 | } | |
11605 | } | |
11606 | ||
11607 | /* Simplify a call to the strchr builtin. S1 and S2 are the arguments to | |
11608 | the call, and TYPE is its return type. | |
11609 | ||
11610 | Return NULL_TREE if no simplification was possible, otherwise return the | |
11611 | simplified form of the call as a tree. | |
11612 | ||
11613 | The simplified form may be a constant or other expression which | |
11614 | computes the same value, but in a more efficient manner (including | |
11615 | calls to other builtin functions). | |
11616 | ||
11617 | The call may contain arguments which need to be evaluated, but | |
11618 | which are not useful to determine the result of the call. In | |
11619 | this case we return a chain of COMPOUND_EXPRs. The LHS of each | |
11620 | COMPOUND_EXPR will be an argument which must be evaluated. | |
11621 | COMPOUND_EXPRs are chained through their RHS. The RHS of the last | |
11622 | COMPOUND_EXPR in the chain will contain the tree for the simplified | |
11623 | form of the builtin function call. */ | |
11624 | ||
11625 | static tree | |
11626 | fold_builtin_strchr (location_t loc, tree s1, tree s2, tree type) | |
11627 | { | |
11628 | if (!validate_arg (s1, POINTER_TYPE) | |
11629 | || !validate_arg (s2, INTEGER_TYPE)) | |
11630 | return NULL_TREE; | |
11631 | else | |
11632 | { | |
11633 | const char *p1; | |
11634 | ||
11635 | if (TREE_CODE (s2) != INTEGER_CST) | |
11636 | return NULL_TREE; | |
11637 | ||
11638 | p1 = c_getstr (s1); | |
11639 | if (p1 != NULL) | |
11640 | { | |
11641 | char c; | |
11642 | const char *r; | |
11643 | tree tem; | |
11644 | ||
11645 | if (target_char_cast (s2, &c)) | |
11646 | return NULL_TREE; | |
11647 | ||
11648 | r = strchr (p1, c); | |
11649 | ||
11650 | if (r == NULL) | |
11651 | return build_int_cst (TREE_TYPE (s1), 0); | |
11652 | ||
11653 | /* Return an offset into the constant string argument. */ | |
11654 | tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1); | |
11655 | return fold_convert_loc (loc, type, tem); | |
11656 | } | |
11657 | return NULL_TREE; | |
11658 | } | |
11659 | } | |
11660 | ||
11661 | /* Simplify a call to the strrchr builtin. S1 and S2 are the arguments to | |
11662 | the call, and TYPE is its return type. | |
11663 | ||
11664 | Return NULL_TREE if no simplification was possible, otherwise return the | |
11665 | simplified form of the call as a tree. | |
11666 | ||
11667 | The simplified form may be a constant or other expression which | |
11668 | computes the same value, but in a more efficient manner (including | |
11669 | calls to other builtin functions). | |
11670 | ||
11671 | The call may contain arguments which need to be evaluated, but | |
11672 | which are not useful to determine the result of the call. In | |
11673 | this case we return a chain of COMPOUND_EXPRs. The LHS of each | |
11674 | COMPOUND_EXPR will be an argument which must be evaluated. | |
11675 | COMPOUND_EXPRs are chained through their RHS. The RHS of the last | |
11676 | COMPOUND_EXPR in the chain will contain the tree for the simplified | |
11677 | form of the builtin function call. */ | |
11678 | ||
11679 | static tree | |
11680 | fold_builtin_strrchr (location_t loc, tree s1, tree s2, tree type) | |
11681 | { | |
11682 | if (!validate_arg (s1, POINTER_TYPE) | |
11683 | || !validate_arg (s2, INTEGER_TYPE)) | |
11684 | return NULL_TREE; | |
11685 | else | |
11686 | { | |
11687 | tree fn; | |
11688 | const char *p1; | |
11689 | ||
11690 | if (TREE_CODE (s2) != INTEGER_CST) | |
11691 | return NULL_TREE; | |
11692 | ||
11693 | p1 = c_getstr (s1); | |
11694 | if (p1 != NULL) | |
11695 | { | |
11696 | char c; | |
11697 | const char *r; | |
11698 | tree tem; | |
11699 | ||
11700 | if (target_char_cast (s2, &c)) | |
11701 | return NULL_TREE; | |
11702 | ||
11703 | r = strrchr (p1, c); | |
11704 | ||
11705 | if (r == NULL) | |
11706 | return build_int_cst (TREE_TYPE (s1), 0); | |
11707 | ||
11708 | /* Return an offset into the constant string argument. */ | |
11709 | tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1); | |
11710 | return fold_convert_loc (loc, type, tem); | |
11711 | } | |
11712 | ||
11713 | if (! integer_zerop (s2)) | |
11714 | return NULL_TREE; | |
11715 | ||
11716 | fn = builtin_decl_implicit (BUILT_IN_STRCHR); | |
11717 | if (!fn) | |
11718 | return NULL_TREE; | |
11719 | ||
11720 | /* Transform strrchr(s1, '\0') to strchr(s1, '\0'). */ | |
11721 | return build_call_expr_loc (loc, fn, 2, s1, s2); | |
11722 | } | |
11723 | } | |
11724 | ||
11725 | /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments | |
11726 | to the call, and TYPE is its return type. | |
11727 | ||
11728 | Return NULL_TREE if no simplification was possible, otherwise return the | |
11729 | simplified form of the call as a tree. | |
11730 | ||
11731 | The simplified form may be a constant or other expression which | |
11732 | computes the same value, but in a more efficient manner (including | |
11733 | calls to other builtin functions). | |
11734 | ||
11735 | The call may contain arguments which need to be evaluated, but | |
11736 | which are not useful to determine the result of the call. In | |
11737 | this case we return a chain of COMPOUND_EXPRs. The LHS of each | |
11738 | COMPOUND_EXPR will be an argument which must be evaluated. | |
11739 | COMPOUND_EXPRs are chained through their RHS. The RHS of the last | |
11740 | COMPOUND_EXPR in the chain will contain the tree for the simplified | |
11741 | form of the builtin function call. */ | |
11742 | ||
11743 | static tree | |
11744 | fold_builtin_strpbrk (location_t loc, tree s1, tree s2, tree type) | |
11745 | { | |
11746 | if (!validate_arg (s1, POINTER_TYPE) | |
11747 | || !validate_arg (s2, POINTER_TYPE)) | |
11748 | return NULL_TREE; | |
11749 | else | |
11750 | { | |
11751 | tree fn; | |
11752 | const char *p1, *p2; | |
11753 | ||
11754 | p2 = c_getstr (s2); | |
11755 | if (p2 == NULL) | |
11756 | return NULL_TREE; | |
11757 | ||
11758 | p1 = c_getstr (s1); | |
11759 | if (p1 != NULL) | |
11760 | { | |
11761 | const char *r = strpbrk (p1, p2); | |
11762 | tree tem; | |
11763 | ||
11764 | if (r == NULL) | |
11765 | return build_int_cst (TREE_TYPE (s1), 0); | |
11766 | ||
11767 | /* Return an offset into the constant string argument. */ | |
11768 | tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1); | |
11769 | return fold_convert_loc (loc, type, tem); | |
11770 | } | |
11771 | ||
11772 | if (p2[0] == '\0') | |
11773 | /* strpbrk(x, "") == NULL. | |
11774 | Evaluate and ignore s1 in case it had side-effects. */ | |
11775 | return omit_one_operand_loc (loc, TREE_TYPE (s1), integer_zero_node, s1); | |
11776 | ||
11777 | if (p2[1] != '\0') | |
11778 | return NULL_TREE; /* Really call strpbrk. */ | |
11779 | ||
11780 | fn = builtin_decl_implicit (BUILT_IN_STRCHR); | |
11781 | if (!fn) | |
11782 | return NULL_TREE; | |
11783 | ||
11784 | /* New argument list transforming strpbrk(s1, s2) to | |
11785 | strchr(s1, s2[0]). */ | |
11786 | return build_call_expr_loc (loc, fn, 2, s1, | |
11787 | build_int_cst (integer_type_node, p2[0])); | |
11788 | } | |
11789 | } | |
11790 | ||
11791 | /* Simplify a call to the strcat builtin. DST and SRC are the arguments | |
11792 | to the call. | |
11793 | ||
11794 | Return NULL_TREE if no simplification was possible, otherwise return the | |
11795 | simplified form of the call as a tree. | |
11796 | ||
11797 | The simplified form may be a constant or other expression which | |
11798 | computes the same value, but in a more efficient manner (including | |
11799 | calls to other builtin functions). | |
11800 | ||
11801 | The call may contain arguments which need to be evaluated, but | |
11802 | which are not useful to determine the result of the call. In | |
11803 | this case we return a chain of COMPOUND_EXPRs. The LHS of each | |
11804 | COMPOUND_EXPR will be an argument which must be evaluated. | |
11805 | COMPOUND_EXPRs are chained through their RHS. The RHS of the last | |
11806 | COMPOUND_EXPR in the chain will contain the tree for the simplified | |
11807 | form of the builtin function call. */ | |
11808 | ||
11809 | static tree | |
11810 | fold_builtin_strcat (location_t loc ATTRIBUTE_UNUSED, tree dst, tree src) | |
11811 | { | |
11812 | if (!validate_arg (dst, POINTER_TYPE) | |
11813 | || !validate_arg (src, POINTER_TYPE)) | |
11814 | return NULL_TREE; | |
11815 | else | |
11816 | { | |
11817 | const char *p = c_getstr (src); | |
11818 | ||
11819 | /* If the string length is zero, return the dst parameter. */ | |
11820 | if (p && *p == '\0') | |
11821 | return dst; | |
11822 | ||
11823 | if (optimize_insn_for_speed_p ()) | |
11824 | { | |
11825 | /* See if we can store by pieces into (dst + strlen(dst)). */ | |
11826 | tree newdst, call; | |
11827 | tree strlen_fn = builtin_decl_implicit (BUILT_IN_STRLEN); | |
11828 | tree strcpy_fn = builtin_decl_implicit (BUILT_IN_STRCPY); | |
11829 | ||
11830 | if (!strlen_fn || !strcpy_fn) | |
11831 | return NULL_TREE; | |
11832 | ||
11833 | /* If we don't have a movstr we don't want to emit an strcpy | |
11834 | call. We have to do that if the length of the source string | |
11835 | isn't computable (in that case we can use memcpy probably | |
11836 | later expanding to a sequence of mov instructions). If we | |
11837 | have movstr instructions we can emit strcpy calls. */ | |
11838 | if (!HAVE_movstr) | |
11839 | { | |
11840 | tree len = c_strlen (src, 1); | |
11841 | if (! len || TREE_SIDE_EFFECTS (len)) | |
11842 | return NULL_TREE; | |
11843 | } | |
11844 | ||
11845 | /* Stabilize the argument list. */ | |
11846 | dst = builtin_save_expr (dst); | |
11847 | ||
11848 | /* Create strlen (dst). */ | |
11849 | newdst = build_call_expr_loc (loc, strlen_fn, 1, dst); | |
11850 | /* Create (dst p+ strlen (dst)). */ | |
11851 | ||
11852 | newdst = fold_build_pointer_plus_loc (loc, dst, newdst); | |
11853 | newdst = builtin_save_expr (newdst); | |
11854 | ||
11855 | call = build_call_expr_loc (loc, strcpy_fn, 2, newdst, src); | |
11856 | return build2 (COMPOUND_EXPR, TREE_TYPE (dst), call, dst); | |
11857 | } | |
11858 | return NULL_TREE; | |
11859 | } | |
11860 | } | |
11861 | ||
11862 | /* Simplify a call to the strncat builtin. DST, SRC, and LEN are the | |
11863 | arguments to the call. | |
11864 | ||
11865 | Return NULL_TREE if no simplification was possible, otherwise return the | |
11866 | simplified form of the call as a tree. | |
11867 | ||
11868 | The simplified form may be a constant or other expression which | |
11869 | computes the same value, but in a more efficient manner (including | |
11870 | calls to other builtin functions). | |
11871 | ||
11872 | The call may contain arguments which need to be evaluated, but | |
11873 | which are not useful to determine the result of the call. In | |
11874 | this case we return a chain of COMPOUND_EXPRs. The LHS of each | |
11875 | COMPOUND_EXPR will be an argument which must be evaluated. | |
11876 | COMPOUND_EXPRs are chained through their RHS. The RHS of the last | |
11877 | COMPOUND_EXPR in the chain will contain the tree for the simplified | |
11878 | form of the builtin function call. */ | |
11879 | ||
11880 | static tree | |
11881 | fold_builtin_strncat (location_t loc, tree dst, tree src, tree len) | |
11882 | { | |
11883 | if (!validate_arg (dst, POINTER_TYPE) | |
11884 | || !validate_arg (src, POINTER_TYPE) | |
11885 | || !validate_arg (len, INTEGER_TYPE)) | |
11886 | return NULL_TREE; | |
11887 | else | |
11888 | { | |
11889 | const char *p = c_getstr (src); | |
11890 | ||
11891 | /* If the requested length is zero, or the src parameter string | |
11892 | length is zero, return the dst parameter. */ | |
11893 | if (integer_zerop (len) || (p && *p == '\0')) | |
11894 | return omit_two_operands_loc (loc, TREE_TYPE (dst), dst, src, len); | |
11895 | ||
11896 | /* If the requested len is greater than or equal to the string | |
11897 | length, call strcat. */ | |
11898 | if (TREE_CODE (len) == INTEGER_CST && p | |
11899 | && compare_tree_int (len, strlen (p)) >= 0) | |
11900 | { | |
11901 | tree fn = builtin_decl_implicit (BUILT_IN_STRCAT); | |
11902 | ||
11903 | /* If the replacement _DECL isn't initialized, don't do the | |
11904 | transformation. */ | |
11905 | if (!fn) | |
11906 | return NULL_TREE; | |
11907 | ||
11908 | return build_call_expr_loc (loc, fn, 2, dst, src); | |
11909 | } | |
11910 | return NULL_TREE; | |
11911 | } | |
11912 | } | |
11913 | ||
11914 | /* Simplify a call to the strspn builtin. S1 and S2 are the arguments | |
11915 | to the call. | |
11916 | ||
11917 | Return NULL_TREE if no simplification was possible, otherwise return the | |
11918 | simplified form of the call as a tree. | |
11919 | ||
11920 | The simplified form may be a constant or other expression which | |
11921 | computes the same value, but in a more efficient manner (including | |
11922 | calls to other builtin functions). | |
11923 | ||
11924 | The call may contain arguments which need to be evaluated, but | |
11925 | which are not useful to determine the result of the call. In | |
11926 | this case we return a chain of COMPOUND_EXPRs. The LHS of each | |
11927 | COMPOUND_EXPR will be an argument which must be evaluated. | |
11928 | COMPOUND_EXPRs are chained through their RHS. The RHS of the last | |
11929 | COMPOUND_EXPR in the chain will contain the tree for the simplified | |
11930 | form of the builtin function call. */ | |
11931 | ||
11932 | static tree | |
11933 | fold_builtin_strspn (location_t loc, tree s1, tree s2) | |
11934 | { | |
11935 | if (!validate_arg (s1, POINTER_TYPE) | |
11936 | || !validate_arg (s2, POINTER_TYPE)) | |
11937 | return NULL_TREE; | |
11938 | else | |
11939 | { | |
11940 | const char *p1 = c_getstr (s1), *p2 = c_getstr (s2); | |
11941 | ||
11942 | /* If both arguments are constants, evaluate at compile-time. */ | |
11943 | if (p1 && p2) | |
11944 | { | |
11945 | const size_t r = strspn (p1, p2); | |
11946 | return build_int_cst (size_type_node, r); | |
11947 | } | |
11948 | ||
11949 | /* If either argument is "", return NULL_TREE. */ | |
11950 | if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0')) | |
11951 | /* Evaluate and ignore both arguments in case either one has | |
11952 | side-effects. */ | |
11953 | return omit_two_operands_loc (loc, size_type_node, size_zero_node, | |
11954 | s1, s2); | |
11955 | return NULL_TREE; | |
11956 | } | |
11957 | } | |
11958 | ||
11959 | /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments | |
11960 | to the call. | |
11961 | ||
11962 | Return NULL_TREE if no simplification was possible, otherwise return the | |
11963 | simplified form of the call as a tree. | |
11964 | ||
11965 | The simplified form may be a constant or other expression which | |
11966 | computes the same value, but in a more efficient manner (including | |
11967 | calls to other builtin functions). | |
11968 | ||
11969 | The call may contain arguments which need to be evaluated, but | |
11970 | which are not useful to determine the result of the call. In | |
11971 | this case we return a chain of COMPOUND_EXPRs. The LHS of each | |
11972 | COMPOUND_EXPR will be an argument which must be evaluated. | |
11973 | COMPOUND_EXPRs are chained through their RHS. The RHS of the last | |
11974 | COMPOUND_EXPR in the chain will contain the tree for the simplified | |
11975 | form of the builtin function call. */ | |
11976 | ||
11977 | static tree | |
11978 | fold_builtin_strcspn (location_t loc, tree s1, tree s2) | |
11979 | { | |
11980 | if (!validate_arg (s1, POINTER_TYPE) | |
11981 | || !validate_arg (s2, POINTER_TYPE)) | |
11982 | return NULL_TREE; | |
11983 | else | |
11984 | { | |
11985 | const char *p1 = c_getstr (s1), *p2 = c_getstr (s2); | |
11986 | ||
11987 | /* If both arguments are constants, evaluate at compile-time. */ | |
11988 | if (p1 && p2) | |
11989 | { | |
11990 | const size_t r = strcspn (p1, p2); | |
11991 | return build_int_cst (size_type_node, r); | |
11992 | } | |
11993 | ||
11994 | /* If the first argument is "", return NULL_TREE. */ | |
11995 | if (p1 && *p1 == '\0') | |
11996 | { | |
11997 | /* Evaluate and ignore argument s2 in case it has | |
11998 | side-effects. */ | |
11999 | return omit_one_operand_loc (loc, size_type_node, | |
12000 | size_zero_node, s2); | |
12001 | } | |
12002 | ||
12003 | /* If the second argument is "", return __builtin_strlen(s1). */ | |
12004 | if (p2 && *p2 == '\0') | |
12005 | { | |
12006 | tree fn = builtin_decl_implicit (BUILT_IN_STRLEN); | |
12007 | ||
12008 | /* If the replacement _DECL isn't initialized, don't do the | |
12009 | transformation. */ | |
12010 | if (!fn) | |
12011 | return NULL_TREE; | |
12012 | ||
12013 | return build_call_expr_loc (loc, fn, 1, s1); | |
12014 | } | |
12015 | return NULL_TREE; | |
12016 | } | |
12017 | } | |
12018 | ||
12019 | /* Fold a call to the fputs builtin. ARG0 and ARG1 are the arguments | |
12020 | to the call. IGNORE is true if the value returned | |
12021 | by the builtin will be ignored. UNLOCKED is true is true if this | |
12022 | actually a call to fputs_unlocked. If LEN in non-NULL, it represents | |
12023 | the known length of the string. Return NULL_TREE if no simplification | |
12024 | was possible. */ | |
12025 | ||
12026 | tree | |
12027 | fold_builtin_fputs (location_t loc, tree arg0, tree arg1, | |
12028 | bool ignore, bool unlocked, tree len) | |
12029 | { | |
12030 | /* If we're using an unlocked function, assume the other unlocked | |
12031 | functions exist explicitly. */ | |
12032 | tree const fn_fputc = (unlocked | |
12033 | ? builtin_decl_explicit (BUILT_IN_FPUTC_UNLOCKED) | |
12034 | : builtin_decl_implicit (BUILT_IN_FPUTC)); | |
12035 | tree const fn_fwrite = (unlocked | |
12036 | ? builtin_decl_explicit (BUILT_IN_FWRITE_UNLOCKED) | |
12037 | : builtin_decl_implicit (BUILT_IN_FWRITE)); | |
12038 | ||
12039 | /* If the return value is used, don't do the transformation. */ | |
12040 | if (!ignore) | |
12041 | return NULL_TREE; | |
12042 | ||
12043 | /* Verify the arguments in the original call. */ | |
12044 | if (!validate_arg (arg0, POINTER_TYPE) | |
12045 | || !validate_arg (arg1, POINTER_TYPE)) | |
12046 | return NULL_TREE; | |
12047 | ||
12048 | if (! len) | |
12049 | len = c_strlen (arg0, 0); | |
12050 | ||
12051 | /* Get the length of the string passed to fputs. If the length | |
12052 | can't be determined, punt. */ | |
12053 | if (!len | |
12054 | || TREE_CODE (len) != INTEGER_CST) | |
12055 | return NULL_TREE; | |
12056 | ||
12057 | switch (compare_tree_int (len, 1)) | |
12058 | { | |
12059 | case -1: /* length is 0, delete the call entirely . */ | |
12060 | return omit_one_operand_loc (loc, integer_type_node, | |
12061 | integer_zero_node, arg1);; | |
12062 | ||
12063 | case 0: /* length is 1, call fputc. */ | |
12064 | { | |
12065 | const char *p = c_getstr (arg0); | |
12066 | ||
12067 | if (p != NULL) | |
12068 | { | |
12069 | if (fn_fputc) | |
12070 | return build_call_expr_loc (loc, fn_fputc, 2, | |
12071 | build_int_cst | |
12072 | (integer_type_node, p[0]), arg1); | |
12073 | else | |
12074 | return NULL_TREE; | |
12075 | } | |
12076 | } | |
12077 | /* FALLTHROUGH */ | |
12078 | case 1: /* length is greater than 1, call fwrite. */ | |
12079 | { | |
12080 | /* If optimizing for size keep fputs. */ | |
12081 | if (optimize_function_for_size_p (cfun)) | |
12082 | return NULL_TREE; | |
12083 | /* New argument list transforming fputs(string, stream) to | |
12084 | fwrite(string, 1, len, stream). */ | |
12085 | if (fn_fwrite) | |
12086 | return build_call_expr_loc (loc, fn_fwrite, 4, arg0, | |
12087 | size_one_node, len, arg1); | |
12088 | else | |
12089 | return NULL_TREE; | |
12090 | } | |
12091 | default: | |
12092 | gcc_unreachable (); | |
12093 | } | |
12094 | return NULL_TREE; | |
12095 | } | |
12096 | ||
12097 | /* Fold the next_arg or va_start call EXP. Returns true if there was an error | |
12098 | produced. False otherwise. This is done so that we don't output the error | |
12099 | or warning twice or three times. */ | |
12100 | ||
12101 | bool | |
12102 | fold_builtin_next_arg (tree exp, bool va_start_p) | |
12103 | { | |
12104 | tree fntype = TREE_TYPE (current_function_decl); | |
12105 | int nargs = call_expr_nargs (exp); | |
12106 | tree arg; | |
12107 | ||
12108 | if (!stdarg_p (fntype)) | |
12109 | { | |
12110 | error ("%<va_start%> used in function with fixed args"); | |
12111 | return true; | |
12112 | } | |
12113 | ||
12114 | if (va_start_p) | |
12115 | { | |
12116 | if (va_start_p && (nargs != 2)) | |
12117 | { | |
12118 | error ("wrong number of arguments to function %<va_start%>"); | |
12119 | return true; | |
12120 | } | |
12121 | arg = CALL_EXPR_ARG (exp, 1); | |
12122 | } | |
12123 | /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0) | |
12124 | when we checked the arguments and if needed issued a warning. */ | |
12125 | else | |
12126 | { | |
12127 | if (nargs == 0) | |
12128 | { | |
12129 | /* Evidently an out of date version of <stdarg.h>; can't validate | |
12130 | va_start's second argument, but can still work as intended. */ | |
12131 | warning (0, "%<__builtin_next_arg%> called without an argument"); | |
12132 | return true; | |
12133 | } | |
12134 | else if (nargs > 1) | |
12135 | { | |
12136 | error ("wrong number of arguments to function %<__builtin_next_arg%>"); | |
12137 | return true; | |
12138 | } | |
12139 | arg = CALL_EXPR_ARG (exp, 0); | |
12140 | } | |
12141 | ||
12142 | if (TREE_CODE (arg) == SSA_NAME) | |
12143 | arg = SSA_NAME_VAR (arg); | |
12144 | ||
12145 | /* We destructively modify the call to be __builtin_va_start (ap, 0) | |
12146 | or __builtin_next_arg (0) the first time we see it, after checking | |
12147 | the arguments and if needed issuing a warning. */ | |
12148 | if (!integer_zerop (arg)) | |
12149 | { | |
12150 | tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl)); | |
12151 | ||
12152 | /* Strip off all nops for the sake of the comparison. This | |
12153 | is not quite the same as STRIP_NOPS. It does more. | |
12154 | We must also strip off INDIRECT_EXPR for C++ reference | |
12155 | parameters. */ | |
12156 | while (CONVERT_EXPR_P (arg) | |
12157 | || TREE_CODE (arg) == INDIRECT_REF) | |
12158 | arg = TREE_OPERAND (arg, 0); | |
12159 | if (arg != last_parm) | |
12160 | { | |
12161 | /* FIXME: Sometimes with the tree optimizers we can get the | |
12162 | not the last argument even though the user used the last | |
12163 | argument. We just warn and set the arg to be the last | |
12164 | argument so that we will get wrong-code because of | |
12165 | it. */ | |
12166 | warning (0, "second parameter of %<va_start%> not last named argument"); | |
12167 | } | |
12168 | ||
12169 | /* Undefined by C99 7.15.1.4p4 (va_start): | |
12170 | "If the parameter parmN is declared with the register storage | |
12171 | class, with a function or array type, or with a type that is | |
12172 | not compatible with the type that results after application of | |
12173 | the default argument promotions, the behavior is undefined." | |
12174 | */ | |
12175 | else if (DECL_REGISTER (arg)) | |
12176 | warning (0, "undefined behaviour when second parameter of " | |
12177 | "%<va_start%> is declared with %<register%> storage"); | |
12178 | ||
12179 | /* We want to verify the second parameter just once before the tree | |
12180 | optimizers are run and then avoid keeping it in the tree, | |
12181 | as otherwise we could warn even for correct code like: | |
12182 | void foo (int i, ...) | |
12183 | { va_list ap; i++; va_start (ap, i); va_end (ap); } */ | |
12184 | if (va_start_p) | |
12185 | CALL_EXPR_ARG (exp, 1) = integer_zero_node; | |
12186 | else | |
12187 | CALL_EXPR_ARG (exp, 0) = integer_zero_node; | |
12188 | } | |
12189 | return false; | |
12190 | } | |
12191 | ||
12192 | ||
12193 | /* Simplify a call to the sprintf builtin with arguments DEST, FMT, and ORIG. | |
12194 | ORIG may be null if this is a 2-argument call. We don't attempt to | |
12195 | simplify calls with more than 3 arguments. | |
12196 | ||
12197 | Return NULL_TREE if no simplification was possible, otherwise return the | |
12198 | simplified form of the call as a tree. If IGNORED is true, it means that | |
12199 | the caller does not use the returned value of the function. */ | |
12200 | ||
12201 | static tree | |
12202 | fold_builtin_sprintf (location_t loc, tree dest, tree fmt, | |
12203 | tree orig, int ignored) | |
12204 | { | |
12205 | tree call, retval; | |
12206 | const char *fmt_str = NULL; | |
12207 | ||
12208 | /* Verify the required arguments in the original call. We deal with two | |
12209 | types of sprintf() calls: 'sprintf (str, fmt)' and | |
12210 | 'sprintf (dest, "%s", orig)'. */ | |
12211 | if (!validate_arg (dest, POINTER_TYPE) | |
12212 | || !validate_arg (fmt, POINTER_TYPE)) | |
12213 | return NULL_TREE; | |
12214 | if (orig && !validate_arg (orig, POINTER_TYPE)) | |
12215 | return NULL_TREE; | |
12216 | ||
12217 | /* Check whether the format is a literal string constant. */ | |
12218 | fmt_str = c_getstr (fmt); | |
12219 | if (fmt_str == NULL) | |
12220 | return NULL_TREE; | |
12221 | ||
12222 | call = NULL_TREE; | |
12223 | retval = NULL_TREE; | |
12224 | ||
12225 | if (!init_target_chars ()) | |
12226 | return NULL_TREE; | |
12227 | ||
12228 | /* If the format doesn't contain % args or %%, use strcpy. */ | |
12229 | if (strchr (fmt_str, target_percent) == NULL) | |
12230 | { | |
12231 | tree fn = builtin_decl_implicit (BUILT_IN_STRCPY); | |
12232 | ||
12233 | if (!fn) | |
12234 | return NULL_TREE; | |
12235 | ||
12236 | /* Don't optimize sprintf (buf, "abc", ptr++). */ | |
12237 | if (orig) | |
12238 | return NULL_TREE; | |
12239 | ||
12240 | /* Convert sprintf (str, fmt) into strcpy (str, fmt) when | |
12241 | 'format' is known to contain no % formats. */ | |
12242 | call = build_call_expr_loc (loc, fn, 2, dest, fmt); | |
12243 | if (!ignored) | |
12244 | retval = build_int_cst (integer_type_node, strlen (fmt_str)); | |
12245 | } | |
12246 | ||
12247 | /* If the format is "%s", use strcpy if the result isn't used. */ | |
12248 | else if (fmt_str && strcmp (fmt_str, target_percent_s) == 0) | |
12249 | { | |
12250 | tree fn; | |
12251 | fn = builtin_decl_implicit (BUILT_IN_STRCPY); | |
12252 | ||
12253 | if (!fn) | |
12254 | return NULL_TREE; | |
12255 | ||
12256 | /* Don't crash on sprintf (str1, "%s"). */ | |
12257 | if (!orig) | |
12258 | return NULL_TREE; | |
12259 | ||
12260 | /* Convert sprintf (str1, "%s", str2) into strcpy (str1, str2). */ | |
12261 | if (!ignored) | |
12262 | { | |
12263 | retval = c_strlen (orig, 1); | |
12264 | if (!retval || TREE_CODE (retval) != INTEGER_CST) | |
12265 | return NULL_TREE; | |
12266 | } | |
12267 | call = build_call_expr_loc (loc, fn, 2, dest, orig); | |
12268 | } | |
12269 | ||
12270 | if (call && retval) | |
12271 | { | |
12272 | retval = fold_convert_loc | |
12273 | (loc, TREE_TYPE (TREE_TYPE (builtin_decl_implicit (BUILT_IN_SPRINTF))), | |
12274 | retval); | |
12275 | return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval); | |
12276 | } | |
12277 | else | |
12278 | return call; | |
12279 | } | |
12280 | ||
12281 | /* Simplify a call to the snprintf builtin with arguments DEST, DESTSIZE, | |
12282 | FMT, and ORIG. ORIG may be null if this is a 3-argument call. We don't | |
12283 | attempt to simplify calls with more than 4 arguments. | |
12284 | ||
12285 | Return NULL_TREE if no simplification was possible, otherwise return the | |
12286 | simplified form of the call as a tree. If IGNORED is true, it means that | |
12287 | the caller does not use the returned value of the function. */ | |
12288 | ||
12289 | static tree | |
12290 | fold_builtin_snprintf (location_t loc, tree dest, tree destsize, tree fmt, | |
12291 | tree orig, int ignored) | |
12292 | { | |
12293 | tree call, retval; | |
12294 | const char *fmt_str = NULL; | |
12295 | unsigned HOST_WIDE_INT destlen; | |
12296 | ||
12297 | /* Verify the required arguments in the original call. We deal with two | |
12298 | types of snprintf() calls: 'snprintf (str, cst, fmt)' and | |
12299 | 'snprintf (dest, cst, "%s", orig)'. */ | |
12300 | if (!validate_arg (dest, POINTER_TYPE) | |
12301 | || !validate_arg (destsize, INTEGER_TYPE) | |
12302 | || !validate_arg (fmt, POINTER_TYPE)) | |
12303 | return NULL_TREE; | |
12304 | if (orig && !validate_arg (orig, POINTER_TYPE)) | |
12305 | return NULL_TREE; | |
12306 | ||
12307 | if (!host_integerp (destsize, 1)) | |
12308 | return NULL_TREE; | |
12309 | ||
12310 | /* Check whether the format is a literal string constant. */ | |
12311 | fmt_str = c_getstr (fmt); | |
12312 | if (fmt_str == NULL) | |
12313 | return NULL_TREE; | |
12314 | ||
12315 | call = NULL_TREE; | |
12316 | retval = NULL_TREE; | |
12317 | ||
12318 | if (!init_target_chars ()) | |
12319 | return NULL_TREE; | |
12320 | ||
12321 | destlen = tree_low_cst (destsize, 1); | |
12322 | ||
12323 | /* If the format doesn't contain % args or %%, use strcpy. */ | |
12324 | if (strchr (fmt_str, target_percent) == NULL) | |
12325 | { | |
12326 | tree fn = builtin_decl_implicit (BUILT_IN_STRCPY); | |
12327 | size_t len = strlen (fmt_str); | |
12328 | ||
12329 | /* Don't optimize snprintf (buf, 4, "abc", ptr++). */ | |
12330 | if (orig) | |
12331 | return NULL_TREE; | |
12332 | ||
12333 | /* We could expand this as | |
12334 | memcpy (str, fmt, cst - 1); str[cst - 1] = '\0'; | |
12335 | or to | |
12336 | memcpy (str, fmt_with_nul_at_cstm1, cst); | |
12337 | but in the former case that might increase code size | |
12338 | and in the latter case grow .rodata section too much. | |
12339 | So punt for now. */ | |
12340 | if (len >= destlen) | |
12341 | return NULL_TREE; | |
12342 | ||
12343 | if (!fn) | |
12344 | return NULL_TREE; | |
12345 | ||
12346 | /* Convert snprintf (str, cst, fmt) into strcpy (str, fmt) when | |
12347 | 'format' is known to contain no % formats and | |
12348 | strlen (fmt) < cst. */ | |
12349 | call = build_call_expr_loc (loc, fn, 2, dest, fmt); | |
12350 | ||
12351 | if (!ignored) | |
12352 | retval = build_int_cst (integer_type_node, strlen (fmt_str)); | |
12353 | } | |
12354 | ||
12355 | /* If the format is "%s", use strcpy if the result isn't used. */ | |
12356 | else if (fmt_str && strcmp (fmt_str, target_percent_s) == 0) | |
12357 | { | |
12358 | tree fn = builtin_decl_implicit (BUILT_IN_STRCPY); | |
12359 | unsigned HOST_WIDE_INT origlen; | |
12360 | ||
12361 | /* Don't crash on snprintf (str1, cst, "%s"). */ | |
12362 | if (!orig) | |
12363 | return NULL_TREE; | |
12364 | ||
12365 | retval = c_strlen (orig, 1); | |
12366 | if (!retval || !host_integerp (retval, 1)) | |
12367 | return NULL_TREE; | |
12368 | ||
12369 | origlen = tree_low_cst (retval, 1); | |
12370 | /* We could expand this as | |
12371 | memcpy (str1, str2, cst - 1); str1[cst - 1] = '\0'; | |
12372 | or to | |
12373 | memcpy (str1, str2_with_nul_at_cstm1, cst); | |
12374 | but in the former case that might increase code size | |
12375 | and in the latter case grow .rodata section too much. | |
12376 | So punt for now. */ | |
12377 | if (origlen >= destlen) | |
12378 | return NULL_TREE; | |
12379 | ||
12380 | /* Convert snprintf (str1, cst, "%s", str2) into | |
12381 | strcpy (str1, str2) if strlen (str2) < cst. */ | |
12382 | if (!fn) | |
12383 | return NULL_TREE; | |
12384 | ||
12385 | call = build_call_expr_loc (loc, fn, 2, dest, orig); | |
12386 | ||
12387 | if (ignored) | |
12388 | retval = NULL_TREE; | |
12389 | } | |
12390 | ||
12391 | if (call && retval) | |
12392 | { | |
12393 | tree fn = builtin_decl_explicit (BUILT_IN_SNPRINTF); | |
12394 | retval = fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fn)), retval); | |
12395 | return build2 (COMPOUND_EXPR, TREE_TYPE (retval), call, retval); | |
12396 | } | |
12397 | else | |
12398 | return call; | |
12399 | } | |
12400 | ||
12401 | /* Expand a call EXP to __builtin_object_size. */ | |
12402 | ||
12403 | rtx | |
12404 | expand_builtin_object_size (tree exp) | |
12405 | { | |
12406 | tree ost; | |
12407 | int object_size_type; | |
12408 | tree fndecl = get_callee_fndecl (exp); | |
12409 | ||
12410 | if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)) | |
12411 | { | |
12412 | error ("%Kfirst argument of %D must be a pointer, second integer constant", | |
12413 | exp, fndecl); | |
12414 | expand_builtin_trap (); | |
12415 | return const0_rtx; | |
12416 | } | |
12417 | ||
12418 | ost = CALL_EXPR_ARG (exp, 1); | |
12419 | STRIP_NOPS (ost); | |
12420 | ||
12421 | if (TREE_CODE (ost) != INTEGER_CST | |
12422 | || tree_int_cst_sgn (ost) < 0 | |
12423 | || compare_tree_int (ost, 3) > 0) | |
12424 | { | |
12425 | error ("%Klast argument of %D is not integer constant between 0 and 3", | |
12426 | exp, fndecl); | |
12427 | expand_builtin_trap (); | |
12428 | return const0_rtx; | |
12429 | } | |
12430 | ||
12431 | object_size_type = tree_low_cst (ost, 0); | |
12432 | ||
12433 | return object_size_type < 2 ? constm1_rtx : const0_rtx; | |
12434 | } | |
12435 | ||
12436 | /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin. | |
12437 | FCODE is the BUILT_IN_* to use. | |
12438 | Return NULL_RTX if we failed; the caller should emit a normal call, | |
12439 | otherwise try to get the result in TARGET, if convenient (and in | |
12440 | mode MODE if that's convenient). */ | |
12441 | ||
12442 | static rtx | |
12443 | expand_builtin_memory_chk (tree exp, rtx target, enum machine_mode mode, | |
12444 | enum built_in_function fcode) | |
12445 | { | |
12446 | tree dest, src, len, size; | |
12447 | ||
12448 | if (!validate_arglist (exp, | |
12449 | POINTER_TYPE, | |
12450 | fcode == BUILT_IN_MEMSET_CHK | |
12451 | ? INTEGER_TYPE : POINTER_TYPE, | |
12452 | INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE)) | |
12453 | return NULL_RTX; | |
12454 | ||
12455 | dest = CALL_EXPR_ARG (exp, 0); | |
12456 | src = CALL_EXPR_ARG (exp, 1); | |
12457 | len = CALL_EXPR_ARG (exp, 2); | |
12458 | size = CALL_EXPR_ARG (exp, 3); | |
12459 | ||
12460 | if (! host_integerp (size, 1)) | |
12461 | return NULL_RTX; | |
12462 | ||
12463 | if (host_integerp (len, 1) || integer_all_onesp (size)) | |
12464 | { | |
12465 | tree fn; | |
12466 | ||
12467 | if (! integer_all_onesp (size) && tree_int_cst_lt (size, len)) | |
12468 | { | |
12469 | warning_at (tree_nonartificial_location (exp), | |
12470 | 0, "%Kcall to %D will always overflow destination buffer", | |
12471 | exp, get_callee_fndecl (exp)); | |
12472 | return NULL_RTX; | |
12473 | } | |
12474 | ||
12475 | fn = NULL_TREE; | |
12476 | /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume | |
12477 | mem{cpy,pcpy,move,set} is available. */ | |
12478 | switch (fcode) | |
12479 | { | |
12480 | case BUILT_IN_MEMCPY_CHK: | |
12481 | fn = builtin_decl_explicit (BUILT_IN_MEMCPY); | |
12482 | break; | |
12483 | case BUILT_IN_MEMPCPY_CHK: | |
12484 | fn = builtin_decl_explicit (BUILT_IN_MEMPCPY); | |
12485 | break; | |
12486 | case BUILT_IN_MEMMOVE_CHK: | |
12487 | fn = builtin_decl_explicit (BUILT_IN_MEMMOVE); | |
12488 | break; | |
12489 | case BUILT_IN_MEMSET_CHK: | |
12490 | fn = builtin_decl_explicit (BUILT_IN_MEMSET); | |
12491 | break; | |
12492 | default: | |
12493 | break; | |
12494 | } | |
12495 | ||
12496 | if (! fn) | |
12497 | return NULL_RTX; | |
12498 | ||
12499 | fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 3, dest, src, len); | |
12500 | gcc_assert (TREE_CODE (fn) == CALL_EXPR); | |
12501 | CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp); | |
12502 | return expand_expr (fn, target, mode, EXPAND_NORMAL); | |
12503 | } | |
12504 | else if (fcode == BUILT_IN_MEMSET_CHK) | |
12505 | return NULL_RTX; | |
12506 | else | |
12507 | { | |
12508 | unsigned int dest_align = get_pointer_alignment (dest); | |
12509 | ||
12510 | /* If DEST is not a pointer type, call the normal function. */ | |
12511 | if (dest_align == 0) | |
12512 | return NULL_RTX; | |
12513 | ||
12514 | /* If SRC and DEST are the same (and not volatile), do nothing. */ | |
12515 | if (operand_equal_p (src, dest, 0)) | |
12516 | { | |
12517 | tree expr; | |
12518 | ||
12519 | if (fcode != BUILT_IN_MEMPCPY_CHK) | |
12520 | { | |
12521 | /* Evaluate and ignore LEN in case it has side-effects. */ | |
12522 | expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL); | |
12523 | return expand_expr (dest, target, mode, EXPAND_NORMAL); | |
12524 | } | |
12525 | ||
12526 | expr = fold_build_pointer_plus (dest, len); | |
12527 | return expand_expr (expr, target, mode, EXPAND_NORMAL); | |
12528 | } | |
12529 | ||
12530 | /* __memmove_chk special case. */ | |
12531 | if (fcode == BUILT_IN_MEMMOVE_CHK) | |
12532 | { | |
12533 | unsigned int src_align = get_pointer_alignment (src); | |
12534 | ||
12535 | if (src_align == 0) | |
12536 | return NULL_RTX; | |
12537 | ||
12538 | /* If src is categorized for a readonly section we can use | |
12539 | normal __memcpy_chk. */ | |
12540 | if (readonly_data_expr (src)) | |
12541 | { | |
12542 | tree fn = builtin_decl_explicit (BUILT_IN_MEMCPY_CHK); | |
12543 | if (!fn) | |
12544 | return NULL_RTX; | |
12545 | fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 4, | |
12546 | dest, src, len, size); | |
12547 | gcc_assert (TREE_CODE (fn) == CALL_EXPR); | |
12548 | CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp); | |
12549 | return expand_expr (fn, target, mode, EXPAND_NORMAL); | |
12550 | } | |
12551 | } | |
12552 | return NULL_RTX; | |
12553 | } | |
12554 | } | |
12555 | ||
12556 | /* Emit warning if a buffer overflow is detected at compile time. */ | |
12557 | ||
12558 | static void | |
12559 | maybe_emit_chk_warning (tree exp, enum built_in_function fcode) | |
12560 | { | |
12561 | int is_strlen = 0; | |
12562 | tree len, size; | |
12563 | location_t loc = tree_nonartificial_location (exp); | |
12564 | ||
12565 | switch (fcode) | |
12566 | { | |
12567 | case BUILT_IN_STRCPY_CHK: | |
12568 | case BUILT_IN_STPCPY_CHK: | |
12569 | /* For __strcat_chk the warning will be emitted only if overflowing | |
12570 | by at least strlen (dest) + 1 bytes. */ | |
12571 | case BUILT_IN_STRCAT_CHK: | |
12572 | len = CALL_EXPR_ARG (exp, 1); | |
12573 | size = CALL_EXPR_ARG (exp, 2); | |
12574 | is_strlen = 1; | |
12575 | break; | |
12576 | case BUILT_IN_STRNCAT_CHK: | |
12577 | case BUILT_IN_STRNCPY_CHK: | |
12578 | case BUILT_IN_STPNCPY_CHK: | |
12579 | len = CALL_EXPR_ARG (exp, 2); | |
12580 | size = CALL_EXPR_ARG (exp, 3); | |
12581 | break; | |
12582 | case BUILT_IN_SNPRINTF_CHK: | |
12583 | case BUILT_IN_VSNPRINTF_CHK: | |
12584 | len = CALL_EXPR_ARG (exp, 1); | |
12585 | size = CALL_EXPR_ARG (exp, 3); | |
12586 | break; | |
12587 | default: | |
12588 | gcc_unreachable (); | |
12589 | } | |
12590 | ||
12591 | if (!len || !size) | |
12592 | return; | |
12593 | ||
12594 | if (! host_integerp (size, 1) || integer_all_onesp (size)) | |
12595 | return; | |
12596 | ||
12597 | if (is_strlen) | |
12598 | { | |
12599 | len = c_strlen (len, 1); | |
12600 | if (! len || ! host_integerp (len, 1) || tree_int_cst_lt (len, size)) | |
12601 | return; | |
12602 | } | |
12603 | else if (fcode == BUILT_IN_STRNCAT_CHK) | |
12604 | { | |
12605 | tree src = CALL_EXPR_ARG (exp, 1); | |
12606 | if (! src || ! host_integerp (len, 1) || tree_int_cst_lt (len, size)) | |
12607 | return; | |
12608 | src = c_strlen (src, 1); | |
12609 | if (! src || ! host_integerp (src, 1)) | |
12610 | { | |
12611 | warning_at (loc, 0, "%Kcall to %D might overflow destination buffer", | |
12612 | exp, get_callee_fndecl (exp)); | |
12613 | return; | |
12614 | } | |
12615 | else if (tree_int_cst_lt (src, size)) | |
12616 | return; | |
12617 | } | |
12618 | else if (! host_integerp (len, 1) || ! tree_int_cst_lt (size, len)) | |
12619 | return; | |
12620 | ||
12621 | warning_at (loc, 0, "%Kcall to %D will always overflow destination buffer", | |
12622 | exp, get_callee_fndecl (exp)); | |
12623 | } | |
12624 | ||
12625 | /* Emit warning if a buffer overflow is detected at compile time | |
12626 | in __sprintf_chk/__vsprintf_chk calls. */ | |
12627 | ||
12628 | static void | |
12629 | maybe_emit_sprintf_chk_warning (tree exp, enum built_in_function fcode) | |
12630 | { | |
12631 | tree size, len, fmt; | |
12632 | const char *fmt_str; | |
12633 | int nargs = call_expr_nargs (exp); | |
12634 | ||
12635 | /* Verify the required arguments in the original call. */ | |
12636 | ||
12637 | if (nargs < 4) | |
12638 | return; | |
12639 | size = CALL_EXPR_ARG (exp, 2); | |
12640 | fmt = CALL_EXPR_ARG (exp, 3); | |
12641 | ||
12642 | if (! host_integerp (size, 1) || integer_all_onesp (size)) | |
12643 | return; | |
12644 | ||
12645 | /* Check whether the format is a literal string constant. */ | |
12646 | fmt_str = c_getstr (fmt); | |
12647 | if (fmt_str == NULL) | |
12648 | return; | |
12649 | ||
12650 | if (!init_target_chars ()) | |
12651 | return; | |
12652 | ||
12653 | /* If the format doesn't contain % args or %%, we know its size. */ | |
12654 | if (strchr (fmt_str, target_percent) == 0) | |
12655 | len = build_int_cstu (size_type_node, strlen (fmt_str)); | |
12656 | /* If the format is "%s" and first ... argument is a string literal, | |
12657 | we know it too. */ | |
12658 | else if (fcode == BUILT_IN_SPRINTF_CHK | |
12659 | && strcmp (fmt_str, target_percent_s) == 0) | |
12660 | { | |
12661 | tree arg; | |
12662 | ||
12663 | if (nargs < 5) | |
12664 | return; | |
12665 | arg = CALL_EXPR_ARG (exp, 4); | |
12666 | if (! POINTER_TYPE_P (TREE_TYPE (arg))) | |
12667 | return; | |
12668 | ||
12669 | len = c_strlen (arg, 1); | |
12670 | if (!len || ! host_integerp (len, 1)) | |
12671 | return; | |
12672 | } | |
12673 | else | |
12674 | return; | |
12675 | ||
12676 | if (! tree_int_cst_lt (len, size)) | |
12677 | warning_at (tree_nonartificial_location (exp), | |
12678 | 0, "%Kcall to %D will always overflow destination buffer", | |
12679 | exp, get_callee_fndecl (exp)); | |
12680 | } | |
12681 | ||
12682 | /* Emit warning if a free is called with address of a variable. */ | |
12683 | ||
12684 | static void | |
12685 | maybe_emit_free_warning (tree exp) | |
12686 | { | |
12687 | tree arg = CALL_EXPR_ARG (exp, 0); | |
12688 | ||
12689 | STRIP_NOPS (arg); | |
12690 | if (TREE_CODE (arg) != ADDR_EXPR) | |
12691 | return; | |
12692 | ||
12693 | arg = get_base_address (TREE_OPERAND (arg, 0)); | |
12694 | if (arg == NULL || INDIRECT_REF_P (arg) || TREE_CODE (arg) == MEM_REF) | |
12695 | return; | |
12696 | ||
12697 | if (SSA_VAR_P (arg)) | |
12698 | warning_at (tree_nonartificial_location (exp), OPT_Wfree_nonheap_object, | |
12699 | "%Kattempt to free a non-heap object %qD", exp, arg); | |
12700 | else | |
12701 | warning_at (tree_nonartificial_location (exp), OPT_Wfree_nonheap_object, | |
12702 | "%Kattempt to free a non-heap object", exp); | |
12703 | } | |
12704 | ||
12705 | /* Fold a call to __builtin_object_size with arguments PTR and OST, | |
12706 | if possible. */ | |
12707 | ||
12708 | tree | |
12709 | fold_builtin_object_size (tree ptr, tree ost) | |
12710 | { | |
12711 | unsigned HOST_WIDE_INT bytes; | |
12712 | int object_size_type; | |
12713 | ||
12714 | if (!validate_arg (ptr, POINTER_TYPE) | |
12715 | || !validate_arg (ost, INTEGER_TYPE)) | |
12716 | return NULL_TREE; | |
12717 | ||
12718 | STRIP_NOPS (ost); | |
12719 | ||
12720 | if (TREE_CODE (ost) != INTEGER_CST | |
12721 | || tree_int_cst_sgn (ost) < 0 | |
12722 | || compare_tree_int (ost, 3) > 0) | |
12723 | return NULL_TREE; | |
12724 | ||
12725 | object_size_type = tree_low_cst (ost, 0); | |
12726 | ||
12727 | /* __builtin_object_size doesn't evaluate side-effects in its arguments; | |
12728 | if there are any side-effects, it returns (size_t) -1 for types 0 and 1 | |
12729 | and (size_t) 0 for types 2 and 3. */ | |
12730 | if (TREE_SIDE_EFFECTS (ptr)) | |
12731 | return build_int_cst_type (size_type_node, object_size_type < 2 ? -1 : 0); | |
12732 | ||
12733 | if (TREE_CODE (ptr) == ADDR_EXPR) | |
12734 | { | |
12735 | bytes = compute_builtin_object_size (ptr, object_size_type); | |
12736 | if (double_int_fits_to_tree_p (size_type_node, | |
12737 | uhwi_to_double_int (bytes))) | |
12738 | return build_int_cstu (size_type_node, bytes); | |
12739 | } | |
12740 | else if (TREE_CODE (ptr) == SSA_NAME) | |
12741 | { | |
12742 | /* If object size is not known yet, delay folding until | |
12743 | later. Maybe subsequent passes will help determining | |
12744 | it. */ | |
12745 | bytes = compute_builtin_object_size (ptr, object_size_type); | |
12746 | if (bytes != (unsigned HOST_WIDE_INT) (object_size_type < 2 ? -1 : 0) | |
12747 | && double_int_fits_to_tree_p (size_type_node, | |
12748 | uhwi_to_double_int (bytes))) | |
12749 | return build_int_cstu (size_type_node, bytes); | |
12750 | } | |
12751 | ||
12752 | return NULL_TREE; | |
12753 | } | |
12754 | ||
12755 | /* Fold a call to the __mem{cpy,pcpy,move,set}_chk builtin. | |
12756 | DEST, SRC, LEN, and SIZE are the arguments to the call. | |
12757 | IGNORE is true, if return value can be ignored. FCODE is the BUILT_IN_* | |
12758 | code of the builtin. If MAXLEN is not NULL, it is maximum length | |
12759 | passed as third argument. */ | |
12760 | ||
12761 | tree | |
12762 | fold_builtin_memory_chk (location_t loc, tree fndecl, | |
12763 | tree dest, tree src, tree len, tree size, | |
12764 | tree maxlen, bool ignore, | |
12765 | enum built_in_function fcode) | |
12766 | { | |
12767 | tree fn; | |
12768 | ||
12769 | if (!validate_arg (dest, POINTER_TYPE) | |
12770 | || !validate_arg (src, | |
12771 | (fcode == BUILT_IN_MEMSET_CHK | |
12772 | ? INTEGER_TYPE : POINTER_TYPE)) | |
12773 | || !validate_arg (len, INTEGER_TYPE) | |
12774 | || !validate_arg (size, INTEGER_TYPE)) | |
12775 | return NULL_TREE; | |
12776 | ||
12777 | /* If SRC and DEST are the same (and not volatile), return DEST | |
12778 | (resp. DEST+LEN for __mempcpy_chk). */ | |
12779 | if (fcode != BUILT_IN_MEMSET_CHK && operand_equal_p (src, dest, 0)) | |
12780 | { | |
12781 | if (fcode != BUILT_IN_MEMPCPY_CHK) | |
12782 | return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), | |
12783 | dest, len); | |
12784 | else | |
12785 | { | |
12786 | tree temp = fold_build_pointer_plus_loc (loc, dest, len); | |
12787 | return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), temp); | |
12788 | } | |
12789 | } | |
12790 | ||
12791 | if (! host_integerp (size, 1)) | |
12792 | return NULL_TREE; | |
12793 | ||
12794 | if (! integer_all_onesp (size)) | |
12795 | { | |
12796 | if (! host_integerp (len, 1)) | |
12797 | { | |
12798 | /* If LEN is not constant, try MAXLEN too. | |
12799 | For MAXLEN only allow optimizing into non-_ocs function | |
12800 | if SIZE is >= MAXLEN, never convert to __ocs_fail (). */ | |
12801 | if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1)) | |
12802 | { | |
12803 | if (fcode == BUILT_IN_MEMPCPY_CHK && ignore) | |
12804 | { | |
12805 | /* (void) __mempcpy_chk () can be optimized into | |
12806 | (void) __memcpy_chk (). */ | |
12807 | fn = builtin_decl_explicit (BUILT_IN_MEMCPY_CHK); | |
12808 | if (!fn) | |
12809 | return NULL_TREE; | |
12810 | ||
12811 | return build_call_expr_loc (loc, fn, 4, dest, src, len, size); | |
12812 | } | |
12813 | return NULL_TREE; | |
12814 | } | |
12815 | } | |
12816 | else | |
12817 | maxlen = len; | |
12818 | ||
12819 | if (tree_int_cst_lt (size, maxlen)) | |
12820 | return NULL_TREE; | |
12821 | } | |
12822 | ||
12823 | fn = NULL_TREE; | |
12824 | /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume | |
12825 | mem{cpy,pcpy,move,set} is available. */ | |
12826 | switch (fcode) | |
12827 | { | |
12828 | case BUILT_IN_MEMCPY_CHK: | |
12829 | fn = builtin_decl_explicit (BUILT_IN_MEMCPY); | |
12830 | break; | |
12831 | case BUILT_IN_MEMPCPY_CHK: | |
12832 | fn = builtin_decl_explicit (BUILT_IN_MEMPCPY); | |
12833 | break; | |
12834 | case BUILT_IN_MEMMOVE_CHK: | |
12835 | fn = builtin_decl_explicit (BUILT_IN_MEMMOVE); | |
12836 | break; | |
12837 | case BUILT_IN_MEMSET_CHK: | |
12838 | fn = builtin_decl_explicit (BUILT_IN_MEMSET); | |
12839 | break; | |
12840 | default: | |
12841 | break; | |
12842 | } | |
12843 | ||
12844 | if (!fn) | |
12845 | return NULL_TREE; | |
12846 | ||
12847 | return build_call_expr_loc (loc, fn, 3, dest, src, len); | |
12848 | } | |
12849 | ||
12850 | /* Fold a call to the __st[rp]cpy_chk builtin. | |
12851 | DEST, SRC, and SIZE are the arguments to the call. | |
12852 | IGNORE is true if return value can be ignored. FCODE is the BUILT_IN_* | |
12853 | code of the builtin. If MAXLEN is not NULL, it is maximum length of | |
12854 | strings passed as second argument. */ | |
12855 | ||
12856 | tree | |
12857 | fold_builtin_stxcpy_chk (location_t loc, tree fndecl, tree dest, | |
12858 | tree src, tree size, | |
12859 | tree maxlen, bool ignore, | |
12860 | enum built_in_function fcode) | |
12861 | { | |
12862 | tree len, fn; | |
12863 | ||
12864 | if (!validate_arg (dest, POINTER_TYPE) | |
12865 | || !validate_arg (src, POINTER_TYPE) | |
12866 | || !validate_arg (size, INTEGER_TYPE)) | |
12867 | return NULL_TREE; | |
12868 | ||
12869 | /* If SRC and DEST are the same (and not volatile), return DEST. */ | |
12870 | if (fcode == BUILT_IN_STRCPY_CHK && operand_equal_p (src, dest, 0)) | |
12871 | return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest); | |
12872 | ||
12873 | if (! host_integerp (size, 1)) | |
12874 | return NULL_TREE; | |
12875 | ||
12876 | if (! integer_all_onesp (size)) | |
12877 | { | |
12878 | len = c_strlen (src, 1); | |
12879 | if (! len || ! host_integerp (len, 1)) | |
12880 | { | |
12881 | /* If LEN is not constant, try MAXLEN too. | |
12882 | For MAXLEN only allow optimizing into non-_ocs function | |
12883 | if SIZE is >= MAXLEN, never convert to __ocs_fail (). */ | |
12884 | if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1)) | |
12885 | { | |
12886 | if (fcode == BUILT_IN_STPCPY_CHK) | |
12887 | { | |
12888 | if (! ignore) | |
12889 | return NULL_TREE; | |
12890 | ||
12891 | /* If return value of __stpcpy_chk is ignored, | |
12892 | optimize into __strcpy_chk. */ | |
12893 | fn = builtin_decl_explicit (BUILT_IN_STRCPY_CHK); | |
12894 | if (!fn) | |
12895 | return NULL_TREE; | |
12896 | ||
12897 | return build_call_expr_loc (loc, fn, 3, dest, src, size); | |
12898 | } | |
12899 | ||
12900 | if (! len || TREE_SIDE_EFFECTS (len)) | |
12901 | return NULL_TREE; | |
12902 | ||
12903 | /* If c_strlen returned something, but not a constant, | |
12904 | transform __strcpy_chk into __memcpy_chk. */ | |
12905 | fn = builtin_decl_explicit (BUILT_IN_MEMCPY_CHK); | |
12906 | if (!fn) | |
12907 | return NULL_TREE; | |
12908 | ||
12909 | len = fold_convert_loc (loc, size_type_node, len); | |
12910 | len = size_binop_loc (loc, PLUS_EXPR, len, | |
12911 | build_int_cst (size_type_node, 1)); | |
12912 | return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), | |
12913 | build_call_expr_loc (loc, fn, 4, | |
12914 | dest, src, len, size)); | |
12915 | } | |
12916 | } | |
12917 | else | |
12918 | maxlen = len; | |
12919 | ||
12920 | if (! tree_int_cst_lt (maxlen, size)) | |
12921 | return NULL_TREE; | |
12922 | } | |
12923 | ||
12924 | /* If __builtin_st{r,p}cpy_chk is used, assume st{r,p}cpy is available. */ | |
12925 | fn = builtin_decl_explicit (fcode == BUILT_IN_STPCPY_CHK | |
12926 | ? BUILT_IN_STPCPY : BUILT_IN_STRCPY); | |
12927 | if (!fn) | |
12928 | return NULL_TREE; | |
12929 | ||
12930 | return build_call_expr_loc (loc, fn, 2, dest, src); | |
12931 | } | |
12932 | ||
12933 | /* Fold a call to the __st{r,p}ncpy_chk builtin. DEST, SRC, LEN, and SIZE | |
12934 | are the arguments to the call. If MAXLEN is not NULL, it is maximum | |
12935 | length passed as third argument. IGNORE is true if return value can be | |
12936 | ignored. FCODE is the BUILT_IN_* code of the builtin. */ | |
12937 | ||
12938 | tree | |
12939 | fold_builtin_stxncpy_chk (location_t loc, tree dest, tree src, | |
12940 | tree len, tree size, tree maxlen, bool ignore, | |
12941 | enum built_in_function fcode) | |
12942 | { | |
12943 | tree fn; | |
12944 | ||
12945 | if (!validate_arg (dest, POINTER_TYPE) | |
12946 | || !validate_arg (src, POINTER_TYPE) | |
12947 | || !validate_arg (len, INTEGER_TYPE) | |
12948 | || !validate_arg (size, INTEGER_TYPE)) | |
12949 | return NULL_TREE; | |
12950 | ||
12951 | if (fcode == BUILT_IN_STPNCPY_CHK && ignore) | |
12952 | { | |
12953 | /* If return value of __stpncpy_chk is ignored, | |
12954 | optimize into __strncpy_chk. */ | |
12955 | fn = builtin_decl_explicit (BUILT_IN_STRNCPY_CHK); | |
12956 | if (fn) | |
12957 | return build_call_expr_loc (loc, fn, 4, dest, src, len, size); | |
12958 | } | |
12959 | ||
12960 | if (! host_integerp (size, 1)) | |
12961 | return NULL_TREE; | |
12962 | ||
12963 | if (! integer_all_onesp (size)) | |
12964 | { | |
12965 | if (! host_integerp (len, 1)) | |
12966 | { | |
12967 | /* If LEN is not constant, try MAXLEN too. | |
12968 | For MAXLEN only allow optimizing into non-_ocs function | |
12969 | if SIZE is >= MAXLEN, never convert to __ocs_fail (). */ | |
12970 | if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1)) | |
12971 | return NULL_TREE; | |
12972 | } | |
12973 | else | |
12974 | maxlen = len; | |
12975 | ||
12976 | if (tree_int_cst_lt (size, maxlen)) | |
12977 | return NULL_TREE; | |
12978 | } | |
12979 | ||
12980 | /* If __builtin_st{r,p}ncpy_chk is used, assume st{r,p}ncpy is available. */ | |
12981 | fn = builtin_decl_explicit (fcode == BUILT_IN_STPNCPY_CHK | |
12982 | ? BUILT_IN_STPNCPY : BUILT_IN_STRNCPY); | |
12983 | if (!fn) | |
12984 | return NULL_TREE; | |
12985 | ||
12986 | return build_call_expr_loc (loc, fn, 3, dest, src, len); | |
12987 | } | |
12988 | ||
12989 | /* Fold a call to the __strcat_chk builtin FNDECL. DEST, SRC, and SIZE | |
12990 | are the arguments to the call. */ | |
12991 | ||
12992 | static tree | |
12993 | fold_builtin_strcat_chk (location_t loc, tree fndecl, tree dest, | |
12994 | tree src, tree size) | |
12995 | { | |
12996 | tree fn; | |
12997 | const char *p; | |
12998 | ||
12999 | if (!validate_arg (dest, POINTER_TYPE) | |
13000 | || !validate_arg (src, POINTER_TYPE) | |
13001 | || !validate_arg (size, INTEGER_TYPE)) | |
13002 | return NULL_TREE; | |
13003 | ||
13004 | p = c_getstr (src); | |
13005 | /* If the SRC parameter is "", return DEST. */ | |
13006 | if (p && *p == '\0') | |
13007 | return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src); | |
13008 | ||
13009 | if (! host_integerp (size, 1) || ! integer_all_onesp (size)) | |
13010 | return NULL_TREE; | |
13011 | ||
13012 | /* If __builtin_strcat_chk is used, assume strcat is available. */ | |
13013 | fn = builtin_decl_explicit (BUILT_IN_STRCAT); | |
13014 | if (!fn) | |
13015 | return NULL_TREE; | |
13016 | ||
13017 | return build_call_expr_loc (loc, fn, 2, dest, src); | |
13018 | } | |
13019 | ||
13020 | /* Fold a call to the __strncat_chk builtin with arguments DEST, SRC, | |
13021 | LEN, and SIZE. */ | |
13022 | ||
13023 | static tree | |
13024 | fold_builtin_strncat_chk (location_t loc, tree fndecl, | |
13025 | tree dest, tree src, tree len, tree size) | |
13026 | { | |
13027 | tree fn; | |
13028 | const char *p; | |
13029 | ||
13030 | if (!validate_arg (dest, POINTER_TYPE) | |
13031 | || !validate_arg (src, POINTER_TYPE) | |
13032 | || !validate_arg (size, INTEGER_TYPE) | |
13033 | || !validate_arg (size, INTEGER_TYPE)) | |
13034 | return NULL_TREE; | |
13035 | ||
13036 | p = c_getstr (src); | |
13037 | /* If the SRC parameter is "" or if LEN is 0, return DEST. */ | |
13038 | if (p && *p == '\0') | |
13039 | return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, len); | |
13040 | else if (integer_zerop (len)) | |
13041 | return omit_one_operand_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), dest, src); | |
13042 | ||
13043 | if (! host_integerp (size, 1)) | |
13044 | return NULL_TREE; | |
13045 | ||
13046 | if (! integer_all_onesp (size)) | |
13047 | { | |
13048 | tree src_len = c_strlen (src, 1); | |
13049 | if (src_len | |
13050 | && host_integerp (src_len, 1) | |
13051 | && host_integerp (len, 1) | |
13052 | && ! tree_int_cst_lt (len, src_len)) | |
13053 | { | |
13054 | /* If LEN >= strlen (SRC), optimize into __strcat_chk. */ | |
13055 | fn = builtin_decl_explicit (BUILT_IN_STRCAT_CHK); | |
13056 | if (!fn) | |
13057 | return NULL_TREE; | |
13058 | ||
13059 | return build_call_expr_loc (loc, fn, 3, dest, src, size); | |
13060 | } | |
13061 | return NULL_TREE; | |
13062 | } | |
13063 | ||
13064 | /* If __builtin_strncat_chk is used, assume strncat is available. */ | |
13065 | fn = builtin_decl_explicit (BUILT_IN_STRNCAT); | |
13066 | if (!fn) | |
13067 | return NULL_TREE; | |
13068 | ||
13069 | return build_call_expr_loc (loc, fn, 3, dest, src, len); | |
13070 | } | |
13071 | ||
13072 | /* Fold a call EXP to __{,v}sprintf_chk having NARGS passed as ARGS. | |
13073 | Return NULL_TREE if a normal call should be emitted rather than | |
13074 | expanding the function inline. FCODE is either BUILT_IN_SPRINTF_CHK | |
13075 | or BUILT_IN_VSPRINTF_CHK. */ | |
13076 | ||
13077 | static tree | |
13078 | fold_builtin_sprintf_chk_1 (location_t loc, int nargs, tree *args, | |
13079 | enum built_in_function fcode) | |
13080 | { | |
13081 | tree dest, size, len, fn, fmt, flag; | |
13082 | const char *fmt_str; | |
13083 | ||
13084 | /* Verify the required arguments in the original call. */ | |
13085 | if (nargs < 4) | |
13086 | return NULL_TREE; | |
13087 | dest = args[0]; | |
13088 | if (!validate_arg (dest, POINTER_TYPE)) | |
13089 | return NULL_TREE; | |
13090 | flag = args[1]; | |
13091 | if (!validate_arg (flag, INTEGER_TYPE)) | |
13092 | return NULL_TREE; | |
13093 | size = args[2]; | |
13094 | if (!validate_arg (size, INTEGER_TYPE)) | |
13095 | return NULL_TREE; | |
13096 | fmt = args[3]; | |
13097 | if (!validate_arg (fmt, POINTER_TYPE)) | |
13098 | return NULL_TREE; | |
13099 | ||
13100 | if (! host_integerp (size, 1)) | |
13101 | return NULL_TREE; | |
13102 | ||
13103 | len = NULL_TREE; | |
13104 | ||
13105 | if (!init_target_chars ()) | |
13106 | return NULL_TREE; | |
13107 | ||
13108 | /* Check whether the format is a literal string constant. */ | |
13109 | fmt_str = c_getstr (fmt); | |
13110 | if (fmt_str != NULL) | |
13111 | { | |
13112 | /* If the format doesn't contain % args or %%, we know the size. */ | |
13113 | if (strchr (fmt_str, target_percent) == 0) | |
13114 | { | |
13115 | if (fcode != BUILT_IN_SPRINTF_CHK || nargs == 4) | |
13116 | len = build_int_cstu (size_type_node, strlen (fmt_str)); | |
13117 | } | |
13118 | /* If the format is "%s" and first ... argument is a string literal, | |
13119 | we know the size too. */ | |
13120 | else if (fcode == BUILT_IN_SPRINTF_CHK | |
13121 | && strcmp (fmt_str, target_percent_s) == 0) | |
13122 | { | |
13123 | tree arg; | |
13124 | ||
13125 | if (nargs == 5) | |
13126 | { | |
13127 | arg = args[4]; | |
13128 | if (validate_arg (arg, POINTER_TYPE)) | |
13129 | { | |
13130 | len = c_strlen (arg, 1); | |
13131 | if (! len || ! host_integerp (len, 1)) | |
13132 | len = NULL_TREE; | |
13133 | } | |
13134 | } | |
13135 | } | |
13136 | } | |
13137 | ||
13138 | if (! integer_all_onesp (size)) | |
13139 | { | |
13140 | if (! len || ! tree_int_cst_lt (len, size)) | |
13141 | return NULL_TREE; | |
13142 | } | |
13143 | ||
13144 | /* Only convert __{,v}sprintf_chk to {,v}sprintf if flag is 0 | |
13145 | or if format doesn't contain % chars or is "%s". */ | |
13146 | if (! integer_zerop (flag)) | |
13147 | { | |
13148 | if (fmt_str == NULL) | |
13149 | return NULL_TREE; | |
13150 | if (strchr (fmt_str, target_percent) != NULL | |
13151 | && strcmp (fmt_str, target_percent_s)) | |
13152 | return NULL_TREE; | |
13153 | } | |
13154 | ||
13155 | /* If __builtin_{,v}sprintf_chk is used, assume {,v}sprintf is available. */ | |
13156 | fn = builtin_decl_explicit (fcode == BUILT_IN_VSPRINTF_CHK | |
13157 | ? BUILT_IN_VSPRINTF : BUILT_IN_SPRINTF); | |
13158 | if (!fn) | |
13159 | return NULL_TREE; | |
13160 | ||
13161 | return rewrite_call_expr_array (loc, nargs, args, 4, fn, 2, dest, fmt); | |
13162 | } | |
13163 | ||
13164 | /* Fold a call EXP to __{,v}sprintf_chk. Return NULL_TREE if | |
13165 | a normal call should be emitted rather than expanding the function | |
13166 | inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */ | |
13167 | ||
13168 | static tree | |
13169 | fold_builtin_sprintf_chk (location_t loc, tree exp, | |
13170 | enum built_in_function fcode) | |
13171 | { | |
13172 | return fold_builtin_sprintf_chk_1 (loc, call_expr_nargs (exp), | |
13173 | CALL_EXPR_ARGP (exp), fcode); | |
13174 | } | |
13175 | ||
13176 | /* Fold a call EXP to {,v}snprintf having NARGS passed as ARGS. Return | |
13177 | NULL_TREE if a normal call should be emitted rather than expanding | |
13178 | the function inline. FCODE is either BUILT_IN_SNPRINTF_CHK or | |
13179 | BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length | |
13180 | passed as second argument. */ | |
13181 | ||
13182 | static tree | |
13183 | fold_builtin_snprintf_chk_1 (location_t loc, int nargs, tree *args, | |
13184 | tree maxlen, enum built_in_function fcode) | |
13185 | { | |
13186 | tree dest, size, len, fn, fmt, flag; | |
13187 | const char *fmt_str; | |
13188 | ||
13189 | /* Verify the required arguments in the original call. */ | |
13190 | if (nargs < 5) | |
13191 | return NULL_TREE; | |
13192 | dest = args[0]; | |
13193 | if (!validate_arg (dest, POINTER_TYPE)) | |
13194 | return NULL_TREE; | |
13195 | len = args[1]; | |
13196 | if (!validate_arg (len, INTEGER_TYPE)) | |
13197 | return NULL_TREE; | |
13198 | flag = args[2]; | |
13199 | if (!validate_arg (flag, INTEGER_TYPE)) | |
13200 | return NULL_TREE; | |
13201 | size = args[3]; | |
13202 | if (!validate_arg (size, INTEGER_TYPE)) | |
13203 | return NULL_TREE; | |
13204 | fmt = args[4]; | |
13205 | if (!validate_arg (fmt, POINTER_TYPE)) | |
13206 | return NULL_TREE; | |
13207 | ||
13208 | if (! host_integerp (size, 1)) | |
13209 | return NULL_TREE; | |
13210 | ||
13211 | if (! integer_all_onesp (size)) | |
13212 | { | |
13213 | if (! host_integerp (len, 1)) | |
13214 | { | |
13215 | /* If LEN is not constant, try MAXLEN too. | |
13216 | For MAXLEN only allow optimizing into non-_ocs function | |
13217 | if SIZE is >= MAXLEN, never convert to __ocs_fail (). */ | |
13218 | if (maxlen == NULL_TREE || ! host_integerp (maxlen, 1)) | |
13219 | return NULL_TREE; | |
13220 | } | |
13221 | else | |
13222 | maxlen = len; | |
13223 | ||
13224 | if (tree_int_cst_lt (size, maxlen)) | |
13225 | return NULL_TREE; | |
13226 | } | |
13227 | ||
13228 | if (!init_target_chars ()) | |
13229 | return NULL_TREE; | |
13230 | ||
13231 | /* Only convert __{,v}snprintf_chk to {,v}snprintf if flag is 0 | |
13232 | or if format doesn't contain % chars or is "%s". */ | |
13233 | if (! integer_zerop (flag)) | |
13234 | { | |
13235 | fmt_str = c_getstr (fmt); | |
13236 | if (fmt_str == NULL) | |
13237 | return NULL_TREE; | |
13238 | if (strchr (fmt_str, target_percent) != NULL | |
13239 | && strcmp (fmt_str, target_percent_s)) | |
13240 | return NULL_TREE; | |
13241 | } | |
13242 | ||
13243 | /* If __builtin_{,v}snprintf_chk is used, assume {,v}snprintf is | |
13244 | available. */ | |
13245 | fn = builtin_decl_explicit (fcode == BUILT_IN_VSNPRINTF_CHK | |
13246 | ? BUILT_IN_VSNPRINTF : BUILT_IN_SNPRINTF); | |
13247 | if (!fn) | |
13248 | return NULL_TREE; | |
13249 | ||
13250 | return rewrite_call_expr_array (loc, nargs, args, 5, fn, 3, dest, len, fmt); | |
13251 | } | |
13252 | ||
13253 | /* Fold a call EXP to {,v}snprintf. Return NULL_TREE if | |
13254 | a normal call should be emitted rather than expanding the function | |
13255 | inline. FCODE is either BUILT_IN_SNPRINTF_CHK or | |
13256 | BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length | |
13257 | passed as second argument. */ | |
13258 | ||
13259 | tree | |
13260 | fold_builtin_snprintf_chk (location_t loc, tree exp, tree maxlen, | |
13261 | enum built_in_function fcode) | |
13262 | { | |
13263 | return fold_builtin_snprintf_chk_1 (loc, call_expr_nargs (exp), | |
13264 | CALL_EXPR_ARGP (exp), maxlen, fcode); | |
13265 | } | |
13266 | ||
13267 | /* Fold a call to the {,v}printf{,_unlocked} and __{,v}printf_chk builtins. | |
13268 | FMT and ARG are the arguments to the call; we don't fold cases with | |
13269 | more than 2 arguments, and ARG may be null if this is a 1-argument case. | |
13270 | ||
13271 | Return NULL_TREE if no simplification was possible, otherwise return the | |
13272 | simplified form of the call as a tree. FCODE is the BUILT_IN_* | |
13273 | code of the function to be simplified. */ | |
13274 | ||
13275 | static tree | |
13276 | fold_builtin_printf (location_t loc, tree fndecl, tree fmt, | |
13277 | tree arg, bool ignore, | |
13278 | enum built_in_function fcode) | |
13279 | { | |
13280 | tree fn_putchar, fn_puts, newarg, call = NULL_TREE; | |
13281 | const char *fmt_str = NULL; | |
13282 | ||
13283 | /* If the return value is used, don't do the transformation. */ | |
13284 | if (! ignore) | |
13285 | return NULL_TREE; | |
13286 | ||
13287 | /* Verify the required arguments in the original call. */ | |
13288 | if (!validate_arg (fmt, POINTER_TYPE)) | |
13289 | return NULL_TREE; | |
13290 | ||
13291 | /* Check whether the format is a literal string constant. */ | |
13292 | fmt_str = c_getstr (fmt); | |
13293 | if (fmt_str == NULL) | |
13294 | return NULL_TREE; | |
13295 | ||
13296 | if (fcode == BUILT_IN_PRINTF_UNLOCKED) | |
13297 | { | |
13298 | /* If we're using an unlocked function, assume the other | |
13299 | unlocked functions exist explicitly. */ | |
13300 | fn_putchar = builtin_decl_explicit (BUILT_IN_PUTCHAR_UNLOCKED); | |
13301 | fn_puts = builtin_decl_explicit (BUILT_IN_PUTS_UNLOCKED); | |
13302 | } | |
13303 | else | |
13304 | { | |
13305 | fn_putchar = builtin_decl_implicit (BUILT_IN_PUTCHAR); | |
13306 | fn_puts = builtin_decl_implicit (BUILT_IN_PUTS); | |
13307 | } | |
13308 | ||
13309 | if (!init_target_chars ()) | |
13310 | return NULL_TREE; | |
13311 | ||
13312 | if (strcmp (fmt_str, target_percent_s) == 0 | |
13313 | || strchr (fmt_str, target_percent) == NULL) | |
13314 | { | |
13315 | const char *str; | |
13316 | ||
13317 | if (strcmp (fmt_str, target_percent_s) == 0) | |
13318 | { | |
13319 | if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK) | |
13320 | return NULL_TREE; | |
13321 | ||
13322 | if (!arg || !validate_arg (arg, POINTER_TYPE)) | |
13323 | return NULL_TREE; | |
13324 | ||
13325 | str = c_getstr (arg); | |
13326 | if (str == NULL) | |
13327 | return NULL_TREE; | |
13328 | } | |
13329 | else | |
13330 | { | |
13331 | /* The format specifier doesn't contain any '%' characters. */ | |
13332 | if (fcode != BUILT_IN_VPRINTF && fcode != BUILT_IN_VPRINTF_CHK | |
13333 | && arg) | |
13334 | return NULL_TREE; | |
13335 | str = fmt_str; | |
13336 | } | |
13337 | ||
13338 | /* If the string was "", printf does nothing. */ | |
13339 | if (str[0] == '\0') | |
13340 | return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0); | |
13341 | ||
13342 | /* If the string has length of 1, call putchar. */ | |
13343 | if (str[1] == '\0') | |
13344 | { | |
13345 | /* Given printf("c"), (where c is any one character,) | |
13346 | convert "c"[0] to an int and pass that to the replacement | |
13347 | function. */ | |
13348 | newarg = build_int_cst (integer_type_node, str[0]); | |
13349 | if (fn_putchar) | |
13350 | call = build_call_expr_loc (loc, fn_putchar, 1, newarg); | |
13351 | } | |
13352 | else | |
13353 | { | |
13354 | /* If the string was "string\n", call puts("string"). */ | |
13355 | size_t len = strlen (str); | |
13356 | if ((unsigned char)str[len - 1] == target_newline | |
13357 | && (size_t) (int) len == len | |
13358 | && (int) len > 0) | |
13359 | { | |
13360 | char *newstr; | |
13361 | tree offset_node, string_cst; | |
13362 | ||
13363 | /* Create a NUL-terminated string that's one char shorter | |
13364 | than the original, stripping off the trailing '\n'. */ | |
13365 | newarg = build_string_literal (len, str); | |
13366 | string_cst = string_constant (newarg, &offset_node); | |
13367 | gcc_checking_assert (string_cst | |
13368 | && (TREE_STRING_LENGTH (string_cst) | |
13369 | == (int) len) | |
13370 | && integer_zerop (offset_node) | |
13371 | && (unsigned char) | |
13372 | TREE_STRING_POINTER (string_cst)[len - 1] | |
13373 | == target_newline); | |
13374 | /* build_string_literal creates a new STRING_CST, | |
13375 | modify it in place to avoid double copying. */ | |
13376 | newstr = CONST_CAST (char *, TREE_STRING_POINTER (string_cst)); | |
13377 | newstr[len - 1] = '\0'; | |
13378 | if (fn_puts) | |
13379 | call = build_call_expr_loc (loc, fn_puts, 1, newarg); | |
13380 | } | |
13381 | else | |
13382 | /* We'd like to arrange to call fputs(string,stdout) here, | |
13383 | but we need stdout and don't have a way to get it yet. */ | |
13384 | return NULL_TREE; | |
13385 | } | |
13386 | } | |
13387 | ||
13388 | /* The other optimizations can be done only on the non-va_list variants. */ | |
13389 | else if (fcode == BUILT_IN_VPRINTF || fcode == BUILT_IN_VPRINTF_CHK) | |
13390 | return NULL_TREE; | |
13391 | ||
13392 | /* If the format specifier was "%s\n", call __builtin_puts(arg). */ | |
13393 | else if (strcmp (fmt_str, target_percent_s_newline) == 0) | |
13394 | { | |
13395 | if (!arg || !validate_arg (arg, POINTER_TYPE)) | |
13396 | return NULL_TREE; | |
13397 | if (fn_puts) | |
13398 | call = build_call_expr_loc (loc, fn_puts, 1, arg); | |
13399 | } | |
13400 | ||
13401 | /* If the format specifier was "%c", call __builtin_putchar(arg). */ | |
13402 | else if (strcmp (fmt_str, target_percent_c) == 0) | |
13403 | { | |
13404 | if (!arg || !validate_arg (arg, INTEGER_TYPE)) | |
13405 | return NULL_TREE; | |
13406 | if (fn_putchar) | |
13407 | call = build_call_expr_loc (loc, fn_putchar, 1, arg); | |
13408 | } | |
13409 | ||
13410 | if (!call) | |
13411 | return NULL_TREE; | |
13412 | ||
13413 | return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call); | |
13414 | } | |
13415 | ||
13416 | /* Fold a call to the {,v}fprintf{,_unlocked} and __{,v}printf_chk builtins. | |
13417 | FP, FMT, and ARG are the arguments to the call. We don't fold calls with | |
13418 | more than 3 arguments, and ARG may be null in the 2-argument case. | |
13419 | ||
13420 | Return NULL_TREE if no simplification was possible, otherwise return the | |
13421 | simplified form of the call as a tree. FCODE is the BUILT_IN_* | |
13422 | code of the function to be simplified. */ | |
13423 | ||
13424 | static tree | |
13425 | fold_builtin_fprintf (location_t loc, tree fndecl, tree fp, | |
13426 | tree fmt, tree arg, bool ignore, | |
13427 | enum built_in_function fcode) | |
13428 | { | |
13429 | tree fn_fputc, fn_fputs, call = NULL_TREE; | |
13430 | const char *fmt_str = NULL; | |
13431 | ||
13432 | /* If the return value is used, don't do the transformation. */ | |
13433 | if (! ignore) | |
13434 | return NULL_TREE; | |
13435 | ||
13436 | /* Verify the required arguments in the original call. */ | |
13437 | if (!validate_arg (fp, POINTER_TYPE)) | |
13438 | return NULL_TREE; | |
13439 | if (!validate_arg (fmt, POINTER_TYPE)) | |
13440 | return NULL_TREE; | |
13441 | ||
13442 | /* Check whether the format is a literal string constant. */ | |
13443 | fmt_str = c_getstr (fmt); | |
13444 | if (fmt_str == NULL) | |
13445 | return NULL_TREE; | |
13446 | ||
13447 | if (fcode == BUILT_IN_FPRINTF_UNLOCKED) | |
13448 | { | |
13449 | /* If we're using an unlocked function, assume the other | |
13450 | unlocked functions exist explicitly. */ | |
13451 | fn_fputc = builtin_decl_explicit (BUILT_IN_FPUTC_UNLOCKED); | |
13452 | fn_fputs = builtin_decl_explicit (BUILT_IN_FPUTS_UNLOCKED); | |
13453 | } | |
13454 | else | |
13455 | { | |
13456 | fn_fputc = builtin_decl_implicit (BUILT_IN_FPUTC); | |
13457 | fn_fputs = builtin_decl_implicit (BUILT_IN_FPUTS); | |
13458 | } | |
13459 | ||
13460 | if (!init_target_chars ()) | |
13461 | return NULL_TREE; | |
13462 | ||
13463 | /* If the format doesn't contain % args or %%, use strcpy. */ | |
13464 | if (strchr (fmt_str, target_percent) == NULL) | |
13465 | { | |
13466 | if (fcode != BUILT_IN_VFPRINTF && fcode != BUILT_IN_VFPRINTF_CHK | |
13467 | && arg) | |
13468 | return NULL_TREE; | |
13469 | ||
13470 | /* If the format specifier was "", fprintf does nothing. */ | |
13471 | if (fmt_str[0] == '\0') | |
13472 | { | |
13473 | /* If FP has side-effects, just wait until gimplification is | |
13474 | done. */ | |
13475 | if (TREE_SIDE_EFFECTS (fp)) | |
13476 | return NULL_TREE; | |
13477 | ||
13478 | return build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0); | |
13479 | } | |
13480 | ||
13481 | /* When "string" doesn't contain %, replace all cases of | |
13482 | fprintf (fp, string) with fputs (string, fp). The fputs | |
13483 | builtin will take care of special cases like length == 1. */ | |
13484 | if (fn_fputs) | |
13485 | call = build_call_expr_loc (loc, fn_fputs, 2, fmt, fp); | |
13486 | } | |
13487 | ||
13488 | /* The other optimizations can be done only on the non-va_list variants. */ | |
13489 | else if (fcode == BUILT_IN_VFPRINTF || fcode == BUILT_IN_VFPRINTF_CHK) | |
13490 | return NULL_TREE; | |
13491 | ||
13492 | /* If the format specifier was "%s", call __builtin_fputs (arg, fp). */ | |
13493 | else if (strcmp (fmt_str, target_percent_s) == 0) | |
13494 | { | |
13495 | if (!arg || !validate_arg (arg, POINTER_TYPE)) | |
13496 | return NULL_TREE; | |
13497 | if (fn_fputs) | |
13498 | call = build_call_expr_loc (loc, fn_fputs, 2, arg, fp); | |
13499 | } | |
13500 | ||
13501 | /* If the format specifier was "%c", call __builtin_fputc (arg, fp). */ | |
13502 | else if (strcmp (fmt_str, target_percent_c) == 0) | |
13503 | { | |
13504 | if (!arg || !validate_arg (arg, INTEGER_TYPE)) | |
13505 | return NULL_TREE; | |
13506 | if (fn_fputc) | |
13507 | call = build_call_expr_loc (loc, fn_fputc, 2, arg, fp); | |
13508 | } | |
13509 | ||
13510 | if (!call) | |
13511 | return NULL_TREE; | |
13512 | return fold_convert_loc (loc, TREE_TYPE (TREE_TYPE (fndecl)), call); | |
13513 | } | |
13514 | ||
13515 | /* Initialize format string characters in the target charset. */ | |
13516 | ||
13517 | static bool | |
13518 | init_target_chars (void) | |
13519 | { | |
13520 | static bool init; | |
13521 | if (!init) | |
13522 | { | |
13523 | target_newline = lang_hooks.to_target_charset ('\n'); | |
13524 | target_percent = lang_hooks.to_target_charset ('%'); | |
13525 | target_c = lang_hooks.to_target_charset ('c'); | |
13526 | target_s = lang_hooks.to_target_charset ('s'); | |
13527 | if (target_newline == 0 || target_percent == 0 || target_c == 0 | |
13528 | || target_s == 0) | |
13529 | return false; | |
13530 | ||
13531 | target_percent_c[0] = target_percent; | |
13532 | target_percent_c[1] = target_c; | |
13533 | target_percent_c[2] = '\0'; | |
13534 | ||
13535 | target_percent_s[0] = target_percent; | |
13536 | target_percent_s[1] = target_s; | |
13537 | target_percent_s[2] = '\0'; | |
13538 | ||
13539 | target_percent_s_newline[0] = target_percent; | |
13540 | target_percent_s_newline[1] = target_s; | |
13541 | target_percent_s_newline[2] = target_newline; | |
13542 | target_percent_s_newline[3] = '\0'; | |
13543 | ||
13544 | init = true; | |
13545 | } | |
13546 | return true; | |
13547 | } | |
13548 | ||
13549 | /* Helper function for do_mpfr_arg*(). Ensure M is a normal number | |
13550 | and no overflow/underflow occurred. INEXACT is true if M was not | |
13551 | exactly calculated. TYPE is the tree type for the result. This | |
13552 | function assumes that you cleared the MPFR flags and then | |
13553 | calculated M to see if anything subsequently set a flag prior to | |
13554 | entering this function. Return NULL_TREE if any checks fail. */ | |
13555 | ||
13556 | static tree | |
13557 | do_mpfr_ckconv (mpfr_srcptr m, tree type, int inexact) | |
13558 | { | |
13559 | /* Proceed iff we get a normal number, i.e. not NaN or Inf and no | |
13560 | overflow/underflow occurred. If -frounding-math, proceed iff the | |
13561 | result of calling FUNC was exact. */ | |
13562 | if (mpfr_number_p (m) && !mpfr_overflow_p () && !mpfr_underflow_p () | |
13563 | && (!flag_rounding_math || !inexact)) | |
13564 | { | |
13565 | REAL_VALUE_TYPE rr; | |
13566 | ||
13567 | real_from_mpfr (&rr, m, type, GMP_RNDN); | |
13568 | /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value, | |
13569 | check for overflow/underflow. If the REAL_VALUE_TYPE is zero | |
13570 | but the mpft_t is not, then we underflowed in the | |
13571 | conversion. */ | |
13572 | if (real_isfinite (&rr) | |
13573 | && (rr.cl == rvc_zero) == (mpfr_zero_p (m) != 0)) | |
13574 | { | |
13575 | REAL_VALUE_TYPE rmode; | |
13576 | ||
13577 | real_convert (&rmode, TYPE_MODE (type), &rr); | |
13578 | /* Proceed iff the specified mode can hold the value. */ | |
13579 | if (real_identical (&rmode, &rr)) | |
13580 | return build_real (type, rmode); | |
13581 | } | |
13582 | } | |
13583 | return NULL_TREE; | |
13584 | } | |
13585 | ||
13586 | /* Helper function for do_mpc_arg*(). Ensure M is a normal complex | |
13587 | number and no overflow/underflow occurred. INEXACT is true if M | |
13588 | was not exactly calculated. TYPE is the tree type for the result. | |
13589 | This function assumes that you cleared the MPFR flags and then | |
13590 | calculated M to see if anything subsequently set a flag prior to | |
13591 | entering this function. Return NULL_TREE if any checks fail, if | |
13592 | FORCE_CONVERT is true, then bypass the checks. */ | |
13593 | ||
13594 | static tree | |
13595 | do_mpc_ckconv (mpc_srcptr m, tree type, int inexact, int force_convert) | |
13596 | { | |
13597 | /* Proceed iff we get a normal number, i.e. not NaN or Inf and no | |
13598 | overflow/underflow occurred. If -frounding-math, proceed iff the | |
13599 | result of calling FUNC was exact. */ | |
13600 | if (force_convert | |
13601 | || (mpfr_number_p (mpc_realref (m)) && mpfr_number_p (mpc_imagref (m)) | |
13602 | && !mpfr_overflow_p () && !mpfr_underflow_p () | |
13603 | && (!flag_rounding_math || !inexact))) | |
13604 | { | |
13605 | REAL_VALUE_TYPE re, im; | |
13606 | ||
13607 | real_from_mpfr (&re, mpc_realref (m), TREE_TYPE (type), GMP_RNDN); | |
13608 | real_from_mpfr (&im, mpc_imagref (m), TREE_TYPE (type), GMP_RNDN); | |
13609 | /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values, | |
13610 | check for overflow/underflow. If the REAL_VALUE_TYPE is zero | |
13611 | but the mpft_t is not, then we underflowed in the | |
13612 | conversion. */ | |
13613 | if (force_convert | |
13614 | || (real_isfinite (&re) && real_isfinite (&im) | |
13615 | && (re.cl == rvc_zero) == (mpfr_zero_p (mpc_realref (m)) != 0) | |
13616 | && (im.cl == rvc_zero) == (mpfr_zero_p (mpc_imagref (m)) != 0))) | |
13617 | { | |
13618 | REAL_VALUE_TYPE re_mode, im_mode; | |
13619 | ||
13620 | real_convert (&re_mode, TYPE_MODE (TREE_TYPE (type)), &re); | |
13621 | real_convert (&im_mode, TYPE_MODE (TREE_TYPE (type)), &im); | |
13622 | /* Proceed iff the specified mode can hold the value. */ | |
13623 | if (force_convert | |
13624 | || (real_identical (&re_mode, &re) | |
13625 | && real_identical (&im_mode, &im))) | |
13626 | return build_complex (type, build_real (TREE_TYPE (type), re_mode), | |
13627 | build_real (TREE_TYPE (type), im_mode)); | |
13628 | } | |
13629 | } | |
13630 | return NULL_TREE; | |
13631 | } | |
13632 | ||
13633 | /* If argument ARG is a REAL_CST, call the one-argument mpfr function | |
13634 | FUNC on it and return the resulting value as a tree with type TYPE. | |
13635 | If MIN and/or MAX are not NULL, then the supplied ARG must be | |
13636 | within those bounds. If INCLUSIVE is true, then MIN/MAX are | |
13637 | acceptable values, otherwise they are not. The mpfr precision is | |
13638 | set to the precision of TYPE. We assume that function FUNC returns | |
13639 | zero if the result could be calculated exactly within the requested | |
13640 | precision. */ | |
13641 | ||
13642 | static tree | |
13643 | do_mpfr_arg1 (tree arg, tree type, int (*func)(mpfr_ptr, mpfr_srcptr, mp_rnd_t), | |
13644 | const REAL_VALUE_TYPE *min, const REAL_VALUE_TYPE *max, | |
13645 | bool inclusive) | |
13646 | { | |
13647 | tree result = NULL_TREE; | |
13648 | ||
13649 | STRIP_NOPS (arg); | |
13650 | ||
13651 | /* To proceed, MPFR must exactly represent the target floating point | |
13652 | format, which only happens when the target base equals two. */ | |
13653 | if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2 | |
13654 | && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)) | |
13655 | { | |
13656 | const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg); | |
13657 | ||
13658 | if (real_isfinite (ra) | |
13659 | && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min)) | |
13660 | && (!max || real_compare (inclusive ? LE_EXPR: LT_EXPR , ra, max))) | |
13661 | { | |
13662 | const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type)); | |
13663 | const int prec = fmt->p; | |
13664 | const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN; | |
13665 | int inexact; | |
13666 | mpfr_t m; | |
13667 | ||
13668 | mpfr_init2 (m, prec); | |
13669 | mpfr_from_real (m, ra, GMP_RNDN); | |
13670 | mpfr_clear_flags (); | |
13671 | inexact = func (m, m, rnd); | |
13672 | result = do_mpfr_ckconv (m, type, inexact); | |
13673 | mpfr_clear (m); | |
13674 | } | |
13675 | } | |
13676 | ||
13677 | return result; | |
13678 | } | |
13679 | ||
13680 | /* If argument ARG is a REAL_CST, call the two-argument mpfr function | |
13681 | FUNC on it and return the resulting value as a tree with type TYPE. | |
13682 | The mpfr precision is set to the precision of TYPE. We assume that | |
13683 | function FUNC returns zero if the result could be calculated | |
13684 | exactly within the requested precision. */ | |
13685 | ||
13686 | static tree | |
13687 | do_mpfr_arg2 (tree arg1, tree arg2, tree type, | |
13688 | int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t)) | |
13689 | { | |
13690 | tree result = NULL_TREE; | |
13691 | ||
13692 | STRIP_NOPS (arg1); | |
13693 | STRIP_NOPS (arg2); | |
13694 | ||
13695 | /* To proceed, MPFR must exactly represent the target floating point | |
13696 | format, which only happens when the target base equals two. */ | |
13697 | if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2 | |
13698 | && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1) | |
13699 | && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2)) | |
13700 | { | |
13701 | const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1); | |
13702 | const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2); | |
13703 | ||
13704 | if (real_isfinite (ra1) && real_isfinite (ra2)) | |
13705 | { | |
13706 | const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type)); | |
13707 | const int prec = fmt->p; | |
13708 | const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN; | |
13709 | int inexact; | |
13710 | mpfr_t m1, m2; | |
13711 | ||
13712 | mpfr_inits2 (prec, m1, m2, NULL); | |
13713 | mpfr_from_real (m1, ra1, GMP_RNDN); | |
13714 | mpfr_from_real (m2, ra2, GMP_RNDN); | |
13715 | mpfr_clear_flags (); | |
13716 | inexact = func (m1, m1, m2, rnd); | |
13717 | result = do_mpfr_ckconv (m1, type, inexact); | |
13718 | mpfr_clears (m1, m2, NULL); | |
13719 | } | |
13720 | } | |
13721 | ||
13722 | return result; | |
13723 | } | |
13724 | ||
13725 | /* If argument ARG is a REAL_CST, call the three-argument mpfr function | |
13726 | FUNC on it and return the resulting value as a tree with type TYPE. | |
13727 | The mpfr precision is set to the precision of TYPE. We assume that | |
13728 | function FUNC returns zero if the result could be calculated | |
13729 | exactly within the requested precision. */ | |
13730 | ||
13731 | static tree | |
13732 | do_mpfr_arg3 (tree arg1, tree arg2, tree arg3, tree type, | |
13733 | int (*func)(mpfr_ptr, mpfr_srcptr, mpfr_srcptr, mpfr_srcptr, mp_rnd_t)) | |
13734 | { | |
13735 | tree result = NULL_TREE; | |
13736 | ||
13737 | STRIP_NOPS (arg1); | |
13738 | STRIP_NOPS (arg2); | |
13739 | STRIP_NOPS (arg3); | |
13740 | ||
13741 | /* To proceed, MPFR must exactly represent the target floating point | |
13742 | format, which only happens when the target base equals two. */ | |
13743 | if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2 | |
13744 | && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1) | |
13745 | && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2) | |
13746 | && TREE_CODE (arg3) == REAL_CST && !TREE_OVERFLOW (arg3)) | |
13747 | { | |
13748 | const REAL_VALUE_TYPE *const ra1 = &TREE_REAL_CST (arg1); | |
13749 | const REAL_VALUE_TYPE *const ra2 = &TREE_REAL_CST (arg2); | |
13750 | const REAL_VALUE_TYPE *const ra3 = &TREE_REAL_CST (arg3); | |
13751 | ||
13752 | if (real_isfinite (ra1) && real_isfinite (ra2) && real_isfinite (ra3)) | |
13753 | { | |
13754 | const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type)); | |
13755 | const int prec = fmt->p; | |
13756 | const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN; | |
13757 | int inexact; | |
13758 | mpfr_t m1, m2, m3; | |
13759 | ||
13760 | mpfr_inits2 (prec, m1, m2, m3, NULL); | |
13761 | mpfr_from_real (m1, ra1, GMP_RNDN); | |
13762 | mpfr_from_real (m2, ra2, GMP_RNDN); | |
13763 | mpfr_from_real (m3, ra3, GMP_RNDN); | |
13764 | mpfr_clear_flags (); | |
13765 | inexact = func (m1, m1, m2, m3, rnd); | |
13766 | result = do_mpfr_ckconv (m1, type, inexact); | |
13767 | mpfr_clears (m1, m2, m3, NULL); | |
13768 | } | |
13769 | } | |
13770 | ||
13771 | return result; | |
13772 | } | |
13773 | ||
13774 | /* If argument ARG is a REAL_CST, call mpfr_sin_cos() on it and set | |
13775 | the pointers *(ARG_SINP) and *(ARG_COSP) to the resulting values. | |
13776 | If ARG_SINP and ARG_COSP are NULL then the result is returned | |
13777 | as a complex value. | |
13778 | The type is taken from the type of ARG and is used for setting the | |
13779 | precision of the calculation and results. */ | |
13780 | ||
13781 | static tree | |
13782 | do_mpfr_sincos (tree arg, tree arg_sinp, tree arg_cosp) | |
13783 | { | |
13784 | tree const type = TREE_TYPE (arg); | |
13785 | tree result = NULL_TREE; | |
13786 | ||
13787 | STRIP_NOPS (arg); | |
13788 | ||
13789 | /* To proceed, MPFR must exactly represent the target floating point | |
13790 | format, which only happens when the target base equals two. */ | |
13791 | if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2 | |
13792 | && TREE_CODE (arg) == REAL_CST | |
13793 | && !TREE_OVERFLOW (arg)) | |
13794 | { | |
13795 | const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg); | |
13796 | ||
13797 | if (real_isfinite (ra)) | |
13798 | { | |
13799 | const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type)); | |
13800 | const int prec = fmt->p; | |
13801 | const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN; | |
13802 | tree result_s, result_c; | |
13803 | int inexact; | |
13804 | mpfr_t m, ms, mc; | |
13805 | ||
13806 | mpfr_inits2 (prec, m, ms, mc, NULL); | |
13807 | mpfr_from_real (m, ra, GMP_RNDN); | |
13808 | mpfr_clear_flags (); | |
13809 | inexact = mpfr_sin_cos (ms, mc, m, rnd); | |
13810 | result_s = do_mpfr_ckconv (ms, type, inexact); | |
13811 | result_c = do_mpfr_ckconv (mc, type, inexact); | |
13812 | mpfr_clears (m, ms, mc, NULL); | |
13813 | if (result_s && result_c) | |
13814 | { | |
13815 | /* If we are to return in a complex value do so. */ | |
13816 | if (!arg_sinp && !arg_cosp) | |
13817 | return build_complex (build_complex_type (type), | |
13818 | result_c, result_s); | |
13819 | ||
13820 | /* Dereference the sin/cos pointer arguments. */ | |
13821 | arg_sinp = build_fold_indirect_ref (arg_sinp); | |
13822 | arg_cosp = build_fold_indirect_ref (arg_cosp); | |
13823 | /* Proceed if valid pointer type were passed in. */ | |
13824 | if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_sinp)) == TYPE_MAIN_VARIANT (type) | |
13825 | && TYPE_MAIN_VARIANT (TREE_TYPE (arg_cosp)) == TYPE_MAIN_VARIANT (type)) | |
13826 | { | |
13827 | /* Set the values. */ | |
13828 | result_s = fold_build2 (MODIFY_EXPR, type, arg_sinp, | |
13829 | result_s); | |
13830 | TREE_SIDE_EFFECTS (result_s) = 1; | |
13831 | result_c = fold_build2 (MODIFY_EXPR, type, arg_cosp, | |
13832 | result_c); | |
13833 | TREE_SIDE_EFFECTS (result_c) = 1; | |
13834 | /* Combine the assignments into a compound expr. */ | |
13835 | result = non_lvalue (fold_build2 (COMPOUND_EXPR, type, | |
13836 | result_s, result_c)); | |
13837 | } | |
13838 | } | |
13839 | } | |
13840 | } | |
13841 | return result; | |
13842 | } | |
13843 | ||
13844 | /* If argument ARG1 is an INTEGER_CST and ARG2 is a REAL_CST, call the | |
13845 | two-argument mpfr order N Bessel function FUNC on them and return | |
13846 | the resulting value as a tree with type TYPE. The mpfr precision | |
13847 | is set to the precision of TYPE. We assume that function FUNC | |
13848 | returns zero if the result could be calculated exactly within the | |
13849 | requested precision. */ | |
13850 | static tree | |
13851 | do_mpfr_bessel_n (tree arg1, tree arg2, tree type, | |
13852 | int (*func)(mpfr_ptr, long, mpfr_srcptr, mp_rnd_t), | |
13853 | const REAL_VALUE_TYPE *min, bool inclusive) | |
13854 | { | |
13855 | tree result = NULL_TREE; | |
13856 | ||
13857 | STRIP_NOPS (arg1); | |
13858 | STRIP_NOPS (arg2); | |
13859 | ||
13860 | /* To proceed, MPFR must exactly represent the target floating point | |
13861 | format, which only happens when the target base equals two. */ | |
13862 | if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2 | |
13863 | && host_integerp (arg1, 0) | |
13864 | && TREE_CODE (arg2) == REAL_CST && !TREE_OVERFLOW (arg2)) | |
13865 | { | |
13866 | const HOST_WIDE_INT n = tree_low_cst(arg1, 0); | |
13867 | const REAL_VALUE_TYPE *const ra = &TREE_REAL_CST (arg2); | |
13868 | ||
13869 | if (n == (long)n | |
13870 | && real_isfinite (ra) | |
13871 | && (!min || real_compare (inclusive ? GE_EXPR: GT_EXPR , ra, min))) | |
13872 | { | |
13873 | const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type)); | |
13874 | const int prec = fmt->p; | |
13875 | const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN; | |
13876 | int inexact; | |
13877 | mpfr_t m; | |
13878 | ||
13879 | mpfr_init2 (m, prec); | |
13880 | mpfr_from_real (m, ra, GMP_RNDN); | |
13881 | mpfr_clear_flags (); | |
13882 | inexact = func (m, n, m, rnd); | |
13883 | result = do_mpfr_ckconv (m, type, inexact); | |
13884 | mpfr_clear (m); | |
13885 | } | |
13886 | } | |
13887 | ||
13888 | return result; | |
13889 | } | |
13890 | ||
13891 | /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set | |
13892 | the pointer *(ARG_QUO) and return the result. The type is taken | |
13893 | from the type of ARG0 and is used for setting the precision of the | |
13894 | calculation and results. */ | |
13895 | ||
13896 | static tree | |
13897 | do_mpfr_remquo (tree arg0, tree arg1, tree arg_quo) | |
13898 | { | |
13899 | tree const type = TREE_TYPE (arg0); | |
13900 | tree result = NULL_TREE; | |
13901 | ||
13902 | STRIP_NOPS (arg0); | |
13903 | STRIP_NOPS (arg1); | |
13904 | ||
13905 | /* To proceed, MPFR must exactly represent the target floating point | |
13906 | format, which only happens when the target base equals two. */ | |
13907 | if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2 | |
13908 | && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0) | |
13909 | && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1)) | |
13910 | { | |
13911 | const REAL_VALUE_TYPE *const ra0 = TREE_REAL_CST_PTR (arg0); | |
13912 | const REAL_VALUE_TYPE *const ra1 = TREE_REAL_CST_PTR (arg1); | |
13913 | ||
13914 | if (real_isfinite (ra0) && real_isfinite (ra1)) | |
13915 | { | |
13916 | const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type)); | |
13917 | const int prec = fmt->p; | |
13918 | const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN; | |
13919 | tree result_rem; | |
13920 | long integer_quo; | |
13921 | mpfr_t m0, m1; | |
13922 | ||
13923 | mpfr_inits2 (prec, m0, m1, NULL); | |
13924 | mpfr_from_real (m0, ra0, GMP_RNDN); | |
13925 | mpfr_from_real (m1, ra1, GMP_RNDN); | |
13926 | mpfr_clear_flags (); | |
13927 | mpfr_remquo (m0, &integer_quo, m0, m1, rnd); | |
13928 | /* Remquo is independent of the rounding mode, so pass | |
13929 | inexact=0 to do_mpfr_ckconv(). */ | |
13930 | result_rem = do_mpfr_ckconv (m0, type, /*inexact=*/ 0); | |
13931 | mpfr_clears (m0, m1, NULL); | |
13932 | if (result_rem) | |
13933 | { | |
13934 | /* MPFR calculates quo in the host's long so it may | |
13935 | return more bits in quo than the target int can hold | |
13936 | if sizeof(host long) > sizeof(target int). This can | |
13937 | happen even for native compilers in LP64 mode. In | |
13938 | these cases, modulo the quo value with the largest | |
13939 | number that the target int can hold while leaving one | |
13940 | bit for the sign. */ | |
13941 | if (sizeof (integer_quo) * CHAR_BIT > INT_TYPE_SIZE) | |
13942 | integer_quo %= (long)(1UL << (INT_TYPE_SIZE - 1)); | |
13943 | ||
13944 | /* Dereference the quo pointer argument. */ | |
13945 | arg_quo = build_fold_indirect_ref (arg_quo); | |
13946 | /* Proceed iff a valid pointer type was passed in. */ | |
13947 | if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_quo)) == integer_type_node) | |
13948 | { | |
13949 | /* Set the value. */ | |
13950 | tree result_quo | |
13951 | = fold_build2 (MODIFY_EXPR, TREE_TYPE (arg_quo), arg_quo, | |
13952 | build_int_cst (TREE_TYPE (arg_quo), | |
13953 | integer_quo)); | |
13954 | TREE_SIDE_EFFECTS (result_quo) = 1; | |
13955 | /* Combine the quo assignment with the rem. */ | |
13956 | result = non_lvalue (fold_build2 (COMPOUND_EXPR, type, | |
13957 | result_quo, result_rem)); | |
13958 | } | |
13959 | } | |
13960 | } | |
13961 | } | |
13962 | return result; | |
13963 | } | |
13964 | ||
13965 | /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the | |
13966 | resulting value as a tree with type TYPE. The mpfr precision is | |
13967 | set to the precision of TYPE. We assume that this mpfr function | |
13968 | returns zero if the result could be calculated exactly within the | |
13969 | requested precision. In addition, the integer pointer represented | |
13970 | by ARG_SG will be dereferenced and set to the appropriate signgam | |
13971 | (-1,1) value. */ | |
13972 | ||
13973 | static tree | |
13974 | do_mpfr_lgamma_r (tree arg, tree arg_sg, tree type) | |
13975 | { | |
13976 | tree result = NULL_TREE; | |
13977 | ||
13978 | STRIP_NOPS (arg); | |
13979 | ||
13980 | /* To proceed, MPFR must exactly represent the target floating point | |
13981 | format, which only happens when the target base equals two. Also | |
13982 | verify ARG is a constant and that ARG_SG is an int pointer. */ | |
13983 | if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2 | |
13984 | && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg) | |
13985 | && TREE_CODE (TREE_TYPE (arg_sg)) == POINTER_TYPE | |
13986 | && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (arg_sg))) == integer_type_node) | |
13987 | { | |
13988 | const REAL_VALUE_TYPE *const ra = TREE_REAL_CST_PTR (arg); | |
13989 | ||
13990 | /* In addition to NaN and Inf, the argument cannot be zero or a | |
13991 | negative integer. */ | |
13992 | if (real_isfinite (ra) | |
13993 | && ra->cl != rvc_zero | |
13994 | && !(real_isneg(ra) && real_isinteger(ra, TYPE_MODE (type)))) | |
13995 | { | |
13996 | const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type)); | |
13997 | const int prec = fmt->p; | |
13998 | const mp_rnd_t rnd = fmt->round_towards_zero? GMP_RNDZ : GMP_RNDN; | |
13999 | int inexact, sg; | |
14000 | mpfr_t m; | |
14001 | tree result_lg; | |
14002 | ||
14003 | mpfr_init2 (m, prec); | |
14004 | mpfr_from_real (m, ra, GMP_RNDN); | |
14005 | mpfr_clear_flags (); | |
14006 | inexact = mpfr_lgamma (m, &sg, m, rnd); | |
14007 | result_lg = do_mpfr_ckconv (m, type, inexact); | |
14008 | mpfr_clear (m); | |
14009 | if (result_lg) | |
14010 | { | |
14011 | tree result_sg; | |
14012 | ||
14013 | /* Dereference the arg_sg pointer argument. */ | |
14014 | arg_sg = build_fold_indirect_ref (arg_sg); | |
14015 | /* Assign the signgam value into *arg_sg. */ | |
14016 | result_sg = fold_build2 (MODIFY_EXPR, | |
14017 | TREE_TYPE (arg_sg), arg_sg, | |
14018 | build_int_cst (TREE_TYPE (arg_sg), sg)); | |
14019 | TREE_SIDE_EFFECTS (result_sg) = 1; | |
14020 | /* Combine the signgam assignment with the lgamma result. */ | |
14021 | result = non_lvalue (fold_build2 (COMPOUND_EXPR, type, | |
14022 | result_sg, result_lg)); | |
14023 | } | |
14024 | } | |
14025 | } | |
14026 | ||
14027 | return result; | |
14028 | } | |
14029 | ||
14030 | /* If argument ARG is a COMPLEX_CST, call the one-argument mpc | |
14031 | function FUNC on it and return the resulting value as a tree with | |
14032 | type TYPE. The mpfr precision is set to the precision of TYPE. We | |
14033 | assume that function FUNC returns zero if the result could be | |
14034 | calculated exactly within the requested precision. */ | |
14035 | ||
14036 | static tree | |
14037 | do_mpc_arg1 (tree arg, tree type, int (*func)(mpc_ptr, mpc_srcptr, mpc_rnd_t)) | |
14038 | { | |
14039 | tree result = NULL_TREE; | |
14040 | ||
14041 | STRIP_NOPS (arg); | |
14042 | ||
14043 | /* To proceed, MPFR must exactly represent the target floating point | |
14044 | format, which only happens when the target base equals two. */ | |
14045 | if (TREE_CODE (arg) == COMPLEX_CST && !TREE_OVERFLOW (arg) | |
14046 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) == REAL_TYPE | |
14047 | && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg))))->b == 2) | |
14048 | { | |
14049 | const REAL_VALUE_TYPE *const re = TREE_REAL_CST_PTR (TREE_REALPART (arg)); | |
14050 | const REAL_VALUE_TYPE *const im = TREE_REAL_CST_PTR (TREE_IMAGPART (arg)); | |
14051 | ||
14052 | if (real_isfinite (re) && real_isfinite (im)) | |
14053 | { | |
14054 | const struct real_format *const fmt = | |
14055 | REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type))); | |
14056 | const int prec = fmt->p; | |
14057 | const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN; | |
14058 | const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN; | |
14059 | int inexact; | |
14060 | mpc_t m; | |
14061 | ||
14062 | mpc_init2 (m, prec); | |
14063 | mpfr_from_real (mpc_realref(m), re, rnd); | |
14064 | mpfr_from_real (mpc_imagref(m), im, rnd); | |
14065 | mpfr_clear_flags (); | |
14066 | inexact = func (m, m, crnd); | |
14067 | result = do_mpc_ckconv (m, type, inexact, /*force_convert=*/ 0); | |
14068 | mpc_clear (m); | |
14069 | } | |
14070 | } | |
14071 | ||
14072 | return result; | |
14073 | } | |
14074 | ||
14075 | /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument | |
14076 | mpc function FUNC on it and return the resulting value as a tree | |
14077 | with type TYPE. The mpfr precision is set to the precision of | |
14078 | TYPE. We assume that function FUNC returns zero if the result | |
14079 | could be calculated exactly within the requested precision. If | |
14080 | DO_NONFINITE is true, then fold expressions containing Inf or NaN | |
14081 | in the arguments and/or results. */ | |
14082 | ||
14083 | tree | |
14084 | do_mpc_arg2 (tree arg0, tree arg1, tree type, int do_nonfinite, | |
14085 | int (*func)(mpc_ptr, mpc_srcptr, mpc_srcptr, mpc_rnd_t)) | |
14086 | { | |
14087 | tree result = NULL_TREE; | |
14088 | ||
14089 | STRIP_NOPS (arg0); | |
14090 | STRIP_NOPS (arg1); | |
14091 | ||
14092 | /* To proceed, MPFR must exactly represent the target floating point | |
14093 | format, which only happens when the target base equals two. */ | |
14094 | if (TREE_CODE (arg0) == COMPLEX_CST && !TREE_OVERFLOW (arg0) | |
14095 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE | |
14096 | && TREE_CODE (arg1) == COMPLEX_CST && !TREE_OVERFLOW (arg1) | |
14097 | && TREE_CODE (TREE_TYPE (TREE_TYPE (arg1))) == REAL_TYPE | |
14098 | && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg0))))->b == 2) | |
14099 | { | |
14100 | const REAL_VALUE_TYPE *const re0 = TREE_REAL_CST_PTR (TREE_REALPART (arg0)); | |
14101 | const REAL_VALUE_TYPE *const im0 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg0)); | |
14102 | const REAL_VALUE_TYPE *const re1 = TREE_REAL_CST_PTR (TREE_REALPART (arg1)); | |
14103 | const REAL_VALUE_TYPE *const im1 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg1)); | |
14104 | ||
14105 | if (do_nonfinite | |
14106 | || (real_isfinite (re0) && real_isfinite (im0) | |
14107 | && real_isfinite (re1) && real_isfinite (im1))) | |
14108 | { | |
14109 | const struct real_format *const fmt = | |
14110 | REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type))); | |
14111 | const int prec = fmt->p; | |
14112 | const mp_rnd_t rnd = fmt->round_towards_zero ? GMP_RNDZ : GMP_RNDN; | |
14113 | const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN; | |
14114 | int inexact; | |
14115 | mpc_t m0, m1; | |
14116 | ||
14117 | mpc_init2 (m0, prec); | |
14118 | mpc_init2 (m1, prec); | |
14119 | mpfr_from_real (mpc_realref(m0), re0, rnd); | |
14120 | mpfr_from_real (mpc_imagref(m0), im0, rnd); | |
14121 | mpfr_from_real (mpc_realref(m1), re1, rnd); | |
14122 | mpfr_from_real (mpc_imagref(m1), im1, rnd); | |
14123 | mpfr_clear_flags (); | |
14124 | inexact = func (m0, m0, m1, crnd); | |
14125 | result = do_mpc_ckconv (m0, type, inexact, do_nonfinite); | |
14126 | mpc_clear (m0); | |
14127 | mpc_clear (m1); | |
14128 | } | |
14129 | } | |
14130 | ||
14131 | return result; | |
14132 | } | |
14133 | ||
14134 | /* Fold a call STMT to __{,v}sprintf_chk. Return NULL_TREE if | |
14135 | a normal call should be emitted rather than expanding the function | |
14136 | inline. FCODE is either BUILT_IN_SPRINTF_CHK or BUILT_IN_VSPRINTF_CHK. */ | |
14137 | ||
14138 | static tree | |
14139 | gimple_fold_builtin_sprintf_chk (gimple stmt, enum built_in_function fcode) | |
14140 | { | |
14141 | int nargs = gimple_call_num_args (stmt); | |
14142 | ||
14143 | return fold_builtin_sprintf_chk_1 (gimple_location (stmt), nargs, | |
14144 | (nargs > 0 | |
14145 | ? gimple_call_arg_ptr (stmt, 0) | |
14146 | : &error_mark_node), fcode); | |
14147 | } | |
14148 | ||
14149 | /* Fold a call STMT to {,v}snprintf. Return NULL_TREE if | |
14150 | a normal call should be emitted rather than expanding the function | |
14151 | inline. FCODE is either BUILT_IN_SNPRINTF_CHK or | |
14152 | BUILT_IN_VSNPRINTF_CHK. If MAXLEN is not NULL, it is maximum length | |
14153 | passed as second argument. */ | |
14154 | ||
14155 | tree | |
14156 | gimple_fold_builtin_snprintf_chk (gimple stmt, tree maxlen, | |
14157 | enum built_in_function fcode) | |
14158 | { | |
14159 | int nargs = gimple_call_num_args (stmt); | |
14160 | ||
14161 | return fold_builtin_snprintf_chk_1 (gimple_location (stmt), nargs, | |
14162 | (nargs > 0 | |
14163 | ? gimple_call_arg_ptr (stmt, 0) | |
14164 | : &error_mark_node), maxlen, fcode); | |
14165 | } | |
14166 | ||
14167 | /* Builtins with folding operations that operate on "..." arguments | |
14168 | need special handling; we need to store the arguments in a convenient | |
14169 | data structure before attempting any folding. Fortunately there are | |
14170 | only a few builtins that fall into this category. FNDECL is the | |
14171 | function, EXP is the CALL_EXPR for the call, and IGNORE is true if the | |
14172 | result of the function call is ignored. */ | |
14173 | ||
14174 | static tree | |
14175 | gimple_fold_builtin_varargs (tree fndecl, gimple stmt, | |
14176 | bool ignore ATTRIBUTE_UNUSED) | |
14177 | { | |
14178 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
14179 | tree ret = NULL_TREE; | |
14180 | ||
14181 | switch (fcode) | |
14182 | { | |
14183 | case BUILT_IN_SPRINTF_CHK: | |
14184 | case BUILT_IN_VSPRINTF_CHK: | |
14185 | ret = gimple_fold_builtin_sprintf_chk (stmt, fcode); | |
14186 | break; | |
14187 | ||
14188 | case BUILT_IN_SNPRINTF_CHK: | |
14189 | case BUILT_IN_VSNPRINTF_CHK: | |
14190 | ret = gimple_fold_builtin_snprintf_chk (stmt, NULL_TREE, fcode); | |
14191 | ||
14192 | default: | |
14193 | break; | |
14194 | } | |
14195 | if (ret) | |
14196 | { | |
14197 | ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret); | |
14198 | TREE_NO_WARNING (ret) = 1; | |
14199 | return ret; | |
14200 | } | |
14201 | return NULL_TREE; | |
14202 | } | |
14203 | ||
14204 | /* A wrapper function for builtin folding that prevents warnings for | |
14205 | "statement without effect" and the like, caused by removing the | |
14206 | call node earlier than the warning is generated. */ | |
14207 | ||
14208 | tree | |
14209 | fold_call_stmt (gimple stmt, bool ignore) | |
14210 | { | |
14211 | tree ret = NULL_TREE; | |
14212 | tree fndecl = gimple_call_fndecl (stmt); | |
14213 | location_t loc = gimple_location (stmt); | |
14214 | if (fndecl | |
14215 | && TREE_CODE (fndecl) == FUNCTION_DECL | |
14216 | && DECL_BUILT_IN (fndecl) | |
14217 | && !gimple_call_va_arg_pack_p (stmt)) | |
14218 | { | |
14219 | int nargs = gimple_call_num_args (stmt); | |
14220 | tree *args = (nargs > 0 | |
14221 | ? gimple_call_arg_ptr (stmt, 0) | |
14222 | : &error_mark_node); | |
14223 | ||
14224 | if (avoid_folding_inline_builtin (fndecl)) | |
14225 | return NULL_TREE; | |
14226 | if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD) | |
14227 | { | |
14228 | return targetm.fold_builtin (fndecl, nargs, args, ignore); | |
14229 | } | |
14230 | else | |
14231 | { | |
14232 | if (nargs <= MAX_ARGS_TO_FOLD_BUILTIN) | |
14233 | ret = fold_builtin_n (loc, fndecl, args, nargs, ignore); | |
14234 | if (!ret) | |
14235 | ret = gimple_fold_builtin_varargs (fndecl, stmt, ignore); | |
14236 | if (ret) | |
14237 | { | |
14238 | /* Propagate location information from original call to | |
14239 | expansion of builtin. Otherwise things like | |
14240 | maybe_emit_chk_warning, that operate on the expansion | |
14241 | of a builtin, will use the wrong location information. */ | |
14242 | if (gimple_has_location (stmt)) | |
14243 | { | |
14244 | tree realret = ret; | |
14245 | if (TREE_CODE (ret) == NOP_EXPR) | |
14246 | realret = TREE_OPERAND (ret, 0); | |
14247 | if (CAN_HAVE_LOCATION_P (realret) | |
14248 | && !EXPR_HAS_LOCATION (realret)) | |
14249 | SET_EXPR_LOCATION (realret, loc); | |
14250 | return realret; | |
14251 | } | |
14252 | return ret; | |
14253 | } | |
14254 | } | |
14255 | } | |
14256 | return NULL_TREE; | |
14257 | } | |
14258 | ||
14259 | /* Look up the function in builtin_decl that corresponds to DECL | |
14260 | and set ASMSPEC as its user assembler name. DECL must be a | |
14261 | function decl that declares a builtin. */ | |
14262 | ||
14263 | void | |
14264 | set_builtin_user_assembler_name (tree decl, const char *asmspec) | |
14265 | { | |
14266 | tree builtin; | |
14267 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL | |
14268 | && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL | |
14269 | && asmspec != 0); | |
14270 | ||
14271 | builtin = builtin_decl_explicit (DECL_FUNCTION_CODE (decl)); | |
14272 | set_user_assembler_name (builtin, asmspec); | |
14273 | switch (DECL_FUNCTION_CODE (decl)) | |
14274 | { | |
14275 | case BUILT_IN_MEMCPY: | |
14276 | init_block_move_fn (asmspec); | |
14277 | memcpy_libfunc = set_user_assembler_libfunc ("memcpy", asmspec); | |
14278 | break; | |
14279 | case BUILT_IN_MEMSET: | |
14280 | init_block_clear_fn (asmspec); | |
14281 | memset_libfunc = set_user_assembler_libfunc ("memset", asmspec); | |
14282 | break; | |
14283 | case BUILT_IN_MEMMOVE: | |
14284 | memmove_libfunc = set_user_assembler_libfunc ("memmove", asmspec); | |
14285 | break; | |
14286 | case BUILT_IN_MEMCMP: | |
14287 | memcmp_libfunc = set_user_assembler_libfunc ("memcmp", asmspec); | |
14288 | break; | |
14289 | case BUILT_IN_ABORT: | |
14290 | abort_libfunc = set_user_assembler_libfunc ("abort", asmspec); | |
14291 | break; | |
14292 | case BUILT_IN_FFS: | |
14293 | if (INT_TYPE_SIZE < BITS_PER_WORD) | |
14294 | { | |
14295 | set_user_assembler_libfunc ("ffs", asmspec); | |
14296 | set_optab_libfunc (ffs_optab, mode_for_size (INT_TYPE_SIZE, | |
14297 | MODE_INT, 0), "ffs"); | |
14298 | } | |
14299 | break; | |
14300 | default: | |
14301 | break; | |
14302 | } | |
14303 | } | |
14304 | ||
14305 | /* Return true if DECL is a builtin that expands to a constant or similarly | |
14306 | simple code. */ | |
14307 | bool | |
14308 | is_simple_builtin (tree decl) | |
14309 | { | |
14310 | if (decl && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL) | |
14311 | switch (DECL_FUNCTION_CODE (decl)) | |
14312 | { | |
14313 | /* Builtins that expand to constants. */ | |
14314 | case BUILT_IN_CONSTANT_P: | |
14315 | case BUILT_IN_EXPECT: | |
14316 | case BUILT_IN_OBJECT_SIZE: | |
14317 | case BUILT_IN_UNREACHABLE: | |
14318 | /* Simple register moves or loads from stack. */ | |
14319 | case BUILT_IN_ASSUME_ALIGNED: | |
14320 | case BUILT_IN_RETURN_ADDRESS: | |
14321 | case BUILT_IN_EXTRACT_RETURN_ADDR: | |
14322 | case BUILT_IN_FROB_RETURN_ADDR: | |
14323 | case BUILT_IN_RETURN: | |
14324 | case BUILT_IN_AGGREGATE_INCOMING_ADDRESS: | |
14325 | case BUILT_IN_FRAME_ADDRESS: | |
14326 | case BUILT_IN_VA_END: | |
14327 | case BUILT_IN_STACK_SAVE: | |
14328 | case BUILT_IN_STACK_RESTORE: | |
14329 | /* Exception state returns or moves registers around. */ | |
14330 | case BUILT_IN_EH_FILTER: | |
14331 | case BUILT_IN_EH_POINTER: | |
14332 | case BUILT_IN_EH_COPY_VALUES: | |
14333 | return true; | |
14334 | ||
14335 | default: | |
14336 | return false; | |
14337 | } | |
14338 | ||
14339 | return false; | |
14340 | } | |
14341 | ||
14342 | /* Return true if DECL is a builtin that is not expensive, i.e., they are | |
14343 | most probably expanded inline into reasonably simple code. This is a | |
14344 | superset of is_simple_builtin. */ | |
14345 | bool | |
14346 | is_inexpensive_builtin (tree decl) | |
14347 | { | |
14348 | if (!decl) | |
14349 | return false; | |
14350 | else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD) | |
14351 | return true; | |
14352 | else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL) | |
14353 | switch (DECL_FUNCTION_CODE (decl)) | |
14354 | { | |
14355 | case BUILT_IN_ABS: | |
14356 | case BUILT_IN_ALLOCA: | |
14357 | case BUILT_IN_ALLOCA_WITH_ALIGN: | |
14358 | case BUILT_IN_BSWAP32: | |
14359 | case BUILT_IN_BSWAP64: | |
14360 | case BUILT_IN_CLZ: | |
14361 | case BUILT_IN_CLZIMAX: | |
14362 | case BUILT_IN_CLZL: | |
14363 | case BUILT_IN_CLZLL: | |
14364 | case BUILT_IN_CTZ: | |
14365 | case BUILT_IN_CTZIMAX: | |
14366 | case BUILT_IN_CTZL: | |
14367 | case BUILT_IN_CTZLL: | |
14368 | case BUILT_IN_FFS: | |
14369 | case BUILT_IN_FFSIMAX: | |
14370 | case BUILT_IN_FFSL: | |
14371 | case BUILT_IN_FFSLL: | |
14372 | case BUILT_IN_IMAXABS: | |
14373 | case BUILT_IN_FINITE: | |
14374 | case BUILT_IN_FINITEF: | |
14375 | case BUILT_IN_FINITEL: | |
14376 | case BUILT_IN_FINITED32: | |
14377 | case BUILT_IN_FINITED64: | |
14378 | case BUILT_IN_FINITED128: | |
14379 | case BUILT_IN_FPCLASSIFY: | |
14380 | case BUILT_IN_ISFINITE: | |
14381 | case BUILT_IN_ISINF_SIGN: | |
14382 | case BUILT_IN_ISINF: | |
14383 | case BUILT_IN_ISINFF: | |
14384 | case BUILT_IN_ISINFL: | |
14385 | case BUILT_IN_ISINFD32: | |
14386 | case BUILT_IN_ISINFD64: | |
14387 | case BUILT_IN_ISINFD128: | |
14388 | case BUILT_IN_ISNAN: | |
14389 | case BUILT_IN_ISNANF: | |
14390 | case BUILT_IN_ISNANL: | |
14391 | case BUILT_IN_ISNAND32: | |
14392 | case BUILT_IN_ISNAND64: | |
14393 | case BUILT_IN_ISNAND128: | |
14394 | case BUILT_IN_ISNORMAL: | |
14395 | case BUILT_IN_ISGREATER: | |
14396 | case BUILT_IN_ISGREATEREQUAL: | |
14397 | case BUILT_IN_ISLESS: | |
14398 | case BUILT_IN_ISLESSEQUAL: | |
14399 | case BUILT_IN_ISLESSGREATER: | |
14400 | case BUILT_IN_ISUNORDERED: | |
14401 | case BUILT_IN_VA_ARG_PACK: | |
14402 | case BUILT_IN_VA_ARG_PACK_LEN: | |
14403 | case BUILT_IN_VA_COPY: | |
14404 | case BUILT_IN_TRAP: | |
14405 | case BUILT_IN_SAVEREGS: | |
14406 | case BUILT_IN_POPCOUNTL: | |
14407 | case BUILT_IN_POPCOUNTLL: | |
14408 | case BUILT_IN_POPCOUNTIMAX: | |
14409 | case BUILT_IN_POPCOUNT: | |
14410 | case BUILT_IN_PARITYL: | |
14411 | case BUILT_IN_PARITYLL: | |
14412 | case BUILT_IN_PARITYIMAX: | |
14413 | case BUILT_IN_PARITY: | |
14414 | case BUILT_IN_LABS: | |
14415 | case BUILT_IN_LLABS: | |
14416 | case BUILT_IN_PREFETCH: | |
14417 | return true; | |
14418 | ||
14419 | default: | |
14420 | return is_simple_builtin (decl); | |
14421 | } | |
14422 | ||
14423 | return false; | |
14424 | } |