Branch data Line data Source code
1 : : /* Expand builtin functions.
2 : : Copyright (C) 1988-2025 Free Software Foundation, Inc.
3 : :
4 : : This file is part of GCC.
5 : :
6 : : GCC is free software; you can redistribute it and/or modify it under
7 : : the terms of the GNU General Public License as published by the Free
8 : : Software Foundation; either version 3, or (at your option) any later
9 : : version.
10 : :
11 : : GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 : : WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 : : FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 : : for more details.
15 : :
16 : : You should have received a copy of the GNU General Public License
17 : : along with GCC; see the file COPYING3. If not see
18 : : <http://www.gnu.org/licenses/>. */
19 : :
20 : : /* Legacy warning! Please add no further builtin simplifications here
21 : : (apart from pure constant folding) - builtin simplifications should go
22 : : to match.pd or gimple-fold.cc instead. */
23 : :
24 : : #include "config.h"
25 : : #include "system.h"
26 : : #include "coretypes.h"
27 : : #include "backend.h"
28 : : #include "target.h"
29 : : #include "rtl.h"
30 : : #include "tree.h"
31 : : #include "memmodel.h"
32 : : #include "gimple.h"
33 : : #include "predict.h"
34 : : #include "tm_p.h"
35 : : #include "stringpool.h"
36 : : #include "tree-vrp.h"
37 : : #include "tree-ssanames.h"
38 : : #include "expmed.h"
39 : : #include "optabs.h"
40 : : #include "emit-rtl.h"
41 : : #include "recog.h"
42 : : #include "diagnostic-core.h"
43 : : #include "alias.h"
44 : : #include "fold-const.h"
45 : : #include "fold-const-call.h"
46 : : #include "gimple-ssa-warn-access.h"
47 : : #include "stor-layout.h"
48 : : #include "calls.h"
49 : : #include "varasm.h"
50 : : #include "tree-object-size.h"
51 : : #include "tree-ssa-strlen.h"
52 : : #include "realmpfr.h"
53 : : #include "cfgrtl.h"
54 : : #include "except.h"
55 : : #include "dojump.h"
56 : : #include "explow.h"
57 : : #include "stmt.h"
58 : : #include "expr.h"
59 : : #include "libfuncs.h"
60 : : #include "output.h"
61 : : #include "typeclass.h"
62 : : #include "langhooks.h"
63 : : #include "value-prof.h"
64 : : #include "builtins.h"
65 : : #include "stringpool.h"
66 : : #include "attribs.h"
67 : : #include "asan.h"
68 : : #include "internal-fn.h"
69 : : #include "case-cfn-macros.h"
70 : : #include "gimple-iterator.h"
71 : : #include "gimple-fold.h"
72 : : #include "intl.h"
73 : : #include "file-prefix-map.h" /* remap_macro_filename() */
74 : : #include "ipa-strub.h" /* strub_watermark_parm() */
75 : : #include "gomp-constants.h"
76 : : #include "omp-general.h"
77 : : #include "tree-dfa.h"
78 : : #include "gimple-ssa.h"
79 : : #include "tree-ssa-live.h"
80 : : #include "tree-outof-ssa.h"
81 : : #include "attr-fnspec.h"
82 : : #include "demangle.h"
83 : : #include "gimple-range.h"
84 : : #include "pointer-query.h"
85 : :
86 : : struct target_builtins default_target_builtins;
87 : : #if SWITCHABLE_TARGET
88 : : struct target_builtins *this_target_builtins = &default_target_builtins;
89 : : #endif
90 : :
91 : : /* Define the names of the builtin function types and codes. */
92 : : const char *const built_in_class_names[BUILT_IN_LAST]
93 : : = {"NOT_BUILT_IN", "BUILT_IN_FRONTEND", "BUILT_IN_MD", "BUILT_IN_NORMAL"};
94 : :
95 : : #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
96 : : const char * built_in_names[(int) END_BUILTINS] =
97 : : {
98 : : #include "builtins.def"
99 : : };
100 : :
101 : : /* Setup an array of builtin_info_type, make sure each element decl is
102 : : initialized to NULL_TREE. */
103 : : builtin_info_type builtin_info[(int)END_BUILTINS];
104 : :
105 : : /* Non-zero if __builtin_constant_p should be folded right away. */
106 : : bool force_folding_builtin_constant_p;
107 : :
108 : : static int target_char_cast (tree, char *);
109 : : static int apply_args_size (void);
110 : : static int apply_result_size (void);
111 : : static rtx result_vector (int, rtx);
112 : : static void expand_builtin_prefetch (tree);
113 : : static rtx expand_builtin_apply_args (void);
114 : : static rtx expand_builtin_apply_args_1 (void);
115 : : static rtx expand_builtin_apply (rtx, rtx, rtx);
116 : : static void expand_builtin_return (rtx);
117 : : static rtx expand_builtin_classify_type (tree);
118 : : static rtx expand_builtin_mathfn_3 (tree, rtx, rtx);
119 : : static rtx expand_builtin_mathfn_ternary (tree, rtx, rtx);
120 : : static rtx expand_builtin_interclass_mathfn (tree, rtx);
121 : : static rtx expand_builtin_sincos (tree);
122 : : static rtx expand_builtin_fegetround (tree, rtx, machine_mode);
123 : : static rtx expand_builtin_feclear_feraise_except (tree, rtx, machine_mode,
124 : : optab);
125 : : static rtx expand_builtin_cexpi (tree, rtx);
126 : : static rtx expand_builtin_issignaling (tree, rtx);
127 : : static rtx expand_builtin_int_roundingfn (tree, rtx);
128 : : static rtx expand_builtin_int_roundingfn_2 (tree, rtx);
129 : : static rtx expand_builtin_next_arg (void);
130 : : static rtx expand_builtin_va_start (tree);
131 : : static rtx expand_builtin_va_end (tree);
132 : : static rtx expand_builtin_va_copy (tree);
133 : : static rtx inline_expand_builtin_bytecmp (tree, rtx);
134 : : static rtx expand_builtin_strcmp (tree, rtx);
135 : : static rtx expand_builtin_strncmp (tree, rtx, machine_mode);
136 : : static rtx expand_builtin_memcpy (tree, rtx);
137 : : static rtx expand_builtin_memory_copy_args (tree dest, tree src, tree len,
138 : : rtx target, tree exp,
139 : : memop_ret retmode,
140 : : bool might_overlap);
141 : : static rtx expand_builtin_memmove (tree, rtx);
142 : : static rtx expand_builtin_mempcpy (tree, rtx);
143 : : static rtx expand_builtin_mempcpy_args (tree, tree, tree, rtx, tree, memop_ret);
144 : : static rtx expand_builtin_strcpy (tree, rtx);
145 : : static rtx expand_builtin_strcpy_args (tree, tree, tree, rtx);
146 : : static rtx expand_builtin_stpcpy (tree, rtx, machine_mode);
147 : : static rtx expand_builtin_strncpy (tree, rtx);
148 : : static rtx expand_builtin_memset_args (tree, tree, tree, rtx, machine_mode, tree);
149 : : static rtx expand_builtin_bzero (tree);
150 : : static rtx expand_builtin_strlen (tree, rtx, machine_mode);
151 : : static rtx expand_builtin_strnlen (tree, rtx, machine_mode);
152 : : static rtx expand_builtin_alloca (tree);
153 : : static rtx expand_builtin_unop (machine_mode, tree, rtx, rtx, optab);
154 : : static rtx expand_builtin_frame_address (tree, tree);
155 : : static rtx expand_builtin_stack_address ();
156 : : static tree stabilize_va_list_loc (location_t, tree, int);
157 : : static rtx expand_builtin_expect (tree, rtx);
158 : : static rtx expand_builtin_expect_with_probability (tree, rtx);
159 : : static tree fold_builtin_classify_type (tree);
160 : : static tree fold_builtin_strlen (location_t, tree, tree, tree);
161 : : static tree fold_builtin_inf (location_t, tree, int);
162 : : static tree rewrite_call_expr (location_t, tree, int, tree, int, ...);
163 : : static bool validate_arg (const_tree, enum tree_code code);
164 : : static rtx expand_builtin_fabs (tree, rtx, rtx);
165 : : static rtx expand_builtin_signbit (tree, rtx);
166 : : static tree fold_builtin_memcmp (location_t, 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_iseqsig (location_t, tree, tree);
175 : : static tree fold_builtin_varargs (location_t, tree, tree*, int);
176 : :
177 : : static tree fold_builtin_strpbrk (location_t, tree, tree, tree, tree);
178 : : static tree fold_builtin_strspn (location_t, tree, tree, tree, tree);
179 : : static tree fold_builtin_strcspn (location_t, tree, tree, tree, tree);
180 : :
181 : : static rtx expand_builtin_object_size (tree);
182 : : static rtx expand_builtin_memory_chk (tree, rtx, machine_mode,
183 : : enum built_in_function);
184 : : static void maybe_emit_chk_warning (tree, enum built_in_function);
185 : : static void maybe_emit_sprintf_chk_warning (tree, enum built_in_function);
186 : : static tree fold_builtin_object_size (tree, tree, enum built_in_function);
187 : :
188 : : unsigned HOST_WIDE_INT target_newline;
189 : : unsigned HOST_WIDE_INT target_percent;
190 : : static unsigned HOST_WIDE_INT target_c;
191 : : static unsigned HOST_WIDE_INT target_s;
192 : : char target_percent_c[3];
193 : : char target_percent_s[3];
194 : : char target_percent_s_newline[4];
195 : : static tree do_mpfr_remquo (tree, tree, tree);
196 : : static tree do_mpfr_lgamma_r (tree, tree, tree);
197 : : static void expand_builtin_sync_synchronize (void);
198 : :
199 : : /* Return true if NAME starts with __builtin_ or __sync_. */
200 : :
201 : : static bool
202 : 528880 : is_builtin_name (const char *name)
203 : : {
204 : 528880 : return (startswith (name, "__builtin_")
205 : 190115 : || startswith (name, "__sync_")
206 : 718133 : || startswith (name, "__atomic_"));
207 : : }
208 : :
209 : : /* Return true if NODE should be considered for inline expansion regardless
210 : : of the optimization level. This means whenever a function is invoked with
211 : : its "internal" name, which normally contains the prefix "__builtin". */
212 : :
213 : : bool
214 : 528880 : called_as_built_in (tree node)
215 : : {
216 : : /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
217 : : we want the name used to call the function, not the name it
218 : : will have. */
219 : 528880 : const char *name = IDENTIFIER_POINTER (DECL_NAME (node));
220 : 528880 : return is_builtin_name (name);
221 : : }
222 : :
223 : : /* Compute values M and N such that M divides (address of EXP - N) and such
224 : : that N < M. If these numbers can be determined, store M in alignp and N in
225 : : *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
226 : : *alignp and any bit-offset to *bitposp.
227 : :
228 : : Note that the address (and thus the alignment) computed here is based
229 : : on the address to which a symbol resolves, whereas DECL_ALIGN is based
230 : : on the address at which an object is actually located. These two
231 : : addresses are not always the same. For example, on ARM targets,
232 : : the address &foo of a Thumb function foo() has the lowest bit set,
233 : : whereas foo() itself starts on an even address.
234 : :
235 : : If ADDR_P is true we are taking the address of the memory reference EXP
236 : : and thus cannot rely on the access taking place. */
237 : :
238 : : bool
239 : 108975303 : get_object_alignment_2 (tree exp, unsigned int *alignp,
240 : : unsigned HOST_WIDE_INT *bitposp, bool addr_p)
241 : : {
242 : 108975303 : poly_int64 bitsize, bitpos;
243 : 108975303 : tree offset;
244 : 108975303 : machine_mode mode;
245 : 108975303 : int unsignedp, reversep, volatilep;
246 : 108975303 : unsigned int align = BITS_PER_UNIT;
247 : 108975303 : bool known_alignment = false;
248 : :
249 : : /* Get the innermost object and the constant (bitpos) and possibly
250 : : variable (offset) offset of the access. */
251 : 108975303 : exp = get_inner_reference (exp, &bitsize, &bitpos, &offset, &mode,
252 : : &unsignedp, &reversep, &volatilep);
253 : :
254 : : /* Extract alignment information from the innermost object and
255 : : possibly adjust bitpos and offset. */
256 : 108975303 : if (TREE_CODE (exp) == FUNCTION_DECL)
257 : : {
258 : : /* Function addresses can encode extra information besides their
259 : : alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
260 : : allows the low bit to be used as a virtual bit, we know
261 : : that the address itself must be at least 2-byte aligned. */
262 : : if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn)
263 : : align = 2 * BITS_PER_UNIT;
264 : : }
265 : 108559016 : else if (TREE_CODE (exp) == LABEL_DECL)
266 : : ;
267 : 108522055 : else if (TREE_CODE (exp) == CONST_DECL)
268 : : {
269 : : /* The alignment of a CONST_DECL is determined by its initializer. */
270 : 58576 : exp = DECL_INITIAL (exp);
271 : 58576 : align = TYPE_ALIGN (TREE_TYPE (exp));
272 : 58576 : if (CONSTANT_CLASS_P (exp))
273 : 58553 : align = targetm.constant_alignment (exp, align);
274 : :
275 : : known_alignment = true;
276 : : }
277 : 108463479 : else if (DECL_P (exp))
278 : : {
279 : 66168766 : align = DECL_ALIGN (exp);
280 : : known_alignment = true;
281 : : }
282 : 42294713 : else if (TREE_CODE (exp) == INDIRECT_REF
283 : 42283143 : || TREE_CODE (exp) == MEM_REF
284 : 5240296 : || TREE_CODE (exp) == TARGET_MEM_REF)
285 : : {
286 : 40646685 : tree addr = TREE_OPERAND (exp, 0);
287 : 40646685 : unsigned ptr_align;
288 : 40646685 : unsigned HOST_WIDE_INT ptr_bitpos;
289 : 40646685 : unsigned HOST_WIDE_INT ptr_bitmask = ~0;
290 : :
291 : : /* If the address is explicitely aligned, handle that. */
292 : 40646685 : if (TREE_CODE (addr) == BIT_AND_EXPR
293 : 40646685 : && TREE_CODE (TREE_OPERAND (addr, 1)) == INTEGER_CST)
294 : : {
295 : 76 : ptr_bitmask = TREE_INT_CST_LOW (TREE_OPERAND (addr, 1));
296 : 76 : ptr_bitmask *= BITS_PER_UNIT;
297 : 76 : align = least_bit_hwi (ptr_bitmask);
298 : 76 : addr = TREE_OPERAND (addr, 0);
299 : : }
300 : :
301 : 40646685 : known_alignment
302 : 40646685 : = get_pointer_alignment_1 (addr, &ptr_align, &ptr_bitpos);
303 : 40646685 : align = MAX (ptr_align, align);
304 : :
305 : : /* Re-apply explicit alignment to the bitpos. */
306 : 40646685 : ptr_bitpos &= ptr_bitmask;
307 : :
308 : : /* The alignment of the pointer operand in a TARGET_MEM_REF
309 : : has to take the variable offset parts into account. */
310 : 40646685 : if (TREE_CODE (exp) == TARGET_MEM_REF)
311 : : {
312 : 3592268 : if (TMR_INDEX (exp))
313 : : {
314 : 1644837 : unsigned HOST_WIDE_INT step = 1;
315 : 1644837 : if (TMR_STEP (exp))
316 : 1499689 : step = TREE_INT_CST_LOW (TMR_STEP (exp));
317 : 1644837 : align = MIN (align, least_bit_hwi (step) * BITS_PER_UNIT);
318 : : }
319 : 3592268 : if (TMR_INDEX2 (exp))
320 : 42183 : align = BITS_PER_UNIT;
321 : : known_alignment = false;
322 : : }
323 : :
324 : : /* When EXP is an actual memory reference then we can use
325 : : TYPE_ALIGN of a pointer indirection to derive alignment.
326 : : Do so only if get_pointer_alignment_1 did not reveal absolute
327 : : alignment knowledge and if using that alignment would
328 : : improve the situation. */
329 : 40646685 : unsigned int talign;
330 : 40646685 : if (!addr_p && !known_alignment
331 : 38260816 : && (talign = min_align_of_type (TREE_TYPE (exp)) * BITS_PER_UNIT)
332 : 78907495 : && talign > align)
333 : : align = talign;
334 : : else
335 : : {
336 : : /* Else adjust bitpos accordingly. */
337 : 10870818 : bitpos += ptr_bitpos;
338 : 10870818 : if (TREE_CODE (exp) == MEM_REF
339 : 10870818 : || TREE_CODE (exp) == TARGET_MEM_REF)
340 : 10862053 : bitpos += mem_ref_offset (exp).force_shwi () * BITS_PER_UNIT;
341 : : }
342 : 40646685 : }
343 : 1648028 : else if (TREE_CODE (exp) == STRING_CST)
344 : : {
345 : : /* STRING_CST are the only constant objects we allow to be not
346 : : wrapped inside a CONST_DECL. */
347 : 1647526 : align = TYPE_ALIGN (TREE_TYPE (exp));
348 : 1647526 : if (CONSTANT_CLASS_P (exp))
349 : 1647526 : align = targetm.constant_alignment (exp, align);
350 : :
351 : : known_alignment = true;
352 : : }
353 : :
354 : : /* If there is a non-constant offset part extract the maximum
355 : : alignment that can prevail. */
356 : 108975303 : if (offset)
357 : : {
358 : 9781462 : unsigned int trailing_zeros = tree_ctz (offset);
359 : 9781462 : if (trailing_zeros < HOST_BITS_PER_INT)
360 : : {
361 : 9781406 : unsigned int inner = (1U << trailing_zeros) * BITS_PER_UNIT;
362 : 9781406 : if (inner)
363 : 9781406 : align = MIN (align, inner);
364 : : }
365 : : }
366 : :
367 : : /* Account for the alignment of runtime coefficients, so that the constant
368 : : bitpos is guaranteed to be accurate. */
369 : 108975303 : unsigned int alt_align = ::known_alignment (bitpos - bitpos.coeffs[0]);
370 : 108975303 : if (alt_align != 0 && alt_align < align)
371 : : {
372 : : align = alt_align;
373 : : known_alignment = false;
374 : : }
375 : :
376 : 108975303 : *alignp = align;
377 : 108975303 : *bitposp = bitpos.coeffs[0] & (align - 1);
378 : 108975303 : return known_alignment;
379 : : }
380 : :
381 : : /* For a memory reference expression EXP compute values M and N such that M
382 : : divides (&EXP - N) and such that N < M. If these numbers can be determined,
383 : : store M in alignp and N in *BITPOSP and return true. Otherwise return false
384 : : and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
385 : :
386 : : bool
387 : 86116707 : get_object_alignment_1 (tree exp, unsigned int *alignp,
388 : : unsigned HOST_WIDE_INT *bitposp)
389 : : {
390 : : /* Strip a WITH_SIZE_EXPR, get_inner_reference doesn't know how to deal
391 : : with it. */
392 : 86116707 : if (TREE_CODE (exp) == WITH_SIZE_EXPR)
393 : 0 : exp = TREE_OPERAND (exp, 0);
394 : 86116707 : return get_object_alignment_2 (exp, alignp, bitposp, false);
395 : : }
396 : :
397 : : /* Return the alignment in bits of EXP, an object. */
398 : :
399 : : unsigned int
400 : 35464764 : get_object_alignment (tree exp)
401 : : {
402 : 35464764 : unsigned HOST_WIDE_INT bitpos = 0;
403 : 35464764 : unsigned int align;
404 : :
405 : 35464764 : get_object_alignment_1 (exp, &align, &bitpos);
406 : :
407 : : /* align and bitpos now specify known low bits of the pointer.
408 : : ptr & (align - 1) == bitpos. */
409 : :
410 : 35464764 : if (bitpos != 0)
411 : 2769333 : align = least_bit_hwi (bitpos);
412 : 35464764 : return align;
413 : : }
414 : :
415 : : /* For a pointer valued expression EXP compute values M and N such that M
416 : : divides (EXP - N) and such that N < M. If these numbers can be determined,
417 : : store M in alignp and N in *BITPOSP and return true. Return false if
418 : : the results are just a conservative approximation.
419 : :
420 : : If EXP is not a pointer, false is returned too. */
421 : :
422 : : bool
423 : 81386383 : get_pointer_alignment_1 (tree exp, unsigned int *alignp,
424 : : unsigned HOST_WIDE_INT *bitposp)
425 : : {
426 : 81386383 : STRIP_NOPS (exp);
427 : :
428 : 81386383 : if (TREE_CODE (exp) == ADDR_EXPR)
429 : 22857076 : return get_object_alignment_2 (TREE_OPERAND (exp, 0),
430 : 22857076 : alignp, bitposp, true);
431 : 58529307 : else if (TREE_CODE (exp) == POINTER_PLUS_EXPR)
432 : : {
433 : 948258 : unsigned int align;
434 : 948258 : unsigned HOST_WIDE_INT bitpos;
435 : 948258 : bool res = get_pointer_alignment_1 (TREE_OPERAND (exp, 0),
436 : : &align, &bitpos);
437 : 948258 : if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
438 : 2734 : bitpos += TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)) * BITS_PER_UNIT;
439 : : else
440 : : {
441 : 945524 : unsigned int trailing_zeros = tree_ctz (TREE_OPERAND (exp, 1));
442 : 945524 : if (trailing_zeros < HOST_BITS_PER_INT)
443 : : {
444 : 945518 : unsigned int inner = (1U << trailing_zeros) * BITS_PER_UNIT;
445 : 945518 : if (inner)
446 : 945518 : align = MIN (align, inner);
447 : : }
448 : : }
449 : 948258 : *alignp = align;
450 : 948258 : *bitposp = bitpos & (align - 1);
451 : 948258 : return res;
452 : : }
453 : 57581049 : else if (TREE_CODE (exp) == SSA_NAME
454 : 57581049 : && POINTER_TYPE_P (TREE_TYPE (exp)))
455 : : {
456 : 55565013 : unsigned int ptr_align, ptr_misalign;
457 : 55565013 : struct ptr_info_def *pi = SSA_NAME_PTR_INFO (exp);
458 : :
459 : 55565013 : if (pi && get_ptr_info_alignment (pi, &ptr_align, &ptr_misalign))
460 : : {
461 : 5777724 : *bitposp = ptr_misalign * BITS_PER_UNIT;
462 : 5777724 : *alignp = ptr_align * BITS_PER_UNIT;
463 : : /* Make sure to return a sensible alignment when the multiplication
464 : : by BITS_PER_UNIT overflowed. */
465 : 5777724 : if (*alignp == 0)
466 : 30 : *alignp = 1u << (HOST_BITS_PER_INT - 1);
467 : : /* We cannot really tell whether this result is an approximation. */
468 : 5777724 : return false;
469 : : }
470 : : else
471 : : {
472 : 49787289 : *bitposp = 0;
473 : 49787289 : *alignp = BITS_PER_UNIT;
474 : 49787289 : return false;
475 : : }
476 : : }
477 : 2016036 : else if (TREE_CODE (exp) == INTEGER_CST)
478 : : {
479 : 16729 : *alignp = BIGGEST_ALIGNMENT;
480 : 16729 : *bitposp = ((TREE_INT_CST_LOW (exp) * BITS_PER_UNIT)
481 : 16729 : & (BIGGEST_ALIGNMENT - 1));
482 : 16729 : return true;
483 : : }
484 : :
485 : 1999307 : *bitposp = 0;
486 : 1999307 : *alignp = BITS_PER_UNIT;
487 : 1999307 : return false;
488 : : }
489 : :
490 : : /* Return the alignment in bits of EXP, a pointer valued expression.
491 : : The alignment returned is, by default, the alignment of the thing that
492 : : EXP points to. If it is not a POINTER_TYPE, 0 is returned.
493 : :
494 : : Otherwise, look at the expression to see if we can do better, i.e., if the
495 : : expression is actually pointing at an object whose alignment is tighter. */
496 : :
497 : : unsigned int
498 : 11007304 : get_pointer_alignment (tree exp)
499 : : {
500 : 11007304 : unsigned HOST_WIDE_INT bitpos = 0;
501 : 11007304 : unsigned int align;
502 : :
503 : 11007304 : get_pointer_alignment_1 (exp, &align, &bitpos);
504 : :
505 : : /* align and bitpos now specify known low bits of the pointer.
506 : : ptr & (align - 1) == bitpos. */
507 : :
508 : 11007304 : if (bitpos != 0)
509 : 94009 : align = least_bit_hwi (bitpos);
510 : :
511 : 11007304 : return align;
512 : : }
513 : :
514 : : /* Return the number of leading non-zero elements in the sequence
515 : : [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
516 : : ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
517 : :
518 : : unsigned
519 : 761740 : string_length (const void *ptr, unsigned eltsize, unsigned maxelts)
520 : : {
521 : 761740 : gcc_checking_assert (eltsize == 1 || eltsize == 2 || eltsize == 4);
522 : :
523 : 761740 : unsigned n;
524 : :
525 : 761740 : if (eltsize == 1)
526 : : {
527 : : /* Optimize the common case of plain char. */
528 : 244813223 : for (n = 0; n < maxelts; n++)
529 : : {
530 : 244730125 : const char *elt = (const char*) ptr + n;
531 : 244730125 : if (!*elt)
532 : : break;
533 : : }
534 : : }
535 : : else
536 : : {
537 : 590 : for (n = 0; n < maxelts; n++)
538 : : {
539 : 566 : const char *elt = (const char*) ptr + n * eltsize;
540 : 566 : if (!memcmp (elt, "\0\0\0\0", eltsize))
541 : : break;
542 : : }
543 : : }
544 : 761740 : return n;
545 : : }
546 : :
547 : : /* Compute the length of a null-terminated character string or wide
548 : : character string handling character sizes of 1, 2, and 4 bytes.
549 : : TREE_STRING_LENGTH is not the right way because it evaluates to
550 : : the size of the character array in bytes (as opposed to characters)
551 : : and because it can contain a zero byte in the middle.
552 : :
553 : : ONLY_VALUE should be nonzero if the result is not going to be emitted
554 : : into the instruction stream and zero if it is going to be expanded.
555 : : E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
556 : : is returned, otherwise NULL, since
557 : : len = c_strlen (ARG, 1); if (len) expand_expr (len, ...); would not
558 : : evaluate the side-effects.
559 : :
560 : : If ONLY_VALUE is two then we do not emit warnings about out-of-bound
561 : : accesses. Note that this implies the result is not going to be emitted
562 : : into the instruction stream.
563 : :
564 : : Additional information about the string accessed may be recorded
565 : : in DATA. For example, if ARG references an unterminated string,
566 : : then the declaration will be stored in the DECL field. If the
567 : : length of the unterminated string can be determined, it'll be
568 : : stored in the LEN field. Note this length could well be different
569 : : than what a C strlen call would return.
570 : :
571 : : ELTSIZE is 1 for normal single byte character strings, and 2 or
572 : : 4 for wide characer strings. ELTSIZE is by default 1.
573 : :
574 : : The value returned is of type `ssizetype'. */
575 : :
576 : : tree
577 : 2455644 : c_strlen (tree arg, int only_value, c_strlen_data *data, unsigned eltsize)
578 : : {
579 : : /* If we were not passed a DATA pointer, then get one to a local
580 : : structure. That avoids having to check DATA for NULL before
581 : : each time we want to use it. */
582 : 2455644 : c_strlen_data local_strlen_data = { };
583 : 2455644 : if (!data)
584 : 571856 : data = &local_strlen_data;
585 : :
586 : 2455644 : gcc_checking_assert (eltsize == 1 || eltsize == 2 || eltsize == 4);
587 : :
588 : 2455644 : tree src = STRIP_NOPS (arg);
589 : 2455644 : if (TREE_CODE (src) == COND_EXPR
590 : 2455644 : && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
591 : : {
592 : 687 : tree len1, len2;
593 : :
594 : 687 : len1 = c_strlen (TREE_OPERAND (src, 1), only_value, data, eltsize);
595 : 687 : len2 = c_strlen (TREE_OPERAND (src, 2), only_value, data, eltsize);
596 : 687 : if (tree_int_cst_equal (len1, len2))
597 : : return len1;
598 : : }
599 : :
600 : 2455478 : if (TREE_CODE (src) == COMPOUND_EXPR
601 : 2455478 : && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
602 : 45 : return c_strlen (TREE_OPERAND (src, 1), only_value, data, eltsize);
603 : :
604 : 2455433 : location_t loc = EXPR_LOC_OR_LOC (src, input_location);
605 : :
606 : : /* Offset from the beginning of the string in bytes. */
607 : 2455433 : tree byteoff;
608 : 2455433 : tree memsize;
609 : 2455433 : tree decl;
610 : 2455433 : src = string_constant (src, &byteoff, &memsize, &decl);
611 : 2455433 : if (src == 0)
612 : : return NULL_TREE;
613 : :
614 : : /* Determine the size of the string element. */
615 : 775348 : if (eltsize != tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (src)))))
616 : : return NULL_TREE;
617 : :
618 : : /* Set MAXELTS to ARRAY_SIZE (SRC) - 1, the maximum possible
619 : : length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
620 : : in case the latter is less than the size of the array, such as when
621 : : SRC refers to a short string literal used to initialize a large array.
622 : : In that case, the elements of the array after the terminating NUL are
623 : : all NUL. */
624 : 765426 : HOST_WIDE_INT strelts = TREE_STRING_LENGTH (src);
625 : 765426 : strelts = strelts / eltsize;
626 : :
627 : 765426 : if (!tree_fits_uhwi_p (memsize))
628 : : return NULL_TREE;
629 : :
630 : 765426 : HOST_WIDE_INT maxelts = tree_to_uhwi (memsize) / eltsize;
631 : :
632 : : /* PTR can point to the byte representation of any string type, including
633 : : char* and wchar_t*. */
634 : 765426 : const char *ptr = TREE_STRING_POINTER (src);
635 : :
636 : 765426 : if (byteoff && TREE_CODE (byteoff) != INTEGER_CST)
637 : : {
638 : : /* The code below works only for single byte character types. */
639 : 5258 : if (eltsize != 1)
640 : : return NULL_TREE;
641 : :
642 : : /* If the string has an internal NUL character followed by any
643 : : non-NUL characters (e.g., "foo\0bar"), we can't compute
644 : : the offset to the following NUL if we don't know where to
645 : : start searching for it. */
646 : 5258 : unsigned len = string_length (ptr, eltsize, strelts);
647 : :
648 : : /* Return when an embedded null character is found or none at all.
649 : : In the latter case, set the DECL/LEN field in the DATA structure
650 : : so that callers may examine them. */
651 : 5258 : if (len + 1 < strelts)
652 : : return NULL_TREE;
653 : 4688 : else if (len >= maxelts)
654 : : {
655 : 1102 : data->decl = decl;
656 : 1102 : data->off = byteoff;
657 : 1102 : data->minlen = ssize_int (len);
658 : 1102 : return NULL_TREE;
659 : : }
660 : :
661 : : /* For empty strings the result should be zero. */
662 : 3586 : if (len == 0)
663 : 39 : return ssize_int (0);
664 : :
665 : : /* We don't know the starting offset, but we do know that the string
666 : : has no internal zero bytes. If the offset falls within the bounds
667 : : of the string subtract the offset from the length of the string,
668 : : and return that. Otherwise the length is zero. Take care to
669 : : use SAVE_EXPR in case the OFFSET has side-effects. */
670 : 3547 : tree offsave = TREE_SIDE_EFFECTS (byteoff) ? save_expr (byteoff)
671 : : : byteoff;
672 : 3547 : offsave = fold_convert_loc (loc, sizetype, offsave);
673 : 3547 : tree condexp = fold_build2_loc (loc, LE_EXPR, boolean_type_node, offsave,
674 : 3547 : size_int (len));
675 : 3547 : tree lenexp = fold_build2_loc (loc, MINUS_EXPR, sizetype, size_int (len),
676 : : offsave);
677 : 3547 : lenexp = fold_convert_loc (loc, ssizetype, lenexp);
678 : 3547 : return fold_build3_loc (loc, COND_EXPR, ssizetype, condexp, lenexp,
679 : 3547 : build_zero_cst (ssizetype));
680 : : }
681 : :
682 : : /* Offset from the beginning of the string in elements. */
683 : 760168 : HOST_WIDE_INT eltoff;
684 : :
685 : : /* We have a known offset into the string. Start searching there for
686 : : a null character if we can represent it as a single HOST_WIDE_INT. */
687 : 760168 : if (byteoff == 0)
688 : : eltoff = 0;
689 : 760168 : else if (! tree_fits_uhwi_p (byteoff) || tree_to_uhwi (byteoff) % eltsize)
690 : : eltoff = -1;
691 : : else
692 : 758980 : eltoff = tree_to_uhwi (byteoff) / eltsize;
693 : :
694 : : /* If the offset is known to be out of bounds, warn, and call strlen at
695 : : runtime. */
696 : 760168 : if (eltoff < 0 || eltoff >= maxelts)
697 : : {
698 : : /* Suppress multiple warnings for propagated constant strings. */
699 : 3686 : if (only_value != 2
700 : 3686 : && !warning_suppressed_p (arg, OPT_Warray_bounds_)
701 : 7372 : && warning_at (loc, OPT_Warray_bounds_,
702 : : "offset %qwi outside bounds of constant string",
703 : : eltoff))
704 : : {
705 : 679 : if (decl)
706 : 678 : inform (DECL_SOURCE_LOCATION (decl), "%qE declared here", decl);
707 : 679 : suppress_warning (arg, OPT_Warray_bounds_);
708 : : }
709 : 3686 : return NULL_TREE;
710 : : }
711 : :
712 : : /* If eltoff is larger than strelts but less than maxelts the
713 : : string length is zero, since the excess memory will be zero. */
714 : 756482 : if (eltoff > strelts)
715 : 0 : return ssize_int (0);
716 : :
717 : : /* Use strlen to search for the first zero byte. Since any strings
718 : : constructed with build_string will have nulls appended, we win even
719 : : if we get handed something like (char[4])"abcd".
720 : :
721 : : Since ELTOFF is our starting index into the string, no further
722 : : calculation is needed. */
723 : 756482 : unsigned len = string_length (ptr + eltoff * eltsize, eltsize,
724 : 756482 : strelts - eltoff);
725 : :
726 : : /* Don't know what to return if there was no zero termination.
727 : : Ideally this would turn into a gcc_checking_assert over time.
728 : : Set DECL/LEN so callers can examine them. */
729 : 756482 : if (len >= maxelts - eltoff)
730 : : {
731 : 77650 : data->decl = decl;
732 : 77650 : data->off = byteoff;
733 : 77650 : data->minlen = ssize_int (len);
734 : 77650 : return NULL_TREE;
735 : : }
736 : :
737 : 678832 : return ssize_int (len);
738 : : }
739 : :
740 : : /* Return a constant integer corresponding to target reading
741 : : GET_MODE_BITSIZE (MODE) bits from string constant STR. If
742 : : NULL_TERMINATED_P, reading stops after '\0' character, all further ones
743 : : are assumed to be zero, otherwise it reads as many characters
744 : : as needed. */
745 : :
746 : : rtx
747 : 294883 : c_readstr (const char *str, fixed_size_mode mode,
748 : : bool null_terminated_p/*=true*/)
749 : : {
750 : 294883 : auto_vec<target_unit, MAX_BITSIZE_MODE_ANY_INT / BITS_PER_UNIT> bytes;
751 : :
752 : 589766 : bytes.reserve (GET_MODE_SIZE (mode));
753 : :
754 : 294883 : target_unit ch = 1;
755 : 5113540 : for (unsigned int i = 0; i < GET_MODE_SIZE (mode); ++i)
756 : : {
757 : 2261887 : if (ch || !null_terminated_p)
758 : 2145800 : ch = (unsigned char) str[i];
759 : 2261887 : bytes.quick_push (ch);
760 : : }
761 : :
762 : 294883 : return native_decode_rtx (mode, bytes, 0);
763 : 294883 : }
764 : :
765 : : /* Cast a target constant CST to target CHAR and if that value fits into
766 : : host char type, return zero and put that value into variable pointed to by
767 : : P. */
768 : :
769 : : static int
770 : 62760 : target_char_cast (tree cst, char *p)
771 : : {
772 : 62760 : unsigned HOST_WIDE_INT val, hostval;
773 : :
774 : 62760 : if (TREE_CODE (cst) != INTEGER_CST
775 : : || CHAR_TYPE_SIZE > HOST_BITS_PER_WIDE_INT)
776 : : return 1;
777 : :
778 : : /* Do not care if it fits or not right here. */
779 : 62760 : val = TREE_INT_CST_LOW (cst);
780 : :
781 : 62760 : if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT)
782 : 62760 : val &= (HOST_WIDE_INT_1U << CHAR_TYPE_SIZE) - 1;
783 : :
784 : 62760 : hostval = val;
785 : 62760 : if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT)
786 : 62760 : hostval &= (HOST_WIDE_INT_1U << HOST_BITS_PER_CHAR) - 1;
787 : :
788 : 62760 : if (val != hostval)
789 : : return 1;
790 : :
791 : 62760 : *p = hostval;
792 : 62760 : return 0;
793 : : }
794 : :
795 : : /* Similar to save_expr, but assumes that arbitrary code is not executed
796 : : in between the multiple evaluations. In particular, we assume that a
797 : : non-addressable local variable will not be modified. */
798 : :
799 : : static tree
800 : 1208378 : builtin_save_expr (tree exp)
801 : : {
802 : 1208378 : if (TREE_CODE (exp) == SSA_NAME
803 : 1043274 : || (TREE_ADDRESSABLE (exp) == 0
804 : 1043082 : && (TREE_CODE (exp) == PARM_DECL
805 : 457875 : || (VAR_P (exp) && !TREE_STATIC (exp)))))
806 : : return exp;
807 : :
808 : 456085 : return save_expr (exp);
809 : : }
810 : :
811 : : /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
812 : : times to get the address of either a higher stack frame, or a return
813 : : address located within it (depending on FNDECL_CODE). */
814 : :
815 : : static rtx
816 : 15583 : expand_builtin_return_addr (enum built_in_function fndecl_code, int count)
817 : : {
818 : 15583 : int i;
819 : 15583 : rtx tem = INITIAL_FRAME_ADDRESS_RTX;
820 : 15583 : if (tem == NULL_RTX)
821 : : {
822 : : /* For a zero count with __builtin_return_address, we don't care what
823 : : frame address we return, because target-specific definitions will
824 : : override us. Therefore frame pointer elimination is OK, and using
825 : : the soft frame pointer is OK.
826 : :
827 : : For a nonzero count, or a zero count with __builtin_frame_address,
828 : : we require a stable offset from the current frame pointer to the
829 : : previous one, so we must use the hard frame pointer, and
830 : : we must disable frame pointer elimination. */
831 : 15583 : if (count == 0 && fndecl_code == BUILT_IN_RETURN_ADDRESS)
832 : 4246 : tem = frame_pointer_rtx;
833 : : else
834 : : {
835 : 11337 : tem = hard_frame_pointer_rtx;
836 : :
837 : : /* Tell reload not to eliminate the frame pointer. */
838 : 11337 : crtl->accesses_prior_frames = 1;
839 : : }
840 : : }
841 : :
842 : 15583 : if (count > 0)
843 : 932 : SETUP_FRAME_ADDRESSES ();
844 : :
845 : : /* On the SPARC, the return address is not in the frame, it is in a
846 : : register. There is no way to access it off of the current frame
847 : : pointer, but it can be accessed off the previous frame pointer by
848 : : reading the value from the register window save area. */
849 : : if (RETURN_ADDR_IN_PREVIOUS_FRAME && fndecl_code == BUILT_IN_RETURN_ADDRESS)
850 : : count--;
851 : :
852 : : /* Scan back COUNT frames to the specified frame. */
853 : 51459 : for (i = 0; i < count; i++)
854 : : {
855 : : /* Assume the dynamic chain pointer is in the word that the
856 : : frame address points to, unless otherwise specified. */
857 : 35876 : tem = DYNAMIC_CHAIN_ADDRESS (tem);
858 : 35876 : tem = memory_address (Pmode, tem);
859 : 35876 : tem = gen_frame_mem (Pmode, tem);
860 : 35876 : tem = copy_to_reg (tem);
861 : : }
862 : :
863 : : /* For __builtin_frame_address, return what we've got. But, on
864 : : the SPARC for example, we may have to add a bias. */
865 : 15583 : if (fndecl_code == BUILT_IN_FRAME_ADDRESS)
866 : : return FRAME_ADDR_RTX (tem);
867 : :
868 : : /* For __builtin_return_address, get the return address from that frame. */
869 : : #ifdef RETURN_ADDR_RTX
870 : 7297 : tem = RETURN_ADDR_RTX (count, tem);
871 : : #else
872 : : tem = memory_address (Pmode,
873 : : plus_constant (Pmode, tem, GET_MODE_SIZE (Pmode)));
874 : : tem = gen_frame_mem (Pmode, tem);
875 : : #endif
876 : 5086 : return tem;
877 : : }
878 : :
879 : : /* Alias set used for setjmp buffer. */
880 : : static alias_set_type setjmp_alias_set = -1;
881 : :
882 : : /* Construct the leading half of a __builtin_setjmp call. Control will
883 : : return to RECEIVER_LABEL. This is also called directly by the SJLJ
884 : : exception handling code. */
885 : :
886 : : void
887 : 841 : expand_builtin_setjmp_setup (rtx buf_addr, rtx receiver_label)
888 : : {
889 : 841 : machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
890 : 841 : rtx stack_save;
891 : 841 : rtx mem;
892 : :
893 : 841 : if (setjmp_alias_set == -1)
894 : 241 : setjmp_alias_set = new_alias_set ();
895 : :
896 : 841 : buf_addr = convert_memory_address (Pmode, buf_addr);
897 : :
898 : 842 : buf_addr = force_reg (Pmode, force_operand (buf_addr, NULL_RTX));
899 : :
900 : : /* We store the frame pointer and the address of receiver_label in
901 : : the buffer and use the rest of it for the stack save area, which
902 : : is machine-dependent. */
903 : :
904 : 842 : mem = gen_rtx_MEM (Pmode, buf_addr);
905 : 841 : set_mem_alias_set (mem, setjmp_alias_set);
906 : 841 : emit_move_insn (mem, hard_frame_pointer_rtx);
907 : :
908 : 842 : mem = gen_rtx_MEM (Pmode, plus_constant (Pmode, buf_addr,
909 : 1682 : GET_MODE_SIZE (Pmode))),
910 : 841 : set_mem_alias_set (mem, setjmp_alias_set);
911 : :
912 : 1682 : emit_move_insn (validize_mem (mem),
913 : 1682 : force_reg (Pmode, gen_rtx_LABEL_REF (Pmode, receiver_label)));
914 : :
915 : 841 : stack_save = gen_rtx_MEM (sa_mode,
916 : : plus_constant (Pmode, buf_addr,
917 : 1682 : 2 * GET_MODE_SIZE (Pmode)));
918 : 841 : set_mem_alias_set (stack_save, setjmp_alias_set);
919 : 841 : emit_stack_save (SAVE_NONLOCAL, &stack_save);
920 : :
921 : : /* If there is further processing to do, do it. */
922 : 841 : if (targetm.have_builtin_setjmp_setup ())
923 : 0 : emit_insn (targetm.gen_builtin_setjmp_setup (buf_addr));
924 : :
925 : : /* We have a nonlocal label. */
926 : 841 : cfun->has_nonlocal_label = 1;
927 : 841 : }
928 : :
929 : : /* Construct the trailing part of a __builtin_setjmp call. This is
930 : : also called directly by the SJLJ exception handling code.
931 : : If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
932 : :
933 : : void
934 : 1343 : expand_builtin_setjmp_receiver (rtx receiver_label)
935 : : {
936 : 1343 : rtx chain;
937 : :
938 : : /* Mark the FP as used when we get here, so we have to make sure it's
939 : : marked as used by this function. */
940 : 1343 : emit_use (hard_frame_pointer_rtx);
941 : :
942 : : /* Mark the static chain as clobbered here so life information
943 : : doesn't get messed up for it. */
944 : 1343 : chain = rtx_for_static_chain (current_function_decl, true);
945 : 1343 : if (chain && REG_P (chain))
946 : 1 : emit_clobber (chain);
947 : :
948 : 1343 : if (!HARD_FRAME_POINTER_IS_ARG_POINTER && fixed_regs[ARG_POINTER_REGNUM])
949 : : {
950 : : /* If the argument pointer can be eliminated in favor of the
951 : : frame pointer, we don't need to restore it. We assume here
952 : : that if such an elimination is present, it can always be used.
953 : : This is the case on all known machines; if we don't make this
954 : : assumption, we do unnecessary saving on many machines. */
955 : : size_t i;
956 : : static const struct elims {const int from, to;} elim_regs[] = ELIMINABLE_REGS;
957 : :
958 : 2686 : for (i = 0; i < ARRAY_SIZE (elim_regs); i++)
959 : 2686 : if (elim_regs[i].from == ARG_POINTER_REGNUM
960 : 2686 : && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM)
961 : : break;
962 : :
963 : 1343 : if (i == ARRAY_SIZE (elim_regs))
964 : : {
965 : : /* Now restore our arg pointer from the address at which it
966 : : was saved in our stack frame. */
967 : 0 : emit_move_insn (crtl->args.internal_arg_pointer,
968 : : copy_to_reg (get_arg_pointer_save_area ()));
969 : : }
970 : : }
971 : :
972 : 1343 : if (receiver_label != NULL && targetm.have_builtin_setjmp_receiver ())
973 : 0 : emit_insn (targetm.gen_builtin_setjmp_receiver (receiver_label));
974 : 1343 : else if (targetm.have_nonlocal_goto_receiver ())
975 : 0 : emit_insn (targetm.gen_nonlocal_goto_receiver ());
976 : : else
977 : : { /* Nothing */ }
978 : :
979 : : /* We must not allow the code we just generated to be reordered by
980 : : scheduling. Specifically, the update of the frame pointer must
981 : : happen immediately, not later. */
982 : 1343 : emit_insn (gen_blockage ());
983 : 1343 : }
984 : :
985 : : /* __builtin_longjmp is passed a pointer to an array of five words (not
986 : : all will be used on all machines). It operates similarly to the C
987 : : library function of the same name, but is more efficient. Much of
988 : : the code below is copied from the handling of non-local gotos. */
989 : :
990 : : static void
991 : 391 : expand_builtin_longjmp (rtx buf_addr, rtx value)
992 : : {
993 : 391 : rtx fp, lab, stack;
994 : 391 : rtx_insn *insn, *last;
995 : 391 : machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
996 : :
997 : : /* DRAP is needed for stack realign if longjmp is expanded to current
998 : : function */
999 : 391 : if (SUPPORTS_STACK_ALIGNMENT)
1000 : 391 : crtl->need_drap = true;
1001 : :
1002 : 391 : if (setjmp_alias_set == -1)
1003 : 330 : setjmp_alias_set = new_alias_set ();
1004 : :
1005 : 391 : buf_addr = convert_memory_address (Pmode, buf_addr);
1006 : :
1007 : 392 : buf_addr = force_reg (Pmode, buf_addr);
1008 : :
1009 : : /* We require that the user must pass a second argument of 1, because
1010 : : that is what builtin_setjmp will return. */
1011 : 391 : gcc_assert (value == const1_rtx);
1012 : :
1013 : 391 : last = get_last_insn ();
1014 : 391 : if (targetm.have_builtin_longjmp ())
1015 : 0 : emit_insn (targetm.gen_builtin_longjmp (buf_addr));
1016 : : else
1017 : : {
1018 : 392 : fp = gen_rtx_MEM (Pmode, buf_addr);
1019 : 392 : lab = gen_rtx_MEM (Pmode, plus_constant (Pmode, buf_addr,
1020 : 782 : GET_MODE_SIZE (Pmode)));
1021 : :
1022 : 391 : stack = gen_rtx_MEM (sa_mode, plus_constant (Pmode, buf_addr,
1023 : 782 : 2 * GET_MODE_SIZE (Pmode)));
1024 : 391 : set_mem_alias_set (fp, setjmp_alias_set);
1025 : 391 : set_mem_alias_set (lab, setjmp_alias_set);
1026 : 391 : set_mem_alias_set (stack, setjmp_alias_set);
1027 : :
1028 : : /* Pick up FP, label, and SP from the block and jump. This code is
1029 : : from expand_goto in stmt.cc; see there for detailed comments. */
1030 : 391 : if (targetm.have_nonlocal_goto ())
1031 : : /* We have to pass a value to the nonlocal_goto pattern that will
1032 : : get copied into the static_chain pointer, but it does not matter
1033 : : what that value is, because builtin_setjmp does not use it. */
1034 : 0 : emit_insn (targetm.gen_nonlocal_goto (value, lab, stack, fp));
1035 : : else
1036 : : {
1037 : 391 : emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
1038 : 391 : emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
1039 : :
1040 : 391 : lab = copy_to_reg (lab);
1041 : :
1042 : : /* Restore the frame pointer and stack pointer. We must use a
1043 : : temporary since the setjmp buffer may be a local. */
1044 : 391 : fp = copy_to_reg (fp);
1045 : 391 : emit_stack_restore (SAVE_NONLOCAL, stack);
1046 : :
1047 : : /* Ensure the frame pointer move is not optimized. */
1048 : 391 : emit_insn (gen_blockage ());
1049 : 391 : emit_clobber (hard_frame_pointer_rtx);
1050 : 391 : emit_clobber (frame_pointer_rtx);
1051 : 391 : emit_move_insn (hard_frame_pointer_rtx, fp);
1052 : :
1053 : 391 : emit_use (hard_frame_pointer_rtx);
1054 : 391 : emit_use (stack_pointer_rtx);
1055 : 391 : emit_indirect_jump (lab);
1056 : : }
1057 : : }
1058 : :
1059 : : /* Search backwards and mark the jump insn as a non-local goto.
1060 : : Note that this precludes the use of __builtin_longjmp to a
1061 : : __builtin_setjmp target in the same function. However, we've
1062 : : already cautioned the user that these functions are for
1063 : : internal exception handling use only. */
1064 : 782 : for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
1065 : : {
1066 : 782 : gcc_assert (insn != last);
1067 : :
1068 : 782 : if (JUMP_P (insn))
1069 : : {
1070 : 391 : add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
1071 : 391 : break;
1072 : : }
1073 : 391 : else if (CALL_P (insn))
1074 : : break;
1075 : : }
1076 : 391 : }
1077 : :
1078 : : static inline bool
1079 : 2244768 : more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
1080 : : {
1081 : 2244768 : return (iter->i < iter->n);
1082 : : }
1083 : :
1084 : : /* This function validates the types of a function call argument list
1085 : : against a specified list of tree_codes. If the last specifier is a 0,
1086 : : that represents an ellipsis, otherwise the last specifier must be a
1087 : : VOID_TYPE. */
1088 : :
1089 : : static bool
1090 : 485743 : validate_arglist (const_tree callexpr, ...)
1091 : : {
1092 : 485743 : enum tree_code code;
1093 : 485743 : bool res = 0;
1094 : 485743 : va_list ap;
1095 : 485743 : const_call_expr_arg_iterator iter;
1096 : 485743 : const_tree arg;
1097 : :
1098 : 485743 : va_start (ap, callexpr);
1099 : 485743 : init_const_call_expr_arg_iterator (callexpr, &iter);
1100 : :
1101 : : /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1102 : 485743 : tree fn = CALL_EXPR_FN (callexpr);
1103 : 485743 : bitmap argmap = get_nonnull_args (TREE_TYPE (TREE_TYPE (fn)));
1104 : :
1105 : 485743 : for (unsigned argno = 1; ; ++argno)
1106 : : {
1107 : 1686070 : code = (enum tree_code) va_arg (ap, int);
1108 : :
1109 : 1686070 : switch (code)
1110 : : {
1111 : 2037 : case 0:
1112 : : /* This signifies an ellipses, any further arguments are all ok. */
1113 : 2037 : res = true;
1114 : 2037 : goto end;
1115 : 483473 : case VOID_TYPE:
1116 : : /* This signifies an endlink, if no arguments remain, return
1117 : : true, otherwise return false. */
1118 : 483473 : res = !more_const_call_expr_args_p (&iter);
1119 : 483473 : goto end;
1120 : 787904 : case POINTER_TYPE:
1121 : : /* The actual argument must be nonnull when either the whole
1122 : : called function has been declared nonnull, or when the formal
1123 : : argument corresponding to the actual argument has been. */
1124 : 787904 : if (argmap
1125 : 787904 : && (bitmap_empty_p (argmap) || bitmap_bit_p (argmap, argno)))
1126 : : {
1127 : 280627 : arg = next_const_call_expr_arg (&iter);
1128 : 280627 : if (!validate_arg (arg, code) || integer_zerop (arg))
1129 : 59 : goto end;
1130 : : break;
1131 : : }
1132 : : /* FALLTHRU */
1133 : 919933 : default:
1134 : : /* If no parameters remain or the parameter's code does not
1135 : : match the specified code, return false. Otherwise continue
1136 : : checking any remaining arguments. */
1137 : 919933 : arg = next_const_call_expr_arg (&iter);
1138 : 919933 : if (!validate_arg (arg, code))
1139 : 174 : goto end;
1140 : : break;
1141 : : }
1142 : : }
1143 : :
1144 : : /* We need gotos here since we can only have one VA_CLOSE in a
1145 : : function. */
1146 : 485743 : end: ;
1147 : 485743 : va_end (ap);
1148 : :
1149 : 485743 : BITMAP_FREE (argmap);
1150 : :
1151 : 485743 : if (res)
1152 : 485510 : for (tree attrs = TYPE_ATTRIBUTES (TREE_TYPE (TREE_TYPE (fn)));
1153 : 686737 : (attrs = lookup_attribute ("nonnull_if_nonzero", attrs));
1154 : 201227 : attrs = TREE_CHAIN (attrs))
1155 : : {
1156 : 201249 : tree args = TREE_VALUE (attrs);
1157 : 201249 : unsigned int idx = TREE_INT_CST_LOW (TREE_VALUE (args)) - 1;
1158 : 201249 : unsigned int idx2
1159 : 201249 : = TREE_INT_CST_LOW (TREE_VALUE (TREE_CHAIN (args))) - 1;
1160 : 201249 : unsigned int idx3 = idx2;
1161 : 201249 : if (tree chain2 = TREE_CHAIN (TREE_CHAIN (args)))
1162 : 0 : idx3 = TREE_INT_CST_LOW (TREE_VALUE (chain2)) - 1;
1163 : 201249 : if (idx < (unsigned) call_expr_nargs (callexpr)
1164 : 201249 : && idx2 < (unsigned) call_expr_nargs (callexpr)
1165 : 201249 : && idx3 < (unsigned) call_expr_nargs (callexpr)
1166 : 201249 : && POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_ARG (callexpr, idx)))
1167 : 201249 : && integer_zerop (CALL_EXPR_ARG (callexpr, idx))
1168 : 82 : && INTEGRAL_TYPE_P (TREE_TYPE (CALL_EXPR_ARG (callexpr, idx2)))
1169 : 82 : && integer_nonzerop (CALL_EXPR_ARG (callexpr, idx2))
1170 : 22 : && INTEGRAL_TYPE_P (TREE_TYPE (CALL_EXPR_ARG (callexpr, idx3)))
1171 : 201271 : && integer_nonzerop (CALL_EXPR_ARG (callexpr, idx3)))
1172 : : return false;
1173 : : }
1174 : :
1175 : : return res;
1176 : : }
1177 : :
1178 : : /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1179 : : and the address of the save area. */
1180 : :
1181 : : static rtx
1182 : 510 : expand_builtin_nonlocal_goto (tree exp)
1183 : : {
1184 : 510 : tree t_label, t_save_area;
1185 : 510 : rtx r_label, r_save_area, r_fp, r_sp;
1186 : 510 : rtx_insn *insn;
1187 : :
1188 : 510 : if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
1189 : : return NULL_RTX;
1190 : :
1191 : 510 : t_label = CALL_EXPR_ARG (exp, 0);
1192 : 510 : t_save_area = CALL_EXPR_ARG (exp, 1);
1193 : :
1194 : 510 : r_label = expand_normal (t_label);
1195 : 510 : r_label = convert_memory_address (Pmode, r_label);
1196 : 510 : r_save_area = expand_normal (t_save_area);
1197 : 510 : r_save_area = convert_memory_address (Pmode, r_save_area);
1198 : : /* Copy the address of the save location to a register just in case it was
1199 : : based on the frame pointer. */
1200 : 510 : r_save_area = copy_to_reg (r_save_area);
1201 : 510 : r_fp = gen_rtx_MEM (Pmode, r_save_area);
1202 : 510 : r_sp = gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL),
1203 : : plus_constant (Pmode, r_save_area,
1204 : 1020 : GET_MODE_SIZE (Pmode)));
1205 : :
1206 : 510 : crtl->has_nonlocal_goto = 1;
1207 : :
1208 : : /* ??? We no longer need to pass the static chain value, afaik. */
1209 : 510 : if (targetm.have_nonlocal_goto ())
1210 : 0 : emit_insn (targetm.gen_nonlocal_goto (const0_rtx, r_label, r_sp, r_fp));
1211 : : else
1212 : : {
1213 : 510 : emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
1214 : 510 : emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
1215 : :
1216 : 510 : r_label = copy_to_reg (r_label);
1217 : :
1218 : : /* Restore the frame pointer and stack pointer. We must use a
1219 : : temporary since the setjmp buffer may be a local. */
1220 : 510 : r_fp = copy_to_reg (r_fp);
1221 : 510 : emit_stack_restore (SAVE_NONLOCAL, r_sp);
1222 : :
1223 : : /* Ensure the frame pointer move is not optimized. */
1224 : 510 : emit_insn (gen_blockage ());
1225 : 510 : emit_clobber (hard_frame_pointer_rtx);
1226 : 510 : emit_clobber (frame_pointer_rtx);
1227 : 510 : emit_move_insn (hard_frame_pointer_rtx, r_fp);
1228 : :
1229 : : /* USE of hard_frame_pointer_rtx added for consistency;
1230 : : not clear if really needed. */
1231 : 510 : emit_use (hard_frame_pointer_rtx);
1232 : 510 : emit_use (stack_pointer_rtx);
1233 : :
1234 : : /* If the architecture is using a GP register, we must
1235 : : conservatively assume that the target function makes use of it.
1236 : : The prologue of functions with nonlocal gotos must therefore
1237 : : initialize the GP register to the appropriate value, and we
1238 : : must then make sure that this value is live at the point
1239 : : of the jump. (Note that this doesn't necessarily apply
1240 : : to targets with a nonlocal_goto pattern; they are free
1241 : : to implement it in their own way. Note also that this is
1242 : : a no-op if the GP register is a global invariant.) */
1243 : 510 : unsigned regnum = PIC_OFFSET_TABLE_REGNUM;
1244 : 0 : if (regnum != INVALID_REGNUM && fixed_regs[regnum])
1245 : 0 : emit_use (pic_offset_table_rtx);
1246 : :
1247 : 510 : emit_indirect_jump (r_label);
1248 : : }
1249 : :
1250 : : /* Search backwards to the jump insn and mark it as a
1251 : : non-local goto. */
1252 : 1020 : for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
1253 : : {
1254 : 1020 : if (JUMP_P (insn))
1255 : : {
1256 : 510 : add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
1257 : 510 : break;
1258 : : }
1259 : 510 : else if (CALL_P (insn))
1260 : : break;
1261 : : }
1262 : :
1263 : 510 : return const0_rtx;
1264 : : }
1265 : :
1266 : : /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1267 : : (not all will be used on all machines) that was passed to __builtin_setjmp.
1268 : : It updates the stack pointer in that block to the current value. This is
1269 : : also called directly by the SJLJ exception handling code. */
1270 : :
1271 : : void
1272 : 0 : expand_builtin_update_setjmp_buf (rtx buf_addr)
1273 : : {
1274 : 0 : machine_mode sa_mode = STACK_SAVEAREA_MODE (SAVE_NONLOCAL);
1275 : 0 : buf_addr = convert_memory_address (Pmode, buf_addr);
1276 : 0 : rtx stack_save
1277 : 0 : = gen_rtx_MEM (sa_mode,
1278 : 0 : memory_address
1279 : : (sa_mode,
1280 : : plus_constant (Pmode, buf_addr,
1281 : 0 : 2 * GET_MODE_SIZE (Pmode))));
1282 : :
1283 : 0 : emit_stack_save (SAVE_NONLOCAL, &stack_save);
1284 : 0 : }
1285 : :
1286 : : /* Expand a call to __builtin_prefetch. For a target that does not support
1287 : : data prefetch, evaluate the memory address argument in case it has side
1288 : : effects. */
1289 : :
1290 : : static void
1291 : 2037 : expand_builtin_prefetch (tree exp)
1292 : : {
1293 : 2037 : tree arg0, arg1, arg2;
1294 : 2037 : int nargs;
1295 : 2037 : rtx op0, op1, op2;
1296 : :
1297 : 2037 : if (!validate_arglist (exp, POINTER_TYPE, 0))
1298 : : return;
1299 : :
1300 : 2037 : arg0 = CALL_EXPR_ARG (exp, 0);
1301 : :
1302 : : /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1303 : : zero (read) and argument 2 (locality) defaults to 3 (high degree of
1304 : : locality). */
1305 : 2037 : nargs = call_expr_nargs (exp);
1306 : 2037 : arg1 = nargs > 1 ? CALL_EXPR_ARG (exp, 1) : NULL_TREE;
1307 : 2001 : arg2 = nargs > 2 ? CALL_EXPR_ARG (exp, 2) : NULL_TREE;
1308 : :
1309 : : /* Argument 0 is an address. */
1310 : 2133 : op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL);
1311 : :
1312 : : /* Argument 1 (read/write flag) must be a compile-time constant int. */
1313 : 2037 : if (arg1 == NULL_TREE)
1314 : 36 : op1 = const0_rtx;
1315 : 2001 : else if (TREE_CODE (arg1) != INTEGER_CST)
1316 : : {
1317 : 0 : error ("second argument to %<__builtin_prefetch%> must be a constant");
1318 : 0 : op1 = const0_rtx;
1319 : : }
1320 : : else
1321 : 2001 : op1 = expand_normal (arg1);
1322 : : /* Argument 1 must be 0, 1 or 2. */
1323 : 2037 : if (!IN_RANGE (INTVAL (op1), 0, 2))
1324 : : {
1325 : 3 : warning (0, "invalid second argument to %<__builtin_prefetch%>;"
1326 : : " using zero");
1327 : 3 : op1 = const0_rtx;
1328 : : }
1329 : :
1330 : : /* Argument 2 (locality) must be a compile-time constant int. */
1331 : 2037 : if (arg2 == NULL_TREE)
1332 : 61 : op2 = GEN_INT (3);
1333 : 1976 : else if (TREE_CODE (arg2) != INTEGER_CST)
1334 : : {
1335 : 0 : error ("third argument to %<__builtin_prefetch%> must be a constant");
1336 : 0 : op2 = const0_rtx;
1337 : : }
1338 : : else
1339 : 1976 : op2 = expand_normal (arg2);
1340 : : /* Argument 2 must be 0, 1, 2, or 3. */
1341 : 2037 : if (!IN_RANGE (INTVAL (op2), 0, 3))
1342 : : {
1343 : 3 : warning (0, "invalid third argument to %<__builtin_prefetch%>; using zero");
1344 : 3 : op2 = const0_rtx;
1345 : : }
1346 : :
1347 : 2037 : if (targetm.have_prefetch ())
1348 : : {
1349 : 2037 : class expand_operand ops[3];
1350 : :
1351 : 2037 : create_address_operand (&ops[0], op0);
1352 : 2037 : create_integer_operand (&ops[1], INTVAL (op1));
1353 : 2037 : create_integer_operand (&ops[2], INTVAL (op2));
1354 : 2037 : if (maybe_expand_insn (targetm.code_for_prefetch, 3, ops))
1355 : 2037 : return;
1356 : : }
1357 : :
1358 : : /* Don't do anything with direct references to volatile memory, but
1359 : : generate code to handle other side effects. */
1360 : 0 : if (!MEM_P (op0) && side_effects_p (op0))
1361 : 0 : emit_insn (op0);
1362 : : }
1363 : :
1364 : : /* Get a MEM rtx for expression EXP which is the address of an operand
1365 : : to be used in a string instruction (cmpstrsi, cpymemsi, ..). LEN is
1366 : : the maximum length of the block of memory that might be accessed or
1367 : : NULL if unknown. */
1368 : :
1369 : : rtx
1370 : 721250 : get_memory_rtx (tree exp, tree len)
1371 : : {
1372 : 721250 : tree orig_exp = exp, base;
1373 : 721250 : rtx addr, mem;
1374 : :
1375 : 721250 : gcc_checking_assert
1376 : : (ADDR_SPACE_GENERIC_P (TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (exp)))));
1377 : :
1378 : : /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1379 : : from its expression, for expr->a.b only <variable>.a.b is recorded. */
1380 : 721250 : if (TREE_CODE (exp) == SAVE_EXPR && !SAVE_EXPR_RESOLVED_P (exp))
1381 : 1347 : exp = TREE_OPERAND (exp, 0);
1382 : :
1383 : 721250 : addr = expand_expr (orig_exp, NULL_RTX, ptr_mode, EXPAND_NORMAL);
1384 : 721250 : mem = gen_rtx_MEM (BLKmode, memory_address (BLKmode, addr));
1385 : :
1386 : : /* Get an expression we can use to find the attributes to assign to MEM.
1387 : : First remove any nops. */
1388 : 1442500 : while (CONVERT_EXPR_P (exp)
1389 : 721253 : && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (exp, 0))))
1390 : 3 : exp = TREE_OPERAND (exp, 0);
1391 : :
1392 : : /* Build a MEM_REF representing the whole accessed area as a byte blob,
1393 : : (as builtin stringops may alias with anything). */
1394 : 721250 : exp = fold_build2 (MEM_REF,
1395 : : build_array_type (char_type_node,
1396 : : build_range_type (sizetype,
1397 : : size_one_node, len)),
1398 : : exp, build_int_cst (ptr_type_node, 0));
1399 : :
1400 : : /* If the MEM_REF has no acceptable address, try to get the base object
1401 : : from the original address we got, and build an all-aliasing
1402 : : unknown-sized access to that one. */
1403 : 721250 : if (is_gimple_mem_ref_addr (TREE_OPERAND (exp, 0)))
1404 : 721238 : set_mem_attributes (mem, exp, 0);
1405 : 12 : else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
1406 : 12 : && (base = get_base_address (TREE_OPERAND (TREE_OPERAND (exp, 0),
1407 : : 0))))
1408 : : {
1409 : 12 : unsigned int align = get_pointer_alignment (TREE_OPERAND (exp, 0));
1410 : 12 : exp = build_fold_addr_expr (base);
1411 : 12 : exp = fold_build2 (MEM_REF,
1412 : : build_array_type (char_type_node,
1413 : : build_range_type (sizetype,
1414 : : size_zero_node,
1415 : : NULL)),
1416 : : exp, build_int_cst (ptr_type_node, 0));
1417 : 12 : set_mem_attributes (mem, exp, 0);
1418 : : /* Since we stripped parts make sure the offset is unknown and the
1419 : : alignment is computed from the original address. */
1420 : 12 : clear_mem_offset (mem);
1421 : 12 : set_mem_align (mem, align);
1422 : : }
1423 : 721250 : set_mem_alias_set (mem, 0);
1424 : 721250 : return mem;
1425 : : }
1426 : :
1427 : : /* Built-in functions to perform an untyped call and return. */
1428 : :
1429 : : /* Wrapper that implicitly applies a delta when getting or setting the
1430 : : enclosed value. */
1431 : : template <typename T>
1432 : : class delta_type
1433 : : {
1434 : : T &value; T const delta;
1435 : : public:
1436 : 2524 : delta_type (T &val, T dlt) : value (val), delta (dlt) {}
1437 : 1809 : operator T () const { return value + delta; }
1438 : 715 : T operator = (T val) const { value = val - delta; return val; }
1439 : : };
1440 : :
1441 : : #define saved_apply_args_size \
1442 : : (delta_type<int> (this_target_builtins->x_apply_args_size_plus_one, -1))
1443 : : #define apply_args_mode \
1444 : : (this_target_builtins->x_apply_args_mode)
1445 : : #define saved_apply_result_size \
1446 : : (delta_type<int> (this_target_builtins->x_apply_result_size_plus_one, -1))
1447 : : #define apply_result_mode \
1448 : : (this_target_builtins->x_apply_result_mode)
1449 : :
1450 : : /* Return the size required for the block returned by __builtin_apply_args,
1451 : : and initialize apply_args_mode. */
1452 : :
1453 : : static int
1454 : 947 : apply_args_size (void)
1455 : : {
1456 : 947 : int size = saved_apply_args_size;
1457 : 947 : int align;
1458 : 947 : unsigned int regno;
1459 : :
1460 : : /* The values computed by this function never change. */
1461 : 947 : if (size < 0)
1462 : : {
1463 : : /* The first value is the incoming arg-pointer. */
1464 : 360 : size = GET_MODE_SIZE (Pmode);
1465 : :
1466 : : /* The second value is the structure value address unless this is
1467 : : passed as an "invisible" first argument. */
1468 : 360 : if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1469 : 0 : size += GET_MODE_SIZE (Pmode);
1470 : :
1471 : 33480 : for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1472 : 33120 : if (FUNCTION_ARG_REGNO_P (regno))
1473 : : {
1474 : 5400 : fixed_size_mode mode = targetm.calls.get_raw_arg_mode (regno);
1475 : :
1476 : 5400 : if (mode != VOIDmode)
1477 : : {
1478 : 5400 : align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1479 : 5400 : if (size % align != 0)
1480 : 1 : size = CEIL (size, align) * align;
1481 : 5400 : size += GET_MODE_SIZE (mode);
1482 : 5400 : apply_args_mode[regno] = mode;
1483 : : }
1484 : : else
1485 : 0 : apply_args_mode[regno] = as_a <fixed_size_mode> (VOIDmode);
1486 : : }
1487 : : else
1488 : 27720 : apply_args_mode[regno] = as_a <fixed_size_mode> (VOIDmode);
1489 : :
1490 : 360 : saved_apply_args_size = size;
1491 : : }
1492 : 947 : return size;
1493 : : }
1494 : :
1495 : : /* Return the size required for the block returned by __builtin_apply,
1496 : : and initialize apply_result_mode. */
1497 : :
1498 : : static int
1499 : 862 : apply_result_size (void)
1500 : : {
1501 : 862 : int size = saved_apply_result_size;
1502 : 862 : int align, regno;
1503 : :
1504 : : /* The values computed by this function never change. */
1505 : 862 : if (size < 0)
1506 : : {
1507 : : size = 0;
1508 : :
1509 : 33015 : for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1510 : 32660 : if (targetm.calls.function_value_regno_p (regno))
1511 : : {
1512 : 2840 : fixed_size_mode mode = targetm.calls.get_raw_result_mode (regno);
1513 : :
1514 : 2840 : if (mode != VOIDmode)
1515 : : {
1516 : 2840 : align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1517 : 2840 : if (size % align != 0)
1518 : : size = CEIL (size, align) * align;
1519 : 2840 : size += GET_MODE_SIZE (mode);
1520 : 2840 : apply_result_mode[regno] = mode;
1521 : : }
1522 : : else
1523 : 0 : apply_result_mode[regno] = as_a <fixed_size_mode> (VOIDmode);
1524 : : }
1525 : : else
1526 : 29820 : apply_result_mode[regno] = as_a <fixed_size_mode> (VOIDmode);
1527 : :
1528 : : /* Allow targets that use untyped_call and untyped_return to override
1529 : : the size so that machine-specific information can be stored here. */
1530 : : #ifdef APPLY_RESULT_SIZE
1531 : 355 : size = APPLY_RESULT_SIZE;
1532 : : #endif
1533 : :
1534 : 355 : saved_apply_result_size = size;
1535 : : }
1536 : 862 : return size;
1537 : : }
1538 : :
1539 : : /* Create a vector describing the result block RESULT. If SAVEP is true,
1540 : : the result block is used to save the values; otherwise it is used to
1541 : : restore the values. */
1542 : :
1543 : : static rtx
1544 : 483 : result_vector (int savep, rtx result)
1545 : : {
1546 : 483 : int regno, size, align, nelts;
1547 : 483 : fixed_size_mode mode;
1548 : 483 : rtx reg, mem;
1549 : 483 : rtx *savevec = XALLOCAVEC (rtx, FIRST_PSEUDO_REGISTER);
1550 : :
1551 : 483 : size = nelts = 0;
1552 : 44919 : for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1553 : 44436 : if ((mode = apply_result_mode[regno]) != VOIDmode)
1554 : : {
1555 : 3864 : align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1556 : 3864 : if (size % align != 0)
1557 : 0 : size = CEIL (size, align) * align;
1558 : 3864 : reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1559 : 3864 : mem = adjust_address (result, mode, size);
1560 : 7728 : savevec[nelts++] = (savep
1561 : 7728 : ? gen_rtx_SET (mem, reg)
1562 : 0 : : gen_rtx_SET (reg, mem));
1563 : 7728 : size += GET_MODE_SIZE (mode);
1564 : : }
1565 : 483 : return gen_rtx_PARALLEL (VOIDmode, gen_rtvec_v (nelts, savevec));
1566 : : }
1567 : :
1568 : : /* Save the state required to perform an untyped call with the same
1569 : : arguments as were passed to the current function. */
1570 : :
1571 : : static rtx
1572 : 464 : expand_builtin_apply_args_1 (void)
1573 : : {
1574 : 464 : rtx registers, tem;
1575 : 464 : int size, align, regno;
1576 : 464 : fixed_size_mode mode;
1577 : 464 : rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1578 : :
1579 : : /* Create a block where the arg-pointer, structure value address,
1580 : : and argument registers can be saved. */
1581 : 464 : registers = assign_stack_local (BLKmode, apply_args_size (), -1);
1582 : :
1583 : : /* Walk past the arg-pointer and structure value address. */
1584 : 464 : size = GET_MODE_SIZE (Pmode);
1585 : 464 : if (targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0))
1586 : 0 : size += GET_MODE_SIZE (Pmode);
1587 : :
1588 : : /* Save each register used in calling a function to the block. */
1589 : 43152 : for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1590 : 42688 : if ((mode = apply_args_mode[regno]) != VOIDmode)
1591 : : {
1592 : 6960 : align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1593 : 6960 : if (size % align != 0)
1594 : 1 : size = CEIL (size, align) * align;
1595 : :
1596 : 6960 : tem = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1597 : :
1598 : 6960 : emit_move_insn (adjust_address (registers, mode, size), tem);
1599 : 13920 : size += GET_MODE_SIZE (mode);
1600 : : }
1601 : :
1602 : : /* Save the arg pointer to the block. */
1603 : 464 : tem = copy_to_reg (crtl->args.internal_arg_pointer);
1604 : : /* We need the pointer as the caller actually passed them to us, not
1605 : : as we might have pretended they were passed. Make sure it's a valid
1606 : : operand, as emit_move_insn isn't expected to handle a PLUS. */
1607 : 464 : if (STACK_GROWS_DOWNWARD)
1608 : 464 : tem
1609 : 464 : = force_operand (plus_constant (Pmode, tem,
1610 : 464 : crtl->args.pretend_args_size),
1611 : : NULL_RTX);
1612 : 464 : emit_move_insn (adjust_address (registers, Pmode, 0), tem);
1613 : :
1614 : 464 : size = GET_MODE_SIZE (Pmode);
1615 : :
1616 : : /* Save the structure value address unless this is passed as an
1617 : : "invisible" first argument. */
1618 : 464 : if (struct_incoming_value)
1619 : 0 : emit_move_insn (adjust_address (registers, Pmode, size),
1620 : : copy_to_reg (struct_incoming_value));
1621 : :
1622 : : /* Return the address of the block. */
1623 : 464 : return copy_addr_to_reg (XEXP (registers, 0));
1624 : : }
1625 : :
1626 : : /* __builtin_apply_args returns block of memory allocated on
1627 : : the stack into which is stored the arg pointer, structure
1628 : : value address, static chain, and all the registers that might
1629 : : possibly be used in performing a function call. The code is
1630 : : moved to the start of the function so the incoming values are
1631 : : saved. */
1632 : :
1633 : : static rtx
1634 : 464 : expand_builtin_apply_args (void)
1635 : : {
1636 : : /* Don't do __builtin_apply_args more than once in a function.
1637 : : Save the result of the first call and reuse it. */
1638 : 464 : if (apply_args_value != 0)
1639 : : return apply_args_value;
1640 : 464 : {
1641 : : /* When this function is called, it means that registers must be
1642 : : saved on entry to this function. So we migrate the
1643 : : call to the first insn of this function. */
1644 : 464 : rtx temp;
1645 : :
1646 : 464 : start_sequence ();
1647 : 464 : temp = expand_builtin_apply_args_1 ();
1648 : 464 : rtx_insn *seq = end_sequence ();
1649 : :
1650 : 464 : apply_args_value = temp;
1651 : :
1652 : : /* Put the insns after the NOTE that starts the function.
1653 : : If this is inside a start_sequence, make the outer-level insn
1654 : : chain current, so the code is placed at the start of the
1655 : : function. If internal_arg_pointer is a non-virtual pseudo,
1656 : : it needs to be placed after the function that initializes
1657 : : that pseudo. */
1658 : 464 : push_topmost_sequence ();
1659 : 464 : if (REG_P (crtl->args.internal_arg_pointer)
1660 : 464 : && REGNO (crtl->args.internal_arg_pointer) > LAST_VIRTUAL_REGISTER)
1661 : 0 : emit_insn_before (seq, parm_birth_insn);
1662 : : else
1663 : 464 : emit_insn_before (seq, NEXT_INSN (entry_of_function ()));
1664 : 464 : pop_topmost_sequence ();
1665 : 464 : return temp;
1666 : : }
1667 : : }
1668 : :
1669 : : /* Perform an untyped call and save the state required to perform an
1670 : : untyped return of whatever value was returned by the given function. */
1671 : :
1672 : : static rtx
1673 : 483 : expand_builtin_apply (rtx function, rtx arguments, rtx argsize)
1674 : : {
1675 : 483 : int size, align, regno;
1676 : 483 : fixed_size_mode mode;
1677 : 483 : rtx incoming_args, result, reg, dest, src;
1678 : 483 : rtx_call_insn *call_insn;
1679 : 483 : rtx old_stack_level = 0;
1680 : 483 : rtx call_fusage = 0;
1681 : 483 : rtx struct_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 0);
1682 : :
1683 : 483 : arguments = convert_memory_address (Pmode, arguments);
1684 : :
1685 : : /* Create a block where the return registers can be saved. */
1686 : 483 : result = assign_stack_local (BLKmode, apply_result_size (), -1);
1687 : :
1688 : : /* Fetch the arg pointer from the ARGUMENTS block. */
1689 : 483 : incoming_args = gen_reg_rtx (Pmode);
1690 : 483 : emit_move_insn (incoming_args, gen_rtx_MEM (Pmode, arguments));
1691 : 483 : if (!STACK_GROWS_DOWNWARD)
1692 : : incoming_args = expand_simple_binop (Pmode, MINUS, incoming_args, argsize,
1693 : : incoming_args, 0, OPTAB_LIB_WIDEN);
1694 : :
1695 : : /* Push a new argument block and copy the arguments. Do not allow
1696 : : the (potential) memcpy call below to interfere with our stack
1697 : : manipulations. */
1698 : 483 : do_pending_stack_adjust ();
1699 : 483 : NO_DEFER_POP;
1700 : :
1701 : : /* Save the stack with nonlocal if available. */
1702 : 483 : if (targetm.have_save_stack_nonlocal ())
1703 : 483 : emit_stack_save (SAVE_NONLOCAL, &old_stack_level);
1704 : : else
1705 : 0 : emit_stack_save (SAVE_BLOCK, &old_stack_level);
1706 : :
1707 : : /* Allocate a block of memory onto the stack and copy the memory
1708 : : arguments to the outgoing arguments address. We can pass TRUE
1709 : : as the 4th argument because we just saved the stack pointer
1710 : : and will restore it right after the call. */
1711 : 966 : allocate_dynamic_stack_space (argsize, 0, BIGGEST_ALIGNMENT, -1, true);
1712 : :
1713 : : /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1714 : : may have already set current_function_calls_alloca to true.
1715 : : current_function_calls_alloca won't be set if argsize is zero,
1716 : : so we have to guarantee need_drap is true here. */
1717 : 483 : if (SUPPORTS_STACK_ALIGNMENT)
1718 : 483 : crtl->need_drap = true;
1719 : :
1720 : 483 : dest = virtual_outgoing_args_rtx;
1721 : 483 : if (!STACK_GROWS_DOWNWARD)
1722 : : {
1723 : : if (CONST_INT_P (argsize))
1724 : : dest = plus_constant (Pmode, dest, -INTVAL (argsize));
1725 : : else
1726 : : dest = gen_rtx_PLUS (Pmode, dest, negate_rtx (Pmode, argsize));
1727 : : }
1728 : 483 : dest = gen_rtx_MEM (BLKmode, dest);
1729 : 483 : set_mem_align (dest, PARM_BOUNDARY);
1730 : 483 : src = gen_rtx_MEM (BLKmode, incoming_args);
1731 : 483 : set_mem_align (src, PARM_BOUNDARY);
1732 : 483 : emit_block_move (dest, src, argsize, BLOCK_OP_NORMAL);
1733 : :
1734 : : /* Refer to the argument block. */
1735 : 483 : apply_args_size ();
1736 : 483 : arguments = gen_rtx_MEM (BLKmode, arguments);
1737 : 483 : set_mem_align (arguments, PARM_BOUNDARY);
1738 : :
1739 : : /* Walk past the arg-pointer and structure value address. */
1740 : 483 : size = GET_MODE_SIZE (Pmode);
1741 : 483 : if (struct_value)
1742 : 0 : size += GET_MODE_SIZE (Pmode);
1743 : :
1744 : : /* Restore each of the registers previously saved. Make USE insns
1745 : : for each of these registers for use in making the call. */
1746 : 44919 : for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1747 : 44436 : if ((mode = apply_args_mode[regno]) != VOIDmode)
1748 : : {
1749 : 7245 : align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1750 : 7245 : if (size % align != 0)
1751 : 0 : size = CEIL (size, align) * align;
1752 : 7245 : reg = gen_rtx_REG (mode, regno);
1753 : 7245 : emit_move_insn (reg, adjust_address (arguments, mode, size));
1754 : 7245 : use_reg (&call_fusage, reg);
1755 : 14490 : size += GET_MODE_SIZE (mode);
1756 : : }
1757 : :
1758 : : /* Restore the structure value address unless this is passed as an
1759 : : "invisible" first argument. */
1760 : 483 : size = GET_MODE_SIZE (Pmode);
1761 : 483 : if (struct_value)
1762 : : {
1763 : 0 : rtx value = gen_reg_rtx (Pmode);
1764 : 0 : emit_move_insn (value, adjust_address (arguments, Pmode, size));
1765 : 0 : emit_move_insn (struct_value, value);
1766 : 0 : if (REG_P (struct_value))
1767 : 0 : use_reg (&call_fusage, struct_value);
1768 : : }
1769 : :
1770 : : /* All arguments and registers used for the call are set up by now! */
1771 : 483 : function = prepare_call_address (NULL, function, NULL, &call_fusage, 0, 0);
1772 : :
1773 : : /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1774 : : and we don't want to load it into a register as an optimization,
1775 : : because prepare_call_address already did it if it should be done. */
1776 : 483 : if (GET_CODE (function) != SYMBOL_REF)
1777 : 29 : function = memory_address (FUNCTION_MODE, function);
1778 : :
1779 : : /* Generate the actual call instruction and save the return value. */
1780 : 483 : if (targetm.have_untyped_call ())
1781 : : {
1782 : 483 : rtx mem = gen_rtx_MEM (FUNCTION_MODE, function);
1783 : 483 : rtx_insn *seq = targetm.gen_untyped_call (mem, result,
1784 : : result_vector (1, result));
1785 : 5800 : for (rtx_insn *insn = seq; insn; insn = NEXT_INSN (insn))
1786 : 5317 : if (CALL_P (insn))
1787 : 483 : add_reg_note (insn, REG_UNTYPED_CALL, NULL_RTX);
1788 : 483 : emit_insn (seq);
1789 : : }
1790 : 0 : else if (targetm.have_call_value ())
1791 : : {
1792 : : rtx valreg = 0;
1793 : :
1794 : : /* Locate the unique return register. It is not possible to
1795 : : express a call that sets more than one return register using
1796 : : call_value; use untyped_call for that. In fact, untyped_call
1797 : : only needs to save the return registers in the given block. */
1798 : 0 : for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1799 : 0 : if ((mode = apply_result_mode[regno]) != VOIDmode)
1800 : : {
1801 : 0 : gcc_assert (!valreg); /* have_untyped_call required. */
1802 : :
1803 : 0 : valreg = gen_rtx_REG (mode, regno);
1804 : : }
1805 : :
1806 : 0 : emit_insn (targetm.gen_call_value (valreg,
1807 : : gen_rtx_MEM (FUNCTION_MODE, function),
1808 : : const0_rtx, NULL_RTX, const0_rtx));
1809 : :
1810 : 0 : emit_move_insn (adjust_address (result, GET_MODE (valreg), 0), valreg);
1811 : : }
1812 : : else
1813 : 0 : gcc_unreachable ();
1814 : :
1815 : : /* Find the CALL insn we just emitted, and attach the register usage
1816 : : information. */
1817 : 483 : call_insn = last_call_insn ();
1818 : 483 : add_function_usage_to (call_insn, call_fusage);
1819 : :
1820 : : /* Restore the stack. */
1821 : 483 : if (targetm.have_save_stack_nonlocal ())
1822 : 483 : emit_stack_restore (SAVE_NONLOCAL, old_stack_level);
1823 : : else
1824 : 0 : emit_stack_restore (SAVE_BLOCK, old_stack_level);
1825 : 483 : fixup_args_size_notes (call_insn, get_last_insn (), 0);
1826 : :
1827 : 483 : OK_DEFER_POP;
1828 : :
1829 : : /* Return the address of the result block. */
1830 : 483 : result = copy_addr_to_reg (XEXP (result, 0));
1831 : 483 : return convert_memory_address (ptr_mode, result);
1832 : : }
1833 : :
1834 : : /* Perform an untyped return. */
1835 : :
1836 : : static void
1837 : 379 : expand_builtin_return (rtx result)
1838 : : {
1839 : 379 : int size, align, regno;
1840 : 379 : fixed_size_mode mode;
1841 : 379 : rtx reg;
1842 : 379 : rtx_insn *call_fusage = 0;
1843 : :
1844 : 379 : result = convert_memory_address (Pmode, result);
1845 : :
1846 : 379 : apply_result_size ();
1847 : 379 : result = gen_rtx_MEM (BLKmode, result);
1848 : :
1849 : 379 : if (targetm.have_untyped_return ())
1850 : : {
1851 : 0 : rtx vector = result_vector (0, result);
1852 : 0 : emit_jump_insn (targetm.gen_untyped_return (result, vector));
1853 : 0 : emit_barrier ();
1854 : 0 : return;
1855 : : }
1856 : :
1857 : : /* Restore the return value and note that each value is used. */
1858 : : size = 0;
1859 : 35247 : for (regno = 0; regno < FIRST_PSEUDO_REGISTER; regno++)
1860 : 34868 : if ((mode = apply_result_mode[regno]) != VOIDmode)
1861 : : {
1862 : 3032 : align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1863 : 3032 : if (size % align != 0)
1864 : 0 : size = CEIL (size, align) * align;
1865 : 3032 : reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1866 : 3032 : emit_move_insn (reg, adjust_address (result, mode, size));
1867 : :
1868 : 3032 : push_to_sequence (call_fusage);
1869 : 3032 : emit_use (reg);
1870 : 3032 : call_fusage = end_sequence ();
1871 : 6064 : size += GET_MODE_SIZE (mode);
1872 : : }
1873 : :
1874 : : /* Put the USE insns before the return. */
1875 : 379 : emit_insn (call_fusage);
1876 : :
1877 : : /* Return whatever values was restored by jumping directly to the end
1878 : : of the function. */
1879 : 379 : expand_naked_return ();
1880 : : }
1881 : :
1882 : : /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1883 : :
1884 : : int
1885 : 2433 : type_to_class (tree type)
1886 : : {
1887 : 2433 : switch (TREE_CODE (type))
1888 : : {
1889 : : case VOID_TYPE: return void_type_class;
1890 : 930 : case INTEGER_TYPE: return integer_type_class;
1891 : 39 : case ENUMERAL_TYPE: return enumeral_type_class;
1892 : 38 : case BOOLEAN_TYPE: return boolean_type_class;
1893 : 1016 : case POINTER_TYPE: return pointer_type_class;
1894 : 27 : case REFERENCE_TYPE: return reference_type_class;
1895 : 36 : case OFFSET_TYPE: return offset_type_class;
1896 : 132 : case REAL_TYPE: return real_type_class;
1897 : 40 : case COMPLEX_TYPE: return complex_type_class;
1898 : 20 : case FUNCTION_TYPE: return function_type_class;
1899 : 0 : case METHOD_TYPE: return method_type_class;
1900 : 44 : case RECORD_TYPE: return record_type_class;
1901 : 44 : case UNION_TYPE:
1902 : 44 : case QUAL_UNION_TYPE: return union_type_class;
1903 : 24 : case ARRAY_TYPE: return (TYPE_STRING_FLAG (type)
1904 : 24 : ? string_type_class : array_type_class);
1905 : 0 : case LANG_TYPE: return lang_type_class;
1906 : 0 : case OPAQUE_TYPE: return opaque_type_class;
1907 : 0 : case BITINT_TYPE: return bitint_type_class;
1908 : 30 : case VECTOR_TYPE: return vector_type_class;
1909 : 3 : default: return no_type_class;
1910 : : }
1911 : : }
1912 : :
1913 : : /* Expand a call EXP to __builtin_classify_type. */
1914 : :
1915 : : static rtx
1916 : 0 : expand_builtin_classify_type (tree exp)
1917 : : {
1918 : 0 : if (call_expr_nargs (exp))
1919 : 0 : return GEN_INT (type_to_class (TREE_TYPE (CALL_EXPR_ARG (exp, 0))));
1920 : 0 : return GEN_INT (no_type_class);
1921 : : }
1922 : :
1923 : : /* This helper macro, meant to be used in mathfn_built_in below, determines
1924 : : which among a set of builtin math functions is appropriate for a given type
1925 : : mode. The `F' (float) and `L' (long double) are automatically generated
1926 : : from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1927 : : types, there are additional types that are considered with 'F32', 'F64',
1928 : : 'F128', etc. suffixes. */
1929 : : #define CASE_MATHFN(MATHFN) \
1930 : : CASE_CFN_##MATHFN: \
1931 : : fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1932 : : fcodel = BUILT_IN_##MATHFN##L ; break;
1933 : : /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1934 : : types. */
1935 : : #define CASE_MATHFN_FLOATN(MATHFN) \
1936 : : CASE_CFN_##MATHFN: \
1937 : : fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1938 : : fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1939 : : fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1940 : : fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1941 : : fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1942 : : break;
1943 : : /* Similar to above, but appends _R after any F/L suffix. */
1944 : : #define CASE_MATHFN_REENT(MATHFN) \
1945 : : case CFN_BUILT_IN_##MATHFN##_R: \
1946 : : case CFN_BUILT_IN_##MATHFN##F_R: \
1947 : : case CFN_BUILT_IN_##MATHFN##L_R: \
1948 : : fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1949 : : fcodel = BUILT_IN_##MATHFN##L_R ; break;
1950 : :
1951 : : /* Return a function equivalent to FN but operating on floating-point
1952 : : values of type TYPE, or END_BUILTINS if no such function exists.
1953 : : This is purely an operation on function codes; it does not guarantee
1954 : : that the target actually has an implementation of the function. */
1955 : :
1956 : : static built_in_function
1957 : 597958 : mathfn_built_in_2 (tree type, combined_fn fn)
1958 : : {
1959 : 597958 : tree mtype;
1960 : 597958 : built_in_function fcode, fcodef, fcodel;
1961 : 597958 : built_in_function fcodef16 = END_BUILTINS;
1962 : 597958 : built_in_function fcodef32 = END_BUILTINS;
1963 : 597958 : built_in_function fcodef64 = END_BUILTINS;
1964 : 597958 : built_in_function fcodef128 = END_BUILTINS;
1965 : 597958 : built_in_function fcodef32x = END_BUILTINS;
1966 : 597958 : built_in_function fcodef64x = END_BUILTINS;
1967 : 597958 : built_in_function fcodef128x = END_BUILTINS;
1968 : :
1969 : : /* If <math.h> has been included somehow, HUGE_VAL and NAN definitions
1970 : : break the uses below. */
1971 : : #undef HUGE_VAL
1972 : : #undef NAN
1973 : :
1974 : 597958 : switch (fn)
1975 : : {
1976 : : #define SEQ_OF_CASE_MATHFN \
1977 : : CASE_MATHFN_FLOATN (ACOS) \
1978 : : CASE_MATHFN_FLOATN (ACOSH) \
1979 : : CASE_MATHFN_FLOATN (ASIN) \
1980 : : CASE_MATHFN_FLOATN (ASINH) \
1981 : : CASE_MATHFN_FLOATN (ATAN) \
1982 : : CASE_MATHFN_FLOATN (ATAN2) \
1983 : : CASE_MATHFN_FLOATN (ATANH) \
1984 : : CASE_MATHFN_FLOATN (CBRT) \
1985 : : CASE_MATHFN_FLOATN (CEIL) \
1986 : : CASE_MATHFN (CEXPI) \
1987 : : CASE_MATHFN_FLOATN (COPYSIGN) \
1988 : : CASE_MATHFN_FLOATN (COS) \
1989 : : CASE_MATHFN_FLOATN (COSH) \
1990 : : CASE_MATHFN (DREM) \
1991 : : CASE_MATHFN_FLOATN (ERF) \
1992 : : CASE_MATHFN_FLOATN (ERFC) \
1993 : : CASE_MATHFN_FLOATN (EXP) \
1994 : : CASE_MATHFN (EXP10) \
1995 : : CASE_MATHFN_FLOATN (EXP2) \
1996 : : CASE_MATHFN_FLOATN (EXPM1) \
1997 : : CASE_MATHFN_FLOATN (FABS) \
1998 : : CASE_MATHFN_FLOATN (FDIM) \
1999 : : CASE_MATHFN_FLOATN (FLOOR) \
2000 : : CASE_MATHFN_FLOATN (FMA) \
2001 : : CASE_MATHFN_FLOATN (FMAX) \
2002 : : CASE_MATHFN_FLOATN (FMIN) \
2003 : : CASE_MATHFN_FLOATN (FMOD) \
2004 : : CASE_MATHFN_FLOATN (FREXP) \
2005 : : CASE_MATHFN (GAMMA) \
2006 : : CASE_MATHFN_REENT (GAMMA) /* GAMMA_R */ \
2007 : : CASE_MATHFN_FLOATN (HUGE_VAL) \
2008 : : CASE_MATHFN_FLOATN (HYPOT) \
2009 : : CASE_MATHFN_FLOATN (ILOGB) \
2010 : : CASE_MATHFN (ICEIL) \
2011 : : CASE_MATHFN (IFLOOR) \
2012 : : CASE_MATHFN_FLOATN (INF) \
2013 : : CASE_MATHFN (IRINT) \
2014 : : CASE_MATHFN (IROUND) \
2015 : : CASE_MATHFN (ISINF) \
2016 : : CASE_MATHFN (J0) \
2017 : : CASE_MATHFN (J1) \
2018 : : CASE_MATHFN (JN) \
2019 : : CASE_MATHFN (LCEIL) \
2020 : : CASE_MATHFN_FLOATN (LDEXP) \
2021 : : CASE_MATHFN (LFLOOR) \
2022 : : CASE_MATHFN_FLOATN (LGAMMA) \
2023 : : CASE_MATHFN_REENT (LGAMMA) /* LGAMMA_R */ \
2024 : : CASE_MATHFN (LLCEIL) \
2025 : : CASE_MATHFN (LLFLOOR) \
2026 : : CASE_MATHFN_FLOATN (LLRINT) \
2027 : : CASE_MATHFN_FLOATN (LLROUND) \
2028 : : CASE_MATHFN_FLOATN (LOG) \
2029 : : CASE_MATHFN_FLOATN (LOG10) \
2030 : : CASE_MATHFN_FLOATN (LOG1P) \
2031 : : CASE_MATHFN_FLOATN (LOG2) \
2032 : : CASE_MATHFN_FLOATN (LOGB) \
2033 : : CASE_MATHFN_FLOATN (LRINT) \
2034 : : CASE_MATHFN_FLOATN (LROUND) \
2035 : : CASE_MATHFN_FLOATN (MODF) \
2036 : : CASE_MATHFN_FLOATN (NAN) \
2037 : : CASE_MATHFN_FLOATN (NANS) \
2038 : : CASE_MATHFN_FLOATN (NEARBYINT) \
2039 : : CASE_MATHFN_FLOATN (NEXTAFTER) \
2040 : : CASE_MATHFN (NEXTTOWARD) \
2041 : : CASE_MATHFN_FLOATN (POW) \
2042 : : CASE_MATHFN (POWI) \
2043 : : CASE_MATHFN (POW10) \
2044 : : CASE_MATHFN_FLOATN (REMAINDER) \
2045 : : CASE_MATHFN_FLOATN (REMQUO) \
2046 : : CASE_MATHFN_FLOATN (RINT) \
2047 : : CASE_MATHFN_FLOATN (ROUND) \
2048 : : CASE_MATHFN_FLOATN (ROUNDEVEN) \
2049 : : CASE_MATHFN (SCALB) \
2050 : : CASE_MATHFN_FLOATN (SCALBLN) \
2051 : : CASE_MATHFN_FLOATN (SCALBN) \
2052 : : CASE_MATHFN (SIGNBIT) \
2053 : : CASE_MATHFN (SIGNIFICAND) \
2054 : : CASE_MATHFN_FLOATN (SIN) \
2055 : : CASE_MATHFN (SINCOS) \
2056 : : CASE_MATHFN_FLOATN (SINH) \
2057 : : CASE_MATHFN_FLOATN (SQRT) \
2058 : : CASE_MATHFN_FLOATN (TAN) \
2059 : : CASE_MATHFN_FLOATN (TANH) \
2060 : : CASE_MATHFN_FLOATN (TGAMMA) \
2061 : : CASE_MATHFN_FLOATN (TRUNC) \
2062 : : CASE_MATHFN (Y0) \
2063 : : CASE_MATHFN (Y1) \
2064 : : CASE_MATHFN (YN)
2065 : :
2066 : 597895 : SEQ_OF_CASE_MATHFN
2067 : :
2068 : : default:
2069 : : return END_BUILTINS;
2070 : : }
2071 : :
2072 : 597958 : mtype = TYPE_MAIN_VARIANT (type);
2073 : 597958 : if (mtype == double_type_node)
2074 : : return fcode;
2075 : 554956 : else if (mtype == float_type_node)
2076 : : return fcodef;
2077 : 502920 : else if (mtype == long_double_type_node)
2078 : : return fcodel;
2079 : 469349 : else if (mtype == float16_type_node)
2080 : : return fcodef16;
2081 : 469301 : else if (mtype == float32_type_node)
2082 : : return fcodef32;
2083 : 469301 : else if (mtype == float64_type_node)
2084 : : return fcodef64;
2085 : 469301 : else if (mtype == float128_type_node)
2086 : : return fcodef128;
2087 : 461251 : else if (mtype == float32x_type_node)
2088 : : return fcodef32x;
2089 : 461251 : else if (mtype == float64x_type_node)
2090 : : return fcodef64x;
2091 : 461251 : else if (mtype == float128x_type_node)
2092 : : return fcodef128x;
2093 : : else
2094 : 461251 : return END_BUILTINS;
2095 : : }
2096 : :
2097 : : #undef CASE_MATHFN
2098 : : #undef CASE_MATHFN_FLOATN
2099 : : #undef CASE_MATHFN_REENT
2100 : :
2101 : : /* Return mathematic function equivalent to FN but operating directly on TYPE,
2102 : : if available. If IMPLICIT_P is true use the implicit builtin declaration,
2103 : : otherwise use the explicit declaration. If we can't do the conversion,
2104 : : return null. */
2105 : :
2106 : : static tree
2107 : 597813 : mathfn_built_in_1 (tree type, combined_fn fn, bool implicit_p)
2108 : : {
2109 : 597813 : built_in_function fcode2 = mathfn_built_in_2 (type, fn);
2110 : 597813 : if (fcode2 == END_BUILTINS)
2111 : : return NULL_TREE;
2112 : :
2113 : 132914 : if (implicit_p && !builtin_decl_implicit_p (fcode2))
2114 : : return NULL_TREE;
2115 : :
2116 : 128415 : return builtin_decl_explicit (fcode2);
2117 : : }
2118 : :
2119 : : /* Like mathfn_built_in_1, but always use the implicit array. */
2120 : :
2121 : : tree
2122 : 210 : mathfn_built_in (tree type, combined_fn fn)
2123 : : {
2124 : 210 : return mathfn_built_in_1 (type, fn, /*implicit=*/ 1);
2125 : : }
2126 : :
2127 : : /* Like mathfn_built_in_1, but always use the explicit array. */
2128 : :
2129 : : tree
2130 : 0 : mathfn_built_in_explicit (tree type, combined_fn fn)
2131 : : {
2132 : 0 : return mathfn_built_in_1 (type, fn, /*implicit=*/ 0);
2133 : : }
2134 : :
2135 : : /* Like mathfn_built_in_1, but take a built_in_function and
2136 : : always use the implicit array. */
2137 : :
2138 : : tree
2139 : 597382 : mathfn_built_in (tree type, enum built_in_function fn)
2140 : : {
2141 : 597382 : return mathfn_built_in_1 (type, as_combined_fn (fn), /*implicit=*/ 1);
2142 : : }
2143 : :
2144 : : /* Return the type associated with a built in function, i.e., the one
2145 : : to be passed to mathfn_built_in to get the type-specific
2146 : : function. */
2147 : :
2148 : : tree
2149 : 1239 : mathfn_built_in_type (combined_fn fn)
2150 : : {
2151 : : #define CASE_MATHFN(MATHFN) \
2152 : : case CFN_BUILT_IN_##MATHFN: \
2153 : : return double_type_node; \
2154 : : case CFN_BUILT_IN_##MATHFN##F: \
2155 : : return float_type_node; \
2156 : : case CFN_BUILT_IN_##MATHFN##L: \
2157 : : return long_double_type_node;
2158 : :
2159 : : #define CASE_MATHFN_FLOATN(MATHFN) \
2160 : : CASE_MATHFN(MATHFN) \
2161 : : case CFN_BUILT_IN_##MATHFN##F16: \
2162 : : return float16_type_node; \
2163 : : case CFN_BUILT_IN_##MATHFN##F32: \
2164 : : return float32_type_node; \
2165 : : case CFN_BUILT_IN_##MATHFN##F64: \
2166 : : return float64_type_node; \
2167 : : case CFN_BUILT_IN_##MATHFN##F128: \
2168 : : return float128_type_node; \
2169 : : case CFN_BUILT_IN_##MATHFN##F32X: \
2170 : : return float32x_type_node; \
2171 : : case CFN_BUILT_IN_##MATHFN##F64X: \
2172 : : return float64x_type_node; \
2173 : : case CFN_BUILT_IN_##MATHFN##F128X: \
2174 : : return float128x_type_node;
2175 : :
2176 : : /* Similar to above, but appends _R after any F/L suffix. */
2177 : : #define CASE_MATHFN_REENT(MATHFN) \
2178 : : case CFN_BUILT_IN_##MATHFN##_R: \
2179 : : return double_type_node; \
2180 : : case CFN_BUILT_IN_##MATHFN##F_R: \
2181 : : return float_type_node; \
2182 : : case CFN_BUILT_IN_##MATHFN##L_R: \
2183 : : return long_double_type_node;
2184 : :
2185 : 1239 : switch (fn)
2186 : : {
2187 : 1239 : SEQ_OF_CASE_MATHFN
2188 : :
2189 : : default:
2190 : : return NULL_TREE;
2191 : : }
2192 : :
2193 : : #undef CASE_MATHFN
2194 : : #undef CASE_MATHFN_FLOATN
2195 : : #undef CASE_MATHFN_REENT
2196 : : #undef SEQ_OF_CASE_MATHFN
2197 : : }
2198 : :
2199 : : /* Check whether there is an internal function associated with function FN
2200 : : and return type RETURN_TYPE. Return the function if so, otherwise return
2201 : : IFN_LAST.
2202 : :
2203 : : Note that this function only tests whether the function is defined in
2204 : : internals.def, not whether it is actually available on the target. */
2205 : :
2206 : : static internal_fn
2207 : 13430677 : associated_internal_fn (built_in_function fn, tree return_type)
2208 : : {
2209 : 13430677 : switch (fn)
2210 : : {
2211 : : #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2212 : : CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2213 : : #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2214 : : CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2215 : : CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2216 : : #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2217 : : CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2218 : : #include "internal-fn.def"
2219 : :
2220 : : CASE_FLT_FN (BUILT_IN_POW10):
2221 : : return IFN_EXP10;
2222 : :
2223 : : CASE_FLT_FN (BUILT_IN_DREM):
2224 : : return IFN_REMAINDER;
2225 : :
2226 : 18470 : CASE_FLT_FN (BUILT_IN_SCALBN):
2227 : 18470 : CASE_FLT_FN (BUILT_IN_SCALBLN):
2228 : 18470 : if (REAL_MODE_FORMAT (TYPE_MODE (return_type))->b == 2)
2229 : : return IFN_LDEXP;
2230 : : return IFN_LAST;
2231 : 73 : case BUILT_IN_CRC8_DATA8:
2232 : 73 : case BUILT_IN_CRC16_DATA8:
2233 : 73 : case BUILT_IN_CRC16_DATA16:
2234 : 73 : case BUILT_IN_CRC32_DATA8:
2235 : 73 : case BUILT_IN_CRC32_DATA16:
2236 : 73 : case BUILT_IN_CRC32_DATA32:
2237 : 73 : case BUILT_IN_CRC64_DATA8:
2238 : 73 : case BUILT_IN_CRC64_DATA16:
2239 : 73 : case BUILT_IN_CRC64_DATA32:
2240 : 73 : case BUILT_IN_CRC64_DATA64:
2241 : 73 : return IFN_CRC;
2242 : 126 : case BUILT_IN_REV_CRC8_DATA8:
2243 : 126 : case BUILT_IN_REV_CRC16_DATA8:
2244 : 126 : case BUILT_IN_REV_CRC16_DATA16:
2245 : 126 : case BUILT_IN_REV_CRC32_DATA8:
2246 : 126 : case BUILT_IN_REV_CRC32_DATA16:
2247 : 126 : case BUILT_IN_REV_CRC32_DATA32:
2248 : 126 : case BUILT_IN_REV_CRC64_DATA8:
2249 : 126 : case BUILT_IN_REV_CRC64_DATA16:
2250 : 126 : case BUILT_IN_REV_CRC64_DATA32:
2251 : 126 : case BUILT_IN_REV_CRC64_DATA64:
2252 : 126 : return IFN_CRC_REV;
2253 : : default:
2254 : : return IFN_LAST;
2255 : : }
2256 : : }
2257 : :
2258 : : /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2259 : : return its code, otherwise return IFN_LAST. Note that this function
2260 : : only tests whether the function is defined in internals.def, not whether
2261 : : it is actually available on the target. */
2262 : :
2263 : : internal_fn
2264 : 636919 : associated_internal_fn (tree fndecl)
2265 : : {
2266 : 636919 : gcc_checking_assert (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL);
2267 : 636919 : return associated_internal_fn (DECL_FUNCTION_CODE (fndecl),
2268 : 636919 : TREE_TYPE (TREE_TYPE (fndecl)));
2269 : : }
2270 : :
2271 : : /* Check whether there is an internal function associated with function CFN
2272 : : and return type RETURN_TYPE. Return the function if so, otherwise return
2273 : : IFN_LAST.
2274 : :
2275 : : Note that this function only tests whether the function is defined in
2276 : : internals.def, not whether it is actually available on the target. */
2277 : :
2278 : : internal_fn
2279 : 33301066 : associated_internal_fn (combined_fn cfn, tree return_type)
2280 : : {
2281 : 33301066 : if (internal_fn_p (cfn))
2282 : 20507308 : return as_internal_fn (cfn);
2283 : 12793758 : return associated_internal_fn (as_builtin_fn (cfn), return_type);
2284 : : }
2285 : :
2286 : : /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2287 : : on the current target by a call to an internal function, return the
2288 : : code of that internal function, otherwise return IFN_LAST. The caller
2289 : : is responsible for ensuring that any side-effects of the built-in
2290 : : call are dealt with correctly. E.g. if CALL sets errno, the caller
2291 : : must decide that the errno result isn't needed or make it available
2292 : : in some other way. */
2293 : :
2294 : : internal_fn
2295 : 857575 : replacement_internal_fn (gcall *call)
2296 : : {
2297 : 857575 : if (gimple_call_builtin_p (call, BUILT_IN_NORMAL))
2298 : : {
2299 : 634582 : internal_fn ifn = associated_internal_fn (gimple_call_fndecl (call));
2300 : 634582 : if (ifn != IFN_LAST)
2301 : : {
2302 : 62260 : tree_pair types = direct_internal_fn_types (ifn, call);
2303 : 62260 : optimization_type opt_type = bb_optimization_type (gimple_bb (call));
2304 : 62260 : if (direct_internal_fn_supported_p (ifn, types, opt_type))
2305 : 40838 : return ifn;
2306 : : }
2307 : : }
2308 : : return IFN_LAST;
2309 : : }
2310 : :
2311 : : /* Expand a call to the builtin trinary math functions (fma).
2312 : : Return NULL_RTX if a normal call should be emitted rather than expanding the
2313 : : function in-line. EXP is the expression that is a call to the builtin
2314 : : function; if convenient, the result should be placed in TARGET.
2315 : : SUBTARGET may be used as the target for computing one of EXP's
2316 : : operands. */
2317 : :
2318 : : static rtx
2319 : 364 : expand_builtin_mathfn_ternary (tree exp, rtx target, rtx subtarget)
2320 : : {
2321 : 364 : optab builtin_optab;
2322 : 364 : rtx op0, op1, op2, result;
2323 : 364 : rtx_insn *insns;
2324 : 364 : tree fndecl = get_callee_fndecl (exp);
2325 : 364 : tree arg0, arg1, arg2;
2326 : 364 : machine_mode mode;
2327 : :
2328 : 364 : if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, REAL_TYPE, VOID_TYPE))
2329 : : return NULL_RTX;
2330 : :
2331 : 364 : arg0 = CALL_EXPR_ARG (exp, 0);
2332 : 364 : arg1 = CALL_EXPR_ARG (exp, 1);
2333 : 364 : arg2 = CALL_EXPR_ARG (exp, 2);
2334 : :
2335 : 364 : switch (DECL_FUNCTION_CODE (fndecl))
2336 : : {
2337 : 364 : CASE_FLT_FN (BUILT_IN_FMA):
2338 : 364 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMA):
2339 : 364 : builtin_optab = fma_optab; break;
2340 : 0 : default:
2341 : 0 : gcc_unreachable ();
2342 : : }
2343 : :
2344 : : /* Make a suitable register to place result in. */
2345 : 364 : mode = TYPE_MODE (TREE_TYPE (exp));
2346 : :
2347 : : /* Before working hard, check whether the instruction is available. */
2348 : 364 : if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2349 : : return NULL_RTX;
2350 : :
2351 : 0 : result = gen_reg_rtx (mode);
2352 : :
2353 : : /* Always stabilize the argument list. */
2354 : 0 : CALL_EXPR_ARG (exp, 0) = arg0 = builtin_save_expr (arg0);
2355 : 0 : CALL_EXPR_ARG (exp, 1) = arg1 = builtin_save_expr (arg1);
2356 : 0 : CALL_EXPR_ARG (exp, 2) = arg2 = builtin_save_expr (arg2);
2357 : :
2358 : 0 : op0 = expand_expr (arg0, subtarget, VOIDmode, EXPAND_NORMAL);
2359 : 0 : op1 = expand_normal (arg1);
2360 : 0 : op2 = expand_normal (arg2);
2361 : :
2362 : 0 : start_sequence ();
2363 : :
2364 : : /* Compute into RESULT.
2365 : : Set RESULT to wherever the result comes back. */
2366 : 0 : result = expand_ternary_op (mode, builtin_optab, op0, op1, op2,
2367 : : result, 0);
2368 : :
2369 : : /* If we were unable to expand via the builtin, stop the sequence
2370 : : (without outputting the insns) and call to the library function
2371 : : with the stabilized argument list. */
2372 : 0 : if (result == 0)
2373 : : {
2374 : 0 : end_sequence ();
2375 : 0 : return expand_call (exp, target, target == const0_rtx);
2376 : : }
2377 : :
2378 : : /* Output the entire sequence. */
2379 : 0 : insns = end_sequence ();
2380 : 0 : emit_insn (insns);
2381 : :
2382 : 0 : return result;
2383 : : }
2384 : :
2385 : : /* Expand a call to the builtin sin and cos math functions.
2386 : : Return NULL_RTX if a normal call should be emitted rather than expanding the
2387 : : function in-line. EXP is the expression that is a call to the builtin
2388 : : function; if convenient, the result should be placed in TARGET.
2389 : : SUBTARGET may be used as the target for computing one of EXP's
2390 : : operands. */
2391 : :
2392 : : static rtx
2393 : 47 : expand_builtin_mathfn_3 (tree exp, rtx target, rtx subtarget)
2394 : : {
2395 : 47 : optab builtin_optab;
2396 : 47 : rtx op0;
2397 : 47 : rtx_insn *insns;
2398 : 47 : tree fndecl = get_callee_fndecl (exp);
2399 : 47 : machine_mode mode;
2400 : 47 : tree arg;
2401 : :
2402 : 47 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2403 : : return NULL_RTX;
2404 : :
2405 : 39 : arg = CALL_EXPR_ARG (exp, 0);
2406 : :
2407 : 39 : switch (DECL_FUNCTION_CODE (fndecl))
2408 : : {
2409 : 39 : CASE_FLT_FN (BUILT_IN_SIN):
2410 : 39 : CASE_FLT_FN (BUILT_IN_COS):
2411 : 39 : builtin_optab = sincos_optab; break;
2412 : 0 : default:
2413 : 0 : gcc_unreachable ();
2414 : : }
2415 : :
2416 : : /* Make a suitable register to place result in. */
2417 : 39 : mode = TYPE_MODE (TREE_TYPE (exp));
2418 : :
2419 : : /* Check if sincos insn is available, otherwise fallback
2420 : : to sin or cos insn. */
2421 : 39 : if (optab_handler (builtin_optab, mode) == CODE_FOR_nothing)
2422 : 39 : switch (DECL_FUNCTION_CODE (fndecl))
2423 : : {
2424 : : CASE_FLT_FN (BUILT_IN_SIN):
2425 : : builtin_optab = sin_optab; break;
2426 : 14 : CASE_FLT_FN (BUILT_IN_COS):
2427 : 14 : builtin_optab = cos_optab; break;
2428 : 0 : default:
2429 : 0 : gcc_unreachable ();
2430 : : }
2431 : :
2432 : : /* Before working hard, check whether the instruction is available. */
2433 : 39 : if (optab_handler (builtin_optab, mode) != CODE_FOR_nothing)
2434 : : {
2435 : 0 : rtx result = gen_reg_rtx (mode);
2436 : :
2437 : : /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2438 : : need to expand the argument again. This way, we will not perform
2439 : : side-effects more the once. */
2440 : 0 : CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2441 : :
2442 : 0 : op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
2443 : :
2444 : 0 : start_sequence ();
2445 : :
2446 : : /* Compute into RESULT.
2447 : : Set RESULT to wherever the result comes back. */
2448 : 0 : if (builtin_optab == sincos_optab)
2449 : : {
2450 : 0 : int ok;
2451 : :
2452 : 0 : switch (DECL_FUNCTION_CODE (fndecl))
2453 : : {
2454 : 0 : CASE_FLT_FN (BUILT_IN_SIN):
2455 : 0 : ok = expand_twoval_unop (builtin_optab, op0, 0, result, 0);
2456 : 0 : break;
2457 : 0 : CASE_FLT_FN (BUILT_IN_COS):
2458 : 0 : ok = expand_twoval_unop (builtin_optab, op0, result, 0, 0);
2459 : 0 : break;
2460 : 0 : default:
2461 : 0 : gcc_unreachable ();
2462 : : }
2463 : 0 : gcc_assert (ok);
2464 : : }
2465 : : else
2466 : 0 : result = expand_unop (mode, builtin_optab, op0, result, 0);
2467 : :
2468 : 0 : if (result != 0)
2469 : : {
2470 : : /* Output the entire sequence. */
2471 : 0 : insns = end_sequence ();
2472 : 0 : emit_insn (insns);
2473 : 0 : return result;
2474 : : }
2475 : :
2476 : : /* If we were unable to expand via the builtin, stop the sequence
2477 : : (without outputting the insns) and call to the library function
2478 : : with the stabilized argument list. */
2479 : 0 : end_sequence ();
2480 : : }
2481 : :
2482 : 39 : return expand_call (exp, target, target == const0_rtx);
2483 : : }
2484 : :
2485 : : /* Given an interclass math builtin decl FNDECL and it's argument ARG
2486 : : return an RTL instruction code that implements the functionality.
2487 : : If that isn't possible or available return CODE_FOR_nothing. */
2488 : :
2489 : : static enum insn_code
2490 : 1373279 : interclass_mathfn_icode (tree arg, tree fndecl)
2491 : : {
2492 : 1373279 : bool errno_set = false;
2493 : 1373279 : optab builtin_optab = unknown_optab;
2494 : 1373279 : machine_mode mode;
2495 : :
2496 : 1373279 : switch (DECL_FUNCTION_CODE (fndecl))
2497 : : {
2498 : 4 : CASE_FLT_FN (BUILT_IN_ILOGB):
2499 : 4 : errno_set = true;
2500 : 4 : builtin_optab = ilogb_optab;
2501 : 4 : break;
2502 : 265382 : CASE_FLT_FN (BUILT_IN_ISINF):
2503 : 265382 : builtin_optab = isinf_optab;
2504 : 265382 : break;
2505 : 576068 : case BUILT_IN_ISFINITE:
2506 : 576068 : builtin_optab = isfinite_optab;
2507 : 576068 : break;
2508 : 263598 : case BUILT_IN_ISNORMAL:
2509 : 263598 : builtin_optab = isnormal_optab;
2510 : 263598 : break;
2511 : 266150 : CASE_FLT_FN (BUILT_IN_ISNAN):
2512 : 266150 : builtin_optab = isnan_optab;
2513 : 266150 : break;
2514 : : CASE_FLT_FN (BUILT_IN_FINITE):
2515 : : case BUILT_IN_FINITED32:
2516 : : case BUILT_IN_FINITED64:
2517 : : case BUILT_IN_FINITED128:
2518 : : case BUILT_IN_ISINFD32:
2519 : : case BUILT_IN_ISINFD64:
2520 : : case BUILT_IN_ISINFD128:
2521 : : case BUILT_IN_ISNAND32:
2522 : : case BUILT_IN_ISNAND64:
2523 : : case BUILT_IN_ISNAND128:
2524 : : /* These builtins have no optabs (yet). */
2525 : : break;
2526 : 0 : default:
2527 : 0 : gcc_unreachable ();
2528 : : }
2529 : :
2530 : : /* There's no easy way to detect the case we need to set EDOM. */
2531 : 1373279 : if (flag_errno_math && errno_set)
2532 : : return CODE_FOR_nothing;
2533 : :
2534 : : /* Optab mode depends on the mode of the input argument. */
2535 : 1373279 : mode = TYPE_MODE (TREE_TYPE (arg));
2536 : :
2537 : 1373279 : if (builtin_optab)
2538 : 1371202 : return optab_handler (builtin_optab, mode);
2539 : : return CODE_FOR_nothing;
2540 : : }
2541 : :
2542 : : /* Expand a call to one of the builtin math functions that operate on
2543 : : floating point argument and output an integer result (ilogb, isinf,
2544 : : isnan, etc).
2545 : : Return 0 if a normal call should be emitted rather than expanding the
2546 : : function in-line. EXP is the expression that is a call to the builtin
2547 : : function; if convenient, the result should be placed in TARGET. */
2548 : :
2549 : : static rtx
2550 : 4 : expand_builtin_interclass_mathfn (tree exp, rtx target)
2551 : : {
2552 : 4 : enum insn_code icode = CODE_FOR_nothing;
2553 : 4 : rtx op0;
2554 : 4 : tree fndecl = get_callee_fndecl (exp);
2555 : 4 : machine_mode mode;
2556 : 4 : tree arg;
2557 : :
2558 : 4 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2559 : : return NULL_RTX;
2560 : :
2561 : 4 : arg = CALL_EXPR_ARG (exp, 0);
2562 : 4 : icode = interclass_mathfn_icode (arg, fndecl);
2563 : 4 : mode = TYPE_MODE (TREE_TYPE (arg));
2564 : :
2565 : 4 : if (icode != CODE_FOR_nothing)
2566 : : {
2567 : 2 : class expand_operand ops[1];
2568 : 2 : rtx_insn *last = get_last_insn ();
2569 : 2 : tree orig_arg = arg;
2570 : :
2571 : : /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2572 : : need to expand the argument again. This way, we will not perform
2573 : : side-effects more the once. */
2574 : 2 : CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
2575 : :
2576 : 2 : op0 = expand_expr (arg, NULL_RTX, VOIDmode, EXPAND_NORMAL);
2577 : :
2578 : 2 : if (mode != GET_MODE (op0))
2579 : 0 : op0 = convert_to_mode (mode, op0, 0);
2580 : :
2581 : 2 : create_output_operand (&ops[0], target, TYPE_MODE (TREE_TYPE (exp)));
2582 : 2 : if (maybe_legitimize_operands (icode, 0, 1, ops)
2583 : 2 : && maybe_emit_unop_insn (icode, ops[0].value, op0, UNKNOWN))
2584 : 1 : return ops[0].value;
2585 : :
2586 : 1 : delete_insns_since (last);
2587 : 1 : CALL_EXPR_ARG (exp, 0) = orig_arg;
2588 : : }
2589 : :
2590 : : return NULL_RTX;
2591 : : }
2592 : :
2593 : : /* Expand a call to the builtin sincos math function.
2594 : : Return NULL_RTX if a normal call should be emitted rather than expanding the
2595 : : function in-line. EXP is the expression that is a call to the builtin
2596 : : function. */
2597 : :
2598 : : static rtx
2599 : 3 : expand_builtin_sincos (tree exp)
2600 : : {
2601 : 3 : rtx op0, op1, op2, target1, target2;
2602 : 3 : machine_mode mode;
2603 : 3 : tree arg, sinp, cosp;
2604 : 3 : int result;
2605 : 3 : location_t loc = EXPR_LOCATION (exp);
2606 : 3 : tree alias_type, alias_off;
2607 : :
2608 : 3 : if (!validate_arglist (exp, REAL_TYPE,
2609 : : POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
2610 : : return NULL_RTX;
2611 : :
2612 : 3 : arg = CALL_EXPR_ARG (exp, 0);
2613 : 3 : sinp = CALL_EXPR_ARG (exp, 1);
2614 : 3 : cosp = CALL_EXPR_ARG (exp, 2);
2615 : :
2616 : : /* Make a suitable register to place result in. */
2617 : 3 : mode = TYPE_MODE (TREE_TYPE (arg));
2618 : :
2619 : : /* Check if sincos insn is available, otherwise emit the call. */
2620 : 3 : if (optab_handler (sincos_optab, mode) == CODE_FOR_nothing)
2621 : : return NULL_RTX;
2622 : :
2623 : 0 : target1 = gen_reg_rtx (mode);
2624 : 0 : target2 = gen_reg_rtx (mode);
2625 : :
2626 : 0 : op0 = expand_normal (arg);
2627 : 0 : alias_type = build_pointer_type_for_mode (TREE_TYPE (arg), ptr_mode, true);
2628 : 0 : alias_off = build_int_cst (alias_type, 0);
2629 : 0 : op1 = expand_normal (fold_build2_loc (loc, MEM_REF, TREE_TYPE (arg),
2630 : : sinp, alias_off));
2631 : 0 : op2 = expand_normal (fold_build2_loc (loc, MEM_REF, TREE_TYPE (arg),
2632 : : cosp, alias_off));
2633 : :
2634 : : /* Compute into target1 and target2.
2635 : : Set TARGET to wherever the result comes back. */
2636 : 0 : result = expand_twoval_unop (sincos_optab, op0, target2, target1, 0);
2637 : 0 : gcc_assert (result);
2638 : :
2639 : : /* Move target1 and target2 to the memory locations indicated
2640 : : by op1 and op2. */
2641 : 0 : emit_move_insn (op1, target1);
2642 : 0 : emit_move_insn (op2, target2);
2643 : :
2644 : 0 : return const0_rtx;
2645 : : }
2646 : :
2647 : : /* Expand call EXP to the fegetround builtin (from C99 fenv.h), returning the
2648 : : result and setting it in TARGET. Otherwise return NULL_RTX on failure. */
2649 : : static rtx
2650 : 60 : expand_builtin_fegetround (tree exp, rtx target, machine_mode target_mode)
2651 : : {
2652 : 60 : if (!validate_arglist (exp, VOID_TYPE))
2653 : : return NULL_RTX;
2654 : :
2655 : 60 : insn_code icode = direct_optab_handler (fegetround_optab, SImode);
2656 : 60 : if (icode == CODE_FOR_nothing)
2657 : : return NULL_RTX;
2658 : :
2659 : 0 : if (target == 0
2660 : 0 : || GET_MODE (target) != target_mode
2661 : 0 : || !(*insn_data[icode].operand[0].predicate) (target, target_mode))
2662 : 0 : target = gen_reg_rtx (target_mode);
2663 : :
2664 : 0 : rtx pat = GEN_FCN (icode) (target);
2665 : 0 : if (!pat)
2666 : : return NULL_RTX;
2667 : 0 : emit_insn (pat);
2668 : :
2669 : 0 : return target;
2670 : : }
2671 : :
2672 : : /* Expand call EXP to either feclearexcept or feraiseexcept builtins (from C99
2673 : : fenv.h), returning the result and setting it in TARGET. Otherwise return
2674 : : NULL_RTX on failure. */
2675 : : static rtx
2676 : 1894 : expand_builtin_feclear_feraise_except (tree exp, rtx target,
2677 : : machine_mode target_mode, optab op_optab)
2678 : : {
2679 : 1894 : if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
2680 : : return NULL_RTX;
2681 : 1894 : rtx op0 = expand_normal (CALL_EXPR_ARG (exp, 0));
2682 : :
2683 : 1894 : insn_code icode = direct_optab_handler (op_optab, SImode);
2684 : 1894 : if (icode == CODE_FOR_nothing)
2685 : : return NULL_RTX;
2686 : :
2687 : 0 : if (!(*insn_data[icode].operand[1].predicate) (op0, GET_MODE (op0)))
2688 : : return NULL_RTX;
2689 : :
2690 : 0 : if (target == 0
2691 : 0 : || GET_MODE (target) != target_mode
2692 : 0 : || !(*insn_data[icode].operand[0].predicate) (target, target_mode))
2693 : 0 : target = gen_reg_rtx (target_mode);
2694 : :
2695 : 0 : rtx pat = GEN_FCN (icode) (target, op0);
2696 : 0 : if (!pat)
2697 : : return NULL_RTX;
2698 : 0 : emit_insn (pat);
2699 : :
2700 : 0 : return target;
2701 : : }
2702 : :
2703 : : /* Expand a call to the internal cexpi builtin to the sincos math function.
2704 : : EXP is the expression that is a call to the builtin function; if convenient,
2705 : : the result should be placed in TARGET. */
2706 : :
2707 : : static rtx
2708 : 158 : expand_builtin_cexpi (tree exp, rtx target)
2709 : : {
2710 : 158 : tree fndecl = get_callee_fndecl (exp);
2711 : 158 : tree arg, type;
2712 : 158 : machine_mode mode;
2713 : 158 : rtx op0, op1, op2;
2714 : 158 : location_t loc = EXPR_LOCATION (exp);
2715 : :
2716 : 158 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2717 : : return NULL_RTX;
2718 : :
2719 : 158 : arg = CALL_EXPR_ARG (exp, 0);
2720 : 158 : type = TREE_TYPE (arg);
2721 : 158 : mode = TYPE_MODE (TREE_TYPE (arg));
2722 : :
2723 : : /* Try expanding via a sincos optab, fall back to emitting a libcall
2724 : : to sincos or cexp. We are sure we have sincos or cexp because cexpi
2725 : : is only generated from sincos, cexp or if we have either of them. */
2726 : 158 : if (optab_handler (sincos_optab, mode) != CODE_FOR_nothing)
2727 : : {
2728 : 6 : op1 = gen_reg_rtx (mode);
2729 : 6 : op2 = gen_reg_rtx (mode);
2730 : :
2731 : 6 : op0 = expand_expr (arg, NULL_RTX, VOIDmode, EXPAND_NORMAL);
2732 : :
2733 : : /* Compute into op1 and op2. */
2734 : 6 : expand_twoval_unop (sincos_optab, op0, op2, op1, 0);
2735 : : }
2736 : 152 : else if (targetm.libc_has_function (function_sincos, type))
2737 : : {
2738 : 152 : tree call, fn = NULL_TREE;
2739 : 152 : tree top1, top2;
2740 : 152 : rtx op1a, op2a;
2741 : :
2742 : 152 : if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2743 : 51 : fn = builtin_decl_explicit (BUILT_IN_SINCOSF);
2744 : 101 : else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2745 : 82 : fn = builtin_decl_explicit (BUILT_IN_SINCOS);
2746 : 19 : else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2747 : 19 : fn = builtin_decl_explicit (BUILT_IN_SINCOSL);
2748 : : else
2749 : 0 : gcc_unreachable ();
2750 : :
2751 : 152 : op1 = assign_temp (TREE_TYPE (arg), 1, 1);
2752 : 152 : op2 = assign_temp (TREE_TYPE (arg), 1, 1);
2753 : 152 : op1a = copy_addr_to_reg (XEXP (op1, 0));
2754 : 152 : op2a = copy_addr_to_reg (XEXP (op2, 0));
2755 : 152 : top1 = make_tree (build_pointer_type (TREE_TYPE (arg)), op1a);
2756 : 152 : top2 = make_tree (build_pointer_type (TREE_TYPE (arg)), op2a);
2757 : :
2758 : : /* Make sure not to fold the sincos call again. */
2759 : 152 : call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2760 : 152 : expand_normal (build_call_nary (TREE_TYPE (TREE_TYPE (fn)),
2761 : : call, 3, arg, top1, top2));
2762 : : }
2763 : : else
2764 : : {
2765 : 0 : tree call, fn = NULL_TREE, narg;
2766 : 0 : tree ctype = build_complex_type (type);
2767 : :
2768 : 0 : if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2769 : 0 : fn = builtin_decl_explicit (BUILT_IN_CEXPF);
2770 : 0 : else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2771 : 0 : fn = builtin_decl_explicit (BUILT_IN_CEXP);
2772 : 0 : else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2773 : 0 : fn = builtin_decl_explicit (BUILT_IN_CEXPL);
2774 : : else
2775 : 0 : gcc_unreachable ();
2776 : :
2777 : : /* If we don't have a decl for cexp create one. This is the
2778 : : friendliest fallback if the user calls __builtin_cexpi
2779 : : without full target C99 function support. */
2780 : 0 : if (fn == NULL_TREE)
2781 : : {
2782 : 0 : tree fntype;
2783 : 0 : const char *name = NULL;
2784 : :
2785 : 0 : if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2786 : : name = "cexpf";
2787 : 0 : else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2788 : : name = "cexp";
2789 : 0 : else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIL)
2790 : 0 : name = "cexpl";
2791 : :
2792 : 0 : fntype = build_function_type_list (ctype, ctype, NULL_TREE);
2793 : 0 : fn = build_fn_decl (name, fntype);
2794 : : }
2795 : :
2796 : 0 : narg = fold_build2_loc (loc, COMPLEX_EXPR, ctype,
2797 : : build_real (type, dconst0), arg);
2798 : :
2799 : : /* Make sure not to fold the cexp call again. */
2800 : 0 : call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2801 : 0 : return expand_expr (build_call_nary (ctype, call, 1, narg),
2802 : 0 : target, VOIDmode, EXPAND_NORMAL);
2803 : : }
2804 : :
2805 : : /* Now build the proper return type. */
2806 : 316 : return expand_expr (build2 (COMPLEX_EXPR, build_complex_type (type),
2807 : 158 : make_tree (TREE_TYPE (arg), op2),
2808 : 158 : make_tree (TREE_TYPE (arg), op1)),
2809 : 158 : target, VOIDmode, EXPAND_NORMAL);
2810 : : }
2811 : :
2812 : : /* Conveniently construct a function call expression. FNDECL names the
2813 : : function to be called, N is the number of arguments, and the "..."
2814 : : parameters are the argument expressions. Unlike build_call_exr
2815 : : this doesn't fold the call, hence it will always return a CALL_EXPR. */
2816 : :
2817 : : static tree
2818 : 136537 : build_call_nofold_loc (location_t loc, tree fndecl, int n, ...)
2819 : : {
2820 : 136537 : va_list ap;
2821 : 136537 : tree fntype = TREE_TYPE (fndecl);
2822 : 136537 : tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
2823 : :
2824 : 136537 : va_start (ap, n);
2825 : 136537 : fn = build_call_valist (TREE_TYPE (fntype), fn, n, ap);
2826 : 136537 : va_end (ap);
2827 : 136537 : SET_EXPR_LOCATION (fn, loc);
2828 : 136537 : return fn;
2829 : : }
2830 : :
2831 : : /* Expand the __builtin_issignaling builtin. This needs to handle
2832 : : all floating point formats that do support NaNs (for those that
2833 : : don't it just sets target to 0). */
2834 : :
2835 : : static rtx
2836 : 823 : expand_builtin_issignaling (tree exp, rtx target)
2837 : : {
2838 : 823 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2839 : : return NULL_RTX;
2840 : :
2841 : 823 : tree arg = CALL_EXPR_ARG (exp, 0);
2842 : 823 : scalar_float_mode fmode = SCALAR_FLOAT_TYPE_MODE (TREE_TYPE (arg));
2843 : 823 : const struct real_format *fmt = REAL_MODE_FORMAT (fmode);
2844 : :
2845 : : /* Expand the argument yielding a RTX expression. */
2846 : 823 : rtx temp = expand_normal (arg);
2847 : :
2848 : : /* If mode doesn't support NaN, always return 0.
2849 : : Don't use !HONOR_SNANS (fmode) here, so there is some possibility of
2850 : : __builtin_issignaling working without -fsignaling-nans. Especially
2851 : : when -fno-signaling-nans is the default.
2852 : : On the other side, MODE_HAS_NANS (fmode) is unnecessary, with
2853 : : -ffinite-math-only even __builtin_isnan or __builtin_fpclassify
2854 : : fold to 0 or non-NaN/Inf classification. */
2855 : 823 : if (!HONOR_NANS (fmode))
2856 : : {
2857 : 0 : emit_move_insn (target, const0_rtx);
2858 : 0 : return target;
2859 : : }
2860 : :
2861 : : /* Check if the back end provides an insn that handles issignaling for the
2862 : : argument's mode. */
2863 : 823 : enum insn_code icode = optab_handler (issignaling_optab, fmode);
2864 : 823 : if (icode != CODE_FOR_nothing)
2865 : : {
2866 : 155 : rtx_insn *last = get_last_insn ();
2867 : 155 : rtx this_target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
2868 : 155 : if (maybe_emit_unop_insn (icode, this_target, temp, UNKNOWN))
2869 : : return this_target;
2870 : 0 : delete_insns_since (last);
2871 : : }
2872 : :
2873 : 668 : if (DECIMAL_FLOAT_MODE_P (fmode))
2874 : : {
2875 : 63 : scalar_int_mode imode;
2876 : 63 : rtx hi;
2877 : 63 : switch (fmt->ieee_bits)
2878 : : {
2879 : 42 : case 32:
2880 : 42 : case 64:
2881 : 42 : imode = int_mode_for_mode (fmode).require ();
2882 : 42 : temp = gen_lowpart (imode, temp);
2883 : 42 : break;
2884 : 21 : case 128:
2885 : 21 : imode = int_mode_for_size (64, 1).require ();
2886 : 21 : hi = NULL_RTX;
2887 : : /* For decimal128, TImode support isn't always there and even when
2888 : : it is, working on the DImode high part is usually better. */
2889 : 21 : if (!MEM_P (temp))
2890 : : {
2891 : 6 : if (rtx t = force_highpart_subreg (imode, temp, fmode))
2892 : : hi = t;
2893 : : else
2894 : : {
2895 : 0 : scalar_int_mode imode2;
2896 : 0 : if (int_mode_for_mode (fmode).exists (&imode2))
2897 : : {
2898 : 0 : rtx temp2 = gen_lowpart (imode2, temp);
2899 : 0 : if (rtx t = force_highpart_subreg (imode, temp2, imode2))
2900 : : hi = t;
2901 : : }
2902 : : }
2903 : 0 : if (!hi)
2904 : : {
2905 : 0 : rtx mem = assign_stack_temp (fmode, GET_MODE_SIZE (fmode));
2906 : 0 : emit_move_insn (mem, temp);
2907 : 0 : temp = mem;
2908 : : }
2909 : : }
2910 : 0 : if (!hi)
2911 : : {
2912 : 15 : poly_int64 offset
2913 : 15 : = subreg_highpart_offset (imode, GET_MODE (temp));
2914 : 15 : hi = adjust_address (temp, imode, offset);
2915 : : }
2916 : : temp = hi;
2917 : : break;
2918 : 0 : default:
2919 : 0 : gcc_unreachable ();
2920 : : }
2921 : : /* In all of decimal{32,64,128}, there is MSB sign bit and sNaN
2922 : : have 6 bits below it all set. */
2923 : 63 : rtx val
2924 : 63 : = GEN_INT (HOST_WIDE_INT_C (0x3f) << (GET_MODE_BITSIZE (imode) - 7));
2925 : 63 : temp = expand_binop (imode, and_optab, temp, val,
2926 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
2927 : 63 : temp = emit_store_flag_force (target, EQ, temp, val, imode, 1, 1);
2928 : 63 : return temp;
2929 : : }
2930 : :
2931 : : /* Only PDP11 has these defined differently but doesn't support NaNs. */
2932 : 605 : gcc_assert (FLOAT_WORDS_BIG_ENDIAN == WORDS_BIG_ENDIAN);
2933 : 605 : gcc_assert (fmt->signbit_ro > 0 && fmt->b == 2);
2934 : 4235 : gcc_assert (MODE_COMPOSITE_P (fmode)
2935 : : || (fmt->pnan == fmt->p
2936 : : && fmt->signbit_ro == fmt->signbit_rw));
2937 : :
2938 : 605 : switch (fmt->p)
2939 : : {
2940 : 0 : case 106: /* IBM double double */
2941 : : /* For IBM double double, recurse on the most significant double. */
2942 : 0 : gcc_assert (MODE_COMPOSITE_P (fmode));
2943 : 0 : temp = convert_modes (DFmode, fmode, temp, 0);
2944 : 0 : fmode = DFmode;
2945 : 0 : fmt = REAL_MODE_FORMAT (DFmode);
2946 : : /* FALLTHRU */
2947 : 505 : case 8: /* bfloat */
2948 : 505 : case 11: /* IEEE half */
2949 : 505 : case 24: /* IEEE single */
2950 : 505 : case 53: /* IEEE double or Intel extended with rounding to double */
2951 : 505 : if (fmt->p == 53 && fmt->signbit_ro == 79)
2952 : 0 : goto extended;
2953 : 505 : {
2954 : 505 : scalar_int_mode imode = int_mode_for_mode (fmode).require ();
2955 : 505 : temp = gen_lowpart (imode, temp);
2956 : 505 : rtx val = GEN_INT ((HOST_WIDE_INT_M1U << (fmt->p - 2))
2957 : : & ~(HOST_WIDE_INT_M1U << fmt->signbit_ro));
2958 : 505 : if (fmt->qnan_msb_set)
2959 : : {
2960 : 505 : rtx mask = GEN_INT (~(HOST_WIDE_INT_M1U << fmt->signbit_ro));
2961 : 505 : rtx bit = GEN_INT (HOST_WIDE_INT_1U << (fmt->p - 2));
2962 : : /* For non-MIPS/PA IEEE single/double/half or bfloat, expand to:
2963 : : ((temp ^ bit) & mask) > val. */
2964 : 505 : temp = expand_binop (imode, xor_optab, temp, bit,
2965 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
2966 : 505 : temp = expand_binop (imode, and_optab, temp, mask,
2967 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
2968 : 505 : temp = emit_store_flag_force (target, GTU, temp, val, imode,
2969 : : 1, 1);
2970 : : }
2971 : : else
2972 : : {
2973 : : /* For MIPS/PA IEEE single/double, expand to:
2974 : : (temp & val) == val. */
2975 : 0 : temp = expand_binop (imode, and_optab, temp, val,
2976 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
2977 : 0 : temp = emit_store_flag_force (target, EQ, temp, val, imode,
2978 : : 1, 1);
2979 : : }
2980 : : }
2981 : : break;
2982 : 100 : case 113: /* IEEE quad */
2983 : 100 : {
2984 : 100 : rtx hi = NULL_RTX, lo = NULL_RTX;
2985 : 100 : scalar_int_mode imode = int_mode_for_size (64, 1).require ();
2986 : : /* For IEEE quad, TImode support isn't always there and even when
2987 : : it is, working on DImode parts is usually better. */
2988 : 100 : if (!MEM_P (temp))
2989 : : {
2990 : 85 : hi = force_highpart_subreg (imode, temp, fmode);
2991 : 85 : lo = force_lowpart_subreg (imode, temp, fmode);
2992 : 85 : if (!hi || !lo)
2993 : : {
2994 : 0 : scalar_int_mode imode2;
2995 : 0 : if (int_mode_for_mode (fmode).exists (&imode2))
2996 : : {
2997 : 0 : rtx temp2 = gen_lowpart (imode2, temp);
2998 : 0 : hi = force_highpart_subreg (imode, temp2, imode2);
2999 : 0 : lo = force_lowpart_subreg (imode, temp2, imode2);
3000 : : }
3001 : : }
3002 : 85 : if (!hi || !lo)
3003 : : {
3004 : 0 : rtx mem = assign_stack_temp (fmode, GET_MODE_SIZE (fmode));
3005 : 0 : emit_move_insn (mem, temp);
3006 : 0 : temp = mem;
3007 : : }
3008 : : }
3009 : 100 : if (!hi || !lo)
3010 : : {
3011 : 15 : poly_int64 offset
3012 : 15 : = subreg_highpart_offset (imode, GET_MODE (temp));
3013 : 15 : hi = adjust_address (temp, imode, offset);
3014 : 15 : offset = subreg_lowpart_offset (imode, GET_MODE (temp));
3015 : 15 : lo = adjust_address (temp, imode, offset);
3016 : : }
3017 : 100 : rtx val = GEN_INT ((HOST_WIDE_INT_M1U << (fmt->p - 2 - 64))
3018 : : & ~(HOST_WIDE_INT_M1U << (fmt->signbit_ro - 64)));
3019 : 100 : if (fmt->qnan_msb_set)
3020 : : {
3021 : 100 : rtx mask = GEN_INT (~(HOST_WIDE_INT_M1U << (fmt->signbit_ro
3022 : : - 64)));
3023 : 100 : rtx bit = GEN_INT (HOST_WIDE_INT_1U << (fmt->p - 2 - 64));
3024 : : /* For non-MIPS/PA IEEE quad, expand to:
3025 : : (((hi ^ bit) | ((lo | -lo) >> 63)) & mask) > val. */
3026 : 100 : rtx nlo = expand_unop (imode, neg_optab, lo, NULL_RTX, 0);
3027 : 100 : lo = expand_binop (imode, ior_optab, lo, nlo,
3028 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
3029 : 100 : lo = expand_shift (RSHIFT_EXPR, imode, lo, 63, NULL_RTX, 1);
3030 : 100 : temp = expand_binop (imode, xor_optab, hi, bit,
3031 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
3032 : 100 : temp = expand_binop (imode, ior_optab, temp, lo,
3033 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
3034 : 100 : temp = expand_binop (imode, and_optab, temp, mask,
3035 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
3036 : 100 : temp = emit_store_flag_force (target, GTU, temp, val, imode,
3037 : : 1, 1);
3038 : : }
3039 : : else
3040 : : {
3041 : : /* For MIPS/PA IEEE quad, expand to:
3042 : : (hi & val) == val. */
3043 : 0 : temp = expand_binop (imode, and_optab, hi, val,
3044 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
3045 : 0 : temp = emit_store_flag_force (target, EQ, temp, val, imode,
3046 : : 1, 1);
3047 : : }
3048 : : }
3049 : : break;
3050 : 0 : case 64: /* Intel or Motorola extended */
3051 : 0 : extended:
3052 : 0 : {
3053 : 0 : rtx ex, hi, lo;
3054 : 0 : scalar_int_mode imode = int_mode_for_size (32, 1).require ();
3055 : 0 : scalar_int_mode iemode = int_mode_for_size (16, 1).require ();
3056 : 0 : if (!MEM_P (temp))
3057 : : {
3058 : 0 : rtx mem = assign_stack_temp (fmode, GET_MODE_SIZE (fmode));
3059 : 0 : emit_move_insn (mem, temp);
3060 : 0 : temp = mem;
3061 : : }
3062 : 0 : if (fmt->signbit_ro == 95)
3063 : : {
3064 : : /* Motorola, always big endian, with 16-bit gap in between
3065 : : 16-bit sign+exponent and 64-bit mantissa. */
3066 : 0 : ex = adjust_address (temp, iemode, 0);
3067 : 0 : hi = adjust_address (temp, imode, 4);
3068 : 0 : lo = adjust_address (temp, imode, 8);
3069 : : }
3070 : 0 : else if (!WORDS_BIG_ENDIAN)
3071 : : {
3072 : : /* Intel little endian, 64-bit mantissa followed by 16-bit
3073 : : sign+exponent and then either 16 or 48 bits of gap. */
3074 : 0 : ex = adjust_address (temp, iemode, 8);
3075 : 0 : hi = adjust_address (temp, imode, 4);
3076 : 0 : lo = adjust_address (temp, imode, 0);
3077 : : }
3078 : : else
3079 : : {
3080 : : /* Big endian Itanium. */
3081 : : ex = adjust_address (temp, iemode, 0);
3082 : : hi = adjust_address (temp, imode, 2);
3083 : : lo = adjust_address (temp, imode, 6);
3084 : : }
3085 : 0 : rtx val = GEN_INT (HOST_WIDE_INT_M1U << 30);
3086 : 0 : gcc_assert (fmt->qnan_msb_set);
3087 : 0 : rtx mask = GEN_INT (0x7fff);
3088 : 0 : rtx bit = GEN_INT (HOST_WIDE_INT_1U << 30);
3089 : : /* For Intel/Motorola extended format, expand to:
3090 : : (ex & mask) == mask && ((hi ^ bit) | ((lo | -lo) >> 31)) > val. */
3091 : 0 : rtx nlo = expand_unop (imode, neg_optab, lo, NULL_RTX, 0);
3092 : 0 : lo = expand_binop (imode, ior_optab, lo, nlo,
3093 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
3094 : 0 : lo = expand_shift (RSHIFT_EXPR, imode, lo, 31, NULL_RTX, 1);
3095 : 0 : temp = expand_binop (imode, xor_optab, hi, bit,
3096 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
3097 : 0 : temp = expand_binop (imode, ior_optab, temp, lo,
3098 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
3099 : 0 : temp = emit_store_flag_force (target, GTU, temp, val, imode, 1, 1);
3100 : 0 : ex = expand_binop (iemode, and_optab, ex, mask,
3101 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
3102 : 0 : ex = emit_store_flag_force (gen_reg_rtx (GET_MODE (temp)), EQ,
3103 : : ex, mask, iemode, 1, 1);
3104 : 0 : temp = expand_binop (GET_MODE (temp), and_optab, temp, ex,
3105 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
3106 : : }
3107 : 0 : break;
3108 : 0 : default:
3109 : 0 : gcc_unreachable ();
3110 : : }
3111 : :
3112 : : return temp;
3113 : : }
3114 : :
3115 : : /* Expand a call to one of the builtin rounding functions gcc defines
3116 : : as an extension (lfloor and lceil). As these are gcc extensions we
3117 : : do not need to worry about setting errno to EDOM.
3118 : : If expanding via optab fails, lower expression to (int)(floor(x)).
3119 : : EXP is the expression that is a call to the builtin function;
3120 : : if convenient, the result should be placed in TARGET. */
3121 : :
3122 : : static rtx
3123 : 231 : expand_builtin_int_roundingfn (tree exp, rtx target)
3124 : : {
3125 : 231 : convert_optab builtin_optab;
3126 : 231 : rtx op0, tmp;
3127 : 231 : rtx_insn *insns;
3128 : 231 : tree fndecl = get_callee_fndecl (exp);
3129 : 231 : enum built_in_function fallback_fn;
3130 : 231 : tree fallback_fndecl;
3131 : 231 : machine_mode mode;
3132 : 231 : tree arg;
3133 : :
3134 : 231 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
3135 : : return NULL_RTX;
3136 : :
3137 : 231 : arg = CALL_EXPR_ARG (exp, 0);
3138 : :
3139 : 231 : switch (DECL_FUNCTION_CODE (fndecl))
3140 : : {
3141 : : CASE_FLT_FN (BUILT_IN_ICEIL):
3142 : : CASE_FLT_FN (BUILT_IN_LCEIL):
3143 : : CASE_FLT_FN (BUILT_IN_LLCEIL):
3144 : : builtin_optab = lceil_optab;
3145 : : fallback_fn = BUILT_IN_CEIL;
3146 : : break;
3147 : :
3148 : 116 : CASE_FLT_FN (BUILT_IN_IFLOOR):
3149 : 116 : CASE_FLT_FN (BUILT_IN_LFLOOR):
3150 : 116 : CASE_FLT_FN (BUILT_IN_LLFLOOR):
3151 : 116 : builtin_optab = lfloor_optab;
3152 : 116 : fallback_fn = BUILT_IN_FLOOR;
3153 : 116 : break;
3154 : :
3155 : 0 : default:
3156 : 0 : gcc_unreachable ();
3157 : : }
3158 : :
3159 : : /* Make a suitable register to place result in. */
3160 : 231 : mode = TYPE_MODE (TREE_TYPE (exp));
3161 : :
3162 : 231 : target = gen_reg_rtx (mode);
3163 : :
3164 : : /* Wrap the computation of the argument in a SAVE_EXPR, as we may
3165 : : need to expand the argument again. This way, we will not perform
3166 : : side-effects more the once. */
3167 : 231 : CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
3168 : :
3169 : 231 : op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
3170 : :
3171 : 231 : start_sequence ();
3172 : :
3173 : : /* Compute into TARGET. */
3174 : 231 : if (expand_sfix_optab (target, op0, builtin_optab))
3175 : : {
3176 : : /* Output the entire sequence. */
3177 : 40 : insns = end_sequence ();
3178 : 40 : emit_insn (insns);
3179 : 40 : return target;
3180 : : }
3181 : :
3182 : : /* If we were unable to expand via the builtin, stop the sequence
3183 : : (without outputting the insns). */
3184 : 191 : end_sequence ();
3185 : :
3186 : : /* Fall back to floating point rounding optab. */
3187 : 191 : fallback_fndecl = mathfn_built_in (TREE_TYPE (arg), fallback_fn);
3188 : :
3189 : : /* For non-C99 targets we may end up without a fallback fndecl here
3190 : : if the user called __builtin_lfloor directly. In this case emit
3191 : : a call to the floor/ceil variants nevertheless. This should result
3192 : : in the best user experience for not full C99 targets. */
3193 : 191 : if (fallback_fndecl == NULL_TREE)
3194 : : {
3195 : 0 : tree fntype;
3196 : 0 : const char *name = NULL;
3197 : :
3198 : 0 : switch (DECL_FUNCTION_CODE (fndecl))
3199 : : {
3200 : : case BUILT_IN_ICEIL:
3201 : : case BUILT_IN_LCEIL:
3202 : : case BUILT_IN_LLCEIL:
3203 : : name = "ceil";
3204 : : break;
3205 : 0 : case BUILT_IN_ICEILF:
3206 : 0 : case BUILT_IN_LCEILF:
3207 : 0 : case BUILT_IN_LLCEILF:
3208 : 0 : name = "ceilf";
3209 : 0 : break;
3210 : 0 : case BUILT_IN_ICEILL:
3211 : 0 : case BUILT_IN_LCEILL:
3212 : 0 : case BUILT_IN_LLCEILL:
3213 : 0 : name = "ceill";
3214 : 0 : break;
3215 : 0 : case BUILT_IN_IFLOOR:
3216 : 0 : case BUILT_IN_LFLOOR:
3217 : 0 : case BUILT_IN_LLFLOOR:
3218 : 0 : name = "floor";
3219 : 0 : break;
3220 : 0 : case BUILT_IN_IFLOORF:
3221 : 0 : case BUILT_IN_LFLOORF:
3222 : 0 : case BUILT_IN_LLFLOORF:
3223 : 0 : name = "floorf";
3224 : 0 : break;
3225 : 0 : case BUILT_IN_IFLOORL:
3226 : 0 : case BUILT_IN_LFLOORL:
3227 : 0 : case BUILT_IN_LLFLOORL:
3228 : 0 : name = "floorl";
3229 : 0 : break;
3230 : 0 : default:
3231 : 0 : gcc_unreachable ();
3232 : : }
3233 : :
3234 : 0 : fntype = build_function_type_list (TREE_TYPE (arg),
3235 : 0 : TREE_TYPE (arg), NULL_TREE);
3236 : 0 : fallback_fndecl = build_fn_decl (name, fntype);
3237 : : }
3238 : :
3239 : 191 : exp = build_call_nofold_loc (EXPR_LOCATION (exp), fallback_fndecl, 1, arg);
3240 : :
3241 : 191 : tmp = expand_normal (exp);
3242 : 191 : tmp = maybe_emit_group_store (tmp, TREE_TYPE (exp));
3243 : :
3244 : : /* Truncate the result of floating point optab to integer
3245 : : via expand_fix (). */
3246 : 191 : target = gen_reg_rtx (mode);
3247 : 191 : expand_fix (target, tmp, 0);
3248 : :
3249 : 191 : return target;
3250 : : }
3251 : :
3252 : : /* Expand a call to one of the builtin math functions doing integer
3253 : : conversion (lrint).
3254 : : Return 0 if a normal call should be emitted rather than expanding the
3255 : : function in-line. EXP is the expression that is a call to the builtin
3256 : : function; if convenient, the result should be placed in TARGET. */
3257 : :
3258 : : static rtx
3259 : 590 : expand_builtin_int_roundingfn_2 (tree exp, rtx target)
3260 : : {
3261 : 590 : convert_optab builtin_optab;
3262 : 590 : rtx op0;
3263 : 590 : rtx_insn *insns;
3264 : 590 : tree fndecl = get_callee_fndecl (exp);
3265 : 590 : tree arg;
3266 : 590 : machine_mode mode;
3267 : 590 : enum built_in_function fallback_fn = BUILT_IN_NONE;
3268 : :
3269 : 590 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
3270 : : return NULL_RTX;
3271 : :
3272 : 490 : arg = CALL_EXPR_ARG (exp, 0);
3273 : :
3274 : 490 : switch (DECL_FUNCTION_CODE (fndecl))
3275 : : {
3276 : 8 : CASE_FLT_FN (BUILT_IN_IRINT):
3277 : 8 : fallback_fn = BUILT_IN_LRINT;
3278 : : gcc_fallthrough ();
3279 : : CASE_FLT_FN (BUILT_IN_LRINT):
3280 : : CASE_FLT_FN (BUILT_IN_LLRINT):
3281 : : builtin_optab = lrint_optab;
3282 : : break;
3283 : :
3284 : 221 : CASE_FLT_FN (BUILT_IN_IROUND):
3285 : 221 : fallback_fn = BUILT_IN_LROUND;
3286 : : gcc_fallthrough ();
3287 : : CASE_FLT_FN (BUILT_IN_LROUND):
3288 : : CASE_FLT_FN (BUILT_IN_LLROUND):
3289 : : builtin_optab = lround_optab;
3290 : : break;
3291 : :
3292 : 0 : default:
3293 : 0 : gcc_unreachable ();
3294 : : }
3295 : :
3296 : : /* There's no easy way to detect the case we need to set EDOM. */
3297 : 490 : if (flag_errno_math && fallback_fn == BUILT_IN_NONE)
3298 : : return NULL_RTX;
3299 : :
3300 : : /* Make a suitable register to place result in. */
3301 : 259 : mode = TYPE_MODE (TREE_TYPE (exp));
3302 : :
3303 : : /* There's no easy way to detect the case we need to set EDOM. */
3304 : 259 : if (!flag_errno_math)
3305 : : {
3306 : 259 : rtx result = gen_reg_rtx (mode);
3307 : :
3308 : : /* Wrap the computation of the argument in a SAVE_EXPR, as we may
3309 : : need to expand the argument again. This way, we will not perform
3310 : : side-effects more the once. */
3311 : 259 : CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
3312 : :
3313 : 259 : op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
3314 : :
3315 : 259 : start_sequence ();
3316 : :
3317 : 259 : if (expand_sfix_optab (result, op0, builtin_optab))
3318 : : {
3319 : : /* Output the entire sequence. */
3320 : 24 : insns = end_sequence ();
3321 : 24 : emit_insn (insns);
3322 : 24 : return result;
3323 : : }
3324 : :
3325 : : /* If we were unable to expand via the builtin, stop the sequence
3326 : : (without outputting the insns) and call to the library function
3327 : : with the stabilized argument list. */
3328 : 235 : end_sequence ();
3329 : : }
3330 : :
3331 : 235 : if (fallback_fn != BUILT_IN_NONE)
3332 : : {
3333 : : /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
3334 : : targets, (int) round (x) should never be transformed into
3335 : : BUILT_IN_IROUND and if __builtin_iround is called directly, emit
3336 : : a call to lround in the hope that the target provides at least some
3337 : : C99 functions. This should result in the best user experience for
3338 : : not full C99 targets.
3339 : : As scalar float conversions with same mode are useless in GIMPLE,
3340 : : we can end up e.g. with _Float32 argument passed to float builtin,
3341 : : try to get the type from the builtin prototype first. */
3342 : 221 : tree fallback_fndecl = NULL_TREE;
3343 : 221 : if (tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (fndecl)))
3344 : 221 : fallback_fndecl
3345 : 221 : = mathfn_built_in_1 (TREE_VALUE (argtypes),
3346 : : as_combined_fn (fallback_fn), 0);
3347 : 221 : if (fallback_fndecl == NULL_TREE)
3348 : 0 : fallback_fndecl
3349 : 0 : = mathfn_built_in_1 (TREE_TYPE (arg),
3350 : : as_combined_fn (fallback_fn), 0);
3351 : 0 : if (fallback_fndecl)
3352 : : {
3353 : 221 : exp = build_call_nofold_loc (EXPR_LOCATION (exp),
3354 : : fallback_fndecl, 1, arg);
3355 : :
3356 : 221 : target = expand_call (exp, NULL_RTX, target == const0_rtx);
3357 : 221 : target = maybe_emit_group_store (target, TREE_TYPE (exp));
3358 : 221 : return convert_to_mode (mode, target, 0);
3359 : : }
3360 : : }
3361 : :
3362 : 14 : return expand_call (exp, target, target == const0_rtx);
3363 : : }
3364 : :
3365 : : /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
3366 : : a normal call should be emitted rather than expanding the function
3367 : : in-line. EXP is the expression that is a call to the builtin
3368 : : function; if convenient, the result should be placed in TARGET. */
3369 : :
3370 : : static rtx
3371 : 279 : expand_builtin_powi (tree exp, rtx target)
3372 : : {
3373 : 279 : tree arg0, arg1;
3374 : 279 : rtx op0, op1;
3375 : 279 : machine_mode mode;
3376 : 279 : machine_mode mode2;
3377 : :
3378 : 279 : if (! validate_arglist (exp, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
3379 : : return NULL_RTX;
3380 : :
3381 : 279 : arg0 = CALL_EXPR_ARG (exp, 0);
3382 : 279 : arg1 = CALL_EXPR_ARG (exp, 1);
3383 : 279 : mode = TYPE_MODE (TREE_TYPE (exp));
3384 : :
3385 : : /* Emit a libcall to libgcc. */
3386 : :
3387 : : /* Mode of the 2nd argument must match that of an int. */
3388 : 279 : mode2 = int_mode_for_size (INT_TYPE_SIZE, 0).require ();
3389 : :
3390 : 279 : if (target == NULL_RTX)
3391 : 0 : target = gen_reg_rtx (mode);
3392 : :
3393 : 279 : op0 = expand_expr (arg0, NULL_RTX, mode, EXPAND_NORMAL);
3394 : 279 : if (GET_MODE (op0) != mode)
3395 : 0 : op0 = convert_to_mode (mode, op0, 0);
3396 : 279 : op1 = expand_expr (arg1, NULL_RTX, mode2, EXPAND_NORMAL);
3397 : 279 : if (GET_MODE (op1) != mode2)
3398 : 39 : op1 = convert_to_mode (mode2, op1, 0);
3399 : :
3400 : 279 : target = emit_library_call_value (optab_libfunc (powi_optab, mode),
3401 : : target, LCT_CONST, mode,
3402 : : op0, mode, op1, mode2);
3403 : :
3404 : 279 : return target;
3405 : : }
3406 : :
3407 : : /* Expand expression EXP which is a call to the strlen builtin. Return
3408 : : NULL_RTX if we failed and the caller should emit a normal call, otherwise
3409 : : try to get the result in TARGET, if convenient. */
3410 : :
3411 : : static rtx
3412 : 13542 : expand_builtin_strlen (tree exp, rtx target,
3413 : : machine_mode target_mode)
3414 : : {
3415 : 13542 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
3416 : : return NULL_RTX;
3417 : :
3418 : 13522 : tree src = CALL_EXPR_ARG (exp, 0);
3419 : :
3420 : : /* If the length can be computed at compile-time, return it. */
3421 : 13522 : if (tree len = c_strlen (src, 0))
3422 : 177 : return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3423 : :
3424 : : /* If the length can be computed at compile-time and is constant
3425 : : integer, but there are side-effects in src, evaluate
3426 : : src for side-effects, then return len.
3427 : : E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
3428 : : can be optimized into: i++; x = 3; */
3429 : 13345 : tree len = c_strlen (src, 1);
3430 : 13345 : if (len && TREE_CODE (len) == INTEGER_CST)
3431 : : {
3432 : 0 : expand_expr (src, const0_rtx, VOIDmode, EXPAND_NORMAL);
3433 : 0 : return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3434 : : }
3435 : :
3436 : 13345 : unsigned int align = get_pointer_alignment (src) / BITS_PER_UNIT;
3437 : :
3438 : : /* If SRC is not a pointer type, don't do this operation inline. */
3439 : 13345 : if (align == 0)
3440 : : return NULL_RTX;
3441 : :
3442 : : /* Bail out if we can't compute strlen in the right mode. */
3443 : : machine_mode insn_mode;
3444 : : enum insn_code icode = CODE_FOR_nothing;
3445 : 13345 : FOR_EACH_MODE_FROM (insn_mode, target_mode)
3446 : : {
3447 : 13345 : icode = optab_handler (strlen_optab, insn_mode);
3448 : 13345 : if (icode != CODE_FOR_nothing)
3449 : : break;
3450 : : }
3451 : 13345 : if (insn_mode == VOIDmode)
3452 : : return NULL_RTX;
3453 : :
3454 : : /* Make a place to hold the source address. We will not expand
3455 : : the actual source until we are sure that the expansion will
3456 : : not fail -- there are trees that cannot be expanded twice. */
3457 : 13919 : rtx src_reg = gen_reg_rtx (Pmode);
3458 : :
3459 : : /* Mark the beginning of the strlen sequence so we can emit the
3460 : : source operand later. */
3461 : 13345 : rtx_insn *before_strlen = get_last_insn ();
3462 : :
3463 : 13345 : class expand_operand ops[4];
3464 : 13345 : create_output_operand (&ops[0], target, insn_mode);
3465 : 13345 : create_fixed_operand (&ops[1], gen_rtx_MEM (BLKmode, src_reg));
3466 : 13345 : create_integer_operand (&ops[2], 0);
3467 : 13345 : create_integer_operand (&ops[3], align);
3468 : 13345 : if (!maybe_expand_insn (icode, 4, ops))
3469 : : return NULL_RTX;
3470 : :
3471 : : /* Check to see if the argument was declared attribute nonstring
3472 : : and if so, issue a warning since at this point it's not known
3473 : : to be nul-terminated. */
3474 : 11 : maybe_warn_nonstring_arg (get_callee_fndecl (exp), exp);
3475 : :
3476 : : /* Now that we are assured of success, expand the source. */
3477 : 11 : start_sequence ();
3478 : 15 : rtx pat = expand_expr (src, src_reg, Pmode, EXPAND_NORMAL);
3479 : 11 : if (pat != src_reg)
3480 : : {
3481 : : #ifdef POINTERS_EXTEND_UNSIGNED
3482 : 15 : if (GET_MODE (pat) != Pmode)
3483 : 0 : pat = convert_to_mode (Pmode, pat,
3484 : : POINTERS_EXTEND_UNSIGNED);
3485 : : #endif
3486 : 11 : emit_move_insn (src_reg, pat);
3487 : : }
3488 : 11 : pat = end_sequence ();
3489 : :
3490 : 11 : if (before_strlen)
3491 : 11 : emit_insn_after (pat, before_strlen);
3492 : : else
3493 : 0 : emit_insn_before (pat, get_insns ());
3494 : :
3495 : : /* Return the value in the proper mode for this function. */
3496 : 11 : if (GET_MODE (ops[0].value) == target_mode)
3497 : : target = ops[0].value;
3498 : 0 : else if (target != 0)
3499 : 0 : convert_move (target, ops[0].value, 0);
3500 : : else
3501 : 0 : target = convert_to_mode (target_mode, ops[0].value, 0);
3502 : :
3503 : : return target;
3504 : : }
3505 : :
3506 : : /* Expand call EXP to the strnlen built-in, returning the result
3507 : : and setting it in TARGET. Otherwise return NULL_RTX on failure. */
3508 : :
3509 : : static rtx
3510 : 580 : expand_builtin_strnlen (tree exp, rtx target, machine_mode target_mode)
3511 : : {
3512 : 580 : if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3513 : : return NULL_RTX;
3514 : :
3515 : 571 : tree src = CALL_EXPR_ARG (exp, 0);
3516 : 571 : tree bound = CALL_EXPR_ARG (exp, 1);
3517 : :
3518 : 571 : if (!bound)
3519 : : return NULL_RTX;
3520 : :
3521 : 571 : location_t loc = UNKNOWN_LOCATION;
3522 : 571 : if (EXPR_HAS_LOCATION (exp))
3523 : 571 : loc = EXPR_LOCATION (exp);
3524 : :
3525 : : /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
3526 : : so these conversions aren't necessary. */
3527 : 571 : c_strlen_data lendata = { };
3528 : 571 : tree len = c_strlen (src, 0, &lendata, 1);
3529 : 571 : if (len)
3530 : 102 : len = fold_convert_loc (loc, TREE_TYPE (bound), len);
3531 : :
3532 : 571 : if (TREE_CODE (bound) == INTEGER_CST)
3533 : : {
3534 : 331 : if (!len)
3535 : : return NULL_RTX;
3536 : :
3537 : 62 : len = fold_build2_loc (loc, MIN_EXPR, size_type_node, len, bound);
3538 : 62 : return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3539 : : }
3540 : :
3541 : 240 : if (TREE_CODE (bound) != SSA_NAME)
3542 : : return NULL_RTX;
3543 : :
3544 : 240 : wide_int min, max;
3545 : 240 : int_range_max r;
3546 : 480 : get_range_query (cfun)->range_of_expr (r, bound,
3547 : : currently_expanding_gimple_stmt);
3548 : 240 : if (r.varying_p () || r.undefined_p ())
3549 : : return NULL_RTX;
3550 : 135 : min = r.lower_bound ();
3551 : 135 : max = r.upper_bound ();
3552 : :
3553 : 135 : if (!len || TREE_CODE (len) != INTEGER_CST)
3554 : : {
3555 : 95 : bool exact;
3556 : 95 : lendata.decl = unterminated_array (src, &len, &exact);
3557 : 95 : if (!lendata.decl)
3558 : 75 : return NULL_RTX;
3559 : : }
3560 : :
3561 : 60 : if (lendata.decl)
3562 : : return NULL_RTX;
3563 : :
3564 : 40 : if (wi::gtu_p (min, wi::to_wide (len)))
3565 : 7 : return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3566 : :
3567 : 33 : len = fold_build2_loc (loc, MIN_EXPR, TREE_TYPE (len), len, bound);
3568 : 33 : return expand_expr (len, target, target_mode, EXPAND_NORMAL);
3569 : 240 : }
3570 : :
3571 : : /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3572 : : bytes from bytes at DATA + OFFSET and return it reinterpreted as
3573 : : a target constant. */
3574 : :
3575 : : static rtx
3576 : 158685 : builtin_memcpy_read_str (void *data, void *, HOST_WIDE_INT offset,
3577 : : fixed_size_mode mode)
3578 : : {
3579 : : /* The REPresentation pointed to by DATA need not be a nul-terminated
3580 : : string but the caller guarantees it's large enough for MODE. */
3581 : 158685 : const char *rep = (const char *) data;
3582 : :
3583 : 158685 : return c_readstr (rep + offset, mode, /*nul_terminated=*/false);
3584 : : }
3585 : :
3586 : : /* LEN specify length of the block of memcpy/memset operation.
3587 : : Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3588 : : In some cases we can make very likely guess on max size, then we
3589 : : set it into PROBABLE_MAX_SIZE. */
3590 : :
3591 : : static void
3592 : 174150 : determine_block_size (tree len, rtx len_rtx,
3593 : : unsigned HOST_WIDE_INT *min_size,
3594 : : unsigned HOST_WIDE_INT *max_size,
3595 : : unsigned HOST_WIDE_INT *probable_max_size)
3596 : : {
3597 : 174150 : if (CONST_INT_P (len_rtx))
3598 : : {
3599 : 91992 : *min_size = *max_size = *probable_max_size = UINTVAL (len_rtx);
3600 : 91992 : return;
3601 : : }
3602 : : else
3603 : : {
3604 : 82158 : wide_int min, max;
3605 : 82158 : enum value_range_kind range_type = VR_UNDEFINED;
3606 : :
3607 : : /* Determine bounds from the type. */
3608 : 82158 : if (tree_fits_uhwi_p (TYPE_MIN_VALUE (TREE_TYPE (len))))
3609 : 82157 : *min_size = tree_to_uhwi (TYPE_MIN_VALUE (TREE_TYPE (len)));
3610 : : else
3611 : 1 : *min_size = 0;
3612 : 82158 : if (tree_fits_uhwi_p (TYPE_MAX_VALUE (TREE_TYPE (len))))
3613 : 164316 : *probable_max_size = *max_size
3614 : 82158 : = tree_to_uhwi (TYPE_MAX_VALUE (TREE_TYPE (len)));
3615 : : else
3616 : 0 : *probable_max_size = *max_size = GET_MODE_MASK (GET_MODE (len_rtx));
3617 : :
3618 : 82158 : if (TREE_CODE (len) == SSA_NAME)
3619 : : {
3620 : 82158 : int_range_max r;
3621 : 82158 : tree tmin, tmax;
3622 : 82158 : gimple *cg = currently_expanding_gimple_stmt;
3623 : 164316 : get_range_query (cfun)->range_of_expr (r, len, cg);
3624 : 82158 : range_type = get_legacy_range (r, tmin, tmax);
3625 : 82158 : if (range_type != VR_UNDEFINED)
3626 : : {
3627 : 82158 : min = wi::to_wide (tmin);
3628 : 82158 : max = wi::to_wide (tmax);
3629 : : }
3630 : 82158 : }
3631 : 82158 : if (range_type == VR_RANGE)
3632 : : {
3633 : 60815 : if (wi::fits_uhwi_p (min) && *min_size < min.to_uhwi ())
3634 : 49354 : *min_size = min.to_uhwi ();
3635 : 60815 : if (wi::fits_uhwi_p (max) && *max_size > max.to_uhwi ())
3636 : 51361 : *probable_max_size = *max_size = max.to_uhwi ();
3637 : : }
3638 : 21343 : else if (range_type == VR_ANTI_RANGE)
3639 : : {
3640 : : /* Code like
3641 : :
3642 : : int n;
3643 : : if (n < 100)
3644 : : memcpy (a, b, n)
3645 : :
3646 : : Produce anti range allowing negative values of N. We still
3647 : : can use the information and make a guess that N is not negative.
3648 : : */
3649 : 3745 : if (!wi::leu_p (max, 1 << 30) && wi::fits_uhwi_p (min))
3650 : 3666 : *probable_max_size = min.to_uhwi () - 1;
3651 : : }
3652 : 82158 : }
3653 : 82158 : gcc_checking_assert (*max_size <=
3654 : : (unsigned HOST_WIDE_INT)
3655 : : GET_MODE_MASK (GET_MODE (len_rtx)));
3656 : : }
3657 : :
3658 : : /* Expand a call EXP to the memcpy builtin.
3659 : : Return NULL_RTX if we failed, the caller should emit a normal call,
3660 : : otherwise try to get the result in TARGET, if convenient (and in
3661 : : mode MODE if that's convenient). */
3662 : :
3663 : : static rtx
3664 : 91928 : expand_builtin_memcpy (tree exp, rtx target)
3665 : : {
3666 : 91928 : if (!validate_arglist (exp,
3667 : : POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3668 : : return NULL_RTX;
3669 : :
3670 : 91910 : tree dest = CALL_EXPR_ARG (exp, 0);
3671 : 91910 : tree src = CALL_EXPR_ARG (exp, 1);
3672 : 91910 : tree len = CALL_EXPR_ARG (exp, 2);
3673 : :
3674 : 91910 : return expand_builtin_memory_copy_args (dest, src, len, target, exp,
3675 : 91910 : /*retmode=*/ RETURN_BEGIN, false);
3676 : : }
3677 : :
3678 : : /* Check a call EXP to the memmove built-in for validity.
3679 : : Return NULL_RTX on both success and failure. */
3680 : :
3681 : : static rtx
3682 : 16120 : expand_builtin_memmove (tree exp, rtx target)
3683 : : {
3684 : 16120 : if (!validate_arglist (exp,
3685 : : POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3686 : : return NULL_RTX;
3687 : :
3688 : 16105 : tree dest = CALL_EXPR_ARG (exp, 0);
3689 : 16105 : tree src = CALL_EXPR_ARG (exp, 1);
3690 : 16105 : tree len = CALL_EXPR_ARG (exp, 2);
3691 : :
3692 : 16105 : return expand_builtin_memory_copy_args (dest, src, len, target, exp,
3693 : 16105 : /*retmode=*/ RETURN_BEGIN, true);
3694 : : }
3695 : :
3696 : : /* Expand a call EXP to the mempcpy builtin.
3697 : : Return NULL_RTX if we failed; the caller should emit a normal call,
3698 : : otherwise try to get the result in TARGET, if convenient (and in
3699 : : mode MODE if that's convenient). */
3700 : :
3701 : : static rtx
3702 : 1637 : expand_builtin_mempcpy (tree exp, rtx target)
3703 : : {
3704 : 1637 : if (!validate_arglist (exp,
3705 : : POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3706 : : return NULL_RTX;
3707 : :
3708 : 1632 : tree dest = CALL_EXPR_ARG (exp, 0);
3709 : 1632 : tree src = CALL_EXPR_ARG (exp, 1);
3710 : 1632 : tree len = CALL_EXPR_ARG (exp, 2);
3711 : :
3712 : : /* Policy does not generally allow using compute_objsize (which
3713 : : is used internally by check_memop_size) to change code generation
3714 : : or drive optimization decisions.
3715 : :
3716 : : In this instance it is safe because the code we generate has
3717 : : the same semantics regardless of the return value of
3718 : : check_memop_sizes. Exactly the same amount of data is copied
3719 : : and the return value is exactly the same in both cases.
3720 : :
3721 : : Furthermore, check_memop_size always uses mode 0 for the call to
3722 : : compute_objsize, so the imprecise nature of compute_objsize is
3723 : : avoided. */
3724 : :
3725 : : /* Avoid expanding mempcpy into memcpy when the call is determined
3726 : : to overflow the buffer. This also prevents the same overflow
3727 : : from being diagnosed again when expanding memcpy. */
3728 : :
3729 : 1632 : return expand_builtin_mempcpy_args (dest, src, len,
3730 : 1632 : target, exp, /*retmode=*/ RETURN_END);
3731 : : }
3732 : :
3733 : : /* Helper function to do the actual work for expand of memory copy family
3734 : : functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3735 : : of memory from SRC to DEST and assign to TARGET if convenient. Return
3736 : : value is based on RETMODE argument. */
3737 : :
3738 : : static rtx
3739 : 109670 : expand_builtin_memory_copy_args (tree dest, tree src, tree len,
3740 : : rtx target, tree exp, memop_ret retmode,
3741 : : bool might_overlap)
3742 : : {
3743 : 109670 : unsigned int src_align = get_pointer_alignment (src);
3744 : 109670 : unsigned int dest_align = get_pointer_alignment (dest);
3745 : 109670 : rtx dest_mem, src_mem, dest_addr, len_rtx;
3746 : 109670 : HOST_WIDE_INT expected_size = -1;
3747 : 109670 : unsigned int expected_align = 0;
3748 : 109670 : unsigned HOST_WIDE_INT min_size;
3749 : 109670 : unsigned HOST_WIDE_INT max_size;
3750 : 109670 : unsigned HOST_WIDE_INT probable_max_size;
3751 : :
3752 : 109670 : bool is_move_done;
3753 : :
3754 : : /* If DEST is not a pointer type, call the normal function. */
3755 : 109670 : if (dest_align == 0)
3756 : : return NULL_RTX;
3757 : :
3758 : : /* If either SRC is not a pointer type, don't do this
3759 : : operation in-line. */
3760 : 109670 : if (src_align == 0)
3761 : : return NULL_RTX;
3762 : :
3763 : 109670 : if (currently_expanding_gimple_stmt)
3764 : 109670 : stringop_block_profile (currently_expanding_gimple_stmt,
3765 : : &expected_align, &expected_size);
3766 : :
3767 : 109670 : if (expected_align < dest_align)
3768 : 109657 : expected_align = dest_align;
3769 : 109670 : dest_mem = get_memory_rtx (dest, len);
3770 : 109670 : set_mem_align (dest_mem, dest_align);
3771 : 109670 : len_rtx = expand_normal (len);
3772 : 109670 : determine_block_size (len, len_rtx, &min_size, &max_size,
3773 : : &probable_max_size);
3774 : :
3775 : : /* Try to get the byte representation of the constant SRC points to,
3776 : : with its byte size in NBYTES. */
3777 : 109670 : unsigned HOST_WIDE_INT nbytes;
3778 : 109670 : const char *rep = getbyterep (src, &nbytes);
3779 : :
3780 : : /* If the function's constant bound LEN_RTX is less than or equal
3781 : : to the byte size of the representation of the constant argument,
3782 : : and if block move would be done by pieces, we can avoid loading
3783 : : the bytes from memory and only store the computed constant.
3784 : : This works in the overlap (memmove) case as well because
3785 : : store_by_pieces just generates a series of stores of constants
3786 : : from the representation returned by getbyterep(). */
3787 : 109670 : if (rep
3788 : 28436 : && CONST_INT_P (len_rtx)
3789 : 26914 : && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= nbytes
3790 : 136584 : && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3791 : : CONST_CAST (char *, rep),
3792 : : dest_align, false))
3793 : : {
3794 : 26446 : dest_mem = store_by_pieces (dest_mem, INTVAL (len_rtx),
3795 : : builtin_memcpy_read_str,
3796 : : CONST_CAST (char *, rep),
3797 : : dest_align, false, retmode);
3798 : 26446 : dest_mem = force_operand (XEXP (dest_mem, 0), target);
3799 : 26446 : dest_mem = convert_memory_address (ptr_mode, dest_mem);
3800 : 26446 : return dest_mem;
3801 : : }
3802 : :
3803 : 83224 : src_mem = get_memory_rtx (src, len);
3804 : 83224 : set_mem_align (src_mem, src_align);
3805 : :
3806 : : /* Copy word part most expediently. */
3807 : 83224 : enum block_op_methods method = BLOCK_OP_NORMAL;
3808 : 83224 : if (CALL_EXPR_TAILCALL (exp)
3809 : 83224 : && (retmode == RETURN_BEGIN || target == const0_rtx))
3810 : : method = BLOCK_OP_TAILCALL;
3811 : 83224 : bool use_mempcpy_call = (targetm.libc_has_fast_function (BUILT_IN_MEMPCPY)
3812 : 83224 : && retmode == RETURN_END
3813 : 83224 : && !might_overlap
3814 : 84526 : && target != const0_rtx);
3815 : : if (use_mempcpy_call)
3816 : 83224 : method = BLOCK_OP_NO_LIBCALL_RET;
3817 : 83224 : dest_addr = emit_block_move_hints (dest_mem, src_mem, len_rtx, method,
3818 : : expected_align, expected_size,
3819 : : min_size, max_size, probable_max_size,
3820 : : use_mempcpy_call, &is_move_done,
3821 : : might_overlap, tree_ctz (len));
3822 : :
3823 : : /* Bail out when a mempcpy call would be expanded as libcall and when
3824 : : we have a target that provides a fast implementation
3825 : : of mempcpy routine. */
3826 : 83224 : if (!is_move_done)
3827 : : return NULL_RTX;
3828 : :
3829 : 67329 : if (dest_addr == pc_rtx)
3830 : : return NULL_RTX;
3831 : :
3832 : 67329 : if (dest_addr == 0)
3833 : : {
3834 : 26383 : dest_addr = force_operand (XEXP (dest_mem, 0), target);
3835 : 26383 : dest_addr = convert_memory_address (ptr_mode, dest_addr);
3836 : : }
3837 : :
3838 : 67329 : if (retmode != RETURN_BEGIN && target != const0_rtx)
3839 : : {
3840 : 810 : dest_addr = gen_rtx_PLUS (ptr_mode, dest_addr, len_rtx);
3841 : : /* stpcpy pointer to last byte. */
3842 : 810 : if (retmode == RETURN_END_MINUS_ONE)
3843 : 0 : dest_addr = gen_rtx_MINUS (ptr_mode, dest_addr, const1_rtx);
3844 : : }
3845 : :
3846 : : return dest_addr;
3847 : : }
3848 : :
3849 : : static rtx
3850 : 1655 : expand_builtin_mempcpy_args (tree dest, tree src, tree len,
3851 : : rtx target, tree orig_exp, memop_ret retmode)
3852 : : {
3853 : 1632 : return expand_builtin_memory_copy_args (dest, src, len, target, orig_exp,
3854 : 0 : retmode, false);
3855 : : }
3856 : :
3857 : : /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3858 : : we failed, the caller should emit a normal call, otherwise try to
3859 : : get the result in TARGET, if convenient.
3860 : : Return value is based on RETMODE argument. */
3861 : :
3862 : : static rtx
3863 : 2269 : expand_movstr (tree dest, tree src, rtx target, memop_ret retmode)
3864 : : {
3865 : 2269 : class expand_operand ops[3];
3866 : 2269 : rtx dest_mem;
3867 : 2269 : rtx src_mem;
3868 : :
3869 : 2269 : if (!targetm.have_movstr ())
3870 : : return NULL_RTX;
3871 : :
3872 : 0 : dest_mem = get_memory_rtx (dest, NULL);
3873 : 0 : src_mem = get_memory_rtx (src, NULL);
3874 : 0 : if (retmode == RETURN_BEGIN)
3875 : : {
3876 : 0 : target = force_reg (Pmode, XEXP (dest_mem, 0));
3877 : 0 : dest_mem = replace_equiv_address (dest_mem, target);
3878 : : }
3879 : :
3880 : 0 : create_output_operand (&ops[0],
3881 : 0 : retmode != RETURN_BEGIN ? target : NULL_RTX, Pmode);
3882 : 0 : create_fixed_operand (&ops[1], dest_mem);
3883 : 0 : create_fixed_operand (&ops[2], src_mem);
3884 : 0 : if (!maybe_expand_insn (targetm.code_for_movstr, 3, ops))
3885 : : return NULL_RTX;
3886 : :
3887 : 0 : if (retmode != RETURN_BEGIN && target != const0_rtx)
3888 : : {
3889 : 0 : target = ops[0].value;
3890 : : /* movstr is supposed to set end to the address of the NUL
3891 : : terminator. If the caller requested a mempcpy-like return value,
3892 : : adjust it. */
3893 : 0 : if (retmode == RETURN_END)
3894 : : {
3895 : 0 : rtx tem = plus_constant (GET_MODE (target),
3896 : 0 : gen_lowpart (GET_MODE (target), target), 1);
3897 : 0 : emit_move_insn (target, force_operand (tem, NULL_RTX));
3898 : : }
3899 : : }
3900 : : return target;
3901 : : }
3902 : :
3903 : : /* Expand expression EXP, which is a call to the strcpy builtin. Return
3904 : : NULL_RTX if we failed the caller should emit a normal call, otherwise
3905 : : try to get the result in TARGET, if convenient (and in mode MODE if that's
3906 : : convenient). */
3907 : :
3908 : : static rtx
3909 : 1862 : expand_builtin_strcpy (tree exp, rtx target)
3910 : : {
3911 : 1862 : if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3912 : : return NULL_RTX;
3913 : :
3914 : 1847 : tree dest = CALL_EXPR_ARG (exp, 0);
3915 : 1847 : tree src = CALL_EXPR_ARG (exp, 1);
3916 : :
3917 : 1847 : return expand_builtin_strcpy_args (exp, dest, src, target);
3918 : : }
3919 : :
3920 : : /* Helper function to do the actual work for expand_builtin_strcpy. The
3921 : : arguments to the builtin_strcpy call DEST and SRC are broken out
3922 : : so that this can also be called without constructing an actual CALL_EXPR.
3923 : : The other arguments and return value are the same as for
3924 : : expand_builtin_strcpy. */
3925 : :
3926 : : static rtx
3927 : 1847 : expand_builtin_strcpy_args (tree, tree dest, tree src, rtx target)
3928 : : {
3929 : 1847 : return expand_movstr (dest, src, target, /*retmode=*/ RETURN_BEGIN);
3930 : : }
3931 : :
3932 : : /* Expand a call EXP to the stpcpy builtin.
3933 : : Return NULL_RTX if we failed the caller should emit a normal call,
3934 : : otherwise try to get the result in TARGET, if convenient (and in
3935 : : mode MODE if that's convenient). */
3936 : :
3937 : : static rtx
3938 : 454 : expand_builtin_stpcpy_1 (tree exp, rtx target, machine_mode mode)
3939 : : {
3940 : 454 : tree dst, src;
3941 : 454 : location_t loc = EXPR_LOCATION (exp);
3942 : :
3943 : 454 : if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3944 : : return NULL_RTX;
3945 : :
3946 : 445 : dst = CALL_EXPR_ARG (exp, 0);
3947 : 445 : src = CALL_EXPR_ARG (exp, 1);
3948 : :
3949 : : /* If return value is ignored, transform stpcpy into strcpy. */
3950 : 445 : if (target == const0_rtx && builtin_decl_implicit (BUILT_IN_STRCPY))
3951 : : {
3952 : 0 : tree fn = builtin_decl_implicit (BUILT_IN_STRCPY);
3953 : 0 : tree result = build_call_nofold_loc (loc, fn, 2, dst, src);
3954 : 0 : return expand_expr (result, target, mode, EXPAND_NORMAL);
3955 : : }
3956 : : else
3957 : : {
3958 : 445 : tree len, lenp1;
3959 : 445 : rtx ret;
3960 : :
3961 : : /* Ensure we get an actual string whose length can be evaluated at
3962 : : compile-time, not an expression containing a string. This is
3963 : : because the latter will potentially produce pessimized code
3964 : : when used to produce the return value. */
3965 : 445 : c_strlen_data lendata = { };
3966 : 445 : if (!c_getstr (src)
3967 : 445 : || !(len = c_strlen (src, 0, &lendata, 1)))
3968 : 422 : return expand_movstr (dst, src, target,
3969 : 422 : /*retmode=*/ RETURN_END_MINUS_ONE);
3970 : :
3971 : 23 : lenp1 = size_binop_loc (loc, PLUS_EXPR, len, ssize_int (1));
3972 : 23 : ret = expand_builtin_mempcpy_args (dst, src, lenp1,
3973 : : target, exp,
3974 : : /*retmode=*/ RETURN_END_MINUS_ONE);
3975 : :
3976 : 23 : if (ret)
3977 : : return ret;
3978 : :
3979 : 0 : if (TREE_CODE (len) == INTEGER_CST)
3980 : : {
3981 : 0 : rtx len_rtx = expand_normal (len);
3982 : :
3983 : 0 : if (CONST_INT_P (len_rtx))
3984 : : {
3985 : 0 : ret = expand_builtin_strcpy_args (exp, dst, src, target);
3986 : :
3987 : 0 : if (ret)
3988 : : {
3989 : 0 : if (! target)
3990 : : {
3991 : 0 : if (mode != VOIDmode)
3992 : 0 : target = gen_reg_rtx (mode);
3993 : : else
3994 : 0 : target = gen_reg_rtx (GET_MODE (ret));
3995 : : }
3996 : 0 : if (GET_MODE (target) != GET_MODE (ret))
3997 : 0 : ret = gen_lowpart (GET_MODE (target), ret);
3998 : :
3999 : 0 : ret = plus_constant (GET_MODE (ret), ret, INTVAL (len_rtx));
4000 : 0 : ret = emit_move_insn (target, force_operand (ret, NULL_RTX));
4001 : 0 : gcc_assert (ret);
4002 : :
4003 : : return target;
4004 : : }
4005 : : }
4006 : : }
4007 : :
4008 : 0 : return expand_movstr (dst, src, target,
4009 : 0 : /*retmode=*/ RETURN_END_MINUS_ONE);
4010 : : }
4011 : : }
4012 : :
4013 : : /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
4014 : : arguments while being careful to avoid duplicate warnings (which could
4015 : : be issued if the expander were to expand the call, resulting in it
4016 : : being emitted in expand_call(). */
4017 : :
4018 : : static rtx
4019 : 454 : expand_builtin_stpcpy (tree exp, rtx target, machine_mode mode)
4020 : : {
4021 : 454 : if (rtx ret = expand_builtin_stpcpy_1 (exp, target, mode))
4022 : : {
4023 : : /* The call has been successfully expanded. Check for nonstring
4024 : : arguments and issue warnings as appropriate. */
4025 : 23 : maybe_warn_nonstring_arg (get_callee_fndecl (exp), exp);
4026 : 23 : return ret;
4027 : : }
4028 : :
4029 : : return NULL_RTX;
4030 : : }
4031 : :
4032 : : /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4033 : : bytes from constant string DATA + OFFSET and return it as target
4034 : : constant. */
4035 : :
4036 : : rtx
4037 : 9310 : builtin_strncpy_read_str (void *data, void *, HOST_WIDE_INT offset,
4038 : : fixed_size_mode mode)
4039 : : {
4040 : 9310 : const char *str = (const char *) data;
4041 : :
4042 : 9310 : if ((unsigned HOST_WIDE_INT) offset > strlen (str))
4043 : 260 : return const0_rtx;
4044 : :
4045 : 9050 : return c_readstr (str + offset, mode);
4046 : : }
4047 : :
4048 : : /* Helper to check the sizes of sequences and the destination of calls
4049 : : to __builtin_strncat and __builtin___strncat_chk. Returns true on
4050 : : success (no overflow or invalid sizes), false otherwise. */
4051 : :
4052 : : static bool
4053 : 109 : check_strncat_sizes (tree exp, tree objsize)
4054 : : {
4055 : 109 : tree dest = CALL_EXPR_ARG (exp, 0);
4056 : 109 : tree src = CALL_EXPR_ARG (exp, 1);
4057 : 109 : tree maxread = CALL_EXPR_ARG (exp, 2);
4058 : :
4059 : : /* Try to determine the range of lengths that the source expression
4060 : : refers to. */
4061 : 109 : c_strlen_data lendata = { };
4062 : 109 : get_range_strlen (src, &lendata, /* eltsize = */ 1);
4063 : :
4064 : : /* Try to verify that the destination is big enough for the shortest
4065 : : string. */
4066 : :
4067 : 109 : access_data data (nullptr, exp, access_read_write, maxread, true);
4068 : 109 : if (!objsize && warn_stringop_overflow)
4069 : : {
4070 : : /* If it hasn't been provided by __strncat_chk, try to determine
4071 : : the size of the destination object into which the source is
4072 : : being copied. */
4073 : 0 : objsize = compute_objsize (dest, warn_stringop_overflow - 1, &data.dst);
4074 : : }
4075 : :
4076 : : /* Add one for the terminating nul. */
4077 : 109 : tree srclen = (lendata.minlen
4078 : 109 : ? fold_build2 (PLUS_EXPR, size_type_node, lendata.minlen,
4079 : : size_one_node)
4080 : : : NULL_TREE);
4081 : :
4082 : : /* The strncat function copies at most MAXREAD bytes and always appends
4083 : : the terminating nul so the specified upper bound should never be equal
4084 : : to (or greater than) the size of the destination. */
4085 : 56 : if (tree_fits_uhwi_p (maxread) && tree_fits_uhwi_p (objsize)
4086 : 157 : && tree_int_cst_equal (objsize, maxread))
4087 : : {
4088 : 23 : location_t loc = EXPR_LOCATION (exp);
4089 : 23 : warning_at (loc, OPT_Wstringop_overflow_,
4090 : : "%qD specified bound %E equals destination size",
4091 : : get_callee_fndecl (exp), maxread);
4092 : :
4093 : 23 : return false;
4094 : : }
4095 : :
4096 : 86 : if (!srclen
4097 : 86 : || (maxread && tree_fits_uhwi_p (maxread)
4098 : 33 : && tree_fits_uhwi_p (srclen)
4099 : 33 : && tree_int_cst_lt (maxread, srclen)))
4100 : : srclen = maxread;
4101 : :
4102 : : /* The number of bytes to write is LEN but check_access will alsoa
4103 : : check SRCLEN if LEN's value isn't known. */
4104 : 86 : return check_access (exp, /*dstwrite=*/NULL_TREE, maxread, srclen,
4105 : 86 : objsize, data.mode, &data);
4106 : : }
4107 : :
4108 : : /* Expand expression EXP, which is a call to the strncpy builtin. Return
4109 : : NULL_RTX if we failed the caller should emit a normal call. */
4110 : :
4111 : : static rtx
4112 : 2168 : expand_builtin_strncpy (tree exp, rtx target)
4113 : : {
4114 : 2168 : location_t loc = EXPR_LOCATION (exp);
4115 : :
4116 : 2168 : if (!validate_arglist (exp,
4117 : : POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4118 : : return NULL_RTX;
4119 : 2156 : tree dest = CALL_EXPR_ARG (exp, 0);
4120 : 2156 : tree src = CALL_EXPR_ARG (exp, 1);
4121 : : /* The number of bytes to write (not the maximum). */
4122 : 2156 : tree len = CALL_EXPR_ARG (exp, 2);
4123 : :
4124 : : /* The length of the source sequence. */
4125 : 2156 : tree slen = c_strlen (src, 1);
4126 : :
4127 : : /* We must be passed a constant len and src parameter. */
4128 : 2156 : if (!tree_fits_uhwi_p (len) || !slen || !tree_fits_uhwi_p (slen))
4129 : : return NULL_RTX;
4130 : :
4131 : 237 : slen = size_binop_loc (loc, PLUS_EXPR, slen, ssize_int (1));
4132 : :
4133 : : /* We're required to pad with trailing zeros if the requested
4134 : : len is greater than strlen(s2)+1. In that case try to
4135 : : use store_by_pieces, if it fails, punt. */
4136 : 237 : if (tree_int_cst_lt (slen, len))
4137 : : {
4138 : 142 : unsigned int dest_align = get_pointer_alignment (dest);
4139 : 142 : const char *p = c_getstr (src);
4140 : 142 : rtx dest_mem;
4141 : :
4142 : 136 : if (!p || dest_align == 0 || !tree_fits_uhwi_p (len)
4143 : 278 : || !can_store_by_pieces (tree_to_uhwi (len),
4144 : : builtin_strncpy_read_str,
4145 : : CONST_CAST (char *, p),
4146 : : dest_align, false))
4147 : 14 : return NULL_RTX;
4148 : :
4149 : 128 : dest_mem = get_memory_rtx (dest, len);
4150 : 128 : store_by_pieces (dest_mem, tree_to_uhwi (len),
4151 : : builtin_strncpy_read_str,
4152 : : CONST_CAST (char *, p), dest_align, false,
4153 : : RETURN_BEGIN);
4154 : 128 : dest_mem = force_operand (XEXP (dest_mem, 0), target);
4155 : 128 : dest_mem = convert_memory_address (ptr_mode, dest_mem);
4156 : 128 : return dest_mem;
4157 : : }
4158 : :
4159 : : return NULL_RTX;
4160 : : }
4161 : :
4162 : : /* Return the RTL of a register in MODE generated from PREV in the
4163 : : previous iteration. */
4164 : :
4165 : : static rtx
4166 : 257021 : gen_memset_value_from_prev (by_pieces_prev *prev, fixed_size_mode mode)
4167 : : {
4168 : 257021 : rtx target = nullptr;
4169 : 257021 : if (prev != nullptr && prev->data != nullptr)
4170 : : {
4171 : : /* Use the previous data in the same mode. */
4172 : 145566 : if (prev->mode == mode)
4173 : 257021 : return prev->data;
4174 : :
4175 : 35182 : fixed_size_mode prev_mode = prev->mode;
4176 : :
4177 : : /* Don't use the previous data to write QImode if it is in a
4178 : : vector mode. */
4179 : 35182 : if (VECTOR_MODE_P (prev_mode) && mode == QImode)
4180 : : return target;
4181 : :
4182 : 34914 : rtx prev_rtx = prev->data;
4183 : :
4184 : 34914 : if (REG_P (prev_rtx)
4185 : 22880 : && HARD_REGISTER_P (prev_rtx)
4186 : 34914 : && lowpart_subreg_regno (REGNO (prev_rtx), prev_mode, mode) < 0)
4187 : : {
4188 : : /* This case occurs when PREV_MODE is a vector and when
4189 : : MODE is too small to store using vector operations.
4190 : : After register allocation, the code will need to move the
4191 : : lowpart of the vector register into a non-vector register.
4192 : :
4193 : : Also, the target has chosen to use a hard register
4194 : : instead of going with the default choice of using a
4195 : : pseudo register. We should respect that choice and try to
4196 : : avoid creating a pseudo register with the same mode as the
4197 : : current hard register.
4198 : :
4199 : : In principle, we could just use a lowpart MODE subreg of
4200 : : the vector register. However, the vector register mode might
4201 : : be too wide for non-vector registers, and we already know
4202 : : that the non-vector mode is too small for vector registers.
4203 : : It's therefore likely that we'd need to spill to memory in
4204 : : the vector mode and reload the non-vector value from there.
4205 : :
4206 : : Try to avoid that by reducing the vector register to the
4207 : : smallest size that it can hold. This should increase the
4208 : : chances that non-vector registers can hold both the inner
4209 : : and outer modes of the subreg that we generate later. */
4210 : 0 : machine_mode m;
4211 : 0 : fixed_size_mode candidate;
4212 : 0 : FOR_EACH_MODE_IN_CLASS (m, GET_MODE_CLASS (mode))
4213 : 0 : if (is_a<fixed_size_mode> (m, &candidate))
4214 : : {
4215 : 0 : if (GET_MODE_SIZE (candidate)
4216 : 0 : >= GET_MODE_SIZE (prev_mode))
4217 : : break;
4218 : 0 : if (GET_MODE_SIZE (candidate) >= GET_MODE_SIZE (mode)
4219 : 0 : && lowpart_subreg_regno (REGNO (prev_rtx),
4220 : : prev_mode, candidate) >= 0)
4221 : : {
4222 : 0 : target = lowpart_subreg (candidate, prev_rtx,
4223 : : prev_mode);
4224 : 0 : prev_rtx = target;
4225 : 0 : prev_mode = candidate;
4226 : 0 : break;
4227 : : }
4228 : : }
4229 : 0 : if (target == nullptr)
4230 : 0 : prev_rtx = copy_to_reg (prev_rtx);
4231 : : }
4232 : :
4233 : 34914 : target = lowpart_subreg (mode, prev_rtx, prev_mode);
4234 : : }
4235 : : return target;
4236 : : }
4237 : :
4238 : : /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4239 : : bytes from constant string DATA + OFFSET and return it as target
4240 : : constant. If PREV isn't nullptr, it has the RTL info from the
4241 : : previous iteration. */
4242 : :
4243 : : rtx
4244 : 255711 : builtin_memset_read_str (void *data, void *prev,
4245 : : HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
4246 : : fixed_size_mode mode)
4247 : : {
4248 : 255711 : const char *c = (const char *) data;
4249 : 255711 : unsigned int size = GET_MODE_SIZE (mode);
4250 : :
4251 : 255711 : rtx target = gen_memset_value_from_prev ((by_pieces_prev *) prev,
4252 : : mode);
4253 : 255711 : if (target != nullptr)
4254 : : return target;
4255 : 110993 : rtx src = gen_int_mode (*c, QImode);
4256 : :
4257 : 110993 : if (VECTOR_MODE_P (mode))
4258 : : {
4259 : 154472 : gcc_assert (GET_MODE_INNER (mode) == QImode);
4260 : :
4261 : 77236 : rtx const_vec = gen_const_vec_duplicate (mode, src);
4262 : 77236 : if (prev == NULL)
4263 : : /* Return CONST_VECTOR when called by a query function. */
4264 : : return const_vec;
4265 : :
4266 : : /* Use the move expander with CONST_VECTOR. */
4267 : 61337 : target = gen_reg_rtx (mode);
4268 : 61337 : emit_move_insn (target, const_vec);
4269 : 61337 : return target;
4270 : : }
4271 : :
4272 : 33757 : char *p = XALLOCAVEC (char, size);
4273 : :
4274 : 33757 : memset (p, *c, size);
4275 : :
4276 : 33757 : return c_readstr (p, mode);
4277 : : }
4278 : :
4279 : : /* Callback routine for store_by_pieces. Return the RTL of a register
4280 : : containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4281 : : char value given in the RTL register data. For example, if mode is
4282 : : 4 bytes wide, return the RTL for 0x01010101*data. If PREV isn't
4283 : : nullptr, it has the RTL info from the previous iteration. */
4284 : :
4285 : : static rtx
4286 : 1479 : builtin_memset_gen_str (void *data, void *prev,
4287 : : HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
4288 : : fixed_size_mode mode)
4289 : : {
4290 : 1479 : rtx target, coeff;
4291 : 1479 : size_t size;
4292 : 1479 : char *p;
4293 : :
4294 : 1479 : size = GET_MODE_SIZE (mode);
4295 : 1479 : if (size == 1)
4296 : : return (rtx) data;
4297 : :
4298 : 1310 : target = gen_memset_value_from_prev ((by_pieces_prev *) prev, mode);
4299 : 1310 : if (target != nullptr)
4300 : : return target;
4301 : :
4302 : 730 : if (VECTOR_MODE_P (mode))
4303 : : {
4304 : 448 : gcc_assert (GET_MODE_INNER (mode) == QImode);
4305 : :
4306 : : /* vec_duplicate_optab is a precondition to pick a vector mode for
4307 : : the memset expander. */
4308 : 224 : insn_code icode = optab_handler (vec_duplicate_optab, mode);
4309 : :
4310 : 224 : target = gen_reg_rtx (mode);
4311 : 224 : class expand_operand ops[2];
4312 : 224 : create_output_operand (&ops[0], target, mode);
4313 : 224 : create_input_operand (&ops[1], (rtx) data, QImode);
4314 : 224 : expand_insn (icode, 2, ops);
4315 : 224 : if (!rtx_equal_p (target, ops[0].value))
4316 : 0 : emit_move_insn (target, ops[0].value);
4317 : :
4318 : 224 : return target;
4319 : : }
4320 : :
4321 : 506 : p = XALLOCAVEC (char, size);
4322 : 506 : memset (p, 1, size);
4323 : 506 : coeff = c_readstr (p, mode);
4324 : :
4325 : 506 : target = convert_to_mode (mode, (rtx) data, 1);
4326 : 506 : target = expand_mult (mode, target, coeff, NULL_RTX, 1);
4327 : 506 : return force_reg (mode, target);
4328 : : }
4329 : :
4330 : : /* Expand expression EXP, which is a call to the memset builtin. Return
4331 : : NULL_RTX if we failed the caller should emit a normal call, otherwise
4332 : : try to get the result in TARGET, if convenient (and in mode MODE if that's
4333 : : convenient). */
4334 : :
4335 : : rtx
4336 : 64489 : expand_builtin_memset (tree exp, rtx target, machine_mode mode)
4337 : : {
4338 : 64489 : if (!validate_arglist (exp,
4339 : : POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
4340 : : return NULL_RTX;
4341 : :
4342 : 64480 : tree dest = CALL_EXPR_ARG (exp, 0);
4343 : 64480 : tree val = CALL_EXPR_ARG (exp, 1);
4344 : 64480 : tree len = CALL_EXPR_ARG (exp, 2);
4345 : :
4346 : 64480 : return expand_builtin_memset_args (dest, val, len, target, mode, exp);
4347 : : }
4348 : :
4349 : : /* Check that store_by_pieces allows BITS + LEN (so that we don't
4350 : : expand something too unreasonably long), and every power of 2 in
4351 : : BITS. It is assumed that LEN has already been tested by
4352 : : itself. */
4353 : : static bool
4354 : 25264 : can_store_by_multiple_pieces (unsigned HOST_WIDE_INT bits,
4355 : : by_pieces_constfn constfun,
4356 : : void *constfundata, unsigned int align,
4357 : : bool memsetp,
4358 : : unsigned HOST_WIDE_INT len)
4359 : : {
4360 : 25264 : if (bits
4361 : 25264 : && !can_store_by_pieces (bits + len, constfun, constfundata,
4362 : : align, memsetp))
4363 : : return false;
4364 : :
4365 : : /* BITS set are expected to be generally in the low range and
4366 : : contiguous. We do NOT want to repeat the test above in case BITS
4367 : : has a single bit set, so we terminate the loop when BITS == BIT.
4368 : : In the unlikely case that BITS has the MSB set, also terminate in
4369 : : case BIT gets shifted out. */
4370 : 1116 : for (unsigned HOST_WIDE_INT bit = 1; bit < bits && bit; bit <<= 1)
4371 : : {
4372 : 840 : if ((bits & bit) == 0)
4373 : 504 : continue;
4374 : :
4375 : 336 : if (!can_store_by_pieces (bit, constfun, constfundata,
4376 : : align, memsetp))
4377 : : return false;
4378 : : }
4379 : :
4380 : : return true;
4381 : : }
4382 : :
4383 : : /* Try to store VAL (or, if NULL_RTX, VALC) in LEN bytes starting at TO.
4384 : : Return TRUE if successful, FALSE otherwise. TO is assumed to be
4385 : : aligned at an ALIGN-bits boundary. LEN must be a multiple of
4386 : : 1<<CTZ_LEN between MIN_LEN and MAX_LEN.
4387 : :
4388 : : The strategy is to issue one store_by_pieces for each power of two,
4389 : : from most to least significant, guarded by a test on whether there
4390 : : are at least that many bytes left to copy in LEN.
4391 : :
4392 : : ??? Should we skip some powers of two in favor of loops? Maybe start
4393 : : at the max of TO/LEN/word alignment, at least when optimizing for
4394 : : size, instead of ensuring O(log len) dynamic compares? */
4395 : :
4396 : : bool
4397 : 23564 : try_store_by_multiple_pieces (rtx to, rtx len, unsigned int ctz_len,
4398 : : unsigned HOST_WIDE_INT min_len,
4399 : : unsigned HOST_WIDE_INT max_len,
4400 : : rtx val, char valc, unsigned int align)
4401 : : {
4402 : 23564 : int max_bits = floor_log2 (max_len);
4403 : 23564 : int min_bits = floor_log2 (min_len);
4404 : 23564 : int sctz_len = ctz_len;
4405 : :
4406 : 23564 : gcc_checking_assert (sctz_len >= 0);
4407 : :
4408 : 23564 : if (val)
4409 : 516 : valc = 1;
4410 : :
4411 : : /* Bits more significant than TST_BITS are part of the shared prefix
4412 : : in the binary representation of both min_len and max_len. Since
4413 : : they're identical, we don't need to test them in the loop. */
4414 : 23564 : int tst_bits = (max_bits != min_bits ? max_bits
4415 : 10780 : : floor_log2 (max_len ^ min_len));
4416 : :
4417 : : /* Save the pre-blksize values. */
4418 : 23564 : int orig_max_bits = max_bits;
4419 : 23564 : int orig_tst_bits = tst_bits;
4420 : :
4421 : : /* Check whether it's profitable to start by storing a fixed BLKSIZE
4422 : : bytes, to lower max_bits. In the unlikely case of a constant LEN
4423 : : (implied by identical MAX_LEN and MIN_LEN), we want to issue a
4424 : : single store_by_pieces, but otherwise, select the minimum multiple
4425 : : of the ALIGN (in bytes) and of the MCD of the possible LENs, that
4426 : : brings MAX_LEN below TST_BITS, if that's lower than min_len. */
4427 : 23564 : unsigned HOST_WIDE_INT blksize;
4428 : 23564 : if (max_len > min_len)
4429 : : {
4430 : 12797 : unsigned HOST_WIDE_INT alrng = MAX (HOST_WIDE_INT_1U << ctz_len,
4431 : : align / BITS_PER_UNIT);
4432 : 12797 : blksize = max_len - (HOST_WIDE_INT_1U << tst_bits) + alrng;
4433 : 12797 : blksize &= ~(alrng - 1);
4434 : : }
4435 : 10767 : else if (max_len == min_len)
4436 : : blksize = max_len;
4437 : : else
4438 : : /* Huh, max_len < min_len? Punt. See pr100843.c. */
4439 : : return false;
4440 : 23563 : if (min_len >= blksize
4441 : : /* ??? Maybe try smaller fixed-prefix blksizes before
4442 : : punting? */
4443 : 23563 : && can_store_by_pieces (blksize, builtin_memset_read_str,
4444 : : &valc, align, true))
4445 : : {
4446 : 280 : min_len -= blksize;
4447 : 280 : min_bits = floor_log2 (min_len);
4448 : 280 : max_len -= blksize;
4449 : 280 : max_bits = floor_log2 (max_len);
4450 : :
4451 : 280 : tst_bits = (max_bits != min_bits ? max_bits
4452 : 169 : : floor_log2 (max_len ^ min_len));
4453 : : }
4454 : : else
4455 : : blksize = 0;
4456 : :
4457 : : /* Check that we can use store by pieces for the maximum store count
4458 : : we may issue (initial fixed-size block, plus conditional
4459 : : power-of-two-sized from max_bits to ctz_len. */
4460 : 23563 : unsigned HOST_WIDE_INT xlenest = blksize;
4461 : 23563 : if (max_bits >= 0)
4462 : 23394 : xlenest += ((HOST_WIDE_INT_1U << max_bits) * 2
4463 : 23394 : - (HOST_WIDE_INT_1U << ctz_len));
4464 : 23563 : bool max_loop = false;
4465 : 23563 : bool use_store_by_pieces = true;
4466 : : /* Skip the test in case of overflow in xlenest. It shouldn't
4467 : : happen because of the way max_bits and blksize are related, but
4468 : : it doesn't hurt to test. */
4469 : 23563 : if (blksize > xlenest
4470 : 23563 : || !can_store_by_multiple_pieces (xlenest - blksize,
4471 : : builtin_memset_read_str,
4472 : : &valc, align, true, blksize))
4473 : : {
4474 : 23394 : if (!(flag_inline_stringops & ILSOP_MEMSET))
4475 : : return false;
4476 : :
4477 : 1601 : for (max_bits = orig_max_bits;
4478 : 1708 : max_bits >= sctz_len;
4479 : : --max_bits)
4480 : : {
4481 : 1708 : xlenest = ((HOST_WIDE_INT_1U << max_bits) * 2
4482 : 1708 : - (HOST_WIDE_INT_1U << ctz_len));
4483 : : /* Check that blksize plus the bits to be stored as blocks
4484 : : sized at powers of two can be stored by pieces. This is
4485 : : like the test above, but with smaller max_bits. Skip
4486 : : orig_max_bits (it would be redundant). Also skip in case
4487 : : of overflow. */
4488 : 1708 : if (max_bits < orig_max_bits
4489 : 1601 : && xlenest + blksize >= xlenest
4490 : 3309 : && can_store_by_multiple_pieces (xlenest,
4491 : : builtin_memset_read_str,
4492 : : &valc, align, true, blksize))
4493 : : {
4494 : : max_loop = true;
4495 : : break;
4496 : : }
4497 : 1601 : if (blksize
4498 : 1601 : && can_store_by_multiple_pieces (xlenest,
4499 : : builtin_memset_read_str,
4500 : : &valc, align, true, 0))
4501 : : {
4502 : 0 : max_len += blksize;
4503 : 0 : min_len += blksize;
4504 : 0 : tst_bits = orig_tst_bits;
4505 : 0 : blksize = 0;
4506 : 0 : max_loop = true;
4507 : 0 : break;
4508 : : }
4509 : 1601 : if (max_bits == sctz_len)
4510 : : {
4511 : : /* We'll get here if can_store_by_pieces refuses to
4512 : : store even a single QImode. We'll fall back to
4513 : : QImode stores then. */
4514 : 98 : if (!sctz_len)
4515 : : {
4516 : : blksize = 0;
4517 : : max_loop = true;
4518 : : use_store_by_pieces = false;
4519 : : break;
4520 : : }
4521 : 98 : --sctz_len;
4522 : 98 : --ctz_len;
4523 : : }
4524 : : }
4525 : 107 : if (!max_loop)
4526 : : return false;
4527 : : /* If the boundaries are such that min and max may run a
4528 : : different number of trips in the initial loop, the remainder
4529 : : needs not be between the moduli, so set tst_bits to cover all
4530 : : bits. Otherwise, if the trip counts are the same, max_len
4531 : : has the common prefix, and the previously-computed tst_bits
4532 : : is usable. */
4533 : 107 : if (max_len >> max_bits > min_len >> max_bits)
4534 : 64 : tst_bits = max_bits;
4535 : : }
4536 : :
4537 : 276 : by_pieces_constfn constfun;
4538 : 276 : void *constfundata;
4539 : 276 : if (val)
4540 : : {
4541 : 1 : constfun = builtin_memset_gen_str;
4542 : 1 : constfundata = val = force_reg (TYPE_MODE (unsigned_char_type_node),
4543 : : val);
4544 : : }
4545 : : else
4546 : : {
4547 : : constfun = builtin_memset_read_str;
4548 : : constfundata = &valc;
4549 : : }
4550 : :
4551 : 276 : rtx ptr = copy_addr_to_reg (XEXP (to, 0));
4552 : 276 : rtx rem = copy_to_mode_reg (ptr_mode, convert_to_mode (ptr_mode, len, 0));
4553 : 276 : to = replace_equiv_address (to, ptr);
4554 : 276 : set_mem_align (to, align);
4555 : :
4556 : 276 : if (blksize)
4557 : : {
4558 : 356 : to = store_by_pieces (to, blksize,
4559 : : constfun, constfundata,
4560 : : align, true,
4561 : : max_len != 0 ? RETURN_END : RETURN_BEGIN);
4562 : 188 : if (max_len == 0)
4563 : : return true;
4564 : :
4565 : : /* Adjust PTR, TO and REM. Since TO's address is likely
4566 : : PTR+offset, we have to replace it. */
4567 : 20 : emit_move_insn (ptr, force_operand (XEXP (to, 0), NULL_RTX));
4568 : 20 : to = replace_equiv_address (to, ptr);
4569 : 20 : rtx rem_minus_blksize = plus_constant (ptr_mode, rem, -blksize);
4570 : 20 : emit_move_insn (rem, force_operand (rem_minus_blksize, NULL_RTX));
4571 : : }
4572 : :
4573 : : /* Iterate over power-of-two block sizes from the maximum length to
4574 : : the least significant bit possibly set in the length. */
4575 : 493 : for (int i = max_bits; i >= sctz_len; i--)
4576 : : {
4577 : 385 : rtx_code_label *loop_label = NULL;
4578 : 385 : rtx_code_label *label = NULL;
4579 : :
4580 : 385 : blksize = HOST_WIDE_INT_1U << i;
4581 : :
4582 : : /* If we're past the bits shared between min_ and max_len, expand
4583 : : a test on the dynamic length, comparing it with the
4584 : : BLKSIZE. */
4585 : 385 : if (i <= tst_bits)
4586 : : {
4587 : 275 : label = gen_label_rtx ();
4588 : 275 : emit_cmp_and_jump_insns (rem, GEN_INT (blksize), LT, NULL,
4589 : : ptr_mode, 1, label,
4590 : : profile_probability::even ());
4591 : : }
4592 : : /* If we are at a bit that is in the prefix shared by min_ and
4593 : : max_len, skip the current BLKSIZE if the bit is clear, but do
4594 : : not skip the loop, even if it doesn't require
4595 : : prechecking. */
4596 : 110 : else if ((max_len & blksize) == 0
4597 : 69 : && !(max_loop && i == max_bits))
4598 : 39 : continue;
4599 : :
4600 : 346 : if (max_loop && i == max_bits)
4601 : : {
4602 : 107 : loop_label = gen_label_rtx ();
4603 : 107 : emit_label (loop_label);
4604 : : /* Since we may run this multiple times, don't assume we
4605 : : know anything about the offset. */
4606 : 107 : clear_mem_offset (to);
4607 : : }
4608 : :
4609 : 346 : bool update_needed = i != sctz_len || loop_label;
4610 : 346 : rtx next_ptr = NULL_RTX;
4611 : 346 : if (!use_store_by_pieces)
4612 : : {
4613 : 0 : gcc_checking_assert (blksize == 1);
4614 : 0 : if (!val)
4615 : 0 : val = gen_int_mode (valc, QImode);
4616 : 0 : to = change_address (to, QImode, 0);
4617 : 0 : emit_move_insn (to, val);
4618 : 0 : if (update_needed)
4619 : 0 : next_ptr = plus_constant (GET_MODE (ptr), ptr, blksize);
4620 : : }
4621 : : else
4622 : : {
4623 : : /* Issue a store of BLKSIZE bytes. */
4624 : 404 : to = store_by_pieces (to, blksize,
4625 : : constfun, constfundata,
4626 : : align, true,
4627 : : update_needed ? RETURN_END : RETURN_BEGIN);
4628 : 346 : next_ptr = XEXP (to, 0);
4629 : : }
4630 : : /* Adjust REM and PTR, unless this is the last iteration. */
4631 : 346 : if (update_needed)
4632 : : {
4633 : 288 : emit_move_insn (ptr, force_operand (next_ptr, NULL_RTX));
4634 : 288 : to = replace_equiv_address (to, ptr);
4635 : 288 : rtx rem_minus_blksize = plus_constant (ptr_mode, rem, -blksize);
4636 : 288 : emit_move_insn (rem, force_operand (rem_minus_blksize, NULL_RTX));
4637 : : }
4638 : :
4639 : 288 : if (loop_label)
4640 : 107 : emit_cmp_and_jump_insns (rem, GEN_INT (blksize), GE, NULL,
4641 : : ptr_mode, 1, loop_label,
4642 : : profile_probability::likely ());
4643 : :
4644 : 346 : if (label)
4645 : : {
4646 : 275 : emit_label (label);
4647 : :
4648 : : /* Given conditional stores, the offset can no longer be
4649 : : known, so clear it. */
4650 : 275 : clear_mem_offset (to);
4651 : : }
4652 : : }
4653 : :
4654 : : return true;
4655 : : }
4656 : :
4657 : : /* Helper function to do the actual work for expand_builtin_memset. The
4658 : : arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4659 : : so that this can also be called without constructing an actual CALL_EXPR.
4660 : : The other arguments and return value are the same as for
4661 : : expand_builtin_memset. */
4662 : :
4663 : : static rtx
4664 : 64480 : expand_builtin_memset_args (tree dest, tree val, tree len,
4665 : : rtx target, machine_mode mode, tree orig_exp)
4666 : : {
4667 : 64480 : tree fndecl, fn;
4668 : 64480 : enum built_in_function fcode;
4669 : 64480 : machine_mode val_mode;
4670 : 64480 : char c;
4671 : 64480 : unsigned int dest_align;
4672 : 64480 : rtx dest_mem, dest_addr, len_rtx;
4673 : 64480 : HOST_WIDE_INT expected_size = -1;
4674 : 64480 : unsigned int expected_align = 0;
4675 : 64480 : unsigned HOST_WIDE_INT min_size;
4676 : 64480 : unsigned HOST_WIDE_INT max_size;
4677 : 64480 : unsigned HOST_WIDE_INT probable_max_size;
4678 : :
4679 : 64480 : dest_align = get_pointer_alignment (dest);
4680 : :
4681 : : /* If DEST is not a pointer type, don't do this operation in-line. */
4682 : 64480 : if (dest_align == 0)
4683 : : return NULL_RTX;
4684 : :
4685 : 64480 : if (currently_expanding_gimple_stmt)
4686 : 64480 : stringop_block_profile (currently_expanding_gimple_stmt,
4687 : : &expected_align, &expected_size);
4688 : :
4689 : 64480 : if (expected_align < dest_align)
4690 : 64475 : expected_align = dest_align;
4691 : :
4692 : : /* If the LEN parameter is zero, return DEST. */
4693 : 64480 : if (integer_zerop (len))
4694 : : {
4695 : : /* Evaluate and ignore VAL in case it has side-effects. */
4696 : 0 : expand_expr (val, const0_rtx, VOIDmode, EXPAND_NORMAL);
4697 : 0 : return expand_expr (dest, target, mode, EXPAND_NORMAL);
4698 : : }
4699 : :
4700 : : /* Stabilize the arguments in case we fail. */
4701 : 64480 : dest = builtin_save_expr (dest);
4702 : 64480 : val = builtin_save_expr (val);
4703 : 64480 : len = builtin_save_expr (len);
4704 : :
4705 : 64480 : len_rtx = expand_normal (len);
4706 : 64480 : determine_block_size (len, len_rtx, &min_size, &max_size,
4707 : : &probable_max_size);
4708 : 64480 : dest_mem = get_memory_rtx (dest, len);
4709 : 64480 : val_mode = TYPE_MODE (unsigned_char_type_node);
4710 : :
4711 : 64480 : if (TREE_CODE (val) != INTEGER_CST
4712 : 64480 : || target_char_cast (val, &c))
4713 : : {
4714 : 1720 : rtx val_rtx;
4715 : :
4716 : 1720 : val_rtx = expand_normal (val);
4717 : 1720 : val_rtx = convert_to_mode (val_mode, val_rtx, 0);
4718 : :
4719 : : /* Assume that we can memset by pieces if we can store
4720 : : * the coefficients by pieces (in the required modes).
4721 : : * We can't pass builtin_memset_gen_str as that emits RTL. */
4722 : 1720 : c = 1;
4723 : 1720 : if (tree_fits_uhwi_p (len)
4724 : 1720 : && can_store_by_pieces (tree_to_uhwi (len),
4725 : : builtin_memset_read_str, &c, dest_align,
4726 : : true))
4727 : : {
4728 : 772 : val_rtx = force_reg (val_mode, val_rtx);
4729 : 772 : store_by_pieces (dest_mem, tree_to_uhwi (len),
4730 : : builtin_memset_gen_str, val_rtx, dest_align,
4731 : : true, RETURN_BEGIN);
4732 : : }
4733 : 948 : else if (!set_storage_via_setmem (dest_mem, len_rtx, val_rtx,
4734 : : dest_align, expected_align,
4735 : : expected_size, min_size, max_size,
4736 : : probable_max_size)
4737 : 948 : && !try_store_by_multiple_pieces (dest_mem, len_rtx,
4738 : : tree_ctz (len),
4739 : : min_size, max_size,
4740 : : val_rtx, 0,
4741 : : dest_align))
4742 : 515 : goto do_libcall;
4743 : :
4744 : 1205 : dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
4745 : 1205 : dest_mem = convert_memory_address (ptr_mode, dest_mem);
4746 : 1205 : return dest_mem;
4747 : : }
4748 : :
4749 : 62760 : if (c)
4750 : : {
4751 : 12953 : if (tree_fits_uhwi_p (len)
4752 : 12953 : && can_store_by_pieces (tree_to_uhwi (len),
4753 : : builtin_memset_read_str, &c, dest_align,
4754 : : true))
4755 : 4876 : store_by_pieces (dest_mem, tree_to_uhwi (len),
4756 : : builtin_memset_read_str, &c, dest_align, true,
4757 : : RETURN_BEGIN);
4758 : 9852 : else if (!set_storage_via_setmem (dest_mem, len_rtx,
4759 : 8077 : gen_int_mode (c, val_mode),
4760 : : dest_align, expected_align,
4761 : : expected_size, min_size, max_size,
4762 : : probable_max_size)
4763 : 8077 : && !try_store_by_multiple_pieces (dest_mem, len_rtx,
4764 : : tree_ctz (len),
4765 : : min_size, max_size,
4766 : : NULL_RTX, c,
4767 : : dest_align))
4768 : 6302 : goto do_libcall;
4769 : :
4770 : 6651 : dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
4771 : 6651 : dest_mem = convert_memory_address (ptr_mode, dest_mem);
4772 : 6651 : return dest_mem;
4773 : : }
4774 : :
4775 : 49807 : set_mem_align (dest_mem, dest_align);
4776 : 99614 : dest_addr = clear_storage_hints (dest_mem, len_rtx,
4777 : 49807 : CALL_EXPR_TAILCALL (orig_exp)
4778 : : ? BLOCK_OP_TAILCALL : BLOCK_OP_NORMAL,
4779 : : expected_align, expected_size,
4780 : : min_size, max_size,
4781 : : probable_max_size, tree_ctz (len));
4782 : :
4783 : 49807 : if (dest_addr == 0)
4784 : : {
4785 : 39073 : dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
4786 : 39073 : dest_addr = convert_memory_address (ptr_mode, dest_addr);
4787 : : }
4788 : :
4789 : : return dest_addr;
4790 : :
4791 : 6817 : do_libcall:
4792 : 6817 : fndecl = get_callee_fndecl (orig_exp);
4793 : 6817 : fcode = DECL_FUNCTION_CODE (fndecl);
4794 : 6817 : if (fcode == BUILT_IN_MEMSET)
4795 : 6817 : fn = build_call_nofold_loc (EXPR_LOCATION (orig_exp), fndecl, 3,
4796 : : dest, val, len);
4797 : 0 : else if (fcode == BUILT_IN_BZERO)
4798 : 0 : fn = build_call_nofold_loc (EXPR_LOCATION (orig_exp), fndecl, 2,
4799 : : dest, len);
4800 : : else
4801 : 0 : gcc_unreachable ();
4802 : 6817 : gcc_assert (TREE_CODE (fn) == CALL_EXPR);
4803 : 6817 : CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (orig_exp);
4804 : 6817 : return expand_call (fn, target, target == const0_rtx);
4805 : : }
4806 : :
4807 : : /* Expand expression EXP, which is a call to the bzero builtin. Return
4808 : : NULL_RTX if we failed the caller should emit a normal call. */
4809 : :
4810 : : static rtx
4811 : 0 : expand_builtin_bzero (tree exp)
4812 : : {
4813 : 0 : if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4814 : : return NULL_RTX;
4815 : :
4816 : 0 : tree dest = CALL_EXPR_ARG (exp, 0);
4817 : 0 : tree size = CALL_EXPR_ARG (exp, 1);
4818 : :
4819 : : /* New argument list transforming bzero(ptr x, int y) to
4820 : : memset(ptr x, int 0, size_t y). This is done this way
4821 : : so that if it isn't expanded inline, we fallback to
4822 : : calling bzero instead of memset. */
4823 : :
4824 : 0 : location_t loc = EXPR_LOCATION (exp);
4825 : :
4826 : 0 : return expand_builtin_memset_args (dest, integer_zero_node,
4827 : : fold_convert_loc (loc,
4828 : : size_type_node, size),
4829 : 0 : const0_rtx, VOIDmode, exp);
4830 : : }
4831 : :
4832 : : /* Try to expand cmpstr operation ICODE with the given operands.
4833 : : Return the result rtx on success, otherwise return null. */
4834 : :
4835 : : static rtx
4836 : 0 : expand_cmpstr (insn_code icode, rtx target, rtx arg1_rtx, rtx arg2_rtx,
4837 : : HOST_WIDE_INT align)
4838 : : {
4839 : 0 : machine_mode insn_mode = insn_data[icode].operand[0].mode;
4840 : :
4841 : 0 : if (target && (!REG_P (target) || HARD_REGISTER_P (target)))
4842 : : target = NULL_RTX;
4843 : :
4844 : 0 : class expand_operand ops[4];
4845 : 0 : create_output_operand (&ops[0], target, insn_mode);
4846 : 0 : create_fixed_operand (&ops[1], arg1_rtx);
4847 : 0 : create_fixed_operand (&ops[2], arg2_rtx);
4848 : 0 : create_integer_operand (&ops[3], align);
4849 : 0 : if (maybe_expand_insn (icode, 4, ops))
4850 : 0 : return ops[0].value;
4851 : : return NULL_RTX;
4852 : : }
4853 : :
4854 : : /* Expand expression EXP, which is a call to the memcmp built-in function.
4855 : : Return NULL_RTX if we failed and the caller should emit a normal call,
4856 : : otherwise try to get the result in TARGET, if convenient.
4857 : : RESULT_EQ is true if we can relax the returned value to be either zero
4858 : : or nonzero, without caring about the sign. */
4859 : :
4860 : : static rtx
4861 : 102204 : expand_builtin_memcmp (tree exp, rtx target, bool result_eq)
4862 : : {
4863 : 102204 : if (!validate_arglist (exp,
4864 : : POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4865 : : return NULL_RTX;
4866 : :
4867 : 102200 : tree arg1 = CALL_EXPR_ARG (exp, 0);
4868 : 102200 : tree arg2 = CALL_EXPR_ARG (exp, 1);
4869 : 102200 : tree len = CALL_EXPR_ARG (exp, 2);
4870 : :
4871 : : /* Due to the performance benefit, always inline the calls first
4872 : : when result_eq is false. */
4873 : 102200 : rtx result = NULL_RTX;
4874 : 102200 : enum built_in_function fcode = DECL_FUNCTION_CODE (get_callee_fndecl (exp));
4875 : 102200 : if (!result_eq && fcode != BUILT_IN_BCMP)
4876 : : {
4877 : 14290 : result = inline_expand_builtin_bytecmp (exp, target);
4878 : 14290 : if (result)
4879 : : return result;
4880 : : }
4881 : :
4882 : 102195 : machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
4883 : 102195 : location_t loc = EXPR_LOCATION (exp);
4884 : :
4885 : 102195 : unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
4886 : 102195 : unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
4887 : :
4888 : : /* If we don't have POINTER_TYPE, call the function. */
4889 : 102195 : if (arg1_align == 0 || arg2_align == 0)
4890 : : return NULL_RTX;
4891 : :
4892 : 102195 : rtx arg1_rtx = get_memory_rtx (arg1, len);
4893 : 102195 : rtx arg2_rtx = get_memory_rtx (arg2, len);
4894 : 102195 : rtx len_rtx = expand_normal (fold_convert_loc (loc, sizetype, len));
4895 : :
4896 : : /* Set MEM_SIZE as appropriate. */
4897 : 102195 : if (CONST_INT_P (len_rtx))
4898 : : {
4899 : 78392 : set_mem_size (arg1_rtx, INTVAL (len_rtx));
4900 : 78392 : set_mem_size (arg2_rtx, INTVAL (len_rtx));
4901 : : }
4902 : :
4903 : 102195 : by_pieces_constfn constfn = NULL;
4904 : :
4905 : : /* Try to get the byte representation of the constant ARG2 (or, only
4906 : : when the function's result is used for equality to zero, ARG1)
4907 : : points to, with its byte size in NBYTES. */
4908 : 102195 : unsigned HOST_WIDE_INT nbytes;
4909 : 102195 : const char *rep = getbyterep (arg2, &nbytes);
4910 : 102195 : if (result_eq && rep == NULL)
4911 : : {
4912 : : /* For equality to zero the arguments are interchangeable. */
4913 : 62534 : rep = getbyterep (arg1, &nbytes);
4914 : 62534 : if (rep != NULL)
4915 : : std::swap (arg1_rtx, arg2_rtx);
4916 : : }
4917 : :
4918 : : /* If the function's constant bound LEN_RTX is less than or equal
4919 : : to the byte size of the representation of the constant argument,
4920 : : and if block move would be done by pieces, we can avoid loading
4921 : : the bytes from memory and only store the computed constant result. */
4922 : 39661 : if (rep
4923 : 27293 : && CONST_INT_P (len_rtx)
4924 : 27195 : && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= nbytes)
4925 : 102195 : constfn = builtin_memcpy_read_str;
4926 : :
4927 : 204390 : result = emit_block_cmp_hints (arg1_rtx, arg2_rtx, len_rtx,
4928 : 102195 : TREE_TYPE (len), target,
4929 : : result_eq, constfn,
4930 : : CONST_CAST (char *, rep),
4931 : : tree_ctz (len));
4932 : :
4933 : 102195 : if (result)
4934 : : {
4935 : : /* Return the value in the proper mode for this function. */
4936 : 66194 : if (GET_MODE (result) == mode)
4937 : : return result;
4938 : :
4939 : 0 : if (target != 0)
4940 : : {
4941 : 0 : convert_move (target, result, 0);
4942 : 0 : return target;
4943 : : }
4944 : :
4945 : 0 : return convert_to_mode (mode, result, 0);
4946 : : }
4947 : :
4948 : : return NULL_RTX;
4949 : : }
4950 : :
4951 : : /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4952 : : if we failed the caller should emit a normal call, otherwise try to get
4953 : : the result in TARGET, if convenient. */
4954 : :
4955 : : static rtx
4956 : 127973 : expand_builtin_strcmp (tree exp, ATTRIBUTE_UNUSED rtx target)
4957 : : {
4958 : 127973 : if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4959 : : return NULL_RTX;
4960 : :
4961 : 127958 : tree arg1 = CALL_EXPR_ARG (exp, 0);
4962 : 127958 : tree arg2 = CALL_EXPR_ARG (exp, 1);
4963 : :
4964 : : /* Due to the performance benefit, always inline the calls first. */
4965 : 127958 : rtx result = NULL_RTX;
4966 : 127958 : result = inline_expand_builtin_bytecmp (exp, target);
4967 : 127958 : if (result)
4968 : : return result;
4969 : :
4970 : 127559 : insn_code cmpstr_icode = direct_optab_handler (cmpstr_optab, SImode);
4971 : 127559 : insn_code cmpstrn_icode = direct_optab_handler (cmpstrn_optab, SImode);
4972 : 127559 : if (cmpstr_icode == CODE_FOR_nothing && cmpstrn_icode == CODE_FOR_nothing)
4973 : : return NULL_RTX;
4974 : :
4975 : 127559 : unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
4976 : 127559 : unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
4977 : :
4978 : : /* If we don't have POINTER_TYPE, call the function. */
4979 : 127559 : if (arg1_align == 0 || arg2_align == 0)
4980 : : return NULL_RTX;
4981 : :
4982 : : /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4983 : 127559 : arg1 = builtin_save_expr (arg1);
4984 : 127559 : arg2 = builtin_save_expr (arg2);
4985 : :
4986 : 127559 : rtx arg1_rtx = get_memory_rtx (arg1, NULL);
4987 : 127559 : rtx arg2_rtx = get_memory_rtx (arg2, NULL);
4988 : :
4989 : : /* Try to call cmpstrsi. */
4990 : 127559 : if (cmpstr_icode != CODE_FOR_nothing)
4991 : 0 : result = expand_cmpstr (cmpstr_icode, target, arg1_rtx, arg2_rtx,
4992 : 0 : MIN (arg1_align, arg2_align));
4993 : :
4994 : : /* Try to determine at least one length and call cmpstrnsi. */
4995 : 127559 : if (!result && cmpstrn_icode != CODE_FOR_nothing)
4996 : : {
4997 : 127559 : tree len;
4998 : 127559 : rtx arg3_rtx;
4999 : :
5000 : 127559 : tree len1 = c_strlen (arg1, 1);
5001 : 127559 : tree len2 = c_strlen (arg2, 1);
5002 : :
5003 : 127559 : if (len1)
5004 : 224 : len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
5005 : 127559 : if (len2)
5006 : 125929 : len2 = size_binop (PLUS_EXPR, ssize_int (1), len2);
5007 : :
5008 : : /* If we don't have a constant length for the first, use the length
5009 : : of the second, if we know it. We don't require a constant for
5010 : : this case; some cost analysis could be done if both are available
5011 : : but neither is constant. For now, assume they're equally cheap,
5012 : : unless one has side effects. If both strings have constant lengths,
5013 : : use the smaller. */
5014 : :
5015 : 127559 : if (!len1)
5016 : : len = len2;
5017 : 224 : else if (!len2)
5018 : : len = len1;
5019 : 17 : else if (TREE_SIDE_EFFECTS (len1))
5020 : : len = len2;
5021 : 17 : else if (TREE_SIDE_EFFECTS (len2))
5022 : : len = len1;
5023 : 17 : else if (TREE_CODE (len1) != INTEGER_CST)
5024 : : len = len2;
5025 : 17 : else if (TREE_CODE (len2) != INTEGER_CST)
5026 : : len = len1;
5027 : 10 : else if (tree_int_cst_lt (len1, len2))
5028 : : len = len1;
5029 : : else
5030 : 127341 : len = len2;
5031 : :
5032 : : /* If both arguments have side effects, we cannot optimize. */
5033 : 127559 : if (len && !TREE_SIDE_EFFECTS (len))
5034 : : {
5035 : 126136 : arg3_rtx = expand_normal (len);
5036 : 126136 : result = expand_cmpstrn_or_cmpmem
5037 : 126136 : (cmpstrn_icode, target, arg1_rtx, arg2_rtx, TREE_TYPE (len),
5038 : 126136 : arg3_rtx, MIN (arg1_align, arg2_align));
5039 : : }
5040 : : }
5041 : :
5042 : 127559 : tree fndecl = get_callee_fndecl (exp);
5043 : 127559 : if (result)
5044 : : {
5045 : : /* Return the value in the proper mode for this function. */
5046 : 52 : machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
5047 : 52 : if (GET_MODE (result) == mode)
5048 : : return result;
5049 : 0 : if (target == 0)
5050 : 0 : return convert_to_mode (mode, result, 0);
5051 : 0 : convert_move (target, result, 0);
5052 : 0 : return target;
5053 : : }
5054 : :
5055 : : /* Expand the library call ourselves using a stabilized argument
5056 : : list to avoid re-evaluating the function's arguments twice. */
5057 : 127507 : tree fn = build_call_nofold_loc (EXPR_LOCATION (exp), fndecl, 2, arg1, arg2);
5058 : 127507 : copy_warning (fn, exp);
5059 : 127507 : gcc_assert (TREE_CODE (fn) == CALL_EXPR);
5060 : 127507 : CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
5061 : 127507 : return expand_call (fn, target, target == const0_rtx);
5062 : : }
5063 : :
5064 : : /* Expand expression EXP, which is a call to the strncmp builtin. Return
5065 : : NULL_RTX if we failed the caller should emit a normal call, otherwise
5066 : : try to get the result in TARGET, if convenient. */
5067 : :
5068 : : static rtx
5069 : 2035 : expand_builtin_strncmp (tree exp, ATTRIBUTE_UNUSED rtx target,
5070 : : ATTRIBUTE_UNUSED machine_mode mode)
5071 : : {
5072 : 2035 : if (!validate_arglist (exp,
5073 : : POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5074 : : return NULL_RTX;
5075 : :
5076 : 2029 : tree arg1 = CALL_EXPR_ARG (exp, 0);
5077 : 2029 : tree arg2 = CALL_EXPR_ARG (exp, 1);
5078 : 2029 : tree arg3 = CALL_EXPR_ARG (exp, 2);
5079 : :
5080 : 2029 : location_t loc = EXPR_LOCATION (exp);
5081 : 2029 : tree len1 = c_strlen (arg1, 1);
5082 : 2029 : tree len2 = c_strlen (arg2, 1);
5083 : :
5084 : : /* Due to the performance benefit, always inline the calls first. */
5085 : 2029 : rtx result = NULL_RTX;
5086 : 2029 : result = inline_expand_builtin_bytecmp (exp, target);
5087 : 2029 : if (result)
5088 : : return result;
5089 : :
5090 : : /* If c_strlen can determine an expression for one of the string
5091 : : lengths, and it doesn't have side effects, then emit cmpstrnsi
5092 : : using length MIN(strlen(string)+1, arg3). */
5093 : 1807 : insn_code cmpstrn_icode = direct_optab_handler (cmpstrn_optab, SImode);
5094 : 1807 : if (cmpstrn_icode == CODE_FOR_nothing)
5095 : : return NULL_RTX;
5096 : :
5097 : 1807 : tree len;
5098 : :
5099 : 1807 : unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
5100 : 1807 : unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
5101 : :
5102 : 1807 : if (len1)
5103 : 162 : len1 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len1);
5104 : 1807 : if (len2)
5105 : 676 : len2 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len2);
5106 : :
5107 : 1807 : tree len3 = fold_convert_loc (loc, sizetype, arg3);
5108 : :
5109 : : /* If we don't have a constant length for the first, use the length
5110 : : of the second, if we know it. If neither string is constant length,
5111 : : use the given length argument. We don't require a constant for
5112 : : this case; some cost analysis could be done if both are available
5113 : : but neither is constant. For now, assume they're equally cheap,
5114 : : unless one has side effects. If both strings have constant lengths,
5115 : : use the smaller. */
5116 : :
5117 : 1807 : if (!len1 && !len2)
5118 : : len = len3;
5119 : 721 : else if (!len1)
5120 : : len = len2;
5121 : 162 : else if (!len2)
5122 : : len = len1;
5123 : 117 : else if (TREE_SIDE_EFFECTS (len1))
5124 : : len = len2;
5125 : 117 : else if (TREE_SIDE_EFFECTS (len2))
5126 : : len = len1;
5127 : 117 : else if (TREE_CODE (len1) != INTEGER_CST)
5128 : : len = len2;
5129 : 117 : else if (TREE_CODE (len2) != INTEGER_CST)
5130 : : len = len1;
5131 : 117 : else if (tree_int_cst_lt (len1, len2))
5132 : : len = len1;
5133 : : else
5134 : 560 : len = len2;
5135 : :
5136 : : /* If we are not using the given length, we must incorporate it here.
5137 : : The actual new length parameter will be MIN(len,arg3) in this case. */
5138 : 1807 : if (len != len3)
5139 : : {
5140 : 721 : len = fold_convert_loc (loc, sizetype, len);
5141 : 721 : len = fold_build2_loc (loc, MIN_EXPR, TREE_TYPE (len), len, len3);
5142 : : }
5143 : 1807 : rtx arg1_rtx = get_memory_rtx (arg1, len);
5144 : 1807 : rtx arg2_rtx = get_memory_rtx (arg2, len);
5145 : 1807 : rtx arg3_rtx = expand_normal (len);
5146 : 1807 : result = expand_cmpstrn_or_cmpmem (cmpstrn_icode, target, arg1_rtx,
5147 : 1807 : arg2_rtx, TREE_TYPE (len), arg3_rtx,
5148 : 1807 : MIN (arg1_align, arg2_align));
5149 : :
5150 : 1807 : tree fndecl = get_callee_fndecl (exp);
5151 : 1807 : if (result)
5152 : : {
5153 : : /* Return the value in the proper mode for this function. */
5154 : 21 : mode = TYPE_MODE (TREE_TYPE (exp));
5155 : 21 : if (GET_MODE (result) == mode)
5156 : : return result;
5157 : 0 : if (target == 0)
5158 : 0 : return convert_to_mode (mode, result, 0);
5159 : 0 : convert_move (target, result, 0);
5160 : 0 : return target;
5161 : : }
5162 : :
5163 : : /* Expand the library call ourselves using a stabilized argument
5164 : : list to avoid re-evaluating the function's arguments twice. */
5165 : 1786 : tree call = build_call_nofold_loc (loc, fndecl, 3, arg1, arg2, len);
5166 : 1786 : copy_warning (call, exp);
5167 : 1786 : gcc_assert (TREE_CODE (call) == CALL_EXPR);
5168 : 1786 : CALL_EXPR_TAILCALL (call) = CALL_EXPR_TAILCALL (exp);
5169 : 1786 : return expand_call (call, target, target == const0_rtx);
5170 : : }
5171 : :
5172 : : /* Expand a call to __builtin_saveregs, generating the result in TARGET,
5173 : : if that's convenient. */
5174 : :
5175 : : rtx
5176 : 0 : expand_builtin_saveregs (void)
5177 : : {
5178 : 0 : rtx val;
5179 : 0 : rtx_insn *seq;
5180 : :
5181 : : /* Don't do __builtin_saveregs more than once in a function.
5182 : : Save the result of the first call and reuse it. */
5183 : 0 : if (saveregs_value != 0)
5184 : : return saveregs_value;
5185 : :
5186 : : /* When this function is called, it means that registers must be
5187 : : saved on entry to this function. So we migrate the call to the
5188 : : first insn of this function. */
5189 : :
5190 : 0 : start_sequence ();
5191 : :
5192 : : /* Do whatever the machine needs done in this case. */
5193 : 0 : val = targetm.calls.expand_builtin_saveregs ();
5194 : :
5195 : 0 : seq = end_sequence ();
5196 : :
5197 : 0 : saveregs_value = val;
5198 : :
5199 : : /* Put the insns after the NOTE that starts the function. If this
5200 : : is inside a start_sequence, make the outer-level insn chain current, so
5201 : : the code is placed at the start of the function. */
5202 : 0 : push_topmost_sequence ();
5203 : 0 : emit_insn_after (seq, entry_of_function ());
5204 : 0 : pop_topmost_sequence ();
5205 : :
5206 : 0 : return val;
5207 : : }
5208 : :
5209 : : /* Expand a call to __builtin_next_arg. */
5210 : :
5211 : : static rtx
5212 : 21107 : expand_builtin_next_arg (void)
5213 : : {
5214 : : /* Checking arguments is already done in fold_builtin_next_arg
5215 : : that must be called before this function. */
5216 : 21107 : return expand_binop (ptr_mode, add_optab,
5217 : : crtl->args.internal_arg_pointer,
5218 : : crtl->args.arg_offset_rtx,
5219 : 21107 : NULL_RTX, 0, OPTAB_LIB_WIDEN);
5220 : : }
5221 : :
5222 : : /* Make it easier for the backends by protecting the valist argument
5223 : : from multiple evaluations. */
5224 : :
5225 : : static tree
5226 : 21441 : stabilize_va_list_loc (location_t loc, tree valist, int needs_lvalue)
5227 : : {
5228 : 21441 : tree vatype = targetm.canonical_va_list_type (TREE_TYPE (valist));
5229 : :
5230 : : /* The current way of determining the type of valist is completely
5231 : : bogus. We should have the information on the va builtin instead. */
5232 : 21441 : if (!vatype)
5233 : 21317 : vatype = targetm.fn_abi_va_list (cfun->decl);
5234 : :
5235 : 21441 : if (TREE_CODE (vatype) == ARRAY_TYPE)
5236 : : {
5237 : 15779 : if (TREE_SIDE_EFFECTS (valist))
5238 : 0 : valist = save_expr (valist);
5239 : :
5240 : : /* For this case, the backends will be expecting a pointer to
5241 : : vatype, but it's possible we've actually been given an array
5242 : : (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
5243 : : So fix it. */
5244 : 15779 : if (TREE_CODE (TREE_TYPE (valist)) == ARRAY_TYPE)
5245 : : {
5246 : 0 : tree p1 = build_pointer_type (TREE_TYPE (vatype));
5247 : 0 : valist = build_fold_addr_expr_with_type_loc (loc, valist, p1);
5248 : : }
5249 : : }
5250 : : else
5251 : : {
5252 : 5662 : tree pt = build_pointer_type (vatype);
5253 : :
5254 : 5662 : if (! needs_lvalue)
5255 : : {
5256 : 6 : if (! TREE_SIDE_EFFECTS (valist))
5257 : : return valist;
5258 : :
5259 : 0 : valist = fold_build1_loc (loc, ADDR_EXPR, pt, valist);
5260 : 0 : TREE_SIDE_EFFECTS (valist) = 1;
5261 : : }
5262 : :
5263 : 5656 : if (TREE_SIDE_EFFECTS (valist))
5264 : 0 : valist = save_expr (valist);
5265 : 5656 : valist = fold_build2_loc (loc, MEM_REF,
5266 : : vatype, valist, build_int_cst (pt, 0));
5267 : : }
5268 : :
5269 : : return valist;
5270 : : }
5271 : :
5272 : : /* The "standard" definition of va_list is void*. */
5273 : :
5274 : : tree
5275 : 0 : std_build_builtin_va_list (void)
5276 : : {
5277 : 0 : return ptr_type_node;
5278 : : }
5279 : :
5280 : : /* The "standard" abi va_list is va_list_type_node. */
5281 : :
5282 : : tree
5283 : 0 : std_fn_abi_va_list (tree fndecl ATTRIBUTE_UNUSED)
5284 : : {
5285 : 0 : return va_list_type_node;
5286 : : }
5287 : :
5288 : : /* The "standard" type of va_list is va_list_type_node. */
5289 : :
5290 : : tree
5291 : 502 : std_canonical_va_list_type (tree type)
5292 : : {
5293 : 502 : tree wtype, htype;
5294 : :
5295 : 502 : wtype = va_list_type_node;
5296 : 502 : htype = type;
5297 : :
5298 : 502 : if (TREE_CODE (wtype) == ARRAY_TYPE)
5299 : : {
5300 : : /* If va_list is an array type, the argument may have decayed
5301 : : to a pointer type, e.g. by being passed to another function.
5302 : : In that case, unwrap both types so that we can compare the
5303 : : underlying records. */
5304 : 0 : if (TREE_CODE (htype) == ARRAY_TYPE
5305 : 0 : || POINTER_TYPE_P (htype))
5306 : : {
5307 : 0 : wtype = TREE_TYPE (wtype);
5308 : 0 : htype = TREE_TYPE (htype);
5309 : : }
5310 : : }
5311 : 502 : if (TYPE_MAIN_VARIANT (wtype) == TYPE_MAIN_VARIANT (htype))
5312 : 332 : return va_list_type_node;
5313 : :
5314 : : return NULL_TREE;
5315 : : }
5316 : :
5317 : : /* The "standard" implementation of va_start: just assign `nextarg' to
5318 : : the variable. */
5319 : :
5320 : : void
5321 : 5652 : std_expand_builtin_va_start (tree valist, rtx nextarg)
5322 : : {
5323 : 5652 : rtx va_r = expand_expr (valist, NULL_RTX, VOIDmode, EXPAND_WRITE);
5324 : 5652 : convert_move (va_r, nextarg, 0);
5325 : 5652 : }
5326 : :
5327 : : /* Expand EXP, a call to __builtin_va_start. */
5328 : :
5329 : : static rtx
5330 : 20957 : expand_builtin_va_start (tree exp)
5331 : : {
5332 : 20957 : rtx nextarg;
5333 : 20957 : tree valist;
5334 : 20957 : location_t loc = EXPR_LOCATION (exp);
5335 : :
5336 : 20957 : if (call_expr_nargs (exp) < 2)
5337 : : {
5338 : 0 : error_at (loc, "too few arguments to function %<va_start%>");
5339 : 0 : return const0_rtx;
5340 : : }
5341 : :
5342 : 20957 : if (fold_builtin_next_arg (exp, true))
5343 : 0 : return const0_rtx;
5344 : :
5345 : 20957 : nextarg = expand_builtin_next_arg ();
5346 : 20957 : valist = stabilize_va_list_loc (loc, CALL_EXPR_ARG (exp, 0), 1);
5347 : :
5348 : 20957 : if (targetm.expand_builtin_va_start)
5349 : 20957 : targetm.expand_builtin_va_start (valist, nextarg);
5350 : : else
5351 : 0 : std_expand_builtin_va_start (valist, nextarg);
5352 : :
5353 : 20957 : return const0_rtx;
5354 : : }
5355 : :
5356 : : /* Expand EXP, a call to __builtin_va_end. */
5357 : :
5358 : : static rtx
5359 : 12104 : expand_builtin_va_end (tree exp)
5360 : : {
5361 : 12104 : tree valist = CALL_EXPR_ARG (exp, 0);
5362 : :
5363 : : /* Evaluate for side effects, if needed. I hate macros that don't
5364 : : do that. */
5365 : 12104 : if (TREE_SIDE_EFFECTS (valist))
5366 : 0 : expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
5367 : :
5368 : 12104 : return const0_rtx;
5369 : : }
5370 : :
5371 : : /* Expand EXP, a call to __builtin_va_copy. We do this as a
5372 : : builtin rather than just as an assignment in stdarg.h because of the
5373 : : nastiness of array-type va_list types. */
5374 : :
5375 : : static rtx
5376 : 242 : expand_builtin_va_copy (tree exp)
5377 : : {
5378 : 242 : tree dst, src, t;
5379 : 242 : location_t loc = EXPR_LOCATION (exp);
5380 : :
5381 : 242 : dst = CALL_EXPR_ARG (exp, 0);
5382 : 242 : src = CALL_EXPR_ARG (exp, 1);
5383 : :
5384 : 242 : dst = stabilize_va_list_loc (loc, dst, 1);
5385 : 242 : src = stabilize_va_list_loc (loc, src, 0);
5386 : :
5387 : 242 : gcc_assert (cfun != NULL && cfun->decl != NULL_TREE);
5388 : :
5389 : 242 : if (TREE_CODE (targetm.fn_abi_va_list (cfun->decl)) != ARRAY_TYPE)
5390 : : {
5391 : 0 : t = build2 (MODIFY_EXPR, targetm.fn_abi_va_list (cfun->decl), dst, src);
5392 : 0 : TREE_SIDE_EFFECTS (t) = 1;
5393 : 0 : expand_expr (t, const0_rtx, VOIDmode, EXPAND_NORMAL);
5394 : : }
5395 : : else
5396 : : {
5397 : 242 : rtx dstb, srcb, size;
5398 : :
5399 : : /* Evaluate to pointers. */
5400 : 242 : dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
5401 : 242 : srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
5402 : 242 : size = expand_expr (TYPE_SIZE_UNIT (targetm.fn_abi_va_list (cfun->decl)),
5403 : : NULL_RTX, VOIDmode, EXPAND_NORMAL);
5404 : :
5405 : 242 : dstb = convert_memory_address (Pmode, dstb);
5406 : 242 : srcb = convert_memory_address (Pmode, srcb);
5407 : :
5408 : : /* "Dereference" to BLKmode memories. */
5409 : 242 : dstb = gen_rtx_MEM (BLKmode, dstb);
5410 : 242 : set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
5411 : 242 : set_mem_align (dstb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
5412 : 242 : srcb = gen_rtx_MEM (BLKmode, srcb);
5413 : 242 : set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
5414 : 242 : set_mem_align (srcb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
5415 : :
5416 : : /* Copy. */
5417 : 242 : emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
5418 : : }
5419 : :
5420 : 242 : return const0_rtx;
5421 : : }
5422 : :
5423 : : /* Expand a call to one of the builtin functions __builtin_frame_address or
5424 : : __builtin_return_address. */
5425 : :
5426 : : static rtx
5427 : 15583 : expand_builtin_frame_address (tree fndecl, tree exp)
5428 : : {
5429 : : /* The argument must be a nonnegative integer constant.
5430 : : It counts the number of frames to scan up the stack.
5431 : : The value is either the frame pointer value or the return
5432 : : address saved in that frame. */
5433 : 15583 : if (call_expr_nargs (exp) == 0)
5434 : : /* Warning about missing arg was already issued. */
5435 : 0 : return const0_rtx;
5436 : 15583 : else if (! tree_fits_uhwi_p (CALL_EXPR_ARG (exp, 0)))
5437 : : {
5438 : 0 : error ("invalid argument to %qD", fndecl);
5439 : 0 : return const0_rtx;
5440 : : }
5441 : : else
5442 : : {
5443 : : /* Number of frames to scan up the stack. */
5444 : 15583 : unsigned HOST_WIDE_INT count = tree_to_uhwi (CALL_EXPR_ARG (exp, 0));
5445 : :
5446 : 15583 : rtx tem = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl), count);
5447 : :
5448 : : /* Some ports cannot access arbitrary stack frames. */
5449 : 15583 : if (tem == NULL)
5450 : : {
5451 : 0 : warning (0, "unsupported argument to %qD", fndecl);
5452 : 0 : return const0_rtx;
5453 : : }
5454 : :
5455 : 15583 : if (count)
5456 : : {
5457 : : /* Warn since no effort is made to ensure that any frame
5458 : : beyond the current one exists or can be safely reached. */
5459 : 932 : warning (OPT_Wframe_address, "calling %qD with "
5460 : : "a nonzero argument is unsafe", fndecl);
5461 : : }
5462 : :
5463 : : /* For __builtin_frame_address, return what we've got. */
5464 : 15583 : if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
5465 : : return tem;
5466 : :
5467 : 5086 : if (!REG_P (tem)
5468 : 5086 : && ! CONSTANT_P (tem))
5469 : 5086 : tem = copy_addr_to_reg (tem);
5470 : 5086 : return tem;
5471 : : }
5472 : : }
5473 : :
5474 : : #if ! STACK_GROWS_DOWNWARD
5475 : : # define STACK_TOPS GT
5476 : : #else
5477 : : # define STACK_TOPS LT
5478 : : #endif
5479 : :
5480 : : #ifdef POINTERS_EXTEND_UNSIGNED
5481 : : # define STACK_UNSIGNED POINTERS_EXTEND_UNSIGNED
5482 : : #else
5483 : : # define STACK_UNSIGNED true
5484 : : #endif
5485 : :
5486 : : /* Expand a call to builtin function __builtin_stack_address. */
5487 : :
5488 : : static rtx
5489 : 3427 : expand_builtin_stack_address ()
5490 : : {
5491 : 3427 : rtx ret = convert_to_mode (ptr_mode, copy_to_reg (stack_pointer_rtx),
5492 : : STACK_UNSIGNED);
5493 : :
5494 : : #ifdef STACK_ADDRESS_OFFSET
5495 : : /* Unbias the stack pointer, bringing it to the boundary between the
5496 : : stack area claimed by the active function calling this builtin,
5497 : : and stack ranges that could get clobbered if it called another
5498 : : function. It should NOT encompass any stack red zone, that is
5499 : : used in leaf functions.
5500 : :
5501 : : On SPARC, the register save area is *not* considered active or
5502 : : used by the active function, but rather as akin to the area in
5503 : : which call-preserved registers are saved by callees. This
5504 : : enables __strub_leave to clear what would otherwise overlap with
5505 : : its own register save area.
5506 : :
5507 : : If the address is computed too high or too low, parts of a stack
5508 : : range that should be scrubbed may be left unscrubbed, scrubbing
5509 : : may corrupt active portions of the stack frame, and stack ranges
5510 : : may be doubly-scrubbed by caller and callee.
5511 : :
5512 : : In order for it to be just right, the area delimited by
5513 : : @code{__builtin_stack_address} and @code{__builtin_frame_address
5514 : : (0)} should encompass caller's registers saved by the function,
5515 : : local on-stack variables and @code{alloca} stack areas.
5516 : : Accumulated outgoing on-stack arguments, preallocated as part of
5517 : : a function's own prologue, are to be regarded as part of the
5518 : : (caller) function's active area as well, whereas those pushed or
5519 : : allocated temporarily for a call are regarded as part of the
5520 : : callee's stack range, rather than the caller's. */
5521 : : ret = plus_constant (ptr_mode, ret, STACK_ADDRESS_OFFSET);
5522 : : #endif
5523 : :
5524 : 3427 : return force_reg (ptr_mode, ret);
5525 : : }
5526 : :
5527 : : /* Expand a call to builtin function __builtin_strub_enter. */
5528 : :
5529 : : static rtx
5530 : 2159 : expand_builtin_strub_enter (tree exp)
5531 : : {
5532 : 2159 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5533 : : return NULL_RTX;
5534 : :
5535 : 2159 : if (optimize < 1 || flag_no_inline)
5536 : : return NULL_RTX;
5537 : :
5538 : 1515 : rtx stktop = expand_builtin_stack_address ();
5539 : :
5540 : 1515 : tree wmptr = CALL_EXPR_ARG (exp, 0);
5541 : 1515 : tree wmtype = TREE_TYPE (TREE_TYPE (wmptr));
5542 : 1515 : tree wmtree = fold_build2 (MEM_REF, wmtype, wmptr,
5543 : : build_int_cst (TREE_TYPE (wmptr), 0));
5544 : 1515 : rtx wmark = expand_expr (wmtree, NULL_RTX, ptr_mode, EXPAND_MEMORY);
5545 : :
5546 : 1515 : emit_move_insn (wmark, stktop);
5547 : :
5548 : 1515 : return const0_rtx;
5549 : : }
5550 : :
5551 : : /* Expand a call to builtin function __builtin_strub_update. */
5552 : :
5553 : : static rtx
5554 : 1071 : expand_builtin_strub_update (tree exp)
5555 : : {
5556 : 1071 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5557 : : return NULL_RTX;
5558 : :
5559 : 1071 : if (optimize < 2 || flag_no_inline)
5560 : : return NULL_RTX;
5561 : :
5562 : 652 : rtx stktop = expand_builtin_stack_address ();
5563 : :
5564 : : #ifdef RED_ZONE_SIZE
5565 : : /* Here's how the strub enter, update and leave functions deal with red zones.
5566 : :
5567 : : If it weren't for red zones, update, called from within a strub context,
5568 : : would bump the watermark to the top of the stack. Enter and leave, running
5569 : : in the caller, would use the caller's top of stack address both to
5570 : : initialize the watermark passed to the callee, and to start strubbing the
5571 : : stack afterwards.
5572 : :
5573 : : Ideally, we'd update the watermark so as to cover the used amount of red
5574 : : zone, and strub starting at the caller's other end of the (presumably
5575 : : unused) red zone. Normally, only leaf functions use the red zone, but at
5576 : : this point we can't tell whether a function is a leaf, nor can we tell how
5577 : : much of the red zone it uses. Furthermore, some strub contexts may have
5578 : : been inlined so that update and leave are called from the same stack frame,
5579 : : and the strub builtins may all have been inlined, turning a strub function
5580 : : into a leaf.
5581 : :
5582 : : So cleaning the range from the caller's stack pointer (one end of the red
5583 : : zone) to the (potentially inlined) callee's (other end of the) red zone
5584 : : could scribble over the caller's own red zone.
5585 : :
5586 : : We avoid this possibility by arranging for callers that are strub contexts
5587 : : to use their own watermark as the strub starting point. So, if A calls B,
5588 : : and B calls C, B will tell A to strub up to the end of B's red zone, and
5589 : : will strub itself only the part of C's stack frame and red zone that
5590 : : doesn't overlap with B's. With that, we don't need to know who's leaf and
5591 : : who isn't: inlined calls will shrink their strub window to zero, each
5592 : : remaining call will strub some portion of the stack, and eventually the
5593 : : strub context will return to a caller that isn't a strub context itself,
5594 : : that will therefore use its own stack pointer as the strub starting point.
5595 : : It's not a leaf, because strub contexts can't be inlined into non-strub
5596 : : contexts, so it doesn't use the red zone, and it will therefore correctly
5597 : : strub up the callee's stack frame up to the end of the callee's red zone.
5598 : : Neat! */
5599 : 652 : if (true /* (flags_from_decl_or_type (current_function_decl) & ECF_LEAF) */)
5600 : : {
5601 : 652 : poly_int64 red_zone_size = RED_ZONE_SIZE;
5602 : : #if STACK_GROWS_DOWNWARD
5603 : 652 : red_zone_size = -red_zone_size;
5604 : : #endif
5605 : 652 : stktop = plus_constant (ptr_mode, stktop, red_zone_size);
5606 : 652 : stktop = force_reg (ptr_mode, stktop);
5607 : : }
5608 : : #endif
5609 : :
5610 : 652 : tree wmptr = CALL_EXPR_ARG (exp, 0);
5611 : 652 : tree wmtype = TREE_TYPE (TREE_TYPE (wmptr));
5612 : 652 : tree wmtree = fold_build2 (MEM_REF, wmtype, wmptr,
5613 : : build_int_cst (TREE_TYPE (wmptr), 0));
5614 : 652 : rtx wmark = expand_expr (wmtree, NULL_RTX, ptr_mode, EXPAND_MEMORY);
5615 : :
5616 : 652 : rtx wmarkr = force_reg (ptr_mode, wmark);
5617 : :
5618 : 652 : rtx_code_label *lab = gen_label_rtx ();
5619 : 652 : do_compare_rtx_and_jump (stktop, wmarkr, STACK_TOPS, STACK_UNSIGNED,
5620 : : ptr_mode, NULL_RTX, lab, NULL,
5621 : : profile_probability::very_likely ());
5622 : 652 : emit_move_insn (wmark, stktop);
5623 : :
5624 : : /* If this is an inlined strub function, also bump the watermark for the
5625 : : enclosing function. This avoids a problem with the following scenario: A
5626 : : calls B and B calls C, and both B and C get inlined into A. B allocates
5627 : : temporary stack space before calling C. If we don't update A's watermark,
5628 : : we may use an outdated baseline for the post-C strub_leave, erasing B's
5629 : : temporary stack allocation. We only need this if we're fully expanding
5630 : : strub_leave inline. */
5631 : 652 : tree xwmptr = (optimize > 2
5632 : 652 : ? strub_watermark_parm (current_function_decl)
5633 : : : wmptr);
5634 : 652 : if (wmptr != xwmptr)
5635 : : {
5636 : 156 : wmptr = xwmptr;
5637 : 156 : wmtype = TREE_TYPE (TREE_TYPE (wmptr));
5638 : 156 : wmtree = fold_build2 (MEM_REF, wmtype, wmptr,
5639 : : build_int_cst (TREE_TYPE (wmptr), 0));
5640 : 156 : wmark = expand_expr (wmtree, NULL_RTX, ptr_mode, EXPAND_MEMORY);
5641 : 156 : wmarkr = force_reg (ptr_mode, wmark);
5642 : :
5643 : 156 : do_compare_rtx_and_jump (stktop, wmarkr, STACK_TOPS, STACK_UNSIGNED,
5644 : : ptr_mode, NULL_RTX, lab, NULL,
5645 : : profile_probability::very_likely ());
5646 : 156 : emit_move_insn (wmark, stktop);
5647 : : }
5648 : :
5649 : 652 : emit_label (lab);
5650 : :
5651 : 652 : return const0_rtx;
5652 : : }
5653 : :
5654 : :
5655 : : /* Expand a call to builtin function __builtin_strub_leave. */
5656 : :
5657 : : static rtx
5658 : 2729 : expand_builtin_strub_leave (tree exp)
5659 : : {
5660 : 2729 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5661 : : return NULL_RTX;
5662 : :
5663 : 2729 : if (optimize < 2 || optimize_size || flag_no_inline)
5664 : : return NULL_RTX;
5665 : :
5666 : 1229 : rtx stktop = NULL_RTX;
5667 : :
5668 : 1229 : if (tree wmptr = (optimize
5669 : 1229 : ? strub_watermark_parm (current_function_decl)
5670 : : : NULL_TREE))
5671 : : {
5672 : 509 : tree wmtype = TREE_TYPE (TREE_TYPE (wmptr));
5673 : 509 : tree wmtree = fold_build2 (MEM_REF, wmtype, wmptr,
5674 : : build_int_cst (TREE_TYPE (wmptr), 0));
5675 : 509 : rtx wmark = expand_expr (wmtree, NULL_RTX, ptr_mode, EXPAND_MEMORY);
5676 : 509 : stktop = force_reg (ptr_mode, wmark);
5677 : : }
5678 : :
5679 : 509 : if (!stktop)
5680 : 720 : stktop = expand_builtin_stack_address ();
5681 : :
5682 : 1229 : tree wmptr = CALL_EXPR_ARG (exp, 0);
5683 : 1229 : tree wmtype = TREE_TYPE (TREE_TYPE (wmptr));
5684 : 1229 : tree wmtree = fold_build2 (MEM_REF, wmtype, wmptr,
5685 : : build_int_cst (TREE_TYPE (wmptr), 0));
5686 : 1229 : rtx wmark = expand_expr (wmtree, NULL_RTX, ptr_mode, EXPAND_MEMORY);
5687 : :
5688 : 1229 : rtx wmarkr = force_reg (ptr_mode, wmark);
5689 : :
5690 : : #if ! STACK_GROWS_DOWNWARD
5691 : : rtx base = stktop;
5692 : : rtx end = wmarkr;
5693 : : #else
5694 : 1229 : rtx base = wmarkr;
5695 : 1229 : rtx end = stktop;
5696 : : #endif
5697 : :
5698 : : /* We're going to modify it, so make sure it's not e.g. the stack pointer. */
5699 : 1229 : base = copy_to_reg (base);
5700 : :
5701 : 1229 : rtx_code_label *done = gen_label_rtx ();
5702 : 1229 : do_compare_rtx_and_jump (base, end, LT, STACK_UNSIGNED,
5703 : : ptr_mode, NULL_RTX, done, NULL,
5704 : : profile_probability::very_likely ());
5705 : :
5706 : 1229 : if (optimize < 3)
5707 : 909 : expand_call (exp, NULL_RTX, true);
5708 : : else
5709 : : {
5710 : : /* Ok, now we've determined we want to copy the block, so convert the
5711 : : addresses to Pmode, as needed to dereference them to access ptr_mode
5712 : : memory locations, so that we don't have to convert anything within the
5713 : : loop. */
5714 : 320 : base = memory_address (ptr_mode, base);
5715 : 320 : end = memory_address (ptr_mode, end);
5716 : :
5717 : 320 : rtx zero = force_operand (const0_rtx, NULL_RTX);
5718 : 320 : int ulen = GET_MODE_SIZE (ptr_mode);
5719 : :
5720 : : /* ??? It would be nice to use setmem or similar patterns here,
5721 : : but they do not necessarily obey the stack growth direction,
5722 : : which has security implications. We also have to avoid calls
5723 : : (memset, bzero or any machine-specific ones), which are
5724 : : likely unsafe here (see TARGET_STRUB_MAY_USE_MEMSET). */
5725 : : #if ! STACK_GROWS_DOWNWARD
5726 : : rtx incr = plus_constant (Pmode, base, ulen);
5727 : : rtx dstm = gen_rtx_MEM (ptr_mode, base);
5728 : :
5729 : : rtx_code_label *loop = gen_label_rtx ();
5730 : : emit_label (loop);
5731 : : emit_move_insn (dstm, zero);
5732 : : emit_move_insn (base, force_operand (incr, NULL_RTX));
5733 : : #else
5734 : 320 : rtx decr = plus_constant (Pmode, end, -ulen);
5735 : 320 : rtx dstm = gen_rtx_MEM (ptr_mode, end);
5736 : :
5737 : 320 : rtx_code_label *loop = gen_label_rtx ();
5738 : 320 : emit_label (loop);
5739 : 320 : emit_move_insn (end, force_operand (decr, NULL_RTX));
5740 : 320 : emit_move_insn (dstm, zero);
5741 : : #endif
5742 : 640 : do_compare_rtx_and_jump (base, end, LT, STACK_UNSIGNED,
5743 : 320 : Pmode, NULL_RTX, NULL, loop,
5744 : : profile_probability::very_likely ());
5745 : : }
5746 : :
5747 : 1229 : emit_label (done);
5748 : :
5749 : 1229 : return const0_rtx;
5750 : : }
5751 : :
5752 : : /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5753 : : failed and the caller should emit a normal call. */
5754 : :
5755 : : static rtx
5756 : 28005 : expand_builtin_alloca (tree exp)
5757 : : {
5758 : 28005 : rtx op0;
5759 : 28005 : rtx result;
5760 : 28005 : unsigned int align;
5761 : 28005 : tree fndecl = get_callee_fndecl (exp);
5762 : 28005 : HOST_WIDE_INT max_size;
5763 : 28005 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5764 : 28005 : bool alloca_for_var = CALL_ALLOCA_FOR_VAR_P (exp);
5765 : 28005 : bool valid_arglist
5766 : : = (fcode == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
5767 : 28005 : ? validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE, INTEGER_TYPE,
5768 : : VOID_TYPE)
5769 : : : fcode == BUILT_IN_ALLOCA_WITH_ALIGN
5770 : 28003 : ? validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE)
5771 : 28005 : : validate_arglist (exp, INTEGER_TYPE, VOID_TYPE));
5772 : :
5773 : 28005 : if (!valid_arglist)
5774 : : return NULL_RTX;
5775 : :
5776 : : /* Compute the argument. */
5777 : 28000 : op0 = expand_normal (CALL_EXPR_ARG (exp, 0));
5778 : :
5779 : : /* Compute the alignment. */
5780 : 52181 : align = (fcode == BUILT_IN_ALLOCA
5781 : 24182 : ? BIGGEST_ALIGNMENT
5782 : 3818 : : TREE_INT_CST_LOW (CALL_EXPR_ARG (exp, 1)));
5783 : :
5784 : : /* Compute the maximum size. */
5785 : 2 : max_size = (fcode == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
5786 : 28002 : ? TREE_INT_CST_LOW (CALL_EXPR_ARG (exp, 2))
5787 : : : -1);
5788 : :
5789 : : /* Allocate the desired space. If the allocation stems from the declaration
5790 : : of a variable-sized object, it cannot accumulate. */
5791 : 28000 : result
5792 : 28000 : = allocate_dynamic_stack_space (op0, 0, align, max_size, alloca_for_var);
5793 : 28000 : result = convert_memory_address (ptr_mode, result);
5794 : :
5795 : : /* Dynamic allocations for variables are recorded during gimplification. */
5796 : 28000 : if (!alloca_for_var && (flag_callgraph_info & CALLGRAPH_INFO_DYNAMIC_ALLOC))
5797 : 0 : record_dynamic_alloc (exp);
5798 : :
5799 : : return result;
5800 : : }
5801 : :
5802 : : /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5803 : : of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5804 : : STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5805 : : handle_builtin_stack_restore function. */
5806 : :
5807 : : static rtx
5808 : 203 : expand_asan_emit_allocas_unpoison (tree exp)
5809 : : {
5810 : 203 : tree arg0 = CALL_EXPR_ARG (exp, 0);
5811 : 203 : tree arg1 = CALL_EXPR_ARG (exp, 1);
5812 : 203 : rtx top = expand_expr (arg0, NULL_RTX, ptr_mode, EXPAND_NORMAL);
5813 : 203 : rtx bot = expand_expr (arg1, NULL_RTX, ptr_mode, EXPAND_NORMAL);
5814 : 203 : rtx off = expand_simple_binop (Pmode, MINUS, virtual_stack_dynamic_rtx,
5815 : : stack_pointer_rtx, NULL_RTX, 0,
5816 : : OPTAB_LIB_WIDEN);
5817 : 203 : off = convert_modes (ptr_mode, Pmode, off, 0);
5818 : 203 : bot = expand_simple_binop (ptr_mode, PLUS, bot, off, NULL_RTX, 0,
5819 : : OPTAB_LIB_WIDEN);
5820 : 203 : rtx ret = init_one_libfunc ("__asan_allocas_unpoison");
5821 : 203 : ret = emit_library_call_value (ret, NULL_RTX, LCT_NORMAL, ptr_mode,
5822 : : top, ptr_mode, bot, ptr_mode);
5823 : 203 : return ret;
5824 : : }
5825 : :
5826 : : /* Expand a call to bswap builtin in EXP.
5827 : : Return NULL_RTX if a normal call should be emitted rather than expanding the
5828 : : function in-line. If convenient, the result should be placed in TARGET.
5829 : : SUBTARGET may be used as the target for computing one of EXP's operands. */
5830 : :
5831 : : static rtx
5832 : 1163 : expand_builtin_bswap (machine_mode target_mode, tree exp, rtx target,
5833 : : rtx subtarget)
5834 : : {
5835 : 1163 : tree arg;
5836 : 1163 : rtx op0;
5837 : :
5838 : 1163 : if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
5839 : : return NULL_RTX;
5840 : :
5841 : 1163 : arg = CALL_EXPR_ARG (exp, 0);
5842 : 1163 : op0 = expand_expr (arg,
5843 : 50 : subtarget && GET_MODE (subtarget) == target_mode
5844 : : ? subtarget : NULL_RTX,
5845 : : target_mode, EXPAND_NORMAL);
5846 : 1163 : if (GET_MODE (op0) != target_mode)
5847 : 0 : op0 = convert_to_mode (target_mode, op0, 1);
5848 : :
5849 : 1163 : target = expand_unop (target_mode, bswap_optab, op0, target, 1);
5850 : :
5851 : 1163 : gcc_assert (target);
5852 : :
5853 : 1163 : return convert_to_mode (target_mode, target, 1);
5854 : : }
5855 : :
5856 : : /* Expand a call to a unary builtin in EXP.
5857 : : Return NULL_RTX if a normal call should be emitted rather than expanding the
5858 : : function in-line. If convenient, the result should be placed in TARGET.
5859 : : SUBTARGET may be used as the target for computing one of EXP's operands. */
5860 : :
5861 : : static rtx
5862 : 752 : expand_builtin_unop (machine_mode target_mode, tree exp, rtx target,
5863 : : rtx subtarget, optab op_optab)
5864 : : {
5865 : 752 : rtx op0;
5866 : :
5867 : 752 : if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
5868 : : return NULL_RTX;
5869 : :
5870 : : /* Compute the argument. */
5871 : 1504 : op0 = expand_expr (CALL_EXPR_ARG (exp, 0),
5872 : : (subtarget
5873 : 95 : && (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0)))
5874 : 95 : == GET_MODE (subtarget))) ? subtarget : NULL_RTX,
5875 : : VOIDmode, EXPAND_NORMAL);
5876 : : /* Compute op, into TARGET if possible.
5877 : : Set TARGET to wherever the result comes back. */
5878 : 752 : target = expand_unop (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0))),
5879 : : op_optab, op0, target, op_optab != clrsb_optab);
5880 : 752 : gcc_assert (target);
5881 : :
5882 : 752 : return convert_to_mode (target_mode, target, 0);
5883 : : }
5884 : :
5885 : : /* Expand a call to __builtin_expect. We just return our argument
5886 : : as the builtin_expect semantic should've been already executed by
5887 : : tree branch prediction pass. */
5888 : :
5889 : : static rtx
5890 : 1017 : expand_builtin_expect (tree exp, rtx target)
5891 : : {
5892 : 1017 : tree arg;
5893 : :
5894 : 1017 : if (call_expr_nargs (exp) < 2)
5895 : 0 : return const0_rtx;
5896 : 1017 : arg = CALL_EXPR_ARG (exp, 0);
5897 : :
5898 : 1017 : target = expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
5899 : : /* When guessing was done, the hints should be already stripped away. */
5900 : 1017 : gcc_assert (!flag_guess_branch_prob
5901 : : || optimize == 0 || seen_error ());
5902 : : return target;
5903 : : }
5904 : :
5905 : : /* Expand a call to __builtin_expect_with_probability. We just return our
5906 : : argument as the builtin_expect semantic should've been already executed by
5907 : : tree branch prediction pass. */
5908 : :
5909 : : static rtx
5910 : 5 : expand_builtin_expect_with_probability (tree exp, rtx target)
5911 : : {
5912 : 5 : tree arg;
5913 : :
5914 : 5 : if (call_expr_nargs (exp) < 3)
5915 : 0 : return const0_rtx;
5916 : 5 : arg = CALL_EXPR_ARG (exp, 0);
5917 : :
5918 : 5 : target = expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
5919 : : /* When guessing was done, the hints should be already stripped away. */
5920 : 5 : gcc_assert (!flag_guess_branch_prob
5921 : : || optimize == 0 || seen_error ());
5922 : : return target;
5923 : : }
5924 : :
5925 : :
5926 : : /* Expand a call to __builtin_assume_aligned. We just return our first
5927 : : argument as the builtin_assume_aligned semantic should've been already
5928 : : executed by CCP. */
5929 : :
5930 : : static rtx
5931 : 75 : expand_builtin_assume_aligned (tree exp, rtx target)
5932 : : {
5933 : 75 : if (call_expr_nargs (exp) < 2)
5934 : 0 : return const0_rtx;
5935 : 75 : target = expand_expr (CALL_EXPR_ARG (exp, 0), target, VOIDmode,
5936 : : EXPAND_NORMAL);
5937 : 75 : gcc_assert (!TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp, 1))
5938 : : && (call_expr_nargs (exp) < 3
5939 : : || !TREE_SIDE_EFFECTS (CALL_EXPR_ARG (exp, 2))));
5940 : : return target;
5941 : : }
5942 : :
5943 : : void
5944 : 38526 : expand_builtin_trap (void)
5945 : : {
5946 : 38526 : if (targetm.have_trap ())
5947 : : {
5948 : 38526 : rtx_insn *insn = emit_insn (targetm.gen_trap ());
5949 : : /* For trap insns when not accumulating outgoing args force
5950 : : REG_ARGS_SIZE note to prevent crossjumping of calls with
5951 : : different args sizes. */
5952 : 38526 : if (!ACCUMULATE_OUTGOING_ARGS)
5953 : 38524 : add_args_size_note (insn, stack_pointer_delta);
5954 : : }
5955 : : else
5956 : : {
5957 : 0 : tree fn = builtin_decl_implicit (BUILT_IN_ABORT);
5958 : 0 : tree call_expr = build_call_expr (fn, 0);
5959 : 0 : expand_call (call_expr, NULL_RTX, false);
5960 : : }
5961 : :
5962 : 38526 : emit_barrier ();
5963 : 38526 : }
5964 : :
5965 : : /* Expand a call to __builtin_unreachable. We do nothing except emit
5966 : : a barrier saying that control flow will not pass here.
5967 : :
5968 : : It is the responsibility of the program being compiled to ensure
5969 : : that control flow does never reach __builtin_unreachable. */
5970 : : static void
5971 : 5395 : expand_builtin_unreachable (void)
5972 : : {
5973 : : /* Use gimple_build_builtin_unreachable or builtin_decl_unreachable
5974 : : to avoid this. */
5975 : 5395 : gcc_checking_assert (!sanitize_flags_p (SANITIZE_UNREACHABLE));
5976 : 5395 : emit_barrier ();
5977 : 5395 : }
5978 : :
5979 : : /* Expand EXP, a call to fabs, fabsf or fabsl.
5980 : : Return NULL_RTX if a normal call should be emitted rather than expanding
5981 : : the function inline. If convenient, the result should be placed
5982 : : in TARGET. SUBTARGET may be used as the target for computing
5983 : : the operand. */
5984 : :
5985 : : static rtx
5986 : 4 : expand_builtin_fabs (tree exp, rtx target, rtx subtarget)
5987 : : {
5988 : 4 : machine_mode mode;
5989 : 4 : tree arg;
5990 : 4 : rtx op0;
5991 : :
5992 : 4 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
5993 : : return NULL_RTX;
5994 : :
5995 : 0 : arg = CALL_EXPR_ARG (exp, 0);
5996 : 0 : CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
5997 : 0 : mode = TYPE_MODE (TREE_TYPE (arg));
5998 : 0 : op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
5999 : 0 : return expand_abs (mode, op0, target, 0, safe_from_p (target, arg, 1));
6000 : : }
6001 : :
6002 : : /* Expand EXP, a call to copysign, copysignf, or copysignl.
6003 : : Return NULL is a normal call should be emitted rather than expanding the
6004 : : function inline. If convenient, the result should be placed in TARGET.
6005 : : SUBTARGET may be used as the target for computing the operand. */
6006 : :
6007 : : static rtx
6008 : 11674 : expand_builtin_copysign (tree exp, rtx target, rtx subtarget)
6009 : : {
6010 : 11674 : rtx op0, op1;
6011 : 11674 : tree arg;
6012 : :
6013 : 11674 : if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE))
6014 : : return NULL_RTX;
6015 : :
6016 : 11673 : arg = CALL_EXPR_ARG (exp, 0);
6017 : 11673 : op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
6018 : :
6019 : 11673 : arg = CALL_EXPR_ARG (exp, 1);
6020 : 11673 : op1 = expand_normal (arg);
6021 : :
6022 : 11673 : return expand_copysign (op0, op1, target);
6023 : : }
6024 : :
6025 : : /* Emit a call to __builtin___clear_cache. */
6026 : :
6027 : : void
6028 : 0 : default_emit_call_builtin___clear_cache (rtx begin, rtx end)
6029 : : {
6030 : 0 : rtx callee = gen_rtx_SYMBOL_REF (Pmode,
6031 : : BUILTIN_ASM_NAME_PTR
6032 : : (BUILT_IN_CLEAR_CACHE));
6033 : :
6034 : 0 : emit_library_call (callee,
6035 : : LCT_NORMAL, VOIDmode,
6036 : : convert_memory_address (ptr_mode, begin), ptr_mode,
6037 : : convert_memory_address (ptr_mode, end), ptr_mode);
6038 : 0 : }
6039 : :
6040 : : /* Emit a call to __builtin___clear_cache, unless the target specifies
6041 : : it as do-nothing. This function can be used by trampoline
6042 : : finalizers to duplicate the effects of expanding a call to the
6043 : : clear_cache builtin. */
6044 : :
6045 : : void
6046 : 28 : maybe_emit_call_builtin___clear_cache (rtx begin, rtx end)
6047 : : {
6048 : 28 : gcc_assert ((GET_MODE (begin) == ptr_mode || GET_MODE (begin) == Pmode
6049 : : || CONST_INT_P (begin))
6050 : : && (GET_MODE (end) == ptr_mode || GET_MODE (end) == Pmode
6051 : : || CONST_INT_P (end)));
6052 : :
6053 : 28 : if (targetm.have_clear_cache ())
6054 : : {
6055 : : /* We have a "clear_cache" insn, and it will handle everything. */
6056 : 0 : class expand_operand ops[2];
6057 : :
6058 : 0 : create_address_operand (&ops[0], begin);
6059 : 0 : create_address_operand (&ops[1], end);
6060 : :
6061 : 0 : if (maybe_expand_insn (targetm.code_for_clear_cache, 2, ops))
6062 : 0 : return;
6063 : : }
6064 : : else
6065 : : {
6066 : : #ifndef CLEAR_INSN_CACHE
6067 : : /* There is no "clear_cache" insn, and __clear_cache() in libgcc
6068 : : does nothing. There is no need to call it. Do nothing. */
6069 : : return;
6070 : : #endif /* CLEAR_INSN_CACHE */
6071 : : }
6072 : :
6073 : 0 : targetm.calls.emit_call_builtin___clear_cache (begin, end);
6074 : : }
6075 : :
6076 : : /* Expand a call to __builtin___clear_cache. */
6077 : :
6078 : : static void
6079 : 28 : expand_builtin___clear_cache (tree exp)
6080 : : {
6081 : 28 : tree begin, end;
6082 : 28 : rtx begin_rtx, end_rtx;
6083 : :
6084 : : /* We must not expand to a library call. If we did, any
6085 : : fallback library function in libgcc that might contain a call to
6086 : : __builtin___clear_cache() would recurse infinitely. */
6087 : 28 : if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
6088 : : {
6089 : 0 : error ("both arguments to %<__builtin___clear_cache%> must be pointers");
6090 : 0 : return;
6091 : : }
6092 : :
6093 : 28 : begin = CALL_EXPR_ARG (exp, 0);
6094 : 30 : begin_rtx = expand_expr (begin, NULL_RTX, Pmode, EXPAND_NORMAL);
6095 : :
6096 : 28 : end = CALL_EXPR_ARG (exp, 1);
6097 : 30 : end_rtx = expand_expr (end, NULL_RTX, Pmode, EXPAND_NORMAL);
6098 : :
6099 : 28 : maybe_emit_call_builtin___clear_cache (begin_rtx, end_rtx);
6100 : : }
6101 : :
6102 : : /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
6103 : :
6104 : : static rtx
6105 : 634 : round_trampoline_addr (rtx tramp)
6106 : : {
6107 : 634 : rtx temp, addend, mask;
6108 : :
6109 : : /* If we don't need too much alignment, we'll have been guaranteed
6110 : : proper alignment by get_trampoline_type. */
6111 : 634 : if (TRAMPOLINE_ALIGNMENT <= STACK_BOUNDARY)
6112 : : return tramp;
6113 : :
6114 : : /* Round address up to desired boundary. */
6115 : 0 : temp = gen_reg_rtx (Pmode);
6116 : 0 : addend = gen_int_mode (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT - 1, Pmode);
6117 : 0 : mask = gen_int_mode (-TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT, Pmode);
6118 : :
6119 : 0 : temp = expand_simple_binop (Pmode, PLUS, tramp, addend,
6120 : : temp, 0, OPTAB_LIB_WIDEN);
6121 : 0 : tramp = expand_simple_binop (Pmode, AND, temp, mask,
6122 : : temp, 0, OPTAB_LIB_WIDEN);
6123 : :
6124 : 0 : return tramp;
6125 : : }
6126 : :
6127 : : static rtx
6128 : 295 : expand_builtin_init_trampoline (tree exp, bool onstack)
6129 : : {
6130 : 295 : tree t_tramp, t_func, t_chain;
6131 : 295 : rtx m_tramp, r_tramp, r_chain, tmp;
6132 : :
6133 : 295 : if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE,
6134 : : POINTER_TYPE, VOID_TYPE))
6135 : : return NULL_RTX;
6136 : :
6137 : 295 : t_tramp = CALL_EXPR_ARG (exp, 0);
6138 : 295 : t_func = CALL_EXPR_ARG (exp, 1);
6139 : 295 : t_chain = CALL_EXPR_ARG (exp, 2);
6140 : :
6141 : 295 : r_tramp = expand_normal (t_tramp);
6142 : 295 : m_tramp = gen_rtx_MEM (BLKmode, r_tramp);
6143 : 295 : MEM_NOTRAP_P (m_tramp) = 1;
6144 : :
6145 : : /* If ONSTACK, the TRAMP argument should be the address of a field
6146 : : within the local function's FRAME decl. Either way, let's see if
6147 : : we can fill in the MEM_ATTRs for this memory. */
6148 : 295 : if (TREE_CODE (t_tramp) == ADDR_EXPR)
6149 : 295 : set_mem_attributes (m_tramp, TREE_OPERAND (t_tramp, 0), true);
6150 : :
6151 : : /* Creator of a heap trampoline is responsible for making sure the
6152 : : address is aligned to at least STACK_BOUNDARY. Normally malloc
6153 : : will ensure this anyhow. */
6154 : 295 : tmp = round_trampoline_addr (r_tramp);
6155 : 295 : if (tmp != r_tramp)
6156 : : {
6157 : 0 : m_tramp = change_address (m_tramp, BLKmode, tmp);
6158 : 0 : set_mem_align (m_tramp, TRAMPOLINE_ALIGNMENT);
6159 : 0 : set_mem_size (m_tramp, TRAMPOLINE_SIZE);
6160 : : }
6161 : :
6162 : : /* The FUNC argument should be the address of the nested function.
6163 : : Extract the actual function decl to pass to the hook. */
6164 : 295 : gcc_assert (TREE_CODE (t_func) == ADDR_EXPR);
6165 : 295 : t_func = TREE_OPERAND (t_func, 0);
6166 : 295 : gcc_assert (TREE_CODE (t_func) == FUNCTION_DECL);
6167 : :
6168 : 295 : r_chain = expand_normal (t_chain);
6169 : :
6170 : : /* Generate insns to initialize the trampoline. */
6171 : 295 : targetm.calls.trampoline_init (m_tramp, t_func, r_chain);
6172 : :
6173 : 295 : if (onstack)
6174 : : {
6175 : 295 : trampolines_created = 1;
6176 : :
6177 : 295 : if (targetm.calls.custom_function_descriptors != 0)
6178 : 295 : warning_at (DECL_SOURCE_LOCATION (t_func), OPT_Wtrampolines,
6179 : : "trampoline generated for nested function %qD", t_func);
6180 : : }
6181 : :
6182 : 295 : return const0_rtx;
6183 : : }
6184 : :
6185 : : static rtx
6186 : 339 : expand_builtin_adjust_trampoline (tree exp)
6187 : : {
6188 : 339 : rtx tramp;
6189 : :
6190 : 339 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6191 : : return NULL_RTX;
6192 : :
6193 : 339 : tramp = expand_normal (CALL_EXPR_ARG (exp, 0));
6194 : 339 : tramp = round_trampoline_addr (tramp);
6195 : 339 : if (targetm.calls.trampoline_adjust_address)
6196 : 0 : tramp = targetm.calls.trampoline_adjust_address (tramp);
6197 : :
6198 : : return tramp;
6199 : : }
6200 : :
6201 : : /* Expand a call to the builtin descriptor initialization routine.
6202 : : A descriptor is made up of a couple of pointers to the static
6203 : : chain and the code entry in this order. */
6204 : :
6205 : : static rtx
6206 : 0 : expand_builtin_init_descriptor (tree exp)
6207 : : {
6208 : 0 : tree t_descr, t_func, t_chain;
6209 : 0 : rtx m_descr, r_descr, r_func, r_chain;
6210 : :
6211 : 0 : if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, POINTER_TYPE,
6212 : : VOID_TYPE))
6213 : : return NULL_RTX;
6214 : :
6215 : 0 : t_descr = CALL_EXPR_ARG (exp, 0);
6216 : 0 : t_func = CALL_EXPR_ARG (exp, 1);
6217 : 0 : t_chain = CALL_EXPR_ARG (exp, 2);
6218 : :
6219 : 0 : r_descr = expand_normal (t_descr);
6220 : 0 : m_descr = gen_rtx_MEM (BLKmode, r_descr);
6221 : 0 : MEM_NOTRAP_P (m_descr) = 1;
6222 : 0 : set_mem_align (m_descr, GET_MODE_ALIGNMENT (ptr_mode));
6223 : :
6224 : 0 : r_func = expand_normal (t_func);
6225 : 0 : r_chain = expand_normal (t_chain);
6226 : :
6227 : : /* Generate insns to initialize the descriptor. */
6228 : 0 : emit_move_insn (adjust_address_nv (m_descr, ptr_mode, 0), r_chain);
6229 : 0 : emit_move_insn (adjust_address_nv (m_descr, ptr_mode,
6230 : : POINTER_SIZE / BITS_PER_UNIT), r_func);
6231 : :
6232 : 0 : return const0_rtx;
6233 : : }
6234 : :
6235 : : /* Expand a call to the builtin descriptor adjustment routine. */
6236 : :
6237 : : static rtx
6238 : 0 : expand_builtin_adjust_descriptor (tree exp)
6239 : : {
6240 : 0 : rtx tramp;
6241 : :
6242 : 0 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6243 : : return NULL_RTX;
6244 : :
6245 : 0 : tramp = expand_normal (CALL_EXPR_ARG (exp, 0));
6246 : :
6247 : : /* Unalign the descriptor to allow runtime identification. */
6248 : 0 : tramp = plus_constant (ptr_mode, tramp,
6249 : 0 : targetm.calls.custom_function_descriptors);
6250 : :
6251 : 0 : return force_operand (tramp, NULL_RTX);
6252 : : }
6253 : :
6254 : : /* Expand the call EXP to the built-in signbit, signbitf or signbitl
6255 : : function. The function first checks whether the back end provides
6256 : : an insn to implement signbit for the respective mode. If not, it
6257 : : checks whether the floating point format of the value is such that
6258 : : the sign bit can be extracted. If that is not the case, error out.
6259 : : EXP is the expression that is a call to the builtin function; if
6260 : : convenient, the result should be placed in TARGET. */
6261 : : static rtx
6262 : 1139 : expand_builtin_signbit (tree exp, rtx target)
6263 : : {
6264 : 1139 : const struct real_format *fmt;
6265 : 1139 : scalar_float_mode fmode;
6266 : 1139 : scalar_int_mode rmode, imode;
6267 : 1139 : tree arg;
6268 : 1139 : int word, bitpos;
6269 : 1139 : enum insn_code icode;
6270 : 1139 : rtx temp;
6271 : 1139 : location_t loc = EXPR_LOCATION (exp);
6272 : :
6273 : 1139 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
6274 : : return NULL_RTX;
6275 : :
6276 : 1139 : arg = CALL_EXPR_ARG (exp, 0);
6277 : 1139 : fmode = SCALAR_FLOAT_TYPE_MODE (TREE_TYPE (arg));
6278 : 1139 : rmode = SCALAR_INT_TYPE_MODE (TREE_TYPE (exp));
6279 : 1139 : fmt = REAL_MODE_FORMAT (fmode);
6280 : :
6281 : 1139 : arg = builtin_save_expr (arg);
6282 : :
6283 : : /* Expand the argument yielding a RTX expression. */
6284 : 1139 : temp = expand_normal (arg);
6285 : :
6286 : : /* Check if the back end provides an insn that handles signbit for the
6287 : : argument's mode. */
6288 : 1139 : icode = optab_handler (signbit_optab, fmode);
6289 : 1139 : if (icode != CODE_FOR_nothing)
6290 : : {
6291 : 10 : rtx_insn *last = get_last_insn ();
6292 : 10 : rtx this_target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
6293 : 10 : if (maybe_emit_unop_insn (icode, this_target, temp, UNKNOWN))
6294 : : return this_target;
6295 : 0 : delete_insns_since (last);
6296 : : }
6297 : :
6298 : : /* For floating point formats without a sign bit, implement signbit
6299 : : as "ARG < 0.0". */
6300 : 1129 : bitpos = fmt->signbit_ro;
6301 : 1129 : if (bitpos < 0)
6302 : : {
6303 : : /* But we can't do this if the format supports signed zero. */
6304 : 0 : gcc_assert (!fmt->has_signed_zero || !HONOR_SIGNED_ZEROS (fmode));
6305 : :
6306 : 0 : arg = fold_build2_loc (loc, LT_EXPR, TREE_TYPE (exp), arg,
6307 : 0 : build_real (TREE_TYPE (arg), dconst0));
6308 : 0 : return expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
6309 : : }
6310 : :
6311 : 2258 : if (GET_MODE_SIZE (fmode) <= UNITS_PER_WORD)
6312 : : {
6313 : 1025 : imode = int_mode_for_mode (fmode).require ();
6314 : 1025 : temp = gen_lowpart (imode, temp);
6315 : : }
6316 : : else
6317 : : {
6318 : 104 : imode = word_mode;
6319 : : /* Handle targets with different FP word orders. */
6320 : 104 : if (FLOAT_WORDS_BIG_ENDIAN)
6321 : : word = (GET_MODE_BITSIZE (fmode) - bitpos) / BITS_PER_WORD;
6322 : : else
6323 : 104 : word = bitpos / BITS_PER_WORD;
6324 : 104 : temp = operand_subword_force (temp, word, fmode);
6325 : 104 : bitpos = bitpos % BITS_PER_WORD;
6326 : : }
6327 : :
6328 : : /* Force the intermediate word_mode (or narrower) result into a
6329 : : register. This avoids attempting to create paradoxical SUBREGs
6330 : : of floating point modes below. */
6331 : 1129 : temp = force_reg (imode, temp);
6332 : :
6333 : : /* If the bitpos is within the "result mode" lowpart, the operation
6334 : : can be implement with a single bitwise AND. Otherwise, we need
6335 : : a right shift and an AND. */
6336 : :
6337 : 2258 : if (bitpos < GET_MODE_BITSIZE (rmode))
6338 : : {
6339 : 921 : wide_int mask = wi::set_bit_in_zero (bitpos, GET_MODE_PRECISION (rmode));
6340 : :
6341 : 2763 : if (GET_MODE_SIZE (imode) > GET_MODE_SIZE (rmode))
6342 : 0 : temp = gen_lowpart (rmode, temp);
6343 : 1842 : temp = expand_binop (rmode, and_optab, temp,
6344 : 1842 : immed_wide_int_const (mask, rmode),
6345 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
6346 : 921 : }
6347 : : else
6348 : : {
6349 : : /* Perform a logical right shift to place the signbit in the least
6350 : : significant bit, then truncate the result to the desired mode
6351 : : and mask just this bit. */
6352 : 208 : temp = expand_shift (RSHIFT_EXPR, imode, temp, bitpos, NULL_RTX, 1);
6353 : 208 : temp = gen_lowpart (rmode, temp);
6354 : 208 : temp = expand_binop (rmode, and_optab, temp, const1_rtx,
6355 : : NULL_RTX, 1, OPTAB_LIB_WIDEN);
6356 : : }
6357 : :
6358 : : return temp;
6359 : : }
6360 : :
6361 : : /* Expand fork or exec calls. TARGET is the desired target of the
6362 : : call. EXP is the call. FN is the
6363 : : identificator of the actual function. IGNORE is nonzero if the
6364 : : value is to be ignored. */
6365 : :
6366 : : static rtx
6367 : 87 : expand_builtin_fork_or_exec (tree fn, tree exp, rtx target, int ignore)
6368 : : {
6369 : 87 : tree id, decl;
6370 : 87 : tree call;
6371 : :
6372 : : /* If we are not profiling, just call the function. */
6373 : 87 : if (!coverage_instrumentation_p ())
6374 : : return NULL_RTX;
6375 : :
6376 : : /* Otherwise call the wrapper. This should be equivalent for the rest of
6377 : : compiler, so the code does not diverge, and the wrapper may run the
6378 : : code necessary for keeping the profiling sane. */
6379 : :
6380 : 4 : switch (DECL_FUNCTION_CODE (fn))
6381 : : {
6382 : 4 : case BUILT_IN_FORK:
6383 : 4 : id = get_identifier ("__gcov_fork");
6384 : 4 : break;
6385 : :
6386 : 0 : case BUILT_IN_EXECL:
6387 : 0 : id = get_identifier ("__gcov_execl");
6388 : 0 : break;
6389 : :
6390 : 0 : case BUILT_IN_EXECV:
6391 : 0 : id = get_identifier ("__gcov_execv");
6392 : 0 : break;
6393 : :
6394 : 0 : case BUILT_IN_EXECLP:
6395 : 0 : id = get_identifier ("__gcov_execlp");
6396 : 0 : break;
6397 : :
6398 : 0 : case BUILT_IN_EXECLE:
6399 : 0 : id = get_identifier ("__gcov_execle");
6400 : 0 : break;
6401 : :
6402 : 0 : case BUILT_IN_EXECVP:
6403 : 0 : id = get_identifier ("__gcov_execvp");
6404 : 0 : break;
6405 : :
6406 : 0 : case BUILT_IN_EXECVE:
6407 : 0 : id = get_identifier ("__gcov_execve");
6408 : 0 : break;
6409 : :
6410 : 0 : default:
6411 : 0 : gcc_unreachable ();
6412 : : }
6413 : :
6414 : 4 : decl = build_decl (DECL_SOURCE_LOCATION (fn),
6415 : 4 : FUNCTION_DECL, id, TREE_TYPE (fn));
6416 : 4 : DECL_EXTERNAL (decl) = 1;
6417 : 4 : TREE_PUBLIC (decl) = 1;
6418 : 4 : DECL_ARTIFICIAL (decl) = 1;
6419 : 4 : TREE_NOTHROW (decl) = 1;
6420 : 4 : DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
6421 : 4 : DECL_VISIBILITY_SPECIFIED (decl) = 1;
6422 : 4 : call = rewrite_call_expr (EXPR_LOCATION (exp), exp, 0, decl, 0);
6423 : 4 : return expand_call (call, target, ignore);
6424 : : }
6425 : :
6426 : :
6427 : :
6428 : : /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
6429 : : the pointer in these functions is void*, the tree optimizers may remove
6430 : : casts. The mode computed in expand_builtin isn't reliable either, due
6431 : : to __sync_bool_compare_and_swap.
6432 : :
6433 : : FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
6434 : : group of builtins. This gives us log2 of the mode size. */
6435 : :
6436 : : static inline machine_mode
6437 : 135347 : get_builtin_sync_mode (int fcode_diff)
6438 : : {
6439 : : /* The size is not negotiable, so ask not to get BLKmode in return
6440 : : if the target indicates that a smaller size would be better. */
6441 : 135347 : return int_mode_for_size (BITS_PER_UNIT << fcode_diff, 0).require ();
6442 : : }
6443 : :
6444 : : /* Expand the memory expression LOC and return the appropriate memory operand
6445 : : for the builtin_sync operations. */
6446 : :
6447 : : static rtx
6448 : 152072 : get_builtin_sync_mem (tree loc, machine_mode mode)
6449 : : {
6450 : 152072 : rtx addr, mem;
6451 : 152072 : int addr_space = TYPE_ADDR_SPACE (POINTER_TYPE_P (TREE_TYPE (loc))
6452 : : ? TREE_TYPE (TREE_TYPE (loc))
6453 : : : TREE_TYPE (loc));
6454 : 152072 : scalar_int_mode addr_mode = targetm.addr_space.address_mode (addr_space);
6455 : :
6456 : 152072 : addr = expand_expr (loc, NULL_RTX, addr_mode, EXPAND_SUM);
6457 : 152072 : addr = convert_memory_address (addr_mode, addr);
6458 : :
6459 : : /* Note that we explicitly do not want any alias information for this
6460 : : memory, so that we kill all other live memories. Otherwise we don't
6461 : : satisfy the full barrier semantics of the intrinsic. */
6462 : 152072 : mem = gen_rtx_MEM (mode, addr);
6463 : :
6464 : 152072 : set_mem_addr_space (mem, addr_space);
6465 : :
6466 : 152072 : mem = validize_mem (mem);
6467 : :
6468 : : /* The alignment needs to be at least according to that of the mode. */
6469 : 152072 : set_mem_align (mem, MAX (GET_MODE_ALIGNMENT (mode),
6470 : : get_pointer_alignment (loc)));
6471 : 152072 : set_mem_alias_set (mem, ALIAS_SET_MEMORY_BARRIER);
6472 : 152072 : MEM_VOLATILE_P (mem) = 1;
6473 : :
6474 : 152072 : return mem;
6475 : : }
6476 : :
6477 : : /* Make sure an argument is in the right mode.
6478 : : EXP is the tree argument.
6479 : : MODE is the mode it should be in. */
6480 : :
6481 : : static rtx
6482 : 95061 : expand_expr_force_mode (tree exp, machine_mode mode)
6483 : : {
6484 : 95061 : rtx val;
6485 : 95061 : machine_mode old_mode;
6486 : :
6487 : 95061 : if (TREE_CODE (exp) == SSA_NAME
6488 : 95061 : && TYPE_MODE (TREE_TYPE (exp)) != mode)
6489 : : {
6490 : : /* Undo argument promotion if possible, as combine might not
6491 : : be able to do it later due to MEM_VOLATILE_P uses in the
6492 : : patterns. */
6493 : 25 : gimple *g = get_gimple_for_ssa_name (exp);
6494 : 25 : if (g && gimple_assign_cast_p (g))
6495 : : {
6496 : 0 : tree rhs = gimple_assign_rhs1 (g);
6497 : 0 : tree_code code = gimple_assign_rhs_code (g);
6498 : 0 : if (CONVERT_EXPR_CODE_P (code)
6499 : 0 : && TYPE_MODE (TREE_TYPE (rhs)) == mode
6500 : 0 : && INTEGRAL_TYPE_P (TREE_TYPE (exp))
6501 : 0 : && INTEGRAL_TYPE_P (TREE_TYPE (rhs))
6502 : 0 : && (TYPE_PRECISION (TREE_TYPE (exp))
6503 : 0 : > TYPE_PRECISION (TREE_TYPE (rhs))))
6504 : : exp = rhs;
6505 : : }
6506 : : }
6507 : :
6508 : 95061 : val = expand_expr (exp, NULL_RTX, mode, EXPAND_NORMAL);
6509 : : /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
6510 : : of CONST_INTs, where we know the old_mode only from the call argument. */
6511 : :
6512 : 95061 : old_mode = GET_MODE (val);
6513 : 95061 : if (old_mode == VOIDmode)
6514 : 45212 : old_mode = TYPE_MODE (TREE_TYPE (exp));
6515 : 95061 : val = convert_modes (mode, old_mode, val, 1);
6516 : 95061 : return val;
6517 : : }
6518 : :
6519 : :
6520 : : /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
6521 : : EXP is the CALL_EXPR. CODE is the rtx code
6522 : : that corresponds to the arithmetic or logical operation from the name;
6523 : : an exception here is that NOT actually means NAND. TARGET is an optional
6524 : : place for us to store the results; AFTER is true if this is the
6525 : : fetch_and_xxx form. */
6526 : :
6527 : : static rtx
6528 : 3997 : expand_builtin_sync_operation (machine_mode mode, tree exp,
6529 : : enum rtx_code code, bool after,
6530 : : rtx target)
6531 : : {
6532 : 3997 : rtx val, mem;
6533 : 3997 : location_t loc = EXPR_LOCATION (exp);
6534 : :
6535 : 3997 : if (code == NOT && warn_sync_nand)
6536 : : {
6537 : 517 : tree fndecl = get_callee_fndecl (exp);
6538 : 517 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6539 : :
6540 : 517 : static bool warned_f_a_n, warned_n_a_f;
6541 : :
6542 : 517 : switch (fcode)
6543 : : {
6544 : 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_1:
6545 : 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_2:
6546 : 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_4:
6547 : 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_8:
6548 : 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_16:
6549 : 434 : if (warned_f_a_n)
6550 : : break;
6551 : :
6552 : 30 : fndecl = builtin_decl_implicit (BUILT_IN_SYNC_FETCH_AND_NAND_N);
6553 : 30 : inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
6554 : 30 : warned_f_a_n = true;
6555 : 30 : break;
6556 : :
6557 : 83 : case BUILT_IN_SYNC_NAND_AND_FETCH_1:
6558 : 83 : case BUILT_IN_SYNC_NAND_AND_FETCH_2:
6559 : 83 : case BUILT_IN_SYNC_NAND_AND_FETCH_4:
6560 : 83 : case BUILT_IN_SYNC_NAND_AND_FETCH_8:
6561 : 83 : case BUILT_IN_SYNC_NAND_AND_FETCH_16:
6562 : 83 : if (warned_n_a_f)
6563 : : break;
6564 : :
6565 : 16 : fndecl = builtin_decl_implicit (BUILT_IN_SYNC_NAND_AND_FETCH_N);
6566 : 16 : inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
6567 : 16 : warned_n_a_f = true;
6568 : 16 : break;
6569 : :
6570 : 0 : default:
6571 : 0 : gcc_unreachable ();
6572 : : }
6573 : : }
6574 : :
6575 : : /* Expand the operands. */
6576 : 3997 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6577 : 3997 : val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
6578 : :
6579 : 3997 : return expand_atomic_fetch_op (target, mem, val, code, MEMMODEL_SYNC_SEQ_CST,
6580 : 3997 : after);
6581 : : }
6582 : :
6583 : : /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
6584 : : intrinsics. EXP is the CALL_EXPR. IS_BOOL is
6585 : : true if this is the boolean form. TARGET is a place for us to store the
6586 : : results; this is NOT optional if IS_BOOL is true. */
6587 : :
6588 : : static rtx
6589 : 456 : expand_builtin_compare_and_swap (machine_mode mode, tree exp,
6590 : : bool is_bool, rtx target)
6591 : : {
6592 : 456 : rtx old_val, new_val, mem;
6593 : 456 : rtx *pbool, *poval;
6594 : :
6595 : : /* Expand the operands. */
6596 : 456 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6597 : 456 : old_val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
6598 : 456 : new_val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 2), mode);
6599 : :
6600 : 456 : pbool = poval = NULL;
6601 : 456 : if (target != const0_rtx)
6602 : : {
6603 : 430 : if (is_bool)
6604 : : pbool = ⌖
6605 : : else
6606 : 230 : poval = ⌖
6607 : : }
6608 : 456 : if (!expand_atomic_compare_and_swap (pbool, poval, mem, old_val, new_val,
6609 : : false, MEMMODEL_SYNC_SEQ_CST,
6610 : : MEMMODEL_SYNC_SEQ_CST))
6611 : : return NULL_RTX;
6612 : :
6613 : 454 : return target;
6614 : : }
6615 : :
6616 : : /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
6617 : : general form is actually an atomic exchange, and some targets only
6618 : : support a reduced form with the second argument being a constant 1.
6619 : : EXP is the CALL_EXPR; TARGET is an optional place for us to store
6620 : : the results. */
6621 : :
6622 : : static rtx
6623 : 326 : expand_builtin_sync_lock_test_and_set (machine_mode mode, tree exp,
6624 : : rtx target)
6625 : : {
6626 : 326 : rtx val, mem;
6627 : :
6628 : : /* Expand the operands. */
6629 : 326 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6630 : 326 : val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
6631 : :
6632 : 326 : return expand_sync_lock_test_and_set (target, mem, val);
6633 : : }
6634 : :
6635 : : /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
6636 : :
6637 : : static rtx
6638 : 158 : expand_builtin_sync_lock_release (machine_mode mode, tree exp)
6639 : : {
6640 : 158 : rtx mem;
6641 : :
6642 : : /* Expand the operands. */
6643 : 158 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6644 : :
6645 : 158 : return expand_atomic_store (mem, const0_rtx, MEMMODEL_SYNC_RELEASE, true);
6646 : : }
6647 : :
6648 : : /* Given an integer representing an ``enum memmodel'', verify its
6649 : : correctness and return the memory model enum. */
6650 : :
6651 : : static enum memmodel
6652 : 170637 : get_memmodel (tree exp)
6653 : : {
6654 : : /* If the parameter is not a constant, it's a run time value so we'll just
6655 : : convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
6656 : 170637 : if (TREE_CODE (exp) != INTEGER_CST)
6657 : : return MEMMODEL_SEQ_CST;
6658 : :
6659 : 169784 : rtx op = expand_normal (exp);
6660 : :
6661 : 169784 : unsigned HOST_WIDE_INT val = INTVAL (op);
6662 : 169784 : if (targetm.memmodel_check)
6663 : 169784 : val = targetm.memmodel_check (val);
6664 : 0 : else if (val & ~MEMMODEL_MASK)
6665 : : return MEMMODEL_SEQ_CST;
6666 : :
6667 : : /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
6668 : 169784 : if (memmodel_base (val) >= MEMMODEL_LAST)
6669 : : return MEMMODEL_SEQ_CST;
6670 : :
6671 : : /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
6672 : : be conservative and promote consume to acquire. */
6673 : 169783 : if (val == MEMMODEL_CONSUME)
6674 : 750 : val = MEMMODEL_ACQUIRE;
6675 : :
6676 : 169783 : return (enum memmodel) val;
6677 : : }
6678 : :
6679 : : /* Expand the __atomic_exchange intrinsic:
6680 : : TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
6681 : : EXP is the CALL_EXPR.
6682 : : TARGET is an optional place for us to store the results. */
6683 : :
6684 : : static rtx
6685 : 2850 : expand_builtin_atomic_exchange (machine_mode mode, tree exp, rtx target)
6686 : : {
6687 : 2850 : rtx val, mem;
6688 : 2850 : enum memmodel model;
6689 : :
6690 : 2850 : model = get_memmodel (CALL_EXPR_ARG (exp, 2));
6691 : :
6692 : 2850 : if (!flag_inline_atomics)
6693 : : return NULL_RTX;
6694 : :
6695 : : /* Expand the operands. */
6696 : 2799 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6697 : 2799 : val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
6698 : :
6699 : 2799 : return expand_atomic_exchange (target, mem, val, model);
6700 : : }
6701 : :
6702 : : /* Expand the __atomic_compare_exchange intrinsic:
6703 : : bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
6704 : : TYPE desired, BOOL weak,
6705 : : enum memmodel success,
6706 : : enum memmodel failure)
6707 : : EXP is the CALL_EXPR.
6708 : : TARGET is an optional place for us to store the results. */
6709 : :
6710 : : static rtx
6711 : 9234 : expand_builtin_atomic_compare_exchange (machine_mode mode, tree exp,
6712 : : rtx target)
6713 : : {
6714 : 9234 : rtx expect, desired, mem, oldval;
6715 : 9234 : rtx_code_label *label;
6716 : 9234 : tree weak;
6717 : 9234 : bool is_weak;
6718 : :
6719 : 9234 : memmodel success = get_memmodel (CALL_EXPR_ARG (exp, 4));
6720 : 9234 : memmodel failure = get_memmodel (CALL_EXPR_ARG (exp, 5));
6721 : :
6722 : 9234 : if (failure > success)
6723 : 22 : success = MEMMODEL_SEQ_CST;
6724 : :
6725 : 9234 : if (is_mm_release (failure) || is_mm_acq_rel (failure))
6726 : : {
6727 : : failure = MEMMODEL_SEQ_CST;
6728 : : success = MEMMODEL_SEQ_CST;
6729 : : }
6730 : :
6731 : :
6732 : 9234 : if (!flag_inline_atomics)
6733 : : return NULL_RTX;
6734 : :
6735 : : /* Expand the operands. */
6736 : 9183 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6737 : :
6738 : 9183 : expect = expand_normal (CALL_EXPR_ARG (exp, 1));
6739 : 9183 : expect = convert_memory_address (Pmode, expect);
6740 : 9183 : expect = gen_rtx_MEM (mode, expect);
6741 : 9183 : desired = expand_expr_force_mode (CALL_EXPR_ARG (exp, 2), mode);
6742 : :
6743 : 9183 : weak = CALL_EXPR_ARG (exp, 3);
6744 : 9183 : is_weak = false;
6745 : 9183 : if (tree_fits_shwi_p (weak) && tree_to_shwi (weak) != 0)
6746 : 9183 : is_weak = true;
6747 : :
6748 : 9183 : if (target == const0_rtx)
6749 : 282 : target = NULL;
6750 : :
6751 : : /* Lest the rtl backend create a race condition with an imporoper store
6752 : : to memory, always create a new pseudo for OLDVAL. */
6753 : 9183 : oldval = NULL;
6754 : :
6755 : 9183 : if (!expand_atomic_compare_and_swap (&target, &oldval, mem, expect, desired,
6756 : : is_weak, success, failure))
6757 : : return NULL_RTX;
6758 : :
6759 : : /* Conditionally store back to EXPECT, lest we create a race condition
6760 : : with an improper store to memory. */
6761 : : /* ??? With a rearrangement of atomics at the gimple level, we can handle
6762 : : the normal case where EXPECT is totally private, i.e. a register. At
6763 : : which point the store can be unconditional. */
6764 : 7434 : label = gen_label_rtx ();
6765 : 7434 : emit_cmp_and_jump_insns (target, const0_rtx, NE, NULL,
6766 : 7434 : GET_MODE (target), 1, label);
6767 : 7434 : emit_move_insn (expect, oldval);
6768 : 7434 : emit_label (label);
6769 : :
6770 : 7434 : return target;
6771 : : }
6772 : :
6773 : : /* Helper function for expand_ifn_atomic_compare_exchange - expand
6774 : : internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6775 : : call. The weak parameter must be dropped to match the expected parameter
6776 : : list and the expected argument changed from value to pointer to memory
6777 : : slot. */
6778 : :
6779 : : static void
6780 : 0 : expand_ifn_atomic_compare_exchange_into_call (gcall *call, machine_mode mode)
6781 : : {
6782 : 0 : unsigned int z;
6783 : 0 : vec<tree, va_gc> *vec;
6784 : :
6785 : 0 : vec_alloc (vec, 5);
6786 : 0 : vec->quick_push (gimple_call_arg (call, 0));
6787 : 0 : tree expected = gimple_call_arg (call, 1);
6788 : 0 : rtx x = assign_stack_temp_for_type (mode, GET_MODE_SIZE (mode),
6789 : 0 : TREE_TYPE (expected));
6790 : 0 : rtx expd = expand_expr (expected, x, mode, EXPAND_NORMAL);
6791 : 0 : if (expd != x)
6792 : 0 : emit_move_insn (x, expd);
6793 : 0 : tree v = make_tree (TREE_TYPE (expected), x);
6794 : 0 : vec->quick_push (build1 (ADDR_EXPR,
6795 : 0 : build_pointer_type (TREE_TYPE (expected)), v));
6796 : 0 : vec->quick_push (gimple_call_arg (call, 2));
6797 : : /* Skip the boolean weak parameter. */
6798 : 0 : for (z = 4; z < 6; z++)
6799 : 0 : vec->quick_push (gimple_call_arg (call, z));
6800 : : /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6801 : 0 : unsigned int bytes_log2 = exact_log2 (GET_MODE_SIZE (mode).to_constant ());
6802 : 0 : gcc_assert (bytes_log2 < 5);
6803 : 0 : built_in_function fncode
6804 : : = (built_in_function) ((int) BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1
6805 : : + bytes_log2);
6806 : 0 : tree fndecl = builtin_decl_explicit (fncode);
6807 : 0 : tree fn = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fndecl)),
6808 : : fndecl);
6809 : 0 : tree exp = build_call_vec (boolean_type_node, fn, vec);
6810 : 0 : tree lhs = gimple_call_lhs (call);
6811 : 0 : rtx boolret = expand_call (exp, NULL_RTX, lhs == NULL_TREE);
6812 : 0 : if (lhs)
6813 : : {
6814 : 0 : rtx target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE);
6815 : 0 : if (GET_MODE (boolret) != mode)
6816 : 0 : boolret = convert_modes (mode, GET_MODE (boolret), boolret, 1);
6817 : 0 : x = force_reg (mode, x);
6818 : 0 : write_complex_part (target, boolret, true, true);
6819 : 0 : write_complex_part (target, x, false, false);
6820 : : }
6821 : 0 : }
6822 : :
6823 : : /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6824 : :
6825 : : void
6826 : 13880 : expand_ifn_atomic_compare_exchange (gcall *call)
6827 : : {
6828 : 13880 : int size = tree_to_shwi (gimple_call_arg (call, 3)) & 255;
6829 : 13880 : gcc_assert (size == 1 || size == 2 || size == 4 || size == 8 || size == 16);
6830 : 13880 : machine_mode mode = int_mode_for_size (BITS_PER_UNIT * size, 0).require ();
6831 : :
6832 : 13880 : memmodel success = get_memmodel (gimple_call_arg (call, 4));
6833 : 13880 : memmodel failure = get_memmodel (gimple_call_arg (call, 5));
6834 : :
6835 : 13880 : if (failure > success)
6836 : 0 : success = MEMMODEL_SEQ_CST;
6837 : :
6838 : 13880 : if (is_mm_release (failure) || is_mm_acq_rel (failure))
6839 : : {
6840 : : failure = MEMMODEL_SEQ_CST;
6841 : : success = MEMMODEL_SEQ_CST;
6842 : : }
6843 : :
6844 : 13880 : if (!flag_inline_atomics)
6845 : : {
6846 : 0 : expand_ifn_atomic_compare_exchange_into_call (call, mode);
6847 : 0 : return;
6848 : : }
6849 : :
6850 : : /* Expand the operands. */
6851 : 13880 : rtx mem = get_builtin_sync_mem (gimple_call_arg (call, 0), mode);
6852 : :
6853 : 13880 : rtx expect = expand_expr_force_mode (gimple_call_arg (call, 1), mode);
6854 : 13880 : rtx desired = expand_expr_force_mode (gimple_call_arg (call, 2), mode);
6855 : :
6856 : 13880 : bool is_weak = (tree_to_shwi (gimple_call_arg (call, 3)) & 256) != 0;
6857 : :
6858 : 13880 : rtx boolret = NULL;
6859 : 13880 : rtx oldval = NULL;
6860 : :
6861 : 13880 : if (!expand_atomic_compare_and_swap (&boolret, &oldval, mem, expect, desired,
6862 : : is_weak, success, failure))
6863 : : {
6864 : 0 : expand_ifn_atomic_compare_exchange_into_call (call, mode);
6865 : 0 : return;
6866 : : }
6867 : :
6868 : 13880 : tree lhs = gimple_call_lhs (call);
6869 : 13880 : if (lhs)
6870 : : {
6871 : 13680 : rtx target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE);
6872 : 13680 : if (GET_MODE (boolret) != mode)
6873 : 12166 : boolret = convert_modes (mode, GET_MODE (boolret), boolret, 1);
6874 : 13680 : write_complex_part (target, boolret, true, true);
6875 : 13680 : write_complex_part (target, oldval, false, false);
6876 : : }
6877 : : }
6878 : :
6879 : : /* Expand the __atomic_load intrinsic:
6880 : : TYPE __atomic_load (TYPE *object, enum memmodel)
6881 : : EXP is the CALL_EXPR.
6882 : : TARGET is an optional place for us to store the results. */
6883 : :
6884 : : static rtx
6885 : 70905 : expand_builtin_atomic_load (machine_mode mode, tree exp, rtx target)
6886 : : {
6887 : 70905 : memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 1));
6888 : 70905 : if (is_mm_release (model) || is_mm_acq_rel (model))
6889 : : model = MEMMODEL_SEQ_CST;
6890 : :
6891 : 70905 : if (!flag_inline_atomics)
6892 : : return NULL_RTX;
6893 : :
6894 : : /* Expand the operand. */
6895 : 70864 : rtx mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6896 : :
6897 : 70864 : return expand_atomic_load (target, mem, model);
6898 : : }
6899 : :
6900 : :
6901 : : /* Expand the __atomic_store intrinsic:
6902 : : void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6903 : : EXP is the CALL_EXPR.
6904 : : TARGET is an optional place for us to store the results. */
6905 : :
6906 : : static rtx
6907 : 17538 : expand_builtin_atomic_store (machine_mode mode, tree exp)
6908 : : {
6909 : 17538 : memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 2));
6910 : 17538 : if (!(is_mm_relaxed (model) || is_mm_seq_cst (model)
6911 : 1593 : || is_mm_release (model)))
6912 : : model = MEMMODEL_SEQ_CST;
6913 : :
6914 : 17538 : if (!flag_inline_atomics)
6915 : : return NULL_RTX;
6916 : :
6917 : : /* Expand the operands. */
6918 : 17507 : rtx mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6919 : 17507 : rtx val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
6920 : :
6921 : 17507 : return expand_atomic_store (mem, val, model, false);
6922 : : }
6923 : :
6924 : : /* Expand the __atomic_fetch_XXX intrinsic:
6925 : : TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6926 : : EXP is the CALL_EXPR.
6927 : : TARGET is an optional place for us to store the results.
6928 : : CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6929 : : FETCH_AFTER is true if returning the result of the operation.
6930 : : FETCH_AFTER is false if returning the value before the operation.
6931 : : IGNORE is true if the result is not used.
6932 : : EXT_CALL is the correct builtin for an external call if this cannot be
6933 : : resolved to an instruction sequence. */
6934 : :
6935 : : static rtx
6936 : 29853 : expand_builtin_atomic_fetch_op (machine_mode mode, tree exp, rtx target,
6937 : : enum rtx_code code, bool fetch_after,
6938 : : bool ignore, enum built_in_function ext_call)
6939 : : {
6940 : 29853 : rtx val, mem, ret;
6941 : 29853 : enum memmodel model;
6942 : 29853 : tree fndecl;
6943 : 29853 : tree addr;
6944 : :
6945 : 29853 : model = get_memmodel (CALL_EXPR_ARG (exp, 2));
6946 : :
6947 : : /* Expand the operands. */
6948 : 29853 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6949 : 29853 : val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
6950 : :
6951 : : /* Only try generating instructions if inlining is turned on. */
6952 : 29853 : if (flag_inline_atomics)
6953 : : {
6954 : 29310 : ret = expand_atomic_fetch_op (target, mem, val, code, model, fetch_after);
6955 : 29310 : if (ret)
6956 : : return ret;
6957 : : }
6958 : :
6959 : : /* Return if a different routine isn't needed for the library call. */
6960 : 1142 : if (ext_call == BUILT_IN_NONE)
6961 : : return NULL_RTX;
6962 : :
6963 : : /* Change the call to the specified function. */
6964 : 279 : fndecl = get_callee_fndecl (exp);
6965 : 279 : addr = CALL_EXPR_FN (exp);
6966 : 279 : STRIP_NOPS (addr);
6967 : :
6968 : 279 : gcc_assert (TREE_OPERAND (addr, 0) == fndecl);
6969 : 279 : TREE_OPERAND (addr, 0) = builtin_decl_explicit (ext_call);
6970 : :
6971 : : /* If we will emit code after the call, the call cannot be a tail call.
6972 : : If it is emitted as a tail call, a barrier is emitted after it, and
6973 : : then all trailing code is removed. */
6974 : 279 : if (!ignore)
6975 : 182 : CALL_EXPR_TAILCALL (exp) = 0;
6976 : :
6977 : : /* Expand the call here so we can emit trailing code. */
6978 : 279 : ret = expand_call (exp, target, ignore);
6979 : :
6980 : : /* Replace the original function just in case it matters. */
6981 : 279 : TREE_OPERAND (addr, 0) = fndecl;
6982 : :
6983 : : /* Then issue the arithmetic correction to return the right result. */
6984 : 279 : if (!ignore)
6985 : : {
6986 : 182 : if (code == NOT)
6987 : : {
6988 : 31 : ret = expand_simple_binop (mode, AND, ret, val, NULL_RTX, true,
6989 : : OPTAB_LIB_WIDEN);
6990 : 31 : ret = expand_simple_unop (mode, NOT, ret, target, true);
6991 : : }
6992 : : else
6993 : 151 : ret = expand_simple_binop (mode, code, ret, val, target, true,
6994 : : OPTAB_LIB_WIDEN);
6995 : : }
6996 : : return ret;
6997 : : }
6998 : :
6999 : : /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
7000 : :
7001 : : void
7002 : 427 : expand_ifn_atomic_bit_test_and (gcall *call)
7003 : : {
7004 : 427 : tree ptr = gimple_call_arg (call, 0);
7005 : 427 : tree bit = gimple_call_arg (call, 1);
7006 : 427 : tree flag = gimple_call_arg (call, 2);
7007 : 427 : tree lhs = gimple_call_lhs (call);
7008 : 427 : enum memmodel model = MEMMODEL_SYNC_SEQ_CST;
7009 : 427 : machine_mode mode = TYPE_MODE (TREE_TYPE (flag));
7010 : 427 : enum rtx_code code;
7011 : 427 : optab optab;
7012 : 427 : class expand_operand ops[5];
7013 : :
7014 : 427 : gcc_assert (flag_inline_atomics);
7015 : :
7016 : 427 : if (gimple_call_num_args (call) == 5)
7017 : 296 : model = get_memmodel (gimple_call_arg (call, 3));
7018 : :
7019 : 427 : rtx mem = get_builtin_sync_mem (ptr, mode);
7020 : 427 : rtx val = expand_expr_force_mode (bit, mode);
7021 : :
7022 : 427 : switch (gimple_call_internal_fn (call))
7023 : : {
7024 : : case IFN_ATOMIC_BIT_TEST_AND_SET:
7025 : : code = IOR;
7026 : : optab = atomic_bit_test_and_set_optab;
7027 : : break;
7028 : : case IFN_ATOMIC_BIT_TEST_AND_COMPLEMENT:
7029 : : code = XOR;
7030 : : optab = atomic_bit_test_and_complement_optab;
7031 : : break;
7032 : : case IFN_ATOMIC_BIT_TEST_AND_RESET:
7033 : : code = AND;
7034 : : optab = atomic_bit_test_and_reset_optab;
7035 : : break;
7036 : 0 : default:
7037 : 0 : gcc_unreachable ();
7038 : : }
7039 : :
7040 : 427 : if (lhs == NULL_TREE)
7041 : : {
7042 : 0 : rtx val2 = expand_simple_binop (mode, ASHIFT, const1_rtx,
7043 : : val, NULL_RTX, true, OPTAB_DIRECT);
7044 : 0 : if (code == AND)
7045 : 0 : val2 = expand_simple_unop (mode, NOT, val2, NULL_RTX, true);
7046 : 0 : if (expand_atomic_fetch_op (const0_rtx, mem, val2, code, model, false))
7047 : 427 : return;
7048 : : }
7049 : :
7050 : 427 : rtx target;
7051 : 427 : if (lhs)
7052 : 427 : target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE);
7053 : : else
7054 : 0 : target = gen_reg_rtx (mode);
7055 : 427 : enum insn_code icode = direct_optab_handler (optab, mode);
7056 : 427 : gcc_assert (icode != CODE_FOR_nothing);
7057 : 427 : create_output_operand (&ops[0], target, mode);
7058 : 427 : create_fixed_operand (&ops[1], mem);
7059 : 427 : create_convert_operand_to (&ops[2], val, mode, true);
7060 : 427 : create_integer_operand (&ops[3], model);
7061 : 427 : create_integer_operand (&ops[4], integer_onep (flag));
7062 : 427 : if (maybe_expand_insn (icode, 5, ops))
7063 : : return;
7064 : :
7065 : 0 : rtx bitval = val;
7066 : 0 : val = expand_simple_binop (mode, ASHIFT, const1_rtx,
7067 : : val, NULL_RTX, true, OPTAB_DIRECT);
7068 : 0 : rtx maskval = val;
7069 : 0 : if (code == AND)
7070 : 0 : val = expand_simple_unop (mode, NOT, val, NULL_RTX, true);
7071 : 0 : rtx result = expand_atomic_fetch_op (gen_reg_rtx (mode), mem, val,
7072 : : code, model, false);
7073 : 0 : if (!result)
7074 : : {
7075 : 0 : bool is_atomic = gimple_call_num_args (call) == 5;
7076 : 0 : tree tcall = gimple_call_arg (call, 3 + is_atomic);
7077 : 0 : tree fndecl = gimple_call_addr_fndecl (tcall);
7078 : 0 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
7079 : 0 : tree exp = build_call_nary (type, tcall, 2 + is_atomic, ptr,
7080 : : make_tree (type, val),
7081 : : is_atomic
7082 : 0 : ? gimple_call_arg (call, 3)
7083 : : : integer_zero_node);
7084 : 0 : result = expand_builtin (exp, gen_reg_rtx (mode), NULL_RTX,
7085 : : mode, !lhs);
7086 : : }
7087 : 0 : if (!lhs)
7088 : : return;
7089 : 0 : if (integer_onep (flag))
7090 : : {
7091 : 0 : result = expand_simple_binop (mode, ASHIFTRT, result, bitval,
7092 : : NULL_RTX, true, OPTAB_DIRECT);
7093 : 0 : result = expand_simple_binop (mode, AND, result, const1_rtx, target,
7094 : : true, OPTAB_DIRECT);
7095 : : }
7096 : : else
7097 : 0 : result = expand_simple_binop (mode, AND, result, maskval, target, true,
7098 : : OPTAB_DIRECT);
7099 : 0 : if (result != target)
7100 : 0 : emit_move_insn (target, result);
7101 : : }
7102 : :
7103 : : /* Expand IFN_ATOMIC_*_FETCH_CMP_0 internal function. */
7104 : :
7105 : : void
7106 : 2297 : expand_ifn_atomic_op_fetch_cmp_0 (gcall *call)
7107 : : {
7108 : 2297 : tree cmp = gimple_call_arg (call, 0);
7109 : 2297 : tree ptr = gimple_call_arg (call, 1);
7110 : 2297 : tree arg = gimple_call_arg (call, 2);
7111 : 2297 : tree lhs = gimple_call_lhs (call);
7112 : 2297 : enum memmodel model = MEMMODEL_SYNC_SEQ_CST;
7113 : 2297 : machine_mode mode = TYPE_MODE (TREE_TYPE (cmp));
7114 : 2297 : optab optab;
7115 : 2297 : rtx_code code;
7116 : 2297 : class expand_operand ops[5];
7117 : :
7118 : 2297 : gcc_assert (flag_inline_atomics);
7119 : :
7120 : 2297 : if (gimple_call_num_args (call) == 5)
7121 : 1889 : model = get_memmodel (gimple_call_arg (call, 3));
7122 : :
7123 : 2297 : rtx mem = get_builtin_sync_mem (ptr, mode);
7124 : 2297 : rtx op = expand_expr_force_mode (arg, mode);
7125 : :
7126 : 2297 : switch (gimple_call_internal_fn (call))
7127 : : {
7128 : : case IFN_ATOMIC_ADD_FETCH_CMP_0:
7129 : : code = PLUS;
7130 : : optab = atomic_add_fetch_cmp_0_optab;
7131 : : break;
7132 : : case IFN_ATOMIC_SUB_FETCH_CMP_0:
7133 : : code = MINUS;
7134 : : optab = atomic_sub_fetch_cmp_0_optab;
7135 : : break;
7136 : : case IFN_ATOMIC_AND_FETCH_CMP_0:
7137 : : code = AND;
7138 : : optab = atomic_and_fetch_cmp_0_optab;
7139 : : break;
7140 : : case IFN_ATOMIC_OR_FETCH_CMP_0:
7141 : : code = IOR;
7142 : : optab = atomic_or_fetch_cmp_0_optab;
7143 : : break;
7144 : : case IFN_ATOMIC_XOR_FETCH_CMP_0:
7145 : : code = XOR;
7146 : : optab = atomic_xor_fetch_cmp_0_optab;
7147 : : break;
7148 : 0 : default:
7149 : 0 : gcc_unreachable ();
7150 : : }
7151 : :
7152 : 2297 : enum rtx_code comp = UNKNOWN;
7153 : 2297 : switch (tree_to_uhwi (cmp))
7154 : : {
7155 : : case ATOMIC_OP_FETCH_CMP_0_EQ: comp = EQ; break;
7156 : : case ATOMIC_OP_FETCH_CMP_0_NE: comp = NE; break;
7157 : : case ATOMIC_OP_FETCH_CMP_0_GT: comp = GT; break;
7158 : : case ATOMIC_OP_FETCH_CMP_0_GE: comp = GE; break;
7159 : : case ATOMIC_OP_FETCH_CMP_0_LT: comp = LT; break;
7160 : : case ATOMIC_OP_FETCH_CMP_0_LE: comp = LE; break;
7161 : 0 : default: gcc_unreachable ();
7162 : : }
7163 : :
7164 : 2297 : rtx target;
7165 : 2297 : if (lhs == NULL_TREE)
7166 : 0 : target = gen_reg_rtx (TYPE_MODE (boolean_type_node));
7167 : : else
7168 : 2297 : target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE);
7169 : 2297 : enum insn_code icode = direct_optab_handler (optab, mode);
7170 : 2297 : gcc_assert (icode != CODE_FOR_nothing);
7171 : 2297 : create_output_operand (&ops[0], target, TYPE_MODE (boolean_type_node));
7172 : 2297 : create_fixed_operand (&ops[1], mem);
7173 : 2297 : create_convert_operand_to (&ops[2], op, mode, true);
7174 : 2297 : create_integer_operand (&ops[3], model);
7175 : 2297 : create_integer_operand (&ops[4], comp);
7176 : 2297 : if (maybe_expand_insn (icode, 5, ops))
7177 : 2265 : return;
7178 : :
7179 : 32 : rtx result = expand_atomic_fetch_op (gen_reg_rtx (mode), mem, op,
7180 : : code, model, true);
7181 : 32 : if (!result)
7182 : : {
7183 : 0 : bool is_atomic = gimple_call_num_args (call) == 5;
7184 : 0 : tree tcall = gimple_call_arg (call, 3 + is_atomic);
7185 : 0 : tree fndecl = gimple_call_addr_fndecl (tcall);
7186 : 0 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
7187 : 0 : tree exp = build_call_nary (type, tcall,
7188 : : 2 + is_atomic, ptr, arg,
7189 : : is_atomic
7190 : 0 : ? gimple_call_arg (call, 3)
7191 : : : integer_zero_node);
7192 : 0 : result = expand_builtin (exp, gen_reg_rtx (mode), NULL_RTX,
7193 : : mode, !lhs);
7194 : : }
7195 : :
7196 : 32 : if (lhs)
7197 : : {
7198 : 32 : result = emit_store_flag_force (target, comp, result, const0_rtx, mode,
7199 : : 0, 1);
7200 : 32 : if (result != target)
7201 : 32 : emit_move_insn (target, result);
7202 : : }
7203 : : }
7204 : :
7205 : : /* Expand an atomic clear operation.
7206 : : void _atomic_clear (BOOL *obj, enum memmodel)
7207 : : EXP is the call expression. */
7208 : :
7209 : : static rtx
7210 : 57 : expand_builtin_atomic_clear (tree exp)
7211 : : {
7212 : 57 : machine_mode mode = int_mode_for_size (BOOL_TYPE_SIZE, 0).require ();
7213 : 57 : rtx mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
7214 : 57 : memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 1));
7215 : :
7216 : 57 : if (is_mm_consume (model) || is_mm_acquire (model) || is_mm_acq_rel (model))
7217 : : model = MEMMODEL_SEQ_CST;
7218 : :
7219 : : /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
7220 : : Failing that, a store is issued by __atomic_store. The only way this can
7221 : : fail is if the bool type is larger than a word size. Unlikely, but
7222 : : handle it anyway for completeness. Assume a single threaded model since
7223 : : there is no atomic support in this case, and no barriers are required. */
7224 : 57 : rtx ret = expand_atomic_store (mem, const0_rtx, model, true);
7225 : 57 : if (!ret)
7226 : 0 : emit_move_insn (mem, const0_rtx);
7227 : 57 : return const0_rtx;
7228 : : }
7229 : :
7230 : : /* Expand an atomic test_and_set operation.
7231 : : bool _atomic_test_and_set (BOOL *obj, enum memmodel)
7232 : : EXP is the call expression. */
7233 : :
7234 : : static rtx
7235 : 268 : expand_builtin_atomic_test_and_set (tree exp, rtx target)
7236 : : {
7237 : 268 : rtx mem;
7238 : 268 : enum memmodel model;
7239 : 268 : machine_mode mode;
7240 : :
7241 : 268 : mode = int_mode_for_size (BOOL_TYPE_SIZE, 0).require ();
7242 : 268 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
7243 : 268 : model = get_memmodel (CALL_EXPR_ARG (exp, 1));
7244 : :
7245 : 268 : return expand_atomic_test_and_set (target, mem, model);
7246 : : }
7247 : :
7248 : :
7249 : : /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
7250 : : this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
7251 : :
7252 : : static tree
7253 : 104401 : fold_builtin_atomic_always_lock_free (tree arg0, tree arg1)
7254 : : {
7255 : 104401 : int size;
7256 : 104401 : machine_mode mode;
7257 : 104401 : unsigned int mode_align, type_align;
7258 : :
7259 : 104401 : if (TREE_CODE (arg0) != INTEGER_CST)
7260 : : return NULL_TREE;
7261 : :
7262 : : /* We need a corresponding integer mode for the access to be lock-free. */
7263 : 104307 : size = INTVAL (expand_normal (arg0)) * BITS_PER_UNIT;
7264 : 104307 : if (!int_mode_for_size (size, 0).exists (&mode))
7265 : 17 : return boolean_false_node;
7266 : :
7267 : 104290 : mode_align = GET_MODE_ALIGNMENT (mode);
7268 : :
7269 : 104290 : if (TREE_CODE (arg1) == INTEGER_CST)
7270 : : {
7271 : 84094 : unsigned HOST_WIDE_INT val = UINTVAL (expand_normal (arg1));
7272 : :
7273 : : /* Either this argument is null, or it's a fake pointer encoding
7274 : : the alignment of the object. */
7275 : 84094 : val = least_bit_hwi (val);
7276 : 84094 : val *= BITS_PER_UNIT;
7277 : :
7278 : 84094 : if (val == 0 || mode_align < val)
7279 : : type_align = mode_align;
7280 : : else
7281 : 19606 : type_align = val;
7282 : : }
7283 : : else
7284 : : {
7285 : 20196 : tree ttype = TREE_TYPE (arg1);
7286 : :
7287 : : /* This function is usually invoked and folded immediately by the front
7288 : : end before anything else has a chance to look at it. The pointer
7289 : : parameter at this point is usually cast to a void *, so check for that
7290 : : and look past the cast. */
7291 : 63 : if (CONVERT_EXPR_P (arg1)
7292 : 20164 : && POINTER_TYPE_P (ttype)
7293 : 20164 : && VOID_TYPE_P (TREE_TYPE (ttype))
7294 : 40360 : && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (arg1, 0))))
7295 : 20133 : arg1 = TREE_OPERAND (arg1, 0);
7296 : :
7297 : 20196 : ttype = TREE_TYPE (arg1);
7298 : 20196 : gcc_assert (POINTER_TYPE_P (ttype));
7299 : :
7300 : : /* Get the underlying type of the object. */
7301 : 20196 : ttype = TREE_TYPE (ttype);
7302 : 20196 : type_align = TYPE_ALIGN (ttype);
7303 : : }
7304 : :
7305 : : /* If the object has smaller alignment, the lock free routines cannot
7306 : : be used. */
7307 : 104290 : if (type_align < mode_align)
7308 : 95 : return boolean_false_node;
7309 : :
7310 : : /* Check if a compare_and_swap pattern exists for the mode which represents
7311 : : the required size. The pattern is not allowed to fail, so the existence
7312 : : of the pattern indicates support is present. Also require that an
7313 : : atomic load exists for the required size. */
7314 : 104195 : if (can_compare_and_swap_p (mode, true) && can_atomic_load_p (mode))
7315 : 104151 : return boolean_true_node;
7316 : : else
7317 : 44 : return boolean_false_node;
7318 : : }
7319 : :
7320 : : /* Return true if the parameters to call EXP represent an object which will
7321 : : always generate lock free instructions. The first argument represents the
7322 : : size of the object, and the second parameter is a pointer to the object
7323 : : itself. If NULL is passed for the object, then the result is based on
7324 : : typical alignment for an object of the specified size. Otherwise return
7325 : : false. */
7326 : :
7327 : : static rtx
7328 : 1 : expand_builtin_atomic_always_lock_free (tree exp)
7329 : : {
7330 : 1 : tree size;
7331 : 1 : tree arg0 = CALL_EXPR_ARG (exp, 0);
7332 : 1 : tree arg1 = CALL_EXPR_ARG (exp, 1);
7333 : :
7334 : 1 : if (TREE_CODE (arg0) != INTEGER_CST)
7335 : : {
7336 : 1 : error ("non-constant argument 1 to %qs", "__atomic_always_lock_free");
7337 : 1 : return const0_rtx;
7338 : : }
7339 : :
7340 : 0 : size = fold_builtin_atomic_always_lock_free (arg0, arg1);
7341 : 0 : if (size == boolean_true_node)
7342 : 0 : return const1_rtx;
7343 : 0 : return const0_rtx;
7344 : : }
7345 : :
7346 : : /* Return a one or zero if it can be determined that object ARG1 of size ARG
7347 : : is lock free on this architecture. */
7348 : :
7349 : : static tree
7350 : 39845 : fold_builtin_atomic_is_lock_free (tree arg0, tree arg1)
7351 : : {
7352 : 39845 : if (!flag_inline_atomics)
7353 : : return NULL_TREE;
7354 : :
7355 : : /* If it isn't always lock free, don't generate a result. */
7356 : 39836 : if (fold_builtin_atomic_always_lock_free (arg0, arg1) == boolean_true_node)
7357 : : return boolean_true_node;
7358 : :
7359 : : return NULL_TREE;
7360 : : }
7361 : :
7362 : : /* Return true if the parameters to call EXP represent an object which will
7363 : : always generate lock free instructions. The first argument represents the
7364 : : size of the object, and the second parameter is a pointer to the object
7365 : : itself. If NULL is passed for the object, then the result is based on
7366 : : typical alignment for an object of the specified size. Otherwise return
7367 : : NULL*/
7368 : :
7369 : : static rtx
7370 : 3 : expand_builtin_atomic_is_lock_free (tree exp)
7371 : : {
7372 : 3 : tree size;
7373 : 3 : tree arg0 = CALL_EXPR_ARG (exp, 0);
7374 : 3 : tree arg1 = CALL_EXPR_ARG (exp, 1);
7375 : :
7376 : 3 : if (!INTEGRAL_TYPE_P (TREE_TYPE (arg0)))
7377 : : {
7378 : 0 : error ("non-integer argument 1 to %qs", "__atomic_is_lock_free");
7379 : 0 : return NULL_RTX;
7380 : : }
7381 : :
7382 : 3 : if (!flag_inline_atomics)
7383 : : return NULL_RTX;
7384 : :
7385 : : /* If the value is known at compile time, return the RTX for it. */
7386 : 2 : size = fold_builtin_atomic_is_lock_free (arg0, arg1);
7387 : 2 : if (size == boolean_true_node)
7388 : 0 : return const1_rtx;
7389 : :
7390 : : return NULL_RTX;
7391 : : }
7392 : :
7393 : : /* Expand the __atomic_thread_fence intrinsic:
7394 : : void __atomic_thread_fence (enum memmodel)
7395 : : EXP is the CALL_EXPR. */
7396 : :
7397 : : static void
7398 : 693 : expand_builtin_atomic_thread_fence (tree exp)
7399 : : {
7400 : 693 : enum memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 0));
7401 : 693 : expand_mem_thread_fence (model);
7402 : 693 : }
7403 : :
7404 : : /* Expand the __atomic_signal_fence intrinsic:
7405 : : void __atomic_signal_fence (enum memmodel)
7406 : : EXP is the CALL_EXPR. */
7407 : :
7408 : : static void
7409 : 60 : expand_builtin_atomic_signal_fence (tree exp)
7410 : : {
7411 : 60 : enum memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 0));
7412 : 60 : expand_mem_signal_fence (model);
7413 : 60 : }
7414 : :
7415 : : /* Expand the __sync_synchronize intrinsic. */
7416 : :
7417 : : static void
7418 : 281 : expand_builtin_sync_synchronize (void)
7419 : : {
7420 : 0 : expand_mem_thread_fence (MEMMODEL_SYNC_SEQ_CST);
7421 : 0 : }
7422 : :
7423 : : static rtx
7424 : 3 : expand_builtin_thread_pointer (tree exp, rtx target)
7425 : : {
7426 : 3 : enum insn_code icode;
7427 : 3 : if (!validate_arglist (exp, VOID_TYPE))
7428 : 0 : return const0_rtx;
7429 : 3 : icode = direct_optab_handler (get_thread_pointer_optab, Pmode);
7430 : 3 : if (icode != CODE_FOR_nothing)
7431 : : {
7432 : 3 : class expand_operand op;
7433 : : /* If the target is not sutitable then create a new target. */
7434 : 3 : if (target == NULL_RTX
7435 : 3 : || !REG_P (target)
7436 : 6 : || GET_MODE (target) != Pmode)
7437 : 0 : target = gen_reg_rtx (Pmode);
7438 : 3 : create_output_operand (&op, target, Pmode);
7439 : 3 : expand_insn (icode, 1, &op);
7440 : 3 : return target;
7441 : : }
7442 : 0 : error ("%<__builtin_thread_pointer%> is not supported on this target");
7443 : 0 : return const0_rtx;
7444 : : }
7445 : :
7446 : : static void
7447 : 0 : expand_builtin_set_thread_pointer (tree exp)
7448 : : {
7449 : 0 : enum insn_code icode;
7450 : 0 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
7451 : : return;
7452 : 0 : icode = direct_optab_handler (set_thread_pointer_optab, Pmode);
7453 : 0 : if (icode != CODE_FOR_nothing)
7454 : : {
7455 : 0 : class expand_operand op;
7456 : 0 : rtx val = expand_expr (CALL_EXPR_ARG (exp, 0), NULL_RTX,
7457 : 0 : Pmode, EXPAND_NORMAL);
7458 : 0 : create_input_operand (&op, val, Pmode);
7459 : 0 : expand_insn (icode, 1, &op);
7460 : 0 : return;
7461 : : }
7462 : 0 : error ("%<__builtin_set_thread_pointer%> is not supported on this target");
7463 : : }
7464 : :
7465 : :
7466 : : /* Emit code to restore the current value of stack. */
7467 : :
7468 : : static void
7469 : 1688 : expand_stack_restore (tree var)
7470 : : {
7471 : 1688 : rtx_insn *prev;
7472 : 1688 : rtx sa = expand_normal (var);
7473 : :
7474 : 1688 : sa = convert_memory_address (Pmode, sa);
7475 : :
7476 : 1688 : prev = get_last_insn ();
7477 : 1688 : emit_stack_restore (SAVE_BLOCK, sa);
7478 : :
7479 : 1688 : record_new_stack_level ();
7480 : :
7481 : 1688 : fixup_args_size_notes (prev, get_last_insn (), 0);
7482 : 1688 : }
7483 : :
7484 : : /* Emit code to save the current value of stack. */
7485 : :
7486 : : static rtx
7487 : 1790 : expand_stack_save (void)
7488 : : {
7489 : 1790 : rtx ret = NULL_RTX;
7490 : :
7491 : 0 : emit_stack_save (SAVE_BLOCK, &ret);
7492 : 1790 : return ret;
7493 : : }
7494 : :
7495 : : /* Emit code to get the openacc gang, worker or vector id or size. */
7496 : :
7497 : : static rtx
7498 : 356 : expand_builtin_goacc_parlevel_id_size (tree exp, rtx target, int ignore)
7499 : : {
7500 : 356 : const char *name;
7501 : 356 : rtx fallback_retval;
7502 : 356 : rtx_insn *(*gen_fn) (rtx, rtx);
7503 : 356 : switch (DECL_FUNCTION_CODE (get_callee_fndecl (exp)))
7504 : : {
7505 : 244 : case BUILT_IN_GOACC_PARLEVEL_ID:
7506 : 244 : name = "__builtin_goacc_parlevel_id";
7507 : 244 : fallback_retval = const0_rtx;
7508 : 244 : gen_fn = targetm.gen_oacc_dim_pos;
7509 : 244 : break;
7510 : 112 : case BUILT_IN_GOACC_PARLEVEL_SIZE:
7511 : 112 : name = "__builtin_goacc_parlevel_size";
7512 : 112 : fallback_retval = const1_rtx;
7513 : 112 : gen_fn = targetm.gen_oacc_dim_size;
7514 : 112 : break;
7515 : 0 : default:
7516 : 0 : gcc_unreachable ();
7517 : : }
7518 : :
7519 : 356 : if (oacc_get_fn_attrib (current_function_decl) == NULL_TREE)
7520 : : {
7521 : 8 : error ("%qs only supported in OpenACC code", name);
7522 : 8 : return const0_rtx;
7523 : : }
7524 : :
7525 : 348 : tree arg = CALL_EXPR_ARG (exp, 0);
7526 : 348 : if (TREE_CODE (arg) != INTEGER_CST)
7527 : : {
7528 : 8 : error ("non-constant argument 0 to %qs", name);
7529 : 8 : return const0_rtx;
7530 : : }
7531 : :
7532 : 340 : int dim = TREE_INT_CST_LOW (arg);
7533 : 340 : switch (dim)
7534 : : {
7535 : 324 : case GOMP_DIM_GANG:
7536 : 324 : case GOMP_DIM_WORKER:
7537 : 324 : case GOMP_DIM_VECTOR:
7538 : 324 : break;
7539 : 16 : default:
7540 : 16 : error ("illegal argument 0 to %qs", name);
7541 : 16 : return const0_rtx;
7542 : : }
7543 : :
7544 : 324 : if (ignore)
7545 : : return target;
7546 : :
7547 : 180 : if (target == NULL_RTX)
7548 : 0 : target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
7549 : :
7550 : 180 : if (!targetm.have_oacc_dim_size ())
7551 : : {
7552 : 180 : emit_move_insn (target, fallback_retval);
7553 : 180 : return target;
7554 : : }
7555 : :
7556 : 0 : rtx reg = MEM_P (target) ? gen_reg_rtx (GET_MODE (target)) : target;
7557 : 0 : emit_insn (gen_fn (reg, GEN_INT (dim)));
7558 : 0 : if (reg != target)
7559 : 0 : emit_move_insn (target, reg);
7560 : :
7561 : : return target;
7562 : : }
7563 : :
7564 : : /* Expand a string compare operation using a sequence of char comparison
7565 : : to get rid of the calling overhead, with result going to TARGET if
7566 : : that's convenient.
7567 : :
7568 : : VAR_STR is the variable string source;
7569 : : CONST_STR is the constant string source;
7570 : : LENGTH is the number of chars to compare;
7571 : : CONST_STR_N indicates which source string is the constant string;
7572 : : IS_MEMCMP indicates whether it's a memcmp or strcmp.
7573 : :
7574 : : to: (assume const_str_n is 2, i.e., arg2 is a constant string)
7575 : :
7576 : : target = (int) (unsigned char) var_str[0]
7577 : : - (int) (unsigned char) const_str[0];
7578 : : if (target != 0)
7579 : : goto ne_label;
7580 : : ...
7581 : : target = (int) (unsigned char) var_str[length - 2]
7582 : : - (int) (unsigned char) const_str[length - 2];
7583 : : if (target != 0)
7584 : : goto ne_label;
7585 : : target = (int) (unsigned char) var_str[length - 1]
7586 : : - (int) (unsigned char) const_str[length - 1];
7587 : : ne_label:
7588 : : */
7589 : :
7590 : : static rtx
7591 : 626 : inline_string_cmp (rtx target, tree var_str, const char *const_str,
7592 : : unsigned HOST_WIDE_INT length,
7593 : : int const_str_n, machine_mode mode)
7594 : : {
7595 : 626 : HOST_WIDE_INT offset = 0;
7596 : 626 : rtx var_rtx_array
7597 : 626 : = get_memory_rtx (var_str, build_int_cst (unsigned_type_node,length));
7598 : 626 : rtx var_rtx = NULL_RTX;
7599 : 626 : rtx const_rtx = NULL_RTX;
7600 : 626 : rtx result = target ? target : gen_reg_rtx (mode);
7601 : 626 : rtx_code_label *ne_label = gen_label_rtx ();
7602 : 626 : tree unit_type_node = unsigned_char_type_node;
7603 : 626 : scalar_int_mode unit_mode
7604 : 626 : = as_a <scalar_int_mode> TYPE_MODE (unit_type_node);
7605 : :
7606 : 626 : start_sequence ();
7607 : :
7608 : 2284 : for (unsigned HOST_WIDE_INT i = 0; i < length; i++)
7609 : : {
7610 : 1658 : var_rtx
7611 : 1658 : = adjust_address (var_rtx_array, TYPE_MODE (unit_type_node), offset);
7612 : 1658 : const_rtx = c_readstr (const_str + offset, unit_mode);
7613 : 1658 : rtx op0 = (const_str_n == 1) ? const_rtx : var_rtx;
7614 : 1504 : rtx op1 = (const_str_n == 1) ? var_rtx : const_rtx;
7615 : :
7616 : 1658 : op0 = convert_modes (mode, unit_mode, op0, 1);
7617 : 1658 : op1 = convert_modes (mode, unit_mode, op1, 1);
7618 : 1658 : rtx diff = expand_simple_binop (mode, MINUS, op0, op1,
7619 : : result, 1, OPTAB_WIDEN);
7620 : :
7621 : : /* Force the difference into result register. We cannot reassign
7622 : : result here ("result = diff") or we may end up returning
7623 : : uninitialized result when expand_simple_binop allocates a new
7624 : : pseudo-register for returning. */
7625 : 1658 : if (diff != result)
7626 : 0 : emit_move_insn (result, diff);
7627 : :
7628 : 1658 : if (i < length - 1)
7629 : 1032 : emit_cmp_and_jump_insns (result, CONST0_RTX (mode), NE, NULL_RTX,
7630 : : mode, true, ne_label);
7631 : 3316 : offset += GET_MODE_SIZE (unit_mode);
7632 : : }
7633 : :
7634 : 626 : emit_label (ne_label);
7635 : 626 : rtx_insn *insns = end_sequence ();
7636 : 626 : emit_insn (insns);
7637 : :
7638 : 626 : return result;
7639 : : }
7640 : :
7641 : : /* Inline expansion of a call to str(n)cmp and memcmp, with result going
7642 : : to TARGET if that's convenient.
7643 : : If the call is not been inlined, return NULL_RTX. */
7644 : :
7645 : : static rtx
7646 : 144277 : inline_expand_builtin_bytecmp (tree exp, rtx target)
7647 : : {
7648 : 144277 : tree fndecl = get_callee_fndecl (exp);
7649 : 144277 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7650 : 144277 : bool is_ncmp = (fcode == BUILT_IN_STRNCMP || fcode == BUILT_IN_MEMCMP);
7651 : :
7652 : : /* Do NOT apply this inlining expansion when optimizing for size or
7653 : : optimization level below 2 or if unused *cmp hasn't been DCEd. */
7654 : 144277 : if (optimize < 2 || optimize_insn_for_size_p () || target == const0_rtx)
7655 : 121995 : return NULL_RTX;
7656 : :
7657 : 22282 : gcc_checking_assert (fcode == BUILT_IN_STRCMP
7658 : : || fcode == BUILT_IN_STRNCMP
7659 : : || fcode == BUILT_IN_MEMCMP);
7660 : :
7661 : : /* On a target where the type of the call (int) has same or narrower presicion
7662 : : than unsigned char, give up the inlining expansion. */
7663 : 22282 : if (TYPE_PRECISION (unsigned_char_type_node)
7664 : 22282 : >= TYPE_PRECISION (TREE_TYPE (exp)))
7665 : : return NULL_RTX;
7666 : :
7667 : 22282 : tree arg1 = CALL_EXPR_ARG (exp, 0);
7668 : 22282 : tree arg2 = CALL_EXPR_ARG (exp, 1);
7669 : 22282 : tree len3_tree = is_ncmp ? CALL_EXPR_ARG (exp, 2) : NULL_TREE;
7670 : :
7671 : 22282 : unsigned HOST_WIDE_INT len1 = 0;
7672 : 22282 : unsigned HOST_WIDE_INT len2 = 0;
7673 : 22282 : unsigned HOST_WIDE_INT len3 = 0;
7674 : :
7675 : : /* Get the object representation of the initializers of ARG1 and ARG2
7676 : : as strings, provided they refer to constant objects, with their byte
7677 : : sizes in LEN1 and LEN2, respectively. */
7678 : 22282 : const char *bytes1 = getbyterep (arg1, &len1);
7679 : 22282 : const char *bytes2 = getbyterep (arg2, &len2);
7680 : :
7681 : : /* Fail if neither argument refers to an initialized constant. */
7682 : 22282 : if (!bytes1 && !bytes2)
7683 : : return NULL_RTX;
7684 : :
7685 : 18403 : if (is_ncmp)
7686 : : {
7687 : : /* Fail if the memcmp/strncmp bound is not a constant. */
7688 : 1287 : if (!tree_fits_uhwi_p (len3_tree))
7689 : : return NULL_RTX;
7690 : :
7691 : 956 : len3 = tree_to_uhwi (len3_tree);
7692 : :
7693 : 956 : if (fcode == BUILT_IN_MEMCMP)
7694 : : {
7695 : : /* Fail if the memcmp bound is greater than the size of either
7696 : : of the two constant objects. */
7697 : 449 : if ((bytes1 && len1 < len3)
7698 : 449 : || (bytes2 && len2 < len3))
7699 : : return NULL_RTX;
7700 : : }
7701 : : }
7702 : :
7703 : : if (fcode != BUILT_IN_MEMCMP)
7704 : : {
7705 : : /* For string functions (i.e., strcmp and strncmp) reduce LEN1
7706 : : and LEN2 to the length of the nul-terminated string stored
7707 : : in each. */
7708 : 17623 : if (bytes1 != NULL)
7709 : 240 : len1 = strnlen (bytes1, len1) + 1;
7710 : 17623 : if (bytes2 != NULL)
7711 : 17386 : len2 = strnlen (bytes2, len2) + 1;
7712 : : }
7713 : :
7714 : : /* See inline_string_cmp. */
7715 : 18068 : int const_str_n;
7716 : 18068 : if (!len1)
7717 : : const_str_n = 2;
7718 : 245 : else if (!len2)
7719 : : const_str_n = 1;
7720 : 3 : else if (len2 > len1)
7721 : : const_str_n = 1;
7722 : : else
7723 : : const_str_n = 2;
7724 : :
7725 : : /* For strncmp only, compute the new bound as the smallest of
7726 : : the lengths of the two strings (plus 1) and the bound provided
7727 : : to the function. */
7728 : 17825 : unsigned HOST_WIDE_INT bound = (const_str_n == 1) ? len1 : len2;
7729 : 18068 : if (is_ncmp && len3 < bound)
7730 : 524 : bound = len3;
7731 : :
7732 : : /* If the bound of the comparison is larger than the threshold,
7733 : : do nothing. */
7734 : 18068 : if (bound > (unsigned HOST_WIDE_INT) param_builtin_string_cmp_inline_length)
7735 : : return NULL_RTX;
7736 : :
7737 : 626 : machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
7738 : :
7739 : : /* Now, start inline expansion the call. */
7740 : 1191 : return inline_string_cmp (target, (const_str_n == 1) ? arg2 : arg1,
7741 : : (const_str_n == 1) ? bytes1 : bytes2, bound,
7742 : 626 : const_str_n, mode);
7743 : : }
7744 : :
7745 : : /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
7746 : : represents the size of the first argument to that call, or VOIDmode
7747 : : if the argument is a pointer. IGNORE will be true if the result
7748 : : isn't used. */
7749 : : static rtx
7750 : 34 : expand_speculation_safe_value (machine_mode mode, tree exp, rtx target,
7751 : : bool ignore)
7752 : : {
7753 : 34 : rtx val, failsafe;
7754 : 34 : unsigned nargs = call_expr_nargs (exp);
7755 : :
7756 : 34 : tree arg0 = CALL_EXPR_ARG (exp, 0);
7757 : :
7758 : 34 : if (mode == VOIDmode)
7759 : : {
7760 : 4 : mode = TYPE_MODE (TREE_TYPE (arg0));
7761 : 4 : gcc_assert (GET_MODE_CLASS (mode) == MODE_INT);
7762 : : }
7763 : :
7764 : 34 : val = expand_expr (arg0, NULL_RTX, mode, EXPAND_NORMAL);
7765 : :
7766 : : /* An optional second argument can be used as a failsafe value on
7767 : : some machines. If it isn't present, then the failsafe value is
7768 : : assumed to be 0. */
7769 : 34 : if (nargs > 1)
7770 : : {
7771 : 4 : tree arg1 = CALL_EXPR_ARG (exp, 1);
7772 : 4 : failsafe = expand_expr (arg1, NULL_RTX, mode, EXPAND_NORMAL);
7773 : : }
7774 : : else
7775 : 30 : failsafe = const0_rtx;
7776 : :
7777 : : /* If the result isn't used, the behavior is undefined. It would be
7778 : : nice to emit a warning here, but path splitting means this might
7779 : : happen with legitimate code. So simply drop the builtin
7780 : : expansion in that case; we've handled any side-effects above. */
7781 : 34 : if (ignore)
7782 : 0 : return const0_rtx;
7783 : :
7784 : : /* If we don't have a suitable target, create one to hold the result. */
7785 : 34 : if (target == NULL || GET_MODE (target) != mode)
7786 : 0 : target = gen_reg_rtx (mode);
7787 : :
7788 : 34 : if (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode)
7789 : 0 : val = convert_modes (mode, VOIDmode, val, false);
7790 : :
7791 : 34 : return targetm.speculation_safe_value (mode, target, val, failsafe);
7792 : : }
7793 : :
7794 : : /* Expand CRC* or REV_CRC* built-ins. */
7795 : :
7796 : : rtx
7797 : 34 : expand_builtin_crc_table_based (internal_fn fn, scalar_mode crc_mode,
7798 : : scalar_mode data_mode, machine_mode mode,
7799 : : tree exp, rtx target)
7800 : : {
7801 : 34 : tree rhs1 = CALL_EXPR_ARG (exp, 0); // crc
7802 : 34 : tree rhs2 = CALL_EXPR_ARG (exp, 1); // data
7803 : 34 : tree rhs3 = CALL_EXPR_ARG (exp, 2); // polynomial
7804 : :
7805 : 34 : if (!target || mode == VOIDmode)
7806 : 0 : target = gen_reg_rtx (crc_mode);
7807 : :
7808 : 34 : rtx op1 = expand_normal (rhs1);
7809 : 34 : rtx op2 = expand_normal (rhs2);
7810 : 34 : rtx op3;
7811 : 34 : if (TREE_CODE (rhs3) != INTEGER_CST)
7812 : : {
7813 : 1 : error ("third argument to %<crc%> builtins must be a constant");
7814 : 1 : op3 = const0_rtx;
7815 : : }
7816 : : else
7817 : 33 : op3 = convert_to_mode (crc_mode, expand_normal (rhs3), 0);
7818 : :
7819 : 34 : if (CONST_INT_P (op2))
7820 : 33 : op2 = convert_to_mode (crc_mode, op2, 0);
7821 : :
7822 : 34 : if (fn == IFN_CRC)
7823 : 17 : expand_crc_table_based (target, op1, op2, op3, data_mode);
7824 : : else
7825 : : /* If it's IFN_CRC_REV generate bit-reversed CRC. */
7826 : 17 : expand_reversed_crc_table_based (target, op1, op2, op3,
7827 : : data_mode,
7828 : : generate_reflecting_code_standard);
7829 : 34 : return target;
7830 : : }
7831 : :
7832 : : /* Expand an expression EXP that calls a built-in function,
7833 : : with result going to TARGET if that's convenient
7834 : : (and in mode MODE if that's convenient).
7835 : : SUBTARGET may be used as the target for computing one of EXP's operands.
7836 : : IGNORE is nonzero if the value is to be ignored. */
7837 : :
7838 : : rtx
7839 : 1964715 : expand_builtin (tree exp, rtx target, rtx subtarget, machine_mode mode,
7840 : : int ignore)
7841 : : {
7842 : 1964715 : tree fndecl = get_callee_fndecl (exp);
7843 : 1964715 : machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
7844 : 1964715 : int flags;
7845 : :
7846 : 1964715 : if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
7847 : 171221 : return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
7848 : :
7849 : : /* When ASan is enabled, we don't want to expand some memory/string
7850 : : builtins and rely on libsanitizer's hooks. This allows us to avoid
7851 : : redundant checks and be sure, that possible overflow will be detected
7852 : : by ASan. */
7853 : :
7854 : 1793494 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7855 : 1793494 : if (param_asan_kernel_mem_intrinsic_prefix
7856 : 1793494 : && sanitize_flags_p (SANITIZE_KERNEL_ADDRESS
7857 : : | SANITIZE_KERNEL_HWADDRESS))
7858 : 42 : switch (fcode)
7859 : : {
7860 : 42 : rtx save_decl_rtl, ret;
7861 : 42 : case BUILT_IN_MEMCPY:
7862 : 42 : case BUILT_IN_MEMMOVE:
7863 : 42 : case BUILT_IN_MEMSET:
7864 : 42 : save_decl_rtl = DECL_RTL (fndecl);
7865 : 42 : DECL_RTL (fndecl) = asan_memfn_rtl (fndecl);
7866 : 42 : ret = expand_call (exp, target, ignore);
7867 : 42 : DECL_RTL (fndecl) = save_decl_rtl;
7868 : 42 : return ret;
7869 : : default:
7870 : : break;
7871 : : }
7872 : 1793452 : if (sanitize_flags_p (SANITIZE_ADDRESS | SANITIZE_HWADDRESS)
7873 : 1793452 : && asan_intercepted_p (fcode))
7874 : 756 : return expand_call (exp, target, ignore);
7875 : :
7876 : : /* When not optimizing, generate calls to library functions for a certain
7877 : : set of builtins. */
7878 : 1792696 : if (!optimize
7879 : 421433 : && !called_as_built_in (fndecl)
7880 : 141826 : && fcode != BUILT_IN_FORK
7881 : 141826 : && fcode != BUILT_IN_EXECL
7882 : 141815 : && fcode != BUILT_IN_EXECV
7883 : 141815 : && fcode != BUILT_IN_EXECLP
7884 : 141813 : && fcode != BUILT_IN_EXECLE
7885 : 141813 : && fcode != BUILT_IN_EXECVP
7886 : 141812 : && fcode != BUILT_IN_EXECVE
7887 : 141812 : && fcode != BUILT_IN_CLEAR_CACHE
7888 : 141809 : && !ALLOCA_FUNCTION_CODE_P (fcode)
7889 : 141755 : && fcode != BUILT_IN_FREE
7890 : 139672 : && (fcode != BUILT_IN_MEMSET
7891 : 55881 : || !(flag_inline_stringops & ILSOP_MEMSET))
7892 : 139669 : && (fcode != BUILT_IN_MEMCPY
7893 : 918 : || !(flag_inline_stringops & ILSOP_MEMCPY))
7894 : 139533 : && (fcode != BUILT_IN_MEMMOVE
7895 : 347 : || !(flag_inline_stringops & ILSOP_MEMMOVE))
7896 : 1932229 : && (fcode != BUILT_IN_MEMCMP
7897 : 2504 : || !(flag_inline_stringops & ILSOP_MEMCMP)))
7898 : 139485 : return expand_call (exp, target, ignore);
7899 : :
7900 : : /* The built-in function expanders test for target == const0_rtx
7901 : : to determine whether the function's result will be ignored. */
7902 : 1653211 : if (ignore)
7903 : 964688 : target = const0_rtx;
7904 : :
7905 : : /* If the result of a pure or const built-in function is ignored, and
7906 : : none of its arguments are volatile, we can avoid expanding the
7907 : : built-in call and just evaluate the arguments for side-effects. */
7908 : 1653211 : if (target == const0_rtx
7909 : 964688 : && ((flags = flags_from_decl_or_type (fndecl)) & (ECF_CONST | ECF_PURE))
7910 : 1659684 : && !(flags & ECF_LOOPING_CONST_OR_PURE))
7911 : : {
7912 : 6 : bool volatilep = false;
7913 : 6 : tree arg;
7914 : 6 : call_expr_arg_iterator iter;
7915 : :
7916 : 20 : FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
7917 : 8 : if (TREE_THIS_VOLATILE (arg))
7918 : : {
7919 : : volatilep = true;
7920 : : break;
7921 : : }
7922 : :
7923 : 6 : if (! volatilep)
7924 : : {
7925 : 20 : FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
7926 : 8 : expand_expr (arg, const0_rtx, VOIDmode, EXPAND_NORMAL);
7927 : 6 : return const0_rtx;
7928 : : }
7929 : : }
7930 : :
7931 : 1653205 : switch (fcode)
7932 : : {
7933 : 4 : CASE_FLT_FN (BUILT_IN_FABS):
7934 : 4 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FABS):
7935 : 4 : case BUILT_IN_FABSD32:
7936 : 4 : case BUILT_IN_FABSD64:
7937 : 4 : case BUILT_IN_FABSD128:
7938 : 4 : case BUILT_IN_FABSD64X:
7939 : 4 : target = expand_builtin_fabs (exp, target, subtarget);
7940 : 4 : if (target)
7941 : 816218 : return target;
7942 : 836987 : break;
7943 : :
7944 : 11674 : CASE_FLT_FN (BUILT_IN_COPYSIGN):
7945 : 11674 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_COPYSIGN):
7946 : 11674 : target = expand_builtin_copysign (exp, target, subtarget);
7947 : 11674 : if (target)
7948 : : return target;
7949 : : break;
7950 : :
7951 : : /* Just do a normal library call if we were unable to fold
7952 : : the values. */
7953 : : CASE_FLT_FN (BUILT_IN_CABS):
7954 : : CASE_FLT_FN_FLOATN_NX (BUILT_IN_CABS):
7955 : : break;
7956 : :
7957 : 364 : CASE_FLT_FN (BUILT_IN_FMA):
7958 : 364 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMA):
7959 : 364 : target = expand_builtin_mathfn_ternary (exp, target, subtarget);
7960 : 364 : if (target)
7961 : : return target;
7962 : : break;
7963 : :
7964 : 235 : CASE_FLT_FN (BUILT_IN_ILOGB):
7965 : 235 : if (! flag_unsafe_math_optimizations)
7966 : : break;
7967 : 4 : gcc_fallthrough ();
7968 : 4 : CASE_FLT_FN (BUILT_IN_ISINF):
7969 : 4 : CASE_FLT_FN (BUILT_IN_FINITE):
7970 : 4 : CASE_FLT_FN (BUILT_IN_ISNAN):
7971 : 4 : case BUILT_IN_ISFINITE:
7972 : 4 : case BUILT_IN_ISNORMAL:
7973 : 4 : target = expand_builtin_interclass_mathfn (exp, target);
7974 : 4 : if (target)
7975 : : return target;
7976 : : break;
7977 : :
7978 : 823 : case BUILT_IN_ISSIGNALING:
7979 : 823 : target = expand_builtin_issignaling (exp, target);
7980 : 823 : if (target)
7981 : : return target;
7982 : : break;
7983 : :
7984 : 231 : CASE_FLT_FN (BUILT_IN_ICEIL):
7985 : 231 : CASE_FLT_FN (BUILT_IN_LCEIL):
7986 : 231 : CASE_FLT_FN (BUILT_IN_LLCEIL):
7987 : 231 : CASE_FLT_FN (BUILT_IN_LFLOOR):
7988 : 231 : CASE_FLT_FN (BUILT_IN_IFLOOR):
7989 : 231 : CASE_FLT_FN (BUILT_IN_LLFLOOR):
7990 : 231 : target = expand_builtin_int_roundingfn (exp, target);
7991 : 231 : if (target)
7992 : : return target;
7993 : : break;
7994 : :
7995 : 590 : CASE_FLT_FN (BUILT_IN_IRINT):
7996 : 590 : CASE_FLT_FN (BUILT_IN_LRINT):
7997 : 590 : CASE_FLT_FN (BUILT_IN_LLRINT):
7998 : 590 : CASE_FLT_FN (BUILT_IN_IROUND):
7999 : 590 : CASE_FLT_FN (BUILT_IN_LROUND):
8000 : 590 : CASE_FLT_FN (BUILT_IN_LLROUND):
8001 : 590 : target = expand_builtin_int_roundingfn_2 (exp, target);
8002 : 590 : if (target)
8003 : : return target;
8004 : : break;
8005 : :
8006 : 279 : CASE_FLT_FN (BUILT_IN_POWI):
8007 : 279 : target = expand_builtin_powi (exp, target);
8008 : 279 : if (target)
8009 : : return target;
8010 : : break;
8011 : :
8012 : 158 : CASE_FLT_FN (BUILT_IN_CEXPI):
8013 : 158 : target = expand_builtin_cexpi (exp, target);
8014 : 158 : gcc_assert (target);
8015 : : return target;
8016 : :
8017 : 992 : CASE_FLT_FN (BUILT_IN_SIN):
8018 : 992 : CASE_FLT_FN (BUILT_IN_COS):
8019 : 992 : if (! flag_unsafe_math_optimizations)
8020 : : break;
8021 : 47 : target = expand_builtin_mathfn_3 (exp, target, subtarget);
8022 : 47 : if (target)
8023 : : return target;
8024 : : break;
8025 : :
8026 : 152 : CASE_FLT_FN (BUILT_IN_SINCOS):
8027 : 152 : if (! flag_unsafe_math_optimizations)
8028 : : break;
8029 : 3 : target = expand_builtin_sincos (exp);
8030 : 3 : if (target)
8031 : : return target;
8032 : : break;
8033 : :
8034 : 60 : case BUILT_IN_FEGETROUND:
8035 : 60 : target = expand_builtin_fegetround (exp, target, target_mode);
8036 : 60 : if (target)
8037 : : return target;
8038 : : break;
8039 : :
8040 : 1063 : case BUILT_IN_FECLEAREXCEPT:
8041 : 1063 : target = expand_builtin_feclear_feraise_except (exp, target, target_mode,
8042 : : feclearexcept_optab);
8043 : 1063 : if (target)
8044 : : return target;
8045 : : break;
8046 : :
8047 : 831 : case BUILT_IN_FERAISEEXCEPT:
8048 : 831 : target = expand_builtin_feclear_feraise_except (exp, target, target_mode,
8049 : : feraiseexcept_optab);
8050 : 831 : if (target)
8051 : : return target;
8052 : : break;
8053 : :
8054 : 464 : case BUILT_IN_APPLY_ARGS:
8055 : 464 : return expand_builtin_apply_args ();
8056 : :
8057 : : /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
8058 : : FUNCTION with a copy of the parameters described by
8059 : : ARGUMENTS, and ARGSIZE. It returns a block of memory
8060 : : allocated on the stack into which is stored all the registers
8061 : : that might possibly be used for returning the result of a
8062 : : function. ARGUMENTS is the value returned by
8063 : : __builtin_apply_args. ARGSIZE is the number of bytes of
8064 : : arguments that must be copied. ??? How should this value be
8065 : : computed? We'll also need a safe worst case value for varargs
8066 : : functions. */
8067 : 483 : case BUILT_IN_APPLY:
8068 : 483 : if (!validate_arglist (exp, POINTER_TYPE,
8069 : : POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
8070 : 483 : && !validate_arglist (exp, REFERENCE_TYPE,
8071 : : POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8072 : 0 : return const0_rtx;
8073 : : else
8074 : : {
8075 : 483 : rtx ops[3];
8076 : :
8077 : 483 : ops[0] = expand_normal (CALL_EXPR_ARG (exp, 0));
8078 : 483 : ops[1] = expand_normal (CALL_EXPR_ARG (exp, 1));
8079 : 483 : ops[2] = expand_normal (CALL_EXPR_ARG (exp, 2));
8080 : :
8081 : 483 : return expand_builtin_apply (ops[0], ops[1], ops[2]);
8082 : : }
8083 : :
8084 : : /* __builtin_return (RESULT) causes the function to return the
8085 : : value described by RESULT. RESULT is address of the block of
8086 : : memory returned by __builtin_apply. */
8087 : 379 : case BUILT_IN_RETURN:
8088 : 379 : if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
8089 : 379 : expand_builtin_return (expand_normal (CALL_EXPR_ARG (exp, 0)));
8090 : 379 : return const0_rtx;
8091 : :
8092 : 0 : case BUILT_IN_SAVEREGS:
8093 : 0 : return expand_builtin_saveregs ();
8094 : :
8095 : 16 : case BUILT_IN_VA_ARG_PACK:
8096 : : /* All valid uses of __builtin_va_arg_pack () are removed during
8097 : : inlining. */
8098 : 16 : error ("invalid use of %<__builtin_va_arg_pack ()%>");
8099 : 16 : return const0_rtx;
8100 : :
8101 : 0 : case BUILT_IN_VA_ARG_PACK_LEN:
8102 : : /* All valid uses of __builtin_va_arg_pack_len () are removed during
8103 : : inlining. */
8104 : 0 : error ("invalid use of %<__builtin_va_arg_pack_len ()%>");
8105 : 0 : return const0_rtx;
8106 : :
8107 : : /* Return the address of the first anonymous stack arg. */
8108 : 150 : case BUILT_IN_NEXT_ARG:
8109 : 150 : if (fold_builtin_next_arg (exp, false))
8110 : 0 : return const0_rtx;
8111 : 150 : return expand_builtin_next_arg ();
8112 : :
8113 : 28 : case BUILT_IN_CLEAR_CACHE:
8114 : 28 : expand_builtin___clear_cache (exp);
8115 : 28 : return const0_rtx;
8116 : :
8117 : 0 : case BUILT_IN_CLASSIFY_TYPE:
8118 : 0 : return expand_builtin_classify_type (exp);
8119 : :
8120 : 0 : case BUILT_IN_CONSTANT_P:
8121 : 0 : return const0_rtx;
8122 : :
8123 : 15583 : case BUILT_IN_FRAME_ADDRESS:
8124 : 15583 : case BUILT_IN_RETURN_ADDRESS:
8125 : 15583 : return expand_builtin_frame_address (fndecl, exp);
8126 : :
8127 : 540 : case BUILT_IN_STACK_ADDRESS:
8128 : 540 : return expand_builtin_stack_address ();
8129 : :
8130 : 2159 : case BUILT_IN___STRUB_ENTER:
8131 : 2159 : target = expand_builtin_strub_enter (exp);
8132 : 2159 : if (target)
8133 : : return target;
8134 : : break;
8135 : :
8136 : 1071 : case BUILT_IN___STRUB_UPDATE:
8137 : 1071 : target = expand_builtin_strub_update (exp);
8138 : 1071 : if (target)
8139 : : return target;
8140 : : break;
8141 : :
8142 : 2729 : case BUILT_IN___STRUB_LEAVE:
8143 : 2729 : target = expand_builtin_strub_leave (exp);
8144 : 2729 : if (target)
8145 : : return target;
8146 : : break;
8147 : :
8148 : : /* Returns the address of the area where the structure is returned.
8149 : : 0 otherwise. */
8150 : 0 : case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
8151 : 0 : if (call_expr_nargs (exp) != 0
8152 : 0 : || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
8153 : 0 : || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl))))
8154 : 0 : return const0_rtx;
8155 : : else
8156 : 0 : return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
8157 : :
8158 : 28005 : CASE_BUILT_IN_ALLOCA:
8159 : 28005 : target = expand_builtin_alloca (exp);
8160 : 28005 : if (target)
8161 : : return target;
8162 : : break;
8163 : :
8164 : 203 : case BUILT_IN_ASAN_ALLOCAS_UNPOISON:
8165 : 203 : return expand_asan_emit_allocas_unpoison (exp);
8166 : :
8167 : 1790 : case BUILT_IN_STACK_SAVE:
8168 : 1790 : return expand_stack_save ();
8169 : :
8170 : 1688 : case BUILT_IN_STACK_RESTORE:
8171 : 1688 : expand_stack_restore (CALL_EXPR_ARG (exp, 0));
8172 : 1688 : return const0_rtx;
8173 : :
8174 : 1163 : case BUILT_IN_BSWAP16:
8175 : 1163 : case BUILT_IN_BSWAP32:
8176 : 1163 : case BUILT_IN_BSWAP64:
8177 : 1163 : case BUILT_IN_BSWAP128:
8178 : 1163 : target = expand_builtin_bswap (target_mode, exp, target, subtarget);
8179 : 1163 : if (target)
8180 : : return target;
8181 : : break;
8182 : :
8183 : 0 : CASE_INT_FN (BUILT_IN_FFS):
8184 : 0 : target = expand_builtin_unop (target_mode, exp, target,
8185 : : subtarget, ffs_optab);
8186 : 0 : if (target)
8187 : : return target;
8188 : : break;
8189 : :
8190 : 183 : CASE_INT_FN (BUILT_IN_CLZ):
8191 : 183 : target = expand_builtin_unop (target_mode, exp, target,
8192 : : subtarget, clz_optab);
8193 : 183 : if (target)
8194 : : return target;
8195 : : break;
8196 : :
8197 : 50 : CASE_INT_FN (BUILT_IN_CTZ):
8198 : 50 : target = expand_builtin_unop (target_mode, exp, target,
8199 : : subtarget, ctz_optab);
8200 : 50 : if (target)
8201 : : return target;
8202 : : break;
8203 : :
8204 : 90 : CASE_INT_FN (BUILT_IN_CLRSB):
8205 : 90 : target = expand_builtin_unop (target_mode, exp, target,
8206 : : subtarget, clrsb_optab);
8207 : 90 : if (target)
8208 : : return target;
8209 : : break;
8210 : :
8211 : 418 : CASE_INT_FN (BUILT_IN_POPCOUNT):
8212 : 418 : target = expand_builtin_unop (target_mode, exp, target,
8213 : : subtarget, popcount_optab);
8214 : 418 : if (target)
8215 : : return target;
8216 : : break;
8217 : :
8218 : 11 : CASE_INT_FN (BUILT_IN_PARITY):
8219 : 11 : target = expand_builtin_unop (target_mode, exp, target,
8220 : : subtarget, parity_optab);
8221 : 11 : if (target)
8222 : : return target;
8223 : : break;
8224 : :
8225 : 13542 : case BUILT_IN_STRLEN:
8226 : 13542 : target = expand_builtin_strlen (exp, target, target_mode);
8227 : 13542 : if (target)
8228 : : return target;
8229 : : break;
8230 : :
8231 : 580 : case BUILT_IN_STRNLEN:
8232 : 580 : target = expand_builtin_strnlen (exp, target, target_mode);
8233 : 580 : if (target)
8234 : : return target;
8235 : : break;
8236 : :
8237 : 1862 : case BUILT_IN_STRCPY:
8238 : 1862 : target = expand_builtin_strcpy (exp, target);
8239 : 1862 : if (target)
8240 : : return target;
8241 : : break;
8242 : :
8243 : 2168 : case BUILT_IN_STRNCPY:
8244 : 2168 : target = expand_builtin_strncpy (exp, target);
8245 : 2168 : if (target)
8246 : : return target;
8247 : : break;
8248 : :
8249 : 454 : case BUILT_IN_STPCPY:
8250 : 454 : target = expand_builtin_stpcpy (exp, target, mode);
8251 : 454 : if (target)
8252 : : return target;
8253 : : break;
8254 : :
8255 : 91928 : case BUILT_IN_MEMCPY:
8256 : 91928 : target = expand_builtin_memcpy (exp, target);
8257 : 91928 : if (target)
8258 : : return target;
8259 : : break;
8260 : :
8261 : 16120 : case BUILT_IN_MEMMOVE:
8262 : 16120 : target = expand_builtin_memmove (exp, target);
8263 : 16120 : if (target)
8264 : : return target;
8265 : : break;
8266 : :
8267 : 1637 : case BUILT_IN_MEMPCPY:
8268 : 1637 : target = expand_builtin_mempcpy (exp, target);
8269 : 1637 : if (target)
8270 : : return target;
8271 : : break;
8272 : :
8273 : 35979 : case BUILT_IN_MEMSET:
8274 : 35979 : target = expand_builtin_memset (exp, target, mode);
8275 : 35979 : if (target)
8276 : : return target;
8277 : : break;
8278 : :
8279 : 0 : case BUILT_IN_BZERO:
8280 : 0 : target = expand_builtin_bzero (exp);
8281 : 0 : if (target)
8282 : : return target;
8283 : : break;
8284 : :
8285 : : /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
8286 : : back to a BUILT_IN_STRCMP. Remember to delete the 3rd parameter
8287 : : when changing it to a strcmp call. */
8288 : 381 : case BUILT_IN_STRCMP_EQ:
8289 : 381 : target = expand_builtin_memcmp (exp, target, true);
8290 : 381 : if (target)
8291 : : return target;
8292 : :
8293 : : /* Change this call back to a BUILT_IN_STRCMP. */
8294 : 25 : TREE_OPERAND (exp, 1)
8295 : 25 : = build_fold_addr_expr (builtin_decl_explicit (BUILT_IN_STRCMP));
8296 : :
8297 : : /* Delete the last parameter. */
8298 : 25 : unsigned int i;
8299 : 25 : vec<tree, va_gc> *arg_vec;
8300 : 25 : vec_alloc (arg_vec, 2);
8301 : 100 : for (i = 0; i < 2; i++)
8302 : 50 : arg_vec->quick_push (CALL_EXPR_ARG (exp, i));
8303 : 25 : exp = build_call_vec (TREE_TYPE (exp), CALL_EXPR_FN (exp), arg_vec);
8304 : : /* FALLTHROUGH */
8305 : :
8306 : 127973 : case BUILT_IN_STRCMP:
8307 : 127973 : target = expand_builtin_strcmp (exp, target);
8308 : 127973 : if (target)
8309 : : return target;
8310 : : break;
8311 : :
8312 : : /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
8313 : : back to a BUILT_IN_STRNCMP. */
8314 : 36 : case BUILT_IN_STRNCMP_EQ:
8315 : 36 : target = expand_builtin_memcmp (exp, target, true);
8316 : 36 : if (target)
8317 : : return target;
8318 : :
8319 : : /* Change it back to a BUILT_IN_STRNCMP. */
8320 : 0 : TREE_OPERAND (exp, 1)
8321 : 0 : = build_fold_addr_expr (builtin_decl_explicit (BUILT_IN_STRNCMP));
8322 : : /* FALLTHROUGH */
8323 : :
8324 : 2035 : case BUILT_IN_STRNCMP:
8325 : 2035 : target = expand_builtin_strncmp (exp, target, mode);
8326 : 2035 : if (target)
8327 : : return target;
8328 : : break;
8329 : :
8330 : 101787 : case BUILT_IN_BCMP:
8331 : 101787 : case BUILT_IN_MEMCMP:
8332 : 101787 : case BUILT_IN_MEMCMP_EQ:
8333 : 101787 : target = expand_builtin_memcmp (exp, target, fcode == BUILT_IN_MEMCMP_EQ);
8334 : 101787 : if (target)
8335 : : return target;
8336 : 35980 : if (fcode == BUILT_IN_MEMCMP_EQ)
8337 : : {
8338 : 22061 : tree newdecl = builtin_decl_explicit (BUILT_IN_MEMCMP);
8339 : 22061 : TREE_OPERAND (exp, 1) = build_fold_addr_expr (newdecl);
8340 : : }
8341 : : break;
8342 : :
8343 : 0 : case BUILT_IN_SETJMP:
8344 : : /* This should have been lowered to the builtins below. */
8345 : 0 : gcc_unreachable ();
8346 : :
8347 : 841 : case BUILT_IN_SETJMP_SETUP:
8348 : : /* __builtin_setjmp_setup is passed a pointer to an array of five words
8349 : : and the receiver label. */
8350 : 841 : if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8351 : : {
8352 : 841 : rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
8353 : : VOIDmode, EXPAND_NORMAL);
8354 : 841 : tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 1), 0);
8355 : 841 : rtx_insn *label_r = label_rtx (label);
8356 : :
8357 : 841 : expand_builtin_setjmp_setup (buf_addr, label_r);
8358 : 841 : return const0_rtx;
8359 : : }
8360 : : break;
8361 : :
8362 : 841 : case BUILT_IN_SETJMP_RECEIVER:
8363 : : /* __builtin_setjmp_receiver is passed the receiver label. */
8364 : 841 : if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
8365 : : {
8366 : 841 : tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
8367 : 841 : rtx_insn *label_r = label_rtx (label);
8368 : :
8369 : 841 : expand_builtin_setjmp_receiver (label_r);
8370 : 841 : nonlocal_goto_handler_labels
8371 : 1682 : = gen_rtx_INSN_LIST (VOIDmode, label_r,
8372 : 841 : nonlocal_goto_handler_labels);
8373 : : /* ??? Do not let expand_label treat us as such since we would
8374 : : not want to be both on the list of non-local labels and on
8375 : : the list of forced labels. */
8376 : 841 : FORCED_LABEL (label) = 0;
8377 : 841 : return const0_rtx;
8378 : : }
8379 : : break;
8380 : :
8381 : : /* __builtin_longjmp is passed a pointer to an array of five words.
8382 : : It's similar to the C library longjmp function but works with
8383 : : __builtin_setjmp above. */
8384 : 391 : case BUILT_IN_LONGJMP:
8385 : 391 : if (validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8386 : : {
8387 : 391 : rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
8388 : : VOIDmode, EXPAND_NORMAL);
8389 : 391 : rtx value = expand_normal (CALL_EXPR_ARG (exp, 1));
8390 : :
8391 : 391 : if (value != const1_rtx)
8392 : : {
8393 : 0 : error ("%<__builtin_longjmp%> second argument must be 1");
8394 : 0 : return const0_rtx;
8395 : : }
8396 : :
8397 : 391 : expand_builtin_longjmp (buf_addr, value);
8398 : 391 : return const0_rtx;
8399 : : }
8400 : : break;
8401 : :
8402 : 510 : case BUILT_IN_NONLOCAL_GOTO:
8403 : 510 : target = expand_builtin_nonlocal_goto (exp);
8404 : 510 : if (target)
8405 : : return target;
8406 : : break;
8407 : :
8408 : : /* This updates the setjmp buffer that is its argument with the value
8409 : : of the current stack pointer. */
8410 : 0 : case BUILT_IN_UPDATE_SETJMP_BUF:
8411 : 0 : if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
8412 : : {
8413 : 0 : rtx buf_addr
8414 : 0 : = expand_normal (CALL_EXPR_ARG (exp, 0));
8415 : :
8416 : 0 : expand_builtin_update_setjmp_buf (buf_addr);
8417 : 0 : return const0_rtx;
8418 : : }
8419 : : break;
8420 : :
8421 : 38525 : case BUILT_IN_TRAP:
8422 : 38525 : case BUILT_IN_UNREACHABLE_TRAP:
8423 : 38525 : expand_builtin_trap ();
8424 : 38525 : return const0_rtx;
8425 : :
8426 : 5395 : case BUILT_IN_UNREACHABLE:
8427 : 5395 : expand_builtin_unreachable ();
8428 : 5395 : return const0_rtx;
8429 : :
8430 : 1139 : CASE_FLT_FN (BUILT_IN_SIGNBIT):
8431 : 1139 : case BUILT_IN_SIGNBITD32:
8432 : 1139 : case BUILT_IN_SIGNBITD64:
8433 : 1139 : case BUILT_IN_SIGNBITD128:
8434 : 1139 : target = expand_builtin_signbit (exp, target);
8435 : 1139 : if (target)
8436 : : return target;
8437 : : break;
8438 : :
8439 : : /* Various hooks for the DWARF 2 __throw routine. */
8440 : 34 : case BUILT_IN_UNWIND_INIT:
8441 : 34 : expand_builtin_unwind_init ();
8442 : 34 : return const0_rtx;
8443 : 1203 : case BUILT_IN_DWARF_CFA:
8444 : 1203 : return virtual_cfa_rtx;
8445 : : #ifdef DWARF2_UNWIND_INFO
8446 : 48 : case BUILT_IN_DWARF_SP_COLUMN:
8447 : 48 : return expand_builtin_dwarf_sp_column ();
8448 : 8 : case BUILT_IN_INIT_DWARF_REG_SIZES:
8449 : 8 : expand_builtin_init_dwarf_reg_sizes (CALL_EXPR_ARG (exp, 0));
8450 : 8 : return const0_rtx;
8451 : : #endif
8452 : 19 : case BUILT_IN_FROB_RETURN_ADDR:
8453 : 19 : return expand_builtin_frob_return_addr (CALL_EXPR_ARG (exp, 0));
8454 : 2296 : case BUILT_IN_EXTRACT_RETURN_ADDR:
8455 : 2296 : return expand_builtin_extract_return_addr (CALL_EXPR_ARG (exp, 0));
8456 : 29 : case BUILT_IN_EH_RETURN:
8457 : 58 : expand_builtin_eh_return (CALL_EXPR_ARG (exp, 0),
8458 : 29 : CALL_EXPR_ARG (exp, 1));
8459 : 29 : return const0_rtx;
8460 : 21 : case BUILT_IN_EH_RETURN_DATA_REGNO:
8461 : 21 : return expand_builtin_eh_return_data_regno (exp);
8462 : 2 : case BUILT_IN_EXTEND_POINTER:
8463 : 2 : return expand_builtin_extend_pointer (CALL_EXPR_ARG (exp, 0));
8464 : 95198 : case BUILT_IN_EH_POINTER:
8465 : 95198 : return expand_builtin_eh_pointer (exp);
8466 : 5012 : case BUILT_IN_EH_FILTER:
8467 : 5012 : return expand_builtin_eh_filter (exp);
8468 : 103698 : case BUILT_IN_EH_COPY_VALUES:
8469 : 103698 : return expand_builtin_eh_copy_values (exp);
8470 : :
8471 : 20957 : case BUILT_IN_VA_START:
8472 : 20957 : return expand_builtin_va_start (exp);
8473 : 12104 : case BUILT_IN_VA_END:
8474 : 12104 : return expand_builtin_va_end (exp);
8475 : 242 : case BUILT_IN_VA_COPY:
8476 : 242 : return expand_builtin_va_copy (exp);
8477 : 1017 : case BUILT_IN_EXPECT:
8478 : 1017 : return expand_builtin_expect (exp, target);
8479 : 5 : case BUILT_IN_EXPECT_WITH_PROBABILITY:
8480 : 5 : return expand_builtin_expect_with_probability (exp, target);
8481 : 75 : case BUILT_IN_ASSUME_ALIGNED:
8482 : 75 : return expand_builtin_assume_aligned (exp, target);
8483 : 2037 : case BUILT_IN_PREFETCH:
8484 : 2037 : expand_builtin_prefetch (exp);
8485 : 2037 : return const0_rtx;
8486 : :
8487 : 295 : case BUILT_IN_INIT_TRAMPOLINE:
8488 : 295 : return expand_builtin_init_trampoline (exp, true);
8489 : 0 : case BUILT_IN_INIT_HEAP_TRAMPOLINE:
8490 : 0 : return expand_builtin_init_trampoline (exp, false);
8491 : 339 : case BUILT_IN_ADJUST_TRAMPOLINE:
8492 : 339 : return expand_builtin_adjust_trampoline (exp);
8493 : :
8494 : 0 : case BUILT_IN_INIT_DESCRIPTOR:
8495 : 0 : return expand_builtin_init_descriptor (exp);
8496 : 0 : case BUILT_IN_ADJUST_DESCRIPTOR:
8497 : 0 : return expand_builtin_adjust_descriptor (exp);
8498 : :
8499 : : case BUILT_IN_GCC_NESTED_PTR_CREATED:
8500 : : case BUILT_IN_GCC_NESTED_PTR_DELETED:
8501 : : break; /* At present, no expansion, just call the function. */
8502 : :
8503 : 87 : case BUILT_IN_FORK:
8504 : 87 : case BUILT_IN_EXECL:
8505 : 87 : case BUILT_IN_EXECV:
8506 : 87 : case BUILT_IN_EXECLP:
8507 : 87 : case BUILT_IN_EXECLE:
8508 : 87 : case BUILT_IN_EXECVP:
8509 : 87 : case BUILT_IN_EXECVE:
8510 : 87 : target = expand_builtin_fork_or_exec (fndecl, exp, target, ignore);
8511 : 87 : if (target)
8512 : : return target;
8513 : : break;
8514 : :
8515 : 707 : case BUILT_IN_SYNC_FETCH_AND_ADD_1:
8516 : 707 : case BUILT_IN_SYNC_FETCH_AND_ADD_2:
8517 : 707 : case BUILT_IN_SYNC_FETCH_AND_ADD_4:
8518 : 707 : case BUILT_IN_SYNC_FETCH_AND_ADD_8:
8519 : 707 : case BUILT_IN_SYNC_FETCH_AND_ADD_16:
8520 : 707 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_ADD_1);
8521 : 707 : target = expand_builtin_sync_operation (mode, exp, PLUS, false, target);
8522 : 707 : if (target)
8523 : : return target;
8524 : : break;
8525 : :
8526 : 581 : case BUILT_IN_SYNC_FETCH_AND_SUB_1:
8527 : 581 : case BUILT_IN_SYNC_FETCH_AND_SUB_2:
8528 : 581 : case BUILT_IN_SYNC_FETCH_AND_SUB_4:
8529 : 581 : case BUILT_IN_SYNC_FETCH_AND_SUB_8:
8530 : 581 : case BUILT_IN_SYNC_FETCH_AND_SUB_16:
8531 : 581 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_SUB_1);
8532 : 581 : target = expand_builtin_sync_operation (mode, exp, MINUS, false, target);
8533 : 581 : if (target)
8534 : : return target;
8535 : : break;
8536 : :
8537 : 512 : case BUILT_IN_SYNC_FETCH_AND_OR_1:
8538 : 512 : case BUILT_IN_SYNC_FETCH_AND_OR_2:
8539 : 512 : case BUILT_IN_SYNC_FETCH_AND_OR_4:
8540 : 512 : case BUILT_IN_SYNC_FETCH_AND_OR_8:
8541 : 512 : case BUILT_IN_SYNC_FETCH_AND_OR_16:
8542 : 512 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_OR_1);
8543 : 512 : target = expand_builtin_sync_operation (mode, exp, IOR, false, target);
8544 : 512 : if (target)
8545 : : return target;
8546 : : break;
8547 : :
8548 : 488 : case BUILT_IN_SYNC_FETCH_AND_AND_1:
8549 : 488 : case BUILT_IN_SYNC_FETCH_AND_AND_2:
8550 : 488 : case BUILT_IN_SYNC_FETCH_AND_AND_4:
8551 : 488 : case BUILT_IN_SYNC_FETCH_AND_AND_8:
8552 : 488 : case BUILT_IN_SYNC_FETCH_AND_AND_16:
8553 : 488 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_AND_1);
8554 : 488 : target = expand_builtin_sync_operation (mode, exp, AND, false, target);
8555 : 488 : if (target)
8556 : : return target;
8557 : : break;
8558 : :
8559 : 581 : case BUILT_IN_SYNC_FETCH_AND_XOR_1:
8560 : 581 : case BUILT_IN_SYNC_FETCH_AND_XOR_2:
8561 : 581 : case BUILT_IN_SYNC_FETCH_AND_XOR_4:
8562 : 581 : case BUILT_IN_SYNC_FETCH_AND_XOR_8:
8563 : 581 : case BUILT_IN_SYNC_FETCH_AND_XOR_16:
8564 : 581 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_XOR_1);
8565 : 581 : target = expand_builtin_sync_operation (mode, exp, XOR, false, target);
8566 : 581 : if (target)
8567 : : return target;
8568 : : break;
8569 : :
8570 : 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_1:
8571 : 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_2:
8572 : 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_4:
8573 : 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_8:
8574 : 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_16:
8575 : 434 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_NAND_1);
8576 : 434 : target = expand_builtin_sync_operation (mode, exp, NOT, false, target);
8577 : 434 : if (target)
8578 : : return target;
8579 : : break;
8580 : :
8581 : 149 : case BUILT_IN_SYNC_ADD_AND_FETCH_1:
8582 : 149 : case BUILT_IN_SYNC_ADD_AND_FETCH_2:
8583 : 149 : case BUILT_IN_SYNC_ADD_AND_FETCH_4:
8584 : 149 : case BUILT_IN_SYNC_ADD_AND_FETCH_8:
8585 : 149 : case BUILT_IN_SYNC_ADD_AND_FETCH_16:
8586 : 149 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_ADD_AND_FETCH_1);
8587 : 149 : target = expand_builtin_sync_operation (mode, exp, PLUS, true, target);
8588 : 149 : if (target)
8589 : : return target;
8590 : : break;
8591 : :
8592 : 117 : case BUILT_IN_SYNC_SUB_AND_FETCH_1:
8593 : 117 : case BUILT_IN_SYNC_SUB_AND_FETCH_2:
8594 : 117 : case BUILT_IN_SYNC_SUB_AND_FETCH_4:
8595 : 117 : case BUILT_IN_SYNC_SUB_AND_FETCH_8:
8596 : 117 : case BUILT_IN_SYNC_SUB_AND_FETCH_16:
8597 : 117 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_SUB_AND_FETCH_1);
8598 : 117 : target = expand_builtin_sync_operation (mode, exp, MINUS, true, target);
8599 : 117 : if (target)
8600 : : return target;
8601 : : break;
8602 : :
8603 : 115 : case BUILT_IN_SYNC_OR_AND_FETCH_1:
8604 : 115 : case BUILT_IN_SYNC_OR_AND_FETCH_2:
8605 : 115 : case BUILT_IN_SYNC_OR_AND_FETCH_4:
8606 : 115 : case BUILT_IN_SYNC_OR_AND_FETCH_8:
8607 : 115 : case BUILT_IN_SYNC_OR_AND_FETCH_16:
8608 : 115 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_OR_AND_FETCH_1);
8609 : 115 : target = expand_builtin_sync_operation (mode, exp, IOR, true, target);
8610 : 115 : if (target)
8611 : : return target;
8612 : : break;
8613 : :
8614 : 116 : case BUILT_IN_SYNC_AND_AND_FETCH_1:
8615 : 116 : case BUILT_IN_SYNC_AND_AND_FETCH_2:
8616 : 116 : case BUILT_IN_SYNC_AND_AND_FETCH_4:
8617 : 116 : case BUILT_IN_SYNC_AND_AND_FETCH_8:
8618 : 116 : case BUILT_IN_SYNC_AND_AND_FETCH_16:
8619 : 116 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_AND_AND_FETCH_1);
8620 : 116 : target = expand_builtin_sync_operation (mode, exp, AND, true, target);
8621 : 116 : if (target)
8622 : : return target;
8623 : : break;
8624 : :
8625 : 114 : case BUILT_IN_SYNC_XOR_AND_FETCH_1:
8626 : 114 : case BUILT_IN_SYNC_XOR_AND_FETCH_2:
8627 : 114 : case BUILT_IN_SYNC_XOR_AND_FETCH_4:
8628 : 114 : case BUILT_IN_SYNC_XOR_AND_FETCH_8:
8629 : 114 : case BUILT_IN_SYNC_XOR_AND_FETCH_16:
8630 : 114 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_XOR_AND_FETCH_1);
8631 : 114 : target = expand_builtin_sync_operation (mode, exp, XOR, true, target);
8632 : 114 : if (target)
8633 : : return target;
8634 : : break;
8635 : :
8636 : 83 : case BUILT_IN_SYNC_NAND_AND_FETCH_1:
8637 : 83 : case BUILT_IN_SYNC_NAND_AND_FETCH_2:
8638 : 83 : case BUILT_IN_SYNC_NAND_AND_FETCH_4:
8639 : 83 : case BUILT_IN_SYNC_NAND_AND_FETCH_8:
8640 : 83 : case BUILT_IN_SYNC_NAND_AND_FETCH_16:
8641 : 83 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_NAND_AND_FETCH_1);
8642 : 83 : target = expand_builtin_sync_operation (mode, exp, NOT, true, target);
8643 : 83 : if (target)
8644 : : return target;
8645 : : break;
8646 : :
8647 : 200 : case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1:
8648 : 200 : case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_2:
8649 : 200 : case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_4:
8650 : 200 : case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_8:
8651 : 200 : case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_16:
8652 : 200 : if (mode == VOIDmode)
8653 : 40 : mode = TYPE_MODE (boolean_type_node);
8654 : 200 : if (!target || !register_operand (target, mode))
8655 : 40 : target = gen_reg_rtx (mode);
8656 : :
8657 : 200 : mode = get_builtin_sync_mode
8658 : 200 : (fcode - BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1);
8659 : 200 : target = expand_builtin_compare_and_swap (mode, exp, true, target);
8660 : 200 : if (target)
8661 : : return target;
8662 : : break;
8663 : :
8664 : 256 : case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1:
8665 : 256 : case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_2:
8666 : 256 : case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_4:
8667 : 256 : case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_8:
8668 : 256 : case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_16:
8669 : 256 : mode = get_builtin_sync_mode
8670 : 256 : (fcode - BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1);
8671 : 256 : target = expand_builtin_compare_and_swap (mode, exp, false, target);
8672 : 256 : if (target)
8673 : : return target;
8674 : : break;
8675 : :
8676 : 326 : case BUILT_IN_SYNC_LOCK_TEST_AND_SET_1:
8677 : 326 : case BUILT_IN_SYNC_LOCK_TEST_AND_SET_2:
8678 : 326 : case BUILT_IN_SYNC_LOCK_TEST_AND_SET_4:
8679 : 326 : case BUILT_IN_SYNC_LOCK_TEST_AND_SET_8:
8680 : 326 : case BUILT_IN_SYNC_LOCK_TEST_AND_SET_16:
8681 : 326 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_TEST_AND_SET_1);
8682 : 326 : target = expand_builtin_sync_lock_test_and_set (mode, exp, target);
8683 : 326 : if (target)
8684 : : return target;
8685 : : break;
8686 : :
8687 : 158 : case BUILT_IN_SYNC_LOCK_RELEASE_1:
8688 : 158 : case BUILT_IN_SYNC_LOCK_RELEASE_2:
8689 : 158 : case BUILT_IN_SYNC_LOCK_RELEASE_4:
8690 : 158 : case BUILT_IN_SYNC_LOCK_RELEASE_8:
8691 : 158 : case BUILT_IN_SYNC_LOCK_RELEASE_16:
8692 : 158 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_RELEASE_1);
8693 : 158 : if (expand_builtin_sync_lock_release (mode, exp))
8694 : 156 : return const0_rtx;
8695 : : break;
8696 : :
8697 : 281 : case BUILT_IN_SYNC_SYNCHRONIZE:
8698 : 281 : expand_builtin_sync_synchronize ();
8699 : 281 : return const0_rtx;
8700 : :
8701 : 2850 : case BUILT_IN_ATOMIC_EXCHANGE_1:
8702 : 2850 : case BUILT_IN_ATOMIC_EXCHANGE_2:
8703 : 2850 : case BUILT_IN_ATOMIC_EXCHANGE_4:
8704 : 2850 : case BUILT_IN_ATOMIC_EXCHANGE_8:
8705 : 2850 : case BUILT_IN_ATOMIC_EXCHANGE_16:
8706 : 2850 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_EXCHANGE_1);
8707 : 2850 : target = expand_builtin_atomic_exchange (mode, exp, target);
8708 : 2850 : if (target)
8709 : : return target;
8710 : : break;
8711 : :
8712 : 9234 : case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1:
8713 : 9234 : case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_2:
8714 : 9234 : case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_4:
8715 : 9234 : case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_8:
8716 : 9234 : case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_16:
8717 : 9234 : {
8718 : 9234 : unsigned int nargs, z;
8719 : 9234 : vec<tree, va_gc> *vec;
8720 : :
8721 : 9234 : mode =
8722 : 9234 : get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1);
8723 : 9234 : target = expand_builtin_atomic_compare_exchange (mode, exp, target);
8724 : 9234 : if (target)
8725 : 7434 : return target;
8726 : :
8727 : : /* If this is turned into an external library call, the weak parameter
8728 : : must be dropped to match the expected parameter list. */
8729 : 1800 : nargs = call_expr_nargs (exp);
8730 : 1800 : vec_alloc (vec, nargs - 1);
8731 : 9000 : for (z = 0; z < 3; z++)
8732 : 5400 : vec->quick_push (CALL_EXPR_ARG (exp, z));
8733 : : /* Skip the boolean weak parameter. */
8734 : 5400 : for (z = 4; z < 6; z++)
8735 : 3600 : vec->quick_push (CALL_EXPR_ARG (exp, z));
8736 : 1800 : exp = build_call_vec (TREE_TYPE (exp), CALL_EXPR_FN (exp), vec);
8737 : 1800 : break;
8738 : : }
8739 : :
8740 : 70905 : case BUILT_IN_ATOMIC_LOAD_1:
8741 : 70905 : case BUILT_IN_ATOMIC_LOAD_2:
8742 : 70905 : case BUILT_IN_ATOMIC_LOAD_4:
8743 : 70905 : case BUILT_IN_ATOMIC_LOAD_8:
8744 : 70905 : case BUILT_IN_ATOMIC_LOAD_16:
8745 : 70905 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_LOAD_1);
8746 : 70905 : target = expand_builtin_atomic_load (mode, exp, target);
8747 : 70905 : if (target)
8748 : : return target;
8749 : : break;
8750 : :
8751 : 17538 : case BUILT_IN_ATOMIC_STORE_1:
8752 : 17538 : case BUILT_IN_ATOMIC_STORE_2:
8753 : 17538 : case BUILT_IN_ATOMIC_STORE_4:
8754 : 17538 : case BUILT_IN_ATOMIC_STORE_8:
8755 : 17538 : case BUILT_IN_ATOMIC_STORE_16:
8756 : 17538 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_STORE_1);
8757 : 17538 : target = expand_builtin_atomic_store (mode, exp);
8758 : 17538 : if (target)
8759 : 15911 : return const0_rtx;
8760 : : break;
8761 : :
8762 : 4377 : case BUILT_IN_ATOMIC_ADD_FETCH_1:
8763 : 4377 : case BUILT_IN_ATOMIC_ADD_FETCH_2:
8764 : 4377 : case BUILT_IN_ATOMIC_ADD_FETCH_4:
8765 : 4377 : case BUILT_IN_ATOMIC_ADD_FETCH_8:
8766 : 4377 : case BUILT_IN_ATOMIC_ADD_FETCH_16:
8767 : 4377 : {
8768 : 4377 : enum built_in_function lib;
8769 : 4377 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_ADD_FETCH_1);
8770 : 4377 : lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_ADD_1 +
8771 : : (fcode - BUILT_IN_ATOMIC_ADD_FETCH_1));
8772 : 4377 : target = expand_builtin_atomic_fetch_op (mode, exp, target, PLUS, true,
8773 : : ignore, lib);
8774 : 4377 : if (target)
8775 : : return target;
8776 : : break;
8777 : : }
8778 : 2178 : case BUILT_IN_ATOMIC_SUB_FETCH_1:
8779 : 2178 : case BUILT_IN_ATOMIC_SUB_FETCH_2:
8780 : 2178 : case BUILT_IN_ATOMIC_SUB_FETCH_4:
8781 : 2178 : case BUILT_IN_ATOMIC_SUB_FETCH_8:
8782 : 2178 : case BUILT_IN_ATOMIC_SUB_FETCH_16:
8783 : 2178 : {
8784 : 2178 : enum built_in_function lib;
8785 : 2178 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_SUB_FETCH_1);
8786 : 2178 : lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_SUB_1 +
8787 : : (fcode - BUILT_IN_ATOMIC_SUB_FETCH_1));
8788 : 2178 : target = expand_builtin_atomic_fetch_op (mode, exp, target, MINUS, true,
8789 : : ignore, lib);
8790 : 2178 : if (target)
8791 : : return target;
8792 : : break;
8793 : : }
8794 : 891 : case BUILT_IN_ATOMIC_AND_FETCH_1:
8795 : 891 : case BUILT_IN_ATOMIC_AND_FETCH_2:
8796 : 891 : case BUILT_IN_ATOMIC_AND_FETCH_4:
8797 : 891 : case BUILT_IN_ATOMIC_AND_FETCH_8:
8798 : 891 : case BUILT_IN_ATOMIC_AND_FETCH_16:
8799 : 891 : {
8800 : 891 : enum built_in_function lib;
8801 : 891 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_AND_FETCH_1);
8802 : 891 : lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_AND_1 +
8803 : : (fcode - BUILT_IN_ATOMIC_AND_FETCH_1));
8804 : 891 : target = expand_builtin_atomic_fetch_op (mode, exp, target, AND, true,
8805 : : ignore, lib);
8806 : 891 : if (target)
8807 : : return target;
8808 : : break;
8809 : : }
8810 : 155 : case BUILT_IN_ATOMIC_NAND_FETCH_1:
8811 : 155 : case BUILT_IN_ATOMIC_NAND_FETCH_2:
8812 : 155 : case BUILT_IN_ATOMIC_NAND_FETCH_4:
8813 : 155 : case BUILT_IN_ATOMIC_NAND_FETCH_8:
8814 : 155 : case BUILT_IN_ATOMIC_NAND_FETCH_16:
8815 : 155 : {
8816 : 155 : enum built_in_function lib;
8817 : 155 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_NAND_FETCH_1);
8818 : 155 : lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_NAND_1 +
8819 : : (fcode - BUILT_IN_ATOMIC_NAND_FETCH_1));
8820 : 155 : target = expand_builtin_atomic_fetch_op (mode, exp, target, NOT, true,
8821 : : ignore, lib);
8822 : 155 : if (target)
8823 : : return target;
8824 : : break;
8825 : : }
8826 : 836 : case BUILT_IN_ATOMIC_XOR_FETCH_1:
8827 : 836 : case BUILT_IN_ATOMIC_XOR_FETCH_2:
8828 : 836 : case BUILT_IN_ATOMIC_XOR_FETCH_4:
8829 : 836 : case BUILT_IN_ATOMIC_XOR_FETCH_8:
8830 : 836 : case BUILT_IN_ATOMIC_XOR_FETCH_16:
8831 : 836 : {
8832 : 836 : enum built_in_function lib;
8833 : 836 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_XOR_FETCH_1);
8834 : 836 : lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_XOR_1 +
8835 : : (fcode - BUILT_IN_ATOMIC_XOR_FETCH_1));
8836 : 836 : target = expand_builtin_atomic_fetch_op (mode, exp, target, XOR, true,
8837 : : ignore, lib);
8838 : 836 : if (target)
8839 : : return target;
8840 : : break;
8841 : : }
8842 : 953 : case BUILT_IN_ATOMIC_OR_FETCH_1:
8843 : 953 : case BUILT_IN_ATOMIC_OR_FETCH_2:
8844 : 953 : case BUILT_IN_ATOMIC_OR_FETCH_4:
8845 : 953 : case BUILT_IN_ATOMIC_OR_FETCH_8:
8846 : 953 : case BUILT_IN_ATOMIC_OR_FETCH_16:
8847 : 953 : {
8848 : 953 : enum built_in_function lib;
8849 : 953 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_OR_FETCH_1);
8850 : 953 : lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_OR_1 +
8851 : : (fcode - BUILT_IN_ATOMIC_OR_FETCH_1));
8852 : 953 : target = expand_builtin_atomic_fetch_op (mode, exp, target, IOR, true,
8853 : : ignore, lib);
8854 : 953 : if (target)
8855 : : return target;
8856 : : break;
8857 : : }
8858 : 15198 : case BUILT_IN_ATOMIC_FETCH_ADD_1:
8859 : 15198 : case BUILT_IN_ATOMIC_FETCH_ADD_2:
8860 : 15198 : case BUILT_IN_ATOMIC_FETCH_ADD_4:
8861 : 15198 : case BUILT_IN_ATOMIC_FETCH_ADD_8:
8862 : 15198 : case BUILT_IN_ATOMIC_FETCH_ADD_16:
8863 : 15198 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_ADD_1);
8864 : 15198 : target = expand_builtin_atomic_fetch_op (mode, exp, target, PLUS, false,
8865 : : ignore, BUILT_IN_NONE);
8866 : 15198 : if (target)
8867 : : return target;
8868 : : break;
8869 : :
8870 : 2391 : case BUILT_IN_ATOMIC_FETCH_SUB_1:
8871 : 2391 : case BUILT_IN_ATOMIC_FETCH_SUB_2:
8872 : 2391 : case BUILT_IN_ATOMIC_FETCH_SUB_4:
8873 : 2391 : case BUILT_IN_ATOMIC_FETCH_SUB_8:
8874 : 2391 : case BUILT_IN_ATOMIC_FETCH_SUB_16:
8875 : 2391 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_SUB_1);
8876 : 2391 : target = expand_builtin_atomic_fetch_op (mode, exp, target, MINUS, false,
8877 : : ignore, BUILT_IN_NONE);
8878 : 2391 : if (target)
8879 : : return target;
8880 : : break;
8881 : :
8882 : 772 : case BUILT_IN_ATOMIC_FETCH_AND_1:
8883 : 772 : case BUILT_IN_ATOMIC_FETCH_AND_2:
8884 : 772 : case BUILT_IN_ATOMIC_FETCH_AND_4:
8885 : 772 : case BUILT_IN_ATOMIC_FETCH_AND_8:
8886 : 772 : case BUILT_IN_ATOMIC_FETCH_AND_16:
8887 : 772 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_AND_1);
8888 : 772 : target = expand_builtin_atomic_fetch_op (mode, exp, target, AND, false,
8889 : : ignore, BUILT_IN_NONE);
8890 : 772 : if (target)
8891 : : return target;
8892 : : break;
8893 : :
8894 : 118 : case BUILT_IN_ATOMIC_FETCH_NAND_1:
8895 : 118 : case BUILT_IN_ATOMIC_FETCH_NAND_2:
8896 : 118 : case BUILT_IN_ATOMIC_FETCH_NAND_4:
8897 : 118 : case BUILT_IN_ATOMIC_FETCH_NAND_8:
8898 : 118 : case BUILT_IN_ATOMIC_FETCH_NAND_16:
8899 : 118 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_NAND_1);
8900 : 118 : target = expand_builtin_atomic_fetch_op (mode, exp, target, NOT, false,
8901 : : ignore, BUILT_IN_NONE);
8902 : 118 : if (target)
8903 : : return target;
8904 : : break;
8905 : :
8906 : 862 : case BUILT_IN_ATOMIC_FETCH_XOR_1:
8907 : 862 : case BUILT_IN_ATOMIC_FETCH_XOR_2:
8908 : 862 : case BUILT_IN_ATOMIC_FETCH_XOR_4:
8909 : 862 : case BUILT_IN_ATOMIC_FETCH_XOR_8:
8910 : 862 : case BUILT_IN_ATOMIC_FETCH_XOR_16:
8911 : 862 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_XOR_1);
8912 : 862 : target = expand_builtin_atomic_fetch_op (mode, exp, target, XOR, false,
8913 : : ignore, BUILT_IN_NONE);
8914 : 862 : if (target)
8915 : : return target;
8916 : : break;
8917 : :
8918 : 1122 : case BUILT_IN_ATOMIC_FETCH_OR_1:
8919 : 1122 : case BUILT_IN_ATOMIC_FETCH_OR_2:
8920 : 1122 : case BUILT_IN_ATOMIC_FETCH_OR_4:
8921 : 1122 : case BUILT_IN_ATOMIC_FETCH_OR_8:
8922 : 1122 : case BUILT_IN_ATOMIC_FETCH_OR_16:
8923 : 1122 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_OR_1);
8924 : 1122 : target = expand_builtin_atomic_fetch_op (mode, exp, target, IOR, false,
8925 : : ignore, BUILT_IN_NONE);
8926 : 1122 : if (target)
8927 : : return target;
8928 : : break;
8929 : :
8930 : 268 : case BUILT_IN_ATOMIC_TEST_AND_SET:
8931 : 268 : target = expand_builtin_atomic_test_and_set (exp, target);
8932 : 268 : if (target)
8933 : : return target;
8934 : : break;
8935 : :
8936 : 57 : case BUILT_IN_ATOMIC_CLEAR:
8937 : 57 : return expand_builtin_atomic_clear (exp);
8938 : :
8939 : 1 : case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE:
8940 : 1 : return expand_builtin_atomic_always_lock_free (exp);
8941 : :
8942 : 3 : case BUILT_IN_ATOMIC_IS_LOCK_FREE:
8943 : 3 : target = expand_builtin_atomic_is_lock_free (exp);
8944 : 3 : if (target)
8945 : : return target;
8946 : : break;
8947 : :
8948 : 693 : case BUILT_IN_ATOMIC_THREAD_FENCE:
8949 : 693 : expand_builtin_atomic_thread_fence (exp);
8950 : 693 : return const0_rtx;
8951 : :
8952 : 60 : case BUILT_IN_ATOMIC_SIGNAL_FENCE:
8953 : 60 : expand_builtin_atomic_signal_fence (exp);
8954 : 60 : return const0_rtx;
8955 : :
8956 : 618 : case BUILT_IN_OBJECT_SIZE:
8957 : 618 : case BUILT_IN_DYNAMIC_OBJECT_SIZE:
8958 : 618 : return expand_builtin_object_size (exp);
8959 : :
8960 : 837 : case BUILT_IN_MEMCPY_CHK:
8961 : 837 : case BUILT_IN_MEMPCPY_CHK:
8962 : 837 : case BUILT_IN_MEMMOVE_CHK:
8963 : 837 : case BUILT_IN_MEMSET_CHK:
8964 : 837 : target = expand_builtin_memory_chk (exp, target, mode, fcode);
8965 : 837 : if (target)
8966 : : return target;
8967 : : break;
8968 : :
8969 : 1135 : case BUILT_IN_STRCPY_CHK:
8970 : 1135 : case BUILT_IN_STPCPY_CHK:
8971 : 1135 : case BUILT_IN_STRNCPY_CHK:
8972 : 1135 : case BUILT_IN_STPNCPY_CHK:
8973 : 1135 : case BUILT_IN_STRCAT_CHK:
8974 : 1135 : case BUILT_IN_STRNCAT_CHK:
8975 : 1135 : case BUILT_IN_SNPRINTF_CHK:
8976 : 1135 : case BUILT_IN_VSNPRINTF_CHK:
8977 : 1135 : maybe_emit_chk_warning (exp, fcode);
8978 : 1135 : break;
8979 : :
8980 : 1329 : case BUILT_IN_SPRINTF_CHK:
8981 : 1329 : case BUILT_IN_VSPRINTF_CHK:
8982 : 1329 : maybe_emit_sprintf_chk_warning (exp, fcode);
8983 : 1329 : break;
8984 : :
8985 : 3 : case BUILT_IN_THREAD_POINTER:
8986 : 3 : return expand_builtin_thread_pointer (exp, target);
8987 : :
8988 : 0 : case BUILT_IN_SET_THREAD_POINTER:
8989 : 0 : expand_builtin_set_thread_pointer (exp);
8990 : 0 : return const0_rtx;
8991 : :
8992 : : case BUILT_IN_ACC_ON_DEVICE:
8993 : : /* Do library call, if we failed to expand the builtin when
8994 : : folding. */
8995 : : break;
8996 : :
8997 : 356 : case BUILT_IN_GOACC_PARLEVEL_ID:
8998 : 356 : case BUILT_IN_GOACC_PARLEVEL_SIZE:
8999 : 356 : return expand_builtin_goacc_parlevel_id_size (exp, target, ignore);
9000 : :
9001 : 4 : case BUILT_IN_SPECULATION_SAFE_VALUE_PTR:
9002 : 4 : return expand_speculation_safe_value (VOIDmode, exp, target, ignore);
9003 : :
9004 : 30 : case BUILT_IN_SPECULATION_SAFE_VALUE_1:
9005 : 30 : case BUILT_IN_SPECULATION_SAFE_VALUE_2:
9006 : 30 : case BUILT_IN_SPECULATION_SAFE_VALUE_4:
9007 : 30 : case BUILT_IN_SPECULATION_SAFE_VALUE_8:
9008 : 30 : case BUILT_IN_SPECULATION_SAFE_VALUE_16:
9009 : 30 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SPECULATION_SAFE_VALUE_1);
9010 : 30 : return expand_speculation_safe_value (mode, exp, target, ignore);
9011 : :
9012 : 3 : case BUILT_IN_CRC8_DATA8:
9013 : 3 : return expand_builtin_crc_table_based (IFN_CRC, QImode, QImode, mode,
9014 : : exp, target);
9015 : 2 : case BUILT_IN_CRC16_DATA8:
9016 : 2 : return expand_builtin_crc_table_based (IFN_CRC, HImode, QImode, mode,
9017 : : exp, target);
9018 : 2 : case BUILT_IN_CRC16_DATA16:
9019 : 2 : return expand_builtin_crc_table_based (IFN_CRC, HImode, HImode, mode,
9020 : : exp, target);
9021 : 2 : case BUILT_IN_CRC32_DATA8:
9022 : 2 : return expand_builtin_crc_table_based (IFN_CRC, SImode, QImode, mode,
9023 : : exp, target);
9024 : 2 : case BUILT_IN_CRC32_DATA16:
9025 : 2 : return expand_builtin_crc_table_based (IFN_CRC, SImode, HImode, mode,
9026 : : exp, target);
9027 : 2 : case BUILT_IN_CRC32_DATA32:
9028 : 2 : return expand_builtin_crc_table_based (IFN_CRC, SImode, SImode, mode,
9029 : : exp, target);
9030 : 1 : case BUILT_IN_CRC64_DATA8:
9031 : 1 : return expand_builtin_crc_table_based (IFN_CRC, DImode, QImode, mode,
9032 : : exp, target);
9033 : 1 : case BUILT_IN_CRC64_DATA16:
9034 : 1 : return expand_builtin_crc_table_based (IFN_CRC, DImode, HImode, mode,
9035 : : exp, target);
9036 : 1 : case BUILT_IN_CRC64_DATA32:
9037 : 1 : return expand_builtin_crc_table_based (IFN_CRC, DImode, SImode, mode,
9038 : : exp, target);
9039 : 1 : case BUILT_IN_CRC64_DATA64:
9040 : 1 : return expand_builtin_crc_table_based (IFN_CRC, DImode, DImode, mode,
9041 : : exp, target);
9042 : 2 : case BUILT_IN_REV_CRC8_DATA8:
9043 : 2 : return expand_builtin_crc_table_based (IFN_CRC_REV, QImode, QImode,
9044 : : mode, exp, target);
9045 : 2 : case BUILT_IN_REV_CRC16_DATA8:
9046 : 2 : return expand_builtin_crc_table_based (IFN_CRC_REV, HImode, QImode,
9047 : : mode, exp, target);
9048 : 2 : case BUILT_IN_REV_CRC16_DATA16:
9049 : 2 : return expand_builtin_crc_table_based (IFN_CRC_REV, HImode, HImode,
9050 : : mode, exp, target);
9051 : 3 : case BUILT_IN_REV_CRC32_DATA8:
9052 : 3 : return expand_builtin_crc_table_based (IFN_CRC_REV, SImode, QImode,
9053 : : mode, exp, target);
9054 : 2 : case BUILT_IN_REV_CRC32_DATA16:
9055 : 2 : return expand_builtin_crc_table_based (IFN_CRC_REV, SImode, HImode,
9056 : : mode, exp, target);
9057 : 2 : case BUILT_IN_REV_CRC32_DATA32:
9058 : 2 : return expand_builtin_crc_table_based (IFN_CRC_REV, SImode, SImode,
9059 : : mode, exp, target);
9060 : 1 : case BUILT_IN_REV_CRC64_DATA8:
9061 : 1 : return expand_builtin_crc_table_based (IFN_CRC_REV, DImode, QImode,
9062 : : mode, exp, target);
9063 : 1 : case BUILT_IN_REV_CRC64_DATA16:
9064 : 1 : return expand_builtin_crc_table_based (IFN_CRC_REV, DImode, HImode,
9065 : : mode, exp, target);
9066 : 1 : case BUILT_IN_REV_CRC64_DATA32:
9067 : 1 : return expand_builtin_crc_table_based (IFN_CRC_REV, DImode, SImode,
9068 : : mode, exp, target);
9069 : 1 : case BUILT_IN_REV_CRC64_DATA64:
9070 : 1 : return expand_builtin_crc_table_based (IFN_CRC_REV, DImode, DImode,
9071 : : mode, exp, target);
9072 : : default: /* just do library call, if unknown builtin */
9073 : : break;
9074 : : }
9075 : :
9076 : : /* The switch statement above can drop through to cause the function
9077 : : to be called normally. */
9078 : 836987 : return expand_call (exp, target, ignore);
9079 : : }
9080 : :
9081 : : /* Determine whether a tree node represents a call to a built-in
9082 : : function. If the tree T is a call to a built-in function with
9083 : : the right number of arguments of the appropriate types, return
9084 : : the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
9085 : : Otherwise the return value is END_BUILTINS. */
9086 : :
9087 : : enum built_in_function
9088 : 93672377 : builtin_mathfn_code (const_tree t)
9089 : : {
9090 : 93672377 : const_tree fndecl, arg, parmlist;
9091 : 93672377 : const_tree argtype, parmtype;
9092 : 93672377 : const_call_expr_arg_iterator iter;
9093 : :
9094 : 93672377 : if (TREE_CODE (t) != CALL_EXPR)
9095 : : return END_BUILTINS;
9096 : :
9097 : 1361540 : fndecl = get_callee_fndecl (t);
9098 : 1361540 : if (fndecl == NULL_TREE || !fndecl_built_in_p (fndecl, BUILT_IN_NORMAL))
9099 : : return END_BUILTINS;
9100 : :
9101 : 775146 : parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
9102 : 775146 : init_const_call_expr_arg_iterator (t, &iter);
9103 : 2536650 : for (; parmlist; parmlist = TREE_CHAIN (parmlist))
9104 : : {
9105 : : /* If a function doesn't take a variable number of arguments,
9106 : : the last element in the list will have type `void'. */
9107 : 1761295 : parmtype = TREE_VALUE (parmlist);
9108 : 1761295 : if (VOID_TYPE_P (parmtype))
9109 : : {
9110 : 774923 : if (more_const_call_expr_args_p (&iter))
9111 : : return END_BUILTINS;
9112 : 774923 : return DECL_FUNCTION_CODE (fndecl);
9113 : : }
9114 : :
9115 : 986372 : if (! more_const_call_expr_args_p (&iter))
9116 : : return END_BUILTINS;
9117 : :
9118 : 986372 : arg = next_const_call_expr_arg (&iter);
9119 : 986372 : argtype = TREE_TYPE (arg);
9120 : :
9121 : 986372 : if (SCALAR_FLOAT_TYPE_P (parmtype))
9122 : : {
9123 : 729656 : if (! SCALAR_FLOAT_TYPE_P (argtype))
9124 : : return END_BUILTINS;
9125 : : }
9126 : 256716 : else if (COMPLEX_FLOAT_TYPE_P (parmtype))
9127 : : {
9128 : 11729 : if (! COMPLEX_FLOAT_TYPE_P (argtype))
9129 : : return END_BUILTINS;
9130 : : }
9131 : 244987 : else if (POINTER_TYPE_P (parmtype))
9132 : : {
9133 : 71746 : if (! POINTER_TYPE_P (argtype))
9134 : : return END_BUILTINS;
9135 : : }
9136 : 173241 : else if (INTEGRAL_TYPE_P (parmtype))
9137 : : {
9138 : 173241 : if (! INTEGRAL_TYPE_P (argtype))
9139 : : return END_BUILTINS;
9140 : : }
9141 : : else
9142 : : return END_BUILTINS;
9143 : : }
9144 : :
9145 : : /* Variable-length argument list. */
9146 : 209 : return DECL_FUNCTION_CODE (fndecl);
9147 : : }
9148 : :
9149 : : /* Fold a call to __builtin_constant_p, if we know its argument ARG will
9150 : : evaluate to a constant. */
9151 : :
9152 : : tree
9153 : 783510 : fold_builtin_constant_p (tree arg)
9154 : : {
9155 : : /* We return 1 for a numeric type that's known to be a constant
9156 : : value at compile-time or for an aggregate type that's a
9157 : : literal constant. */
9158 : 783510 : STRIP_NOPS (arg);
9159 : :
9160 : : /* If we know this is a constant, emit the constant of one. */
9161 : 783510 : if (CONSTANT_CLASS_P (arg)
9162 : 783510 : || (TREE_CODE (arg) == CONSTRUCTOR
9163 : 6 : && TREE_CONSTANT (arg)))
9164 : 27374 : return integer_one_node;
9165 : 756136 : if (TREE_CODE (arg) == ADDR_EXPR)
9166 : : {
9167 : 110 : tree op = TREE_OPERAND (arg, 0);
9168 : 110 : if (TREE_CODE (op) == STRING_CST
9169 : 110 : || (TREE_CODE (op) == ARRAY_REF
9170 : 57 : && integer_zerop (TREE_OPERAND (op, 1))
9171 : 57 : && TREE_CODE (TREE_OPERAND (op, 0)) == STRING_CST))
9172 : 87 : return integer_one_node;
9173 : : }
9174 : :
9175 : : /* If this expression has side effects, show we don't know it to be a
9176 : : constant. Likewise if it's a pointer or aggregate type since in
9177 : : those case we only want literals, since those are only optimized
9178 : : when generating RTL, not later.
9179 : : And finally, if we are compiling an initializer, not code, we
9180 : : need to return a definite result now; there's not going to be any
9181 : : more optimization done. */
9182 : 756049 : if (TREE_SIDE_EFFECTS (arg)
9183 : 755924 : || AGGREGATE_TYPE_P (TREE_TYPE (arg))
9184 : 755912 : || POINTER_TYPE_P (TREE_TYPE (arg))
9185 : 755747 : || cfun == 0
9186 : 755697 : || folding_initializer
9187 : 1511739 : || force_folding_builtin_constant_p)
9188 : 377 : return integer_zero_node;
9189 : :
9190 : : return NULL_TREE;
9191 : : }
9192 : :
9193 : : /* Create builtin_expect or builtin_expect_with_probability
9194 : : with PRED and EXPECTED as its arguments and return it as a truthvalue.
9195 : : Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
9196 : : builtin_expect_with_probability instead uses third argument as PROBABILITY
9197 : : value. */
9198 : :
9199 : : static tree
9200 : 49716 : build_builtin_expect_predicate (location_t loc, tree pred, tree expected,
9201 : : tree predictor, tree probability)
9202 : : {
9203 : 49716 : tree fn, arg_types, pred_type, expected_type, call_expr, ret_type;
9204 : :
9205 : 49716 : fn = builtin_decl_explicit (probability == NULL_TREE ? BUILT_IN_EXPECT
9206 : : : BUILT_IN_EXPECT_WITH_PROBABILITY);
9207 : 49716 : arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
9208 : 49716 : ret_type = TREE_TYPE (TREE_TYPE (fn));
9209 : 49716 : pred_type = TREE_VALUE (arg_types);
9210 : 49716 : expected_type = TREE_VALUE (TREE_CHAIN (arg_types));
9211 : :
9212 : 49716 : pred = fold_convert_loc (loc, pred_type, pred);
9213 : 49716 : expected = fold_convert_loc (loc, expected_type, expected);
9214 : :
9215 : 49716 : if (probability)
9216 : 0 : call_expr = build_call_expr_loc (loc, fn, 3, pred, expected, probability);
9217 : : else
9218 : 99432 : call_expr = build_call_expr_loc (loc, fn, predictor ? 3 : 2, pred, expected,
9219 : : predictor);
9220 : :
9221 : 49716 : return build2 (NE_EXPR, TREE_TYPE (pred), call_expr,
9222 : 49716 : build_int_cst (ret_type, 0));
9223 : : }
9224 : :
9225 : : /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
9226 : : NULL_TREE if no simplification is possible. */
9227 : :
9228 : : tree
9229 : 5559631 : fold_builtin_expect (location_t loc, tree arg0, tree arg1, tree arg2,
9230 : : tree arg3)
9231 : : {
9232 : 5559631 : tree inner, fndecl, inner_arg0;
9233 : 5559631 : enum tree_code code;
9234 : :
9235 : : /* Distribute the expected value over short-circuiting operators.
9236 : : See through the cast from truthvalue_type_node to long. */
9237 : 5559631 : inner_arg0 = arg0;
9238 : 11252596 : while (CONVERT_EXPR_P (inner_arg0)
9239 : 418433 : && INTEGRAL_TYPE_P (TREE_TYPE (inner_arg0))
9240 : 6396496 : && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (inner_arg0, 0))))
9241 : 418432 : inner_arg0 = TREE_OPERAND (inner_arg0, 0);
9242 : :
9243 : : /* If this is a builtin_expect within a builtin_expect keep the
9244 : : inner one. See through a comparison against a constant. It
9245 : : might have been added to create a thruthvalue. */
9246 : 5559631 : inner = inner_arg0;
9247 : :
9248 : 5559631 : if (COMPARISON_CLASS_P (inner)
9249 : 5559631 : && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST)
9250 : 707562 : inner = TREE_OPERAND (inner, 0);
9251 : :
9252 : 5559631 : if (TREE_CODE (inner) == CALL_EXPR
9253 : 55118 : && (fndecl = get_callee_fndecl (inner))
9254 : 5614749 : && fndecl_built_in_p (fndecl, BUILT_IN_EXPECT,
9255 : : BUILT_IN_EXPECT_WITH_PROBABILITY))
9256 : : return arg0;
9257 : :
9258 : 5559623 : inner = inner_arg0;
9259 : 5559623 : code = TREE_CODE (inner);
9260 : 5559623 : if (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
9261 : : {
9262 : 24858 : tree op0 = TREE_OPERAND (inner, 0);
9263 : 24858 : tree op1 = TREE_OPERAND (inner, 1);
9264 : 24858 : arg1 = save_expr (arg1);
9265 : :
9266 : 24858 : op0 = build_builtin_expect_predicate (loc, op0, arg1, arg2, arg3);
9267 : 24858 : op1 = build_builtin_expect_predicate (loc, op1, arg1, arg2, arg3);
9268 : 24858 : inner = build2 (code, TREE_TYPE (inner), op0, op1);
9269 : :
9270 : 24858 : return fold_convert_loc (loc, TREE_TYPE (arg0), inner);
9271 : : }
9272 : :
9273 : : /* If the argument isn't invariant then there's nothing else we can do. */
9274 : 5534765 : if (!TREE_CONSTANT (inner_arg0))
9275 : : return NULL_TREE;
9276 : :
9277 : : /* If we expect that a comparison against the argument will fold to
9278 : : a constant return the constant. In practice, this means a true
9279 : : constant or the address of a non-weak symbol. */
9280 : 66860 : inner = inner_arg0;
9281 : 66860 : STRIP_NOPS (inner);
9282 : 66860 : if (TREE_CODE (inner) == ADDR_EXPR)
9283 : : {
9284 : 1 : do
9285 : : {
9286 : 1 : inner = TREE_OPERAND (inner, 0);
9287 : : }
9288 : 1 : while (TREE_CODE (inner) == COMPONENT_REF
9289 : 1 : || TREE_CODE (inner) == ARRAY_REF);
9290 : 1 : if (VAR_OR_FUNCTION_DECL_P (inner) && DECL_WEAK (inner))
9291 : : return NULL_TREE;
9292 : : }
9293 : :
9294 : : /* Otherwise, ARG0 already has the proper type for the return value. */
9295 : : return arg0;
9296 : : }
9297 : :
9298 : : /* Fold a call to __builtin_classify_type with argument ARG. */
9299 : :
9300 : : static tree
9301 : 2146 : fold_builtin_classify_type (tree arg)
9302 : : {
9303 : 2146 : if (arg == 0)
9304 : 0 : return build_int_cst (integer_type_node, no_type_class);
9305 : :
9306 : 2146 : return build_int_cst (integer_type_node, type_to_class (TREE_TYPE (arg)));
9307 : : }
9308 : :
9309 : : /* Fold a call EXPR (which may be null) to __builtin_strlen with argument
9310 : : ARG. */
9311 : :
9312 : : static tree
9313 : 414671 : fold_builtin_strlen (location_t loc, tree expr, tree type, tree arg)
9314 : : {
9315 : 414671 : if (!validate_arg (arg, POINTER_TYPE))
9316 : : return NULL_TREE;
9317 : : else
9318 : : {
9319 : 414668 : c_strlen_data lendata = { };
9320 : 414668 : tree len = c_strlen (arg, 0, &lendata);
9321 : :
9322 : 414668 : if (len)
9323 : 2359 : return fold_convert_loc (loc, type, len);
9324 : :
9325 : : /* TODO: Move this to gimple-ssa-warn-access once the pass runs
9326 : : also early enough to detect invalid reads in multimensional
9327 : : arrays and struct members. */
9328 : 412309 : if (!lendata.decl)
9329 : 405190 : c_strlen (arg, 1, &lendata);
9330 : :
9331 : 412309 : if (lendata.decl)
9332 : : {
9333 : 7133 : if (EXPR_HAS_LOCATION (arg))
9334 : 2812 : loc = EXPR_LOCATION (arg);
9335 : 4321 : else if (loc == UNKNOWN_LOCATION)
9336 : 0 : loc = input_location;
9337 : 7133 : warn_string_no_nul (loc, expr, "strlen", arg, lendata.decl);
9338 : : }
9339 : :
9340 : 412309 : return NULL_TREE;
9341 : : }
9342 : : }
9343 : :
9344 : : /* Fold a call to __builtin_inf or __builtin_huge_val. */
9345 : :
9346 : : static tree
9347 : 228947 : fold_builtin_inf (location_t loc, tree type, int warn)
9348 : : {
9349 : : /* __builtin_inff is intended to be usable to define INFINITY on all
9350 : : targets. If an infinity is not available, INFINITY expands "to a
9351 : : positive constant of type float that overflows at translation
9352 : : time", footnote "In this case, using INFINITY will violate the
9353 : : constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
9354 : : Thus we pedwarn to ensure this constraint violation is
9355 : : diagnosed. */
9356 : 914979 : if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
9357 : 0 : pedwarn (loc, 0, "target format does not support infinity");
9358 : :
9359 : 228947 : return build_real (type, dconstinf);
9360 : : }
9361 : :
9362 : : /* Fold function call to builtin sincos, sincosf, or sincosl. Return
9363 : : NULL_TREE if no simplification can be made. */
9364 : :
9365 : : static tree
9366 : 145 : fold_builtin_sincos (location_t loc,
9367 : : tree arg0, tree arg1, tree arg2)
9368 : : {
9369 : 145 : tree type;
9370 : 145 : tree fndecl, call = NULL_TREE;
9371 : :
9372 : 145 : if (!validate_arg (arg0, REAL_TYPE)
9373 : 145 : || !validate_arg (arg1, POINTER_TYPE)
9374 : 290 : || !validate_arg (arg2, POINTER_TYPE))
9375 : : return NULL_TREE;
9376 : :
9377 : 145 : type = TREE_TYPE (arg0);
9378 : :
9379 : : /* Calculate the result when the argument is a constant. */
9380 : 145 : built_in_function fn = mathfn_built_in_2 (type, CFN_BUILT_IN_CEXPI);
9381 : 145 : if (fn == END_BUILTINS)
9382 : : return NULL_TREE;
9383 : :
9384 : : /* Canonicalize sincos to cexpi. */
9385 : 145 : if (TREE_CODE (arg0) == REAL_CST)
9386 : : {
9387 : 86 : tree complex_type = build_complex_type (type);
9388 : 86 : call = fold_const_call (as_combined_fn (fn), complex_type, arg0);
9389 : : }
9390 : 86 : if (!call)
9391 : : {
9392 : 59 : if (!targetm.libc_has_function (function_c99_math_complex, type)
9393 : 59 : || !builtin_decl_implicit_p (fn))
9394 : : return NULL_TREE;
9395 : 59 : fndecl = builtin_decl_explicit (fn);
9396 : 59 : call = build_call_expr_loc (loc, fndecl, 1, arg0);
9397 : 59 : call = builtin_save_expr (call);
9398 : : }
9399 : :
9400 : 145 : tree ptype = build_pointer_type (type);
9401 : 145 : arg1 = fold_convert (ptype, arg1);
9402 : 145 : arg2 = fold_convert (ptype, arg2);
9403 : 145 : return build2 (COMPOUND_EXPR, void_type_node,
9404 : : build2 (MODIFY_EXPR, void_type_node,
9405 : : build_fold_indirect_ref_loc (loc, arg1),
9406 : : fold_build1_loc (loc, IMAGPART_EXPR, type, call)),
9407 : : build2 (MODIFY_EXPR, void_type_node,
9408 : : build_fold_indirect_ref_loc (loc, arg2),
9409 : 145 : fold_build1_loc (loc, REALPART_EXPR, type, call)));
9410 : : }
9411 : :
9412 : : /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
9413 : : Return NULL_TREE if no simplification can be made. */
9414 : :
9415 : : static tree
9416 : 2383576 : fold_builtin_memcmp (location_t loc, tree arg1, tree arg2, tree len)
9417 : : {
9418 : 2383576 : if (!validate_arg (arg1, POINTER_TYPE)
9419 : 2383576 : || !validate_arg (arg2, POINTER_TYPE)
9420 : 4767152 : || !validate_arg (len, INTEGER_TYPE))
9421 : : return NULL_TREE;
9422 : :
9423 : : /* If the LEN parameter is zero, return zero. */
9424 : 2383576 : if (integer_zerop (len))
9425 : 0 : return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
9426 : 0 : arg1, arg2);
9427 : :
9428 : : /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9429 : 2383576 : if (operand_equal_p (arg1, arg2, 0))
9430 : 739 : return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
9431 : :
9432 : : /* If len parameter is one, return an expression corresponding to
9433 : : (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
9434 : 2382837 : if (tree_fits_uhwi_p (len) && tree_to_uhwi (len) == 1)
9435 : : {
9436 : 19497 : tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9437 : 19497 : tree cst_uchar_ptr_node
9438 : 19497 : = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9439 : :
9440 : 19497 : tree ind1
9441 : 19497 : = fold_convert_loc (loc, integer_type_node,
9442 : : build1 (INDIRECT_REF, cst_uchar_node,
9443 : : fold_convert_loc (loc,
9444 : : cst_uchar_ptr_node,
9445 : : arg1)));
9446 : 19497 : tree ind2
9447 : 19497 : = fold_convert_loc (loc, integer_type_node,
9448 : : build1 (INDIRECT_REF, cst_uchar_node,
9449 : : fold_convert_loc (loc,
9450 : : cst_uchar_ptr_node,
9451 : : arg2)));
9452 : 19497 : return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
9453 : : }
9454 : :
9455 : : return NULL_TREE;
9456 : : }
9457 : :
9458 : : /* Fold a call to builtin isascii with argument ARG. */
9459 : :
9460 : : static tree
9461 : 211 : fold_builtin_isascii (location_t loc, tree arg)
9462 : : {
9463 : 211 : if (!validate_arg (arg, INTEGER_TYPE))
9464 : : return NULL_TREE;
9465 : : else
9466 : : {
9467 : : /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
9468 : 211 : arg = fold_build2 (BIT_AND_EXPR, integer_type_node, arg,
9469 : : build_int_cst (integer_type_node,
9470 : : ~ HOST_WIDE_INT_UC (0x7f)));
9471 : 211 : return fold_build2_loc (loc, EQ_EXPR, integer_type_node,
9472 : 211 : arg, integer_zero_node);
9473 : : }
9474 : : }
9475 : :
9476 : : /* Fold a call to builtin toascii with argument ARG. */
9477 : :
9478 : : static tree
9479 : 168 : fold_builtin_toascii (location_t loc, tree arg)
9480 : : {
9481 : 168 : if (!validate_arg (arg, INTEGER_TYPE))
9482 : : return NULL_TREE;
9483 : :
9484 : : /* Transform toascii(c) -> (c & 0x7f). */
9485 : 168 : return fold_build2_loc (loc, BIT_AND_EXPR, integer_type_node, arg,
9486 : : build_int_cst (integer_type_node, 0x7f));
9487 : : }
9488 : :
9489 : : /* Fold a call to builtin isdigit with argument ARG. */
9490 : :
9491 : : static tree
9492 : 325 : fold_builtin_isdigit (location_t loc, tree arg)
9493 : : {
9494 : 325 : if (!validate_arg (arg, INTEGER_TYPE))
9495 : : return NULL_TREE;
9496 : : else
9497 : : {
9498 : : /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
9499 : : /* According to the C standard, isdigit is unaffected by locale.
9500 : : However, it definitely is affected by the target character set. */
9501 : 313 : unsigned HOST_WIDE_INT target_digit0
9502 : 313 : = lang_hooks.to_target_charset ('0');
9503 : :
9504 : 313 : if (target_digit0 == 0)
9505 : : return NULL_TREE;
9506 : :
9507 : 313 : arg = fold_convert_loc (loc, unsigned_type_node, arg);
9508 : 313 : arg = fold_build2 (MINUS_EXPR, unsigned_type_node, arg,
9509 : : build_int_cst (unsigned_type_node, target_digit0));
9510 : 313 : return fold_build2_loc (loc, LE_EXPR, integer_type_node, arg,
9511 : : build_int_cst (unsigned_type_node, 9));
9512 : : }
9513 : : }
9514 : :
9515 : : /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
9516 : :
9517 : : static tree
9518 : 360308 : fold_builtin_fabs (location_t loc, tree arg, tree type)
9519 : : {
9520 : 360308 : if (!validate_arg (arg, REAL_TYPE))
9521 : : return NULL_TREE;
9522 : :
9523 : 360223 : arg = fold_convert_loc (loc, type, arg);
9524 : 360223 : return fold_build1_loc (loc, ABS_EXPR, type, arg);
9525 : : }
9526 : :
9527 : : /* Fold a call to abs, labs, llabs, imaxabs, uabs, ulabs, ullabs or uimaxabs
9528 : : with argument ARG. */
9529 : :
9530 : : static tree
9531 : 93683 : fold_builtin_abs (location_t loc, tree arg, tree type)
9532 : : {
9533 : 93683 : if (!validate_arg (arg, INTEGER_TYPE))
9534 : : return NULL_TREE;
9535 : :
9536 : 93656 : if (TYPE_UNSIGNED (type))
9537 : : {
9538 : 1168 : if (TYPE_PRECISION (TREE_TYPE (arg))
9539 : 1168 : != TYPE_PRECISION (type)
9540 : 1168 : || TYPE_UNSIGNED (TREE_TYPE (arg)))
9541 : : return NULL_TREE;
9542 : 1168 : return fold_build1_loc (loc, ABSU_EXPR, type, arg);
9543 : : }
9544 : 92488 : arg = fold_convert_loc (loc, type, arg);
9545 : 92488 : return fold_build1_loc (loc, ABS_EXPR, type, arg);
9546 : : }
9547 : :
9548 : : /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
9549 : :
9550 : : static tree
9551 : 115677 : fold_builtin_carg (location_t loc, tree arg, tree type)
9552 : : {
9553 : 115677 : if (validate_arg (arg, COMPLEX_TYPE)
9554 : 115677 : && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TREE_TYPE (arg))))
9555 : : {
9556 : 115677 : tree atan2_fn = mathfn_built_in (type, BUILT_IN_ATAN2);
9557 : :
9558 : 115677 : if (atan2_fn)
9559 : : {
9560 : 111227 : tree new_arg = builtin_save_expr (arg);
9561 : 111227 : tree r_arg = fold_build1_loc (loc, REALPART_EXPR, type, new_arg);
9562 : 111227 : tree i_arg = fold_build1_loc (loc, IMAGPART_EXPR, type, new_arg);
9563 : 111227 : return build_call_expr_loc (loc, atan2_fn, 2, i_arg, r_arg);
9564 : : }
9565 : : }
9566 : :
9567 : : return NULL_TREE;
9568 : : }
9569 : :
9570 : : /* Fold a call to builtin frexp, we can assume the base is 2. */
9571 : :
9572 : : static tree
9573 : 114968 : fold_builtin_frexp (location_t loc, tree arg0, tree arg1, tree rettype)
9574 : : {
9575 : 114968 : if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9576 : : return NULL_TREE;
9577 : :
9578 : 114968 : STRIP_NOPS (arg0);
9579 : :
9580 : 114968 : if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9581 : : return NULL_TREE;
9582 : :
9583 : 2210 : arg1 = build_fold_indirect_ref_loc (loc, arg1);
9584 : :
9585 : : /* Proceed if a valid pointer type was passed in. */
9586 : 2210 : if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == integer_type_node)
9587 : : {
9588 : 2210 : const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9589 : 2210 : tree frac, exp, res;
9590 : :
9591 : 2210 : switch (value->cl)
9592 : : {
9593 : 276 : case rvc_zero:
9594 : 276 : case rvc_nan:
9595 : 276 : case rvc_inf:
9596 : : /* For +-0, return (*exp = 0, +-0). */
9597 : : /* For +-NaN or +-Inf, *exp is unspecified, but something should
9598 : : be stored there so that it isn't read from uninitialized object.
9599 : : As glibc and newlib store *exp = 0 for +-Inf/NaN, storing
9600 : : 0 here as well is easiest. */
9601 : 276 : exp = integer_zero_node;
9602 : 276 : frac = arg0;
9603 : 276 : break;
9604 : 1934 : case rvc_normal:
9605 : 1934 : {
9606 : : /* Since the frexp function always expects base 2, and in
9607 : : GCC normalized significands are already in the range
9608 : : [0.5, 1.0), we have exactly what frexp wants. */
9609 : 1934 : REAL_VALUE_TYPE frac_rvt = *value;
9610 : 1934 : SET_REAL_EXP (&frac_rvt, 0);
9611 : 1934 : frac = build_real (rettype, frac_rvt);
9612 : 1934 : exp = build_int_cst (integer_type_node, REAL_EXP (value));
9613 : : }
9614 : 1934 : break;
9615 : 0 : default:
9616 : 0 : gcc_unreachable ();
9617 : : }
9618 : :
9619 : : /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9620 : 2210 : arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1, exp);
9621 : 2210 : TREE_SIDE_EFFECTS (arg1) = 1;
9622 : 2210 : res = fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1, frac);
9623 : 2210 : suppress_warning (res, OPT_Wunused_value);
9624 : 2210 : return res;
9625 : : }
9626 : :
9627 : : return NULL_TREE;
9628 : : }
9629 : :
9630 : : /* Fold a call to builtin modf. */
9631 : :
9632 : : static tree
9633 : 75480 : fold_builtin_modf (location_t loc, tree arg0, tree arg1, tree rettype)
9634 : : {
9635 : 75480 : if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9636 : : return NULL_TREE;
9637 : :
9638 : 75480 : STRIP_NOPS (arg0);
9639 : :
9640 : 75480 : if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9641 : : return NULL_TREE;
9642 : :
9643 : 2474 : arg1 = build_fold_indirect_ref_loc (loc, arg1);
9644 : :
9645 : : /* Proceed if a valid pointer type was passed in. */
9646 : 2474 : if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == TYPE_MAIN_VARIANT (rettype))
9647 : : {
9648 : 2474 : const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9649 : 2474 : REAL_VALUE_TYPE trunc, frac;
9650 : 2474 : tree res;
9651 : :
9652 : 2474 : switch (value->cl)
9653 : : {
9654 : 228 : case rvc_nan:
9655 : 228 : case rvc_zero:
9656 : : /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
9657 : 228 : trunc = frac = *value;
9658 : 228 : break;
9659 : 96 : case rvc_inf:
9660 : : /* For +-Inf, return (*arg1 = arg0, +-0). */
9661 : 96 : frac = dconst0;
9662 : 96 : frac.sign = value->sign;
9663 : 96 : trunc = *value;
9664 : 96 : break;
9665 : 2150 : case rvc_normal:
9666 : : /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
9667 : 2150 : real_trunc (&trunc, VOIDmode, value);
9668 : 2150 : real_arithmetic (&frac, MINUS_EXPR, value, &trunc);
9669 : : /* If the original number was negative and already
9670 : : integral, then the fractional part is -0.0. */
9671 : 2150 : if (value->sign && frac.cl == rvc_zero)
9672 : 69 : frac.sign = value->sign;
9673 : : break;
9674 : : }
9675 : :
9676 : : /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9677 : 2474 : arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1,
9678 : : build_real (rettype, trunc));
9679 : 2474 : TREE_SIDE_EFFECTS (arg1) = 1;
9680 : 2474 : res = fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1,
9681 : : build_real (rettype, frac));
9682 : 2474 : suppress_warning (res, OPT_Wunused_value);
9683 : 2474 : return res;
9684 : : }
9685 : :
9686 : : return NULL_TREE;
9687 : : }
9688 : :
9689 : : /* Given a location LOC, an interclass builtin function decl FNDECL
9690 : : and its single argument ARG, return an folded expression computing
9691 : : the same, or NULL_TREE if we either couldn't or didn't want to fold
9692 : : (the latter happen if there's an RTL instruction available). */
9693 : :
9694 : : static tree
9695 : 1373275 : fold_builtin_interclass_mathfn (location_t loc, tree fndecl, tree arg)
9696 : : {
9697 : 1373275 : machine_mode mode;
9698 : :
9699 : 1373275 : if (!validate_arg (arg, REAL_TYPE))
9700 : : return NULL_TREE;
9701 : :
9702 : 1373275 : if (interclass_mathfn_icode (arg, fndecl) != CODE_FOR_nothing)
9703 : : return NULL_TREE;
9704 : :
9705 : 1373275 : mode = TYPE_MODE (TREE_TYPE (arg));
9706 : :
9707 : 9609083 : bool is_ibm_extended = MODE_COMPOSITE_P (mode);
9708 : :
9709 : : /* If there is no optab, try generic code. */
9710 : 1373275 : switch (DECL_FUNCTION_CODE (fndecl))
9711 : : {
9712 : 265382 : tree result;
9713 : :
9714 : 265382 : CASE_FLT_FN (BUILT_IN_ISINF):
9715 : 265382 : {
9716 : : /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
9717 : 265382 : tree const isgr_fn = builtin_decl_explicit (BUILT_IN_ISGREATER);
9718 : 265382 : tree type = TREE_TYPE (arg);
9719 : 265382 : REAL_VALUE_TYPE r;
9720 : 265382 : char buf[128];
9721 : :
9722 : 265382 : if (is_ibm_extended)
9723 : : {
9724 : : /* NaN and Inf are encoded in the high-order double value
9725 : : only. The low-order value is not significant. */
9726 : 0 : type = double_type_node;
9727 : 0 : mode = DFmode;
9728 : 0 : arg = fold_build1_loc (loc, NOP_EXPR, type, arg);
9729 : : }
9730 : 265382 : get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf), false);
9731 : 265382 : real_from_string3 (&r, buf, mode);
9732 : 265382 : result = build_call_expr (isgr_fn, 2,
9733 : : fold_build1_loc (loc, ABS_EXPR, type, arg),
9734 : : build_real (type, r));
9735 : 265382 : return result;
9736 : : }
9737 : 576236 : CASE_FLT_FN (BUILT_IN_FINITE):
9738 : 576236 : case BUILT_IN_ISFINITE:
9739 : 576236 : {
9740 : : /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9741 : 576236 : tree const isle_fn = builtin_decl_explicit (BUILT_IN_ISLESSEQUAL);
9742 : 576236 : tree type = TREE_TYPE (arg);
9743 : 576236 : REAL_VALUE_TYPE r;
9744 : 576236 : char buf[128];
9745 : :
9746 : 576236 : if (is_ibm_extended)
9747 : : {
9748 : : /* NaN and Inf are encoded in the high-order double value
9749 : : only. The low-order value is not significant. */
9750 : 0 : type = double_type_node;
9751 : 0 : mode = DFmode;
9752 : 0 : arg = fold_build1_loc (loc, NOP_EXPR, type, arg);
9753 : : }
9754 : 576236 : get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf), false);
9755 : 576236 : real_from_string3 (&r, buf, mode);
9756 : 576236 : result = build_call_expr (isle_fn, 2,
9757 : : fold_build1_loc (loc, ABS_EXPR, type, arg),
9758 : : build_real (type, r));
9759 : : /*result = fold_build2_loc (loc, UNGT_EXPR,
9760 : : TREE_TYPE (TREE_TYPE (fndecl)),
9761 : : fold_build1_loc (loc, ABS_EXPR, type, arg),
9762 : : build_real (type, r));
9763 : : result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9764 : : TREE_TYPE (TREE_TYPE (fndecl)),
9765 : : result);*/
9766 : 576236 : return result;
9767 : : }
9768 : 263598 : case BUILT_IN_ISNORMAL:
9769 : 263598 : {
9770 : : /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9771 : : islessequal(fabs(x),DBL_MAX). */
9772 : 263598 : tree const isle_fn = builtin_decl_explicit (BUILT_IN_ISLESSEQUAL);
9773 : 263598 : tree type = TREE_TYPE (arg);
9774 : 263598 : tree orig_arg, max_exp, min_exp;
9775 : 263598 : machine_mode orig_mode = mode;
9776 : 263598 : REAL_VALUE_TYPE rmax, rmin;
9777 : 263598 : char buf[128];
9778 : :
9779 : 263598 : orig_arg = arg = builtin_save_expr (arg);
9780 : 263598 : if (is_ibm_extended)
9781 : : {
9782 : : /* Use double to test the normal range of IBM extended
9783 : : precision. Emin for IBM extended precision is
9784 : : different to emin for IEEE double, being 53 higher
9785 : : since the low double exponent is at least 53 lower
9786 : : than the high double exponent. */
9787 : 0 : type = double_type_node;
9788 : 0 : mode = DFmode;
9789 : 0 : arg = fold_build1_loc (loc, NOP_EXPR, type, arg);
9790 : : }
9791 : 263598 : arg = fold_build1_loc (loc, ABS_EXPR, type, arg);
9792 : :
9793 : 263598 : get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf), false);
9794 : 263598 : real_from_string3 (&rmax, buf, mode);
9795 : 263598 : if (DECIMAL_FLOAT_MODE_P (mode))
9796 : 1 : sprintf (buf, "1E%d", REAL_MODE_FORMAT (orig_mode)->emin - 1);
9797 : : else
9798 : 263597 : sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (orig_mode)->emin - 1);
9799 : 263598 : real_from_string3 (&rmin, buf, orig_mode);
9800 : 263598 : max_exp = build_real (type, rmax);
9801 : 263598 : min_exp = build_real (type, rmin);
9802 : :
9803 : 263598 : max_exp = build_call_expr (isle_fn, 2, arg, max_exp);
9804 : 263598 : if (is_ibm_extended)
9805 : : {
9806 : : /* Testing the high end of the range is done just using
9807 : : the high double, using the same test as isfinite().
9808 : : For the subnormal end of the range we first test the
9809 : : high double, then if its magnitude is equal to the
9810 : : limit of 0x1p-969, we test whether the low double is
9811 : : non-zero and opposite sign to the high double. */
9812 : 0 : tree const islt_fn = builtin_decl_explicit (BUILT_IN_ISLESS);
9813 : 0 : tree const isgt_fn = builtin_decl_explicit (BUILT_IN_ISGREATER);
9814 : 0 : tree gt_min = build_call_expr (isgt_fn, 2, arg, min_exp);
9815 : 0 : tree eq_min = fold_build2 (EQ_EXPR, integer_type_node,
9816 : : arg, min_exp);
9817 : 0 : tree as_complex = build1 (VIEW_CONVERT_EXPR,
9818 : : complex_double_type_node, orig_arg);
9819 : 0 : tree hi_dbl = build1 (REALPART_EXPR, type, as_complex);
9820 : 0 : tree lo_dbl = build1 (IMAGPART_EXPR, type, as_complex);
9821 : 0 : tree zero = build_real (type, dconst0);
9822 : 0 : tree hilt = build_call_expr (islt_fn, 2, hi_dbl, zero);
9823 : 0 : tree lolt = build_call_expr (islt_fn, 2, lo_dbl, zero);
9824 : 0 : tree logt = build_call_expr (isgt_fn, 2, lo_dbl, zero);
9825 : 0 : tree ok_lo = fold_build1 (TRUTH_NOT_EXPR, integer_type_node,
9826 : : fold_build3 (COND_EXPR,
9827 : : integer_type_node,
9828 : : hilt, logt, lolt));
9829 : 0 : eq_min = fold_build2 (TRUTH_ANDIF_EXPR, integer_type_node,
9830 : : eq_min, ok_lo);
9831 : 0 : min_exp = fold_build2 (TRUTH_ORIF_EXPR, integer_type_node,
9832 : : gt_min, eq_min);
9833 : : }
9834 : : else
9835 : : {
9836 : 263598 : tree const isge_fn
9837 : 263598 : = builtin_decl_explicit (BUILT_IN_ISGREATEREQUAL);
9838 : 263598 : min_exp = build_call_expr (isge_fn, 2, arg, min_exp);
9839 : : }
9840 : 263598 : result = fold_build2 (BIT_AND_EXPR, integer_type_node,
9841 : : max_exp, min_exp);
9842 : 263598 : return result;
9843 : : }
9844 : 266525 : CASE_FLT_FN (BUILT_IN_ISNAN):
9845 : 266525 : case BUILT_IN_ISNAND32:
9846 : 266525 : case BUILT_IN_ISNAND64:
9847 : 266525 : case BUILT_IN_ISNAND128:
9848 : 266525 : {
9849 : : /* In IBM extended NaN and Inf are encoded in the high-order double
9850 : : value only. The low-order value is not significant. */
9851 : 266525 : if (is_ibm_extended)
9852 : 0 : arg = fold_build1_loc (loc, NOP_EXPR, double_type_node, arg);
9853 : 266525 : arg = builtin_save_expr (arg);
9854 : 266525 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
9855 : 266525 : return fold_build2_loc (loc, UNORDERED_EXPR, type, arg, arg);
9856 : : }
9857 : : default:
9858 : : break;
9859 : : }
9860 : :
9861 : : return NULL_TREE;
9862 : : }
9863 : :
9864 : : /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9865 : : ARG is the argument for the call. */
9866 : :
9867 : : static tree
9868 : 1139229 : fold_builtin_classify (location_t loc, tree fndecl, tree arg, int builtin_index)
9869 : : {
9870 : 1139229 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
9871 : :
9872 : 1139229 : if (!validate_arg (arg, REAL_TYPE))
9873 : : return NULL_TREE;
9874 : :
9875 : 1139229 : switch (builtin_index)
9876 : : {
9877 : 267037 : case BUILT_IN_ISINF:
9878 : 267037 : if (tree_expr_infinite_p (arg))
9879 : 0 : return omit_one_operand_loc (loc, type, integer_one_node, arg);
9880 : 267037 : if (!tree_expr_maybe_infinite_p (arg))
9881 : 121 : return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9882 : : return NULL_TREE;
9883 : :
9884 : 704 : case BUILT_IN_ISINF_SIGN:
9885 : 704 : {
9886 : : /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9887 : : /* In a boolean context, GCC will fold the inner COND_EXPR to
9888 : : 1. So e.g. "if (isinf_sign(x))" would be folded to just
9889 : : "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9890 : 704 : tree signbit_fn = builtin_decl_explicit (BUILT_IN_SIGNBIT);
9891 : 704 : tree isinf_fn = builtin_decl_explicit (BUILT_IN_ISINF);
9892 : 704 : tree tmp = NULL_TREE;
9893 : :
9894 : 704 : arg = builtin_save_expr (arg);
9895 : :
9896 : 704 : if (signbit_fn && isinf_fn)
9897 : : {
9898 : 704 : tree signbit_call = build_call_expr_loc (loc, signbit_fn, 1, arg);
9899 : 704 : tree isinf_call = build_call_expr_loc (loc, isinf_fn, 1, arg);
9900 : :
9901 : 704 : signbit_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9902 : : signbit_call, integer_zero_node);
9903 : 704 : isinf_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9904 : : isinf_call, integer_zero_node);
9905 : :
9906 : 704 : tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node, signbit_call,
9907 : : integer_minus_one_node, integer_one_node);
9908 : 704 : tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node,
9909 : : isinf_call, tmp,
9910 : : integer_zero_node);
9911 : : }
9912 : :
9913 : : return tmp;
9914 : : }
9915 : :
9916 : 576460 : case BUILT_IN_ISFINITE:
9917 : 576460 : if (tree_expr_finite_p (arg))
9918 : 224 : return omit_one_operand_loc (loc, type, integer_one_node, arg);
9919 : 576236 : if (tree_expr_nan_p (arg) || tree_expr_infinite_p (arg))
9920 : 0 : return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9921 : : return NULL_TREE;
9922 : :
9923 : 266649 : case BUILT_IN_ISNAN:
9924 : 266649 : if (tree_expr_nan_p (arg))
9925 : 0 : return omit_one_operand_loc (loc, type, integer_one_node, arg);
9926 : 266649 : if (!tree_expr_maybe_nan_p (arg))
9927 : 124 : return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9928 : : return NULL_TREE;
9929 : :
9930 : 28379 : case BUILT_IN_ISSIGNALING:
9931 : : /* Folding to true for REAL_CST is done in fold_const_call_ss.
9932 : : Don't use tree_expr_signaling_nan_p (arg) -> integer_one_node
9933 : : and !tree_expr_maybe_signaling_nan_p (arg) -> integer_zero_node
9934 : : here, so there is some possibility of __builtin_issignaling working
9935 : : without -fsignaling-nans. Especially when -fno-signaling-nans is
9936 : : the default. */
9937 : 28379 : if (!tree_expr_maybe_nan_p (arg))
9938 : 0 : return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9939 : : return NULL_TREE;
9940 : :
9941 : 0 : default:
9942 : 0 : gcc_unreachable ();
9943 : : }
9944 : : }
9945 : :
9946 : : /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9947 : : This builtin will generate code to return the appropriate floating
9948 : : point classification depending on the value of the floating point
9949 : : number passed in. The possible return values must be supplied as
9950 : : int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9951 : : FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9952 : : one floating point argument which is "type generic". */
9953 : :
9954 : : static tree
9955 : 114672 : fold_builtin_fpclassify (location_t loc, tree *args, int nargs)
9956 : : {
9957 : 114672 : tree fp_nan, fp_infinite, fp_normal, fp_subnormal, fp_zero,
9958 : : arg, type, res, tmp;
9959 : 114672 : machine_mode mode;
9960 : 114672 : REAL_VALUE_TYPE r;
9961 : 114672 : char buf[128];
9962 : :
9963 : : /* Verify the required arguments in the original call. */
9964 : 114672 : if (nargs != 6
9965 : 114672 : || !validate_arg (args[0], INTEGER_TYPE)
9966 : 114672 : || !validate_arg (args[1], INTEGER_TYPE)
9967 : 114672 : || !validate_arg (args[2], INTEGER_TYPE)
9968 : 114672 : || !validate_arg (args[3], INTEGER_TYPE)
9969 : 114672 : || !validate_arg (args[4], INTEGER_TYPE)
9970 : 229344 : || !validate_arg (args[5], REAL_TYPE))
9971 : : return NULL_TREE;
9972 : :
9973 : 114672 : fp_nan = args[0];
9974 : 114672 : fp_infinite = args[1];
9975 : 114672 : fp_normal = args[2];
9976 : 114672 : fp_subnormal = args[3];
9977 : 114672 : fp_zero = args[4];
9978 : 114672 : arg = args[5];
9979 : 114672 : type = TREE_TYPE (arg);
9980 : 114672 : mode = TYPE_MODE (type);
9981 : 114672 : arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
9982 : :
9983 : : /* fpclassify(x) ->
9984 : : isnan(x) ? FP_NAN :
9985 : : (fabs(x) == Inf ? FP_INFINITE :
9986 : : (fabs(x) >= DBL_MIN ? FP_NORMAL :
9987 : : (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9988 : :
9989 : 114672 : tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
9990 : : build_real (type, dconst0));
9991 : 114672 : res = fold_build3_loc (loc, COND_EXPR, integer_type_node,
9992 : : tmp, fp_zero, fp_subnormal);
9993 : :
9994 : 114672 : if (DECIMAL_FLOAT_MODE_P (mode))
9995 : 3 : sprintf (buf, "1E%d", REAL_MODE_FORMAT (mode)->emin - 1);
9996 : : else
9997 : 114669 : sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
9998 : 114672 : real_from_string3 (&r, buf, mode);
9999 : 114672 : tmp = fold_build2_loc (loc, GE_EXPR, integer_type_node,
10000 : : arg, build_real (type, r));
10001 : 114672 : res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
10002 : : fp_normal, res);
10003 : :
10004 : 114672 : if (tree_expr_maybe_infinite_p (arg))
10005 : : {
10006 : 114584 : tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
10007 : : build_real (type, dconstinf));
10008 : 114584 : res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
10009 : : fp_infinite, res);
10010 : : }
10011 : :
10012 : 114672 : if (tree_expr_maybe_nan_p (arg))
10013 : : {
10014 : 114582 : tmp = fold_build2_loc (loc, ORDERED_EXPR, integer_type_node, arg, arg);
10015 : 114582 : res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
10016 : : res, fp_nan);
10017 : : }
10018 : :
10019 : : return res;
10020 : : }
10021 : :
10022 : : /* Fold a call to an unordered comparison function such as
10023 : : __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
10024 : : being called and ARG0 and ARG1 are the arguments for the call.
10025 : : UNORDERED_CODE and ORDERED_CODE are comparison codes that give
10026 : : the opposite of the desired result. UNORDERED_CODE is used
10027 : : for modes that can hold NaNs and ORDERED_CODE is used for
10028 : : the rest. */
10029 : :
10030 : : static tree
10031 : 2954876 : fold_builtin_unordered_cmp (location_t loc, tree fndecl, tree arg0, tree arg1,
10032 : : enum tree_code unordered_code,
10033 : : enum tree_code ordered_code)
10034 : : {
10035 : 2954876 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
10036 : 2954876 : enum tree_code code;
10037 : 2954876 : tree type0, type1;
10038 : 2954876 : enum tree_code code0, code1;
10039 : 2954876 : tree cmp_type = NULL_TREE;
10040 : :
10041 : 2954876 : type0 = TREE_TYPE (arg0);
10042 : 2954876 : type1 = TREE_TYPE (arg1);
10043 : :
10044 : 2954876 : code0 = TREE_CODE (type0);
10045 : 2954876 : code1 = TREE_CODE (type1);
10046 : :
10047 : 2954876 : if (code0 == REAL_TYPE && code1 == REAL_TYPE)
10048 : : /* Choose the wider of two real types. */
10049 : 2954696 : cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
10050 : 2954696 : ? type0 : type1;
10051 : 180 : else if (code0 == REAL_TYPE
10052 : 91 : && (code1 == INTEGER_TYPE || code1 == BITINT_TYPE))
10053 : : cmp_type = type0;
10054 : 89 : else if ((code0 == INTEGER_TYPE || code0 == BITINT_TYPE)
10055 : 89 : && code1 == REAL_TYPE)
10056 : 135 : cmp_type = type1;
10057 : :
10058 : 2954876 : arg0 = fold_convert_loc (loc, cmp_type, arg0);
10059 : 2954876 : arg1 = fold_convert_loc (loc, cmp_type, arg1);
10060 : :
10061 : 2954876 : if (unordered_code == UNORDERED_EXPR)
10062 : : {
10063 : 264645 : if (tree_expr_nan_p (arg0) || tree_expr_nan_p (arg1))
10064 : 16 : return omit_two_operands_loc (loc, type, integer_one_node, arg0, arg1);
10065 : 264629 : if (!tree_expr_maybe_nan_p (arg0) && !tree_expr_maybe_nan_p (arg1))
10066 : 141 : return omit_two_operands_loc (loc, type, integer_zero_node, arg0, arg1);
10067 : 264488 : return fold_build2_loc (loc, UNORDERED_EXPR, type, arg0, arg1);
10068 : : }
10069 : :
10070 : 2693082 : code = (tree_expr_maybe_nan_p (arg0) || tree_expr_maybe_nan_p (arg1))
10071 : 2690231 : ? unordered_code : ordered_code;
10072 : 2690231 : return fold_build1_loc (loc, TRUTH_NOT_EXPR, type,
10073 : 2690231 : fold_build2_loc (loc, code, type, arg0, arg1));
10074 : : }
10075 : :
10076 : : /* Fold a call to __builtin_iseqsig(). ARG0 and ARG1 are the arguments.
10077 : : After choosing the wider floating-point type for the comparison,
10078 : : the code is folded to:
10079 : : SAVE_EXPR<ARG0> >= SAVE_EXPR<ARG1> && SAVE_EXPR<ARG0> <= SAVE_EXPR<ARG1> */
10080 : :
10081 : : static tree
10082 : 702 : fold_builtin_iseqsig (location_t loc, tree arg0, tree arg1)
10083 : : {
10084 : 702 : tree type0, type1;
10085 : 702 : enum tree_code code0, code1;
10086 : 702 : tree cmp1, cmp2, cmp_type = NULL_TREE;
10087 : :
10088 : 702 : type0 = TREE_TYPE (arg0);
10089 : 702 : type1 = TREE_TYPE (arg1);
10090 : :
10091 : 702 : code0 = TREE_CODE (type0);
10092 : 702 : code1 = TREE_CODE (type1);
10093 : :
10094 : 702 : if (code0 == REAL_TYPE && code1 == REAL_TYPE)
10095 : : /* Choose the wider of two real types. */
10096 : 690 : cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
10097 : 690 : ? type0 : type1;
10098 : 12 : else if (code0 == REAL_TYPE
10099 : 6 : && (code1 == INTEGER_TYPE || code1 == BITINT_TYPE))
10100 : : cmp_type = type0;
10101 : 6 : else if ((code0 == INTEGER_TYPE || code0 == BITINT_TYPE)
10102 : 6 : && code1 == REAL_TYPE)
10103 : 6 : cmp_type = type1;
10104 : :
10105 : 702 : arg0 = builtin_save_expr (fold_convert_loc (loc, cmp_type, arg0));
10106 : 702 : arg1 = builtin_save_expr (fold_convert_loc (loc, cmp_type, arg1));
10107 : :
10108 : 702 : cmp1 = fold_build2_loc (loc, GE_EXPR, integer_type_node, arg0, arg1);
10109 : 702 : cmp2 = fold_build2_loc (loc, LE_EXPR, integer_type_node, arg0, arg1);
10110 : :
10111 : 702 : return fold_build2_loc (loc, TRUTH_AND_EXPR, integer_type_node, cmp1, cmp2);
10112 : : }
10113 : :
10114 : : /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
10115 : : arithmetics if it can never overflow, or into internal functions that
10116 : : return both result of arithmetics and overflowed boolean flag in
10117 : : a complex integer result, or some other check for overflow.
10118 : : Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
10119 : : checking part of that. */
10120 : :
10121 : : static tree
10122 : 183991 : fold_builtin_arith_overflow (location_t loc, enum built_in_function fcode,
10123 : : tree arg0, tree arg1, tree arg2)
10124 : : {
10125 : 183991 : enum internal_fn ifn = IFN_LAST;
10126 : : /* The code of the expression corresponding to the built-in. */
10127 : 183991 : enum tree_code opcode = ERROR_MARK;
10128 : 183991 : bool ovf_only = false;
10129 : :
10130 : 183991 : switch (fcode)
10131 : : {
10132 : : case BUILT_IN_ADD_OVERFLOW_P:
10133 : : ovf_only = true;
10134 : : /* FALLTHRU */
10135 : : case BUILT_IN_ADD_OVERFLOW:
10136 : : case BUILT_IN_SADD_OVERFLOW:
10137 : : case BUILT_IN_SADDL_OVERFLOW:
10138 : : case BUILT_IN_SADDLL_OVERFLOW:
10139 : : case BUILT_IN_UADD_OVERFLOW:
10140 : : case BUILT_IN_UADDL_OVERFLOW:
10141 : : case BUILT_IN_UADDLL_OVERFLOW:
10142 : : opcode = PLUS_EXPR;
10143 : : ifn = IFN_ADD_OVERFLOW;
10144 : : break;
10145 : 15577 : case BUILT_IN_SUB_OVERFLOW_P:
10146 : 15577 : ovf_only = true;
10147 : : /* FALLTHRU */
10148 : 37201 : case BUILT_IN_SUB_OVERFLOW:
10149 : 37201 : case BUILT_IN_SSUB_OVERFLOW:
10150 : 37201 : case BUILT_IN_SSUBL_OVERFLOW:
10151 : 37201 : case BUILT_IN_SSUBLL_OVERFLOW:
10152 : 37201 : case BUILT_IN_USUB_OVERFLOW:
10153 : 37201 : case BUILT_IN_USUBL_OVERFLOW:
10154 : 37201 : case BUILT_IN_USUBLL_OVERFLOW:
10155 : 37201 : opcode = MINUS_EXPR;
10156 : 37201 : ifn = IFN_SUB_OVERFLOW;
10157 : 37201 : break;
10158 : 15857 : case BUILT_IN_MUL_OVERFLOW_P:
10159 : 15857 : ovf_only = true;
10160 : : /* FALLTHRU */
10161 : 114802 : case BUILT_IN_MUL_OVERFLOW:
10162 : 114802 : case BUILT_IN_SMUL_OVERFLOW:
10163 : 114802 : case BUILT_IN_SMULL_OVERFLOW:
10164 : 114802 : case BUILT_IN_SMULLL_OVERFLOW:
10165 : 114802 : case BUILT_IN_UMUL_OVERFLOW:
10166 : 114802 : case BUILT_IN_UMULL_OVERFLOW:
10167 : 114802 : case BUILT_IN_UMULLL_OVERFLOW:
10168 : 114802 : opcode = MULT_EXPR;
10169 : 114802 : ifn = IFN_MUL_OVERFLOW;
10170 : 114802 : break;
10171 : 0 : default:
10172 : 0 : gcc_unreachable ();
10173 : : }
10174 : :
10175 : : /* For the "generic" overloads, the first two arguments can have different
10176 : : types and the last argument determines the target type to use to check
10177 : : for overflow. The arguments of the other overloads all have the same
10178 : : type. */
10179 : 183991 : tree type = ovf_only ? TREE_TYPE (arg2) : TREE_TYPE (TREE_TYPE (arg2));
10180 : :
10181 : : /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
10182 : : arguments are constant, attempt to fold the built-in call into a constant
10183 : : expression indicating whether or not it detected an overflow. */
10184 : 183991 : if (ovf_only
10185 : 43244 : && TREE_CODE (arg0) == INTEGER_CST
10186 : 13131 : && TREE_CODE (arg1) == INTEGER_CST)
10187 : : /* Perform the computation in the target type and check for overflow. */
10188 : 7347 : return omit_one_operand_loc (loc, boolean_type_node,
10189 : 7347 : arith_overflowed_p (opcode, type, arg0, arg1)
10190 : : ? boolean_true_node : boolean_false_node,
10191 : 7347 : arg2);
10192 : :
10193 : 176644 : tree intres, ovfres;
10194 : 176644 : if (TREE_CODE (arg0) == INTEGER_CST && TREE_CODE (arg1) == INTEGER_CST)
10195 : : {
10196 : 12380 : intres = fold_binary_loc (loc, opcode, type,
10197 : : fold_convert_loc (loc, type, arg0),
10198 : : fold_convert_loc (loc, type, arg1));
10199 : 12380 : if (TREE_OVERFLOW (intres))
10200 : 1586 : intres = drop_tree_overflow (intres);
10201 : 24760 : ovfres = (arith_overflowed_p (opcode, type, arg0, arg1)
10202 : 12380 : ? boolean_true_node : boolean_false_node);
10203 : : }
10204 : : else
10205 : : {
10206 : 164264 : tree ctype = build_complex_type (type);
10207 : 164264 : tree call = build_call_expr_internal_loc (loc, ifn, ctype, 2,
10208 : : arg0, arg1);
10209 : 164264 : tree tgt;
10210 : 164264 : if (ovf_only)
10211 : : {
10212 : : tgt = call;
10213 : 164264 : intres = NULL_TREE;
10214 : : }
10215 : : else
10216 : : {
10217 : : /* Force SAVE_EXPR even for calls which satisfy tree_invariant_p_1,
10218 : : as while the call itself is const, the REALPART_EXPR store is
10219 : : certainly not. And in any case, we want just one call,
10220 : : not multiple and trying to CSE them later. */
10221 : 128367 : TREE_SIDE_EFFECTS (call) = 1;
10222 : 128367 : tgt = save_expr (call);
10223 : : }
10224 : 164264 : intres = build1_loc (loc, REALPART_EXPR, type, tgt);
10225 : 164264 : ovfres = build1_loc (loc, IMAGPART_EXPR, type, tgt);
10226 : 164264 : ovfres = fold_convert_loc (loc, boolean_type_node, ovfres);
10227 : : }
10228 : :
10229 : 176644 : if (ovf_only)
10230 : 35897 : return omit_one_operand_loc (loc, boolean_type_node, ovfres, arg2);
10231 : :
10232 : 140747 : tree mem_arg2 = build_fold_indirect_ref_loc (loc, arg2);
10233 : 140747 : tree store
10234 : 140747 : = fold_build2_loc (loc, MODIFY_EXPR, void_type_node, mem_arg2, intres);
10235 : 140747 : return build2_loc (loc, COMPOUND_EXPR, boolean_type_node, store, ovfres);
10236 : : }
10237 : :
10238 : : /* Fold __builtin_{clz,ctz,clrsb,ffs,parity,popcount}g into corresponding
10239 : : internal function. */
10240 : :
10241 : : static tree
10242 : 232339 : fold_builtin_bit_query (location_t loc, enum built_in_function fcode,
10243 : : tree arg0, tree arg1)
10244 : : {
10245 : 232339 : enum internal_fn ifn;
10246 : 232339 : enum built_in_function fcodei, fcodel, fcodell;
10247 : 232339 : tree arg0_type = TREE_TYPE (arg0);
10248 : 232339 : tree cast_type = NULL_TREE;
10249 : 232339 : int addend = 0;
10250 : :
10251 : 232339 : switch (fcode)
10252 : : {
10253 : 164652 : case BUILT_IN_CLZG:
10254 : 164652 : if (arg1 && TREE_CODE (arg1) != INTEGER_CST)
10255 : : return NULL_TREE;
10256 : : ifn = IFN_CLZ;
10257 : : fcodei = BUILT_IN_CLZ;
10258 : : fcodel = BUILT_IN_CLZL;
10259 : : fcodell = BUILT_IN_CLZLL;
10260 : : break;
10261 : 48649 : case BUILT_IN_CTZG:
10262 : 48649 : if (arg1 && TREE_CODE (arg1) != INTEGER_CST)
10263 : : return NULL_TREE;
10264 : : ifn = IFN_CTZ;
10265 : : fcodei = BUILT_IN_CTZ;
10266 : : fcodel = BUILT_IN_CTZL;
10267 : : fcodell = BUILT_IN_CTZLL;
10268 : : break;
10269 : : case BUILT_IN_CLRSBG:
10270 : : ifn = IFN_CLRSB;
10271 : : fcodei = BUILT_IN_CLRSB;
10272 : : fcodel = BUILT_IN_CLRSBL;
10273 : : fcodell = BUILT_IN_CLRSBLL;
10274 : : break;
10275 : 83 : case BUILT_IN_FFSG:
10276 : 83 : ifn = IFN_FFS;
10277 : 83 : fcodei = BUILT_IN_FFS;
10278 : 83 : fcodel = BUILT_IN_FFSL;
10279 : 83 : fcodell = BUILT_IN_FFSLL;
10280 : 83 : break;
10281 : 76 : case BUILT_IN_PARITYG:
10282 : 76 : ifn = IFN_PARITY;
10283 : 76 : fcodei = BUILT_IN_PARITY;
10284 : 76 : fcodel = BUILT_IN_PARITYL;
10285 : 76 : fcodell = BUILT_IN_PARITYLL;
10286 : 76 : break;
10287 : 18798 : case BUILT_IN_POPCOUNTG:
10288 : 18798 : ifn = IFN_POPCOUNT;
10289 : 18798 : fcodei = BUILT_IN_POPCOUNT;
10290 : 18798 : fcodel = BUILT_IN_POPCOUNTL;
10291 : 18798 : fcodell = BUILT_IN_POPCOUNTLL;
10292 : 18798 : break;
10293 : 0 : default:
10294 : 0 : gcc_unreachable ();
10295 : : }
10296 : :
10297 : 232169 : if (TYPE_PRECISION (arg0_type)
10298 : 232169 : <= TYPE_PRECISION (long_long_unsigned_type_node))
10299 : : {
10300 : 200926 : if (TYPE_PRECISION (arg0_type) <= TYPE_PRECISION (unsigned_type_node))
10301 : :
10302 : 86408 : cast_type = (TYPE_UNSIGNED (arg0_type)
10303 : 86354 : ? unsigned_type_node : integer_type_node);
10304 : 114572 : else if (TYPE_PRECISION (arg0_type)
10305 : 114572 : <= TYPE_PRECISION (long_unsigned_type_node))
10306 : : {
10307 : 114593 : cast_type = (TYPE_UNSIGNED (arg0_type)
10308 : 114521 : ? long_unsigned_type_node : long_integer_type_node);
10309 : : fcodei = fcodel;
10310 : : }
10311 : : else
10312 : : {
10313 : 51 : cast_type = (TYPE_UNSIGNED (arg0_type)
10314 : 51 : ? long_long_unsigned_type_node
10315 : : : long_long_integer_type_node);
10316 : : fcodei = fcodell;
10317 : : }
10318 : : }
10319 : 62486 : else if (TYPE_PRECISION (arg0_type) <= MAX_FIXED_MODE_SIZE)
10320 : : {
10321 : 31143 : cast_type
10322 : 31143 : = build_nonstandard_integer_type (MAX_FIXED_MODE_SIZE,
10323 : 31143 : TYPE_UNSIGNED (arg0_type));
10324 : 31143 : gcc_assert (TYPE_PRECISION (cast_type)
10325 : : == 2 * TYPE_PRECISION (long_long_unsigned_type_node));
10326 : : fcodei = END_BUILTINS;
10327 : : }
10328 : : else
10329 : : fcodei = END_BUILTINS;
10330 : 232069 : if (cast_type)
10331 : : {
10332 : 232069 : switch (fcode)
10333 : : {
10334 : 164617 : case BUILT_IN_CLZG:
10335 : 164617 : case BUILT_IN_CLRSBG:
10336 : 164617 : addend = TYPE_PRECISION (arg0_type) - TYPE_PRECISION (cast_type);
10337 : 164617 : break;
10338 : : default:
10339 : : break;
10340 : : }
10341 : 232069 : arg0 = fold_convert (cast_type, arg0);
10342 : 232069 : arg0_type = cast_type;
10343 : : }
10344 : :
10345 : 232169 : if (arg1)
10346 : 150747 : arg1 = fold_convert (integer_type_node, arg1);
10347 : :
10348 : 232169 : tree arg2 = arg1;
10349 : 232169 : if (fcode == BUILT_IN_CLZG && addend)
10350 : : {
10351 : 7548 : if (arg1)
10352 : 7515 : arg0 = save_expr (arg0);
10353 : : arg2 = NULL_TREE;
10354 : : }
10355 : 232169 : tree call = NULL_TREE, tem;
10356 : 232169 : if (TYPE_PRECISION (arg0_type) == MAX_FIXED_MODE_SIZE
10357 : 31194 : && (TYPE_PRECISION (arg0_type)
10358 : 31194 : == 2 * TYPE_PRECISION (long_long_unsigned_type_node))
10359 : : /* If the target supports the optab, then don't do the expansion. */
10360 : 263312 : && !direct_internal_fn_supported_p (ifn, arg0_type, OPTIMIZE_FOR_BOTH))
10361 : : {
10362 : : /* __int128 expansions using up to 2 long long builtins. */
10363 : 31143 : arg0 = save_expr (arg0);
10364 : 31143 : tree type = (TYPE_UNSIGNED (arg0_type)
10365 : 31143 : ? long_long_unsigned_type_node
10366 : 31143 : : long_long_integer_type_node);
10367 : 62286 : tree hi = fold_build2 (RSHIFT_EXPR, arg0_type, arg0,
10368 : : build_int_cst (integer_type_node,
10369 : : MAX_FIXED_MODE_SIZE / 2));
10370 : 31143 : hi = fold_convert (type, hi);
10371 : 31143 : tree lo = fold_convert (type, arg0);
10372 : 31143 : switch (fcode)
10373 : : {
10374 : 31048 : case BUILT_IN_CLZG:
10375 : 31048 : call = fold_builtin_bit_query (loc, fcode, lo, NULL_TREE);
10376 : 62096 : call = fold_build2 (PLUS_EXPR, integer_type_node, call,
10377 : : build_int_cst (integer_type_node,
10378 : : MAX_FIXED_MODE_SIZE / 2));
10379 : 31048 : if (arg2)
10380 : 31035 : call = fold_build3 (COND_EXPR, integer_type_node,
10381 : : fold_build2 (NE_EXPR, boolean_type_node,
10382 : : lo, build_zero_cst (type)),
10383 : : call, arg2);
10384 : 31048 : call = fold_build3 (COND_EXPR, integer_type_node,
10385 : : fold_build2 (NE_EXPR, boolean_type_node,
10386 : : hi, build_zero_cst (type)),
10387 : : fold_builtin_bit_query (loc, fcode, hi,
10388 : : NULL_TREE),
10389 : : call);
10390 : 31048 : break;
10391 : 33 : case BUILT_IN_CTZG:
10392 : 33 : call = fold_builtin_bit_query (loc, fcode, hi, NULL_TREE);
10393 : 66 : call = fold_build2 (PLUS_EXPR, integer_type_node, call,
10394 : : build_int_cst (integer_type_node,
10395 : : MAX_FIXED_MODE_SIZE / 2));
10396 : 33 : if (arg2)
10397 : 24 : call = fold_build3 (COND_EXPR, integer_type_node,
10398 : : fold_build2 (NE_EXPR, boolean_type_node,
10399 : : hi, build_zero_cst (type)),
10400 : : call, arg2);
10401 : 33 : call = fold_build3 (COND_EXPR, integer_type_node,
10402 : : fold_build2 (NE_EXPR, boolean_type_node,
10403 : : lo, build_zero_cst (type)),
10404 : : fold_builtin_bit_query (loc, fcode, lo,
10405 : : NULL_TREE),
10406 : : call);
10407 : 33 : break;
10408 : 9 : case BUILT_IN_CLRSBG:
10409 : 9 : tem = fold_builtin_bit_query (loc, fcode, lo, NULL_TREE);
10410 : 18 : tem = fold_build2 (PLUS_EXPR, integer_type_node, tem,
10411 : : build_int_cst (integer_type_node,
10412 : : MAX_FIXED_MODE_SIZE / 2));
10413 : 18 : tem = fold_build3 (COND_EXPR, integer_type_node,
10414 : : fold_build2 (LT_EXPR, boolean_type_node,
10415 : : fold_build2 (BIT_XOR_EXPR, type,
10416 : : lo, hi),
10417 : : build_zero_cst (type)),
10418 : : build_int_cst (integer_type_node,
10419 : : MAX_FIXED_MODE_SIZE / 2 - 1),
10420 : : tem);
10421 : 9 : call = fold_builtin_bit_query (loc, fcode, hi, NULL_TREE);
10422 : 9 : call = save_expr (call);
10423 : 18 : call = fold_build3 (COND_EXPR, integer_type_node,
10424 : : fold_build2 (NE_EXPR, boolean_type_node,
10425 : : call,
10426 : : build_int_cst (integer_type_node,
10427 : : MAX_FIXED_MODE_SIZE
10428 : : / 2 - 1)),
10429 : : call, tem);
10430 : 9 : break;
10431 : 9 : case BUILT_IN_FFSG:
10432 : 9 : call = fold_builtin_bit_query (loc, fcode, hi, NULL_TREE);
10433 : 18 : call = fold_build2 (PLUS_EXPR, integer_type_node, call,
10434 : : build_int_cst (integer_type_node,
10435 : : MAX_FIXED_MODE_SIZE / 2));
10436 : 9 : call = fold_build3 (COND_EXPR, integer_type_node,
10437 : : fold_build2 (NE_EXPR, boolean_type_node,
10438 : : hi, build_zero_cst (type)),
10439 : : call, integer_zero_node);
10440 : 9 : call = fold_build3 (COND_EXPR, integer_type_node,
10441 : : fold_build2 (NE_EXPR, boolean_type_node,
10442 : : lo, build_zero_cst (type)),
10443 : : fold_builtin_bit_query (loc, fcode, lo,
10444 : : NULL_TREE),
10445 : : call);
10446 : 9 : break;
10447 : 9 : case BUILT_IN_PARITYG:
10448 : 9 : call = fold_builtin_bit_query (loc, fcode,
10449 : : fold_build2 (BIT_XOR_EXPR, type,
10450 : : lo, hi), NULL_TREE);
10451 : 9 : break;
10452 : 35 : case BUILT_IN_POPCOUNTG:
10453 : 35 : call = fold_build2 (PLUS_EXPR, integer_type_node,
10454 : : fold_builtin_bit_query (loc, fcode, hi,
10455 : : NULL_TREE),
10456 : : fold_builtin_bit_query (loc, fcode, lo,
10457 : : NULL_TREE));
10458 : 35 : break;
10459 : 0 : default:
10460 : 0 : gcc_unreachable ();
10461 : : }
10462 : : }
10463 : : else
10464 : : {
10465 : : /* Only keep second argument to IFN_CLZ/IFN_CTZ if it is the
10466 : : value defined at zero during GIMPLE, or for large/huge _BitInt
10467 : : (which are then lowered during bitint lowering). */
10468 : 201026 : if (arg2 && TREE_CODE (TREE_TYPE (arg0)) != BITINT_TYPE)
10469 : : {
10470 : 112155 : int val;
10471 : 112155 : if (fcode == BUILT_IN_CLZG)
10472 : : {
10473 : 63799 : if (CLZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (arg0_type),
10474 : : val) != 2
10475 : 63811 : || wi::to_widest (arg2) != val)
10476 : 63787 : arg2 = NULL_TREE;
10477 : : }
10478 : 48356 : else if (CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (arg0_type),
10479 : : val) != 2
10480 : 48356 : || wi::to_widest (arg2) != val)
10481 : 48356 : arg2 = NULL_TREE;
10482 : 112155 : if (!direct_internal_fn_supported_p (ifn, arg0_type,
10483 : : OPTIMIZE_FOR_BOTH))
10484 : : arg2 = NULL_TREE;
10485 : 112107 : if (arg2 == NULL_TREE)
10486 : 112143 : arg0 = save_expr (arg0);
10487 : : }
10488 : 201026 : if (fcodei == END_BUILTINS || arg2)
10489 : 194 : call = build_call_expr_internal_loc (loc, ifn, integer_type_node,
10490 : : arg2 ? 2 : 1, arg0, arg2);
10491 : : else
10492 : 200914 : call = build_call_expr_loc (loc, builtin_decl_explicit (fcodei), 1,
10493 : : arg0);
10494 : : }
10495 : 232169 : if (addend)
10496 : 7566 : call = fold_build2 (PLUS_EXPR, integer_type_node, call,
10497 : : build_int_cst (integer_type_node, addend));
10498 : 232169 : if (arg1 && arg2 == NULL_TREE)
10499 : 119658 : call = fold_build3 (COND_EXPR, integer_type_node,
10500 : : fold_build2 (NE_EXPR, boolean_type_node,
10501 : : arg0, build_zero_cst (arg0_type)),
10502 : : call, arg1);
10503 : :
10504 : : return call;
10505 : : }
10506 : :
10507 : : /* Fold __builtin_{add,sub}c{,l,ll} into pair of internal functions
10508 : : that return both result of arithmetics and overflowed boolean
10509 : : flag in a complex integer result. */
10510 : :
10511 : : static tree
10512 : 54 : fold_builtin_addc_subc (location_t loc, enum built_in_function fcode,
10513 : : tree *args)
10514 : : {
10515 : 54 : enum internal_fn ifn;
10516 : :
10517 : 54 : switch (fcode)
10518 : : {
10519 : : case BUILT_IN_ADDC:
10520 : : case BUILT_IN_ADDCL:
10521 : : case BUILT_IN_ADDCLL:
10522 : : ifn = IFN_ADD_OVERFLOW;
10523 : : break;
10524 : 28 : case BUILT_IN_SUBC:
10525 : 28 : case BUILT_IN_SUBCL:
10526 : 28 : case BUILT_IN_SUBCLL:
10527 : 28 : ifn = IFN_SUB_OVERFLOW;
10528 : 28 : break;
10529 : 0 : default:
10530 : 0 : gcc_unreachable ();
10531 : : }
10532 : :
10533 : 54 : tree type = TREE_TYPE (args[0]);
10534 : 54 : tree ctype = build_complex_type (type);
10535 : 54 : tree call = build_call_expr_internal_loc (loc, ifn, ctype, 2,
10536 : : args[0], args[1]);
10537 : : /* Force SAVE_EXPR even for calls which satisfy tree_invariant_p_1,
10538 : : as while the call itself is const, the REALPART_EXPR store is
10539 : : certainly not. And in any case, we want just one call,
10540 : : not multiple and trying to CSE them later. */
10541 : 54 : TREE_SIDE_EFFECTS (call) = 1;
10542 : 54 : tree tgt = save_expr (call);
10543 : 54 : tree intres = build1_loc (loc, REALPART_EXPR, type, tgt);
10544 : 54 : tree ovfres = build1_loc (loc, IMAGPART_EXPR, type, tgt);
10545 : 54 : call = build_call_expr_internal_loc (loc, ifn, ctype, 2,
10546 : : intres, args[2]);
10547 : 54 : TREE_SIDE_EFFECTS (call) = 1;
10548 : 54 : tgt = save_expr (call);
10549 : 54 : intres = build1_loc (loc, REALPART_EXPR, type, tgt);
10550 : 54 : tree ovfres2 = build1_loc (loc, IMAGPART_EXPR, type, tgt);
10551 : 54 : ovfres = build2_loc (loc, BIT_IOR_EXPR, type, ovfres, ovfres2);
10552 : 54 : tree mem_arg3 = build_fold_indirect_ref_loc (loc, args[3]);
10553 : 54 : tree store
10554 : 54 : = fold_build2_loc (loc, MODIFY_EXPR, void_type_node, mem_arg3, ovfres);
10555 : 54 : return build2_loc (loc, COMPOUND_EXPR, type, store, intres);
10556 : : }
10557 : :
10558 : : /* Fold a call to __builtin_FILE to a constant string. */
10559 : :
10560 : : static inline tree
10561 : 5848 : fold_builtin_FILE (location_t loc)
10562 : : {
10563 : 5848 : if (const char *fname = LOCATION_FILE (loc))
10564 : : {
10565 : : /* The documentation says this builtin is equivalent to the preprocessor
10566 : : __FILE__ macro so it appears appropriate to use the same file prefix
10567 : : mappings. */
10568 : 5848 : fname = remap_macro_filename (fname);
10569 : 5848 : return build_string_literal (fname);
10570 : : }
10571 : :
10572 : 0 : return build_string_literal ("");
10573 : : }
10574 : :
10575 : : /* Fold a call to __builtin_FUNCTION to a constant string. */
10576 : :
10577 : : static inline tree
10578 : 68 : fold_builtin_FUNCTION ()
10579 : : {
10580 : 68 : const char *name = "";
10581 : :
10582 : 68 : if (current_function_decl)
10583 : 43 : name = lang_hooks.decl_printable_name (current_function_decl, 0);
10584 : :
10585 : 68 : return build_string_literal (name);
10586 : : }
10587 : :
10588 : : /* Fold a call to __builtin_LINE to an integer constant. */
10589 : :
10590 : : static inline tree
10591 : 11701 : fold_builtin_LINE (location_t loc, tree type)
10592 : : {
10593 : 11701 : return build_int_cst (type, LOCATION_LINE (loc));
10594 : : }
10595 : :
10596 : : /* Fold a call to built-in function FNDECL with 0 arguments.
10597 : : This function returns NULL_TREE if no simplification was possible. */
10598 : :
10599 : : static tree
10600 : 22418125 : fold_builtin_0 (location_t loc, tree fndecl)
10601 : : {
10602 : 22418125 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
10603 : 22418125 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10604 : 22418125 : switch (fcode)
10605 : : {
10606 : 5848 : case BUILT_IN_FILE:
10607 : 5848 : return fold_builtin_FILE (loc);
10608 : :
10609 : 68 : case BUILT_IN_FUNCTION:
10610 : 68 : return fold_builtin_FUNCTION ();
10611 : :
10612 : 11701 : case BUILT_IN_LINE:
10613 : 11701 : return fold_builtin_LINE (loc, type);
10614 : :
10615 : 35082 : CASE_FLT_FN (BUILT_IN_INF):
10616 : 35082 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_INF):
10617 : 35082 : case BUILT_IN_INFD32:
10618 : 35082 : case BUILT_IN_INFD64:
10619 : 35082 : case BUILT_IN_INFD128:
10620 : 35082 : case BUILT_IN_INFD64X:
10621 : 35082 : return fold_builtin_inf (loc, type, true);
10622 : :
10623 : 193865 : CASE_FLT_FN (BUILT_IN_HUGE_VAL):
10624 : 193865 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_HUGE_VAL):
10625 : 193865 : return fold_builtin_inf (loc, type, false);
10626 : :
10627 : 0 : case BUILT_IN_CLASSIFY_TYPE:
10628 : 0 : return fold_builtin_classify_type (NULL_TREE);
10629 : :
10630 : 17212019 : case BUILT_IN_UNREACHABLE:
10631 : : /* Rewrite any explicit calls to __builtin_unreachable. */
10632 : 17212019 : if (sanitize_flags_p (SANITIZE_UNREACHABLE))
10633 : 115 : return build_builtin_unreachable (loc);
10634 : : break;
10635 : :
10636 : : default:
10637 : : break;
10638 : : }
10639 : : return NULL_TREE;
10640 : : }
10641 : :
10642 : : /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
10643 : : This function returns NULL_TREE if no simplification was possible. */
10644 : :
10645 : : static tree
10646 : 15789047 : fold_builtin_1 (location_t loc, tree expr, tree fndecl, tree arg0)
10647 : : {
10648 : 15789047 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
10649 : 15789047 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10650 : :
10651 : 15789047 : if (error_operand_p (arg0))
10652 : : return NULL_TREE;
10653 : :
10654 : 15789047 : if (tree ret = fold_const_call (as_combined_fn (fcode), type, arg0))
10655 : : return ret;
10656 : :
10657 : 15299220 : switch (fcode)
10658 : : {
10659 : 754349 : case BUILT_IN_CONSTANT_P:
10660 : 754349 : {
10661 : 754349 : tree val = fold_builtin_constant_p (arg0);
10662 : :
10663 : : /* Gimplification will pull the CALL_EXPR for the builtin out of
10664 : : an if condition. When not optimizing, we'll not CSE it back.
10665 : : To avoid link error types of regressions, return false now. */
10666 : 754349 : if (!val && !optimize)
10667 : 1178 : val = integer_zero_node;
10668 : :
10669 : : return val;
10670 : : }
10671 : :
10672 : 2146 : case BUILT_IN_CLASSIFY_TYPE:
10673 : 2146 : return fold_builtin_classify_type (arg0);
10674 : :
10675 : 414671 : case BUILT_IN_STRLEN:
10676 : 414671 : return fold_builtin_strlen (loc, expr, type, arg0);
10677 : :
10678 : 360308 : CASE_FLT_FN (BUILT_IN_FABS):
10679 : 360308 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FABS):
10680 : 360308 : case BUILT_IN_FABSD32:
10681 : 360308 : case BUILT_IN_FABSD64:
10682 : 360308 : case BUILT_IN_FABSD128:
10683 : 360308 : case BUILT_IN_FABSD64X:
10684 : 360308 : return fold_builtin_fabs (loc, arg0, type);
10685 : :
10686 : 93683 : case BUILT_IN_ABS:
10687 : 93683 : case BUILT_IN_LABS:
10688 : 93683 : case BUILT_IN_LLABS:
10689 : 93683 : case BUILT_IN_IMAXABS:
10690 : 93683 : case BUILT_IN_UABS:
10691 : 93683 : case BUILT_IN_ULABS:
10692 : 93683 : case BUILT_IN_ULLABS:
10693 : 93683 : case BUILT_IN_UMAXABS:
10694 : 93683 : return fold_builtin_abs (loc, arg0, type);
10695 : :
10696 : 24501 : CASE_FLT_FN (BUILT_IN_CONJ):
10697 : 24501 : if (validate_arg (arg0, COMPLEX_TYPE)
10698 : 24501 : && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10699 : 24501 : return fold_build1_loc (loc, CONJ_EXPR, type, arg0);
10700 : : break;
10701 : :
10702 : 764 : CASE_FLT_FN (BUILT_IN_CREAL):
10703 : 764 : if (validate_arg (arg0, COMPLEX_TYPE)
10704 : 764 : && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10705 : 764 : return non_lvalue_loc (loc, fold_build1_loc (loc, REALPART_EXPR, type, arg0));
10706 : : break;
10707 : :
10708 : 1884 : CASE_FLT_FN (BUILT_IN_CIMAG):
10709 : 1884 : if (validate_arg (arg0, COMPLEX_TYPE)
10710 : 1884 : && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10711 : 1884 : return non_lvalue_loc (loc, fold_build1_loc (loc, IMAGPART_EXPR, type, arg0));
10712 : : break;
10713 : :
10714 : 115677 : CASE_FLT_FN (BUILT_IN_CARG):
10715 : 115677 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_CARG):
10716 : 115677 : return fold_builtin_carg (loc, arg0, type);
10717 : :
10718 : 211 : case BUILT_IN_ISASCII:
10719 : 211 : return fold_builtin_isascii (loc, arg0);
10720 : :
10721 : 168 : case BUILT_IN_TOASCII:
10722 : 168 : return fold_builtin_toascii (loc, arg0);
10723 : :
10724 : 325 : case BUILT_IN_ISDIGIT:
10725 : 325 : return fold_builtin_isdigit (loc, arg0);
10726 : :
10727 : 576460 : CASE_FLT_FN (BUILT_IN_FINITE):
10728 : 576460 : case BUILT_IN_FINITED32:
10729 : 576460 : case BUILT_IN_FINITED64:
10730 : 576460 : case BUILT_IN_FINITED128:
10731 : 576460 : case BUILT_IN_ISFINITE:
10732 : 576460 : {
10733 : 576460 : tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISFINITE);
10734 : 576460 : if (ret)
10735 : : return ret;
10736 : 576236 : return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10737 : : }
10738 : :
10739 : 267037 : CASE_FLT_FN (BUILT_IN_ISINF):
10740 : 267037 : case BUILT_IN_ISINFD32:
10741 : 267037 : case BUILT_IN_ISINFD64:
10742 : 267037 : case BUILT_IN_ISINFD128:
10743 : 267037 : {
10744 : 267037 : tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF);
10745 : 267037 : if (ret)
10746 : : return ret;
10747 : 266916 : return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10748 : : }
10749 : :
10750 : 263598 : case BUILT_IN_ISNORMAL:
10751 : 263598 : return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10752 : :
10753 : 704 : case BUILT_IN_ISINF_SIGN:
10754 : 704 : return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF_SIGN);
10755 : :
10756 : 266649 : CASE_FLT_FN (BUILT_IN_ISNAN):
10757 : 266649 : case BUILT_IN_ISNAND32:
10758 : 266649 : case BUILT_IN_ISNAND64:
10759 : 266649 : case BUILT_IN_ISNAND128:
10760 : 266649 : {
10761 : 266649 : tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISNAN);
10762 : 266649 : if (ret)
10763 : : return ret;
10764 : 266525 : return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10765 : : }
10766 : :
10767 : 28379 : case BUILT_IN_ISSIGNALING:
10768 : 28379 : return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISSIGNALING);
10769 : :
10770 : 562949 : case BUILT_IN_FREE:
10771 : 562949 : if (integer_zerop (arg0))
10772 : 1049 : return build_empty_stmt (loc);
10773 : : break;
10774 : :
10775 : 19145 : case BUILT_IN_CLZG:
10776 : 19145 : case BUILT_IN_CTZG:
10777 : 19145 : case BUILT_IN_CLRSBG:
10778 : 19145 : case BUILT_IN_FFSG:
10779 : 19145 : case BUILT_IN_PARITYG:
10780 : 19145 : case BUILT_IN_POPCOUNTG:
10781 : 19145 : return fold_builtin_bit_query (loc, fcode, arg0, NULL_TREE);
10782 : :
10783 : : default:
10784 : : break;
10785 : : }
10786 : :
10787 : : return NULL_TREE;
10788 : :
10789 : : }
10790 : :
10791 : : /* Folds a call EXPR (which may be null) to built-in function FNDECL
10792 : : with 2 arguments, ARG0 and ARG1. This function returns NULL_TREE
10793 : : if no simplification was possible. */
10794 : :
10795 : : static tree
10796 : 16644957 : fold_builtin_2 (location_t loc, tree expr, tree fndecl, tree arg0, tree arg1)
10797 : : {
10798 : 16644957 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
10799 : 16644957 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10800 : :
10801 : 16644957 : if (error_operand_p (arg0)
10802 : 16644957 : || error_operand_p (arg1))
10803 : : return NULL_TREE;
10804 : :
10805 : 16644953 : if (tree ret = fold_const_call (as_combined_fn (fcode), type, arg0, arg1))
10806 : : return ret;
10807 : :
10808 : 16439595 : switch (fcode)
10809 : : {
10810 : 6504 : CASE_FLT_FN_REENT (BUILT_IN_GAMMA): /* GAMMA_R */
10811 : 6504 : CASE_FLT_FN_REENT (BUILT_IN_LGAMMA): /* LGAMMA_R */
10812 : 6504 : if (validate_arg (arg0, REAL_TYPE)
10813 : 6504 : && validate_arg (arg1, POINTER_TYPE))
10814 : 6504 : return do_mpfr_lgamma_r (arg0, arg1, type);
10815 : : break;
10816 : :
10817 : 114968 : CASE_FLT_FN (BUILT_IN_FREXP):
10818 : 114968 : return fold_builtin_frexp (loc, arg0, arg1, type);
10819 : :
10820 : 75480 : CASE_FLT_FN (BUILT_IN_MODF):
10821 : 75480 : return fold_builtin_modf (loc, arg0, arg1, type);
10822 : :
10823 : 2565 : case BUILT_IN_STRSPN:
10824 : 2565 : return fold_builtin_strspn (loc, expr, arg0, arg1, type);
10825 : :
10826 : 2465 : case BUILT_IN_STRCSPN:
10827 : 2465 : return fold_builtin_strcspn (loc, expr, arg0, arg1, type);
10828 : :
10829 : 82591 : case BUILT_IN_STRPBRK:
10830 : 82591 : return fold_builtin_strpbrk (loc, expr, arg0, arg1, type);
10831 : :
10832 : 4909990 : case BUILT_IN_EXPECT:
10833 : 4909990 : return fold_builtin_expect (loc, arg0, arg1, NULL_TREE, NULL_TREE);
10834 : :
10835 : 530684 : case BUILT_IN_ISGREATER:
10836 : 530684 : return fold_builtin_unordered_cmp (loc, fndecl,
10837 : 530684 : arg0, arg1, UNLE_EXPR, LE_EXPR);
10838 : 527301 : case BUILT_IN_ISGREATEREQUAL:
10839 : 527301 : return fold_builtin_unordered_cmp (loc, fndecl,
10840 : 527301 : arg0, arg1, UNLT_EXPR, LT_EXPR);
10841 : 265272 : case BUILT_IN_ISLESS:
10842 : 265272 : return fold_builtin_unordered_cmp (loc, fndecl,
10843 : 265272 : arg0, arg1, UNGE_EXPR, GE_EXPR);
10844 : 1103566 : case BUILT_IN_ISLESSEQUAL:
10845 : 1103566 : return fold_builtin_unordered_cmp (loc, fndecl,
10846 : 1103566 : arg0, arg1, UNGT_EXPR, GT_EXPR);
10847 : 263408 : case BUILT_IN_ISLESSGREATER:
10848 : 263408 : return fold_builtin_unordered_cmp (loc, fndecl,
10849 : 263408 : arg0, arg1, UNEQ_EXPR, EQ_EXPR);
10850 : 264645 : case BUILT_IN_ISUNORDERED:
10851 : 264645 : return fold_builtin_unordered_cmp (loc, fndecl,
10852 : : arg0, arg1, UNORDERED_EXPR,
10853 : 264645 : NOP_EXPR);
10854 : :
10855 : 702 : case BUILT_IN_ISEQSIG:
10856 : 702 : return fold_builtin_iseqsig (loc, arg0, arg1);
10857 : :
10858 : : /* We do the folding for va_start in the expander. */
10859 : : case BUILT_IN_VA_START:
10860 : : break;
10861 : :
10862 : 199933 : case BUILT_IN_OBJECT_SIZE:
10863 : 199933 : case BUILT_IN_DYNAMIC_OBJECT_SIZE:
10864 : 199933 : return fold_builtin_object_size (arg0, arg1, fcode);
10865 : :
10866 : 64565 : case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE:
10867 : 64565 : return fold_builtin_atomic_always_lock_free (arg0, arg1);
10868 : :
10869 : 39843 : case BUILT_IN_ATOMIC_IS_LOCK_FREE:
10870 : 39843 : return fold_builtin_atomic_is_lock_free (arg0, arg1);
10871 : :
10872 : 150917 : case BUILT_IN_CLZG:
10873 : 150917 : case BUILT_IN_CTZG:
10874 : 150917 : return fold_builtin_bit_query (loc, fcode, arg0, arg1);
10875 : :
10876 : : default:
10877 : : break;
10878 : : }
10879 : : return NULL_TREE;
10880 : : }
10881 : :
10882 : : /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
10883 : : and ARG2.
10884 : : This function returns NULL_TREE if no simplification was possible. */
10885 : :
10886 : : static tree
10887 : 6192893 : fold_builtin_3 (location_t loc, tree fndecl,
10888 : : tree arg0, tree arg1, tree arg2)
10889 : : {
10890 : 6192893 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
10891 : 6192893 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10892 : :
10893 : 6192893 : if (error_operand_p (arg0)
10894 : 6192893 : || error_operand_p (arg1)
10895 : 12385786 : || error_operand_p (arg2))
10896 : : return NULL_TREE;
10897 : :
10898 : 6192891 : if (tree ret = fold_const_call (as_combined_fn (fcode), type,
10899 : : arg0, arg1, arg2))
10900 : : return ret;
10901 : :
10902 : 6176123 : switch (fcode)
10903 : : {
10904 : :
10905 : 145 : CASE_FLT_FN (BUILT_IN_SINCOS):
10906 : 145 : return fold_builtin_sincos (loc, arg0, arg1, arg2);
10907 : :
10908 : 86669 : CASE_FLT_FN (BUILT_IN_REMQUO):
10909 : 86669 : if (validate_arg (arg0, REAL_TYPE)
10910 : 86669 : && validate_arg (arg1, REAL_TYPE)
10911 : 173338 : && validate_arg (arg2, POINTER_TYPE))
10912 : 86669 : return do_mpfr_remquo (arg0, arg1, arg2);
10913 : : break;
10914 : :
10915 : 2383576 : case BUILT_IN_MEMCMP:
10916 : 2383576 : return fold_builtin_memcmp (loc, arg0, arg1, arg2);
10917 : :
10918 : 491632 : case BUILT_IN_EXPECT:
10919 : 491632 : return fold_builtin_expect (loc, arg0, arg1, arg2, NULL_TREE);
10920 : :
10921 : 337 : case BUILT_IN_EXPECT_WITH_PROBABILITY:
10922 : 337 : return fold_builtin_expect (loc, arg0, arg1, NULL_TREE, arg2);
10923 : :
10924 : 183991 : case BUILT_IN_ADD_OVERFLOW:
10925 : 183991 : case BUILT_IN_SUB_OVERFLOW:
10926 : 183991 : case BUILT_IN_MUL_OVERFLOW:
10927 : 183991 : case BUILT_IN_ADD_OVERFLOW_P:
10928 : 183991 : case BUILT_IN_SUB_OVERFLOW_P:
10929 : 183991 : case BUILT_IN_MUL_OVERFLOW_P:
10930 : 183991 : case BUILT_IN_SADD_OVERFLOW:
10931 : 183991 : case BUILT_IN_SADDL_OVERFLOW:
10932 : 183991 : case BUILT_IN_SADDLL_OVERFLOW:
10933 : 183991 : case BUILT_IN_SSUB_OVERFLOW:
10934 : 183991 : case BUILT_IN_SSUBL_OVERFLOW:
10935 : 183991 : case BUILT_IN_SSUBLL_OVERFLOW:
10936 : 183991 : case BUILT_IN_SMUL_OVERFLOW:
10937 : 183991 : case BUILT_IN_SMULL_OVERFLOW:
10938 : 183991 : case BUILT_IN_SMULLL_OVERFLOW:
10939 : 183991 : case BUILT_IN_UADD_OVERFLOW:
10940 : 183991 : case BUILT_IN_UADDL_OVERFLOW:
10941 : 183991 : case BUILT_IN_UADDLL_OVERFLOW:
10942 : 183991 : case BUILT_IN_USUB_OVERFLOW:
10943 : 183991 : case BUILT_IN_USUBL_OVERFLOW:
10944 : 183991 : case BUILT_IN_USUBLL_OVERFLOW:
10945 : 183991 : case BUILT_IN_UMUL_OVERFLOW:
10946 : 183991 : case BUILT_IN_UMULL_OVERFLOW:
10947 : 183991 : case BUILT_IN_UMULLL_OVERFLOW:
10948 : 183991 : return fold_builtin_arith_overflow (loc, fcode, arg0, arg1, arg2);
10949 : :
10950 : : default:
10951 : : break;
10952 : : }
10953 : : return NULL_TREE;
10954 : : }
10955 : :
10956 : : /* Folds a call EXPR (which may be null) to built-in function FNDECL.
10957 : : ARGS is an array of NARGS arguments. IGNORE is true if the result
10958 : : of the function call is ignored. This function returns NULL_TREE
10959 : : if no simplification was possible. */
10960 : :
10961 : : static tree
10962 : 63549770 : fold_builtin_n (location_t loc, tree expr, tree fndecl, tree *args,
10963 : : int nargs, bool)
10964 : : {
10965 : 63549770 : tree ret = NULL_TREE;
10966 : :
10967 : 63549770 : switch (nargs)
10968 : : {
10969 : 22418125 : case 0:
10970 : 22418125 : ret = fold_builtin_0 (loc, fndecl);
10971 : 22418125 : break;
10972 : 15789047 : case 1:
10973 : 15789047 : ret = fold_builtin_1 (loc, expr, fndecl, args[0]);
10974 : 15789047 : break;
10975 : 16644957 : case 2:
10976 : 16644957 : ret = fold_builtin_2 (loc, expr, fndecl, args[0], args[1]);
10977 : 16644957 : break;
10978 : 6192893 : case 3:
10979 : 6192893 : ret = fold_builtin_3 (loc, fndecl, args[0], args[1], args[2]);
10980 : 6192893 : break;
10981 : 2504748 : default:
10982 : 2504748 : ret = fold_builtin_varargs (loc, fndecl, args, nargs);
10983 : 2504748 : break;
10984 : : }
10985 : 63549770 : if (ret)
10986 : : {
10987 : 6621489 : ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
10988 : 6621489 : SET_EXPR_LOCATION (ret, loc);
10989 : 6621489 : return ret;
10990 : : }
10991 : : return NULL_TREE;
10992 : : }
10993 : :
10994 : : /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
10995 : : list ARGS along with N new arguments in NEWARGS. SKIP is the number
10996 : : of arguments in ARGS to be omitted. OLDNARGS is the number of
10997 : : elements in ARGS. */
10998 : :
10999 : : static tree
11000 : 4 : rewrite_call_expr_valist (location_t loc, int oldnargs, tree *args,
11001 : : int skip, tree fndecl, int n, va_list newargs)
11002 : : {
11003 : 4 : int nargs = oldnargs - skip + n;
11004 : 4 : tree *buffer;
11005 : :
11006 : 4 : if (n > 0)
11007 : : {
11008 : 0 : int i, j;
11009 : :
11010 : 0 : buffer = XALLOCAVEC (tree, nargs);
11011 : 0 : for (i = 0; i < n; i++)
11012 : 0 : buffer[i] = va_arg (newargs, tree);
11013 : 0 : for (j = skip; j < oldnargs; j++, i++)
11014 : 0 : buffer[i] = args[j];
11015 : : }
11016 : : else
11017 : 4 : buffer = args + skip;
11018 : :
11019 : 4 : return build_call_expr_loc_array (loc, fndecl, nargs, buffer);
11020 : : }
11021 : :
11022 : : /* Return true if FNDECL shouldn't be folded right now.
11023 : : If a built-in function has an inline attribute always_inline
11024 : : wrapper, defer folding it after always_inline functions have
11025 : : been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
11026 : : might not be performed. */
11027 : :
11028 : : bool
11029 : 142102626 : avoid_folding_inline_builtin (tree fndecl)
11030 : : {
11031 : 142102626 : return (DECL_DECLARED_INLINE_P (fndecl)
11032 : 15237 : && DECL_DISREGARD_INLINE_LIMITS (fndecl)
11033 : 15195 : && cfun
11034 : 15195 : && !cfun->always_inline_functions_inlined
11035 : 142117821 : && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fndecl)));
11036 : : }
11037 : :
11038 : : /* A wrapper function for builtin folding that prevents warnings for
11039 : : "statement without effect" and the like, caused by removing the
11040 : : call node earlier than the warning is generated. */
11041 : :
11042 : : tree
11043 : 182461473 : fold_call_expr (location_t loc, tree exp, bool ignore)
11044 : : {
11045 : 182461473 : tree ret = NULL_TREE;
11046 : 182461473 : tree fndecl = get_callee_fndecl (exp);
11047 : 180704955 : if (fndecl && fndecl_built_in_p (fndecl)
11048 : : /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
11049 : : yet. Defer folding until we see all the arguments
11050 : : (after inlining). */
11051 : 239066061 : && !CALL_EXPR_VA_ARG_PACK (exp))
11052 : : {
11053 : 56604563 : int nargs = call_expr_nargs (exp);
11054 : :
11055 : : /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
11056 : : instead last argument is __builtin_va_arg_pack (). Defer folding
11057 : : even in that case, until arguments are finalized. */
11058 : 56604563 : if (nargs && TREE_CODE (CALL_EXPR_ARG (exp, nargs - 1)) == CALL_EXPR)
11059 : : {
11060 : 260330 : tree fndecl2 = get_callee_fndecl (CALL_EXPR_ARG (exp, nargs - 1));
11061 : 260330 : if (fndecl2 && fndecl_built_in_p (fndecl2, BUILT_IN_VA_ARG_PACK))
11062 : : return NULL_TREE;
11063 : : }
11064 : :
11065 : 56604499 : if (avoid_folding_inline_builtin (fndecl))
11066 : : return NULL_TREE;
11067 : :
11068 : 56600964 : if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
11069 : 67152576 : return targetm.fold_builtin (fndecl, call_expr_nargs (exp),
11070 : 67152576 : CALL_EXPR_ARGP (exp), ignore);
11071 : : else
11072 : : {
11073 : 23024676 : tree *args = CALL_EXPR_ARGP (exp);
11074 : 23024676 : ret = fold_builtin_n (loc, exp, fndecl, args, nargs, ignore);
11075 : 23024676 : if (ret)
11076 : : return ret;
11077 : : }
11078 : : }
11079 : : return NULL_TREE;
11080 : : }
11081 : :
11082 : : /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
11083 : : N arguments are passed in the array ARGARRAY. Return a folded
11084 : : expression or NULL_TREE if no simplification was possible. */
11085 : :
11086 : : tree
11087 : 64118869 : fold_builtin_call_array (location_t loc, tree,
11088 : : tree fn,
11089 : : int n,
11090 : : tree *argarray)
11091 : : {
11092 : 64118869 : if (TREE_CODE (fn) != ADDR_EXPR)
11093 : : return NULL_TREE;
11094 : :
11095 : 64118869 : tree fndecl = TREE_OPERAND (fn, 0);
11096 : 64118869 : if (TREE_CODE (fndecl) == FUNCTION_DECL
11097 : 64118869 : && fndecl_built_in_p (fndecl))
11098 : : {
11099 : : /* If last argument is __builtin_va_arg_pack (), arguments to this
11100 : : function are not finalized yet. Defer folding until they are. */
11101 : 63538504 : if (n && TREE_CODE (argarray[n - 1]) == CALL_EXPR)
11102 : : {
11103 : 107193 : tree fndecl2 = get_callee_fndecl (argarray[n - 1]);
11104 : 107193 : if (fndecl2 && fndecl_built_in_p (fndecl2, BUILT_IN_VA_ARG_PACK))
11105 : : return NULL_TREE;
11106 : : }
11107 : 63538477 : if (avoid_folding_inline_builtin (fndecl))
11108 : : return NULL_TREE;
11109 : 63538477 : if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
11110 : 32431355 : return targetm.fold_builtin (fndecl, n, argarray, false);
11111 : : else
11112 : 31107122 : return fold_builtin_n (loc, NULL_TREE, fndecl, argarray, n, false);
11113 : : }
11114 : :
11115 : : return NULL_TREE;
11116 : : }
11117 : :
11118 : : /* Construct a new CALL_EXPR using the tail of the argument list of EXP
11119 : : along with N new arguments specified as the "..." parameters. SKIP
11120 : : is the number of arguments in EXP to be omitted. This function is used
11121 : : to do varargs-to-varargs transformations. */
11122 : :
11123 : : static tree
11124 : 4 : rewrite_call_expr (location_t loc, tree exp, int skip, tree fndecl, int n, ...)
11125 : : {
11126 : 4 : va_list ap;
11127 : 4 : tree t;
11128 : :
11129 : 4 : va_start (ap, n);
11130 : 8 : t = rewrite_call_expr_valist (loc, call_expr_nargs (exp),
11131 : 4 : CALL_EXPR_ARGP (exp), skip, fndecl, n, ap);
11132 : 4 : va_end (ap);
11133 : :
11134 : 4 : return t;
11135 : : }
11136 : :
11137 : : /* Validate a single argument ARG against a tree code CODE representing
11138 : : a type. Return true when argument is valid. */
11139 : :
11140 : : static bool
11141 : 13793749 : validate_arg (const_tree arg, enum tree_code code)
11142 : : {
11143 : 13793749 : if (!arg)
11144 : : return false;
11145 : 13793726 : else if (code == POINTER_TYPE)
11146 : 6628953 : return POINTER_TYPE_P (TREE_TYPE (arg));
11147 : 7164773 : else if (code == INTEGER_TYPE)
11148 : 3636312 : return INTEGRAL_TYPE_P (TREE_TYPE (arg));
11149 : 3528461 : return code == TREE_CODE (TREE_TYPE (arg));
11150 : : }
11151 : :
11152 : : /* This function validates the types of a function call argument list
11153 : : against a specified list of tree_codes. If the last specifier is a 0,
11154 : : that represents an ellipses, otherwise the last specifier must be a
11155 : : VOID_TYPE.
11156 : :
11157 : : This is the GIMPLE version of validate_arglist. Eventually we want to
11158 : : completely convert builtins.cc to work from GIMPLEs and the tree based
11159 : : validate_arglist will then be removed. */
11160 : :
11161 : : bool
11162 : 93 : validate_gimple_arglist (const gcall *call, ...)
11163 : : {
11164 : 93 : enum tree_code code;
11165 : 93 : bool res = 0;
11166 : 93 : va_list ap;
11167 : 93 : const_tree arg;
11168 : 93 : size_t i;
11169 : :
11170 : 93 : va_start (ap, call);
11171 : 93 : i = 0;
11172 : :
11173 : 372 : do
11174 : : {
11175 : 372 : code = (enum tree_code) va_arg (ap, int);
11176 : 372 : switch (code)
11177 : : {
11178 : 0 : case 0:
11179 : : /* This signifies an ellipses, any further arguments are all ok. */
11180 : 0 : res = true;
11181 : 0 : goto end;
11182 : 93 : case VOID_TYPE:
11183 : : /* This signifies an endlink, if no arguments remain, return
11184 : : true, otherwise return false. */
11185 : 93 : res = (i == gimple_call_num_args (call));
11186 : 93 : goto end;
11187 : 279 : default:
11188 : : /* If no parameters remain or the parameter's code does not
11189 : : match the specified code, return false. Otherwise continue
11190 : : checking any remaining arguments. */
11191 : 279 : arg = gimple_call_arg (call, i++);
11192 : 279 : if (!validate_arg (arg, code))
11193 : 0 : goto end;
11194 : : break;
11195 : : }
11196 : : }
11197 : : while (1);
11198 : :
11199 : : /* We need gotos here since we can only have one VA_CLOSE in a
11200 : : function. */
11201 : 93 : end: ;
11202 : 93 : va_end (ap);
11203 : :
11204 : 93 : return res;
11205 : : }
11206 : :
11207 : : /* Default target-specific builtin expander that does nothing. */
11208 : :
11209 : : rtx
11210 : 0 : default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
11211 : : rtx target ATTRIBUTE_UNUSED,
11212 : : rtx subtarget ATTRIBUTE_UNUSED,
11213 : : machine_mode mode ATTRIBUTE_UNUSED,
11214 : : int ignore ATTRIBUTE_UNUSED)
11215 : : {
11216 : 0 : return NULL_RTX;
11217 : : }
11218 : :
11219 : : /* Returns true is EXP represents data that would potentially reside
11220 : : in a readonly section. */
11221 : :
11222 : : bool
11223 : 185121 : readonly_data_expr (tree exp)
11224 : : {
11225 : 185121 : STRIP_NOPS (exp);
11226 : :
11227 : 185121 : if (TREE_CODE (exp) != ADDR_EXPR)
11228 : : return false;
11229 : :
11230 : 23682 : exp = get_base_address (TREE_OPERAND (exp, 0));
11231 : 23682 : if (!exp)
11232 : : return false;
11233 : :
11234 : : /* Make sure we call decl_readonly_section only for trees it
11235 : : can handle (since it returns true for everything it doesn't
11236 : : understand). */
11237 : 23682 : if (TREE_CODE (exp) == STRING_CST
11238 : 5584 : || TREE_CODE (exp) == CONSTRUCTOR
11239 : 5584 : || (VAR_P (exp) && TREE_STATIC (exp)))
11240 : 20756 : return decl_readonly_section (exp, 0);
11241 : : else
11242 : : return false;
11243 : : }
11244 : :
11245 : : /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
11246 : : to the call, and TYPE is its return type.
11247 : :
11248 : : Return NULL_TREE if no simplification was possible, otherwise return the
11249 : : simplified form of the call as a tree.
11250 : :
11251 : : The simplified form may be a constant or other expression which
11252 : : computes the same value, but in a more efficient manner (including
11253 : : calls to other builtin functions).
11254 : :
11255 : : The call may contain arguments which need to be evaluated, but
11256 : : which are not useful to determine the result of the call. In
11257 : : this case we return a chain of COMPOUND_EXPRs. The LHS of each
11258 : : COMPOUND_EXPR will be an argument which must be evaluated.
11259 : : COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11260 : : COMPOUND_EXPR in the chain will contain the tree for the simplified
11261 : : form of the builtin function call. */
11262 : :
11263 : : static tree
11264 : 82591 : fold_builtin_strpbrk (location_t loc, tree, tree s1, tree s2, tree type)
11265 : : {
11266 : 82591 : if (!validate_arg (s1, POINTER_TYPE)
11267 : 82591 : || !validate_arg (s2, POINTER_TYPE))
11268 : : return NULL_TREE;
11269 : :
11270 : 82591 : tree fn;
11271 : 82591 : const char *p1, *p2;
11272 : :
11273 : 82591 : p2 = c_getstr (s2);
11274 : 82591 : if (p2 == NULL)
11275 : : return NULL_TREE;
11276 : :
11277 : 92 : p1 = c_getstr (s1);
11278 : 92 : if (p1 != NULL)
11279 : : {
11280 : 22 : const char *r = strpbrk (p1, p2);
11281 : 22 : tree tem;
11282 : :
11283 : 22 : if (r == NULL)
11284 : 0 : return build_int_cst (TREE_TYPE (s1), 0);
11285 : :
11286 : : /* Return an offset into the constant string argument. */
11287 : 22 : tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
11288 : 22 : return fold_convert_loc (loc, type, tem);
11289 : : }
11290 : :
11291 : 70 : if (p2[0] == '\0')
11292 : : /* strpbrk(x, "") == NULL.
11293 : : Evaluate and ignore s1 in case it had side-effects. */
11294 : 26 : return omit_one_operand_loc (loc, type, integer_zero_node, s1);
11295 : :
11296 : 44 : if (p2[1] != '\0')
11297 : : return NULL_TREE; /* Really call strpbrk. */
11298 : :
11299 : 82543 : fn = builtin_decl_implicit (BUILT_IN_STRCHR);
11300 : 41 : if (!fn)
11301 : : return NULL_TREE;
11302 : :
11303 : : /* New argument list transforming strpbrk(s1, s2) to
11304 : : strchr(s1, s2[0]). */
11305 : 41 : return build_call_expr_loc (loc, fn, 2, s1,
11306 : 41 : build_int_cst (integer_type_node, p2[0]));
11307 : : }
11308 : :
11309 : : /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
11310 : : to the call.
11311 : :
11312 : : Return NULL_TREE if no simplification was possible, otherwise return the
11313 : : simplified form of the call as a tree.
11314 : :
11315 : : The simplified form may be a constant or other expression which
11316 : : computes the same value, but in a more efficient manner (including
11317 : : calls to other builtin functions).
11318 : :
11319 : : The call may contain arguments which need to be evaluated, but
11320 : : which are not useful to determine the result of the call. In
11321 : : this case we return a chain of COMPOUND_EXPRs. The LHS of each
11322 : : COMPOUND_EXPR will be an argument which must be evaluated.
11323 : : COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11324 : : COMPOUND_EXPR in the chain will contain the tree for the simplified
11325 : : form of the builtin function call. */
11326 : :
11327 : : static tree
11328 : 2565 : fold_builtin_strspn (location_t loc, tree expr, tree s1, tree s2, tree type)
11329 : : {
11330 : 2565 : if (!validate_arg (s1, POINTER_TYPE)
11331 : 2565 : || !validate_arg (s2, POINTER_TYPE))
11332 : : return NULL_TREE;
11333 : :
11334 : 2565 : if (!check_nul_terminated_array (expr, s1)
11335 : 2565 : || !check_nul_terminated_array (expr, s2))
11336 : 58 : return NULL_TREE;
11337 : :
11338 : 2507 : const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11339 : :
11340 : : /* If either argument is "", return NULL_TREE. */
11341 : 2507 : if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
11342 : : /* Evaluate and ignore both arguments in case either one has
11343 : : side-effects. */
11344 : 147 : return omit_two_operands_loc (loc, type, size_zero_node, s1, s2);
11345 : : return NULL_TREE;
11346 : : }
11347 : :
11348 : : /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
11349 : : to the call.
11350 : :
11351 : : Return NULL_TREE if no simplification was possible, otherwise return the
11352 : : simplified form of the call as a tree.
11353 : :
11354 : : The simplified form may be a constant or other expression which
11355 : : computes the same value, but in a more efficient manner (including
11356 : : calls to other builtin functions).
11357 : :
11358 : : The call may contain arguments which need to be evaluated, but
11359 : : which are not useful to determine the result of the call. In
11360 : : this case we return a chain of COMPOUND_EXPRs. The LHS of each
11361 : : COMPOUND_EXPR will be an argument which must be evaluated.
11362 : : COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11363 : : COMPOUND_EXPR in the chain will contain the tree for the simplified
11364 : : form of the builtin function call. */
11365 : :
11366 : : static tree
11367 : 2465 : fold_builtin_strcspn (location_t loc, tree expr, tree s1, tree s2, tree type)
11368 : : {
11369 : 2465 : if (!validate_arg (s1, POINTER_TYPE)
11370 : 2465 : || !validate_arg (s2, POINTER_TYPE))
11371 : : return NULL_TREE;
11372 : :
11373 : 2465 : if (!check_nul_terminated_array (expr, s1)
11374 : 2465 : || !check_nul_terminated_array (expr, s2))
11375 : 58 : return NULL_TREE;
11376 : :
11377 : : /* If the first argument is "", return NULL_TREE. */
11378 : 2407 : const char *p1 = c_getstr (s1);
11379 : 2407 : if (p1 && *p1 == '\0')
11380 : : {
11381 : : /* Evaluate and ignore argument s2 in case it has
11382 : : side-effects. */
11383 : 65 : return omit_one_operand_loc (loc, type, size_zero_node, s2);
11384 : : }
11385 : :
11386 : : /* If the second argument is "", return __builtin_strlen(s1). */
11387 : 2342 : const char *p2 = c_getstr (s2);
11388 : 2342 : if (p2 && *p2 == '\0')
11389 : : {
11390 : 2400 : tree fn = builtin_decl_implicit (BUILT_IN_STRLEN);
11391 : :
11392 : : /* If the replacement _DECL isn't initialized, don't do the
11393 : : transformation. */
11394 : 81 : if (!fn)
11395 : : return NULL_TREE;
11396 : :
11397 : 81 : return fold_convert_loc (loc, type,
11398 : 81 : build_call_expr_loc (loc, fn, 1, s1));
11399 : : }
11400 : : return NULL_TREE;
11401 : : }
11402 : :
11403 : : /* Fold the next_arg or va_start call EXP. Returns true if there was an error
11404 : : produced. False otherwise. This is done so that we don't output the error
11405 : : or warning twice or three times. */
11406 : :
11407 : : bool
11408 : 41861 : fold_builtin_next_arg (tree exp, bool va_start_p)
11409 : : {
11410 : 41861 : tree fntype = TREE_TYPE (current_function_decl);
11411 : 41861 : int nargs = call_expr_nargs (exp);
11412 : 41861 : tree arg;
11413 : : /* There is good chance the current input_location points inside the
11414 : : definition of the va_start macro (perhaps on the token for
11415 : : builtin) in a system header, so warnings will not be emitted.
11416 : : Use the location in real source code. */
11417 : 41861 : location_t current_location =
11418 : 41861 : linemap_unwind_to_first_non_reserved_loc (line_table, input_location,
11419 : : NULL);
11420 : :
11421 : 41861 : if (!stdarg_p (fntype))
11422 : : {
11423 : 8 : error ("%<va_start%> used in function with fixed arguments");
11424 : 8 : return true;
11425 : : }
11426 : :
11427 : 41853 : if (va_start_p)
11428 : : {
11429 : 41703 : if (va_start_p && (nargs != 2))
11430 : : {
11431 : 0 : error ("wrong number of arguments to function %<va_start%>");
11432 : 0 : return true;
11433 : : }
11434 : 41703 : arg = CALL_EXPR_ARG (exp, 1);
11435 : : }
11436 : : /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
11437 : : when we checked the arguments and if needed issued a warning. */
11438 : : else
11439 : : {
11440 : 150 : if (nargs == 0)
11441 : : {
11442 : : /* Evidently an out of date version of <stdarg.h>; can't validate
11443 : : va_start's second argument, but can still work as intended. */
11444 : 0 : warning_at (current_location,
11445 : 0 : OPT_Wvarargs,
11446 : : "%<__builtin_next_arg%> called without an argument");
11447 : 0 : return true;
11448 : : }
11449 : 150 : else if (nargs > 1)
11450 : : {
11451 : 0 : error ("wrong number of arguments to function %<__builtin_next_arg%>");
11452 : 0 : return true;
11453 : : }
11454 : 150 : arg = CALL_EXPR_ARG (exp, 0);
11455 : : }
11456 : :
11457 : 41853 : if (TREE_CODE (arg) == SSA_NAME
11458 : 41853 : && SSA_NAME_VAR (arg))
11459 : : arg = SSA_NAME_VAR (arg);
11460 : :
11461 : : /* We destructively modify the call to be __builtin_va_start (ap, 0)
11462 : : or __builtin_next_arg (0) the first time we see it, after checking
11463 : : the arguments and if needed issuing a warning. */
11464 : 41853 : if (!integer_zerop (arg))
11465 : : {
11466 : 7013 : tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
11467 : :
11468 : : /* Strip off all nops for the sake of the comparison. This
11469 : : is not quite the same as STRIP_NOPS. It does more.
11470 : : We must also strip off INDIRECT_EXPR for C++ reference
11471 : : parameters. */
11472 : 14028 : while (CONVERT_EXPR_P (arg)
11473 : 14039 : || INDIRECT_REF_P (arg))
11474 : 11 : arg = TREE_OPERAND (arg, 0);
11475 : 7013 : if (arg != last_parm)
11476 : : {
11477 : : /* FIXME: Sometimes with the tree optimizers we can get the
11478 : : not the last argument even though the user used the last
11479 : : argument. We just warn and set the arg to be the last
11480 : : argument so that we will get wrong-code because of
11481 : : it. */
11482 : 11 : warning_at (current_location,
11483 : 11 : OPT_Wvarargs,
11484 : : "second parameter of %<va_start%> not last named argument");
11485 : : }
11486 : :
11487 : : /* Undefined by C99 7.15.1.4p4 (va_start):
11488 : : "If the parameter parmN is declared with the register storage
11489 : : class, with a function or array type, or with a type that is
11490 : : not compatible with the type that results after application of
11491 : : the default argument promotions, the behavior is undefined."
11492 : : */
11493 : 7002 : else if (DECL_REGISTER (arg))
11494 : : {
11495 : 11 : warning_at (current_location,
11496 : 11 : OPT_Wvarargs,
11497 : : "undefined behavior when second parameter of "
11498 : : "%<va_start%> is declared with %<register%> storage");
11499 : : }
11500 : :
11501 : : /* We want to verify the second parameter just once before the tree
11502 : : optimizers are run and then avoid keeping it in the tree,
11503 : : as otherwise we could warn even for correct code like:
11504 : : void foo (int i, ...)
11505 : : { va_list ap; i++; va_start (ap, i); va_end (ap); } */
11506 : 7013 : if (va_start_p)
11507 : 7011 : CALL_EXPR_ARG (exp, 1) = integer_zero_node;
11508 : : else
11509 : 2 : CALL_EXPR_ARG (exp, 0) = integer_zero_node;
11510 : : }
11511 : : return false;
11512 : : }
11513 : :
11514 : :
11515 : : /* Expand a call EXP to __builtin_object_size. */
11516 : :
11517 : : static rtx
11518 : 618 : expand_builtin_object_size (tree exp)
11519 : : {
11520 : 618 : tree ost;
11521 : 618 : int object_size_type;
11522 : 618 : tree fndecl = get_callee_fndecl (exp);
11523 : :
11524 : 618 : if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
11525 : : {
11526 : 0 : error ("first argument of %qD must be a pointer, second integer constant",
11527 : : fndecl);
11528 : 0 : expand_builtin_trap ();
11529 : 0 : return const0_rtx;
11530 : : }
11531 : :
11532 : 618 : ost = CALL_EXPR_ARG (exp, 1);
11533 : 618 : STRIP_NOPS (ost);
11534 : :
11535 : 618 : if (TREE_CODE (ost) != INTEGER_CST
11536 : 618 : || tree_int_cst_sgn (ost) < 0
11537 : 1236 : || compare_tree_int (ost, 3) > 0)
11538 : : {
11539 : 0 : error ("last argument of %qD is not integer constant between 0 and 3",
11540 : : fndecl);
11541 : 0 : expand_builtin_trap ();
11542 : 0 : return const0_rtx;
11543 : : }
11544 : :
11545 : 618 : object_size_type = tree_to_shwi (ost);
11546 : :
11547 : 618 : return object_size_type < 2 ? constm1_rtx : const0_rtx;
11548 : : }
11549 : :
11550 : : /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
11551 : : FCODE is the BUILT_IN_* to use.
11552 : : Return NULL_RTX if we failed; the caller should emit a normal call,
11553 : : otherwise try to get the result in TARGET, if convenient (and in
11554 : : mode MODE if that's convenient). */
11555 : :
11556 : : static rtx
11557 : 837 : expand_builtin_memory_chk (tree exp, rtx target, machine_mode mode,
11558 : : enum built_in_function fcode)
11559 : : {
11560 : 1410 : if (!validate_arglist (exp,
11561 : : POINTER_TYPE,
11562 : : fcode == BUILT_IN_MEMSET_CHK
11563 : : ? INTEGER_TYPE : POINTER_TYPE,
11564 : : INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
11565 : : return NULL_RTX;
11566 : :
11567 : 837 : tree dest = CALL_EXPR_ARG (exp, 0);
11568 : 837 : tree src = CALL_EXPR_ARG (exp, 1);
11569 : 837 : tree len = CALL_EXPR_ARG (exp, 2);
11570 : 837 : tree size = CALL_EXPR_ARG (exp, 3);
11571 : :
11572 : : /* FIXME: Set access mode to write only for memset et al. */
11573 : 837 : bool sizes_ok = check_access (exp, len, /*maxread=*/NULL_TREE,
11574 : : /*srcstr=*/NULL_TREE, size, access_read_write);
11575 : :
11576 : 837 : if (!tree_fits_uhwi_p (size))
11577 : : return NULL_RTX;
11578 : :
11579 : 627 : if (tree_fits_uhwi_p (len) || integer_all_onesp (size))
11580 : : {
11581 : : /* Avoid transforming the checking call to an ordinary one when
11582 : : an overflow has been detected or when the call couldn't be
11583 : : validated because the size is not constant. */
11584 : 186 : if (!sizes_ok && !integer_all_onesp (size) && tree_int_cst_lt (size, len))
11585 : : return NULL_RTX;
11586 : :
11587 : 0 : tree fn = NULL_TREE;
11588 : : /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
11589 : : mem{cpy,pcpy,move,set} is available. */
11590 : 0 : switch (fcode)
11591 : : {
11592 : 0 : case BUILT_IN_MEMCPY_CHK:
11593 : 0 : fn = builtin_decl_explicit (BUILT_IN_MEMCPY);
11594 : 0 : break;
11595 : 0 : case BUILT_IN_MEMPCPY_CHK:
11596 : 0 : fn = builtin_decl_explicit (BUILT_IN_MEMPCPY);
11597 : 0 : break;
11598 : 0 : case BUILT_IN_MEMMOVE_CHK:
11599 : 0 : fn = builtin_decl_explicit (BUILT_IN_MEMMOVE);
11600 : 0 : break;
11601 : 0 : case BUILT_IN_MEMSET_CHK:
11602 : 0 : fn = builtin_decl_explicit (BUILT_IN_MEMSET);
11603 : 0 : break;
11604 : : default:
11605 : : break;
11606 : : }
11607 : :
11608 : 0 : if (! fn)
11609 : : return NULL_RTX;
11610 : :
11611 : 0 : fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 3, dest, src, len);
11612 : 0 : gcc_assert (TREE_CODE (fn) == CALL_EXPR);
11613 : 0 : CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
11614 : 0 : return expand_expr (fn, target, mode, EXPAND_NORMAL);
11615 : : }
11616 : 441 : else if (fcode == BUILT_IN_MEMSET_CHK)
11617 : : return NULL_RTX;
11618 : : else
11619 : : {
11620 : 293 : unsigned int dest_align = get_pointer_alignment (dest);
11621 : :
11622 : : /* If DEST is not a pointer type, call the normal function. */
11623 : 293 : if (dest_align == 0)
11624 : : return NULL_RTX;
11625 : :
11626 : : /* If SRC and DEST are the same (and not volatile), do nothing. */
11627 : 293 : if (operand_equal_p (src, dest, 0))
11628 : : {
11629 : 0 : tree expr;
11630 : :
11631 : 0 : if (fcode != BUILT_IN_MEMPCPY_CHK)
11632 : : {
11633 : : /* Evaluate and ignore LEN in case it has side-effects. */
11634 : 0 : expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
11635 : 0 : return expand_expr (dest, target, mode, EXPAND_NORMAL);
11636 : : }
11637 : :
11638 : 0 : expr = fold_build_pointer_plus (dest, len);
11639 : 0 : return expand_expr (expr, target, mode, EXPAND_NORMAL);
11640 : : }
11641 : :
11642 : : /* __memmove_chk special case. */
11643 : 293 : if (fcode == BUILT_IN_MEMMOVE_CHK)
11644 : : {
11645 : 79 : unsigned int src_align = get_pointer_alignment (src);
11646 : :
11647 : 79 : if (src_align == 0)
11648 : : return NULL_RTX;
11649 : :
11650 : : /* If src is categorized for a readonly section we can use
11651 : : normal __memcpy_chk. */
11652 : 79 : if (readonly_data_expr (src))
11653 : : {
11654 : 15 : tree fn = builtin_decl_explicit (BUILT_IN_MEMCPY_CHK);
11655 : 15 : if (!fn)
11656 : : return NULL_RTX;
11657 : 15 : fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 4,
11658 : : dest, src, len, size);
11659 : 15 : gcc_assert (TREE_CODE (fn) == CALL_EXPR);
11660 : 15 : CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
11661 : 15 : return expand_expr (fn, target, mode, EXPAND_NORMAL);
11662 : : }
11663 : : }
11664 : 278 : return NULL_RTX;
11665 : : }
11666 : : }
11667 : :
11668 : : /* Emit warning if a buffer overflow is detected at compile time. */
11669 : :
11670 : : static void
11671 : 1135 : maybe_emit_chk_warning (tree exp, enum built_in_function fcode)
11672 : : {
11673 : : /* The source string. */
11674 : 1135 : tree srcstr = NULL_TREE;
11675 : : /* The size of the destination object returned by __builtin_object_size. */
11676 : 1135 : tree objsize = NULL_TREE;
11677 : : /* The string that is being concatenated with (as in __strcat_chk)
11678 : : or null if it isn't. */
11679 : 1135 : tree catstr = NULL_TREE;
11680 : : /* The maximum length of the source sequence in a bounded operation
11681 : : (such as __strncat_chk) or null if the operation isn't bounded
11682 : : (such as __strcat_chk). */
11683 : 1135 : tree maxread = NULL_TREE;
11684 : : /* The exact size of the access (such as in __strncpy_chk). */
11685 : 1135 : tree size = NULL_TREE;
11686 : : /* The access by the function that's checked. Except for snprintf
11687 : : both writing and reading is checked. */
11688 : 1135 : access_mode mode = access_read_write;
11689 : :
11690 : 1135 : switch (fcode)
11691 : : {
11692 : 276 : case BUILT_IN_STRCPY_CHK:
11693 : 276 : case BUILT_IN_STPCPY_CHK:
11694 : 276 : srcstr = CALL_EXPR_ARG (exp, 1);
11695 : 276 : objsize = CALL_EXPR_ARG (exp, 2);
11696 : 276 : break;
11697 : :
11698 : 198 : case BUILT_IN_STRCAT_CHK:
11699 : : /* For __strcat_chk the warning will be emitted only if overflowing
11700 : : by at least strlen (dest) + 1 bytes. */
11701 : 198 : catstr = CALL_EXPR_ARG (exp, 0);
11702 : 198 : srcstr = CALL_EXPR_ARG (exp, 1);
11703 : 198 : objsize = CALL_EXPR_ARG (exp, 2);
11704 : 198 : break;
11705 : :
11706 : 109 : case BUILT_IN_STRNCAT_CHK:
11707 : 109 : catstr = CALL_EXPR_ARG (exp, 0);
11708 : 109 : srcstr = CALL_EXPR_ARG (exp, 1);
11709 : 109 : maxread = CALL_EXPR_ARG (exp, 2);
11710 : 109 : objsize = CALL_EXPR_ARG (exp, 3);
11711 : 109 : break;
11712 : :
11713 : 243 : case BUILT_IN_STRNCPY_CHK:
11714 : 243 : case BUILT_IN_STPNCPY_CHK:
11715 : 243 : srcstr = CALL_EXPR_ARG (exp, 1);
11716 : 243 : size = CALL_EXPR_ARG (exp, 2);
11717 : 243 : objsize = CALL_EXPR_ARG (exp, 3);
11718 : 243 : break;
11719 : :
11720 : 309 : case BUILT_IN_SNPRINTF_CHK:
11721 : 309 : case BUILT_IN_VSNPRINTF_CHK:
11722 : 309 : maxread = CALL_EXPR_ARG (exp, 1);
11723 : 309 : objsize = CALL_EXPR_ARG (exp, 3);
11724 : : /* The only checked access the write to the destination. */
11725 : 309 : mode = access_write_only;
11726 : 309 : break;
11727 : 0 : default:
11728 : 0 : gcc_unreachable ();
11729 : : }
11730 : :
11731 : 1135 : if (catstr && maxread)
11732 : : {
11733 : : /* Check __strncat_chk. There is no way to determine the length
11734 : : of the string to which the source string is being appended so
11735 : : just warn when the length of the source string is not known. */
11736 : 109 : check_strncat_sizes (exp, objsize);
11737 : 109 : return;
11738 : : }
11739 : :
11740 : 1026 : check_access (exp, size, maxread, srcstr, objsize, mode);
11741 : : }
11742 : :
11743 : : /* Emit warning if a buffer overflow is detected at compile time
11744 : : in __sprintf_chk/__vsprintf_chk calls. */
11745 : :
11746 : : static void
11747 : 1329 : maybe_emit_sprintf_chk_warning (tree exp, enum built_in_function fcode)
11748 : : {
11749 : 1329 : tree size, len, fmt;
11750 : 1329 : const char *fmt_str;
11751 : 1329 : int nargs = call_expr_nargs (exp);
11752 : :
11753 : : /* Verify the required arguments in the original call. */
11754 : :
11755 : 1329 : if (nargs < 4)
11756 : : return;
11757 : 1329 : size = CALL_EXPR_ARG (exp, 2);
11758 : 1329 : fmt = CALL_EXPR_ARG (exp, 3);
11759 : :
11760 : 1329 : if (! tree_fits_uhwi_p (size) || integer_all_onesp (size))
11761 : 21 : return;
11762 : :
11763 : : /* Check whether the format is a literal string constant. */
11764 : 1308 : fmt_str = c_getstr (fmt);
11765 : 1308 : if (fmt_str == NULL)
11766 : : return;
11767 : :
11768 : 1272 : if (!init_target_chars ())
11769 : : return;
11770 : :
11771 : : /* If the format doesn't contain % args or %%, we know its size. */
11772 : 1272 : if (strchr (fmt_str, target_percent) == 0)
11773 : 22 : len = build_int_cstu (size_type_node, strlen (fmt_str));
11774 : : /* If the format is "%s" and first ... argument is a string literal,
11775 : : we know it too. */
11776 : 1250 : else if (fcode == BUILT_IN_SPRINTF_CHK
11777 : 1094 : && strcmp (fmt_str, target_percent_s) == 0)
11778 : : {
11779 : 49 : tree arg;
11780 : :
11781 : 49 : if (nargs < 5)
11782 : : return;
11783 : 49 : arg = CALL_EXPR_ARG (exp, 4);
11784 : 49 : if (! POINTER_TYPE_P (TREE_TYPE (arg)))
11785 : : return;
11786 : :
11787 : 45 : len = c_strlen (arg, 1);
11788 : 45 : if (!len || ! tree_fits_uhwi_p (len))
11789 : : return;
11790 : : }
11791 : : else
11792 : : return;
11793 : :
11794 : : /* Add one for the terminating nul. */
11795 : 34 : len = fold_build2 (PLUS_EXPR, TREE_TYPE (len), len, size_one_node);
11796 : :
11797 : 34 : check_access (exp, /*size=*/NULL_TREE, /*maxread=*/NULL_TREE, len, size,
11798 : : access_write_only);
11799 : : }
11800 : :
11801 : : /* Fold a call to __builtin_object_size with arguments PTR and OST,
11802 : : if possible. */
11803 : :
11804 : : static tree
11805 : 199933 : fold_builtin_object_size (tree ptr, tree ost, enum built_in_function fcode)
11806 : : {
11807 : 199933 : tree bytes;
11808 : 199933 : int object_size_type;
11809 : :
11810 : 199933 : if (!validate_arg (ptr, POINTER_TYPE)
11811 : 199933 : || !validate_arg (ost, INTEGER_TYPE))
11812 : : return NULL_TREE;
11813 : :
11814 : 199933 : STRIP_NOPS (ost);
11815 : :
11816 : 199933 : if (TREE_CODE (ost) != INTEGER_CST
11817 : 199933 : || tree_int_cst_sgn (ost) < 0
11818 : 399866 : || compare_tree_int (ost, 3) > 0)
11819 : 0 : return NULL_TREE;
11820 : :
11821 : 199933 : object_size_type = tree_to_shwi (ost);
11822 : :
11823 : : /* __builtin_object_size doesn't evaluate side-effects in its arguments;
11824 : : if there are any side-effects, it returns (size_t) -1 for types 0 and 1
11825 : : and (size_t) 0 for types 2 and 3. */
11826 : 199933 : if (TREE_SIDE_EFFECTS (ptr))
11827 : 603 : return build_int_cst_type (size_type_node, object_size_type < 2 ? -1 : 0);
11828 : :
11829 : 199330 : if (fcode == BUILT_IN_DYNAMIC_OBJECT_SIZE)
11830 : 66372 : object_size_type |= OST_DYNAMIC;
11831 : :
11832 : 199330 : if (TREE_CODE (ptr) == ADDR_EXPR)
11833 : : {
11834 : 12077 : compute_builtin_object_size (ptr, object_size_type, &bytes);
11835 : 12077 : if ((object_size_type & OST_DYNAMIC)
11836 : 10892 : || int_fits_type_p (bytes, size_type_node))
11837 : 12077 : return fold_convert (size_type_node, bytes);
11838 : : }
11839 : 187253 : else if (TREE_CODE (ptr) == SSA_NAME)
11840 : : {
11841 : : /* If object size is not known yet, delay folding until
11842 : : later. Maybe subsequent passes will help determining
11843 : : it. */
11844 : 101904 : if (compute_builtin_object_size (ptr, object_size_type, &bytes)
11845 : 101904 : && ((object_size_type & OST_DYNAMIC)
11846 : 2544 : || int_fits_type_p (bytes, size_type_node)))
11847 : 4815 : return fold_convert (size_type_node, bytes);
11848 : : }
11849 : :
11850 : : return NULL_TREE;
11851 : : }
11852 : :
11853 : : /* Builtins with folding operations that operate on "..." arguments
11854 : : need special handling; we need to store the arguments in a convenient
11855 : : data structure before attempting any folding. Fortunately there are
11856 : : only a few builtins that fall into this category. FNDECL is the
11857 : : function, EXP is the CALL_EXPR for the call. */
11858 : :
11859 : : static tree
11860 : 2504748 : fold_builtin_varargs (location_t loc, tree fndecl, tree *args, int nargs)
11861 : : {
11862 : 2504748 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
11863 : 2504748 : tree ret = NULL_TREE;
11864 : :
11865 : 2504748 : switch (fcode)
11866 : : {
11867 : 114672 : case BUILT_IN_FPCLASSIFY:
11868 : 114672 : ret = fold_builtin_fpclassify (loc, args, nargs);
11869 : 114672 : break;
11870 : :
11871 : 54 : case BUILT_IN_ADDC:
11872 : 54 : case BUILT_IN_ADDCL:
11873 : 54 : case BUILT_IN_ADDCLL:
11874 : 54 : case BUILT_IN_SUBC:
11875 : 54 : case BUILT_IN_SUBCL:
11876 : 54 : case BUILT_IN_SUBCLL:
11877 : 54 : return fold_builtin_addc_subc (loc, fcode, args);
11878 : :
11879 : : default:
11880 : : break;
11881 : : }
11882 : 114672 : if (ret)
11883 : : {
11884 : 114672 : ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
11885 : 114672 : SET_EXPR_LOCATION (ret, loc);
11886 : 114672 : suppress_warning (ret);
11887 : 114672 : return ret;
11888 : : }
11889 : : return NULL_TREE;
11890 : : }
11891 : :
11892 : : /* Initialize format string characters in the target charset. */
11893 : :
11894 : : bool
11895 : 275670 : init_target_chars (void)
11896 : : {
11897 : 275670 : static bool init;
11898 : 275670 : if (!init)
11899 : : {
11900 : 111535 : target_newline = lang_hooks.to_target_charset ('\n');
11901 : 111535 : target_percent = lang_hooks.to_target_charset ('%');
11902 : 111535 : target_c = lang_hooks.to_target_charset ('c');
11903 : 111535 : target_s = lang_hooks.to_target_charset ('s');
11904 : 111535 : if (target_newline == 0 || target_percent == 0 || target_c == 0
11905 : 111535 : || target_s == 0)
11906 : : return false;
11907 : :
11908 : 111535 : target_percent_c[0] = target_percent;
11909 : 111535 : target_percent_c[1] = target_c;
11910 : 111535 : target_percent_c[2] = '\0';
11911 : :
11912 : 111535 : target_percent_s[0] = target_percent;
11913 : 111535 : target_percent_s[1] = target_s;
11914 : 111535 : target_percent_s[2] = '\0';
11915 : :
11916 : 111535 : target_percent_s_newline[0] = target_percent;
11917 : 111535 : target_percent_s_newline[1] = target_s;
11918 : 111535 : target_percent_s_newline[2] = target_newline;
11919 : 111535 : target_percent_s_newline[3] = '\0';
11920 : :
11921 : 111535 : init = true;
11922 : : }
11923 : : return true;
11924 : : }
11925 : :
11926 : : /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
11927 : : and no overflow/underflow occurred. INEXACT is true if M was not
11928 : : exactly calculated. TYPE is the tree type for the result. This
11929 : : function assumes that you cleared the MPFR flags and then
11930 : : calculated M to see if anything subsequently set a flag prior to
11931 : : entering this function. Return NULL_TREE if any checks fail. */
11932 : :
11933 : : static tree
11934 : 2985 : do_mpfr_ckconv (mpfr_srcptr m, tree type, int inexact)
11935 : : {
11936 : : /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
11937 : : overflow/underflow occurred. If -frounding-math, proceed iff the
11938 : : result of calling FUNC was exact. */
11939 : 4838 : if (mpfr_number_p (m) && !mpfr_overflow_p () && !mpfr_underflow_p ()
11940 : 4838 : && (!flag_rounding_math || !inexact))
11941 : : {
11942 : 1853 : REAL_VALUE_TYPE rr;
11943 : :
11944 : 1853 : real_from_mpfr (&rr, m, type, MPFR_RNDN);
11945 : : /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
11946 : : check for overflow/underflow. If the REAL_VALUE_TYPE is zero
11947 : : but the mpfr_t is not, then we underflowed in the
11948 : : conversion. */
11949 : 1853 : if (real_isfinite (&rr)
11950 : 1853 : && (rr.cl == rvc_zero) == (mpfr_zero_p (m) != 0))
11951 : : {
11952 : 1853 : REAL_VALUE_TYPE rmode;
11953 : :
11954 : 1853 : real_convert (&rmode, TYPE_MODE (type), &rr);
11955 : : /* Proceed iff the specified mode can hold the value. */
11956 : 1853 : if (real_identical (&rmode, &rr))
11957 : 1853 : return build_real (type, rmode);
11958 : : }
11959 : : }
11960 : : return NULL_TREE;
11961 : : }
11962 : :
11963 : : /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
11964 : : number and no overflow/underflow occurred. INEXACT is true if M
11965 : : was not exactly calculated. TYPE is the tree type for the result.
11966 : : This function assumes that you cleared the MPFR flags and then
11967 : : calculated M to see if anything subsequently set a flag prior to
11968 : : entering this function. Return NULL_TREE if any checks fail, if
11969 : : FORCE_CONVERT is true, then bypass the checks. */
11970 : :
11971 : : static tree
11972 : 4130 : do_mpc_ckconv (mpc_srcptr m, tree type, int inexact, int force_convert)
11973 : : {
11974 : : /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
11975 : : overflow/underflow occurred. If -frounding-math, proceed iff the
11976 : : result of calling FUNC was exact. */
11977 : 4130 : if (force_convert
11978 : 4130 : || (mpfr_number_p (mpc_realref (m)) && mpfr_number_p (mpc_imagref (m))
11979 : 3784 : && !mpfr_overflow_p () && !mpfr_underflow_p ()
11980 : 3784 : && (!flag_rounding_math || !inexact)))
11981 : : {
11982 : 3951 : REAL_VALUE_TYPE re, im;
11983 : :
11984 : 3951 : real_from_mpfr (&re, mpc_realref (m), TREE_TYPE (type), MPFR_RNDN);
11985 : 3951 : real_from_mpfr (&im, mpc_imagref (m), TREE_TYPE (type), MPFR_RNDN);
11986 : : /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
11987 : : check for overflow/underflow. If the REAL_VALUE_TYPE is zero
11988 : : but the mpfr_t is not, then we underflowed in the
11989 : : conversion. */
11990 : 3951 : if (force_convert
11991 : 3951 : || (real_isfinite (&re) && real_isfinite (&im)
11992 : 3784 : && (re.cl == rvc_zero) == (mpfr_zero_p (mpc_realref (m)) != 0)
11993 : 3784 : && (im.cl == rvc_zero) == (mpfr_zero_p (mpc_imagref (m)) != 0)))
11994 : : {
11995 : 3951 : REAL_VALUE_TYPE re_mode, im_mode;
11996 : :
11997 : 3951 : real_convert (&re_mode, TYPE_MODE (TREE_TYPE (type)), &re);
11998 : 3951 : real_convert (&im_mode, TYPE_MODE (TREE_TYPE (type)), &im);
11999 : : /* Proceed iff the specified mode can hold the value. */
12000 : 3951 : if (force_convert
12001 : 3951 : || (real_identical (&re_mode, &re)
12002 : 3784 : && real_identical (&im_mode, &im)))
12003 : 3951 : return build_complex (type, build_real (TREE_TYPE (type), re_mode),
12004 : 7902 : build_real (TREE_TYPE (type), im_mode));
12005 : : }
12006 : : }
12007 : : return NULL_TREE;
12008 : : }
12009 : :
12010 : : /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
12011 : : the pointer *(ARG_QUO) and return the result. The type is taken
12012 : : from the type of ARG0 and is used for setting the precision of the
12013 : : calculation and results. */
12014 : :
12015 : : static tree
12016 : 86669 : do_mpfr_remquo (tree arg0, tree arg1, tree arg_quo)
12017 : : {
12018 : 86669 : tree const type = TREE_TYPE (arg0);
12019 : 86669 : tree result = NULL_TREE;
12020 : :
12021 : 86669 : STRIP_NOPS (arg0);
12022 : 86669 : STRIP_NOPS (arg1);
12023 : :
12024 : : /* To proceed, MPFR must exactly represent the target floating point
12025 : : format, which only happens when the target base equals two. */
12026 : 86669 : if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
12027 : 86669 : && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
12028 : 88980 : && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1))
12029 : : {
12030 : 2311 : const REAL_VALUE_TYPE *const ra0 = TREE_REAL_CST_PTR (arg0);
12031 : 2311 : const REAL_VALUE_TYPE *const ra1 = TREE_REAL_CST_PTR (arg1);
12032 : :
12033 : 2311 : if (real_isfinite (ra0) && real_isfinite (ra1))
12034 : : {
12035 : 2311 : const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
12036 : 2311 : const int prec = fmt->p;
12037 : 2311 : const mpfr_rnd_t rnd = fmt->round_towards_zero? MPFR_RNDZ : MPFR_RNDN;
12038 : 2311 : tree result_rem;
12039 : 2311 : long integer_quo;
12040 : 2311 : mpfr_t m0, m1;
12041 : :
12042 : 2311 : mpfr_inits2 (prec, m0, m1, NULL);
12043 : 2311 : mpfr_from_real (m0, ra0, MPFR_RNDN);
12044 : 2311 : mpfr_from_real (m1, ra1, MPFR_RNDN);
12045 : 2311 : mpfr_clear_flags ();
12046 : 2311 : mpfr_remquo (m0, &integer_quo, m0, m1, rnd);
12047 : : /* Remquo is independent of the rounding mode, so pass
12048 : : inexact=0 to do_mpfr_ckconv(). */
12049 : 2311 : result_rem = do_mpfr_ckconv (m0, type, /*inexact=*/ 0);
12050 : 2311 : mpfr_clears (m0, m1, NULL);
12051 : 2311 : if (result_rem)
12052 : : {
12053 : : /* MPFR calculates quo in the host's long so it may
12054 : : return more bits in quo than the target int can hold
12055 : : if sizeof(host long) > sizeof(target int). This can
12056 : : happen even for native compilers in LP64 mode. In
12057 : : these cases, modulo the quo value with the largest
12058 : : number that the target int can hold while leaving one
12059 : : bit for the sign. */
12060 : 1179 : if (sizeof (integer_quo) * CHAR_BIT > INT_TYPE_SIZE)
12061 : 1179 : integer_quo %= (long)(1UL << (INT_TYPE_SIZE - 1));
12062 : :
12063 : : /* Dereference the quo pointer argument. */
12064 : 1179 : arg_quo = build_fold_indirect_ref (arg_quo);
12065 : : /* Proceed iff a valid pointer type was passed in. */
12066 : 1179 : if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_quo)) == integer_type_node)
12067 : : {
12068 : : /* Set the value. */
12069 : 1179 : tree result_quo
12070 : 1179 : = fold_build2 (MODIFY_EXPR, TREE_TYPE (arg_quo), arg_quo,
12071 : : build_int_cst (TREE_TYPE (arg_quo),
12072 : : integer_quo));
12073 : 1179 : TREE_SIDE_EFFECTS (result_quo) = 1;
12074 : : /* Combine the quo assignment with the rem. */
12075 : 1179 : result = fold_build2 (COMPOUND_EXPR, type,
12076 : : result_quo, result_rem);
12077 : 1179 : suppress_warning (result, OPT_Wunused_value);
12078 : 1179 : result = non_lvalue (result);
12079 : : }
12080 : : }
12081 : : }
12082 : : }
12083 : 86669 : return result;
12084 : : }
12085 : :
12086 : : /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
12087 : : resulting value as a tree with type TYPE. The mpfr precision is
12088 : : set to the precision of TYPE. We assume that this mpfr function
12089 : : returns zero if the result could be calculated exactly within the
12090 : : requested precision. In addition, the integer pointer represented
12091 : : by ARG_SG will be dereferenced and set to the appropriate signgam
12092 : : (-1,1) value. */
12093 : :
12094 : : static tree
12095 : 6504 : do_mpfr_lgamma_r (tree arg, tree arg_sg, tree type)
12096 : : {
12097 : 6504 : tree result = NULL_TREE;
12098 : :
12099 : 6504 : STRIP_NOPS (arg);
12100 : :
12101 : : /* To proceed, MPFR must exactly represent the target floating point
12102 : : format, which only happens when the target base equals two. Also
12103 : : verify ARG is a constant and that ARG_SG is an int pointer. */
12104 : 6504 : if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
12105 : 6504 : && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)
12106 : 6470 : && TREE_CODE (TREE_TYPE (arg_sg)) == POINTER_TYPE
12107 : 12974 : && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (arg_sg))) == integer_type_node)
12108 : : {
12109 : 6470 : const REAL_VALUE_TYPE *const ra = TREE_REAL_CST_PTR (arg);
12110 : :
12111 : : /* In addition to NaN and Inf, the argument cannot be zero or a
12112 : : negative integer. */
12113 : 6470 : if (real_isfinite (ra)
12114 : 6470 : && ra->cl != rvc_zero
12115 : 12940 : && !(real_isneg (ra) && real_isinteger (ra, TYPE_MODE (type))))
12116 : : {
12117 : 674 : const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
12118 : 674 : const int prec = fmt->p;
12119 : 674 : const mpfr_rnd_t rnd = fmt->round_towards_zero? MPFR_RNDZ : MPFR_RNDN;
12120 : 674 : int inexact, sg;
12121 : 674 : tree result_lg;
12122 : :
12123 : 674 : auto_mpfr m (prec);
12124 : 674 : mpfr_from_real (m, ra, MPFR_RNDN);
12125 : 674 : mpfr_clear_flags ();
12126 : 674 : inexact = mpfr_lgamma (m, &sg, m, rnd);
12127 : 674 : result_lg = do_mpfr_ckconv (m, type, inexact);
12128 : 674 : if (result_lg)
12129 : : {
12130 : 674 : tree result_sg;
12131 : :
12132 : : /* Dereference the arg_sg pointer argument. */
12133 : 674 : arg_sg = build_fold_indirect_ref (arg_sg);
12134 : : /* Assign the signgam value into *arg_sg. */
12135 : 674 : result_sg = fold_build2 (MODIFY_EXPR,
12136 : : TREE_TYPE (arg_sg), arg_sg,
12137 : : build_int_cst (TREE_TYPE (arg_sg), sg));
12138 : 674 : TREE_SIDE_EFFECTS (result_sg) = 1;
12139 : : /* Combine the signgam assignment with the lgamma result. */
12140 : 674 : result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
12141 : : result_sg, result_lg));
12142 : : }
12143 : 674 : }
12144 : : }
12145 : :
12146 : 6504 : return result;
12147 : : }
12148 : :
12149 : : /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
12150 : : mpc function FUNC on it and return the resulting value as a tree
12151 : : with type TYPE. The mpfr precision is set to the precision of
12152 : : TYPE. We assume that function FUNC returns zero if the result
12153 : : could be calculated exactly within the requested precision. If
12154 : : DO_NONFINITE is true, then fold expressions containing Inf or NaN
12155 : : in the arguments and/or results. */
12156 : :
12157 : : tree
12158 : 4482 : do_mpc_arg2 (tree arg0, tree arg1, tree type, int do_nonfinite,
12159 : : int (*func)(mpc_ptr, mpc_srcptr, mpc_srcptr, mpc_rnd_t))
12160 : : {
12161 : 4482 : tree result = NULL_TREE;
12162 : :
12163 : 4482 : STRIP_NOPS (arg0);
12164 : 4482 : STRIP_NOPS (arg1);
12165 : :
12166 : : /* To proceed, MPFR must exactly represent the target floating point
12167 : : format, which only happens when the target base equals two. */
12168 : 4482 : if (TREE_CODE (arg0) == COMPLEX_CST && !TREE_OVERFLOW (arg0)
12169 : 4482 : && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TREE_TYPE (arg0)))
12170 : 4482 : && TREE_CODE (arg1) == COMPLEX_CST && !TREE_OVERFLOW (arg1)
12171 : 4482 : && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TREE_TYPE (arg1)))
12172 : 8964 : && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg0))))->b == 2)
12173 : : {
12174 : 4482 : const REAL_VALUE_TYPE *const re0 = TREE_REAL_CST_PTR (TREE_REALPART (arg0));
12175 : 4482 : const REAL_VALUE_TYPE *const im0 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg0));
12176 : 4482 : const REAL_VALUE_TYPE *const re1 = TREE_REAL_CST_PTR (TREE_REALPART (arg1));
12177 : 4482 : const REAL_VALUE_TYPE *const im1 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg1));
12178 : :
12179 : 4482 : if (do_nonfinite
12180 : 4482 : || (real_isfinite (re0) && real_isfinite (im0)
12181 : 3991 : && real_isfinite (re1) && real_isfinite (im1)))
12182 : : {
12183 : 4130 : const struct real_format *const fmt =
12184 : 4130 : REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
12185 : 4130 : const int prec = fmt->p;
12186 : 4130 : const mpfr_rnd_t rnd = fmt->round_towards_zero
12187 : 4130 : ? MPFR_RNDZ : MPFR_RNDN;
12188 : 4130 : const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
12189 : 4130 : int inexact;
12190 : 4130 : mpc_t m0, m1;
12191 : :
12192 : 4130 : mpc_init2 (m0, prec);
12193 : 4130 : mpc_init2 (m1, prec);
12194 : 4130 : mpfr_from_real (mpc_realref (m0), re0, rnd);
12195 : 4130 : mpfr_from_real (mpc_imagref (m0), im0, rnd);
12196 : 4130 : mpfr_from_real (mpc_realref (m1), re1, rnd);
12197 : 4130 : mpfr_from_real (mpc_imagref (m1), im1, rnd);
12198 : 4130 : mpfr_clear_flags ();
12199 : 4130 : inexact = func (m0, m0, m1, crnd);
12200 : 4130 : result = do_mpc_ckconv (m0, type, inexact, do_nonfinite);
12201 : 4130 : mpc_clear (m0);
12202 : 4130 : mpc_clear (m1);
12203 : : }
12204 : : }
12205 : :
12206 : 4482 : return result;
12207 : : }
12208 : :
12209 : : /* A wrapper function for builtin folding that prevents warnings for
12210 : : "statement without effect" and the like, caused by removing the
12211 : : call node earlier than the warning is generated. */
12212 : :
12213 : : tree
12214 : 9418038 : fold_call_stmt (gcall *stmt, bool ignore)
12215 : : {
12216 : 9418038 : tree ret = NULL_TREE;
12217 : 9418038 : tree fndecl = gimple_call_fndecl (stmt);
12218 : 9418038 : location_t loc = gimple_location (stmt);
12219 : 9418038 : if (fndecl && fndecl_built_in_p (fndecl)
12220 : 18836076 : && !gimple_call_va_arg_pack_p (stmt))
12221 : : {
12222 : 9417972 : int nargs = gimple_call_num_args (stmt);
12223 : 9417972 : tree *args = (nargs > 0
12224 : 9417972 : ? gimple_call_arg_ptr (stmt, 0)
12225 : : : &error_mark_node);
12226 : :
12227 : 9417972 : if (avoid_folding_inline_builtin (fndecl))
12228 : : return NULL_TREE;
12229 : 9417972 : if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
12230 : : {
12231 : 0 : return targetm.fold_builtin (fndecl, nargs, args, ignore);
12232 : : }
12233 : : else
12234 : : {
12235 : 9417972 : ret = fold_builtin_n (loc, NULL_TREE, fndecl, args, nargs, ignore);
12236 : 9417972 : if (ret)
12237 : : {
12238 : : /* Propagate location information from original call to
12239 : : expansion of builtin. Otherwise things like
12240 : : maybe_emit_chk_warning, that operate on the expansion
12241 : : of a builtin, will use the wrong location information. */
12242 : 5030 : if (gimple_has_location (stmt))
12243 : : {
12244 : 5029 : tree realret = ret;
12245 : 5029 : if (TREE_CODE (ret) == NOP_EXPR)
12246 : 5029 : realret = TREE_OPERAND (ret, 0);
12247 : 5029 : if (CAN_HAVE_LOCATION_P (realret)
12248 : 9325 : && !EXPR_HAS_LOCATION (realret))
12249 : 6 : SET_EXPR_LOCATION (realret, loc);
12250 : 5029 : return realret;
12251 : : }
12252 : : return ret;
12253 : : }
12254 : : }
12255 : : }
12256 : : return NULL_TREE;
12257 : : }
12258 : :
12259 : : /* Look up the function in builtin_decl that corresponds to DECL
12260 : : and set ASMSPEC as its user assembler name. DECL must be a
12261 : : function decl that declares a builtin. */
12262 : :
12263 : : void
12264 : 148336 : set_builtin_user_assembler_name (tree decl, const char *asmspec)
12265 : : {
12266 : 148336 : gcc_assert (fndecl_built_in_p (decl, BUILT_IN_NORMAL)
12267 : : && asmspec != 0);
12268 : :
12269 : 148336 : tree builtin = builtin_decl_explicit (DECL_FUNCTION_CODE (decl));
12270 : 148336 : set_user_assembler_name (builtin, asmspec);
12271 : :
12272 : 148336 : if (DECL_FUNCTION_CODE (decl) == BUILT_IN_FFS
12273 : 148336 : && INT_TYPE_SIZE < BITS_PER_WORD)
12274 : : {
12275 : 1 : scalar_int_mode mode = int_mode_for_size (INT_TYPE_SIZE, 0).require ();
12276 : 1 : set_user_assembler_libfunc ("ffs", asmspec);
12277 : 1 : set_optab_libfunc (ffs_optab, mode, "ffs");
12278 : : }
12279 : 148336 : }
12280 : :
12281 : : /* Return true if DECL is a builtin that expands to a constant or similarly
12282 : : simple code. */
12283 : : bool
12284 : 31874843 : is_simple_builtin (tree decl)
12285 : : {
12286 : 31874843 : if (decl && fndecl_built_in_p (decl, BUILT_IN_NORMAL))
12287 : 30629174 : switch (DECL_FUNCTION_CODE (decl))
12288 : : {
12289 : : /* Builtins that expand to constants. */
12290 : : case BUILT_IN_CONSTANT_P:
12291 : : case BUILT_IN_EXPECT:
12292 : : case BUILT_IN_OBJECT_SIZE:
12293 : : case BUILT_IN_UNREACHABLE:
12294 : : /* Simple register moves or loads from stack. */
12295 : : case BUILT_IN_ASSUME_ALIGNED:
12296 : : case BUILT_IN_RETURN_ADDRESS:
12297 : : case BUILT_IN_EXTRACT_RETURN_ADDR:
12298 : : case BUILT_IN_FROB_RETURN_ADDR:
12299 : : case BUILT_IN_RETURN:
12300 : : case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
12301 : : case BUILT_IN_FRAME_ADDRESS:
12302 : : case BUILT_IN_VA_END:
12303 : : case BUILT_IN_STACK_SAVE:
12304 : : case BUILT_IN_STACK_RESTORE:
12305 : : case BUILT_IN_DWARF_CFA:
12306 : : /* Exception state returns or moves registers around. */
12307 : : case BUILT_IN_EH_FILTER:
12308 : : case BUILT_IN_EH_POINTER:
12309 : : case BUILT_IN_EH_COPY_VALUES:
12310 : : return true;
12311 : :
12312 : 28009401 : default:
12313 : 28009401 : return false;
12314 : : }
12315 : :
12316 : : return false;
12317 : : }
12318 : :
12319 : : /* Return true if DECL is a builtin that is not expensive, i.e., they are
12320 : : most probably expanded inline into reasonably simple code. This is a
12321 : : superset of is_simple_builtin. */
12322 : : bool
12323 : 19282473 : is_inexpensive_builtin (tree decl)
12324 : : {
12325 : 19282473 : if (!decl)
12326 : : return false;
12327 : 19266347 : else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
12328 : : return true;
12329 : 17998362 : else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
12330 : 15155923 : switch (DECL_FUNCTION_CODE (decl))
12331 : : {
12332 : : case BUILT_IN_ABS:
12333 : : CASE_BUILT_IN_ALLOCA:
12334 : : case BUILT_IN_BSWAP16:
12335 : : case BUILT_IN_BSWAP32:
12336 : : case BUILT_IN_BSWAP64:
12337 : : case BUILT_IN_BSWAP128:
12338 : : case BUILT_IN_CLZ:
12339 : : case BUILT_IN_CLZIMAX:
12340 : : case BUILT_IN_CLZL:
12341 : : case BUILT_IN_CLZLL:
12342 : : case BUILT_IN_CTZ:
12343 : : case BUILT_IN_CTZIMAX:
12344 : : case BUILT_IN_CTZL:
12345 : : case BUILT_IN_CTZLL:
12346 : : case BUILT_IN_FFS:
12347 : : case BUILT_IN_FFSIMAX:
12348 : : case BUILT_IN_FFSL:
12349 : : case BUILT_IN_FFSLL:
12350 : : case BUILT_IN_IMAXABS:
12351 : : case BUILT_IN_FINITE:
12352 : : case BUILT_IN_FINITEF:
12353 : : case BUILT_IN_FINITEL:
12354 : : case BUILT_IN_FINITED32:
12355 : : case BUILT_IN_FINITED64:
12356 : : case BUILT_IN_FINITED128:
12357 : : case BUILT_IN_FPCLASSIFY:
12358 : : case BUILT_IN_ISFINITE:
12359 : : case BUILT_IN_ISINF_SIGN:
12360 : : case BUILT_IN_ISINF:
12361 : : case BUILT_IN_ISINFF:
12362 : : case BUILT_IN_ISINFL:
12363 : : case BUILT_IN_ISINFD32:
12364 : : case BUILT_IN_ISINFD64:
12365 : : case BUILT_IN_ISINFD128:
12366 : : case BUILT_IN_ISNAN:
12367 : : case BUILT_IN_ISNANF:
12368 : : case BUILT_IN_ISNANL:
12369 : : case BUILT_IN_ISNAND32:
12370 : : case BUILT_IN_ISNAND64:
12371 : : case BUILT_IN_ISNAND128:
12372 : : case BUILT_IN_ISNORMAL:
12373 : : case BUILT_IN_ISGREATER:
12374 : : case BUILT_IN_ISGREATEREQUAL:
12375 : : case BUILT_IN_ISLESS:
12376 : : case BUILT_IN_ISLESSEQUAL:
12377 : : case BUILT_IN_ISLESSGREATER:
12378 : : case BUILT_IN_ISUNORDERED:
12379 : : case BUILT_IN_ISEQSIG:
12380 : : case BUILT_IN_VA_ARG_PACK:
12381 : : case BUILT_IN_VA_ARG_PACK_LEN:
12382 : : case BUILT_IN_VA_COPY:
12383 : : case BUILT_IN_TRAP:
12384 : : case BUILT_IN_UNREACHABLE_TRAP:
12385 : : case BUILT_IN_SAVEREGS:
12386 : : case BUILT_IN_POPCOUNTL:
12387 : : case BUILT_IN_POPCOUNTLL:
12388 : : case BUILT_IN_POPCOUNTIMAX:
12389 : : case BUILT_IN_POPCOUNT:
12390 : : case BUILT_IN_PARITYL:
12391 : : case BUILT_IN_PARITYLL:
12392 : : case BUILT_IN_PARITYIMAX:
12393 : : case BUILT_IN_PARITY:
12394 : : case BUILT_IN_LABS:
12395 : : case BUILT_IN_LLABS:
12396 : : case BUILT_IN_PREFETCH:
12397 : : case BUILT_IN_ACC_ON_DEVICE:
12398 : : return true;
12399 : :
12400 : 14364739 : default:
12401 : 14364739 : return is_simple_builtin (decl);
12402 : : }
12403 : :
12404 : : return false;
12405 : : }
12406 : :
12407 : : /* Return true if T is a constant and the value cast to a target char
12408 : : can be represented by a host char.
12409 : : Store the casted char constant in *P if so. */
12410 : :
12411 : : bool
12412 : 2986 : target_char_cst_p (tree t, char *p)
12413 : : {
12414 : 2986 : if (!tree_fits_uhwi_p (t) || CHAR_TYPE_SIZE != HOST_BITS_PER_CHAR)
12415 : : return false;
12416 : :
12417 : 1675 : *p = (char)tree_to_uhwi (t);
12418 : 1675 : return true;
12419 : : }
12420 : :
12421 : : /* Return true if the builtin DECL is implemented in a standard library.
12422 : : Otherwise return false which doesn't guarantee it is not (thus the list
12423 : : of handled builtins below may be incomplete). */
12424 : :
12425 : : bool
12426 : 40674 : builtin_with_linkage_p (tree decl)
12427 : : {
12428 : 40674 : if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
12429 : 40396 : switch (DECL_FUNCTION_CODE (decl))
12430 : : {
12431 : 1294 : CASE_FLT_FN (BUILT_IN_ACOS):
12432 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ACOS):
12433 : 1294 : CASE_FLT_FN (BUILT_IN_ACOSH):
12434 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ACOSH):
12435 : 1294 : CASE_FLT_FN (BUILT_IN_ASIN):
12436 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ASIN):
12437 : 1294 : CASE_FLT_FN (BUILT_IN_ASINH):
12438 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ASINH):
12439 : 1294 : CASE_FLT_FN (BUILT_IN_ATAN):
12440 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ATAN):
12441 : 1294 : CASE_FLT_FN (BUILT_IN_ATANH):
12442 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ATANH):
12443 : 1294 : CASE_FLT_FN (BUILT_IN_ATAN2):
12444 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ATAN2):
12445 : 1294 : CASE_FLT_FN (BUILT_IN_CBRT):
12446 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_CBRT):
12447 : 1294 : CASE_FLT_FN (BUILT_IN_CEIL):
12448 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_CEIL):
12449 : 1294 : CASE_FLT_FN (BUILT_IN_COPYSIGN):
12450 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_COPYSIGN):
12451 : 1294 : CASE_FLT_FN (BUILT_IN_COS):
12452 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_COS):
12453 : 1294 : CASE_FLT_FN (BUILT_IN_COSH):
12454 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_COSH):
12455 : 1294 : CASE_FLT_FN (BUILT_IN_ERF):
12456 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ERF):
12457 : 1294 : CASE_FLT_FN (BUILT_IN_ERFC):
12458 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ERFC):
12459 : 1294 : CASE_FLT_FN (BUILT_IN_EXP):
12460 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_EXP):
12461 : 1294 : CASE_FLT_FN (BUILT_IN_EXP2):
12462 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_EXP2):
12463 : 1294 : CASE_FLT_FN (BUILT_IN_EXPM1):
12464 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_EXPM1):
12465 : 1294 : CASE_FLT_FN (BUILT_IN_FABS):
12466 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FABS):
12467 : 1294 : CASE_FLT_FN (BUILT_IN_FDIM):
12468 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FDIM):
12469 : 1294 : CASE_FLT_FN (BUILT_IN_FLOOR):
12470 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FLOOR):
12471 : 1294 : CASE_FLT_FN (BUILT_IN_FMA):
12472 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMA):
12473 : 1294 : CASE_FLT_FN (BUILT_IN_FMAX):
12474 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMAX):
12475 : 1294 : CASE_FLT_FN (BUILT_IN_FMIN):
12476 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMIN):
12477 : 1294 : CASE_FLT_FN (BUILT_IN_FMOD):
12478 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMOD):
12479 : 1294 : CASE_FLT_FN (BUILT_IN_FREXP):
12480 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FREXP):
12481 : 1294 : CASE_FLT_FN (BUILT_IN_HYPOT):
12482 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_HYPOT):
12483 : 1294 : CASE_FLT_FN (BUILT_IN_ILOGB):
12484 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ILOGB):
12485 : 1294 : CASE_FLT_FN (BUILT_IN_LDEXP):
12486 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LDEXP):
12487 : 1294 : CASE_FLT_FN (BUILT_IN_LGAMMA):
12488 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LGAMMA):
12489 : 1294 : CASE_FLT_FN (BUILT_IN_LLRINT):
12490 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LLRINT):
12491 : 1294 : CASE_FLT_FN (BUILT_IN_LLROUND):
12492 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LLROUND):
12493 : 1294 : CASE_FLT_FN (BUILT_IN_LOG):
12494 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LOG):
12495 : 1294 : CASE_FLT_FN (BUILT_IN_LOG10):
12496 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LOG10):
12497 : 1294 : CASE_FLT_FN (BUILT_IN_LOG1P):
12498 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LOG1P):
12499 : 1294 : CASE_FLT_FN (BUILT_IN_LOG2):
12500 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LOG2):
12501 : 1294 : CASE_FLT_FN (BUILT_IN_LOGB):
12502 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LOGB):
12503 : 1294 : CASE_FLT_FN (BUILT_IN_LRINT):
12504 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LRINT):
12505 : 1294 : CASE_FLT_FN (BUILT_IN_LROUND):
12506 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LROUND):
12507 : 1294 : CASE_FLT_FN (BUILT_IN_MODF):
12508 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_MODF):
12509 : 1294 : CASE_FLT_FN (BUILT_IN_NAN):
12510 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_NAN):
12511 : 1294 : CASE_FLT_FN (BUILT_IN_NEARBYINT):
12512 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_NEARBYINT):
12513 : 1294 : CASE_FLT_FN (BUILT_IN_NEXTAFTER):
12514 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_NEXTAFTER):
12515 : 1294 : CASE_FLT_FN (BUILT_IN_NEXTTOWARD):
12516 : 1294 : CASE_FLT_FN (BUILT_IN_POW):
12517 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_POW):
12518 : 1294 : CASE_FLT_FN (BUILT_IN_REMAINDER):
12519 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_REMAINDER):
12520 : 1294 : CASE_FLT_FN (BUILT_IN_REMQUO):
12521 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_REMQUO):
12522 : 1294 : CASE_FLT_FN (BUILT_IN_RINT):
12523 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_RINT):
12524 : 1294 : CASE_FLT_FN (BUILT_IN_ROUND):
12525 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ROUND):
12526 : 1294 : CASE_FLT_FN (BUILT_IN_SCALBLN):
12527 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_SCALBLN):
12528 : 1294 : CASE_FLT_FN (BUILT_IN_SCALBN):
12529 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_SCALBN):
12530 : 1294 : CASE_FLT_FN (BUILT_IN_SIN):
12531 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_SIN):
12532 : 1294 : CASE_FLT_FN (BUILT_IN_SINH):
12533 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_SINH):
12534 : 1294 : CASE_FLT_FN (BUILT_IN_SINCOS):
12535 : 1294 : CASE_FLT_FN (BUILT_IN_SQRT):
12536 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_SQRT):
12537 : 1294 : CASE_FLT_FN (BUILT_IN_TAN):
12538 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_TAN):
12539 : 1294 : CASE_FLT_FN (BUILT_IN_TANH):
12540 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_TANH):
12541 : 1294 : CASE_FLT_FN (BUILT_IN_TGAMMA):
12542 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_TGAMMA):
12543 : 1294 : CASE_FLT_FN (BUILT_IN_TRUNC):
12544 : 1294 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_TRUNC):
12545 : 1294 : return true;
12546 : :
12547 : 16 : case BUILT_IN_STPCPY:
12548 : 16 : case BUILT_IN_STPNCPY:
12549 : : /* stpcpy is both referenced in libiberty's pex-win32.c and provided
12550 : : by libiberty's stpcpy.c for MinGW targets so we need to return true
12551 : : in order to be able to build libiberty in LTO mode for them. */
12552 : 16 : return true;
12553 : :
12554 : : default:
12555 : : break;
12556 : : }
12557 : : return false;
12558 : : }
12559 : :
12560 : : /* Return true if OFFRNG is bounded to a subrange of offset values
12561 : : valid for the largest possible object. */
12562 : :
12563 : : bool
12564 : 501 : access_ref::offset_bounded () const
12565 : : {
12566 : 501 : tree min = TYPE_MIN_VALUE (ptrdiff_type_node);
12567 : 501 : tree max = TYPE_MAX_VALUE (ptrdiff_type_node);
12568 : 975 : return wi::to_offset (min) <= offrng[0] && offrng[1] <= wi::to_offset (max);
12569 : : }
12570 : :
12571 : : /* If CALLEE has known side effects, fill in INFO and return true.
12572 : : See tree-ssa-structalias.cc:find_func_aliases
12573 : : for the list of builtins we might need to handle here. */
12574 : :
12575 : : attr_fnspec
12576 : 109571021 : builtin_fnspec (tree callee)
12577 : : {
12578 : 109571021 : built_in_function code = DECL_FUNCTION_CODE (callee);
12579 : :
12580 : 109571021 : switch (code)
12581 : : {
12582 : : /* All the following functions read memory pointed to by
12583 : : their second argument and write memory pointed to by first
12584 : : argument.
12585 : : strcat/strncat additionally reads memory pointed to by the first
12586 : : argument. */
12587 : 137169 : case BUILT_IN_STRCAT:
12588 : 137169 : case BUILT_IN_STRCAT_CHK:
12589 : 137169 : return "1cW 1 ";
12590 : 42692 : case BUILT_IN_STRNCAT:
12591 : 42692 : case BUILT_IN_STRNCAT_CHK:
12592 : 42692 : return "1cW 13";
12593 : 264022 : case BUILT_IN_STRCPY:
12594 : 264022 : case BUILT_IN_STRCPY_CHK:
12595 : 264022 : return "1cO 1 ";
12596 : 32309 : case BUILT_IN_STPCPY:
12597 : 32309 : case BUILT_IN_STPCPY_CHK:
12598 : 32309 : return ".cO 1 ";
12599 : 18812526 : case BUILT_IN_STRNCPY:
12600 : 18812526 : case BUILT_IN_MEMCPY:
12601 : 18812526 : case BUILT_IN_MEMMOVE:
12602 : 18812526 : case BUILT_IN_TM_MEMCPY:
12603 : 18812526 : case BUILT_IN_TM_MEMMOVE:
12604 : 18812526 : case BUILT_IN_STRNCPY_CHK:
12605 : 18812526 : case BUILT_IN_MEMCPY_CHK:
12606 : 18812526 : case BUILT_IN_MEMMOVE_CHK:
12607 : 18812526 : return "1cO313";
12608 : 152471 : case BUILT_IN_MEMPCPY:
12609 : 152471 : case BUILT_IN_MEMPCPY_CHK:
12610 : 152471 : return ".cO313";
12611 : 57342 : case BUILT_IN_STPNCPY:
12612 : 57342 : case BUILT_IN_STPNCPY_CHK:
12613 : 57342 : return ".cO313";
12614 : 0 : case BUILT_IN_BCOPY:
12615 : 0 : return ".c23O3";
12616 : 0 : case BUILT_IN_BZERO:
12617 : 0 : return ".cO2";
12618 : 8606024 : case BUILT_IN_MEMCMP:
12619 : 8606024 : case BUILT_IN_MEMCMP_EQ:
12620 : 8606024 : case BUILT_IN_BCMP:
12621 : 8606024 : case BUILT_IN_STRNCMP:
12622 : 8606024 : case BUILT_IN_STRNCMP_EQ:
12623 : 8606024 : case BUILT_IN_STRNCASECMP:
12624 : 8606024 : return ".cR3R3";
12625 : :
12626 : : /* The following functions read memory pointed to by their
12627 : : first argument. */
12628 : 780 : CASE_BUILT_IN_TM_LOAD (1):
12629 : 780 : CASE_BUILT_IN_TM_LOAD (2):
12630 : 780 : CASE_BUILT_IN_TM_LOAD (4):
12631 : 780 : CASE_BUILT_IN_TM_LOAD (8):
12632 : 780 : CASE_BUILT_IN_TM_LOAD (FLOAT):
12633 : 780 : CASE_BUILT_IN_TM_LOAD (DOUBLE):
12634 : 780 : CASE_BUILT_IN_TM_LOAD (LDOUBLE):
12635 : 780 : CASE_BUILT_IN_TM_LOAD (M64):
12636 : 780 : CASE_BUILT_IN_TM_LOAD (M128):
12637 : 780 : CASE_BUILT_IN_TM_LOAD (M256):
12638 : 780 : case BUILT_IN_TM_LOG:
12639 : 780 : case BUILT_IN_TM_LOG_1:
12640 : 780 : case BUILT_IN_TM_LOG_2:
12641 : 780 : case BUILT_IN_TM_LOG_4:
12642 : 780 : case BUILT_IN_TM_LOG_8:
12643 : 780 : case BUILT_IN_TM_LOG_FLOAT:
12644 : 780 : case BUILT_IN_TM_LOG_DOUBLE:
12645 : 780 : case BUILT_IN_TM_LOG_LDOUBLE:
12646 : 780 : case BUILT_IN_TM_LOG_M64:
12647 : 780 : case BUILT_IN_TM_LOG_M128:
12648 : 780 : case BUILT_IN_TM_LOG_M256:
12649 : 780 : return ".cR ";
12650 : :
12651 : 466039 : case BUILT_IN_INDEX:
12652 : 466039 : case BUILT_IN_RINDEX:
12653 : 466039 : case BUILT_IN_STRCHR:
12654 : 466039 : case BUILT_IN_STRLEN:
12655 : 466039 : case BUILT_IN_STRRCHR:
12656 : 466039 : return ".cR ";
12657 : 62578 : case BUILT_IN_STRNLEN:
12658 : 62578 : return ".cR2";
12659 : :
12660 : : /* These read memory pointed to by the first argument.
12661 : : Allocating memory does not have any side-effects apart from
12662 : : being the definition point for the pointer.
12663 : : Unix98 specifies that errno is set on allocation failure. */
12664 : 17833 : case BUILT_IN_STRDUP:
12665 : 17833 : return "mCR ";
12666 : 13312 : case BUILT_IN_STRNDUP:
12667 : 13312 : return "mCR2";
12668 : : /* Allocating memory does not have any side-effects apart from
12669 : : being the definition point for the pointer. */
12670 : 9487350 : case BUILT_IN_MALLOC:
12671 : 9487350 : case BUILT_IN_ALIGNED_ALLOC:
12672 : 9487350 : case BUILT_IN_CALLOC:
12673 : 9487350 : case BUILT_IN_GOMP_ALLOC:
12674 : 9487350 : return "mC";
12675 : 859776 : CASE_BUILT_IN_ALLOCA:
12676 : 859776 : return "mc";
12677 : : /* These read memory pointed to by the first argument with size
12678 : : in the third argument. */
12679 : 513246 : case BUILT_IN_MEMCHR:
12680 : 513246 : return ".cR3";
12681 : : /* These read memory pointed to by the first and second arguments. */
12682 : 11123718 : case BUILT_IN_STRSTR:
12683 : 11123718 : case BUILT_IN_STRPBRK:
12684 : 11123718 : case BUILT_IN_STRCASECMP:
12685 : 11123718 : case BUILT_IN_STRCSPN:
12686 : 11123718 : case BUILT_IN_STRSPN:
12687 : 11123718 : case BUILT_IN_STRCMP:
12688 : 11123718 : case BUILT_IN_STRCMP_EQ:
12689 : 11123718 : return ".cR R ";
12690 : : /* Freeing memory kills the pointed-to memory. More importantly
12691 : : the call has to serve as a barrier for moving loads and stores
12692 : : across it. */
12693 : 5758558 : case BUILT_IN_STACK_RESTORE:
12694 : 5758558 : case BUILT_IN_FREE:
12695 : 5758558 : case BUILT_IN_GOMP_FREE:
12696 : 5758558 : return ".co ";
12697 : 102660 : case BUILT_IN_VA_END:
12698 : 102660 : return ".cO ";
12699 : : /* Realloc serves both as allocation point and deallocation point. */
12700 : 978654 : case BUILT_IN_REALLOC:
12701 : 978654 : case BUILT_IN_GOMP_REALLOC:
12702 : 978654 : return ".Cw ";
12703 : 15732 : case BUILT_IN_GAMMA_R:
12704 : 15732 : case BUILT_IN_GAMMAF_R:
12705 : 15732 : case BUILT_IN_GAMMAL_R:
12706 : 15732 : case BUILT_IN_LGAMMA_R:
12707 : 15732 : case BUILT_IN_LGAMMAF_R:
12708 : 15732 : case BUILT_IN_LGAMMAL_R:
12709 : 15732 : return ".C. Ot";
12710 : 81570 : case BUILT_IN_FREXP:
12711 : 81570 : case BUILT_IN_FREXPF:
12712 : 81570 : case BUILT_IN_FREXPL:
12713 : 81570 : case BUILT_IN_MODF:
12714 : 81570 : case BUILT_IN_MODFF:
12715 : 81570 : case BUILT_IN_MODFL:
12716 : 81570 : return ".c. Ot";
12717 : 7616 : case BUILT_IN_REMQUO:
12718 : 7616 : case BUILT_IN_REMQUOF:
12719 : 7616 : case BUILT_IN_REMQUOL:
12720 : 7616 : return ".c. . Ot";
12721 : 152 : case BUILT_IN_SINCOS:
12722 : 152 : case BUILT_IN_SINCOSF:
12723 : 152 : case BUILT_IN_SINCOSL:
12724 : 152 : return ".c. OtOt";
12725 : 4273274 : case BUILT_IN_MEMSET:
12726 : 4273274 : case BUILT_IN_MEMSET_CHK:
12727 : 4273274 : case BUILT_IN_TM_MEMSET:
12728 : 4273274 : return "1cO3";
12729 : 366 : CASE_BUILT_IN_TM_STORE (1):
12730 : 366 : CASE_BUILT_IN_TM_STORE (2):
12731 : 366 : CASE_BUILT_IN_TM_STORE (4):
12732 : 366 : CASE_BUILT_IN_TM_STORE (8):
12733 : 366 : CASE_BUILT_IN_TM_STORE (FLOAT):
12734 : 366 : CASE_BUILT_IN_TM_STORE (DOUBLE):
12735 : 366 : CASE_BUILT_IN_TM_STORE (LDOUBLE):
12736 : 366 : CASE_BUILT_IN_TM_STORE (M64):
12737 : 366 : CASE_BUILT_IN_TM_STORE (M128):
12738 : 366 : CASE_BUILT_IN_TM_STORE (M256):
12739 : 366 : return ".cO ";
12740 : 2260052 : case BUILT_IN_STACK_SAVE:
12741 : 2260052 : case BUILT_IN_RETURN:
12742 : 2260052 : case BUILT_IN_EH_POINTER:
12743 : 2260052 : case BUILT_IN_EH_FILTER:
12744 : 2260052 : case BUILT_IN_UNWIND_RESUME:
12745 : 2260052 : case BUILT_IN_CXA_END_CLEANUP:
12746 : 2260052 : case BUILT_IN_EH_COPY_VALUES:
12747 : 2260052 : case BUILT_IN_FRAME_ADDRESS:
12748 : 2260052 : case BUILT_IN_APPLY_ARGS:
12749 : 2260052 : case BUILT_IN_ASAN_BEFORE_DYNAMIC_INIT:
12750 : 2260052 : case BUILT_IN_ASAN_AFTER_DYNAMIC_INIT:
12751 : 2260052 : case BUILT_IN_PREFETCH:
12752 : 2260052 : case BUILT_IN_DWARF_CFA:
12753 : 2260052 : case BUILT_IN_RETURN_ADDRESS:
12754 : 2260052 : return ".c";
12755 : 1682877 : case BUILT_IN_ASSUME_ALIGNED:
12756 : 1682877 : case BUILT_IN_EXPECT:
12757 : 1682877 : case BUILT_IN_EXPECT_WITH_PROBABILITY:
12758 : 1682877 : return "1cX ";
12759 : : /* But posix_memalign stores a pointer into the memory pointed to
12760 : : by its first argument. */
12761 : 5573 : case BUILT_IN_POSIX_MEMALIGN:
12762 : 5573 : return ".cOt";
12763 : 4438 : case BUILT_IN_OMP_GET_MAPPED_PTR:
12764 : 4438 : return ". R ";
12765 : :
12766 : 43750312 : default:
12767 : 43750312 : return "";
12768 : : }
12769 : : }
|
