Line data Source code
1 : /* Expand builtin functions.
2 : Copyright (C) 1988-2026 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 539259 : is_builtin_name (const char *name)
203 : {
204 539259 : return (startswith (name, "__builtin_")
205 193639 : || startswith (name, "__sync_")
206 732042 : || 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 539259 : 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 539259 : const char *name = IDENTIFIER_POINTER (DECL_NAME (node));
220 539259 : 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 108550358 : get_object_alignment_2 (tree exp, unsigned int *alignp,
240 : unsigned HOST_WIDE_INT *bitposp, bool addr_p)
241 : {
242 108550358 : poly_int64 bitsize, bitpos;
243 108550358 : tree offset;
244 108550358 : machine_mode mode;
245 108550358 : int unsignedp, reversep, volatilep;
246 108550358 : unsigned int align = BITS_PER_UNIT;
247 108550358 : bool known_alignment = false;
248 :
249 : /* Get the innermost object and the constant (bitpos) and possibly
250 : variable (offset) offset of the access. */
251 108550358 : 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 108550358 : 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 108111801 : else if (TREE_CODE (exp) == LABEL_DECL)
266 : ;
267 108074827 : else if (TREE_CODE (exp) == CONST_DECL)
268 : {
269 : /* The alignment of a CONST_DECL is determined by its initializer. */
270 59316 : exp = DECL_INITIAL (exp);
271 59316 : align = TYPE_ALIGN (TREE_TYPE (exp));
272 59316 : if (CONSTANT_CLASS_P (exp))
273 59309 : align = targetm.constant_alignment (exp, align);
274 :
275 : known_alignment = true;
276 : }
277 108015511 : else if (DECL_P (exp))
278 : {
279 65276077 : align = DECL_ALIGN (exp);
280 : known_alignment = true;
281 : }
282 42739434 : else if (TREE_CODE (exp) == INDIRECT_REF
283 42727071 : || TREE_CODE (exp) == MEM_REF
284 5256108 : || TREE_CODE (exp) == TARGET_MEM_REF)
285 : {
286 41131405 : tree addr = TREE_OPERAND (exp, 0);
287 41131405 : unsigned ptr_align;
288 41131405 : unsigned HOST_WIDE_INT ptr_bitpos;
289 41131405 : unsigned HOST_WIDE_INT ptr_bitmask = ~0;
290 :
291 : /* If the address is explicitly aligned, handle that. */
292 41131405 : if (TREE_CODE (addr) == BIT_AND_EXPR
293 41131405 : && TREE_CODE (TREE_OPERAND (addr, 1)) == INTEGER_CST)
294 : {
295 78 : ptr_bitmask = TREE_INT_CST_LOW (TREE_OPERAND (addr, 1));
296 78 : ptr_bitmask *= BITS_PER_UNIT;
297 78 : align = least_bit_hwi (ptr_bitmask);
298 78 : addr = TREE_OPERAND (addr, 0);
299 : }
300 :
301 41131405 : known_alignment
302 41131405 : = get_pointer_alignment_1 (addr, &ptr_align, &ptr_bitpos);
303 41131405 : align = MAX (ptr_align, align);
304 :
305 : /* Re-apply explicit alignment to the bitpos. */
306 41131405 : 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 41131405 : if (TREE_CODE (exp) == TARGET_MEM_REF)
311 : {
312 3648079 : if (TMR_INDEX (exp))
313 : {
314 1695372 : unsigned HOST_WIDE_INT step = 1;
315 1695372 : if (TMR_STEP (exp))
316 1542294 : step = TREE_INT_CST_LOW (TMR_STEP (exp));
317 1695372 : align = MIN (align, least_bit_hwi (step) * BITS_PER_UNIT);
318 : }
319 3648079 : if (TMR_INDEX2 (exp))
320 37787 : 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 41131405 : unsigned int talign;
330 41131405 : if (!addr_p && !known_alignment
331 38840307 : && (talign = min_align_of_type (TREE_TYPE (exp)) * BITS_PER_UNIT)
332 79971706 : && talign > align)
333 : align = talign;
334 : else
335 : {
336 : /* Else adjust bitpos accordingly. */
337 11126029 : bitpos += ptr_bitpos;
338 11126029 : if (TREE_CODE (exp) == MEM_REF
339 11126029 : || TREE_CODE (exp) == TARGET_MEM_REF)
340 11116656 : bitpos += mem_ref_offset (exp).force_shwi () * BITS_PER_UNIT;
341 : }
342 41131405 : }
343 1608029 : 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 1607474 : align = TYPE_ALIGN (TREE_TYPE (exp));
348 1607474 : if (CONSTANT_CLASS_P (exp))
349 1607474 : 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 108550358 : if (offset)
357 : {
358 10047587 : unsigned int trailing_zeros = tree_ctz (offset);
359 10047587 : if (trailing_zeros < HOST_BITS_PER_INT)
360 : {
361 10047509 : unsigned int inner = (1U << trailing_zeros) * BITS_PER_UNIT;
362 10047509 : if (inner)
363 10047509 : 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 108550358 : unsigned int alt_align = ::known_alignment (bitpos - bitpos.coeffs[0]);
370 108550358 : if (alt_align != 0 && alt_align < align)
371 : {
372 : align = alt_align;
373 : known_alignment = false;
374 : }
375 :
376 108550358 : *alignp = align;
377 108550358 : *bitposp = bitpos.coeffs[0] & (align - 1);
378 108550358 : 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 86169324 : 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 86169324 : if (TREE_CODE (exp) == WITH_SIZE_EXPR)
393 0 : exp = TREE_OPERAND (exp, 0);
394 86169324 : 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 36095150 : get_object_alignment (tree exp)
401 : {
402 36095150 : unsigned HOST_WIDE_INT bitpos = 0;
403 36095150 : unsigned int align;
404 :
405 36095150 : 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 36095150 : if (bitpos != 0)
411 2704064 : align = least_bit_hwi (bitpos);
412 36095150 : 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 81478514 : get_pointer_alignment_1 (tree exp, unsigned int *alignp,
424 : unsigned HOST_WIDE_INT *bitposp)
425 : {
426 81478514 : STRIP_NOPS (exp);
427 :
428 81478514 : if (TREE_CODE (exp) == ADDR_EXPR)
429 22379478 : return get_object_alignment_2 (TREE_OPERAND (exp, 0),
430 22379478 : alignp, bitposp, true);
431 59099036 : else if (TREE_CODE (exp) == POINTER_PLUS_EXPR)
432 : {
433 984894 : unsigned int align;
434 984894 : unsigned HOST_WIDE_INT bitpos;
435 984894 : bool res = get_pointer_alignment_1 (TREE_OPERAND (exp, 0),
436 : &align, &bitpos);
437 984894 : if (TREE_CODE (TREE_OPERAND (exp, 1)) == INTEGER_CST)
438 2761 : bitpos += TREE_INT_CST_LOW (TREE_OPERAND (exp, 1)) * BITS_PER_UNIT;
439 : else
440 : {
441 982133 : unsigned int trailing_zeros = tree_ctz (TREE_OPERAND (exp, 1));
442 982133 : if (trailing_zeros < HOST_BITS_PER_INT)
443 : {
444 982125 : unsigned int inner = (1U << trailing_zeros) * BITS_PER_UNIT;
445 982125 : if (inner)
446 982125 : align = MIN (align, inner);
447 : }
448 : }
449 984894 : *alignp = align;
450 984894 : *bitposp = bitpos & (align - 1);
451 984894 : return res;
452 : }
453 58114142 : else if (TREE_CODE (exp) == SSA_NAME
454 58114142 : && POINTER_TYPE_P (TREE_TYPE (exp)))
455 : {
456 56025919 : unsigned int ptr_align, ptr_misalign;
457 56025919 : struct ptr_info_def *pi = SSA_NAME_PTR_INFO (exp);
458 :
459 56025919 : if (pi && get_ptr_info_alignment (pi, &ptr_align, &ptr_misalign))
460 : {
461 6105440 : *bitposp = ptr_misalign * BITS_PER_UNIT;
462 6105440 : *alignp = ptr_align * BITS_PER_UNIT;
463 : /* Make sure to return a sensible alignment when the multiplication
464 : by BITS_PER_UNIT overflowed. */
465 6105440 : if (*alignp == 0)
466 30 : *alignp = 1u << (HOST_BITS_PER_INT - 1);
467 : /* We cannot really tell whether this result is an approximation. */
468 6105440 : return false;
469 : }
470 : else
471 : {
472 49920479 : *bitposp = 0;
473 49920479 : *alignp = BITS_PER_UNIT;
474 49920479 : return false;
475 : }
476 : }
477 2088223 : else if (TREE_CODE (exp) == INTEGER_CST)
478 : {
479 17435 : *alignp = BIGGEST_ALIGNMENT;
480 17435 : *bitposp = ((TREE_INT_CST_LOW (exp) * BITS_PER_UNIT)
481 17435 : & (BIGGEST_ALIGNMENT - 1));
482 17435 : return true;
483 : }
484 :
485 2070788 : *bitposp = 0;
486 2070788 : *alignp = BITS_PER_UNIT;
487 2070788 : 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 11084537 : get_pointer_alignment (tree exp)
499 : {
500 11084537 : unsigned HOST_WIDE_INT bitpos = 0;
501 11084537 : unsigned int align;
502 :
503 11084537 : 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 11084537 : if (bitpos != 0)
509 75033 : align = least_bit_hwi (bitpos);
510 :
511 11084537 : 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 755790 : string_length (const void *ptr, unsigned eltsize, unsigned maxelts)
520 : {
521 755790 : gcc_checking_assert (eltsize == 1 || eltsize == 2 || eltsize == 4);
522 :
523 755790 : unsigned n;
524 :
525 755790 : if (eltsize == 1)
526 : {
527 : /* Optimize the common case of plain char. */
528 244768878 : for (n = 0; n < maxelts; n++)
529 : {
530 244679856 : const char *elt = (const char*) ptr + n;
531 244679856 : 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 755790 : 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 character strings. ELTSIZE is by default 1.
573 :
574 : The value returned is of type `ssizetype'. */
575 :
576 : tree
577 2492970 : 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 2492970 : c_strlen_data local_strlen_data = { };
583 2492970 : if (!data)
584 582744 : data = &local_strlen_data;
585 :
586 2492970 : gcc_checking_assert (eltsize == 1 || eltsize == 2 || eltsize == 4);
587 :
588 2492970 : tree src = STRIP_NOPS (arg);
589 2492970 : if (TREE_CODE (src) == COND_EXPR
590 2492970 : && (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 2492804 : if (TREE_CODE (src) == COMPOUND_EXPR
601 2492804 : && (only_value || !TREE_SIDE_EFFECTS (TREE_OPERAND (src, 0))))
602 45 : return c_strlen (TREE_OPERAND (src, 1), only_value, data, eltsize);
603 :
604 2492759 : location_t loc = EXPR_LOC_OR_LOC (src, input_location);
605 :
606 : /* Offset from the beginning of the string in bytes. */
607 2492759 : tree byteoff;
608 2492759 : tree memsize;
609 2492759 : tree decl;
610 2492759 : src = string_constant (src, &byteoff, &memsize, &decl);
611 2492759 : if (src == 0)
612 : return NULL_TREE;
613 :
614 : /* Determine the size of the string element. */
615 772022 : 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 759618 : HOST_WIDE_INT strelts = TREE_STRING_LENGTH (src);
625 759618 : strelts = strelts / eltsize;
626 :
627 759618 : if (!tree_fits_uhwi_p (memsize))
628 : return NULL_TREE;
629 :
630 759618 : 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 759618 : const char *ptr = TREE_STRING_POINTER (src);
635 :
636 759618 : if (byteoff && TREE_CODE (byteoff) != INTEGER_CST)
637 : {
638 : /* The code below works only for single byte character types. */
639 4688 : 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 4688 : 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 4688 : if (len + 1 < strelts)
652 : return NULL_TREE;
653 4118 : 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 3016 : 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 2977 : tree offsave = TREE_SIDE_EFFECTS (byteoff) ? save_expr (byteoff)
671 : : byteoff;
672 2977 : offsave = fold_convert_loc (loc, sizetype, offsave);
673 2977 : tree condexp = fold_build2_loc (loc, LE_EXPR, boolean_type_node, offsave,
674 2977 : size_int (len));
675 2977 : tree lenexp = fold_build2_loc (loc, MINUS_EXPR, sizetype, size_int (len),
676 : offsave);
677 2977 : lenexp = fold_convert_loc (loc, ssizetype, lenexp);
678 2977 : return fold_build3_loc (loc, COND_EXPR, ssizetype, condexp, lenexp,
679 2977 : build_zero_cst (ssizetype));
680 : }
681 :
682 : /* Offset from the beginning of the string in elements. */
683 754930 : 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 754930 : if (byteoff == 0)
688 : eltoff = 0;
689 754930 : else if (! tree_fits_uhwi_p (byteoff) || tree_to_uhwi (byteoff) % eltsize)
690 : eltoff = -1;
691 : else
692 753742 : 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 754930 : if (eltoff < 0 || eltoff >= maxelts)
697 : {
698 : /* Suppress multiple warnings for propagated constant strings. */
699 3828 : if (only_value != 2
700 3828 : && !warning_suppressed_p (arg, OPT_Warray_bounds_)
701 7656 : && 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 3828 : 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 751102 : 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 751102 : unsigned len = string_length (ptr + eltoff * eltsize, eltsize,
724 751102 : 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 751102 : if (len >= maxelts - eltoff)
730 : {
731 83460 : data->decl = decl;
732 83460 : data->off = byteoff;
733 83460 : data->minlen = ssize_int (len);
734 83460 : return NULL_TREE;
735 : }
736 :
737 667642 : 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 274017 : c_readstr (const char *str, fixed_size_mode mode,
748 : bool null_terminated_p/*=true*/)
749 : {
750 274017 : auto_vec<target_unit, MAX_BITSIZE_MODE_ANY_INT / BITS_PER_UNIT> bytes;
751 :
752 548034 : bytes.reserve (GET_MODE_SIZE (mode));
753 :
754 274017 : target_unit ch = 1;
755 4478880 : for (unsigned int i = 0; i < GET_MODE_SIZE (mode); ++i)
756 : {
757 1965423 : if (ch || !null_terminated_p)
758 1881935 : ch = (unsigned char) str[i];
759 1965423 : bytes.quick_push (ch);
760 : }
761 :
762 274017 : return native_decode_rtx (mode, bytes, 0);
763 274017 : }
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 53049 : target_char_cast (tree cst, char *p)
771 : {
772 53049 : unsigned HOST_WIDE_INT val, hostval;
773 :
774 53049 : 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 53049 : val = TREE_INT_CST_LOW (cst);
780 :
781 53049 : if (CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT)
782 53049 : val &= (HOST_WIDE_INT_1U << CHAR_TYPE_SIZE) - 1;
783 :
784 53049 : hostval = val;
785 53049 : if (HOST_BITS_PER_CHAR < HOST_BITS_PER_WIDE_INT)
786 53049 : hostval &= (HOST_WIDE_INT_1U << HOST_BITS_PER_CHAR) - 1;
787 :
788 53049 : if (val != hostval)
789 : return 1;
790 :
791 53049 : *p = hostval;
792 53049 : 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 1061260 : builtin_save_expr (tree exp)
801 : {
802 1061260 : if (TREE_CODE (exp) == SSA_NAME
803 898485 : || (TREE_ADDRESSABLE (exp) == 0
804 898293 : && (TREE_CODE (exp) == PARM_DECL
805 399148 : || (VAR_P (exp) && !TREE_STATIC (exp)))))
806 : return exp;
807 :
808 397339 : 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 15922 : expand_builtin_return_addr (enum built_in_function fndecl_code, int count)
817 : {
818 15922 : int i;
819 15922 : rtx tem = INITIAL_FRAME_ADDRESS_RTX;
820 15922 : 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 15922 : if (count == 0 && fndecl_code == BUILT_IN_RETURN_ADDRESS)
832 4331 : tem = frame_pointer_rtx;
833 : else
834 : {
835 11591 : tem = hard_frame_pointer_rtx;
836 :
837 : /* Tell reload not to eliminate the frame pointer. */
838 11591 : crtl->accesses_prior_frames = 1;
839 : }
840 : }
841 :
842 15922 : 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 51798 : 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 15922 : 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 7400 : 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 5171 : 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 construct a nonlocal goto handler. */
932 :
933 : void
934 1345 : expand_builtin_setjmp_receiver (rtx receiver_label)
935 : {
936 1345 : 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 1345 : 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 1345 : chain = rtx_for_static_chain (current_function_decl, true);
945 1345 : if (chain && REG_P (chain))
946 1 : emit_clobber (chain);
947 :
948 1345 : 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 2690 : for (i = 0; i < ARRAY_SIZE (elim_regs); i++)
959 2690 : if (elim_regs[i].from == ARG_POINTER_REGNUM
960 2690 : && elim_regs[i].to == HARD_FRAME_POINTER_REGNUM)
961 : break;
962 :
963 1345 : 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 1345 : if (receiver_label != NULL && targetm.have_builtin_setjmp_receiver ())
973 0 : emit_insn (targetm.gen_builtin_setjmp_receiver (receiver_label));
974 1345 : 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 1345 : emit_insn (gen_blockage ());
983 1345 : }
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 1725688 : more_const_call_expr_args_p (const const_call_expr_arg_iterator *iter)
1080 : {
1081 1725688 : 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 487197 : validate_arglist (const_tree callexpr, ...)
1091 : {
1092 487197 : enum tree_code code;
1093 487197 : bool res = 0;
1094 487197 : va_list ap;
1095 487197 : const_call_expr_arg_iterator iter;
1096 487197 : const_tree arg;
1097 :
1098 487197 : va_start (ap, callexpr);
1099 487197 : init_const_call_expr_arg_iterator (callexpr, &iter);
1100 :
1101 : /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1102 487197 : tree fn = CALL_EXPR_FN (callexpr);
1103 487197 : bitmap argmap = get_nonnull_args (TREE_TYPE (TREE_TYPE (fn)));
1104 :
1105 487197 : for (unsigned argno = 1; ; ++argno)
1106 : {
1107 1692604 : code = (enum tree_code) va_arg (ap, int);
1108 :
1109 1692604 : switch (code)
1110 : {
1111 2041 : case 0:
1112 : /* This signifies an ellipses, any further arguments are all ok. */
1113 2041 : res = true;
1114 2041 : goto end;
1115 484923 : case VOID_TYPE:
1116 : /* This signifies an endlink, if no arguments remain, return
1117 : true, otherwise return false. */
1118 484923 : res = !more_const_call_expr_args_p (&iter);
1119 484923 : goto end;
1120 801094 : 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 801094 : if (argmap
1125 801094 : && (bitmap_empty_p (argmap) || bitmap_bit_p (argmap, argno)))
1126 : {
1127 280658 : arg = next_const_call_expr_arg (&iter);
1128 280658 : if (!validate_arg (arg, code) || integer_zerop (arg))
1129 59 : goto end;
1130 : break;
1131 : }
1132 : /* FALLTHRU */
1133 924982 : 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 924982 : arg = next_const_call_expr_arg (&iter);
1138 924982 : 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 487197 : end: ;
1147 487197 : va_end (ap);
1148 :
1149 487197 : BITMAP_FREE (argmap);
1150 :
1151 487197 : if (res)
1152 486964 : for (tree attrs = TYPE_ATTRIBUTES (TREE_TYPE (TREE_TYPE (fn)));
1153 692797 : (attrs = lookup_attribute ("nonnull_if_nonzero", attrs));
1154 205833 : attrs = TREE_CHAIN (attrs))
1155 : {
1156 205855 : tree args = TREE_VALUE (attrs);
1157 205855 : unsigned int idx = TREE_INT_CST_LOW (TREE_VALUE (args)) - 1;
1158 205855 : unsigned int idx2
1159 205855 : = TREE_INT_CST_LOW (TREE_VALUE (TREE_CHAIN (args))) - 1;
1160 205855 : unsigned int idx3 = idx2;
1161 205855 : if (tree chain2 = TREE_CHAIN (TREE_CHAIN (args)))
1162 0 : idx3 = TREE_INT_CST_LOW (TREE_VALUE (chain2)) - 1;
1163 205855 : if (idx < (unsigned) call_expr_nargs (callexpr)
1164 205855 : && idx2 < (unsigned) call_expr_nargs (callexpr)
1165 205855 : && idx3 < (unsigned) call_expr_nargs (callexpr)
1166 205855 : && POINTER_TYPE_P (TREE_TYPE (CALL_EXPR_ARG (callexpr, idx)))
1167 205855 : && integer_zerop (CALL_EXPR_ARG (callexpr, idx))
1168 87 : && INTEGRAL_TYPE_P (TREE_TYPE (CALL_EXPR_ARG (callexpr, idx2)))
1169 87 : && integer_nonzerop (CALL_EXPR_ARG (callexpr, idx2))
1170 22 : && INTEGRAL_TYPE_P (TREE_TYPE (CALL_EXPR_ARG (callexpr, idx3)))
1171 205877 : && 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 512 : expand_builtin_nonlocal_goto (tree exp)
1183 : {
1184 512 : tree t_label, t_save_area;
1185 512 : rtx r_label, r_save_area, r_fp, r_sp;
1186 512 : rtx_insn *insn;
1187 :
1188 512 : if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
1189 : return NULL_RTX;
1190 :
1191 512 : t_label = CALL_EXPR_ARG (exp, 0);
1192 512 : t_save_area = CALL_EXPR_ARG (exp, 1);
1193 :
1194 512 : r_label = expand_normal (t_label);
1195 512 : r_label = convert_memory_address (Pmode, r_label);
1196 512 : r_save_area = expand_normal (t_save_area);
1197 512 : 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 512 : r_save_area = copy_to_reg (r_save_area);
1201 512 : r_fp = gen_rtx_MEM (Pmode, r_save_area);
1202 512 : r_sp = gen_rtx_MEM (STACK_SAVEAREA_MODE (SAVE_NONLOCAL),
1203 : plus_constant (Pmode, r_save_area,
1204 1024 : GET_MODE_SIZE (Pmode)));
1205 :
1206 512 : crtl->has_nonlocal_goto = 1;
1207 :
1208 : /* ??? We no longer need to pass the static chain value, afaik. */
1209 512 : 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 512 : emit_clobber (gen_rtx_MEM (BLKmode, gen_rtx_SCRATCH (VOIDmode)));
1214 512 : emit_clobber (gen_rtx_MEM (BLKmode, hard_frame_pointer_rtx));
1215 :
1216 512 : 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 512 : r_fp = copy_to_reg (r_fp);
1221 512 : emit_stack_restore (SAVE_NONLOCAL, r_sp);
1222 :
1223 : /* Ensure the frame pointer move is not optimized. */
1224 512 : emit_insn (gen_blockage ());
1225 512 : emit_clobber (hard_frame_pointer_rtx);
1226 512 : emit_clobber (frame_pointer_rtx);
1227 512 : 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 512 : emit_use (hard_frame_pointer_rtx);
1232 512 : 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 512 : 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 512 : emit_indirect_jump (r_label);
1248 : }
1249 :
1250 : /* Search backwards to the jump insn and mark it as a
1251 : non-local goto. */
1252 1024 : for (insn = get_last_insn (); insn; insn = PREV_INSN (insn))
1253 : {
1254 1024 : if (JUMP_P (insn))
1255 : {
1256 512 : add_reg_note (insn, REG_NON_LOCAL_GOTO, const0_rtx);
1257 512 : break;
1258 : }
1259 512 : else if (CALL_P (insn))
1260 : break;
1261 : }
1262 :
1263 512 : 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 2041 : expand_builtin_prefetch (tree exp)
1292 : {
1293 2041 : tree arg0, arg1, arg2;
1294 2041 : int nargs;
1295 2041 : rtx op0, op1, op2;
1296 :
1297 2041 : if (!validate_arglist (exp, POINTER_TYPE, 0))
1298 : return;
1299 :
1300 2041 : 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 2041 : nargs = call_expr_nargs (exp);
1306 2041 : 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 2137 : op0 = expand_expr (arg0, NULL_RTX, Pmode, EXPAND_NORMAL);
1311 :
1312 : /* Argument 1 (read/write flag) must be a compile-time constant int. */
1313 2041 : if (arg1 == NULL_TREE)
1314 40 : 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 2041 : 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 2041 : if (arg2 == NULL_TREE)
1332 65 : 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 2041 : 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 2041 : if (targetm.have_prefetch ())
1348 : {
1349 2041 : class expand_operand ops[3];
1350 :
1351 2041 : create_address_operand (&ops[0], op0);
1352 2041 : create_integer_operand (&ops[1], INTVAL (op1));
1353 2041 : create_integer_operand (&ops[2], INTVAL (op2));
1354 2041 : if (maybe_expand_insn (targetm.code_for_prefetch, 3, ops))
1355 2041 : 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 734677 : get_memory_rtx (tree exp, tree len)
1371 : {
1372 734677 : tree orig_exp = exp, base;
1373 734677 : rtx addr, mem;
1374 :
1375 734677 : 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 734677 : if (TREE_CODE (exp) == SAVE_EXPR && !SAVE_EXPR_RESOLVED_P (exp))
1381 1468 : exp = TREE_OPERAND (exp, 0);
1382 :
1383 734677 : addr = expand_expr (orig_exp, NULL_RTX, ptr_mode, EXPAND_NORMAL);
1384 734677 : 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 1469354 : while (CONVERT_EXPR_P (exp)
1389 734680 : && 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 734677 : 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 734677 : if (is_gimple_mem_ref_addr (TREE_OPERAND (exp, 0)))
1404 734665 : 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 734677 : set_mem_alias_set (mem, 0);
1424 734677 : 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 2130 : fixed_size_mode mode = targetm.calls.get_raw_result_mode (regno);
1513 :
1514 2130 : if (mode != VOIDmode)
1515 : {
1516 2130 : align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1517 2130 : if (size % align != 0)
1518 : size = CEIL (size, align) * align;
1519 2130 : size += GET_MODE_SIZE (mode);
1520 2130 : apply_result_mode[regno] = mode;
1521 : }
1522 : else
1523 0 : apply_result_mode[regno] = as_a <fixed_size_mode> (VOIDmode);
1524 : }
1525 : else
1526 30530 : 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 2898 : align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1556 2898 : if (size % align != 0)
1557 0 : size = CEIL (size, align) * align;
1558 2898 : reg = gen_rtx_REG (mode, savep ? regno : INCOMING_REGNO (regno));
1559 2898 : mem = adjust_address (result, mode, size);
1560 5796 : savevec[nelts++] = (savep
1561 5796 : ? gen_rtx_SET (mem, reg)
1562 0 : : gen_rtx_SET (reg, mem));
1563 5796 : 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 4834 : for (rtx_insn *insn = seq; insn; insn = NEXT_INSN (insn))
1786 4351 : 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 2274 : align = GET_MODE_ALIGNMENT (mode) / BITS_PER_UNIT;
1863 2274 : if (size % align != 0)
1864 7 : size = CEIL (size, align) * align;
1865 2274 : reg = gen_rtx_REG (mode, INCOMING_REGNO (regno));
1866 2274 : emit_move_insn (reg, adjust_address (result, mode, size));
1867 :
1868 2274 : push_to_sequence (call_fusage);
1869 2274 : emit_use (reg);
1870 2274 : call_fusage = end_sequence ();
1871 4548 : 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 2443 : type_to_class (tree type)
1886 : {
1887 2443 : switch (TREE_CODE (type))
1888 : {
1889 : case VOID_TYPE: return void_type_class;
1890 935 : 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 1021 : 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 584887 : mathfn_built_in_2 (tree type, combined_fn fn)
1958 : {
1959 584887 : tree mtype;
1960 584887 : built_in_function fcode, fcodef, fcodel;
1961 584887 : built_in_function fcodef16 = END_BUILTINS;
1962 584887 : built_in_function fcodef32 = END_BUILTINS;
1963 584887 : built_in_function fcodef64 = END_BUILTINS;
1964 584887 : built_in_function fcodef128 = END_BUILTINS;
1965 584887 : built_in_function fcodef32x = END_BUILTINS;
1966 584887 : built_in_function fcodef64x = END_BUILTINS;
1967 584887 : 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 584887 : 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 584823 : SEQ_OF_CASE_MATHFN
2067 :
2068 : default:
2069 : return END_BUILTINS;
2070 : }
2071 :
2072 584887 : mtype = TYPE_MAIN_VARIANT (type);
2073 584887 : if (mtype == double_type_node)
2074 : return fcode;
2075 547841 : else if (mtype == float_type_node)
2076 : return fcodef;
2077 506321 : else if (mtype == long_double_type_node)
2078 : return fcodel;
2079 474952 : else if (mtype == float16_type_node)
2080 : return fcodef16;
2081 474904 : else if (mtype == float32_type_node)
2082 : return fcodef32;
2083 474904 : else if (mtype == float64_type_node)
2084 : return fcodef64;
2085 474904 : else if (mtype == float128_type_node)
2086 : return fcodef128;
2087 469131 : else if (mtype == float32x_type_node)
2088 : return fcodef32x;
2089 469131 : else if (mtype == float64x_type_node)
2090 : return fcodef64x;
2091 469131 : else if (mtype == float128x_type_node)
2092 : return fcodef128x;
2093 : else
2094 469131 : 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 584742 : mathfn_built_in_1 (tree type, combined_fn fn, bool implicit_p)
2108 : {
2109 584742 : built_in_function fcode2 = mathfn_built_in_2 (type, fn);
2110 584742 : if (fcode2 == END_BUILTINS)
2111 : return NULL_TREE;
2112 :
2113 111963 : if (implicit_p && !builtin_decl_implicit_p (fcode2))
2114 : return NULL_TREE;
2115 :
2116 109741 : return builtin_decl_explicit (fcode2);
2117 : }
2118 :
2119 : /* Like mathfn_built_in_1, but always use the implicit array. */
2120 :
2121 : tree
2122 276 : mathfn_built_in (tree type, combined_fn fn)
2123 : {
2124 276 : 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 584243 : mathfn_built_in (tree type, enum built_in_function fn)
2140 : {
2141 584243 : 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 1254 : 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 1254 : switch (fn)
2186 : {
2187 1252 : 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 13774356 : associated_internal_fn (built_in_function fn, tree return_type)
2208 : {
2209 13774356 : 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 19543 : CASE_FLT_FN (BUILT_IN_SCALBN):
2227 19543 : CASE_FLT_FN (BUILT_IN_SCALBLN):
2228 19543 : if (REAL_MODE_FORMAT (TYPE_MODE (return_type))->b == 2)
2229 : return IFN_LDEXP;
2230 : return IFN_LAST;
2231 123 : case BUILT_IN_CRC8_DATA8:
2232 123 : case BUILT_IN_CRC16_DATA8:
2233 123 : case BUILT_IN_CRC16_DATA16:
2234 123 : case BUILT_IN_CRC32_DATA8:
2235 123 : case BUILT_IN_CRC32_DATA16:
2236 123 : case BUILT_IN_CRC32_DATA32:
2237 123 : case BUILT_IN_CRC64_DATA8:
2238 123 : case BUILT_IN_CRC64_DATA16:
2239 123 : case BUILT_IN_CRC64_DATA32:
2240 123 : case BUILT_IN_CRC64_DATA64:
2241 123 : return IFN_CRC;
2242 176 : case BUILT_IN_REV_CRC8_DATA8:
2243 176 : case BUILT_IN_REV_CRC16_DATA8:
2244 176 : case BUILT_IN_REV_CRC16_DATA16:
2245 176 : case BUILT_IN_REV_CRC32_DATA8:
2246 176 : case BUILT_IN_REV_CRC32_DATA16:
2247 176 : case BUILT_IN_REV_CRC32_DATA32:
2248 176 : case BUILT_IN_REV_CRC64_DATA8:
2249 176 : case BUILT_IN_REV_CRC64_DATA16:
2250 176 : case BUILT_IN_REV_CRC64_DATA32:
2251 176 : case BUILT_IN_REV_CRC64_DATA64:
2252 176 : 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 633391 : associated_internal_fn (tree fndecl)
2265 : {
2266 633391 : gcc_checking_assert (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL);
2267 633391 : return associated_internal_fn (DECL_FUNCTION_CODE (fndecl),
2268 633391 : 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 32960305 : associated_internal_fn (combined_fn cfn, tree return_type)
2280 : {
2281 32960305 : if (internal_fn_p (cfn))
2282 19819340 : return as_internal_fn (cfn);
2283 13140965 : 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 858066 : replacement_internal_fn (gcall *call)
2296 : {
2297 858066 : if (gimple_call_builtin_p (call, BUILT_IN_NORMAL))
2298 : {
2299 630692 : internal_fn ifn = associated_internal_fn (gimple_call_fndecl (call));
2300 630692 : if (ifn != IFN_LAST)
2301 : {
2302 57640 : tree_pair types = direct_internal_fn_types (ifn, call);
2303 57640 : optimization_type opt_type = bb_optimization_type (gimple_bb (call));
2304 57640 : if (direct_internal_fn_supported_p (ifn, types, opt_type))
2305 36283 : 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 368 : expand_builtin_mathfn_ternary (tree exp, rtx target, rtx subtarget)
2320 : {
2321 368 : optab builtin_optab;
2322 368 : rtx op0, op1, op2, result;
2323 368 : rtx_insn *insns;
2324 368 : tree fndecl = get_callee_fndecl (exp);
2325 368 : tree arg0, arg1, arg2;
2326 368 : machine_mode mode;
2327 :
2328 368 : if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, REAL_TYPE, VOID_TYPE))
2329 : return NULL_RTX;
2330 :
2331 368 : arg0 = CALL_EXPR_ARG (exp, 0);
2332 368 : arg1 = CALL_EXPR_ARG (exp, 1);
2333 368 : arg2 = CALL_EXPR_ARG (exp, 2);
2334 :
2335 368 : switch (DECL_FUNCTION_CODE (fndecl))
2336 : {
2337 368 : CASE_FLT_FN (BUILT_IN_FMA):
2338 368 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMA):
2339 368 : builtin_optab = fma_optab; break;
2340 0 : default:
2341 0 : gcc_unreachable ();
2342 : }
2343 :
2344 : /* Make a suitable register to place result in. */
2345 368 : mode = TYPE_MODE (TREE_TYPE (exp));
2346 :
2347 : /* Before working hard, check whether the instruction is available. */
2348 368 : 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 1010647 : interclass_mathfn_icode (tree arg, tree fndecl)
2491 : {
2492 1010647 : bool errno_set = false;
2493 1010647 : optab builtin_optab = unknown_optab;
2494 1010647 : machine_mode mode;
2495 :
2496 1010647 : 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 224415 : CASE_FLT_FN (BUILT_IN_ISINF):
2503 224415 : builtin_optab = isinf_optab;
2504 224415 : break;
2505 336331 : case BUILT_IN_ISFINITE:
2506 336331 : builtin_optab = isfinite_optab;
2507 336331 : break;
2508 222599 : case BUILT_IN_ISNORMAL:
2509 222599 : builtin_optab = isnormal_optab;
2510 222599 : break;
2511 225221 : CASE_FLT_FN (BUILT_IN_ISNAN):
2512 225221 : builtin_optab = isnan_optab;
2513 225221 : 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 1010647 : if (flag_errno_math && errno_set)
2532 : return CODE_FOR_nothing;
2533 :
2534 : /* Optab mode depends on the mode of the input argument. */
2535 1010647 : mode = TYPE_MODE (TREE_TYPE (arg));
2536 :
2537 1010647 : if (builtin_optab)
2538 1008570 : 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 164 : expand_builtin_cexpi (tree exp, rtx target)
2709 : {
2710 164 : tree fndecl = get_callee_fndecl (exp);
2711 164 : tree arg, type;
2712 164 : machine_mode mode;
2713 164 : rtx op0, op1, op2;
2714 164 : location_t loc = EXPR_LOCATION (exp);
2715 :
2716 164 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2717 : return NULL_RTX;
2718 :
2719 164 : arg = CALL_EXPR_ARG (exp, 0);
2720 164 : type = TREE_TYPE (arg);
2721 164 : 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 164 : 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 158 : else if (targetm.libc_has_function (function_sincos, type))
2737 : {
2738 158 : tree call, fn = NULL_TREE;
2739 158 : tree top1, top2;
2740 158 : rtx op1a, op2a;
2741 :
2742 158 : if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPIF)
2743 52 : fn = builtin_decl_explicit (BUILT_IN_SINCOSF);
2744 106 : else if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CEXPI)
2745 87 : 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 158 : op1 = assign_temp (TREE_TYPE (arg), 1, 1);
2752 158 : op2 = assign_temp (TREE_TYPE (arg), 1, 1);
2753 158 : op1a = copy_addr_to_reg (XEXP (op1, 0));
2754 158 : op2a = copy_addr_to_reg (XEXP (op2, 0));
2755 158 : top1 = make_tree (build_pointer_type (TREE_TYPE (arg)), op1a);
2756 158 : top2 = make_tree (build_pointer_type (TREE_TYPE (arg)), op2a);
2757 :
2758 : /* Make sure not to fold the sincos call again. */
2759 158 : call = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn);
2760 158 : 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 328 : return expand_expr (build2 (COMPLEX_EXPR, build_complex_type (type),
2807 164 : make_tree (TREE_TYPE (arg), op2),
2808 164 : make_tree (TREE_TYPE (arg), op1)),
2809 164 : 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 135475 : build_call_nofold_loc (location_t loc, tree fndecl, int n, ...)
2819 : {
2820 135475 : va_list ap;
2821 135475 : tree fntype = TREE_TYPE (fndecl);
2822 135475 : tree fn = build1 (ADDR_EXPR, build_pointer_type (fntype), fndecl);
2823 :
2824 135475 : va_start (ap, n);
2825 135475 : fn = build_call_valist (TREE_TYPE (fntype), fn, n, ap);
2826 135475 : va_end (ap);
2827 135475 : SET_EXPR_LOCATION (fn, loc);
2828 135475 : 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 784 : expand_builtin_issignaling (tree exp, rtx target)
2837 : {
2838 784 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
2839 : return NULL_RTX;
2840 :
2841 784 : tree arg = CALL_EXPR_ARG (exp, 0);
2842 784 : scalar_float_mode fmode = SCALAR_FLOAT_TYPE_MODE (TREE_TYPE (arg));
2843 784 : const struct real_format *fmt = REAL_MODE_FORMAT (fmode);
2844 :
2845 : /* Expand the argument yielding a RTX expression. */
2846 784 : 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 784 : 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 784 : enum insn_code icode = optab_handler (issignaling_optab, fmode);
2864 784 : if (icode != CODE_FOR_nothing)
2865 : {
2866 142 : rtx_insn *last = get_last_insn ();
2867 142 : rtx this_target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
2868 142 : if (maybe_emit_unop_insn (icode, this_target, temp, UNKNOWN))
2869 : return this_target;
2870 0 : delete_insns_since (last);
2871 : }
2872 :
2873 642 : 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 579 : gcc_assert (FLOAT_WORDS_BIG_ENDIAN == WORDS_BIG_ENDIAN);
2933 579 : gcc_assert (fmt->signbit_ro > 0 && fmt->b == 2);
2934 4053 : gcc_assert (MODE_COMPOSITE_P (fmode)
2935 : || (fmt->pnan == fmt->p
2936 : && fmt->signbit_ro == fmt->signbit_rw));
2937 :
2938 579 : 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 479 : case 8: /* bfloat */
2948 479 : case 11: /* IEEE half */
2949 479 : case 24: /* IEEE single */
2950 479 : case 53: /* IEEE double or Intel extended with rounding to double */
2951 479 : if (fmt->p == 53 && fmt->signbit_ro == 79)
2952 0 : goto extended;
2953 479 : {
2954 479 : scalar_int_mode imode = int_mode_for_mode (fmode).require ();
2955 479 : temp = gen_lowpart (imode, temp);
2956 479 : rtx val = GEN_INT ((HOST_WIDE_INT_M1U << (fmt->p - 2))
2957 : & ~(HOST_WIDE_INT_M1U << fmt->signbit_ro));
2958 479 : if (fmt->qnan_msb_set)
2959 : {
2960 479 : rtx mask = GEN_INT (~(HOST_WIDE_INT_M1U << fmt->signbit_ro));
2961 479 : 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 479 : temp = expand_binop (imode, xor_optab, temp, bit,
2965 : NULL_RTX, 1, OPTAB_LIB_WIDEN);
2966 479 : temp = expand_binop (imode, and_optab, temp, mask,
2967 : NULL_RTX, 1, OPTAB_LIB_WIDEN);
2968 479 : 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 223 : expand_builtin_int_roundingfn (tree exp, rtx target)
3124 : {
3125 223 : convert_optab builtin_optab;
3126 223 : rtx op0, tmp;
3127 223 : rtx_insn *insns;
3128 223 : tree fndecl = get_callee_fndecl (exp);
3129 223 : enum built_in_function fallback_fn;
3130 223 : tree fallback_fndecl;
3131 223 : machine_mode mode;
3132 223 : tree arg;
3133 :
3134 223 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
3135 : return NULL_RTX;
3136 :
3137 223 : arg = CALL_EXPR_ARG (exp, 0);
3138 :
3139 223 : 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 112 : CASE_FLT_FN (BUILT_IN_IFLOOR):
3149 112 : CASE_FLT_FN (BUILT_IN_LFLOOR):
3150 112 : CASE_FLT_FN (BUILT_IN_LLFLOOR):
3151 112 : builtin_optab = lfloor_optab;
3152 112 : fallback_fn = BUILT_IN_FLOOR;
3153 112 : break;
3154 :
3155 0 : default:
3156 0 : gcc_unreachable ();
3157 : }
3158 :
3159 : /* Make a suitable register to place result in. */
3160 223 : mode = TYPE_MODE (TREE_TYPE (exp));
3161 :
3162 223 : 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 223 : CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
3168 :
3169 223 : op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
3170 :
3171 223 : start_sequence ();
3172 :
3173 : /* Compute into TARGET. */
3174 223 : if (expand_sfix_optab (target, op0, builtin_optab))
3175 : {
3176 : /* Output the entire sequence. */
3177 32 : insns = end_sequence ();
3178 32 : emit_insn (insns);
3179 32 : 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 588 : expand_builtin_int_roundingfn_2 (tree exp, rtx target)
3260 : {
3261 588 : convert_optab builtin_optab;
3262 588 : rtx op0;
3263 588 : rtx_insn *insns;
3264 588 : tree fndecl = get_callee_fndecl (exp);
3265 588 : tree arg;
3266 588 : machine_mode mode;
3267 588 : enum built_in_function fallback_fn = BUILT_IN_NONE;
3268 :
3269 588 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
3270 : return NULL_RTX;
3271 :
3272 488 : arg = CALL_EXPR_ARG (exp, 0);
3273 :
3274 488 : switch (DECL_FUNCTION_CODE (fndecl))
3275 : {
3276 4 : CASE_FLT_FN (BUILT_IN_IRINT):
3277 4 : 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 223 : CASE_FLT_FN (BUILT_IN_IROUND):
3285 223 : 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 488 : if (flag_errno_math && fallback_fn == BUILT_IN_NONE)
3298 : return NULL_RTX;
3299 :
3300 : /* Make a suitable register to place result in. */
3301 257 : mode = TYPE_MODE (TREE_TYPE (exp));
3302 :
3303 : /* There's no easy way to detect the case we need to set EDOM. */
3304 257 : if (!flag_errno_math)
3305 : {
3306 257 : 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 257 : CALL_EXPR_ARG (exp, 0) = arg = builtin_save_expr (arg);
3312 :
3313 257 : op0 = expand_expr (arg, NULL, VOIDmode, EXPAND_NORMAL);
3314 :
3315 257 : start_sequence ();
3316 :
3317 257 : if (expand_sfix_optab (result, op0, builtin_optab))
3318 : {
3319 : /* Output the entire sequence. */
3320 20 : insns = end_sequence ();
3321 20 : emit_insn (insns);
3322 20 : 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 237 : end_sequence ();
3329 : }
3330 :
3331 237 : 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 223 : tree fallback_fndecl = NULL_TREE;
3343 223 : if (tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (fndecl)))
3344 223 : fallback_fndecl
3345 223 : = mathfn_built_in_1 (TREE_VALUE (argtypes),
3346 : as_combined_fn (fallback_fn), 0);
3347 223 : 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 223 : exp = build_call_nofold_loc (EXPR_LOCATION (exp),
3354 : fallback_fndecl, 1, arg);
3355 :
3356 223 : target = expand_call (exp, NULL_RTX, target == const0_rtx);
3357 223 : target = maybe_emit_group_store (target, TREE_TYPE (exp));
3358 223 : 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 292 : expand_builtin_powi (tree exp, rtx target)
3372 : {
3373 292 : tree arg0, arg1;
3374 292 : rtx op0, op1;
3375 292 : machine_mode mode;
3376 292 : machine_mode mode2;
3377 :
3378 292 : if (! validate_arglist (exp, REAL_TYPE, INTEGER_TYPE, VOID_TYPE))
3379 : return NULL_RTX;
3380 :
3381 292 : arg0 = CALL_EXPR_ARG (exp, 0);
3382 292 : arg1 = CALL_EXPR_ARG (exp, 1);
3383 292 : 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 292 : mode2 = int_mode_for_size (INT_TYPE_SIZE, 0).require ();
3389 :
3390 292 : if (target == NULL_RTX)
3391 0 : target = gen_reg_rtx (mode);
3392 :
3393 292 : op0 = expand_expr (arg0, NULL_RTX, mode, EXPAND_NORMAL);
3394 292 : if (GET_MODE (op0) != mode)
3395 0 : op0 = convert_to_mode (mode, op0, 0);
3396 292 : op1 = expand_expr (arg1, NULL_RTX, mode2, EXPAND_NORMAL);
3397 292 : if (GET_MODE (op1) != mode2)
3398 52 : op1 = convert_to_mode (mode2, op1, 0);
3399 :
3400 292 : target = emit_library_call_value (optab_libfunc (powi_optab, mode),
3401 : target, LCT_CONST, mode,
3402 : op0, mode, op1, mode2);
3403 :
3404 292 : 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 13472 : expand_builtin_strlen (tree exp, rtx target,
3413 : machine_mode target_mode)
3414 : {
3415 13472 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
3416 : return NULL_RTX;
3417 :
3418 13452 : tree src = CALL_EXPR_ARG (exp, 0);
3419 :
3420 : /* If the length can be computed at compile-time, return it. */
3421 13452 : if (tree len = c_strlen (src, 0))
3422 127 : 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 13325 : tree len = c_strlen (src, 1);
3430 13325 : 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 13325 : 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 13325 : 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 13325 : FOR_EACH_MODE_FROM (insn_mode, target_mode)
3446 : {
3447 13325 : icode = optab_handler (strlen_optab, insn_mode);
3448 13325 : if (icode != CODE_FOR_nothing)
3449 : break;
3450 : }
3451 13325 : 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 13929 : 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 13325 : rtx_insn *before_strlen = get_last_insn ();
3462 :
3463 13325 : class expand_operand ops[4];
3464 13325 : create_output_operand (&ops[0], target, insn_mode);
3465 13325 : create_fixed_operand (&ops[1], gen_rtx_MEM (BLKmode, src_reg));
3466 13325 : create_integer_operand (&ops[2], 0);
3467 13325 : create_integer_operand (&ops[3], align);
3468 13325 : 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 645 : expand_builtin_strnlen (tree exp, rtx target, machine_mode target_mode)
3511 : {
3512 645 : if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3513 : return NULL_RTX;
3514 :
3515 636 : tree src = CALL_EXPR_ARG (exp, 0);
3516 636 : tree bound = CALL_EXPR_ARG (exp, 1);
3517 :
3518 636 : if (!bound)
3519 : return NULL_RTX;
3520 :
3521 636 : location_t loc = UNKNOWN_LOCATION;
3522 636 : if (EXPR_HAS_LOCATION (exp))
3523 636 : loc = EXPR_LOCATION (exp);
3524 :
3525 : /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
3526 : so these conversions aren't necessary. */
3527 636 : c_strlen_data lendata = { };
3528 636 : tree len = c_strlen (src, 0, &lendata, 1);
3529 636 : if (len)
3530 102 : len = fold_convert_loc (loc, TREE_TYPE (bound), len);
3531 :
3532 636 : if (TREE_CODE (bound) == INTEGER_CST)
3533 : {
3534 369 : 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 267 : if (TREE_CODE (bound) != SSA_NAME)
3542 : return NULL_RTX;
3543 :
3544 267 : wide_int min, max;
3545 267 : int_range_max r;
3546 534 : get_range_query (cfun)->range_of_expr (r, bound,
3547 : currently_expanding_gimple_stmt);
3548 267 : if (r.varying_p () || r.undefined_p ())
3549 : return NULL_RTX;
3550 162 : min = r.lower_bound ();
3551 162 : max = r.upper_bound ();
3552 :
3553 162 : if (!len || TREE_CODE (len) != INTEGER_CST)
3554 : {
3555 122 : bool exact;
3556 122 : lendata.decl = unterminated_array (src, &len, &exact);
3557 122 : if (!lendata.decl)
3558 102 : 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 267 : }
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 159026 : 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 159026 : const char *rep = (const char *) data;
3582 :
3583 159026 : 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 173896 : 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 173896 : if (CONST_INT_P (len_rtx))
3598 : {
3599 85521 : *min_size = *max_size = *probable_max_size = UINTVAL (len_rtx);
3600 85521 : return;
3601 : }
3602 : else
3603 : {
3604 88375 : wide_int min, max;
3605 88375 : enum value_range_kind range_type = VR_UNDEFINED;
3606 :
3607 : /* Determine bounds from the type. */
3608 88375 : if (tree_fits_uhwi_p (TYPE_MIN_VALUE (TREE_TYPE (len))))
3609 88374 : *min_size = tree_to_uhwi (TYPE_MIN_VALUE (TREE_TYPE (len)));
3610 : else
3611 1 : *min_size = 0;
3612 88375 : if (tree_fits_uhwi_p (TYPE_MAX_VALUE (TREE_TYPE (len))))
3613 176750 : *probable_max_size = *max_size
3614 88375 : = 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 88375 : if (TREE_CODE (len) == SSA_NAME)
3619 : {
3620 88375 : int_range_max r;
3621 88375 : tree tmin, tmax;
3622 88375 : gimple *cg = currently_expanding_gimple_stmt;
3623 176750 : get_range_query (cfun)->range_of_expr (r, len, cg);
3624 88375 : range_type = get_legacy_range (r, tmin, tmax);
3625 88375 : if (range_type != VR_UNDEFINED)
3626 : {
3627 88374 : min = wi::to_wide (tmin);
3628 88374 : max = wi::to_wide (tmax);
3629 : }
3630 88375 : }
3631 88375 : if (range_type == VR_RANGE)
3632 : {
3633 67848 : if (wi::fits_uhwi_p (min) && *min_size < min.to_uhwi ())
3634 53586 : *min_size = min.to_uhwi ();
3635 67848 : if (wi::fits_uhwi_p (max) && *max_size > max.to_uhwi ())
3636 61847 : *probable_max_size = *max_size = max.to_uhwi ();
3637 : }
3638 20527 : 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 3877 : if (!wi::leu_p (max, 1 << 30) && wi::fits_uhwi_p (min))
3650 3749 : *probable_max_size = min.to_uhwi () - 1;
3651 : }
3652 88375 : }
3653 88375 : 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 101054 : expand_builtin_memcpy (tree exp, rtx target)
3665 : {
3666 101054 : if (!validate_arglist (exp,
3667 : POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3668 : return NULL_RTX;
3669 :
3670 101036 : tree dest = CALL_EXPR_ARG (exp, 0);
3671 101036 : tree src = CALL_EXPR_ARG (exp, 1);
3672 101036 : tree len = CALL_EXPR_ARG (exp, 2);
3673 :
3674 101036 : return expand_builtin_memory_copy_args (dest, src, len, target, exp,
3675 101036 : /*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 16710 : expand_builtin_memmove (tree exp, rtx target)
3683 : {
3684 16710 : if (!validate_arglist (exp,
3685 : POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3686 : return NULL_RTX;
3687 :
3688 16695 : tree dest = CALL_EXPR_ARG (exp, 0);
3689 16695 : tree src = CALL_EXPR_ARG (exp, 1);
3690 16695 : tree len = CALL_EXPR_ARG (exp, 2);
3691 :
3692 16695 : return expand_builtin_memory_copy_args (dest, src, len, target, exp,
3693 16695 : /*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 1394 : expand_builtin_mempcpy (tree exp, rtx target)
3703 : {
3704 1394 : if (!validate_arglist (exp,
3705 : POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
3706 : return NULL_RTX;
3707 :
3708 1389 : tree dest = CALL_EXPR_ARG (exp, 0);
3709 1389 : tree src = CALL_EXPR_ARG (exp, 1);
3710 1389 : 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 1389 : return expand_builtin_mempcpy_args (dest, src, len,
3730 1389 : 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 119143 : 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 119143 : unsigned int src_align = get_pointer_alignment (src);
3744 119143 : unsigned int dest_align = get_pointer_alignment (dest);
3745 119143 : rtx dest_mem, src_mem, dest_addr, len_rtx;
3746 119143 : HOST_WIDE_INT expected_size = -1;
3747 119143 : unsigned int expected_align = 0;
3748 119143 : unsigned HOST_WIDE_INT min_size;
3749 119143 : unsigned HOST_WIDE_INT max_size;
3750 119143 : unsigned HOST_WIDE_INT probable_max_size;
3751 :
3752 119143 : bool is_move_done;
3753 :
3754 : /* If DEST is not a pointer type, call the normal function. */
3755 119143 : 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 119143 : if (src_align == 0)
3761 : return NULL_RTX;
3762 :
3763 119143 : if (currently_expanding_gimple_stmt)
3764 119143 : stringop_block_profile (currently_expanding_gimple_stmt,
3765 : &expected_align, &expected_size);
3766 :
3767 119143 : if (expected_align < dest_align)
3768 119121 : expected_align = dest_align;
3769 119143 : dest_mem = get_memory_rtx (dest, len);
3770 119143 : set_mem_align (dest_mem, dest_align);
3771 119143 : len_rtx = expand_normal (len);
3772 119143 : 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 119143 : unsigned HOST_WIDE_INT nbytes;
3778 119143 : 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 119143 : if (rep
3788 28481 : && CONST_INT_P (len_rtx)
3789 26895 : && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= nbytes
3790 145772 : && can_store_by_pieces (INTVAL (len_rtx), builtin_memcpy_read_str,
3791 : const_cast<char *> (rep),
3792 : dest_align, false))
3793 : {
3794 26147 : 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 26147 : dest_mem = force_operand (XEXP (dest_mem, 0), target);
3799 26147 : dest_mem = convert_memory_address (ptr_mode, dest_mem);
3800 26147 : return dest_mem;
3801 : }
3802 :
3803 92996 : src_mem = get_memory_rtx (src, len);
3804 92996 : set_mem_align (src_mem, src_align);
3805 :
3806 : /* Copy word part most expediently. */
3807 92996 : enum block_op_methods method = BLOCK_OP_NORMAL;
3808 92996 : if (CALL_EXPR_TAILCALL (exp)
3809 92996 : && (retmode == RETURN_BEGIN || target == const0_rtx))
3810 : method = BLOCK_OP_TAILCALL;
3811 92996 : bool use_mempcpy_call = (targetm.libc_has_fast_function (BUILT_IN_MEMPCPY)
3812 92996 : && retmode == RETURN_END
3813 92996 : && !might_overlap
3814 94070 : && target != const0_rtx);
3815 : if (use_mempcpy_call)
3816 92996 : method = BLOCK_OP_NO_LIBCALL_RET;
3817 92996 : 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 92996 : if (!is_move_done)
3827 : return NULL_RTX;
3828 :
3829 81852 : if (dest_addr == pc_rtx)
3830 : return NULL_RTX;
3831 :
3832 81852 : if (dest_addr == 0)
3833 : {
3834 33415 : dest_addr = force_operand (XEXP (dest_mem, 0), target);
3835 33415 : dest_addr = convert_memory_address (ptr_mode, dest_addr);
3836 : }
3837 :
3838 81852 : if (retmode != RETURN_BEGIN && target != const0_rtx)
3839 : {
3840 815 : dest_addr = gen_rtx_PLUS (ptr_mode, dest_addr, len_rtx);
3841 : /* stpcpy pointer to last byte. */
3842 815 : 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 1412 : expand_builtin_mempcpy_args (tree dest, tree src, tree len,
3851 : rtx target, tree orig_exp, memop_ret retmode)
3852 : {
3853 1389 : 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 2268 : expand_movstr (tree dest, tree src, rtx target, memop_ret retmode)
3864 : {
3865 2268 : class expand_operand ops[3];
3866 2268 : rtx dest_mem;
3867 2268 : rtx src_mem;
3868 :
3869 2268 : 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 1861 : expand_builtin_strcpy (tree exp, rtx target)
3910 : {
3911 1861 : if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
3912 : return NULL_RTX;
3913 :
3914 1846 : tree dest = CALL_EXPR_ARG (exp, 0);
3915 1846 : tree src = CALL_EXPR_ARG (exp, 1);
3916 :
3917 1846 : 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 1846 : expand_builtin_strcpy_args (tree, tree dest, tree src, rtx target)
3928 : {
3929 1846 : 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 9522 : builtin_strncpy_read_str (void *data, void *, HOST_WIDE_INT offset,
4038 : fixed_size_mode mode)
4039 : {
4040 9522 : const char *str = (const char *) data;
4041 :
4042 9522 : if ((unsigned HOST_WIDE_INT) offset > strlen (str))
4043 260 : return const0_rtx;
4044 :
4045 9262 : 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 108 : check_strncat_sizes (tree exp, tree objsize)
4054 : {
4055 108 : tree dest = CALL_EXPR_ARG (exp, 0);
4056 108 : tree src = CALL_EXPR_ARG (exp, 1);
4057 108 : tree maxread = CALL_EXPR_ARG (exp, 2);
4058 :
4059 : /* Try to determine the range of lengths that the source expression
4060 : refers to. */
4061 108 : c_strlen_data lendata = { };
4062 108 : 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 108 : access_data data (nullptr, exp, access_read_write, maxread, true);
4068 108 : 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 108 : tree srclen = (lendata.minlen
4078 108 : ? 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 55 : if (tree_fits_uhwi_p (maxread) && tree_fits_uhwi_p (objsize)
4086 155 : && 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 85 : if (!srclen
4097 85 : || (maxread && tree_fits_uhwi_p (maxread)
4098 32 : && tree_fits_uhwi_p (srclen)
4099 32 : && 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 85 : return check_access (exp, /*dstwrite=*/NULL_TREE, maxread, srclen,
4105 85 : 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 2177 : expand_builtin_strncpy (tree exp, rtx target)
4113 : {
4114 2177 : location_t loc = EXPR_LOCATION (exp);
4115 :
4116 2177 : if (!validate_arglist (exp,
4117 : POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4118 : return NULL_RTX;
4119 2165 : tree dest = CALL_EXPR_ARG (exp, 0);
4120 2165 : tree src = CALL_EXPR_ARG (exp, 1);
4121 : /* The number of bytes to write (not the maximum). */
4122 2165 : tree len = CALL_EXPR_ARG (exp, 2);
4123 :
4124 : /* The length of the source sequence. */
4125 2165 : tree slen = c_strlen (src, 1);
4126 :
4127 : /* We must be passed a constant len and src parameter. */
4128 2165 : 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 234209 : gen_memset_value_from_prev (by_pieces_prev *prev, fixed_size_mode mode)
4167 : {
4168 234209 : rtx target = nullptr;
4169 234209 : if (prev != nullptr && prev->data != nullptr)
4170 : {
4171 : /* Use the previous data in the same mode. */
4172 130365 : if (prev->mode == mode)
4173 234209 : return prev->data;
4174 :
4175 30650 : 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 30650 : if (VECTOR_MODE_P (prev_mode) && mode == QImode)
4180 : return target;
4181 :
4182 30349 : rtx prev_rtx = prev->data;
4183 :
4184 30349 : if (REG_P (prev_rtx)
4185 22324 : && HARD_REGISTER_P (prev_rtx)
4186 30349 : && 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 30349 : 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 232973 : builtin_memset_read_str (void *data, void *prev,
4245 : HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
4246 : fixed_size_mode mode)
4247 : {
4248 232973 : const char *c = (const char *) data;
4249 232973 : unsigned int size = GET_MODE_SIZE (mode);
4250 :
4251 232973 : rtx target = gen_memset_value_from_prev ((by_pieces_prev *) prev,
4252 : mode);
4253 232973 : if (target != nullptr)
4254 : return target;
4255 103443 : rtx src = gen_int_mode (*c, QImode);
4256 :
4257 103443 : if (VECTOR_MODE_P (mode))
4258 : {
4259 148220 : gcc_assert (GET_MODE_INNER (mode) == QImode);
4260 :
4261 74110 : rtx const_vec = gen_const_vec_duplicate (mode, src);
4262 74110 : 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 55444 : target = gen_reg_rtx (mode);
4268 55444 : emit_move_insn (target, const_vec);
4269 55444 : return target;
4270 : }
4271 :
4272 29333 : char *p = XALLOCAVEC (char, size);
4273 :
4274 29333 : memset (p, *c, size);
4275 :
4276 29333 : 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 1414 : builtin_memset_gen_str (void *data, void *prev,
4287 : HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
4288 : fixed_size_mode mode)
4289 : {
4290 1414 : rtx target, coeff;
4291 1414 : size_t size;
4292 1414 : char *p;
4293 :
4294 1414 : size = GET_MODE_SIZE (mode);
4295 1414 : if (size == 1)
4296 : return (rtx) data;
4297 :
4298 1236 : target = gen_memset_value_from_prev ((by_pieces_prev *) prev, mode);
4299 1236 : if (target != nullptr)
4300 : return target;
4301 :
4302 702 : if (VECTOR_MODE_P (mode))
4303 : {
4304 350 : 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 175 : insn_code icode = optab_handler (vec_duplicate_optab, mode);
4309 :
4310 175 : target = gen_reg_rtx (mode);
4311 175 : class expand_operand ops[2];
4312 175 : create_output_operand (&ops[0], target, mode);
4313 175 : create_input_operand (&ops[1], (rtx) data, QImode);
4314 175 : expand_insn (icode, 2, ops);
4315 175 : if (!rtx_equal_p (target, ops[0].value))
4316 0 : emit_move_insn (target, ops[0].value);
4317 :
4318 175 : return target;
4319 : }
4320 :
4321 527 : p = XALLOCAVEC (char, size);
4322 527 : memset (p, 1, size);
4323 527 : coeff = c_readstr (p, mode);
4324 :
4325 527 : target = convert_to_mode (mode, (rtx) data, 1);
4326 527 : target = expand_mult (mode, target, coeff, NULL_RTX, 1);
4327 527 : 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 54762 : expand_builtin_memset (tree exp, rtx target, machine_mode mode)
4337 : {
4338 54762 : if (!validate_arglist (exp,
4339 : POINTER_TYPE, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
4340 : return NULL_RTX;
4341 :
4342 54753 : tree dest = CALL_EXPR_ARG (exp, 0);
4343 54753 : tree val = CALL_EXPR_ARG (exp, 1);
4344 54753 : tree len = CALL_EXPR_ARG (exp, 2);
4345 :
4346 54753 : 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 23146 : 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 23146 : if (bits
4361 23146 : && !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 1121 : 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 21446 : 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 21446 : int max_bits = floor_log2 (max_len);
4403 21446 : int min_bits = floor_log2 (min_len);
4404 21446 : int sctz_len = ctz_len;
4405 :
4406 21446 : gcc_checking_assert (sctz_len >= 0);
4407 :
4408 21446 : if (val)
4409 622 : 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 21446 : int tst_bits = (max_bits != min_bits ? max_bits
4415 9801 : : floor_log2 (max_len ^ min_len));
4416 :
4417 : /* Save the pre-blksize values. */
4418 21446 : int orig_max_bits = max_bits;
4419 21446 : 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 21446 : unsigned HOST_WIDE_INT blksize;
4428 21446 : if (max_len > min_len)
4429 : {
4430 11666 : unsigned HOST_WIDE_INT alrng = MAX (HOST_WIDE_INT_1U << ctz_len,
4431 : align / BITS_PER_UNIT);
4432 11666 : blksize = max_len - (HOST_WIDE_INT_1U << tst_bits) + alrng;
4433 11666 : blksize &= ~(alrng - 1);
4434 : }
4435 9780 : 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 21445 : if (min_len >= blksize
4441 : /* ??? Maybe try smaller fixed-prefix blksizes before
4442 : punting? */
4443 21445 : && can_store_by_pieces (blksize, builtin_memset_read_str,
4444 : &valc, align, true))
4445 : {
4446 281 : min_len -= blksize;
4447 281 : min_bits = floor_log2 (min_len);
4448 281 : max_len -= blksize;
4449 281 : max_bits = floor_log2 (max_len);
4450 :
4451 281 : tst_bits = (max_bits != min_bits ? max_bits
4452 174 : : 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 21445 : unsigned HOST_WIDE_INT xlenest = blksize;
4461 21445 : if (max_bits >= 0)
4462 21271 : xlenest += ((HOST_WIDE_INT_1U << max_bits) * 2
4463 21271 : - (HOST_WIDE_INT_1U << ctz_len));
4464 21445 : bool max_loop = false;
4465 21445 : 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 21445 : if (blksize > xlenest
4470 21445 : || !can_store_by_multiple_pieces (xlenest - blksize,
4471 : builtin_memset_read_str,
4472 : &valc, align, true, blksize))
4473 : {
4474 21271 : 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 281 : by_pieces_constfn constfun;
4538 281 : void *constfundata;
4539 281 : 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 281 : rtx ptr = copy_addr_to_reg (XEXP (to, 0));
4552 281 : rtx rem = copy_to_mode_reg (ptr_mode, convert_to_mode (ptr_mode, len, 0));
4553 281 : to = replace_equiv_address (to, ptr);
4554 281 : set_mem_align (to, align);
4555 :
4556 281 : if (blksize)
4557 : {
4558 366 : to = store_by_pieces (to, blksize,
4559 : constfun, constfundata,
4560 : align, true,
4561 : max_len != 0 ? RETURN_END : RETURN_BEGIN);
4562 193 : 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 54753 : expand_builtin_memset_args (tree dest, tree val, tree len,
4665 : rtx target, machine_mode mode, tree orig_exp)
4666 : {
4667 54753 : tree fndecl, fn;
4668 54753 : enum built_in_function fcode;
4669 54753 : machine_mode val_mode;
4670 54753 : char c;
4671 54753 : unsigned int dest_align;
4672 54753 : rtx dest_mem, dest_addr, len_rtx;
4673 54753 : HOST_WIDE_INT expected_size = -1;
4674 54753 : unsigned int expected_align = 0;
4675 54753 : unsigned HOST_WIDE_INT min_size;
4676 54753 : unsigned HOST_WIDE_INT max_size;
4677 54753 : unsigned HOST_WIDE_INT probable_max_size;
4678 :
4679 54753 : dest_align = get_pointer_alignment (dest);
4680 :
4681 : /* If DEST is not a pointer type, don't do this operation in-line. */
4682 54753 : if (dest_align == 0)
4683 : return NULL_RTX;
4684 :
4685 54753 : if (currently_expanding_gimple_stmt)
4686 54753 : stringop_block_profile (currently_expanding_gimple_stmt,
4687 : &expected_align, &expected_size);
4688 :
4689 54753 : if (expected_align < dest_align)
4690 54745 : expected_align = dest_align;
4691 :
4692 : /* If the LEN parameter is zero, return DEST. */
4693 54753 : 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 54753 : dest = builtin_save_expr (dest);
4702 54753 : val = builtin_save_expr (val);
4703 54753 : len = builtin_save_expr (len);
4704 :
4705 54753 : len_rtx = expand_normal (len);
4706 54753 : determine_block_size (len, len_rtx, &min_size, &max_size,
4707 : &probable_max_size);
4708 54753 : dest_mem = get_memory_rtx (dest, len);
4709 54753 : val_mode = TYPE_MODE (unsigned_char_type_node);
4710 :
4711 54753 : if (TREE_CODE (val) != INTEGER_CST
4712 54753 : || target_char_cast (val, &c))
4713 : {
4714 1704 : rtx val_rtx;
4715 :
4716 1704 : val_rtx = expand_normal (val);
4717 1704 : 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 1704 : c = 1;
4723 1704 : if (tree_fits_uhwi_p (len)
4724 1704 : && can_store_by_pieces (tree_to_uhwi (len),
4725 : builtin_memset_read_str, &c, dest_align,
4726 : true))
4727 : {
4728 745 : val_rtx = force_reg (val_mode, val_rtx);
4729 745 : store_by_pieces (dest_mem, tree_to_uhwi (len),
4730 : builtin_memset_gen_str, val_rtx, dest_align,
4731 : true, RETURN_BEGIN);
4732 : }
4733 959 : 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 959 : && !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 621 : goto do_libcall;
4743 :
4744 1083 : dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
4745 1083 : dest_mem = convert_memory_address (ptr_mode, dest_mem);
4746 1083 : return dest_mem;
4747 : }
4748 :
4749 53049 : if (c)
4750 : {
4751 12275 : if (tree_fits_uhwi_p (len)
4752 12275 : && can_store_by_pieces (tree_to_uhwi (len),
4753 : builtin_memset_read_str, &c, dest_align,
4754 : true))
4755 5421 : store_by_pieces (dest_mem, tree_to_uhwi (len),
4756 : builtin_memset_read_str, &c, dest_align, true,
4757 : RETURN_BEGIN);
4758 8569 : else if (!set_storage_via_setmem (dest_mem, len_rtx,
4759 6854 : gen_int_mode (c, val_mode),
4760 : dest_align, expected_align,
4761 : expected_size, min_size, max_size,
4762 : probable_max_size)
4763 6854 : && !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 5139 : goto do_libcall;
4769 :
4770 7136 : dest_mem = force_operand (XEXP (dest_mem, 0), NULL_RTX);
4771 7136 : dest_mem = convert_memory_address (ptr_mode, dest_mem);
4772 7136 : return dest_mem;
4773 : }
4774 :
4775 40774 : set_mem_align (dest_mem, dest_align);
4776 81548 : dest_addr = clear_storage_hints (dest_mem, len_rtx,
4777 40774 : 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 40774 : if (dest_addr == 0)
4784 : {
4785 31182 : dest_addr = force_operand (XEXP (dest_mem, 0), NULL_RTX);
4786 31182 : dest_addr = convert_memory_address (ptr_mode, dest_addr);
4787 : }
4788 :
4789 : return dest_addr;
4790 :
4791 5760 : do_libcall:
4792 5760 : fndecl = get_callee_fndecl (orig_exp);
4793 5760 : fcode = DECL_FUNCTION_CODE (fndecl);
4794 5760 : if (fcode == BUILT_IN_MEMSET)
4795 5760 : 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 5760 : gcc_assert (TREE_CODE (fn) == CALL_EXPR);
4803 5760 : CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (orig_exp);
4804 5760 : 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 104172 : expand_builtin_memcmp (tree exp, rtx target, bool result_eq)
4862 : {
4863 104172 : if (!validate_arglist (exp,
4864 : POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
4865 : return NULL_RTX;
4866 :
4867 104168 : tree arg1 = CALL_EXPR_ARG (exp, 0);
4868 104168 : tree arg2 = CALL_EXPR_ARG (exp, 1);
4869 104168 : 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 104168 : rtx result = NULL_RTX;
4874 104168 : enum built_in_function fcode = DECL_FUNCTION_CODE (get_callee_fndecl (exp));
4875 104168 : if (!result_eq && fcode != BUILT_IN_BCMP)
4876 : {
4877 14656 : result = inline_expand_builtin_bytecmp (exp, target);
4878 14656 : if (result)
4879 : return result;
4880 : }
4881 :
4882 104162 : machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
4883 104162 : location_t loc = EXPR_LOCATION (exp);
4884 :
4885 104162 : unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
4886 104162 : unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
4887 :
4888 : /* If we don't have POINTER_TYPE, call the function. */
4889 104162 : if (arg1_align == 0 || arg2_align == 0)
4890 : return NULL_RTX;
4891 :
4892 104162 : rtx arg1_rtx = get_memory_rtx (arg1, len);
4893 104162 : rtx arg2_rtx = get_memory_rtx (arg2, len);
4894 104162 : rtx len_rtx = expand_normal (fold_convert_loc (loc, sizetype, len));
4895 :
4896 : /* Set MEM_SIZE as appropriate. */
4897 104162 : if (CONST_INT_P (len_rtx))
4898 : {
4899 80201 : set_mem_size (arg1_rtx, INTVAL (len_rtx));
4900 80201 : set_mem_size (arg2_rtx, INTVAL (len_rtx));
4901 : }
4902 :
4903 104162 : 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 104162 : unsigned HOST_WIDE_INT nbytes;
4909 104162 : const char *rep = getbyterep (arg2, &nbytes);
4910 104162 : if (result_eq && rep == NULL)
4911 : {
4912 : /* For equality to zero the arguments are interchangeable. */
4913 62571 : rep = getbyterep (arg1, &nbytes);
4914 62571 : 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 41591 : if (rep
4923 28987 : && CONST_INT_P (len_rtx)
4924 28882 : && (unsigned HOST_WIDE_INT) INTVAL (len_rtx) <= nbytes)
4925 104162 : constfn = builtin_memcpy_read_str;
4926 :
4927 208324 : result = emit_block_cmp_hints (arg1_rtx, arg2_rtx, len_rtx,
4928 104162 : TREE_TYPE (len), target,
4929 : result_eq, constfn,
4930 : const_cast<char *> (rep),
4931 : tree_ctz (len));
4932 :
4933 104162 : if (result)
4934 : {
4935 : /* Return the value in the proper mode for this function. */
4936 67814 : 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 127963 : expand_builtin_strcmp (tree exp, ATTRIBUTE_UNUSED rtx target)
4957 : {
4958 127963 : if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
4959 : return NULL_RTX;
4960 :
4961 127948 : tree arg1 = CALL_EXPR_ARG (exp, 0);
4962 127948 : tree arg2 = CALL_EXPR_ARG (exp, 1);
4963 :
4964 : /* Due to the performance benefit, always inline the calls first. */
4965 127948 : rtx result = NULL_RTX;
4966 127948 : result = inline_expand_builtin_bytecmp (exp, target);
4967 127948 : if (result)
4968 : return result;
4969 :
4970 127549 : insn_code cmpstr_icode = direct_optab_handler (cmpstr_optab, SImode);
4971 127549 : insn_code cmpstrn_icode = direct_optab_handler (cmpstrn_optab, SImode);
4972 127549 : if (cmpstr_icode == CODE_FOR_nothing && cmpstrn_icode == CODE_FOR_nothing)
4973 : return NULL_RTX;
4974 :
4975 127549 : unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
4976 127549 : unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
4977 :
4978 : /* If we don't have POINTER_TYPE, call the function. */
4979 127549 : if (arg1_align == 0 || arg2_align == 0)
4980 : return NULL_RTX;
4981 :
4982 : /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4983 127549 : arg1 = builtin_save_expr (arg1);
4984 127549 : arg2 = builtin_save_expr (arg2);
4985 :
4986 127549 : rtx arg1_rtx = get_memory_rtx (arg1, NULL);
4987 127549 : rtx arg2_rtx = get_memory_rtx (arg2, NULL);
4988 :
4989 : /* Try to call cmpstrsi. */
4990 127549 : 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 127549 : if (!result && cmpstrn_icode != CODE_FOR_nothing)
4996 : {
4997 127549 : tree len;
4998 127549 : rtx arg3_rtx;
4999 :
5000 127549 : tree len1 = c_strlen (arg1, 1);
5001 127549 : tree len2 = c_strlen (arg2, 1);
5002 :
5003 127549 : if (len1)
5004 224 : len1 = size_binop (PLUS_EXPR, ssize_int (1), len1);
5005 127549 : if (len2)
5006 125927 : 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 127549 : 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 127331 : len = len2;
5031 :
5032 : /* If both arguments have side effects, we cannot optimize. */
5033 127549 : if (len && !TREE_SIDE_EFFECTS (len))
5034 : {
5035 126134 : arg3_rtx = expand_normal (len);
5036 126134 : result = expand_cmpstrn_or_cmpmem
5037 126134 : (cmpstrn_icode, target, arg1_rtx, arg2_rtx, TREE_TYPE (len),
5038 126134 : arg3_rtx, MIN (arg1_align, arg2_align));
5039 : }
5040 : }
5041 :
5042 127549 : tree fndecl = get_callee_fndecl (exp);
5043 127549 : 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 127497 : tree fn = build_call_nofold_loc (EXPR_LOCATION (exp), fndecl, 2, arg1, arg2);
5058 127497 : copy_warning (fn, exp);
5059 127497 : gcc_assert (TREE_CODE (fn) == CALL_EXPR);
5060 127497 : CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
5061 127497 : 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 2030 : expand_builtin_strncmp (tree exp, ATTRIBUTE_UNUSED rtx target,
5070 : ATTRIBUTE_UNUSED machine_mode mode)
5071 : {
5072 2030 : if (!validate_arglist (exp,
5073 : POINTER_TYPE, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
5074 : return NULL_RTX;
5075 :
5076 2024 : tree arg1 = CALL_EXPR_ARG (exp, 0);
5077 2024 : tree arg2 = CALL_EXPR_ARG (exp, 1);
5078 2024 : tree arg3 = CALL_EXPR_ARG (exp, 2);
5079 :
5080 2024 : location_t loc = EXPR_LOCATION (exp);
5081 2024 : tree len1 = c_strlen (arg1, 1);
5082 2024 : tree len2 = c_strlen (arg2, 1);
5083 :
5084 : /* Due to the performance benefit, always inline the calls first. */
5085 2024 : rtx result = NULL_RTX;
5086 2024 : result = inline_expand_builtin_bytecmp (exp, target);
5087 2024 : 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 1806 : insn_code cmpstrn_icode = direct_optab_handler (cmpstrn_optab, SImode);
5094 1806 : if (cmpstrn_icode == CODE_FOR_nothing)
5095 : return NULL_RTX;
5096 :
5097 1806 : tree len;
5098 :
5099 1806 : unsigned int arg1_align = get_pointer_alignment (arg1) / BITS_PER_UNIT;
5100 1806 : unsigned int arg2_align = get_pointer_alignment (arg2) / BITS_PER_UNIT;
5101 :
5102 1806 : if (len1)
5103 164 : len1 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len1);
5104 1806 : if (len2)
5105 673 : len2 = size_binop_loc (loc, PLUS_EXPR, ssize_int (1), len2);
5106 :
5107 1806 : 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 1806 : if (!len1 && !len2)
5118 : len = len3;
5119 720 : else if (!len1)
5120 : len = len2;
5121 164 : 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 557 : 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 1806 : if (len != len3)
5139 : {
5140 720 : len = fold_convert_loc (loc, sizetype, len);
5141 720 : len = fold_build2_loc (loc, MIN_EXPR, TREE_TYPE (len), len, len3);
5142 : }
5143 1806 : rtx arg1_rtx = get_memory_rtx (arg1, len);
5144 1806 : rtx arg2_rtx = get_memory_rtx (arg2, len);
5145 1806 : rtx arg3_rtx = expand_normal (len);
5146 1806 : result = expand_cmpstrn_or_cmpmem (cmpstrn_icode, target, arg1_rtx,
5147 1806 : arg2_rtx, TREE_TYPE (len), arg3_rtx,
5148 1806 : MIN (arg1_align, arg2_align));
5149 :
5150 1806 : tree fndecl = get_callee_fndecl (exp);
5151 1806 : if (result)
5152 : {
5153 : /* Return the value in the proper mode for this function. */
5154 17 : mode = TYPE_MODE (TREE_TYPE (exp));
5155 17 : 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 1789 : tree call = build_call_nofold_loc (loc, fndecl, 3, arg1, arg2, len);
5166 1789 : copy_warning (call, exp);
5167 1789 : gcc_assert (TREE_CODE (call) == CALL_EXPR);
5168 1789 : CALL_EXPR_TAILCALL (call) = CALL_EXPR_TAILCALL (exp);
5169 1789 : 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 21230 : 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 21230 : return expand_binop (ptr_mode, add_optab,
5217 : crtl->args.internal_arg_pointer,
5218 : crtl->args.arg_offset_rtx,
5219 21230 : 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 21552 : stabilize_va_list_loc (location_t loc, tree valist, int needs_lvalue)
5227 : {
5228 21552 : 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 21552 : if (!vatype)
5233 21428 : vatype = targetm.fn_abi_va_list (cfun->decl);
5234 :
5235 21552 : if (TREE_CODE (vatype) == ARRAY_TYPE)
5236 : {
5237 15890 : 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 15890 : 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 21072 : expand_builtin_va_start (tree exp)
5331 : {
5332 21072 : rtx nextarg;
5333 21072 : tree valist;
5334 21072 : location_t loc = EXPR_LOCATION (exp);
5335 :
5336 21072 : 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 21072 : if (fold_builtin_next_arg (exp, true))
5343 0 : return const0_rtx;
5344 :
5345 21072 : nextarg = expand_builtin_next_arg ();
5346 21072 : valist = stabilize_va_list_loc (loc, CALL_EXPR_ARG (exp, 0), 1);
5347 :
5348 21072 : if (targetm.expand_builtin_va_start)
5349 21072 : targetm.expand_builtin_va_start (valist, nextarg);
5350 : else
5351 0 : std_expand_builtin_va_start (valist, nextarg);
5352 :
5353 21072 : return const0_rtx;
5354 : }
5355 :
5356 : /* Expand EXP, a call to __builtin_va_end. */
5357 :
5358 : static rtx
5359 12166 : expand_builtin_va_end (tree exp)
5360 : {
5361 12166 : 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 12166 : if (TREE_SIDE_EFFECTS (valist))
5366 0 : expand_expr (valist, const0_rtx, VOIDmode, EXPAND_NORMAL);
5367 :
5368 12166 : 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 240 : expand_builtin_va_copy (tree exp)
5377 : {
5378 240 : tree dst, src, t;
5379 240 : location_t loc = EXPR_LOCATION (exp);
5380 :
5381 240 : dst = CALL_EXPR_ARG (exp, 0);
5382 240 : src = CALL_EXPR_ARG (exp, 1);
5383 :
5384 240 : dst = stabilize_va_list_loc (loc, dst, 1);
5385 240 : src = stabilize_va_list_loc (loc, src, 0);
5386 :
5387 240 : gcc_assert (cfun != NULL && cfun->decl != NULL_TREE);
5388 :
5389 240 : 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 240 : rtx dstb, srcb, size;
5398 :
5399 : /* Evaluate to pointers. */
5400 240 : dstb = expand_expr (dst, NULL_RTX, Pmode, EXPAND_NORMAL);
5401 240 : srcb = expand_expr (src, NULL_RTX, Pmode, EXPAND_NORMAL);
5402 240 : size = expand_expr (TYPE_SIZE_UNIT (targetm.fn_abi_va_list (cfun->decl)),
5403 : NULL_RTX, VOIDmode, EXPAND_NORMAL);
5404 :
5405 240 : dstb = convert_memory_address (Pmode, dstb);
5406 240 : srcb = convert_memory_address (Pmode, srcb);
5407 :
5408 : /* "Dereference" to BLKmode memories. */
5409 240 : dstb = gen_rtx_MEM (BLKmode, dstb);
5410 240 : set_mem_alias_set (dstb, get_alias_set (TREE_TYPE (TREE_TYPE (dst))));
5411 240 : set_mem_align (dstb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
5412 240 : srcb = gen_rtx_MEM (BLKmode, srcb);
5413 240 : set_mem_alias_set (srcb, get_alias_set (TREE_TYPE (TREE_TYPE (src))));
5414 240 : set_mem_align (srcb, TYPE_ALIGN (targetm.fn_abi_va_list (cfun->decl)));
5415 :
5416 : /* Copy. */
5417 240 : emit_block_move (dstb, srcb, size, BLOCK_OP_NORMAL);
5418 : }
5419 :
5420 240 : 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 15922 : 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 15922 : if (call_expr_nargs (exp) == 0)
5434 : /* Warning about missing arg was already issued. */
5435 0 : return const0_rtx;
5436 15922 : 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 15922 : unsigned HOST_WIDE_INT count = tree_to_uhwi (CALL_EXPR_ARG (exp, 0));
5445 :
5446 15922 : rtx tem = expand_builtin_return_addr (DECL_FUNCTION_CODE (fndecl), count);
5447 :
5448 : /* Some ports cannot access arbitrary stack frames. */
5449 15922 : if (tem == NULL)
5450 : {
5451 0 : warning (0, "unsupported argument to %qD", fndecl);
5452 0 : return const0_rtx;
5453 : }
5454 :
5455 15922 : 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 15922 : if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FRAME_ADDRESS)
5465 : return tem;
5466 :
5467 5171 : if (!REG_P (tem)
5468 5171 : && ! CONSTANT_P (tem))
5469 5171 : tem = copy_addr_to_reg (tem);
5470 5171 : 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 3429 : expand_builtin_stack_address ()
5490 : {
5491 3429 : 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 3429 : return force_reg (ptr_mode, ret);
5525 : }
5526 :
5527 : /* Expand a call to builtin function __builtin_strub_enter. */
5528 :
5529 : static rtx
5530 2160 : expand_builtin_strub_enter (tree exp)
5531 : {
5532 2160 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5533 : return NULL_RTX;
5534 :
5535 2160 : if (optimize < 1 || flag_no_inline)
5536 : return NULL_RTX;
5537 :
5538 1516 : rtx stktop = expand_builtin_stack_address ();
5539 :
5540 1516 : tree wmptr = CALL_EXPR_ARG (exp, 0);
5541 1516 : tree wmtype = TREE_TYPE (TREE_TYPE (wmptr));
5542 1516 : tree wmtree = fold_build2 (MEM_REF, wmtype, wmptr,
5543 : build_int_cst (TREE_TYPE (wmptr), 0));
5544 1516 : rtx wmark = expand_expr (wmtree, NULL_RTX, ptr_mode, EXPAND_MEMORY);
5545 :
5546 1516 : emit_move_insn (wmark, stktop);
5547 :
5548 1516 : return const0_rtx;
5549 : }
5550 :
5551 : /* Expand a call to builtin function __builtin_strub_update. */
5552 :
5553 : static rtx
5554 1072 : expand_builtin_strub_update (tree exp)
5555 : {
5556 1072 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5557 : return NULL_RTX;
5558 :
5559 1072 : if (optimize < 2 || flag_no_inline)
5560 : return NULL_RTX;
5561 :
5562 653 : 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 653 : if (true /* (flags_from_decl_or_type (current_function_decl) & ECF_LEAF) */)
5600 : {
5601 653 : poly_int64 red_zone_size = RED_ZONE_SIZE;
5602 : #if STACK_GROWS_DOWNWARD
5603 653 : red_zone_size = -red_zone_size;
5604 : #endif
5605 653 : stktop = plus_constant (ptr_mode, stktop, red_zone_size);
5606 653 : stktop = force_reg (ptr_mode, stktop);
5607 : }
5608 : #endif
5609 :
5610 653 : tree wmptr = CALL_EXPR_ARG (exp, 0);
5611 653 : tree wmtype = TREE_TYPE (TREE_TYPE (wmptr));
5612 653 : tree wmtree = fold_build2 (MEM_REF, wmtype, wmptr,
5613 : build_int_cst (TREE_TYPE (wmptr), 0));
5614 653 : rtx wmark = expand_expr (wmtree, NULL_RTX, ptr_mode, EXPAND_MEMORY);
5615 :
5616 653 : rtx wmarkr = force_reg (ptr_mode, wmark);
5617 :
5618 653 : rtx_code_label *lab = gen_label_rtx ();
5619 653 : do_compare_rtx_and_jump (stktop, wmarkr, STACK_TOPS, STACK_UNSIGNED,
5620 : ptr_mode, NULL_RTX, lab, NULL,
5621 : profile_probability::very_likely ());
5622 653 : 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 653 : tree xwmptr = (optimize > 2
5632 653 : ? strub_watermark_parm (current_function_decl)
5633 : : wmptr);
5634 653 : 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 653 : emit_label (lab);
5650 :
5651 653 : return const0_rtx;
5652 : }
5653 :
5654 :
5655 : /* Expand a call to builtin function __builtin_strub_leave. */
5656 :
5657 : static rtx
5658 2730 : expand_builtin_strub_leave (tree exp)
5659 : {
5660 2730 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
5661 : return NULL_RTX;
5662 :
5663 2730 : 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 27738 : expand_builtin_alloca (tree exp)
5757 : {
5758 27738 : rtx op0;
5759 27738 : rtx result;
5760 27738 : unsigned int align;
5761 27738 : tree fndecl = get_callee_fndecl (exp);
5762 27738 : HOST_WIDE_INT max_size;
5763 27738 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
5764 27738 : bool alloca_for_var = CALL_ALLOCA_FOR_VAR_P (exp);
5765 27738 : bool valid_arglist
5766 : = (fcode == BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
5767 27738 : ? validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE, INTEGER_TYPE,
5768 : VOID_TYPE)
5769 : : fcode == BUILT_IN_ALLOCA_WITH_ALIGN
5770 27736 : ? validate_arglist (exp, INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE)
5771 27738 : : validate_arglist (exp, INTEGER_TYPE, VOID_TYPE));
5772 :
5773 27738 : if (!valid_arglist)
5774 : return NULL_RTX;
5775 :
5776 : /* Compute the argument. */
5777 27733 : op0 = expand_normal (CALL_EXPR_ARG (exp, 0));
5778 :
5779 : /* Compute the alignment. */
5780 51553 : align = (fcode == BUILT_IN_ALLOCA
5781 23821 : ? BIGGEST_ALIGNMENT
5782 3912 : : 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 27735 : ? 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 27733 : result
5792 27733 : = allocate_dynamic_stack_space (op0, 0, align, max_size, alloca_for_var);
5793 27733 : result = convert_memory_address (ptr_mode, result);
5794 :
5795 : /* Dynamic allocations for variables are recorded during gimplification. */
5796 27733 : 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 204 : expand_asan_emit_allocas_unpoison (tree exp)
5809 : {
5810 204 : tree arg0 = CALL_EXPR_ARG (exp, 0);
5811 204 : tree arg1 = CALL_EXPR_ARG (exp, 1);
5812 204 : rtx top = expand_expr (arg0, NULL_RTX, ptr_mode, EXPAND_NORMAL);
5813 204 : rtx bot = expand_expr (arg1, NULL_RTX, ptr_mode, EXPAND_NORMAL);
5814 204 : rtx off = expand_simple_binop (Pmode, MINUS, virtual_stack_dynamic_rtx,
5815 : stack_pointer_rtx, NULL_RTX, 0,
5816 : OPTAB_LIB_WIDEN);
5817 204 : off = convert_modes (ptr_mode, Pmode, off, 0);
5818 204 : bot = expand_simple_binop (ptr_mode, PLUS, bot, off, NULL_RTX, 0,
5819 : OPTAB_LIB_WIDEN);
5820 204 : rtx ret = init_one_libfunc ("__asan_allocas_unpoison");
5821 204 : ret = emit_library_call_value (ret, NULL_RTX, LCT_NORMAL, ptr_mode,
5822 : top, ptr_mode, bot, ptr_mode);
5823 204 : 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 1230 : expand_builtin_bswap (machine_mode target_mode, tree exp, rtx target,
5833 : rtx subtarget)
5834 : {
5835 1230 : tree arg;
5836 1230 : rtx op0;
5837 :
5838 1230 : if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
5839 : return NULL_RTX;
5840 :
5841 1230 : arg = CALL_EXPR_ARG (exp, 0);
5842 1230 : op0 = expand_expr (arg,
5843 55 : subtarget && GET_MODE (subtarget) == target_mode
5844 : ? subtarget : NULL_RTX,
5845 : target_mode, EXPAND_NORMAL);
5846 1230 : if (GET_MODE (op0) != target_mode)
5847 0 : op0 = convert_to_mode (target_mode, op0, 1);
5848 :
5849 1230 : target = expand_unop (target_mode, bswap_optab, op0, target, 1);
5850 :
5851 1230 : gcc_assert (target);
5852 :
5853 1230 : 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 831 : expand_builtin_unop (machine_mode target_mode, tree exp, rtx target,
5863 : rtx subtarget, optab op_optab)
5864 : {
5865 831 : rtx op0;
5866 :
5867 831 : if (!validate_arglist (exp, INTEGER_TYPE, VOID_TYPE))
5868 : return NULL_RTX;
5869 :
5870 : /* Compute the argument. */
5871 1662 : op0 = expand_expr (CALL_EXPR_ARG (exp, 0),
5872 : (subtarget
5873 102 : && (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0)))
5874 102 : == 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 831 : target = expand_unop (TYPE_MODE (TREE_TYPE (CALL_EXPR_ARG (exp, 0))),
5879 : op_optab, op0, target, op_optab != clrsb_optab);
5880 831 : gcc_assert (target);
5881 :
5882 831 : 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 1253 : expand_builtin_expect (tree exp, rtx target)
5891 : {
5892 1253 : tree arg;
5893 :
5894 1253 : if (call_expr_nargs (exp) < 2)
5895 0 : return const0_rtx;
5896 1253 : arg = CALL_EXPR_ARG (exp, 0);
5897 :
5898 1253 : target = expand_expr (arg, target, VOIDmode, EXPAND_NORMAL);
5899 : /* When guessing was done, the hints should be already stripped away. */
5900 1253 : 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 665 : expand_builtin_assume_aligned (tree exp, rtx target)
5932 : {
5933 665 : if (call_expr_nargs (exp) < 2)
5934 0 : return const0_rtx;
5935 665 : target = expand_expr (CALL_EXPR_ARG (exp, 0), target, VOIDmode,
5936 : EXPAND_NORMAL);
5937 665 : 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 38591 : expand_builtin_trap (void)
5945 : {
5946 38591 : if (targetm.have_trap ())
5947 : {
5948 38591 : 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 38591 : if (!ACCUMULATE_OUTGOING_ARGS)
5953 38589 : 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 38591 : emit_barrier ();
5963 38591 : }
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 3681 : expand_builtin_unreachable (void)
5972 : {
5973 : /* Use gimple_build_builtin_unreachable or builtin_decl_unreachable
5974 : to avoid this. */
5975 3681 : gcc_checking_assert (!sanitize_flags_p (SANITIZE_UNREACHABLE));
5976 3681 : emit_barrier ();
5977 3681 : }
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 11673 : expand_builtin_copysign (tree exp, rtx target, rtx subtarget)
6009 : {
6010 11673 : rtx op0, op1;
6011 11673 : tree arg;
6012 :
6013 11673 : if (!validate_arglist (exp, REAL_TYPE, REAL_TYPE, VOID_TYPE))
6014 : return NULL_RTX;
6015 :
6016 11672 : arg = CALL_EXPR_ARG (exp, 0);
6017 11672 : op0 = expand_expr (arg, subtarget, VOIDmode, EXPAND_NORMAL);
6018 :
6019 11672 : arg = CALL_EXPR_ARG (exp, 1);
6020 11672 : op1 = expand_normal (arg);
6021 :
6022 11672 : 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 657 : round_trampoline_addr (rtx tramp)
6106 : {
6107 657 : 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 657 : 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 305 : expand_builtin_init_trampoline (tree exp, bool onstack)
6129 : {
6130 305 : tree t_tramp, t_func, t_chain;
6131 305 : rtx m_tramp, r_tramp, r_chain, tmp;
6132 :
6133 305 : if (!validate_arglist (exp, POINTER_TYPE, POINTER_TYPE,
6134 : POINTER_TYPE, VOID_TYPE))
6135 : return NULL_RTX;
6136 :
6137 305 : t_tramp = CALL_EXPR_ARG (exp, 0);
6138 305 : t_func = CALL_EXPR_ARG (exp, 1);
6139 305 : t_chain = CALL_EXPR_ARG (exp, 2);
6140 :
6141 305 : r_tramp = expand_normal (t_tramp);
6142 305 : m_tramp = gen_rtx_MEM (BLKmode, r_tramp);
6143 305 : 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 305 : if (TREE_CODE (t_tramp) == ADDR_EXPR)
6149 305 : 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 305 : tmp = round_trampoline_addr (r_tramp);
6155 305 : 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 305 : gcc_assert (TREE_CODE (t_func) == ADDR_EXPR);
6165 305 : t_func = TREE_OPERAND (t_func, 0);
6166 305 : gcc_assert (TREE_CODE (t_func) == FUNCTION_DECL);
6167 :
6168 305 : r_chain = expand_normal (t_chain);
6169 :
6170 : /* Generate insns to initialize the trampoline. */
6171 305 : targetm.calls.trampoline_init (m_tramp, t_func, r_chain);
6172 :
6173 305 : if (onstack)
6174 : {
6175 305 : trampolines_created = 1;
6176 :
6177 305 : if (targetm.calls.custom_function_descriptors != 0)
6178 305 : warning_at (DECL_SOURCE_LOCATION (t_func), OPT_Wtrampolines,
6179 : "trampoline generated for nested function %qD", t_func);
6180 : }
6181 :
6182 305 : return const0_rtx;
6183 : }
6184 :
6185 : static rtx
6186 352 : expand_builtin_adjust_trampoline (tree exp)
6187 : {
6188 352 : rtx tramp;
6189 :
6190 352 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
6191 : return NULL_RTX;
6192 :
6193 352 : tramp = expand_normal (CALL_EXPR_ARG (exp, 0));
6194 352 : tramp = round_trampoline_addr (tramp);
6195 352 : 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 1007 : expand_builtin_signbit (tree exp, rtx target)
6263 : {
6264 1007 : const struct real_format *fmt;
6265 1007 : scalar_float_mode fmode;
6266 1007 : scalar_int_mode rmode, imode;
6267 1007 : tree arg;
6268 1007 : int word, bitpos;
6269 1007 : enum insn_code icode;
6270 1007 : rtx temp;
6271 1007 : location_t loc = EXPR_LOCATION (exp);
6272 :
6273 1007 : if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))
6274 : return NULL_RTX;
6275 :
6276 1007 : arg = CALL_EXPR_ARG (exp, 0);
6277 1007 : fmode = SCALAR_FLOAT_TYPE_MODE (TREE_TYPE (arg));
6278 1007 : rmode = SCALAR_INT_TYPE_MODE (TREE_TYPE (exp));
6279 1007 : fmt = REAL_MODE_FORMAT (fmode);
6280 :
6281 1007 : arg = builtin_save_expr (arg);
6282 :
6283 : /* Expand the argument yielding a RTX expression. */
6284 1007 : temp = expand_normal (arg);
6285 :
6286 : /* Check if the back end provides an insn that handles signbit for the
6287 : argument's mode. */
6288 1007 : icode = optab_handler (signbit_optab, fmode);
6289 1007 : 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 997 : bitpos = fmt->signbit_ro;
6301 997 : 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 1994 : if (GET_MODE_SIZE (fmode) <= UNITS_PER_WORD)
6312 : {
6313 893 : imode = int_mode_for_mode (fmode).require ();
6314 893 : 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 997 : 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 1994 : if (bitpos < GET_MODE_BITSIZE (rmode))
6338 : {
6339 789 : wide_int mask = wi::set_bit_in_zero (bitpos, GET_MODE_PRECISION (rmode));
6340 :
6341 2367 : if (GET_MODE_SIZE (imode) > GET_MODE_SIZE (rmode))
6342 0 : temp = gen_lowpart (rmode, temp);
6343 1578 : temp = expand_binop (rmode, and_optab, temp,
6344 1578 : immed_wide_int_const (mask, rmode),
6345 : NULL_RTX, 1, OPTAB_LIB_WIDEN);
6346 789 : }
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 110 : expand_builtin_fork_or_exec (tree fn, tree exp, rtx target, int ignore)
6368 : {
6369 110 : tree id, decl;
6370 110 : tree call;
6371 :
6372 : /* If we are not profiling, just call the function. */
6373 110 : 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 133082 : 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 133082 : 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 149581 : get_builtin_sync_mem (tree loc, machine_mode mode)
6449 : {
6450 149581 : rtx addr, mem;
6451 149581 : int addr_space = TYPE_ADDR_SPACE (POINTER_TYPE_P (TREE_TYPE (loc))
6452 : ? TREE_TYPE (TREE_TYPE (loc))
6453 : : TREE_TYPE (loc));
6454 149581 : scalar_int_mode addr_mode = targetm.addr_space.address_mode (addr_space);
6455 :
6456 149581 : addr = expand_expr (loc, NULL_RTX, addr_mode, EXPAND_SUM);
6457 149581 : 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 149581 : mem = gen_rtx_MEM (mode, addr);
6463 :
6464 149581 : set_mem_addr_space (mem, addr_space);
6465 :
6466 149581 : mem = validize_mem (mem);
6467 :
6468 : /* The alignment needs to be at least according to that of the mode. */
6469 149581 : set_mem_align (mem, MAX (GET_MODE_ALIGNMENT (mode),
6470 : get_pointer_alignment (loc)));
6471 149581 : set_mem_alias_set (mem, ALIAS_SET_MEMORY_BARRIER);
6472 149581 : MEM_VOLATILE_P (mem) = 1;
6473 :
6474 149581 : 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 93654 : expand_expr_force_mode (tree exp, machine_mode mode)
6483 : {
6484 93654 : rtx val;
6485 93654 : machine_mode old_mode;
6486 :
6487 93654 : if (TREE_CODE (exp) == SSA_NAME
6488 93654 : && 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 93654 : 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 93654 : old_mode = GET_MODE (val);
6513 93654 : if (old_mode == VOIDmode)
6514 43963 : old_mode = TYPE_MODE (TREE_TYPE (exp));
6515 93654 : val = convert_modes (mode, old_mode, val, 1);
6516 93654 : 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 4011 : expand_builtin_sync_operation (machine_mode mode, tree exp,
6529 : enum rtx_code code, bool after,
6530 : rtx target)
6531 : {
6532 4011 : rtx val, mem;
6533 4011 : location_t loc = EXPR_LOCATION (exp);
6534 :
6535 4011 : if (code == NOT && warn_sync_nand)
6536 : {
6537 523 : tree fndecl = get_callee_fndecl (exp);
6538 523 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
6539 :
6540 523 : static bool warned_f_a_n, warned_n_a_f;
6541 :
6542 523 : 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 89 : case BUILT_IN_SYNC_NAND_AND_FETCH_1:
6558 89 : case BUILT_IN_SYNC_NAND_AND_FETCH_2:
6559 89 : case BUILT_IN_SYNC_NAND_AND_FETCH_4:
6560 89 : case BUILT_IN_SYNC_NAND_AND_FETCH_8:
6561 89 : case BUILT_IN_SYNC_NAND_AND_FETCH_16:
6562 89 : if (warned_n_a_f)
6563 : break;
6564 :
6565 22 : fndecl = builtin_decl_implicit (BUILT_IN_SYNC_NAND_AND_FETCH_N);
6566 22 : inform (loc, "%qD changed semantics in GCC 4.4", fndecl);
6567 22 : warned_n_a_f = true;
6568 22 : break;
6569 :
6570 0 : default:
6571 0 : gcc_unreachable ();
6572 : }
6573 : }
6574 :
6575 : /* Expand the operands. */
6576 4011 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6577 4011 : val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
6578 :
6579 4011 : return expand_atomic_fetch_op (target, mem, val, code, MEMMODEL_SYNC_SEQ_CST,
6580 4011 : 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 146 : expand_builtin_sync_lock_release (machine_mode mode, tree exp)
6639 : {
6640 146 : rtx mem;
6641 :
6642 : /* Expand the operands. */
6643 146 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6644 :
6645 146 : 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 168030 : 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 168030 : if (TREE_CODE (exp) != INTEGER_CST)
6657 : return MEMMODEL_SEQ_CST;
6658 :
6659 167203 : rtx op = expand_normal (exp);
6660 :
6661 167203 : unsigned HOST_WIDE_INT val = INTVAL (op);
6662 167203 : if (targetm.memmodel_check)
6663 167203 : 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 167203 : 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 167200 : if (val == MEMMODEL_CONSUME)
6674 755 : val = MEMMODEL_ACQUIRE;
6675 :
6676 167200 : 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 2877 : expand_builtin_atomic_exchange (machine_mode mode, tree exp, rtx target)
6686 : {
6687 2877 : rtx val, mem;
6688 2877 : enum memmodel model;
6689 :
6690 2877 : model = get_memmodel (CALL_EXPR_ARG (exp, 2));
6691 :
6692 2877 : if (!flag_inline_atomics)
6693 : return NULL_RTX;
6694 :
6695 : /* Expand the operands. */
6696 2826 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6697 2826 : val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
6698 :
6699 2826 : 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 9133 : expand_builtin_atomic_compare_exchange (machine_mode mode, tree exp,
6712 : rtx target)
6713 : {
6714 9133 : rtx expect, desired, mem, oldval;
6715 9133 : rtx_code_label *label;
6716 9133 : tree weak;
6717 9133 : bool is_weak;
6718 :
6719 9133 : memmodel success = get_memmodel (CALL_EXPR_ARG (exp, 4));
6720 9133 : memmodel failure = get_memmodel (CALL_EXPR_ARG (exp, 5));
6721 :
6722 9133 : if (failure > success)
6723 22 : success = MEMMODEL_SEQ_CST;
6724 :
6725 9133 : 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 9133 : if (!flag_inline_atomics)
6733 : return NULL_RTX;
6734 :
6735 : /* Expand the operands. */
6736 9082 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6737 :
6738 9082 : expect = expand_normal (CALL_EXPR_ARG (exp, 1));
6739 9082 : expect = convert_memory_address (Pmode, expect);
6740 9082 : expect = gen_rtx_MEM (mode, expect);
6741 9082 : desired = expand_expr_force_mode (CALL_EXPR_ARG (exp, 2), mode);
6742 :
6743 9082 : weak = CALL_EXPR_ARG (exp, 3);
6744 9082 : is_weak = false;
6745 9082 : if (tree_fits_shwi_p (weak) && tree_to_shwi (weak) != 0)
6746 9082 : is_weak = true;
6747 :
6748 9082 : if (target == const0_rtx)
6749 286 : 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 9082 : oldval = NULL;
6754 :
6755 9082 : 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 7331 : label = gen_label_rtx ();
6765 7331 : emit_cmp_and_jump_insns (target, const0_rtx, NE, NULL,
6766 7331 : GET_MODE (target), 1, label);
6767 7331 : emit_move_insn (expect, oldval);
6768 7331 : emit_label (label);
6769 :
6770 7331 : 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 13869 : expand_ifn_atomic_compare_exchange (gcall *call)
6827 : {
6828 13869 : int size = tree_to_shwi (gimple_call_arg (call, 3)) & 255;
6829 13869 : gcc_assert (size == 1 || size == 2 || size == 4 || size == 8 || size == 16);
6830 13869 : machine_mode mode = int_mode_for_size (BITS_PER_UNIT * size, 0).require ();
6831 :
6832 13869 : memmodel success = get_memmodel (gimple_call_arg (call, 4));
6833 13869 : memmodel failure = get_memmodel (gimple_call_arg (call, 5));
6834 :
6835 13869 : if (failure > success)
6836 0 : success = MEMMODEL_SEQ_CST;
6837 :
6838 13869 : if (is_mm_release (failure) || is_mm_acq_rel (failure))
6839 : {
6840 : failure = MEMMODEL_SEQ_CST;
6841 : success = MEMMODEL_SEQ_CST;
6842 : }
6843 :
6844 13869 : 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 13869 : rtx mem = get_builtin_sync_mem (gimple_call_arg (call, 0), mode);
6852 :
6853 13869 : rtx expect = expand_expr_force_mode (gimple_call_arg (call, 1), mode);
6854 13869 : rtx desired = expand_expr_force_mode (gimple_call_arg (call, 2), mode);
6855 :
6856 13869 : bool is_weak = (tree_to_shwi (gimple_call_arg (call, 3)) & 256) != 0;
6857 :
6858 13869 : rtx boolret = NULL;
6859 13869 : rtx oldval = NULL;
6860 :
6861 13869 : 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 13869 : tree lhs = gimple_call_lhs (call);
6869 13869 : if (lhs)
6870 : {
6871 13661 : rtx target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE);
6872 13661 : if (GET_MODE (boolret) != mode)
6873 12192 : boolret = convert_modes (mode, GET_MODE (boolret), boolret, 1);
6874 13661 : write_complex_part (target, boolret, true, true);
6875 13661 : 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 69828 : expand_builtin_atomic_load (machine_mode mode, tree exp, rtx target)
6886 : {
6887 69828 : memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 1));
6888 69828 : if (is_mm_release (model) || is_mm_acq_rel (model))
6889 : model = MEMMODEL_SEQ_CST;
6890 :
6891 69828 : if (!flag_inline_atomics)
6892 : return NULL_RTX;
6893 :
6894 : /* Expand the operand. */
6895 69787 : rtx mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6896 :
6897 69787 : 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 17422 : expand_builtin_atomic_store (machine_mode mode, tree exp)
6908 : {
6909 17422 : memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 2));
6910 17422 : if (!(is_mm_relaxed (model) || is_mm_seq_cst (model)
6911 1592 : || is_mm_release (model)))
6912 : model = MEMMODEL_SEQ_CST;
6913 :
6914 17422 : if (!flag_inline_atomics)
6915 : return NULL_RTX;
6916 :
6917 : /* Expand the operands. */
6918 17391 : rtx mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6919 17391 : rtx val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
6920 :
6921 17391 : 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 28853 : 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 28853 : rtx val, mem, ret;
6941 28853 : enum memmodel model;
6942 28853 : tree fndecl;
6943 28853 : tree addr;
6944 :
6945 28853 : model = get_memmodel (CALL_EXPR_ARG (exp, 2));
6946 :
6947 : /* Expand the operands. */
6948 28853 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
6949 28853 : val = expand_expr_force_mode (CALL_EXPR_ARG (exp, 1), mode);
6950 :
6951 : /* Only try generating instructions if inlining is turned on. */
6952 28853 : if (flag_inline_atomics)
6953 : {
6954 28310 : ret = expand_atomic_fetch_op (target, mem, val, code, model, fetch_after);
6955 28310 : 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;
7080 0 : if (is_atomic)
7081 0 : exp = build_call_nary (type, tcall, 3,
7082 : ptr, make_tree (type, val),
7083 : gimple_call_arg (call, 3));
7084 : else
7085 0 : exp = build_call_nary (type, tcall, 2, ptr, make_tree (type, val));
7086 0 : result = expand_builtin (exp, gen_reg_rtx (mode), NULL_RTX,
7087 : mode, !lhs);
7088 : }
7089 0 : if (!lhs)
7090 : return;
7091 0 : if (integer_onep (flag))
7092 : {
7093 0 : result = expand_simple_binop (mode, ASHIFTRT, result, bitval,
7094 : NULL_RTX, true, OPTAB_DIRECT);
7095 0 : result = expand_simple_binop (mode, AND, result, const1_rtx, target,
7096 : true, OPTAB_DIRECT);
7097 : }
7098 : else
7099 0 : result = expand_simple_binop (mode, AND, result, maskval, target, true,
7100 : OPTAB_DIRECT);
7101 0 : if (result != target)
7102 0 : emit_move_insn (target, result);
7103 : }
7104 :
7105 : /* Expand IFN_ATOMIC_*_FETCH_CMP_0 internal function. */
7106 :
7107 : void
7108 2088 : expand_ifn_atomic_op_fetch_cmp_0 (gcall *call)
7109 : {
7110 2088 : tree cmp = gimple_call_arg (call, 0);
7111 2088 : tree ptr = gimple_call_arg (call, 1);
7112 2088 : tree arg = gimple_call_arg (call, 2);
7113 2088 : tree lhs = gimple_call_lhs (call);
7114 2088 : enum memmodel model = MEMMODEL_SYNC_SEQ_CST;
7115 2088 : machine_mode mode = TYPE_MODE (TREE_TYPE (cmp));
7116 2088 : optab optab;
7117 2088 : rtx_code code;
7118 2088 : class expand_operand ops[5];
7119 :
7120 2088 : gcc_assert (flag_inline_atomics);
7121 :
7122 2088 : if (gimple_call_num_args (call) == 5)
7123 1680 : model = get_memmodel (gimple_call_arg (call, 3));
7124 :
7125 2088 : rtx mem = get_builtin_sync_mem (ptr, mode);
7126 2088 : rtx op = expand_expr_force_mode (arg, mode);
7127 :
7128 2088 : switch (gimple_call_internal_fn (call))
7129 : {
7130 : case IFN_ATOMIC_ADD_FETCH_CMP_0:
7131 : code = PLUS;
7132 : optab = atomic_add_fetch_cmp_0_optab;
7133 : break;
7134 : case IFN_ATOMIC_SUB_FETCH_CMP_0:
7135 : code = MINUS;
7136 : optab = atomic_sub_fetch_cmp_0_optab;
7137 : break;
7138 : case IFN_ATOMIC_AND_FETCH_CMP_0:
7139 : code = AND;
7140 : optab = atomic_and_fetch_cmp_0_optab;
7141 : break;
7142 : case IFN_ATOMIC_OR_FETCH_CMP_0:
7143 : code = IOR;
7144 : optab = atomic_or_fetch_cmp_0_optab;
7145 : break;
7146 : case IFN_ATOMIC_XOR_FETCH_CMP_0:
7147 : code = XOR;
7148 : optab = atomic_xor_fetch_cmp_0_optab;
7149 : break;
7150 0 : default:
7151 0 : gcc_unreachable ();
7152 : }
7153 :
7154 2088 : enum rtx_code comp = UNKNOWN;
7155 2088 : switch (tree_to_uhwi (cmp))
7156 : {
7157 : case ATOMIC_OP_FETCH_CMP_0_EQ: comp = EQ; break;
7158 : case ATOMIC_OP_FETCH_CMP_0_NE: comp = NE; break;
7159 : case ATOMIC_OP_FETCH_CMP_0_GT: comp = GT; break;
7160 : case ATOMIC_OP_FETCH_CMP_0_GE: comp = GE; break;
7161 : case ATOMIC_OP_FETCH_CMP_0_LT: comp = LT; break;
7162 : case ATOMIC_OP_FETCH_CMP_0_LE: comp = LE; break;
7163 0 : default: gcc_unreachable ();
7164 : }
7165 :
7166 2088 : rtx target;
7167 2088 : if (lhs == NULL_TREE)
7168 0 : target = gen_reg_rtx (TYPE_MODE (boolean_type_node));
7169 : else
7170 2088 : target = expand_expr (lhs, NULL_RTX, VOIDmode, EXPAND_WRITE);
7171 2088 : enum insn_code icode = direct_optab_handler (optab, mode);
7172 2088 : gcc_assert (icode != CODE_FOR_nothing);
7173 2088 : create_output_operand (&ops[0], target, TYPE_MODE (boolean_type_node));
7174 2088 : create_fixed_operand (&ops[1], mem);
7175 2088 : create_convert_operand_to (&ops[2], op, mode, true);
7176 2088 : create_integer_operand (&ops[3], model);
7177 2088 : create_integer_operand (&ops[4], comp);
7178 2088 : if (maybe_expand_insn (icode, 5, ops))
7179 2056 : return;
7180 :
7181 32 : rtx result = expand_atomic_fetch_op (gen_reg_rtx (mode), mem, op,
7182 : code, model, true);
7183 32 : if (!result)
7184 : {
7185 0 : bool is_atomic = gimple_call_num_args (call) == 5;
7186 0 : tree tcall = gimple_call_arg (call, 3 + is_atomic);
7187 0 : tree fndecl = gimple_call_addr_fndecl (tcall);
7188 0 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
7189 0 : tree exp;
7190 0 : if (is_atomic)
7191 0 : exp = build_call_nary (type, tcall, 3,
7192 : ptr, arg,
7193 : gimple_call_arg (call, 3));
7194 : else
7195 0 : exp = build_call_nary (type, tcall, 2, ptr, arg);
7196 0 : result = expand_builtin (exp, gen_reg_rtx (mode), NULL_RTX,
7197 : mode, !lhs);
7198 : }
7199 :
7200 32 : if (lhs)
7201 : {
7202 32 : result = emit_store_flag_force (target, comp, result, const0_rtx, mode,
7203 : 0, 1);
7204 32 : if (result != target)
7205 32 : emit_move_insn (target, result);
7206 : }
7207 : }
7208 :
7209 : /* Expand an atomic clear operation.
7210 : void _atomic_clear (BOOL *obj, enum memmodel)
7211 : EXP is the call expression. */
7212 :
7213 : static rtx
7214 53 : expand_builtin_atomic_clear (tree exp)
7215 : {
7216 53 : machine_mode mode = int_mode_for_size (BOOL_TYPE_SIZE, 0).require ();
7217 53 : rtx mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
7218 53 : memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 1));
7219 :
7220 53 : if (is_mm_consume (model) || is_mm_acquire (model) || is_mm_acq_rel (model))
7221 : model = MEMMODEL_SEQ_CST;
7222 :
7223 : /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
7224 : Failing that, a store is issued by __atomic_store. The only way this can
7225 : fail is if the bool type is larger than a word size. Unlikely, but
7226 : handle it anyway for completeness. Assume a single threaded model since
7227 : there is no atomic support in this case, and no barriers are required. */
7228 53 : rtx ret = expand_atomic_store (mem, const0_rtx, model, true);
7229 53 : if (!ret)
7230 0 : emit_move_insn (mem, const0_rtx);
7231 53 : return const0_rtx;
7232 : }
7233 :
7234 : /* Expand an atomic test_and_set operation.
7235 : bool _atomic_test_and_set (BOOL *obj, enum memmodel)
7236 : EXP is the call expression. */
7237 :
7238 : static rtx
7239 266 : expand_builtin_atomic_test_and_set (tree exp, rtx target)
7240 : {
7241 266 : rtx mem;
7242 266 : enum memmodel model;
7243 266 : machine_mode mode;
7244 :
7245 266 : mode = int_mode_for_size (BOOL_TYPE_SIZE, 0).require ();
7246 266 : mem = get_builtin_sync_mem (CALL_EXPR_ARG (exp, 0), mode);
7247 266 : model = get_memmodel (CALL_EXPR_ARG (exp, 1));
7248 :
7249 266 : return expand_atomic_test_and_set (target, mem, model);
7250 : }
7251 :
7252 :
7253 : /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
7254 : this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
7255 :
7256 : static tree
7257 138168 : fold_builtin_atomic_always_lock_free (tree arg0, tree arg1)
7258 : {
7259 138168 : int size;
7260 138168 : machine_mode mode;
7261 138168 : unsigned int mode_align, type_align;
7262 :
7263 138168 : if (TREE_CODE (arg0) != INTEGER_CST)
7264 : return NULL_TREE;
7265 :
7266 : /* We need a corresponding integer mode for the access to be lock-free. */
7267 138074 : size = INTVAL (expand_normal (arg0)) * BITS_PER_UNIT;
7268 138074 : if (!int_mode_for_size (size, 0).exists (&mode))
7269 9 : return boolean_false_node;
7270 :
7271 138065 : mode_align = GET_MODE_ALIGNMENT (mode);
7272 :
7273 138065 : if (TREE_CODE (arg1) == INTEGER_CST)
7274 : {
7275 119256 : unsigned HOST_WIDE_INT val = UINTVAL (expand_normal (arg1));
7276 :
7277 : /* Either this argument is null, or it's a fake pointer encoding
7278 : the alignment of the object. */
7279 119256 : val = least_bit_hwi (val);
7280 119256 : val *= BITS_PER_UNIT;
7281 :
7282 119256 : if (val == 0 || mode_align < val)
7283 : type_align = mode_align;
7284 : else
7285 18210 : type_align = val;
7286 : }
7287 : else
7288 : {
7289 18809 : tree ttype = TREE_TYPE (arg1);
7290 :
7291 : /* This function is usually invoked and folded immediately by the front
7292 : end before anything else has a chance to look at it. The pointer
7293 : parameter at this point is usually cast to a void *, so check for that
7294 : and look past the cast. */
7295 63 : if (CONVERT_EXPR_P (arg1)
7296 18777 : && POINTER_TYPE_P (ttype)
7297 18777 : && VOID_TYPE_P (TREE_TYPE (ttype))
7298 37586 : && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (arg1, 0))))
7299 18746 : arg1 = TREE_OPERAND (arg1, 0);
7300 :
7301 18809 : ttype = TREE_TYPE (arg1);
7302 18809 : gcc_assert (POINTER_TYPE_P (ttype));
7303 :
7304 : /* Get the underlying type of the object. */
7305 18809 : ttype = TREE_TYPE (ttype);
7306 18809 : type_align = TYPE_ALIGN (ttype);
7307 : }
7308 :
7309 : /* If the object has smaller alignment, the lock free routines cannot
7310 : be used. */
7311 138065 : if (type_align < mode_align)
7312 86 : return boolean_false_node;
7313 :
7314 : /* Check if a compare_and_swap pattern exists for the mode which represents
7315 : the required size. The pattern is not allowed to fail, so the existence
7316 : of the pattern indicates support is present. Also require that an
7317 : atomic load exists for the required size. */
7318 137979 : if (can_compare_and_swap_p (mode, true) && can_atomic_load_p (mode))
7319 137938 : return boolean_true_node;
7320 : else
7321 41 : return boolean_false_node;
7322 : }
7323 :
7324 : /* Return true if the parameters to call EXP represent an object which will
7325 : always generate lock free instructions. The first argument represents the
7326 : size of the object, and the second parameter is a pointer to the object
7327 : itself. If NULL is passed for the object, then the result is based on
7328 : typical alignment for an object of the specified size. Otherwise return
7329 : false. */
7330 :
7331 : static rtx
7332 1 : expand_builtin_atomic_always_lock_free (tree exp)
7333 : {
7334 1 : tree size;
7335 1 : tree arg0 = CALL_EXPR_ARG (exp, 0);
7336 1 : tree arg1 = CALL_EXPR_ARG (exp, 1);
7337 :
7338 1 : if (TREE_CODE (arg0) != INTEGER_CST)
7339 : {
7340 1 : error ("non-constant argument 1 to %qs", "__atomic_always_lock_free");
7341 1 : return const0_rtx;
7342 : }
7343 :
7344 0 : size = fold_builtin_atomic_always_lock_free (arg0, arg1);
7345 0 : if (size == boolean_true_node)
7346 0 : return const1_rtx;
7347 0 : return const0_rtx;
7348 : }
7349 :
7350 : /* Return a one or zero if it can be determined that object ARG1 of size ARG
7351 : is lock free on this architecture. */
7352 :
7353 : static tree
7354 37062 : fold_builtin_atomic_is_lock_free (tree arg0, tree arg1)
7355 : {
7356 37062 : if (!flag_inline_atomics)
7357 : return NULL_TREE;
7358 :
7359 : /* If it isn't always lock free, don't generate a result. */
7360 37053 : if (fold_builtin_atomic_always_lock_free (arg0, arg1) == boolean_true_node)
7361 : return boolean_true_node;
7362 :
7363 : return NULL_TREE;
7364 : }
7365 :
7366 : /* Return true if the parameters to call EXP represent an object which will
7367 : always generate lock free instructions. The first argument represents the
7368 : size of the object, and the second parameter is a pointer to the object
7369 : itself. If NULL is passed for the object, then the result is based on
7370 : typical alignment for an object of the specified size. Otherwise return
7371 : NULL*/
7372 :
7373 : static rtx
7374 3 : expand_builtin_atomic_is_lock_free (tree exp)
7375 : {
7376 3 : tree size;
7377 3 : tree arg0 = CALL_EXPR_ARG (exp, 0);
7378 3 : tree arg1 = CALL_EXPR_ARG (exp, 1);
7379 :
7380 3 : if (!INTEGRAL_TYPE_P (TREE_TYPE (arg0)))
7381 : {
7382 0 : error ("non-integer argument 1 to %qs", "__atomic_is_lock_free");
7383 0 : return NULL_RTX;
7384 : }
7385 :
7386 3 : if (!flag_inline_atomics)
7387 : return NULL_RTX;
7388 :
7389 : /* If the value is known at compile time, return the RTX for it. */
7390 2 : size = fold_builtin_atomic_is_lock_free (arg0, arg1);
7391 2 : if (size == boolean_true_node)
7392 0 : return const1_rtx;
7393 :
7394 : return NULL_RTX;
7395 : }
7396 :
7397 : /* Expand the __atomic_thread_fence intrinsic:
7398 : void __atomic_thread_fence (enum memmodel)
7399 : EXP is the CALL_EXPR. */
7400 :
7401 : static void
7402 691 : expand_builtin_atomic_thread_fence (tree exp)
7403 : {
7404 691 : enum memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 0));
7405 691 : expand_mem_thread_fence (model);
7406 691 : }
7407 :
7408 : /* Expand the __atomic_signal_fence intrinsic:
7409 : void __atomic_signal_fence (enum memmodel)
7410 : EXP is the CALL_EXPR. */
7411 :
7412 : static void
7413 60 : expand_builtin_atomic_signal_fence (tree exp)
7414 : {
7415 60 : enum memmodel model = get_memmodel (CALL_EXPR_ARG (exp, 0));
7416 60 : expand_mem_signal_fence (model);
7417 60 : }
7418 :
7419 : /* Expand the __sync_synchronize intrinsic. */
7420 :
7421 : static void
7422 273 : expand_builtin_sync_synchronize (void)
7423 : {
7424 0 : expand_mem_thread_fence (MEMMODEL_SYNC_SEQ_CST);
7425 0 : }
7426 :
7427 : static rtx
7428 3 : expand_builtin_thread_pointer (tree exp, rtx target)
7429 : {
7430 3 : enum insn_code icode;
7431 3 : if (!validate_arglist (exp, VOID_TYPE))
7432 0 : return const0_rtx;
7433 3 : icode = direct_optab_handler (get_thread_pointer_optab, Pmode);
7434 3 : if (icode != CODE_FOR_nothing)
7435 : {
7436 3 : class expand_operand op;
7437 : /* If the target is not sutitable then create a new target. */
7438 3 : if (target == NULL_RTX
7439 3 : || !REG_P (target)
7440 6 : || GET_MODE (target) != Pmode)
7441 0 : target = gen_reg_rtx (Pmode);
7442 3 : create_output_operand (&op, target, Pmode);
7443 3 : expand_insn (icode, 1, &op);
7444 3 : return target;
7445 : }
7446 0 : error ("%<__builtin_thread_pointer%> is not supported on this target");
7447 0 : return const0_rtx;
7448 : }
7449 :
7450 : static void
7451 0 : expand_builtin_set_thread_pointer (tree exp)
7452 : {
7453 0 : enum insn_code icode;
7454 0 : if (!validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
7455 : return;
7456 0 : icode = direct_optab_handler (set_thread_pointer_optab, Pmode);
7457 0 : if (icode != CODE_FOR_nothing)
7458 : {
7459 0 : class expand_operand op;
7460 0 : rtx val = expand_expr (CALL_EXPR_ARG (exp, 0), NULL_RTX,
7461 0 : Pmode, EXPAND_NORMAL);
7462 0 : create_input_operand (&op, val, Pmode);
7463 0 : expand_insn (icode, 1, &op);
7464 0 : return;
7465 : }
7466 0 : error ("%<__builtin_set_thread_pointer%> is not supported on this target");
7467 : }
7468 :
7469 :
7470 : /* Emit code to restore the current value of stack. */
7471 :
7472 : static void
7473 1718 : expand_stack_restore (tree var)
7474 : {
7475 1718 : rtx_insn *prev;
7476 1718 : rtx sa = expand_normal (var);
7477 :
7478 1718 : sa = convert_memory_address (Pmode, sa);
7479 :
7480 1718 : prev = get_last_insn ();
7481 1718 : emit_stack_restore (SAVE_BLOCK, sa);
7482 :
7483 1718 : record_new_stack_level ();
7484 :
7485 1718 : fixup_args_size_notes (prev, get_last_insn (), 0);
7486 1718 : }
7487 :
7488 : /* Emit code to save the current value of stack. */
7489 :
7490 : static rtx
7491 1819 : expand_stack_save (void)
7492 : {
7493 1819 : rtx ret = NULL_RTX;
7494 :
7495 0 : emit_stack_save (SAVE_BLOCK, &ret);
7496 1819 : return ret;
7497 : }
7498 :
7499 : /* Emit code to get the openacc gang, worker or vector id or size. */
7500 :
7501 : static rtx
7502 356 : expand_builtin_goacc_parlevel_id_size (tree exp, rtx target, int ignore)
7503 : {
7504 356 : const char *name;
7505 356 : rtx fallback_retval;
7506 356 : rtx_insn *(*gen_fn) (rtx, rtx);
7507 356 : switch (DECL_FUNCTION_CODE (get_callee_fndecl (exp)))
7508 : {
7509 244 : case BUILT_IN_GOACC_PARLEVEL_ID:
7510 244 : name = "__builtin_goacc_parlevel_id";
7511 244 : fallback_retval = const0_rtx;
7512 244 : gen_fn = targetm.gen_oacc_dim_pos;
7513 244 : break;
7514 112 : case BUILT_IN_GOACC_PARLEVEL_SIZE:
7515 112 : name = "__builtin_goacc_parlevel_size";
7516 112 : fallback_retval = const1_rtx;
7517 112 : gen_fn = targetm.gen_oacc_dim_size;
7518 112 : break;
7519 0 : default:
7520 0 : gcc_unreachable ();
7521 : }
7522 :
7523 356 : if (oacc_get_fn_attrib (current_function_decl) == NULL_TREE)
7524 : {
7525 8 : error ("%qs only supported in OpenACC code", name);
7526 8 : return const0_rtx;
7527 : }
7528 :
7529 348 : tree arg = CALL_EXPR_ARG (exp, 0);
7530 348 : if (TREE_CODE (arg) != INTEGER_CST)
7531 : {
7532 8 : error ("non-constant argument 0 to %qs", name);
7533 8 : return const0_rtx;
7534 : }
7535 :
7536 340 : int dim = TREE_INT_CST_LOW (arg);
7537 340 : switch (dim)
7538 : {
7539 324 : case GOMP_DIM_GANG:
7540 324 : case GOMP_DIM_WORKER:
7541 324 : case GOMP_DIM_VECTOR:
7542 324 : break;
7543 16 : default:
7544 16 : error ("illegal argument 0 to %qs", name);
7545 16 : return const0_rtx;
7546 : }
7547 :
7548 324 : if (ignore)
7549 : return target;
7550 :
7551 180 : if (target == NULL_RTX)
7552 0 : target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
7553 :
7554 180 : if (!targetm.have_oacc_dim_size ())
7555 : {
7556 180 : emit_move_insn (target, fallback_retval);
7557 180 : return target;
7558 : }
7559 :
7560 0 : rtx reg = MEM_P (target) ? gen_reg_rtx (GET_MODE (target)) : target;
7561 0 : emit_insn (gen_fn (reg, GEN_INT (dim)));
7562 0 : if (reg != target)
7563 0 : emit_move_insn (target, reg);
7564 :
7565 : return target;
7566 : }
7567 :
7568 : /* Expand a string compare operation using a sequence of char comparison
7569 : to get rid of the calling overhead, with result going to TARGET if
7570 : that's convenient.
7571 :
7572 : VAR_STR is the variable string source;
7573 : CONST_STR is the constant string source;
7574 : LENGTH is the number of chars to compare;
7575 : CONST_STR_N indicates which source string is the constant string;
7576 : IS_MEMCMP indicates whether it's a memcmp or strcmp.
7577 :
7578 : to: (assume const_str_n is 2, i.e., arg2 is a constant string)
7579 :
7580 : target = (int) (unsigned char) var_str[0]
7581 : - (int) (unsigned char) const_str[0];
7582 : if (target != 0)
7583 : goto ne_label;
7584 : ...
7585 : target = (int) (unsigned char) var_str[length - 2]
7586 : - (int) (unsigned char) const_str[length - 2];
7587 : if (target != 0)
7588 : goto ne_label;
7589 : target = (int) (unsigned char) var_str[length - 1]
7590 : - (int) (unsigned char) const_str[length - 1];
7591 : ne_label:
7592 : */
7593 :
7594 : static rtx
7595 623 : inline_string_cmp (rtx target, tree var_str, const char *const_str,
7596 : unsigned HOST_WIDE_INT length,
7597 : int const_str_n, machine_mode mode)
7598 : {
7599 623 : HOST_WIDE_INT offset = 0;
7600 623 : rtx var_rtx_array
7601 623 : = get_memory_rtx (var_str, build_int_cst (unsigned_type_node,length));
7602 623 : rtx var_rtx = NULL_RTX;
7603 623 : rtx const_rtx = NULL_RTX;
7604 623 : rtx result = target ? target : gen_reg_rtx (mode);
7605 623 : rtx_code_label *ne_label = gen_label_rtx ();
7606 623 : tree unit_type_node = unsigned_char_type_node;
7607 623 : scalar_int_mode unit_mode
7608 623 : = as_a <scalar_int_mode> TYPE_MODE (unit_type_node);
7609 :
7610 623 : start_sequence ();
7611 :
7612 2281 : for (unsigned HOST_WIDE_INT i = 0; i < length; i++)
7613 : {
7614 1658 : var_rtx
7615 1658 : = adjust_address (var_rtx_array, TYPE_MODE (unit_type_node), offset);
7616 1658 : const_rtx = c_readstr (const_str + offset, unit_mode);
7617 1658 : rtx op0 = (const_str_n == 1) ? const_rtx : var_rtx;
7618 1508 : rtx op1 = (const_str_n == 1) ? var_rtx : const_rtx;
7619 :
7620 1658 : op0 = convert_modes (mode, unit_mode, op0, 1);
7621 1658 : op1 = convert_modes (mode, unit_mode, op1, 1);
7622 1658 : rtx diff = expand_simple_binop (mode, MINUS, op0, op1,
7623 : result, 1, OPTAB_WIDEN);
7624 :
7625 : /* Force the difference into result register. We cannot reassign
7626 : result here ("result = diff") or we may end up returning
7627 : uninitialized result when expand_simple_binop allocates a new
7628 : pseudo-register for returning. */
7629 1658 : if (diff != result)
7630 0 : emit_move_insn (result, diff);
7631 :
7632 1658 : if (i < length - 1)
7633 1035 : emit_cmp_and_jump_insns (result, CONST0_RTX (mode), NE, NULL_RTX,
7634 : mode, true, ne_label);
7635 3316 : offset += GET_MODE_SIZE (unit_mode);
7636 : }
7637 :
7638 623 : emit_label (ne_label);
7639 623 : rtx_insn *insns = end_sequence ();
7640 623 : emit_insn (insns);
7641 :
7642 623 : return result;
7643 : }
7644 :
7645 : /* Inline expansion of a call to str(n)cmp and memcmp, with result going
7646 : to TARGET if that's convenient.
7647 : If the call is not been inlined, return NULL_RTX. */
7648 :
7649 : static rtx
7650 144628 : inline_expand_builtin_bytecmp (tree exp, rtx target)
7651 : {
7652 144628 : tree fndecl = get_callee_fndecl (exp);
7653 144628 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7654 144628 : bool is_ncmp = (fcode == BUILT_IN_STRNCMP || fcode == BUILT_IN_MEMCMP);
7655 :
7656 : /* Do NOT apply this inlining expansion when optimizing for size or
7657 : optimization level below 2 or if unused *cmp hasn't been DCEd. */
7658 144628 : if (optimize < 2 || optimize_insn_for_size_p () || target == const0_rtx)
7659 122106 : return NULL_RTX;
7660 :
7661 22522 : gcc_checking_assert (fcode == BUILT_IN_STRCMP
7662 : || fcode == BUILT_IN_STRNCMP
7663 : || fcode == BUILT_IN_MEMCMP);
7664 :
7665 : /* On a target where the type of the call (int) has same or narrower precision
7666 : than unsigned char, give up the inlining expansion. */
7667 22522 : if (TYPE_PRECISION (unsigned_char_type_node)
7668 22522 : >= TYPE_PRECISION (TREE_TYPE (exp)))
7669 : return NULL_RTX;
7670 :
7671 22522 : tree arg1 = CALL_EXPR_ARG (exp, 0);
7672 22522 : tree arg2 = CALL_EXPR_ARG (exp, 1);
7673 22522 : tree len3_tree = is_ncmp ? CALL_EXPR_ARG (exp, 2) : NULL_TREE;
7674 :
7675 22522 : unsigned HOST_WIDE_INT len1 = 0;
7676 22522 : unsigned HOST_WIDE_INT len2 = 0;
7677 22522 : unsigned HOST_WIDE_INT len3 = 0;
7678 :
7679 : /* Get the object representation of the initializers of ARG1 and ARG2
7680 : as strings, provided they refer to constant objects, with their byte
7681 : sizes in LEN1 and LEN2, respectively. */
7682 22522 : const char *bytes1 = getbyterep (arg1, &len1);
7683 22522 : const char *bytes2 = getbyterep (arg2, &len2);
7684 :
7685 : /* Fail if neither argument refers to an initialized constant. */
7686 22522 : if (!bytes1 && !bytes2)
7687 : return NULL_RTX;
7688 :
7689 18436 : if (is_ncmp)
7690 : {
7691 : /* Fail if the memcmp/strncmp bound is not a constant. */
7692 1322 : if (!tree_fits_uhwi_p (len3_tree))
7693 : return NULL_RTX;
7694 :
7695 954 : len3 = tree_to_uhwi (len3_tree);
7696 :
7697 954 : if (fcode == BUILT_IN_MEMCMP)
7698 : {
7699 : /* Fail if the memcmp bound is greater than the size of either
7700 : of the two constant objects. */
7701 450 : if ((bytes1 && len1 < len3)
7702 450 : || (bytes2 && len2 < len3))
7703 : return NULL_RTX;
7704 : }
7705 : }
7706 :
7707 : if (fcode != BUILT_IN_MEMCMP)
7708 : {
7709 : /* For string functions (i.e., strcmp and strncmp) reduce LEN1
7710 : and LEN2 to the length of the nul-terminated string stored
7711 : in each. */
7712 17618 : if (bytes1 != NULL)
7713 240 : len1 = strnlen (bytes1, len1) + 1;
7714 17618 : if (bytes2 != NULL)
7715 17381 : len2 = strnlen (bytes2, len2) + 1;
7716 : }
7717 :
7718 : /* See inline_string_cmp. */
7719 18064 : int const_str_n;
7720 18064 : if (!len1)
7721 : const_str_n = 2;
7722 245 : else if (!len2)
7723 : const_str_n = 1;
7724 3 : else if (len2 > len1)
7725 : const_str_n = 1;
7726 : else
7727 : const_str_n = 2;
7728 :
7729 : /* For strncmp only, compute the new bound as the smallest of
7730 : the lengths of the two strings (plus 1) and the bound provided
7731 : to the function. */
7732 17821 : unsigned HOST_WIDE_INT bound = (const_str_n == 1) ? len1 : len2;
7733 18064 : if (is_ncmp && len3 < bound)
7734 526 : bound = len3;
7735 :
7736 : /* If the bound of the comparison is larger than the threshold,
7737 : do nothing. */
7738 18064 : if (bound > (unsigned HOST_WIDE_INT) param_builtin_string_cmp_inline_length)
7739 : return NULL_RTX;
7740 :
7741 623 : machine_mode mode = TYPE_MODE (TREE_TYPE (exp));
7742 :
7743 : /* Now, start inline expansion the call. */
7744 1189 : return inline_string_cmp (target, (const_str_n == 1) ? arg2 : arg1,
7745 : (const_str_n == 1) ? bytes1 : bytes2, bound,
7746 623 : const_str_n, mode);
7747 : }
7748 :
7749 : /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
7750 : represents the size of the first argument to that call, or VOIDmode
7751 : if the argument is a pointer. IGNORE will be true if the result
7752 : isn't used. */
7753 : static rtx
7754 34 : expand_speculation_safe_value (machine_mode mode, tree exp, rtx target,
7755 : bool ignore)
7756 : {
7757 34 : rtx val, failsafe;
7758 34 : unsigned nargs = call_expr_nargs (exp);
7759 :
7760 34 : tree arg0 = CALL_EXPR_ARG (exp, 0);
7761 :
7762 34 : if (mode == VOIDmode)
7763 : {
7764 4 : mode = TYPE_MODE (TREE_TYPE (arg0));
7765 4 : gcc_assert (GET_MODE_CLASS (mode) == MODE_INT);
7766 : }
7767 :
7768 34 : val = expand_expr (arg0, NULL_RTX, mode, EXPAND_NORMAL);
7769 :
7770 : /* An optional second argument can be used as a failsafe value on
7771 : some machines. If it isn't present, then the failsafe value is
7772 : assumed to be 0. */
7773 34 : if (nargs > 1)
7774 : {
7775 4 : tree arg1 = CALL_EXPR_ARG (exp, 1);
7776 4 : failsafe = expand_expr (arg1, NULL_RTX, mode, EXPAND_NORMAL);
7777 : }
7778 : else
7779 30 : failsafe = const0_rtx;
7780 :
7781 : /* If the result isn't used, the behavior is undefined. It would be
7782 : nice to emit a warning here, but path splitting means this might
7783 : happen with legitimate code. So simply drop the builtin
7784 : expansion in that case; we've handled any side-effects above. */
7785 34 : if (ignore)
7786 0 : return const0_rtx;
7787 :
7788 : /* If we don't have a suitable target, create one to hold the result. */
7789 34 : if (target == NULL || GET_MODE (target) != mode)
7790 0 : target = gen_reg_rtx (mode);
7791 :
7792 34 : if (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode)
7793 0 : val = convert_modes (mode, VOIDmode, val, false);
7794 :
7795 34 : return targetm.speculation_safe_value (mode, target, val, failsafe);
7796 : }
7797 :
7798 : /* Expand CRC* or REV_CRC* built-ins. */
7799 :
7800 : rtx
7801 36 : expand_builtin_crc_table_based (internal_fn fn, scalar_mode crc_mode,
7802 : scalar_mode data_mode, machine_mode mode,
7803 : tree exp, rtx target)
7804 : {
7805 36 : tree rhs1 = CALL_EXPR_ARG (exp, 0); // crc
7806 36 : tree rhs2 = CALL_EXPR_ARG (exp, 1); // data
7807 36 : tree rhs3 = CALL_EXPR_ARG (exp, 2); // polynomial
7808 :
7809 36 : if (!target || mode == VOIDmode)
7810 0 : target = gen_reg_rtx (crc_mode);
7811 :
7812 36 : rtx op1 = expand_normal (rhs1);
7813 36 : rtx op2 = expand_normal (rhs2);
7814 36 : rtx op3;
7815 36 : if (TREE_CODE (rhs3) != INTEGER_CST)
7816 : {
7817 1 : error ("third argument to %<crc%> builtins must be a constant");
7818 1 : op3 = const0_rtx;
7819 : }
7820 : else
7821 35 : op3 = convert_to_mode (crc_mode, expand_normal (rhs3), 0);
7822 :
7823 36 : if (CONST_INT_P (op2))
7824 35 : op2 = convert_to_mode (crc_mode, op2, 0);
7825 :
7826 36 : if (fn == IFN_CRC)
7827 19 : expand_crc_table_based (target, op1, op2, op3, data_mode);
7828 : else
7829 : /* If it's IFN_CRC_REV generate bit-reversed CRC. */
7830 17 : expand_reversed_crc_table_based (target, op1, op2, op3,
7831 : data_mode);
7832 36 : return target;
7833 : }
7834 :
7835 : /* Expand an expression EXP that calls a built-in function,
7836 : with result going to TARGET if that's convenient
7837 : (and in mode MODE if that's convenient).
7838 : SUBTARGET may be used as the target for computing one of EXP's operands.
7839 : IGNORE is nonzero if the value is to be ignored. */
7840 :
7841 : rtx
7842 1971869 : expand_builtin (tree exp, rtx target, rtx subtarget, machine_mode mode,
7843 : int ignore)
7844 : {
7845 1971869 : tree fndecl = get_callee_fndecl (exp);
7846 1971869 : machine_mode target_mode = TYPE_MODE (TREE_TYPE (exp));
7847 1971869 : int flags;
7848 :
7849 1971869 : if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
7850 174823 : return targetm.expand_builtin (exp, target, subtarget, mode, ignore);
7851 :
7852 : /* When ASan is enabled, we don't want to expand some memory/string
7853 : builtins and rely on libsanitizer's hooks. This allows us to avoid
7854 : redundant checks and be sure, that possible overflow will be detected
7855 : by ASan. */
7856 :
7857 1797046 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
7858 1797046 : if (param_asan_kernel_mem_intrinsic_prefix
7859 1797046 : && sanitize_flags_p (SANITIZE_KERNEL_ADDRESS
7860 : | SANITIZE_KERNEL_HWADDRESS))
7861 42 : switch (fcode)
7862 : {
7863 42 : rtx save_decl_rtl, ret;
7864 42 : case BUILT_IN_MEMCPY:
7865 42 : case BUILT_IN_MEMMOVE:
7866 42 : case BUILT_IN_MEMSET:
7867 42 : save_decl_rtl = DECL_RTL (fndecl);
7868 42 : DECL_RTL (fndecl) = asan_memfn_rtl (fndecl);
7869 42 : ret = expand_call (exp, target, ignore);
7870 42 : DECL_RTL (fndecl) = save_decl_rtl;
7871 42 : return ret;
7872 : default:
7873 : break;
7874 : }
7875 1797004 : if (sanitize_flags_p (SANITIZE_ADDRESS | SANITIZE_HWADDRESS)
7876 1797004 : && asan_intercepted_p (fcode))
7877 873 : return expand_call (exp, target, ignore);
7878 :
7879 : /* When not optimizing, generate calls to library functions for a certain
7880 : set of builtins. */
7881 1796131 : if (!optimize
7882 430219 : && !called_as_built_in (fndecl)
7883 144768 : && fcode != BUILT_IN_FORK
7884 144768 : && fcode != BUILT_IN_EXECL
7885 144755 : && fcode != BUILT_IN_EXECV
7886 144755 : && fcode != BUILT_IN_EXECLP
7887 144753 : && fcode != BUILT_IN_EXECLE
7888 144753 : && fcode != BUILT_IN_EXECVP
7889 144752 : && fcode != BUILT_IN_EXECVE
7890 144752 : && fcode != BUILT_IN_CLEAR_CACHE
7891 144749 : && !ALLOCA_FUNCTION_CODE_P (fcode)
7892 144695 : && fcode != BUILT_IN_FREE
7893 142557 : && (fcode != BUILT_IN_MEMSET
7894 55892 : || !(flag_inline_stringops & ILSOP_MEMSET))
7895 142554 : && (fcode != BUILT_IN_MEMCPY
7896 918 : || !(flag_inline_stringops & ILSOP_MEMCPY))
7897 142418 : && (fcode != BUILT_IN_MEMMOVE
7898 348 : || !(flag_inline_stringops & ILSOP_MEMMOVE))
7899 1938549 : && (fcode != BUILT_IN_MEMCMP
7900 2505 : || !(flag_inline_stringops & ILSOP_MEMCMP)))
7901 142370 : return expand_call (exp, target, ignore);
7902 :
7903 : /* The built-in function expanders test for target == const0_rtx
7904 : to determine whether the function's result will be ignored. */
7905 1653761 : if (ignore)
7906 964542 : target = const0_rtx;
7907 :
7908 : /* If the result of a pure or const built-in function is ignored, and
7909 : none of its arguments are volatile, we can avoid expanding the
7910 : built-in call and just evaluate the arguments for side-effects. */
7911 1653761 : if (target == const0_rtx
7912 964542 : && ((flags = flags_from_decl_or_type (fndecl)) & (ECF_CONST | ECF_PURE))
7913 1658549 : && !(flags & ECF_LOOPING_CONST_OR_PURE))
7914 : {
7915 6 : bool volatilep = false;
7916 6 : tree arg;
7917 6 : call_expr_arg_iterator iter;
7918 :
7919 20 : FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
7920 8 : if (TREE_THIS_VOLATILE (arg))
7921 : {
7922 : volatilep = true;
7923 : break;
7924 : }
7925 :
7926 6 : if (! volatilep)
7927 : {
7928 20 : FOR_EACH_CALL_EXPR_ARG (arg, iter, exp)
7929 8 : expand_expr (arg, const0_rtx, VOIDmode, EXPAND_NORMAL);
7930 6 : return const0_rtx;
7931 : }
7932 : }
7933 :
7934 1653755 : switch (fcode)
7935 : {
7936 4 : CASE_FLT_FN (BUILT_IN_FABS):
7937 4 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FABS):
7938 4 : case BUILT_IN_FABSD32:
7939 4 : case BUILT_IN_FABSD64:
7940 4 : case BUILT_IN_FABSD128:
7941 4 : case BUILT_IN_FABSD64X:
7942 4 : target = expand_builtin_fabs (exp, target, subtarget);
7943 4 : if (target)
7944 815070 : return target;
7945 838685 : break;
7946 :
7947 11673 : CASE_FLT_FN (BUILT_IN_COPYSIGN):
7948 11673 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_COPYSIGN):
7949 11673 : target = expand_builtin_copysign (exp, target, subtarget);
7950 11673 : if (target)
7951 : return target;
7952 : break;
7953 :
7954 : /* Just do a normal library call if we were unable to fold
7955 : the values. */
7956 : CASE_FLT_FN (BUILT_IN_CABS):
7957 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_CABS):
7958 : break;
7959 :
7960 368 : CASE_FLT_FN (BUILT_IN_FMA):
7961 368 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMA):
7962 368 : target = expand_builtin_mathfn_ternary (exp, target, subtarget);
7963 368 : if (target)
7964 : return target;
7965 : break;
7966 :
7967 232 : CASE_FLT_FN (BUILT_IN_ILOGB):
7968 232 : if (! flag_unsafe_math_optimizations)
7969 : break;
7970 4 : gcc_fallthrough ();
7971 4 : CASE_FLT_FN (BUILT_IN_ISINF):
7972 4 : CASE_FLT_FN (BUILT_IN_FINITE):
7973 4 : CASE_FLT_FN (BUILT_IN_ISNAN):
7974 4 : case BUILT_IN_ISFINITE:
7975 4 : case BUILT_IN_ISNORMAL:
7976 4 : target = expand_builtin_interclass_mathfn (exp, target);
7977 4 : if (target)
7978 : return target;
7979 : break;
7980 :
7981 784 : case BUILT_IN_ISSIGNALING:
7982 784 : target = expand_builtin_issignaling (exp, target);
7983 784 : if (target)
7984 : return target;
7985 : break;
7986 :
7987 223 : CASE_FLT_FN (BUILT_IN_ICEIL):
7988 223 : CASE_FLT_FN (BUILT_IN_LCEIL):
7989 223 : CASE_FLT_FN (BUILT_IN_LLCEIL):
7990 223 : CASE_FLT_FN (BUILT_IN_LFLOOR):
7991 223 : CASE_FLT_FN (BUILT_IN_IFLOOR):
7992 223 : CASE_FLT_FN (BUILT_IN_LLFLOOR):
7993 223 : target = expand_builtin_int_roundingfn (exp, target);
7994 223 : if (target)
7995 : return target;
7996 : break;
7997 :
7998 588 : CASE_FLT_FN (BUILT_IN_IRINT):
7999 588 : CASE_FLT_FN (BUILT_IN_LRINT):
8000 588 : CASE_FLT_FN (BUILT_IN_LLRINT):
8001 588 : CASE_FLT_FN (BUILT_IN_IROUND):
8002 588 : CASE_FLT_FN (BUILT_IN_LROUND):
8003 588 : CASE_FLT_FN (BUILT_IN_LLROUND):
8004 588 : target = expand_builtin_int_roundingfn_2 (exp, target);
8005 588 : if (target)
8006 : return target;
8007 : break;
8008 :
8009 292 : CASE_FLT_FN (BUILT_IN_POWI):
8010 292 : target = expand_builtin_powi (exp, target);
8011 292 : if (target)
8012 : return target;
8013 : break;
8014 :
8015 164 : CASE_FLT_FN (BUILT_IN_CEXPI):
8016 164 : target = expand_builtin_cexpi (exp, target);
8017 164 : gcc_assert (target);
8018 : return target;
8019 :
8020 993 : CASE_FLT_FN (BUILT_IN_SIN):
8021 993 : CASE_FLT_FN (BUILT_IN_COS):
8022 993 : if (! flag_unsafe_math_optimizations)
8023 : break;
8024 47 : target = expand_builtin_mathfn_3 (exp, target, subtarget);
8025 47 : if (target)
8026 : return target;
8027 : break;
8028 :
8029 158 : CASE_FLT_FN (BUILT_IN_SINCOS):
8030 158 : if (! flag_unsafe_math_optimizations)
8031 : break;
8032 3 : target = expand_builtin_sincos (exp);
8033 3 : if (target)
8034 : return target;
8035 : break;
8036 :
8037 60 : case BUILT_IN_FEGETROUND:
8038 60 : target = expand_builtin_fegetround (exp, target, target_mode);
8039 60 : if (target)
8040 : return target;
8041 : break;
8042 :
8043 1063 : case BUILT_IN_FECLEAREXCEPT:
8044 1063 : target = expand_builtin_feclear_feraise_except (exp, target, target_mode,
8045 : feclearexcept_optab);
8046 1063 : if (target)
8047 : return target;
8048 : break;
8049 :
8050 831 : case BUILT_IN_FERAISEEXCEPT:
8051 831 : target = expand_builtin_feclear_feraise_except (exp, target, target_mode,
8052 : feraiseexcept_optab);
8053 831 : if (target)
8054 : return target;
8055 : break;
8056 :
8057 464 : case BUILT_IN_APPLY_ARGS:
8058 464 : return expand_builtin_apply_args ();
8059 :
8060 : /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
8061 : FUNCTION with a copy of the parameters described by
8062 : ARGUMENTS, and ARGSIZE. It returns a block of memory
8063 : allocated on the stack into which is stored all the registers
8064 : that might possibly be used for returning the result of a
8065 : function. ARGUMENTS is the value returned by
8066 : __builtin_apply_args. ARGSIZE is the number of bytes of
8067 : arguments that must be copied. ??? How should this value be
8068 : computed? We'll also need a safe worst case value for varargs
8069 : functions. */
8070 483 : case BUILT_IN_APPLY:
8071 483 : if (!validate_arglist (exp, POINTER_TYPE,
8072 : POINTER_TYPE, INTEGER_TYPE, VOID_TYPE)
8073 483 : && !validate_arglist (exp, REFERENCE_TYPE,
8074 : POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8075 0 : return const0_rtx;
8076 : else
8077 : {
8078 483 : rtx ops[3];
8079 :
8080 483 : ops[0] = expand_normal (CALL_EXPR_ARG (exp, 0));
8081 483 : ops[1] = expand_normal (CALL_EXPR_ARG (exp, 1));
8082 483 : ops[2] = expand_normal (CALL_EXPR_ARG (exp, 2));
8083 :
8084 483 : return expand_builtin_apply (ops[0], ops[1], ops[2]);
8085 : }
8086 :
8087 : /* __builtin_return (RESULT) causes the function to return the
8088 : value described by RESULT. RESULT is address of the block of
8089 : memory returned by __builtin_apply. */
8090 379 : case BUILT_IN_RETURN:
8091 379 : if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
8092 379 : expand_builtin_return (expand_normal (CALL_EXPR_ARG (exp, 0)));
8093 379 : return const0_rtx;
8094 :
8095 0 : case BUILT_IN_SAVEREGS:
8096 0 : return expand_builtin_saveregs ();
8097 :
8098 16 : case BUILT_IN_VA_ARG_PACK:
8099 : /* All valid uses of __builtin_va_arg_pack () are removed during
8100 : inlining. */
8101 16 : error ("invalid use of %<__builtin_va_arg_pack ()%>");
8102 16 : return const0_rtx;
8103 :
8104 0 : case BUILT_IN_VA_ARG_PACK_LEN:
8105 : /* All valid uses of __builtin_va_arg_pack_len () are removed during
8106 : inlining. */
8107 0 : error ("invalid use of %<__builtin_va_arg_pack_len ()%>");
8108 0 : return const0_rtx;
8109 :
8110 : /* Return the address of the first anonymous stack arg. */
8111 158 : case BUILT_IN_NEXT_ARG:
8112 158 : if (fold_builtin_next_arg (exp, false))
8113 0 : return const0_rtx;
8114 158 : return expand_builtin_next_arg ();
8115 :
8116 28 : case BUILT_IN_CLEAR_CACHE:
8117 28 : expand_builtin___clear_cache (exp);
8118 28 : return const0_rtx;
8119 :
8120 0 : case BUILT_IN_CLASSIFY_TYPE:
8121 0 : return expand_builtin_classify_type (exp);
8122 :
8123 0 : case BUILT_IN_CONSTANT_P:
8124 0 : return const0_rtx;
8125 :
8126 15922 : case BUILT_IN_FRAME_ADDRESS:
8127 15922 : case BUILT_IN_RETURN_ADDRESS:
8128 15922 : return expand_builtin_frame_address (fndecl, exp);
8129 :
8130 540 : case BUILT_IN_STACK_ADDRESS:
8131 540 : return expand_builtin_stack_address ();
8132 :
8133 2160 : case BUILT_IN___STRUB_ENTER:
8134 2160 : target = expand_builtin_strub_enter (exp);
8135 2160 : if (target)
8136 : return target;
8137 : break;
8138 :
8139 1072 : case BUILT_IN___STRUB_UPDATE:
8140 1072 : target = expand_builtin_strub_update (exp);
8141 1072 : if (target)
8142 : return target;
8143 : break;
8144 :
8145 2730 : case BUILT_IN___STRUB_LEAVE:
8146 2730 : target = expand_builtin_strub_leave (exp);
8147 2730 : if (target)
8148 : return target;
8149 : break;
8150 :
8151 : /* Returns the address of the area where the structure is returned.
8152 : 0 otherwise. */
8153 0 : case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
8154 0 : if (call_expr_nargs (exp) != 0
8155 0 : || ! AGGREGATE_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl)))
8156 0 : || !MEM_P (DECL_RTL (DECL_RESULT (current_function_decl))))
8157 0 : return const0_rtx;
8158 : else
8159 0 : return XEXP (DECL_RTL (DECL_RESULT (current_function_decl)), 0);
8160 :
8161 27738 : CASE_BUILT_IN_ALLOCA:
8162 27738 : target = expand_builtin_alloca (exp);
8163 27738 : if (target)
8164 : return target;
8165 : break;
8166 :
8167 204 : case BUILT_IN_ASAN_ALLOCAS_UNPOISON:
8168 204 : return expand_asan_emit_allocas_unpoison (exp);
8169 :
8170 1819 : case BUILT_IN_STACK_SAVE:
8171 1819 : return expand_stack_save ();
8172 :
8173 1718 : case BUILT_IN_STACK_RESTORE:
8174 1718 : expand_stack_restore (CALL_EXPR_ARG (exp, 0));
8175 1718 : return const0_rtx;
8176 :
8177 1230 : case BUILT_IN_BSWAP16:
8178 1230 : case BUILT_IN_BSWAP32:
8179 1230 : case BUILT_IN_BSWAP64:
8180 1230 : case BUILT_IN_BSWAP128:
8181 1230 : target = expand_builtin_bswap (target_mode, exp, target, subtarget);
8182 1230 : if (target)
8183 : return target;
8184 : break;
8185 :
8186 49 : case BUILT_IN_BITREVERSE8:
8187 49 : case BUILT_IN_BITREVERSE16:
8188 49 : case BUILT_IN_BITREVERSE32:
8189 49 : case BUILT_IN_BITREVERSE64:
8190 49 : case BUILT_IN_BITREVERSE128:
8191 49 : target = expand_builtin_unop (target_mode, exp, target, subtarget,
8192 : bitreverse_optab);
8193 49 : if (target)
8194 : return target;
8195 : break;
8196 :
8197 0 : CASE_INT_FN (BUILT_IN_FFS):
8198 0 : target = expand_builtin_unop (target_mode, exp, target,
8199 : subtarget, ffs_optab);
8200 0 : if (target)
8201 : return target;
8202 : break;
8203 :
8204 205 : CASE_INT_FN (BUILT_IN_CLZ):
8205 205 : target = expand_builtin_unop (target_mode, exp, target,
8206 : subtarget, clz_optab);
8207 205 : if (target)
8208 : return target;
8209 : break;
8210 :
8211 50 : CASE_INT_FN (BUILT_IN_CTZ):
8212 50 : target = expand_builtin_unop (target_mode, exp, target,
8213 : subtarget, ctz_optab);
8214 50 : if (target)
8215 : return target;
8216 : break;
8217 :
8218 91 : CASE_INT_FN (BUILT_IN_CLRSB):
8219 91 : target = expand_builtin_unop (target_mode, exp, target,
8220 : subtarget, clrsb_optab);
8221 91 : if (target)
8222 : return target;
8223 : break;
8224 :
8225 425 : CASE_INT_FN (BUILT_IN_POPCOUNT):
8226 425 : target = expand_builtin_unop (target_mode, exp, target,
8227 : subtarget, popcount_optab);
8228 425 : if (target)
8229 : return target;
8230 : break;
8231 :
8232 11 : CASE_INT_FN (BUILT_IN_PARITY):
8233 11 : target = expand_builtin_unop (target_mode, exp, target,
8234 : subtarget, parity_optab);
8235 11 : if (target)
8236 : return target;
8237 : break;
8238 :
8239 13472 : case BUILT_IN_STRLEN:
8240 13472 : target = expand_builtin_strlen (exp, target, target_mode);
8241 13472 : if (target)
8242 : return target;
8243 : break;
8244 :
8245 645 : case BUILT_IN_STRNLEN:
8246 645 : target = expand_builtin_strnlen (exp, target, target_mode);
8247 645 : if (target)
8248 : return target;
8249 : break;
8250 :
8251 1861 : case BUILT_IN_STRCPY:
8252 1861 : target = expand_builtin_strcpy (exp, target);
8253 1861 : if (target)
8254 : return target;
8255 : break;
8256 :
8257 2177 : case BUILT_IN_STRNCPY:
8258 2177 : target = expand_builtin_strncpy (exp, target);
8259 2177 : if (target)
8260 : return target;
8261 : break;
8262 :
8263 454 : case BUILT_IN_STPCPY:
8264 454 : target = expand_builtin_stpcpy (exp, target, mode);
8265 454 : if (target)
8266 : return target;
8267 : break;
8268 :
8269 101054 : case BUILT_IN_MEMCPY:
8270 101054 : target = expand_builtin_memcpy (exp, target);
8271 101054 : if (target)
8272 : return target;
8273 : break;
8274 :
8275 16710 : case BUILT_IN_MEMMOVE:
8276 16710 : target = expand_builtin_memmove (exp, target);
8277 16710 : if (target)
8278 : return target;
8279 : break;
8280 :
8281 1394 : case BUILT_IN_MEMPCPY:
8282 1394 : target = expand_builtin_mempcpy (exp, target);
8283 1394 : if (target)
8284 : return target;
8285 : break;
8286 :
8287 35327 : case BUILT_IN_MEMSET:
8288 35327 : target = expand_builtin_memset (exp, target, mode);
8289 35327 : if (target)
8290 : return target;
8291 : break;
8292 :
8293 0 : case BUILT_IN_BZERO:
8294 0 : target = expand_builtin_bzero (exp);
8295 0 : if (target)
8296 : return target;
8297 : break;
8298 :
8299 : /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
8300 : back to a BUILT_IN_STRCMP. Remember to delete the 3rd parameter
8301 : when changing it to a strcmp call. */
8302 368 : case BUILT_IN_STRCMP_EQ:
8303 368 : target = expand_builtin_memcmp (exp, target, true);
8304 368 : if (target)
8305 : return target;
8306 :
8307 : /* Change this call back to a BUILT_IN_STRCMP. */
8308 25 : TREE_OPERAND (exp, 1)
8309 25 : = build_fold_addr_expr (builtin_decl_explicit (BUILT_IN_STRCMP));
8310 :
8311 : /* Delete the last parameter. */
8312 25 : unsigned int i;
8313 25 : vec<tree, va_gc> *arg_vec;
8314 25 : vec_alloc (arg_vec, 2);
8315 100 : for (i = 0; i < 2; i++)
8316 50 : arg_vec->quick_push (CALL_EXPR_ARG (exp, i));
8317 25 : exp = build_call_vec (TREE_TYPE (exp), CALL_EXPR_FN (exp), arg_vec);
8318 : /* FALLTHROUGH */
8319 :
8320 127963 : case BUILT_IN_STRCMP:
8321 127963 : target = expand_builtin_strcmp (exp, target);
8322 127963 : if (target)
8323 : return target;
8324 : break;
8325 :
8326 : /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
8327 : back to a BUILT_IN_STRNCMP. */
8328 38 : case BUILT_IN_STRNCMP_EQ:
8329 38 : target = expand_builtin_memcmp (exp, target, true);
8330 38 : if (target)
8331 : return target;
8332 :
8333 : /* Change it back to a BUILT_IN_STRNCMP. */
8334 0 : TREE_OPERAND (exp, 1)
8335 0 : = build_fold_addr_expr (builtin_decl_explicit (BUILT_IN_STRNCMP));
8336 : /* FALLTHROUGH */
8337 :
8338 2030 : case BUILT_IN_STRNCMP:
8339 2030 : target = expand_builtin_strncmp (exp, target, mode);
8340 2030 : if (target)
8341 : return target;
8342 : break;
8343 :
8344 103766 : case BUILT_IN_BCMP:
8345 103766 : case BUILT_IN_MEMCMP:
8346 103766 : case BUILT_IN_MEMCMP_EQ:
8347 103766 : target = expand_builtin_memcmp (exp, target, fcode == BUILT_IN_MEMCMP_EQ);
8348 103766 : if (target)
8349 : return target;
8350 36327 : if (fcode == BUILT_IN_MEMCMP_EQ)
8351 : {
8352 22043 : tree newdecl = builtin_decl_explicit (BUILT_IN_MEMCMP);
8353 22043 : TREE_OPERAND (exp, 1) = build_fold_addr_expr (newdecl);
8354 : }
8355 : break;
8356 :
8357 0 : case BUILT_IN_SETJMP:
8358 : /* This should have been lowered to the builtins below. */
8359 0 : gcc_unreachable ();
8360 :
8361 841 : case BUILT_IN_SETJMP_SETUP:
8362 : /* __builtin_setjmp_setup is passed a pointer to an array of five words
8363 : and the receiver label. */
8364 841 : if (validate_arglist (exp, POINTER_TYPE, POINTER_TYPE, VOID_TYPE))
8365 : {
8366 841 : rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
8367 : VOIDmode, EXPAND_NORMAL);
8368 841 : tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 1), 0);
8369 841 : rtx_insn *label_r = label_rtx (label);
8370 :
8371 841 : expand_builtin_setjmp_setup (buf_addr, label_r);
8372 841 : return const0_rtx;
8373 : }
8374 : break;
8375 :
8376 841 : case BUILT_IN_SETJMP_RECEIVER:
8377 : /* __builtin_setjmp_receiver is passed the receiver label. */
8378 841 : if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
8379 : {
8380 841 : tree label = TREE_OPERAND (CALL_EXPR_ARG (exp, 0), 0);
8381 841 : rtx_insn *label_r = label_rtx (label);
8382 :
8383 841 : expand_builtin_setjmp_receiver (label_r);
8384 841 : nonlocal_goto_handler_labels
8385 1682 : = gen_rtx_INSN_LIST (VOIDmode, label_r,
8386 841 : nonlocal_goto_handler_labels);
8387 : /* ??? Do not let expand_label treat us as such since we would
8388 : not want to be both on the list of non-local labels and on
8389 : the list of forced labels. */
8390 841 : FORCED_LABEL (label) = 0;
8391 841 : return const0_rtx;
8392 : }
8393 : break;
8394 :
8395 : /* __builtin_longjmp is passed a pointer to an array of five words.
8396 : It's similar to the C library longjmp function but works with
8397 : __builtin_setjmp above. */
8398 391 : case BUILT_IN_LONGJMP:
8399 391 : if (validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
8400 : {
8401 391 : rtx buf_addr = expand_expr (CALL_EXPR_ARG (exp, 0), subtarget,
8402 : VOIDmode, EXPAND_NORMAL);
8403 391 : rtx value = expand_normal (CALL_EXPR_ARG (exp, 1));
8404 :
8405 391 : if (value != const1_rtx)
8406 : {
8407 0 : error ("%<__builtin_longjmp%> second argument must be 1");
8408 0 : return const0_rtx;
8409 : }
8410 :
8411 391 : expand_builtin_longjmp (buf_addr, value);
8412 391 : return const0_rtx;
8413 : }
8414 : break;
8415 :
8416 512 : case BUILT_IN_NONLOCAL_GOTO:
8417 512 : target = expand_builtin_nonlocal_goto (exp);
8418 512 : if (target)
8419 : return target;
8420 : break;
8421 :
8422 : /* This updates the setjmp buffer that is its argument with the value
8423 : of the current stack pointer. */
8424 0 : case BUILT_IN_UPDATE_SETJMP_BUF:
8425 0 : if (validate_arglist (exp, POINTER_TYPE, VOID_TYPE))
8426 : {
8427 0 : rtx buf_addr
8428 0 : = expand_normal (CALL_EXPR_ARG (exp, 0));
8429 :
8430 0 : expand_builtin_update_setjmp_buf (buf_addr);
8431 0 : return const0_rtx;
8432 : }
8433 : break;
8434 :
8435 38590 : case BUILT_IN_TRAP:
8436 38590 : case BUILT_IN_UNREACHABLE_TRAP:
8437 38590 : expand_builtin_trap ();
8438 38590 : return const0_rtx;
8439 :
8440 3681 : case BUILT_IN_UNREACHABLE:
8441 3681 : expand_builtin_unreachable ();
8442 3681 : return const0_rtx;
8443 :
8444 360 : case BUILT_IN_OBSERVABLE_CHKPT:
8445 : /* Generate no code. */
8446 360 : return const0_rtx;
8447 :
8448 1007 : CASE_FLT_FN (BUILT_IN_SIGNBIT):
8449 1007 : case BUILT_IN_SIGNBITD32:
8450 1007 : case BUILT_IN_SIGNBITD64:
8451 1007 : case BUILT_IN_SIGNBITD128:
8452 1007 : target = expand_builtin_signbit (exp, target);
8453 1007 : if (target)
8454 : return target;
8455 : break;
8456 :
8457 : /* Various hooks for the DWARF 2 __throw routine. */
8458 34 : case BUILT_IN_UNWIND_INIT:
8459 34 : expand_builtin_unwind_init ();
8460 34 : return const0_rtx;
8461 1220 : case BUILT_IN_DWARF_CFA:
8462 1220 : return virtual_cfa_rtx;
8463 : #ifdef DWARF2_UNWIND_INFO
8464 48 : case BUILT_IN_DWARF_SP_COLUMN:
8465 48 : return expand_builtin_dwarf_sp_column ();
8466 8 : case BUILT_IN_INIT_DWARF_REG_SIZES:
8467 8 : expand_builtin_init_dwarf_reg_sizes (CALL_EXPR_ARG (exp, 0));
8468 8 : return const0_rtx;
8469 : #endif
8470 19 : case BUILT_IN_FROB_RETURN_ADDR:
8471 19 : return expand_builtin_frob_return_addr (CALL_EXPR_ARG (exp, 0));
8472 2352 : case BUILT_IN_EXTRACT_RETURN_ADDR:
8473 2352 : return expand_builtin_extract_return_addr (CALL_EXPR_ARG (exp, 0));
8474 29 : case BUILT_IN_EH_RETURN:
8475 58 : expand_builtin_eh_return (CALL_EXPR_ARG (exp, 0),
8476 29 : CALL_EXPR_ARG (exp, 1));
8477 29 : return const0_rtx;
8478 21 : case BUILT_IN_EH_RETURN_DATA_REGNO:
8479 21 : return expand_builtin_eh_return_data_regno (exp);
8480 2 : case BUILT_IN_EXTEND_POINTER:
8481 2 : return expand_builtin_extend_pointer (CALL_EXPR_ARG (exp, 0));
8482 93063 : case BUILT_IN_EH_POINTER:
8483 93063 : return expand_builtin_eh_pointer (exp);
8484 5162 : case BUILT_IN_EH_FILTER:
8485 5162 : return expand_builtin_eh_filter (exp);
8486 91747 : case BUILT_IN_EH_COPY_VALUES:
8487 91747 : return expand_builtin_eh_copy_values (exp);
8488 :
8489 21072 : case BUILT_IN_VA_START:
8490 21072 : return expand_builtin_va_start (exp);
8491 12166 : case BUILT_IN_VA_END:
8492 12166 : return expand_builtin_va_end (exp);
8493 240 : case BUILT_IN_VA_COPY:
8494 240 : return expand_builtin_va_copy (exp);
8495 1253 : case BUILT_IN_EXPECT:
8496 1253 : return expand_builtin_expect (exp, target);
8497 5 : case BUILT_IN_EXPECT_WITH_PROBABILITY:
8498 5 : return expand_builtin_expect_with_probability (exp, target);
8499 665 : case BUILT_IN_ASSUME_ALIGNED:
8500 665 : return expand_builtin_assume_aligned (exp, target);
8501 2041 : case BUILT_IN_PREFETCH:
8502 2041 : expand_builtin_prefetch (exp);
8503 2041 : return const0_rtx;
8504 :
8505 305 : case BUILT_IN_INIT_TRAMPOLINE:
8506 305 : return expand_builtin_init_trampoline (exp, true);
8507 0 : case BUILT_IN_INIT_HEAP_TRAMPOLINE:
8508 0 : return expand_builtin_init_trampoline (exp, false);
8509 352 : case BUILT_IN_ADJUST_TRAMPOLINE:
8510 352 : return expand_builtin_adjust_trampoline (exp);
8511 :
8512 0 : case BUILT_IN_INIT_DESCRIPTOR:
8513 0 : return expand_builtin_init_descriptor (exp);
8514 0 : case BUILT_IN_ADJUST_DESCRIPTOR:
8515 0 : return expand_builtin_adjust_descriptor (exp);
8516 :
8517 : case BUILT_IN_GCC_NESTED_PTR_CREATED:
8518 : case BUILT_IN_GCC_NESTED_PTR_DELETED:
8519 : break; /* At present, no expansion, just call the function. */
8520 :
8521 110 : case BUILT_IN_FORK:
8522 110 : case BUILT_IN_EXECL:
8523 110 : case BUILT_IN_EXECV:
8524 110 : case BUILT_IN_EXECLP:
8525 110 : case BUILT_IN_EXECLE:
8526 110 : case BUILT_IN_EXECVP:
8527 110 : case BUILT_IN_EXECVE:
8528 110 : target = expand_builtin_fork_or_exec (fndecl, exp, target, ignore);
8529 110 : if (target)
8530 : return target;
8531 : break;
8532 :
8533 708 : case BUILT_IN_SYNC_FETCH_AND_ADD_1:
8534 708 : case BUILT_IN_SYNC_FETCH_AND_ADD_2:
8535 708 : case BUILT_IN_SYNC_FETCH_AND_ADD_4:
8536 708 : case BUILT_IN_SYNC_FETCH_AND_ADD_8:
8537 708 : case BUILT_IN_SYNC_FETCH_AND_ADD_16:
8538 708 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_ADD_1);
8539 708 : target = expand_builtin_sync_operation (mode, exp, PLUS, false, target);
8540 708 : if (target)
8541 : return target;
8542 : break;
8543 :
8544 581 : case BUILT_IN_SYNC_FETCH_AND_SUB_1:
8545 581 : case BUILT_IN_SYNC_FETCH_AND_SUB_2:
8546 581 : case BUILT_IN_SYNC_FETCH_AND_SUB_4:
8547 581 : case BUILT_IN_SYNC_FETCH_AND_SUB_8:
8548 581 : case BUILT_IN_SYNC_FETCH_AND_SUB_16:
8549 581 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_SUB_1);
8550 581 : target = expand_builtin_sync_operation (mode, exp, MINUS, false, target);
8551 581 : if (target)
8552 : return target;
8553 : break;
8554 :
8555 512 : case BUILT_IN_SYNC_FETCH_AND_OR_1:
8556 512 : case BUILT_IN_SYNC_FETCH_AND_OR_2:
8557 512 : case BUILT_IN_SYNC_FETCH_AND_OR_4:
8558 512 : case BUILT_IN_SYNC_FETCH_AND_OR_8:
8559 512 : case BUILT_IN_SYNC_FETCH_AND_OR_16:
8560 512 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_OR_1);
8561 512 : target = expand_builtin_sync_operation (mode, exp, IOR, false, target);
8562 512 : if (target)
8563 : return target;
8564 : break;
8565 :
8566 488 : case BUILT_IN_SYNC_FETCH_AND_AND_1:
8567 488 : case BUILT_IN_SYNC_FETCH_AND_AND_2:
8568 488 : case BUILT_IN_SYNC_FETCH_AND_AND_4:
8569 488 : case BUILT_IN_SYNC_FETCH_AND_AND_8:
8570 488 : case BUILT_IN_SYNC_FETCH_AND_AND_16:
8571 488 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_AND_1);
8572 488 : target = expand_builtin_sync_operation (mode, exp, AND, false, target);
8573 488 : if (target)
8574 : return target;
8575 : break;
8576 :
8577 581 : case BUILT_IN_SYNC_FETCH_AND_XOR_1:
8578 581 : case BUILT_IN_SYNC_FETCH_AND_XOR_2:
8579 581 : case BUILT_IN_SYNC_FETCH_AND_XOR_4:
8580 581 : case BUILT_IN_SYNC_FETCH_AND_XOR_8:
8581 581 : case BUILT_IN_SYNC_FETCH_AND_XOR_16:
8582 581 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_XOR_1);
8583 581 : target = expand_builtin_sync_operation (mode, exp, XOR, false, target);
8584 581 : if (target)
8585 : return target;
8586 : break;
8587 :
8588 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_1:
8589 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_2:
8590 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_4:
8591 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_8:
8592 434 : case BUILT_IN_SYNC_FETCH_AND_NAND_16:
8593 434 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_FETCH_AND_NAND_1);
8594 434 : target = expand_builtin_sync_operation (mode, exp, NOT, false, target);
8595 434 : if (target)
8596 : return target;
8597 : break;
8598 :
8599 156 : case BUILT_IN_SYNC_ADD_AND_FETCH_1:
8600 156 : case BUILT_IN_SYNC_ADD_AND_FETCH_2:
8601 156 : case BUILT_IN_SYNC_ADD_AND_FETCH_4:
8602 156 : case BUILT_IN_SYNC_ADD_AND_FETCH_8:
8603 156 : case BUILT_IN_SYNC_ADD_AND_FETCH_16:
8604 156 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_ADD_AND_FETCH_1);
8605 156 : target = expand_builtin_sync_operation (mode, exp, PLUS, true, target);
8606 156 : if (target)
8607 : return target;
8608 : break;
8609 :
8610 117 : case BUILT_IN_SYNC_SUB_AND_FETCH_1:
8611 117 : case BUILT_IN_SYNC_SUB_AND_FETCH_2:
8612 117 : case BUILT_IN_SYNC_SUB_AND_FETCH_4:
8613 117 : case BUILT_IN_SYNC_SUB_AND_FETCH_8:
8614 117 : case BUILT_IN_SYNC_SUB_AND_FETCH_16:
8615 117 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_SUB_AND_FETCH_1);
8616 117 : target = expand_builtin_sync_operation (mode, exp, MINUS, true, target);
8617 117 : if (target)
8618 : return target;
8619 : break;
8620 :
8621 115 : case BUILT_IN_SYNC_OR_AND_FETCH_1:
8622 115 : case BUILT_IN_SYNC_OR_AND_FETCH_2:
8623 115 : case BUILT_IN_SYNC_OR_AND_FETCH_4:
8624 115 : case BUILT_IN_SYNC_OR_AND_FETCH_8:
8625 115 : case BUILT_IN_SYNC_OR_AND_FETCH_16:
8626 115 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_OR_AND_FETCH_1);
8627 115 : target = expand_builtin_sync_operation (mode, exp, IOR, true, target);
8628 115 : if (target)
8629 : return target;
8630 : break;
8631 :
8632 116 : case BUILT_IN_SYNC_AND_AND_FETCH_1:
8633 116 : case BUILT_IN_SYNC_AND_AND_FETCH_2:
8634 116 : case BUILT_IN_SYNC_AND_AND_FETCH_4:
8635 116 : case BUILT_IN_SYNC_AND_AND_FETCH_8:
8636 116 : case BUILT_IN_SYNC_AND_AND_FETCH_16:
8637 116 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_AND_AND_FETCH_1);
8638 116 : target = expand_builtin_sync_operation (mode, exp, AND, true, target);
8639 116 : if (target)
8640 : return target;
8641 : break;
8642 :
8643 114 : case BUILT_IN_SYNC_XOR_AND_FETCH_1:
8644 114 : case BUILT_IN_SYNC_XOR_AND_FETCH_2:
8645 114 : case BUILT_IN_SYNC_XOR_AND_FETCH_4:
8646 114 : case BUILT_IN_SYNC_XOR_AND_FETCH_8:
8647 114 : case BUILT_IN_SYNC_XOR_AND_FETCH_16:
8648 114 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_XOR_AND_FETCH_1);
8649 114 : target = expand_builtin_sync_operation (mode, exp, XOR, true, target);
8650 114 : if (target)
8651 : return target;
8652 : break;
8653 :
8654 89 : case BUILT_IN_SYNC_NAND_AND_FETCH_1:
8655 89 : case BUILT_IN_SYNC_NAND_AND_FETCH_2:
8656 89 : case BUILT_IN_SYNC_NAND_AND_FETCH_4:
8657 89 : case BUILT_IN_SYNC_NAND_AND_FETCH_8:
8658 89 : case BUILT_IN_SYNC_NAND_AND_FETCH_16:
8659 89 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_NAND_AND_FETCH_1);
8660 89 : target = expand_builtin_sync_operation (mode, exp, NOT, true, target);
8661 89 : if (target)
8662 : return target;
8663 : break;
8664 :
8665 200 : case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1:
8666 200 : case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_2:
8667 200 : case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_4:
8668 200 : case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_8:
8669 200 : case BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_16:
8670 200 : if (mode == VOIDmode)
8671 40 : mode = TYPE_MODE (boolean_type_node);
8672 200 : if (!target || !register_operand (target, mode))
8673 40 : target = gen_reg_rtx (mode);
8674 :
8675 200 : mode = get_builtin_sync_mode
8676 200 : (fcode - BUILT_IN_SYNC_BOOL_COMPARE_AND_SWAP_1);
8677 200 : target = expand_builtin_compare_and_swap (mode, exp, true, target);
8678 200 : if (target)
8679 : return target;
8680 : break;
8681 :
8682 256 : case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1:
8683 256 : case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_2:
8684 256 : case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_4:
8685 256 : case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_8:
8686 256 : case BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_16:
8687 256 : mode = get_builtin_sync_mode
8688 256 : (fcode - BUILT_IN_SYNC_VAL_COMPARE_AND_SWAP_1);
8689 256 : target = expand_builtin_compare_and_swap (mode, exp, false, target);
8690 256 : if (target)
8691 : return target;
8692 : break;
8693 :
8694 326 : case BUILT_IN_SYNC_LOCK_TEST_AND_SET_1:
8695 326 : case BUILT_IN_SYNC_LOCK_TEST_AND_SET_2:
8696 326 : case BUILT_IN_SYNC_LOCK_TEST_AND_SET_4:
8697 326 : case BUILT_IN_SYNC_LOCK_TEST_AND_SET_8:
8698 326 : case BUILT_IN_SYNC_LOCK_TEST_AND_SET_16:
8699 326 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_TEST_AND_SET_1);
8700 326 : target = expand_builtin_sync_lock_test_and_set (mode, exp, target);
8701 326 : if (target)
8702 : return target;
8703 : break;
8704 :
8705 146 : case BUILT_IN_SYNC_LOCK_RELEASE_1:
8706 146 : case BUILT_IN_SYNC_LOCK_RELEASE_2:
8707 146 : case BUILT_IN_SYNC_LOCK_RELEASE_4:
8708 146 : case BUILT_IN_SYNC_LOCK_RELEASE_8:
8709 146 : case BUILT_IN_SYNC_LOCK_RELEASE_16:
8710 146 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SYNC_LOCK_RELEASE_1);
8711 146 : if (expand_builtin_sync_lock_release (mode, exp))
8712 144 : return const0_rtx;
8713 : break;
8714 :
8715 273 : case BUILT_IN_SYNC_SYNCHRONIZE:
8716 273 : expand_builtin_sync_synchronize ();
8717 273 : return const0_rtx;
8718 :
8719 2877 : case BUILT_IN_ATOMIC_EXCHANGE_1:
8720 2877 : case BUILT_IN_ATOMIC_EXCHANGE_2:
8721 2877 : case BUILT_IN_ATOMIC_EXCHANGE_4:
8722 2877 : case BUILT_IN_ATOMIC_EXCHANGE_8:
8723 2877 : case BUILT_IN_ATOMIC_EXCHANGE_16:
8724 2877 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_EXCHANGE_1);
8725 2877 : target = expand_builtin_atomic_exchange (mode, exp, target);
8726 2877 : if (target)
8727 : return target;
8728 : break;
8729 :
8730 9133 : case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1:
8731 9133 : case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_2:
8732 9133 : case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_4:
8733 9133 : case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_8:
8734 9133 : case BUILT_IN_ATOMIC_COMPARE_EXCHANGE_16:
8735 9133 : {
8736 9133 : unsigned int nargs, z;
8737 9133 : vec<tree, va_gc> *vec;
8738 :
8739 9133 : mode =
8740 9133 : get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_COMPARE_EXCHANGE_1);
8741 9133 : target = expand_builtin_atomic_compare_exchange (mode, exp, target);
8742 9133 : if (target)
8743 7331 : return target;
8744 :
8745 : /* If this is turned into an external library call, the weak parameter
8746 : must be dropped to match the expected parameter list. */
8747 1802 : nargs = call_expr_nargs (exp);
8748 1802 : vec_alloc (vec, nargs - 1);
8749 9010 : for (z = 0; z < 3; z++)
8750 5406 : vec->quick_push (CALL_EXPR_ARG (exp, z));
8751 : /* Skip the boolean weak parameter. */
8752 5406 : for (z = 4; z < 6; z++)
8753 3604 : vec->quick_push (CALL_EXPR_ARG (exp, z));
8754 1802 : exp = build_call_vec (TREE_TYPE (exp), CALL_EXPR_FN (exp), vec);
8755 1802 : break;
8756 : }
8757 :
8758 69828 : case BUILT_IN_ATOMIC_LOAD_1:
8759 69828 : case BUILT_IN_ATOMIC_LOAD_2:
8760 69828 : case BUILT_IN_ATOMIC_LOAD_4:
8761 69828 : case BUILT_IN_ATOMIC_LOAD_8:
8762 69828 : case BUILT_IN_ATOMIC_LOAD_16:
8763 69828 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_LOAD_1);
8764 69828 : target = expand_builtin_atomic_load (mode, exp, target);
8765 69828 : if (target)
8766 : return target;
8767 : break;
8768 :
8769 17422 : case BUILT_IN_ATOMIC_STORE_1:
8770 17422 : case BUILT_IN_ATOMIC_STORE_2:
8771 17422 : case BUILT_IN_ATOMIC_STORE_4:
8772 17422 : case BUILT_IN_ATOMIC_STORE_8:
8773 17422 : case BUILT_IN_ATOMIC_STORE_16:
8774 17422 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_STORE_1);
8775 17422 : target = expand_builtin_atomic_store (mode, exp);
8776 17422 : if (target)
8777 15795 : return const0_rtx;
8778 : break;
8779 :
8780 4385 : case BUILT_IN_ATOMIC_ADD_FETCH_1:
8781 4385 : case BUILT_IN_ATOMIC_ADD_FETCH_2:
8782 4385 : case BUILT_IN_ATOMIC_ADD_FETCH_4:
8783 4385 : case BUILT_IN_ATOMIC_ADD_FETCH_8:
8784 4385 : case BUILT_IN_ATOMIC_ADD_FETCH_16:
8785 4385 : {
8786 4385 : enum built_in_function lib;
8787 4385 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_ADD_FETCH_1);
8788 4385 : lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_ADD_1 +
8789 : (fcode - BUILT_IN_ATOMIC_ADD_FETCH_1));
8790 4385 : target = expand_builtin_atomic_fetch_op (mode, exp, target, PLUS, true,
8791 : ignore, lib);
8792 4385 : if (target)
8793 : return target;
8794 : break;
8795 : }
8796 2168 : case BUILT_IN_ATOMIC_SUB_FETCH_1:
8797 2168 : case BUILT_IN_ATOMIC_SUB_FETCH_2:
8798 2168 : case BUILT_IN_ATOMIC_SUB_FETCH_4:
8799 2168 : case BUILT_IN_ATOMIC_SUB_FETCH_8:
8800 2168 : case BUILT_IN_ATOMIC_SUB_FETCH_16:
8801 2168 : {
8802 2168 : enum built_in_function lib;
8803 2168 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_SUB_FETCH_1);
8804 2168 : lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_SUB_1 +
8805 : (fcode - BUILT_IN_ATOMIC_SUB_FETCH_1));
8806 2168 : target = expand_builtin_atomic_fetch_op (mode, exp, target, MINUS, true,
8807 : ignore, lib);
8808 2168 : if (target)
8809 : return target;
8810 : break;
8811 : }
8812 895 : case BUILT_IN_ATOMIC_AND_FETCH_1:
8813 895 : case BUILT_IN_ATOMIC_AND_FETCH_2:
8814 895 : case BUILT_IN_ATOMIC_AND_FETCH_4:
8815 895 : case BUILT_IN_ATOMIC_AND_FETCH_8:
8816 895 : case BUILT_IN_ATOMIC_AND_FETCH_16:
8817 895 : {
8818 895 : enum built_in_function lib;
8819 895 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_AND_FETCH_1);
8820 895 : lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_AND_1 +
8821 : (fcode - BUILT_IN_ATOMIC_AND_FETCH_1));
8822 895 : target = expand_builtin_atomic_fetch_op (mode, exp, target, AND, true,
8823 : ignore, lib);
8824 895 : if (target)
8825 : return target;
8826 : break;
8827 : }
8828 155 : case BUILT_IN_ATOMIC_NAND_FETCH_1:
8829 155 : case BUILT_IN_ATOMIC_NAND_FETCH_2:
8830 155 : case BUILT_IN_ATOMIC_NAND_FETCH_4:
8831 155 : case BUILT_IN_ATOMIC_NAND_FETCH_8:
8832 155 : case BUILT_IN_ATOMIC_NAND_FETCH_16:
8833 155 : {
8834 155 : enum built_in_function lib;
8835 155 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_NAND_FETCH_1);
8836 155 : lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_NAND_1 +
8837 : (fcode - BUILT_IN_ATOMIC_NAND_FETCH_1));
8838 155 : target = expand_builtin_atomic_fetch_op (mode, exp, target, NOT, true,
8839 : ignore, lib);
8840 155 : if (target)
8841 : return target;
8842 : break;
8843 : }
8844 840 : case BUILT_IN_ATOMIC_XOR_FETCH_1:
8845 840 : case BUILT_IN_ATOMIC_XOR_FETCH_2:
8846 840 : case BUILT_IN_ATOMIC_XOR_FETCH_4:
8847 840 : case BUILT_IN_ATOMIC_XOR_FETCH_8:
8848 840 : case BUILT_IN_ATOMIC_XOR_FETCH_16:
8849 840 : {
8850 840 : enum built_in_function lib;
8851 840 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_XOR_FETCH_1);
8852 840 : lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_XOR_1 +
8853 : (fcode - BUILT_IN_ATOMIC_XOR_FETCH_1));
8854 840 : target = expand_builtin_atomic_fetch_op (mode, exp, target, XOR, true,
8855 : ignore, lib);
8856 840 : if (target)
8857 : return target;
8858 : break;
8859 : }
8860 956 : case BUILT_IN_ATOMIC_OR_FETCH_1:
8861 956 : case BUILT_IN_ATOMIC_OR_FETCH_2:
8862 956 : case BUILT_IN_ATOMIC_OR_FETCH_4:
8863 956 : case BUILT_IN_ATOMIC_OR_FETCH_8:
8864 956 : case BUILT_IN_ATOMIC_OR_FETCH_16:
8865 956 : {
8866 956 : enum built_in_function lib;
8867 956 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_OR_FETCH_1);
8868 956 : lib = (enum built_in_function)((int)BUILT_IN_ATOMIC_FETCH_OR_1 +
8869 : (fcode - BUILT_IN_ATOMIC_OR_FETCH_1));
8870 956 : target = expand_builtin_atomic_fetch_op (mode, exp, target, IOR, true,
8871 : ignore, lib);
8872 956 : if (target)
8873 : return target;
8874 : break;
8875 : }
8876 14465 : case BUILT_IN_ATOMIC_FETCH_ADD_1:
8877 14465 : case BUILT_IN_ATOMIC_FETCH_ADD_2:
8878 14465 : case BUILT_IN_ATOMIC_FETCH_ADD_4:
8879 14465 : case BUILT_IN_ATOMIC_FETCH_ADD_8:
8880 14465 : case BUILT_IN_ATOMIC_FETCH_ADD_16:
8881 14465 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_ADD_1);
8882 14465 : target = expand_builtin_atomic_fetch_op (mode, exp, target, PLUS, false,
8883 : ignore, BUILT_IN_NONE);
8884 14465 : if (target)
8885 : return target;
8886 : break;
8887 :
8888 2103 : case BUILT_IN_ATOMIC_FETCH_SUB_1:
8889 2103 : case BUILT_IN_ATOMIC_FETCH_SUB_2:
8890 2103 : case BUILT_IN_ATOMIC_FETCH_SUB_4:
8891 2103 : case BUILT_IN_ATOMIC_FETCH_SUB_8:
8892 2103 : case BUILT_IN_ATOMIC_FETCH_SUB_16:
8893 2103 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_SUB_1);
8894 2103 : target = expand_builtin_atomic_fetch_op (mode, exp, target, MINUS, false,
8895 : ignore, BUILT_IN_NONE);
8896 2103 : if (target)
8897 : return target;
8898 : break;
8899 :
8900 778 : case BUILT_IN_ATOMIC_FETCH_AND_1:
8901 778 : case BUILT_IN_ATOMIC_FETCH_AND_2:
8902 778 : case BUILT_IN_ATOMIC_FETCH_AND_4:
8903 778 : case BUILT_IN_ATOMIC_FETCH_AND_8:
8904 778 : case BUILT_IN_ATOMIC_FETCH_AND_16:
8905 778 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_AND_1);
8906 778 : target = expand_builtin_atomic_fetch_op (mode, exp, target, AND, false,
8907 : ignore, BUILT_IN_NONE);
8908 778 : if (target)
8909 : return target;
8910 : break;
8911 :
8912 118 : case BUILT_IN_ATOMIC_FETCH_NAND_1:
8913 118 : case BUILT_IN_ATOMIC_FETCH_NAND_2:
8914 118 : case BUILT_IN_ATOMIC_FETCH_NAND_4:
8915 118 : case BUILT_IN_ATOMIC_FETCH_NAND_8:
8916 118 : case BUILT_IN_ATOMIC_FETCH_NAND_16:
8917 118 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_NAND_1);
8918 118 : target = expand_builtin_atomic_fetch_op (mode, exp, target, NOT, false,
8919 : ignore, BUILT_IN_NONE);
8920 118 : if (target)
8921 : return target;
8922 : break;
8923 :
8924 868 : case BUILT_IN_ATOMIC_FETCH_XOR_1:
8925 868 : case BUILT_IN_ATOMIC_FETCH_XOR_2:
8926 868 : case BUILT_IN_ATOMIC_FETCH_XOR_4:
8927 868 : case BUILT_IN_ATOMIC_FETCH_XOR_8:
8928 868 : case BUILT_IN_ATOMIC_FETCH_XOR_16:
8929 868 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_XOR_1);
8930 868 : target = expand_builtin_atomic_fetch_op (mode, exp, target, XOR, false,
8931 : ignore, BUILT_IN_NONE);
8932 868 : if (target)
8933 : return target;
8934 : break;
8935 :
8936 1122 : case BUILT_IN_ATOMIC_FETCH_OR_1:
8937 1122 : case BUILT_IN_ATOMIC_FETCH_OR_2:
8938 1122 : case BUILT_IN_ATOMIC_FETCH_OR_4:
8939 1122 : case BUILT_IN_ATOMIC_FETCH_OR_8:
8940 1122 : case BUILT_IN_ATOMIC_FETCH_OR_16:
8941 1122 : mode = get_builtin_sync_mode (fcode - BUILT_IN_ATOMIC_FETCH_OR_1);
8942 1122 : target = expand_builtin_atomic_fetch_op (mode, exp, target, IOR, false,
8943 : ignore, BUILT_IN_NONE);
8944 1122 : if (target)
8945 : return target;
8946 : break;
8947 :
8948 266 : case BUILT_IN_ATOMIC_TEST_AND_SET:
8949 266 : target = expand_builtin_atomic_test_and_set (exp, target);
8950 266 : if (target)
8951 : return target;
8952 : break;
8953 :
8954 53 : case BUILT_IN_ATOMIC_CLEAR:
8955 53 : return expand_builtin_atomic_clear (exp);
8956 :
8957 1 : case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE:
8958 1 : return expand_builtin_atomic_always_lock_free (exp);
8959 :
8960 3 : case BUILT_IN_ATOMIC_IS_LOCK_FREE:
8961 3 : target = expand_builtin_atomic_is_lock_free (exp);
8962 3 : if (target)
8963 : return target;
8964 : break;
8965 :
8966 691 : case BUILT_IN_ATOMIC_THREAD_FENCE:
8967 691 : expand_builtin_atomic_thread_fence (exp);
8968 691 : return const0_rtx;
8969 :
8970 60 : case BUILT_IN_ATOMIC_SIGNAL_FENCE:
8971 60 : expand_builtin_atomic_signal_fence (exp);
8972 60 : return const0_rtx;
8973 :
8974 618 : case BUILT_IN_OBJECT_SIZE:
8975 618 : case BUILT_IN_DYNAMIC_OBJECT_SIZE:
8976 618 : return expand_builtin_object_size (exp);
8977 :
8978 837 : case BUILT_IN_MEMCPY_CHK:
8979 837 : case BUILT_IN_MEMPCPY_CHK:
8980 837 : case BUILT_IN_MEMMOVE_CHK:
8981 837 : case BUILT_IN_MEMSET_CHK:
8982 837 : target = expand_builtin_memory_chk (exp, target, mode, fcode);
8983 837 : if (target)
8984 : return target;
8985 : break;
8986 :
8987 1086 : case BUILT_IN_STRCPY_CHK:
8988 1086 : case BUILT_IN_STPCPY_CHK:
8989 1086 : case BUILT_IN_STRNCPY_CHK:
8990 1086 : case BUILT_IN_STPNCPY_CHK:
8991 1086 : case BUILT_IN_STRCAT_CHK:
8992 1086 : case BUILT_IN_STRNCAT_CHK:
8993 1086 : case BUILT_IN_SNPRINTF_CHK:
8994 1086 : case BUILT_IN_VSNPRINTF_CHK:
8995 1086 : maybe_emit_chk_warning (exp, fcode);
8996 1086 : break;
8997 :
8998 1327 : case BUILT_IN_SPRINTF_CHK:
8999 1327 : case BUILT_IN_VSPRINTF_CHK:
9000 1327 : maybe_emit_sprintf_chk_warning (exp, fcode);
9001 1327 : break;
9002 :
9003 3 : case BUILT_IN_THREAD_POINTER:
9004 3 : return expand_builtin_thread_pointer (exp, target);
9005 :
9006 0 : case BUILT_IN_SET_THREAD_POINTER:
9007 0 : expand_builtin_set_thread_pointer (exp);
9008 0 : return const0_rtx;
9009 :
9010 : case BUILT_IN_ACC_ON_DEVICE:
9011 : /* Do library call, if we failed to expand the builtin when
9012 : folding. */
9013 : break;
9014 :
9015 356 : case BUILT_IN_GOACC_PARLEVEL_ID:
9016 356 : case BUILT_IN_GOACC_PARLEVEL_SIZE:
9017 356 : return expand_builtin_goacc_parlevel_id_size (exp, target, ignore);
9018 :
9019 4 : case BUILT_IN_SPECULATION_SAFE_VALUE_PTR:
9020 4 : return expand_speculation_safe_value (VOIDmode, exp, target, ignore);
9021 :
9022 30 : case BUILT_IN_SPECULATION_SAFE_VALUE_1:
9023 30 : case BUILT_IN_SPECULATION_SAFE_VALUE_2:
9024 30 : case BUILT_IN_SPECULATION_SAFE_VALUE_4:
9025 30 : case BUILT_IN_SPECULATION_SAFE_VALUE_8:
9026 30 : case BUILT_IN_SPECULATION_SAFE_VALUE_16:
9027 30 : mode = get_builtin_sync_mode (fcode - BUILT_IN_SPECULATION_SAFE_VALUE_1);
9028 30 : return expand_speculation_safe_value (mode, exp, target, ignore);
9029 :
9030 3 : case BUILT_IN_CRC8_DATA8:
9031 3 : return expand_builtin_crc_table_based (IFN_CRC, QImode, QImode, mode,
9032 : exp, target);
9033 2 : case BUILT_IN_CRC16_DATA8:
9034 2 : return expand_builtin_crc_table_based (IFN_CRC, HImode, QImode, mode,
9035 : exp, target);
9036 2 : case BUILT_IN_CRC16_DATA16:
9037 2 : return expand_builtin_crc_table_based (IFN_CRC, HImode, HImode, mode,
9038 : exp, target);
9039 2 : case BUILT_IN_CRC32_DATA8:
9040 2 : return expand_builtin_crc_table_based (IFN_CRC, SImode, QImode, mode,
9041 : exp, target);
9042 2 : case BUILT_IN_CRC32_DATA16:
9043 2 : return expand_builtin_crc_table_based (IFN_CRC, SImode, HImode, mode,
9044 : exp, target);
9045 4 : case BUILT_IN_CRC32_DATA32:
9046 4 : return expand_builtin_crc_table_based (IFN_CRC, SImode, SImode, mode,
9047 : exp, target);
9048 1 : case BUILT_IN_CRC64_DATA8:
9049 1 : return expand_builtin_crc_table_based (IFN_CRC, DImode, QImode, mode,
9050 : exp, target);
9051 1 : case BUILT_IN_CRC64_DATA16:
9052 1 : return expand_builtin_crc_table_based (IFN_CRC, DImode, HImode, mode,
9053 : exp, target);
9054 1 : case BUILT_IN_CRC64_DATA32:
9055 1 : return expand_builtin_crc_table_based (IFN_CRC, DImode, SImode, mode,
9056 : exp, target);
9057 1 : case BUILT_IN_CRC64_DATA64:
9058 1 : return expand_builtin_crc_table_based (IFN_CRC, DImode, DImode, mode,
9059 : exp, target);
9060 2 : case BUILT_IN_REV_CRC8_DATA8:
9061 2 : return expand_builtin_crc_table_based (IFN_CRC_REV, QImode, QImode,
9062 : mode, exp, target);
9063 2 : case BUILT_IN_REV_CRC16_DATA8:
9064 2 : return expand_builtin_crc_table_based (IFN_CRC_REV, HImode, QImode,
9065 : mode, exp, target);
9066 2 : case BUILT_IN_REV_CRC16_DATA16:
9067 2 : return expand_builtin_crc_table_based (IFN_CRC_REV, HImode, HImode,
9068 : mode, exp, target);
9069 3 : case BUILT_IN_REV_CRC32_DATA8:
9070 3 : return expand_builtin_crc_table_based (IFN_CRC_REV, SImode, QImode,
9071 : mode, exp, target);
9072 2 : case BUILT_IN_REV_CRC32_DATA16:
9073 2 : return expand_builtin_crc_table_based (IFN_CRC_REV, SImode, HImode,
9074 : mode, exp, target);
9075 2 : case BUILT_IN_REV_CRC32_DATA32:
9076 2 : return expand_builtin_crc_table_based (IFN_CRC_REV, SImode, SImode,
9077 : mode, exp, target);
9078 1 : case BUILT_IN_REV_CRC64_DATA8:
9079 1 : return expand_builtin_crc_table_based (IFN_CRC_REV, DImode, QImode,
9080 : mode, exp, target);
9081 1 : case BUILT_IN_REV_CRC64_DATA16:
9082 1 : return expand_builtin_crc_table_based (IFN_CRC_REV, DImode, HImode,
9083 : mode, exp, target);
9084 1 : case BUILT_IN_REV_CRC64_DATA32:
9085 1 : return expand_builtin_crc_table_based (IFN_CRC_REV, DImode, SImode,
9086 : mode, exp, target);
9087 1 : case BUILT_IN_REV_CRC64_DATA64:
9088 1 : return expand_builtin_crc_table_based (IFN_CRC_REV, DImode, DImode,
9089 : mode, exp, target);
9090 : default: /* just do library call, if unknown builtin */
9091 : break;
9092 : }
9093 :
9094 : /* The switch statement above can drop through to cause the function
9095 : to be called normally. */
9096 838685 : return expand_call (exp, target, ignore);
9097 : }
9098 :
9099 : /* Determine whether a tree node represents a call to a built-in
9100 : function. If the tree T is a call to a built-in function with
9101 : the right number of arguments of the appropriate types, return
9102 : the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
9103 : Otherwise the return value is END_BUILTINS. */
9104 :
9105 : enum built_in_function
9106 102628264 : builtin_mathfn_code (const_tree t)
9107 : {
9108 102628264 : const_tree fndecl, arg, parmlist;
9109 102628264 : const_tree argtype, parmtype;
9110 102628264 : const_call_expr_arg_iterator iter;
9111 :
9112 102628264 : if (TREE_CODE (t) != CALL_EXPR)
9113 : return END_BUILTINS;
9114 :
9115 1285421 : fndecl = get_callee_fndecl (t);
9116 1285421 : if (fndecl == NULL_TREE || !fndecl_built_in_p (fndecl, BUILT_IN_NORMAL))
9117 : return END_BUILTINS;
9118 :
9119 550078 : parmlist = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
9120 550078 : init_const_call_expr_arg_iterator (t, &iter);
9121 1791143 : for (; parmlist; parmlist = TREE_CHAIN (parmlist))
9122 : {
9123 : /* If a function doesn't take a variable number of arguments,
9124 : the last element in the list will have type `void'. */
9125 1240765 : parmtype = TREE_VALUE (parmlist);
9126 1240765 : if (VOID_TYPE_P (parmtype))
9127 : {
9128 549764 : if (more_const_call_expr_args_p (&iter))
9129 : return END_BUILTINS;
9130 549764 : return DECL_FUNCTION_CODE (fndecl);
9131 : }
9132 :
9133 691001 : if (! more_const_call_expr_args_p (&iter))
9134 : return END_BUILTINS;
9135 :
9136 691001 : arg = next_const_call_expr_arg (&iter);
9137 691001 : argtype = TREE_TYPE (arg);
9138 :
9139 691001 : if (SCALAR_FLOAT_TYPE_P (parmtype))
9140 : {
9141 445353 : if (! SCALAR_FLOAT_TYPE_P (argtype))
9142 : return END_BUILTINS;
9143 : }
9144 245648 : else if (COMPLEX_FLOAT_TYPE_P (parmtype))
9145 : {
9146 5657 : if (! COMPLEX_FLOAT_TYPE_P (argtype))
9147 : return END_BUILTINS;
9148 : }
9149 239991 : else if (POINTER_TYPE_P (parmtype))
9150 : {
9151 70629 : if (! POINTER_TYPE_P (argtype))
9152 : return END_BUILTINS;
9153 : }
9154 169362 : else if (INTEGRAL_TYPE_P (parmtype))
9155 : {
9156 169362 : if (! INTEGRAL_TYPE_P (argtype))
9157 : return END_BUILTINS;
9158 : }
9159 : else
9160 : return END_BUILTINS;
9161 : }
9162 :
9163 : /* Variable-length argument list. */
9164 300 : return DECL_FUNCTION_CODE (fndecl);
9165 : }
9166 :
9167 : /* Fold a call to __builtin_constant_p, if we know its argument ARG will
9168 : evaluate to a constant. */
9169 :
9170 : tree
9171 2778370 : fold_builtin_constant_p (tree arg)
9172 : {
9173 : /* We return 1 for a numeric type that's known to be a constant
9174 : value at compile-time or for an aggregate type that's a
9175 : literal constant. */
9176 2778370 : STRIP_NOPS (arg);
9177 :
9178 : /* If we know this is a constant, emit the constant of one. */
9179 2778370 : if (CONSTANT_CLASS_P (arg)
9180 2778370 : || (TREE_CODE (arg) == CONSTRUCTOR
9181 6 : && TREE_CONSTANT (arg)))
9182 1567706 : return integer_one_node;
9183 1210664 : if (TREE_CODE (arg) == ADDR_EXPR)
9184 : {
9185 110 : tree op = TREE_OPERAND (arg, 0);
9186 110 : if (TREE_CODE (op) == STRING_CST
9187 110 : || (TREE_CODE (op) == ARRAY_REF
9188 57 : && integer_zerop (TREE_OPERAND (op, 1))
9189 57 : && TREE_CODE (TREE_OPERAND (op, 0)) == STRING_CST))
9190 87 : return integer_one_node;
9191 : }
9192 :
9193 : /* If this expression has side effects, show we don't know it to be a
9194 : constant. Likewise if it's a pointer or aggregate type since in
9195 : those case we only want literals, since those are only optimized
9196 : when generating RTL, not later.
9197 : And finally, if we are compiling an initializer, not code, we
9198 : need to return a definite result now; there's not going to be any
9199 : more optimization done. */
9200 1210577 : if (TREE_SIDE_EFFECTS (arg)
9201 1210452 : || AGGREGATE_TYPE_P (TREE_TYPE (arg))
9202 1210446 : || POINTER_TYPE_P (TREE_TYPE (arg))
9203 1210275 : || cfun == 0
9204 1210232 : || folding_initializer
9205 2420802 : || force_folding_builtin_constant_p)
9206 394 : return integer_zero_node;
9207 :
9208 : return NULL_TREE;
9209 : }
9210 :
9211 : /* Create builtin_expect or builtin_expect_with_probability
9212 : with PRED and EXPECTED as its arguments and return it as a truthvalue.
9213 : Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
9214 : builtin_expect_with_probability instead uses third argument as PROBABILITY
9215 : value. */
9216 :
9217 : static tree
9218 212258 : build_builtin_expect_predicate (location_t loc, tree pred, tree expected,
9219 : tree predictor, tree probability)
9220 : {
9221 212258 : tree fn, arg_types, pred_type, expected_type, call_expr, ret_type;
9222 :
9223 212258 : fn = builtin_decl_explicit (probability == NULL_TREE ? BUILT_IN_EXPECT
9224 : : BUILT_IN_EXPECT_WITH_PROBABILITY);
9225 212258 : arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
9226 212258 : ret_type = TREE_TYPE (TREE_TYPE (fn));
9227 212258 : pred_type = TREE_VALUE (arg_types);
9228 212258 : expected_type = TREE_VALUE (TREE_CHAIN (arg_types));
9229 :
9230 212258 : pred = fold_convert_loc (loc, pred_type, pred);
9231 212258 : expected = fold_convert_loc (loc, expected_type, expected);
9232 :
9233 212258 : if (probability)
9234 0 : call_expr = build_call_expr_loc (loc, fn, 3, pred, expected, probability);
9235 : else
9236 424516 : call_expr = build_call_expr_loc (loc, fn, predictor ? 3 : 2, pred, expected,
9237 : predictor);
9238 :
9239 212258 : return build2 (NE_EXPR, TREE_TYPE (pred), call_expr,
9240 212258 : build_int_cst (ret_type, 0));
9241 : }
9242 :
9243 : /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
9244 : NULL_TREE if no simplification is possible. */
9245 :
9246 : tree
9247 6703558 : fold_builtin_expect (location_t loc, tree arg0, tree arg1, tree arg2,
9248 : tree arg3)
9249 : {
9250 6703558 : tree inner, fndecl, inner_arg0;
9251 6703558 : enum tree_code code;
9252 :
9253 : /* Distribute the expected value over short-circuiting operators.
9254 : See through the cast from truthvalue_type_node to long. */
9255 6703558 : inner_arg0 = arg0;
9256 13706114 : while (CONVERT_EXPR_P (inner_arg0)
9257 870234 : && INTEGRAL_TYPE_P (TREE_TYPE (inner_arg0))
9258 8444025 : && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (inner_arg0, 0))))
9259 870233 : inner_arg0 = TREE_OPERAND (inner_arg0, 0);
9260 :
9261 : /* If this is a builtin_expect within a builtin_expect keep the
9262 : inner one. See through a comparison against a constant. It
9263 : might have been added to create a thruthvalue. */
9264 6703558 : inner = inner_arg0;
9265 :
9266 6703558 : if (COMPARISON_CLASS_P (inner)
9267 6703558 : && TREE_CODE (TREE_OPERAND (inner, 1)) == INTEGER_CST)
9268 1303357 : inner = TREE_OPERAND (inner, 0);
9269 :
9270 6703558 : if (TREE_CODE (inner) == CALL_EXPR
9271 110995 : && (fndecl = get_callee_fndecl (inner))
9272 6814553 : && fndecl_built_in_p (fndecl, BUILT_IN_EXPECT,
9273 : BUILT_IN_EXPECT_WITH_PROBABILITY))
9274 : return arg0;
9275 :
9276 6703550 : inner = inner_arg0;
9277 6703550 : code = TREE_CODE (inner);
9278 6703550 : if (code == TRUTH_ANDIF_EXPR || code == TRUTH_ORIF_EXPR)
9279 : {
9280 106129 : tree op0 = TREE_OPERAND (inner, 0);
9281 106129 : tree op1 = TREE_OPERAND (inner, 1);
9282 106129 : arg1 = save_expr (arg1);
9283 :
9284 106129 : op0 = build_builtin_expect_predicate (loc, op0, arg1, arg2, arg3);
9285 106129 : op1 = build_builtin_expect_predicate (loc, op1, arg1, arg2, arg3);
9286 106129 : inner = build2 (code, TREE_TYPE (inner), op0, op1);
9287 :
9288 106129 : return fold_convert_loc (loc, TREE_TYPE (arg0), inner);
9289 : }
9290 :
9291 : /* If the argument isn't invariant then there's nothing else we can do. */
9292 6597421 : if (!TREE_CONSTANT (inner_arg0))
9293 : return NULL_TREE;
9294 :
9295 : /* If we expect that a comparison against the argument will fold to
9296 : a constant return the constant. In practice, this means a true
9297 : constant or the address of a non-weak symbol. */
9298 182879 : inner = inner_arg0;
9299 182879 : STRIP_NOPS (inner);
9300 182879 : if (TREE_CODE (inner) == ADDR_EXPR)
9301 : {
9302 1 : do
9303 : {
9304 1 : inner = TREE_OPERAND (inner, 0);
9305 : }
9306 1 : while (TREE_CODE (inner) == COMPONENT_REF
9307 1 : || TREE_CODE (inner) == ARRAY_REF);
9308 1 : if (VAR_OR_FUNCTION_DECL_P (inner) && DECL_WEAK (inner))
9309 : return NULL_TREE;
9310 : }
9311 :
9312 : /* Otherwise, ARG0 already has the proper type for the return value. */
9313 : return arg0;
9314 : }
9315 :
9316 : /* Fold a call to __builtin_classify_type with argument ARG. */
9317 :
9318 : static tree
9319 2156 : fold_builtin_classify_type (tree arg)
9320 : {
9321 2156 : if (arg == 0)
9322 0 : return build_int_cst (integer_type_node, no_type_class);
9323 :
9324 2156 : return build_int_cst (integer_type_node, type_to_class (TREE_TYPE (arg)));
9325 : }
9326 :
9327 : /* Fold a call EXPR (which may be null) to __builtin_strlen with argument
9328 : ARG. */
9329 :
9330 : static tree
9331 429433 : fold_builtin_strlen (location_t loc, tree expr, tree type, tree arg)
9332 : {
9333 429433 : if (!validate_arg (arg, POINTER_TYPE))
9334 : return NULL_TREE;
9335 : else
9336 : {
9337 429430 : c_strlen_data lendata = { };
9338 429430 : tree len = c_strlen (arg, 0, &lendata);
9339 :
9340 429430 : if (len)
9341 1889 : return fold_convert_loc (loc, type, len);
9342 :
9343 : /* TODO: Move this to gimple-ssa-warn-access once the pass runs
9344 : also early enough to detect invalid reads in multimensional
9345 : arrays and struct members. */
9346 427541 : if (!lendata.decl)
9347 420363 : c_strlen (arg, 1, &lendata);
9348 :
9349 427541 : if (lendata.decl)
9350 : {
9351 7192 : if (EXPR_HAS_LOCATION (arg))
9352 2800 : loc = EXPR_LOCATION (arg);
9353 4392 : else if (loc == UNKNOWN_LOCATION)
9354 0 : loc = input_location;
9355 7192 : warn_string_no_nul (loc, expr, "strlen", arg, lendata.decl);
9356 : }
9357 :
9358 427541 : return NULL_TREE;
9359 : }
9360 : }
9361 :
9362 : /* Fold a call to __builtin_inf or __builtin_huge_val. */
9363 :
9364 : static tree
9365 248367 : fold_builtin_inf (location_t loc, tree type, int warn)
9366 : {
9367 : /* __builtin_inff is intended to be usable to define INFINITY on all
9368 : targets. If an infinity is not available, INFINITY expands "to a
9369 : positive constant of type float that overflows at translation
9370 : time", footnote "In this case, using INFINITY will violate the
9371 : constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
9372 : Thus we pedwarn to ensure this constraint violation is
9373 : diagnosed. */
9374 992659 : if (!MODE_HAS_INFINITIES (TYPE_MODE (type)) && warn)
9375 0 : pedwarn (loc, 0, "target format does not support infinity");
9376 :
9377 248367 : return build_real (type, dconstinf);
9378 : }
9379 :
9380 : /* Fold function call to builtin sincos, sincosf, or sincosl. Return
9381 : NULL_TREE if no simplification can be made. */
9382 :
9383 : static tree
9384 145 : fold_builtin_sincos (location_t loc,
9385 : tree arg0, tree arg1, tree arg2)
9386 : {
9387 145 : tree type;
9388 145 : tree fndecl, call = NULL_TREE;
9389 :
9390 145 : if (!validate_arg (arg0, REAL_TYPE)
9391 145 : || !validate_arg (arg1, POINTER_TYPE)
9392 290 : || !validate_arg (arg2, POINTER_TYPE))
9393 : return NULL_TREE;
9394 :
9395 145 : type = TREE_TYPE (arg0);
9396 :
9397 : /* Calculate the result when the argument is a constant. */
9398 145 : built_in_function fn = mathfn_built_in_2 (type, CFN_BUILT_IN_CEXPI);
9399 145 : if (fn == END_BUILTINS)
9400 : return NULL_TREE;
9401 :
9402 : /* Canonicalize sincos to cexpi. */
9403 145 : if (TREE_CODE (arg0) == REAL_CST)
9404 : {
9405 86 : tree complex_type = build_complex_type (type);
9406 86 : call = fold_const_call (as_combined_fn (fn), complex_type, arg0);
9407 : }
9408 86 : if (!call)
9409 : {
9410 59 : if (!targetm.libc_has_function (function_c99_math_complex, type)
9411 59 : || !builtin_decl_implicit_p (fn))
9412 : return NULL_TREE;
9413 59 : fndecl = builtin_decl_explicit (fn);
9414 59 : call = build_call_expr_loc (loc, fndecl, 1, arg0);
9415 59 : call = builtin_save_expr (call);
9416 : }
9417 :
9418 145 : tree ptype = build_pointer_type (type);
9419 145 : arg1 = fold_convert (ptype, arg1);
9420 145 : arg2 = fold_convert (ptype, arg2);
9421 145 : return build2 (COMPOUND_EXPR, void_type_node,
9422 : build2 (MODIFY_EXPR, void_type_node,
9423 : build_fold_indirect_ref_loc (loc, arg1),
9424 : fold_build1_loc (loc, IMAGPART_EXPR, type, call)),
9425 : build2 (MODIFY_EXPR, void_type_node,
9426 : build_fold_indirect_ref_loc (loc, arg2),
9427 145 : fold_build1_loc (loc, REALPART_EXPR, type, call)));
9428 : }
9429 :
9430 : /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
9431 : Return NULL_TREE if no simplification can be made. */
9432 :
9433 : static tree
9434 2494543 : fold_builtin_memcmp (location_t loc, tree arg1, tree arg2, tree len)
9435 : {
9436 2494543 : if (!validate_arg (arg1, POINTER_TYPE)
9437 2494543 : || !validate_arg (arg2, POINTER_TYPE)
9438 4989086 : || !validate_arg (len, INTEGER_TYPE))
9439 : return NULL_TREE;
9440 :
9441 : /* If the LEN parameter is zero, return zero. */
9442 2494543 : if (integer_zerop (len))
9443 0 : return omit_two_operands_loc (loc, integer_type_node, integer_zero_node,
9444 0 : arg1, arg2);
9445 :
9446 : /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9447 2494543 : if (operand_equal_p (arg1, arg2, 0))
9448 695 : return omit_one_operand_loc (loc, integer_type_node, integer_zero_node, len);
9449 :
9450 : /* If len parameter is one, return an expression corresponding to
9451 : (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
9452 2493848 : if (tree_fits_uhwi_p (len) && tree_to_uhwi (len) == 1)
9453 : {
9454 53076 : tree cst_uchar_node = build_type_variant (unsigned_char_type_node, 1, 0);
9455 53076 : tree cst_uchar_ptr_node
9456 53076 : = build_pointer_type_for_mode (cst_uchar_node, ptr_mode, true);
9457 :
9458 53076 : tree ind1
9459 53076 : = fold_convert_loc (loc, integer_type_node,
9460 : build1 (INDIRECT_REF, cst_uchar_node,
9461 : fold_convert_loc (loc,
9462 : cst_uchar_ptr_node,
9463 : arg1)));
9464 53076 : tree ind2
9465 53076 : = fold_convert_loc (loc, integer_type_node,
9466 : build1 (INDIRECT_REF, cst_uchar_node,
9467 : fold_convert_loc (loc,
9468 : cst_uchar_ptr_node,
9469 : arg2)));
9470 53076 : return fold_build2_loc (loc, MINUS_EXPR, integer_type_node, ind1, ind2);
9471 : }
9472 :
9473 : return NULL_TREE;
9474 : }
9475 :
9476 : /* Fold a call to builtin isascii with argument ARG. */
9477 :
9478 : static tree
9479 211 : fold_builtin_isascii (location_t loc, tree arg)
9480 : {
9481 211 : if (!validate_arg (arg, INTEGER_TYPE))
9482 : return NULL_TREE;
9483 : else
9484 : {
9485 : /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
9486 211 : arg = fold_build2 (BIT_AND_EXPR, integer_type_node, arg,
9487 : build_int_cst (integer_type_node,
9488 : ~ HOST_WIDE_INT_UC (0x7f)));
9489 211 : return fold_build2_loc (loc, EQ_EXPR, integer_type_node,
9490 211 : arg, integer_zero_node);
9491 : }
9492 : }
9493 :
9494 : /* Fold a call to builtin toascii with argument ARG. */
9495 :
9496 : static tree
9497 168 : fold_builtin_toascii (location_t loc, tree arg)
9498 : {
9499 168 : if (!validate_arg (arg, INTEGER_TYPE))
9500 : return NULL_TREE;
9501 :
9502 : /* Transform toascii(c) -> (c & 0x7f). */
9503 168 : return fold_build2_loc (loc, BIT_AND_EXPR, integer_type_node, arg,
9504 : build_int_cst (integer_type_node, 0x7f));
9505 : }
9506 :
9507 : /* Fold a call to builtin isdigit with argument ARG. */
9508 :
9509 : static tree
9510 325 : fold_builtin_isdigit (location_t loc, tree arg)
9511 : {
9512 325 : if (!validate_arg (arg, INTEGER_TYPE))
9513 : return NULL_TREE;
9514 : else
9515 : {
9516 : /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
9517 : /* According to the C standard, isdigit is unaffected by locale.
9518 : However, it definitely is affected by the target character set. */
9519 313 : unsigned HOST_WIDE_INT target_digit0
9520 313 : = lang_hooks.to_target_charset ('0');
9521 :
9522 313 : if (target_digit0 == 0)
9523 : return NULL_TREE;
9524 :
9525 313 : arg = fold_convert_loc (loc, unsigned_type_node, arg);
9526 313 : arg = fold_build2 (MINUS_EXPR, unsigned_type_node, arg,
9527 : build_int_cst (unsigned_type_node, target_digit0));
9528 313 : return fold_build2_loc (loc, LE_EXPR, integer_type_node, arg,
9529 : build_int_cst (unsigned_type_node, 9));
9530 : }
9531 : }
9532 :
9533 : /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
9534 :
9535 : static tree
9536 353211 : fold_builtin_fabs (location_t loc, tree arg, tree type)
9537 : {
9538 353211 : if (!validate_arg (arg, REAL_TYPE))
9539 : return NULL_TREE;
9540 :
9541 353126 : arg = fold_convert_loc (loc, type, arg);
9542 353126 : return fold_build1_loc (loc, ABS_EXPR, type, arg);
9543 : }
9544 :
9545 : /* Fold a call to abs, labs, llabs, imaxabs, uabs, ulabs, ullabs or uimaxabs
9546 : with argument ARG. */
9547 :
9548 : static tree
9549 96170 : fold_builtin_abs (location_t loc, tree arg, tree type)
9550 : {
9551 96170 : if (!validate_arg (arg, INTEGER_TYPE) || !INTEGRAL_TYPE_P (type))
9552 : return NULL_TREE;
9553 :
9554 96122 : if (TYPE_UNSIGNED (type))
9555 : {
9556 1168 : if (TYPE_PRECISION (TREE_TYPE (arg))
9557 1168 : != TYPE_PRECISION (type)
9558 1168 : || TYPE_UNSIGNED (TREE_TYPE (arg)))
9559 : return NULL_TREE;
9560 1168 : return fold_build1_loc (loc, ABSU_EXPR, type, arg);
9561 : }
9562 94954 : arg = fold_convert_loc (loc, type, arg);
9563 94954 : return fold_build1_loc (loc, ABS_EXPR, type, arg);
9564 : }
9565 :
9566 : /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
9567 :
9568 : static tree
9569 95106 : fold_builtin_carg (location_t loc, tree arg, tree type)
9570 : {
9571 95106 : if (validate_arg (arg, COMPLEX_TYPE)
9572 95106 : && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TREE_TYPE (arg))))
9573 : {
9574 95106 : tree atan2_fn = mathfn_built_in (type, BUILT_IN_ATAN2);
9575 :
9576 95106 : if (atan2_fn)
9577 : {
9578 92933 : tree new_arg = builtin_save_expr (arg);
9579 92933 : tree r_arg = fold_build1_loc (loc, REALPART_EXPR, type, new_arg);
9580 92933 : tree i_arg = fold_build1_loc (loc, IMAGPART_EXPR, type, new_arg);
9581 92933 : return build_call_expr_loc (loc, atan2_fn, 2, i_arg, r_arg);
9582 : }
9583 : }
9584 :
9585 : return NULL_TREE;
9586 : }
9587 :
9588 : /* Fold a call to builtin frexp, we can assume the base is 2. */
9589 :
9590 : static tree
9591 84583 : fold_builtin_frexp (location_t loc, tree arg0, tree arg1, tree rettype)
9592 : {
9593 84583 : if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9594 : return NULL_TREE;
9595 :
9596 84583 : STRIP_NOPS (arg0);
9597 :
9598 84583 : if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9599 : return NULL_TREE;
9600 :
9601 2210 : arg1 = build_fold_indirect_ref_loc (loc, arg1);
9602 :
9603 : /* Proceed if a valid pointer type was passed in. */
9604 2210 : if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == integer_type_node)
9605 : {
9606 2210 : const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9607 2210 : tree frac, exp, res;
9608 :
9609 2210 : switch (value->cl)
9610 : {
9611 276 : case rvc_zero:
9612 276 : case rvc_nan:
9613 276 : case rvc_inf:
9614 : /* For +-0, return (*exp = 0, +-0). */
9615 : /* For +-NaN or +-Inf, *exp is unspecified, but something should
9616 : be stored there so that it isn't read from uninitialized object.
9617 : As glibc and newlib store *exp = 0 for +-Inf/NaN, storing
9618 : 0 here as well is easiest. */
9619 276 : exp = integer_zero_node;
9620 276 : frac = arg0;
9621 276 : break;
9622 1934 : case rvc_normal:
9623 1934 : {
9624 : /* Since the frexp function always expects base 2, and in
9625 : GCC normalized significands are already in the range
9626 : [0.5, 1.0), we have exactly what frexp wants. */
9627 1934 : REAL_VALUE_TYPE frac_rvt = *value;
9628 1934 : SET_REAL_EXP (&frac_rvt, 0);
9629 1934 : frac = build_real (rettype, frac_rvt);
9630 1934 : exp = build_int_cst (integer_type_node, REAL_EXP (value));
9631 : }
9632 1934 : break;
9633 0 : default:
9634 0 : gcc_unreachable ();
9635 : }
9636 :
9637 : /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9638 2210 : arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1, exp);
9639 2210 : TREE_SIDE_EFFECTS (arg1) = 1;
9640 2210 : res = fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1, frac);
9641 2210 : suppress_warning (res, OPT_Wunused_value);
9642 2210 : return res;
9643 : }
9644 :
9645 : return NULL_TREE;
9646 : }
9647 :
9648 : /* Fold a call to builtin modf. */
9649 :
9650 : static tree
9651 65280 : fold_builtin_modf (location_t loc, tree arg0, tree arg1, tree rettype)
9652 : {
9653 65280 : if (! validate_arg (arg0, REAL_TYPE) || ! validate_arg (arg1, POINTER_TYPE))
9654 : return NULL_TREE;
9655 :
9656 65280 : STRIP_NOPS (arg0);
9657 :
9658 65280 : if (!(TREE_CODE (arg0) == REAL_CST && ! TREE_OVERFLOW (arg0)))
9659 : return NULL_TREE;
9660 :
9661 2474 : arg1 = build_fold_indirect_ref_loc (loc, arg1);
9662 :
9663 : /* Proceed if a valid pointer type was passed in. */
9664 2474 : if (TYPE_MAIN_VARIANT (TREE_TYPE (arg1)) == TYPE_MAIN_VARIANT (rettype))
9665 : {
9666 2474 : const REAL_VALUE_TYPE *const value = TREE_REAL_CST_PTR (arg0);
9667 2474 : REAL_VALUE_TYPE trunc, frac;
9668 2474 : tree res;
9669 :
9670 2474 : switch (value->cl)
9671 : {
9672 228 : case rvc_nan:
9673 228 : case rvc_zero:
9674 : /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
9675 228 : trunc = frac = *value;
9676 228 : break;
9677 96 : case rvc_inf:
9678 : /* For +-Inf, return (*arg1 = arg0, +-0). */
9679 96 : frac = dconst0;
9680 96 : frac.sign = value->sign;
9681 96 : trunc = *value;
9682 96 : break;
9683 2150 : case rvc_normal:
9684 : /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
9685 2150 : real_trunc (&trunc, VOIDmode, value);
9686 2150 : real_arithmetic (&frac, MINUS_EXPR, value, &trunc);
9687 : /* If the original number was negative and already
9688 : integral, then the fractional part is -0.0. */
9689 2150 : if (value->sign && frac.cl == rvc_zero)
9690 69 : frac.sign = value->sign;
9691 : break;
9692 : }
9693 :
9694 : /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9695 2474 : arg1 = fold_build2_loc (loc, MODIFY_EXPR, rettype, arg1,
9696 : build_real (rettype, trunc));
9697 2474 : TREE_SIDE_EFFECTS (arg1) = 1;
9698 2474 : res = fold_build2_loc (loc, COMPOUND_EXPR, rettype, arg1,
9699 : build_real (rettype, frac));
9700 2474 : suppress_warning (res, OPT_Wunused_value);
9701 2474 : return res;
9702 : }
9703 :
9704 : return NULL_TREE;
9705 : }
9706 :
9707 : /* Given a location LOC, an interclass builtin function decl FNDECL
9708 : and its single argument ARG, return an folded expression computing
9709 : the same, or NULL_TREE if we either couldn't or didn't want to fold
9710 : (the latter happen if there's an RTL instruction available). */
9711 :
9712 : static tree
9713 1010643 : fold_builtin_interclass_mathfn (location_t loc, tree fndecl, tree arg)
9714 : {
9715 1010643 : machine_mode mode;
9716 :
9717 1010643 : if (!validate_arg (arg, REAL_TYPE))
9718 : return NULL_TREE;
9719 :
9720 1010643 : if (interclass_mathfn_icode (arg, fndecl) != CODE_FOR_nothing)
9721 : return NULL_TREE;
9722 :
9723 1010643 : mode = TYPE_MODE (TREE_TYPE (arg));
9724 :
9725 7070659 : bool is_ibm_extended = MODE_COMPOSITE_P (mode);
9726 :
9727 : /* If there is no optab, try generic code. */
9728 1010643 : switch (DECL_FUNCTION_CODE (fndecl))
9729 : {
9730 224415 : tree result;
9731 :
9732 224415 : CASE_FLT_FN (BUILT_IN_ISINF):
9733 224415 : {
9734 : /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
9735 224415 : tree const isgr_fn = builtin_decl_explicit (BUILT_IN_ISGREATER);
9736 224415 : tree type = TREE_TYPE (arg);
9737 224415 : REAL_VALUE_TYPE r;
9738 224415 : char buf[128];
9739 :
9740 224415 : if (is_ibm_extended)
9741 : {
9742 : /* NaN and Inf are encoded in the high-order double value
9743 : only. The low-order value is not significant. */
9744 0 : type = double_type_node;
9745 0 : mode = DFmode;
9746 0 : arg = fold_build1_loc (loc, NOP_EXPR, type, arg);
9747 : }
9748 224415 : get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf), false);
9749 224415 : real_from_string3 (&r, buf, mode);
9750 224415 : result = build_call_expr (isgr_fn, 2,
9751 : fold_build1_loc (loc, ABS_EXPR, type, arg),
9752 : build_real (type, r));
9753 224415 : return result;
9754 : }
9755 336499 : CASE_FLT_FN (BUILT_IN_FINITE):
9756 336499 : case BUILT_IN_ISFINITE:
9757 336499 : {
9758 : /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9759 336499 : tree const isle_fn = builtin_decl_explicit (BUILT_IN_ISLESSEQUAL);
9760 336499 : tree type = TREE_TYPE (arg);
9761 336499 : REAL_VALUE_TYPE r;
9762 336499 : char buf[128];
9763 :
9764 336499 : if (is_ibm_extended)
9765 : {
9766 : /* NaN and Inf are encoded in the high-order double value
9767 : only. The low-order value is not significant. */
9768 0 : type = double_type_node;
9769 0 : mode = DFmode;
9770 0 : arg = fold_build1_loc (loc, NOP_EXPR, type, arg);
9771 : }
9772 336499 : get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf), false);
9773 336499 : real_from_string3 (&r, buf, mode);
9774 336499 : result = build_call_expr (isle_fn, 2,
9775 : fold_build1_loc (loc, ABS_EXPR, type, arg),
9776 : build_real (type, r));
9777 : /*result = fold_build2_loc (loc, UNGT_EXPR,
9778 : TREE_TYPE (TREE_TYPE (fndecl)),
9779 : fold_build1_loc (loc, ABS_EXPR, type, arg),
9780 : build_real (type, r));
9781 : result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9782 : TREE_TYPE (TREE_TYPE (fndecl)),
9783 : result);*/
9784 336499 : return result;
9785 : }
9786 222599 : case BUILT_IN_ISNORMAL:
9787 222599 : {
9788 : /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9789 : islessequal(fabs(x),DBL_MAX). */
9790 222599 : tree const isle_fn = builtin_decl_explicit (BUILT_IN_ISLESSEQUAL);
9791 222599 : tree type = TREE_TYPE (arg);
9792 222599 : tree orig_arg, max_exp, min_exp;
9793 222599 : machine_mode orig_mode = mode;
9794 222599 : REAL_VALUE_TYPE rmax, rmin;
9795 222599 : char buf[128];
9796 :
9797 222599 : orig_arg = arg = builtin_save_expr (arg);
9798 222599 : if (is_ibm_extended)
9799 : {
9800 : /* Use double to test the normal range of IBM extended
9801 : precision. Emin for IBM extended precision is
9802 : different to emin for IEEE double, being 53 higher
9803 : since the low double exponent is at least 53 lower
9804 : than the high double exponent. */
9805 0 : type = double_type_node;
9806 0 : mode = DFmode;
9807 0 : arg = fold_build1_loc (loc, NOP_EXPR, type, arg);
9808 : }
9809 222599 : arg = fold_build1_loc (loc, ABS_EXPR, type, arg);
9810 :
9811 222599 : get_max_float (REAL_MODE_FORMAT (mode), buf, sizeof (buf), false);
9812 222599 : real_from_string3 (&rmax, buf, mode);
9813 222599 : if (DECIMAL_FLOAT_MODE_P (mode))
9814 1 : sprintf (buf, "1E%d", REAL_MODE_FORMAT (orig_mode)->emin - 1);
9815 : else
9816 222598 : sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (orig_mode)->emin - 1);
9817 222599 : real_from_string3 (&rmin, buf, orig_mode);
9818 222599 : max_exp = build_real (type, rmax);
9819 222599 : min_exp = build_real (type, rmin);
9820 :
9821 222599 : max_exp = build_call_expr (isle_fn, 2, arg, max_exp);
9822 222599 : if (is_ibm_extended)
9823 : {
9824 : /* Testing the high end of the range is done just using
9825 : the high double, using the same test as isfinite().
9826 : For the subnormal end of the range we first test the
9827 : high double, then if its magnitude is equal to the
9828 : limit of 0x1p-969, we test whether the low double is
9829 : non-zero and opposite sign to the high double. */
9830 0 : tree const islt_fn = builtin_decl_explicit (BUILT_IN_ISLESS);
9831 0 : tree const isgt_fn = builtin_decl_explicit (BUILT_IN_ISGREATER);
9832 0 : tree gt_min = build_call_expr (isgt_fn, 2, arg, min_exp);
9833 0 : tree eq_min = fold_build2 (EQ_EXPR, integer_type_node,
9834 : arg, min_exp);
9835 0 : tree as_complex = build1 (VIEW_CONVERT_EXPR,
9836 : complex_double_type_node, orig_arg);
9837 0 : tree hi_dbl = build1 (REALPART_EXPR, type, as_complex);
9838 0 : tree lo_dbl = build1 (IMAGPART_EXPR, type, as_complex);
9839 0 : tree zero = build_real (type, dconst0);
9840 0 : tree hilt = build_call_expr (islt_fn, 2, hi_dbl, zero);
9841 0 : tree lolt = build_call_expr (islt_fn, 2, lo_dbl, zero);
9842 0 : tree logt = build_call_expr (isgt_fn, 2, lo_dbl, zero);
9843 0 : tree ok_lo = fold_build1 (TRUTH_NOT_EXPR, integer_type_node,
9844 : fold_build3 (COND_EXPR,
9845 : integer_type_node,
9846 : hilt, logt, lolt));
9847 0 : eq_min = fold_build2 (TRUTH_ANDIF_EXPR, integer_type_node,
9848 : eq_min, ok_lo);
9849 0 : min_exp = fold_build2 (TRUTH_ORIF_EXPR, integer_type_node,
9850 : gt_min, eq_min);
9851 : }
9852 : else
9853 : {
9854 222599 : tree const isge_fn
9855 222599 : = builtin_decl_explicit (BUILT_IN_ISGREATEREQUAL);
9856 222599 : min_exp = build_call_expr (isge_fn, 2, arg, min_exp);
9857 : }
9858 222599 : result = fold_build2 (BIT_AND_EXPR, integer_type_node,
9859 : max_exp, min_exp);
9860 222599 : return result;
9861 : }
9862 225596 : CASE_FLT_FN (BUILT_IN_ISNAN):
9863 225596 : case BUILT_IN_ISNAND32:
9864 225596 : case BUILT_IN_ISNAND64:
9865 225596 : case BUILT_IN_ISNAND128:
9866 225596 : {
9867 : /* In IBM extended NaN and Inf are encoded in the high-order double
9868 : value only. The low-order value is not significant. */
9869 225596 : if (is_ibm_extended)
9870 0 : arg = fold_build1_loc (loc, NOP_EXPR, double_type_node, arg);
9871 225596 : arg = builtin_save_expr (arg);
9872 225596 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
9873 225596 : return fold_build2_loc (loc, UNORDERED_EXPR, type, arg, arg);
9874 : }
9875 : default:
9876 : break;
9877 : }
9878 :
9879 : return NULL_TREE;
9880 : }
9881 :
9882 : /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9883 : ARG is the argument for the call. */
9884 :
9885 : static tree
9886 817036 : fold_builtin_classify (location_t loc, tree fndecl, tree arg, int builtin_index)
9887 : {
9888 817036 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
9889 :
9890 817036 : if (!validate_arg (arg, REAL_TYPE))
9891 : return NULL_TREE;
9892 :
9893 817036 : switch (builtin_index)
9894 : {
9895 226070 : case BUILT_IN_ISINF:
9896 226070 : if (tree_expr_infinite_p (arg))
9897 0 : return omit_one_operand_loc (loc, type, integer_one_node, arg);
9898 226070 : if (!tree_expr_maybe_infinite_p (arg))
9899 121 : return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9900 : return NULL_TREE;
9901 :
9902 708 : case BUILT_IN_ISINF_SIGN:
9903 708 : {
9904 : /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9905 : /* In a boolean context, GCC will fold the inner COND_EXPR to
9906 : 1. So e.g. "if (isinf_sign(x))" would be folded to just
9907 : "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9908 708 : tree signbit_fn = builtin_decl_explicit (BUILT_IN_SIGNBIT);
9909 708 : tree isinf_fn = builtin_decl_explicit (BUILT_IN_ISINF);
9910 708 : tree tmp = NULL_TREE;
9911 :
9912 708 : arg = builtin_save_expr (arg);
9913 :
9914 708 : if (signbit_fn && isinf_fn)
9915 : {
9916 708 : tree signbit_call = build_call_expr_loc (loc, signbit_fn, 1, arg);
9917 708 : tree isinf_call = build_call_expr_loc (loc, isinf_fn, 1, arg);
9918 :
9919 708 : signbit_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9920 : signbit_call, integer_zero_node);
9921 708 : isinf_call = fold_build2_loc (loc, NE_EXPR, integer_type_node,
9922 : isinf_call, integer_zero_node);
9923 :
9924 708 : tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node, signbit_call,
9925 : integer_minus_one_node, integer_one_node);
9926 708 : tmp = fold_build3_loc (loc, COND_EXPR, integer_type_node,
9927 : isinf_call, tmp,
9928 : integer_zero_node);
9929 : }
9930 :
9931 : return tmp;
9932 : }
9933 :
9934 336723 : case BUILT_IN_ISFINITE:
9935 336723 : if (tree_expr_finite_p (arg))
9936 224 : return omit_one_operand_loc (loc, type, integer_one_node, arg);
9937 336499 : if (tree_expr_nan_p (arg) || tree_expr_infinite_p (arg))
9938 0 : return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9939 : return NULL_TREE;
9940 :
9941 225720 : case BUILT_IN_ISNAN:
9942 225720 : if (tree_expr_nan_p (arg))
9943 0 : return omit_one_operand_loc (loc, type, integer_one_node, arg);
9944 225720 : if (!tree_expr_maybe_nan_p (arg))
9945 124 : return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9946 : return NULL_TREE;
9947 :
9948 27815 : case BUILT_IN_ISSIGNALING:
9949 : /* Folding to true for REAL_CST is done in fold_const_call_ss.
9950 : Don't use tree_expr_signaling_nan_p (arg) -> integer_one_node
9951 : and !tree_expr_maybe_signaling_nan_p (arg) -> integer_zero_node
9952 : here, so there is some possibility of __builtin_issignaling working
9953 : without -fsignaling-nans. Especially when -fno-signaling-nans is
9954 : the default. */
9955 27815 : if (!tree_expr_maybe_nan_p (arg))
9956 0 : return omit_one_operand_loc (loc, type, integer_zero_node, arg);
9957 : return NULL_TREE;
9958 :
9959 0 : default:
9960 0 : gcc_unreachable ();
9961 : }
9962 : }
9963 :
9964 : /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9965 : This builtin will generate code to return the appropriate floating
9966 : point classification depending on the value of the floating point
9967 : number passed in. The possible return values must be supplied as
9968 : int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9969 : FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9970 : one floating point argument which is "type generic". */
9971 :
9972 : static tree
9973 97101 : fold_builtin_fpclassify (location_t loc, tree *args, int nargs)
9974 : {
9975 97101 : tree fp_nan, fp_infinite, fp_normal, fp_subnormal, fp_zero,
9976 : arg, type, res, tmp;
9977 97101 : machine_mode mode;
9978 97101 : REAL_VALUE_TYPE r;
9979 97101 : char buf[128];
9980 :
9981 : /* Verify the required arguments in the original call. */
9982 97101 : if (nargs != 6
9983 97101 : || !validate_arg (args[0], INTEGER_TYPE)
9984 97101 : || !validate_arg (args[1], INTEGER_TYPE)
9985 97101 : || !validate_arg (args[2], INTEGER_TYPE)
9986 97101 : || !validate_arg (args[3], INTEGER_TYPE)
9987 97101 : || !validate_arg (args[4], INTEGER_TYPE)
9988 194202 : || !validate_arg (args[5], REAL_TYPE))
9989 : return NULL_TREE;
9990 :
9991 97101 : fp_nan = args[0];
9992 97101 : fp_infinite = args[1];
9993 97101 : fp_normal = args[2];
9994 97101 : fp_subnormal = args[3];
9995 97101 : fp_zero = args[4];
9996 97101 : arg = args[5];
9997 97101 : type = TREE_TYPE (arg);
9998 97101 : mode = TYPE_MODE (type);
9999 97101 : arg = builtin_save_expr (fold_build1_loc (loc, ABS_EXPR, type, arg));
10000 :
10001 : /* fpclassify(x) ->
10002 : isnan(x) ? FP_NAN :
10003 : (fabs(x) == Inf ? FP_INFINITE :
10004 : (fabs(x) >= DBL_MIN ? FP_NORMAL :
10005 : (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
10006 :
10007 97101 : tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
10008 : build_real (type, dconst0));
10009 97101 : res = fold_build3_loc (loc, COND_EXPR, integer_type_node,
10010 : tmp, fp_zero, fp_subnormal);
10011 :
10012 97101 : if (DECIMAL_FLOAT_MODE_P (mode))
10013 3 : sprintf (buf, "1E%d", REAL_MODE_FORMAT (mode)->emin - 1);
10014 : else
10015 97098 : sprintf (buf, "0x1p%d", REAL_MODE_FORMAT (mode)->emin - 1);
10016 97101 : real_from_string3 (&r, buf, mode);
10017 97101 : tmp = fold_build2_loc (loc, GE_EXPR, integer_type_node,
10018 : arg, build_real (type, r));
10019 97101 : res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
10020 : fp_normal, res);
10021 :
10022 97101 : if (tree_expr_maybe_infinite_p (arg))
10023 : {
10024 97013 : tmp = fold_build2_loc (loc, EQ_EXPR, integer_type_node, arg,
10025 : build_real (type, dconstinf));
10026 97013 : res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
10027 : fp_infinite, res);
10028 : }
10029 :
10030 97101 : if (tree_expr_maybe_nan_p (arg))
10031 : {
10032 97011 : tmp = fold_build2_loc (loc, ORDERED_EXPR, integer_type_node, arg, arg);
10033 97011 : res = fold_build3_loc (loc, COND_EXPR, integer_type_node, tmp,
10034 : res, fp_nan);
10035 : }
10036 :
10037 : return res;
10038 : }
10039 :
10040 : /* Fold a call to an unordered comparison function such as
10041 : __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
10042 : being called and ARG0 and ARG1 are the arguments for the call.
10043 : UNORDERED_CODE and ORDERED_CODE are comparison codes that give
10044 : the opposite of the desired result. UNORDERED_CODE is used
10045 : for modes that can hold NaNs and ORDERED_CODE is used for
10046 : the rest. */
10047 :
10048 : static tree
10049 2346043 : fold_builtin_unordered_cmp (location_t loc, tree fndecl, tree arg0, tree arg1,
10050 : enum tree_code unordered_code,
10051 : enum tree_code ordered_code)
10052 : {
10053 2346043 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
10054 2346043 : enum tree_code code;
10055 2346043 : tree type0, type1;
10056 2346043 : enum tree_code code0, code1;
10057 2346043 : tree cmp_type = NULL_TREE;
10058 :
10059 2346043 : type0 = TREE_TYPE (arg0);
10060 2346043 : type1 = TREE_TYPE (arg1);
10061 :
10062 2346043 : code0 = TREE_CODE (type0);
10063 2346043 : code1 = TREE_CODE (type1);
10064 :
10065 2346043 : if (code0 == REAL_TYPE && code1 == REAL_TYPE)
10066 : /* Choose the wider of two real types. */
10067 2345863 : cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
10068 2345863 : ? type0 : type1;
10069 180 : else if (code0 == REAL_TYPE
10070 91 : && (code1 == INTEGER_TYPE || code1 == BITINT_TYPE))
10071 : cmp_type = type0;
10072 89 : else if ((code0 == INTEGER_TYPE || code0 == BITINT_TYPE)
10073 89 : && code1 == REAL_TYPE)
10074 135 : cmp_type = type1;
10075 :
10076 2346043 : arg0 = fold_convert_loc (loc, cmp_type, arg0);
10077 2346043 : arg1 = fold_convert_loc (loc, cmp_type, arg1);
10078 :
10079 2346043 : if (unordered_code == UNORDERED_EXPR)
10080 : {
10081 223586 : if (tree_expr_nan_p (arg0) || tree_expr_nan_p (arg1))
10082 16 : return omit_two_operands_loc (loc, type, integer_one_node, arg0, arg1);
10083 223570 : if (!tree_expr_maybe_nan_p (arg0) && !tree_expr_maybe_nan_p (arg1))
10084 141 : return omit_two_operands_loc (loc, type, integer_zero_node, arg0, arg1);
10085 223429 : return fold_build2_loc (loc, UNORDERED_EXPR, type, arg0, arg1);
10086 : }
10087 :
10088 2125308 : code = (tree_expr_maybe_nan_p (arg0) || tree_expr_maybe_nan_p (arg1))
10089 2122457 : ? unordered_code : ordered_code;
10090 2122457 : return fold_build1_loc (loc, TRUTH_NOT_EXPR, type,
10091 2122457 : fold_build2_loc (loc, code, type, arg0, arg1));
10092 : }
10093 :
10094 : /* Fold a call to __builtin_iseqsig(). ARG0 and ARG1 are the arguments.
10095 : After choosing the wider floating-point type for the comparison,
10096 : the code is folded to:
10097 : SAVE_EXPR<ARG0> >= SAVE_EXPR<ARG1> && SAVE_EXPR<ARG0> <= SAVE_EXPR<ARG1> */
10098 :
10099 : static tree
10100 709 : fold_builtin_iseqsig (location_t loc, tree arg0, tree arg1)
10101 : {
10102 709 : tree type0, type1;
10103 709 : enum tree_code code0, code1;
10104 709 : tree cmp1, cmp2, cmp_type = NULL_TREE;
10105 :
10106 709 : type0 = TREE_TYPE (arg0);
10107 709 : type1 = TREE_TYPE (arg1);
10108 :
10109 709 : code0 = TREE_CODE (type0);
10110 709 : code1 = TREE_CODE (type1);
10111 :
10112 709 : if (code0 == REAL_TYPE && code1 == REAL_TYPE)
10113 : /* Choose the wider of two real types. */
10114 690 : cmp_type = TYPE_PRECISION (type0) >= TYPE_PRECISION (type1)
10115 690 : ? type0 : type1;
10116 19 : else if (code0 == REAL_TYPE
10117 6 : && (code1 == INTEGER_TYPE || code1 == BITINT_TYPE))
10118 : cmp_type = type0;
10119 13 : else if ((code0 == INTEGER_TYPE || code0 == BITINT_TYPE)
10120 13 : && code1 == REAL_TYPE)
10121 13 : cmp_type = type1;
10122 :
10123 709 : arg0 = builtin_save_expr (fold_convert_loc (loc, cmp_type, arg0));
10124 709 : arg1 = builtin_save_expr (fold_convert_loc (loc, cmp_type, arg1));
10125 :
10126 709 : cmp1 = fold_build2_loc (loc, GE_EXPR, integer_type_node, arg0, arg1);
10127 709 : cmp2 = fold_build2_loc (loc, LE_EXPR, integer_type_node, arg0, arg1);
10128 :
10129 709 : return fold_build2_loc (loc, TRUTH_AND_EXPR, integer_type_node, cmp1, cmp2);
10130 : }
10131 :
10132 : /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
10133 : arithmetics if it can never overflow, or into internal functions that
10134 : return both result of arithmetics and overflowed boolean flag in
10135 : a complex integer result, or some other check for overflow.
10136 : Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
10137 : checking part of that. */
10138 :
10139 : static tree
10140 459437 : fold_builtin_arith_overflow (location_t loc, enum built_in_function fcode,
10141 : tree arg0, tree arg1, tree arg2)
10142 : {
10143 459437 : enum internal_fn ifn = IFN_LAST;
10144 : /* The code of the expression corresponding to the built-in. */
10145 459437 : enum tree_code opcode = ERROR_MARK;
10146 459437 : bool ovf_only = false;
10147 :
10148 459437 : switch (fcode)
10149 : {
10150 : case BUILT_IN_ADD_OVERFLOW_P:
10151 : ovf_only = true;
10152 : /* FALLTHRU */
10153 : case BUILT_IN_ADD_OVERFLOW:
10154 : case BUILT_IN_SADD_OVERFLOW:
10155 : case BUILT_IN_SADDL_OVERFLOW:
10156 : case BUILT_IN_SADDLL_OVERFLOW:
10157 : case BUILT_IN_UADD_OVERFLOW:
10158 : case BUILT_IN_UADDL_OVERFLOW:
10159 : case BUILT_IN_UADDLL_OVERFLOW:
10160 : opcode = PLUS_EXPR;
10161 : ifn = IFN_ADD_OVERFLOW;
10162 : break;
10163 15577 : case BUILT_IN_SUB_OVERFLOW_P:
10164 15577 : ovf_only = true;
10165 : /* FALLTHRU */
10166 37399 : case BUILT_IN_SUB_OVERFLOW:
10167 37399 : case BUILT_IN_SSUB_OVERFLOW:
10168 37399 : case BUILT_IN_SSUBL_OVERFLOW:
10169 37399 : case BUILT_IN_SSUBLL_OVERFLOW:
10170 37399 : case BUILT_IN_USUB_OVERFLOW:
10171 37399 : case BUILT_IN_USUBL_OVERFLOW:
10172 37399 : case BUILT_IN_USUBLL_OVERFLOW:
10173 37399 : opcode = MINUS_EXPR;
10174 37399 : ifn = IFN_SUB_OVERFLOW;
10175 37399 : break;
10176 15871 : case BUILT_IN_MUL_OVERFLOW_P:
10177 15871 : ovf_only = true;
10178 : /* FALLTHRU */
10179 383314 : case BUILT_IN_MUL_OVERFLOW:
10180 383314 : case BUILT_IN_SMUL_OVERFLOW:
10181 383314 : case BUILT_IN_SMULL_OVERFLOW:
10182 383314 : case BUILT_IN_SMULLL_OVERFLOW:
10183 383314 : case BUILT_IN_UMUL_OVERFLOW:
10184 383314 : case BUILT_IN_UMULL_OVERFLOW:
10185 383314 : case BUILT_IN_UMULLL_OVERFLOW:
10186 383314 : opcode = MULT_EXPR;
10187 383314 : ifn = IFN_MUL_OVERFLOW;
10188 383314 : break;
10189 0 : default:
10190 0 : gcc_unreachable ();
10191 : }
10192 :
10193 : /* For the "generic" overloads, the first two arguments can have different
10194 : types and the last argument determines the target type to use to check
10195 : for overflow. The arguments of the other overloads all have the same
10196 : type. */
10197 459437 : tree type = ovf_only ? TREE_TYPE (arg2) : TREE_TYPE (TREE_TYPE (arg2));
10198 :
10199 : /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
10200 : arguments are constant, attempt to fold the built-in call into a constant
10201 : expression indicating whether or not it detected an overflow. */
10202 459437 : if (ovf_only
10203 43258 : && TREE_CODE (arg0) == INTEGER_CST
10204 13131 : && TREE_CODE (arg1) == INTEGER_CST)
10205 : /* Perform the computation in the target type and check for overflow. */
10206 7347 : return omit_one_operand_loc (loc, boolean_type_node,
10207 7347 : arith_overflowed_p (opcode, type, arg0, arg1)
10208 : ? boolean_true_node : boolean_false_node,
10209 7347 : arg2);
10210 :
10211 452090 : tree intres, ovfres;
10212 452090 : if (TREE_CODE (arg0) == INTEGER_CST && TREE_CODE (arg1) == INTEGER_CST)
10213 : {
10214 57630 : intres = fold_binary_loc (loc, opcode, type,
10215 : fold_convert_loc (loc, type, arg0),
10216 : fold_convert_loc (loc, type, arg1));
10217 57630 : if (TREE_OVERFLOW (intres))
10218 1592 : intres = drop_tree_overflow (intres);
10219 115260 : ovfres = (arith_overflowed_p (opcode, type, arg0, arg1)
10220 57630 : ? boolean_true_node : boolean_false_node);
10221 : }
10222 : else
10223 : {
10224 394460 : tree ctype = build_complex_type (type);
10225 394460 : tree call = build_call_expr_internal_loc (loc, ifn, ctype, 2,
10226 : arg0, arg1);
10227 394460 : tree tgt;
10228 394460 : if (ovf_only)
10229 : {
10230 : tgt = call;
10231 394460 : intres = NULL_TREE;
10232 : }
10233 : else
10234 : {
10235 : /* Force SAVE_EXPR even for calls which satisfy tree_invariant_p_1,
10236 : as while the call itself is const, the REALPART_EXPR store is
10237 : certainly not. And in any case, we want just one call,
10238 : not multiple and trying to CSE them later. */
10239 358549 : TREE_SIDE_EFFECTS (call) = 1;
10240 358549 : tgt = save_expr (call);
10241 : }
10242 394460 : intres = build1_loc (loc, REALPART_EXPR, type, tgt);
10243 394460 : ovfres = build1_loc (loc, IMAGPART_EXPR, type, tgt);
10244 394460 : ovfres = fold_convert_loc (loc, boolean_type_node, ovfres);
10245 : }
10246 :
10247 452090 : if (ovf_only)
10248 35911 : return omit_one_operand_loc (loc, boolean_type_node, ovfres, arg2);
10249 :
10250 416179 : tree mem_arg2 = build_fold_indirect_ref_loc (loc, arg2);
10251 416179 : tree store
10252 416179 : = fold_build2_loc (loc, MODIFY_EXPR, void_type_node, mem_arg2, intres);
10253 416179 : return build2_loc (loc, COMPOUND_EXPR, boolean_type_node, store, ovfres);
10254 : }
10255 :
10256 : /* Fold __builtin_{clz,ctz,clrsb,ffs,parity,popcount}g into corresponding
10257 : internal function. */
10258 :
10259 : static tree
10260 245009 : fold_builtin_bit_query (location_t loc, enum built_in_function fcode,
10261 : tree arg0, tree arg1)
10262 : {
10263 245009 : enum internal_fn ifn;
10264 245009 : enum built_in_function fcodei, fcodel, fcodell;
10265 245009 : tree arg0_type = TREE_TYPE (arg0);
10266 245009 : tree cast_type = NULL_TREE;
10267 245009 : int addend = 0;
10268 :
10269 245009 : switch (fcode)
10270 : {
10271 175616 : case BUILT_IN_CLZG:
10272 175616 : if (arg1 && TREE_CODE (arg1) != INTEGER_CST)
10273 : return NULL_TREE;
10274 : ifn = IFN_CLZ;
10275 : fcodei = BUILT_IN_CLZ;
10276 : fcodel = BUILT_IN_CLZL;
10277 : fcodell = BUILT_IN_CLZLL;
10278 : break;
10279 62141 : case BUILT_IN_CTZG:
10280 62141 : if (arg1 && TREE_CODE (arg1) != INTEGER_CST)
10281 : return NULL_TREE;
10282 : ifn = IFN_CTZ;
10283 : fcodei = BUILT_IN_CTZ;
10284 : fcodel = BUILT_IN_CTZL;
10285 : fcodell = BUILT_IN_CTZLL;
10286 : break;
10287 : case BUILT_IN_CLRSBG:
10288 : ifn = IFN_CLRSB;
10289 : fcodei = BUILT_IN_CLRSB;
10290 : fcodel = BUILT_IN_CLRSBL;
10291 : fcodell = BUILT_IN_CLRSBLL;
10292 : break;
10293 84 : case BUILT_IN_FFSG:
10294 84 : ifn = IFN_FFS;
10295 84 : fcodei = BUILT_IN_FFS;
10296 84 : fcodel = BUILT_IN_FFSL;
10297 84 : fcodell = BUILT_IN_FFSLL;
10298 84 : break;
10299 77 : case BUILT_IN_PARITYG:
10300 77 : ifn = IFN_PARITY;
10301 77 : fcodei = BUILT_IN_PARITY;
10302 77 : fcodel = BUILT_IN_PARITYL;
10303 77 : fcodell = BUILT_IN_PARITYLL;
10304 77 : break;
10305 7009 : case BUILT_IN_POPCOUNTG:
10306 7009 : ifn = IFN_POPCOUNT;
10307 7009 : fcodei = BUILT_IN_POPCOUNT;
10308 7009 : fcodel = BUILT_IN_POPCOUNTL;
10309 7009 : fcodell = BUILT_IN_POPCOUNTLL;
10310 7009 : break;
10311 0 : default:
10312 0 : gcc_unreachable ();
10313 : }
10314 :
10315 244839 : if (TYPE_PRECISION (arg0_type)
10316 244839 : <= TYPE_PRECISION (long_long_unsigned_type_node))
10317 : {
10318 208072 : if (TYPE_PRECISION (arg0_type) <= TYPE_PRECISION (unsigned_type_node))
10319 :
10320 71352 : cast_type = (TYPE_UNSIGNED (arg0_type)
10321 71298 : ? unsigned_type_node : integer_type_node);
10322 136774 : else if (TYPE_PRECISION (arg0_type)
10323 136774 : <= TYPE_PRECISION (long_unsigned_type_node))
10324 : {
10325 136744 : cast_type = (TYPE_UNSIGNED (arg0_type)
10326 136672 : ? long_unsigned_type_node : long_integer_type_node);
10327 : fcodei = fcodel;
10328 : }
10329 : else
10330 : {
10331 102 : cast_type = (TYPE_UNSIGNED (arg0_type)
10332 102 : ? long_long_unsigned_type_node
10333 : : long_long_integer_type_node);
10334 : fcodei = fcodell;
10335 : }
10336 : }
10337 73534 : else if (TYPE_PRECISION (arg0_type) <= MAX_FIXED_MODE_SIZE)
10338 : {
10339 36661 : cast_type
10340 36661 : = build_nonstandard_integer_type (MAX_FIXED_MODE_SIZE,
10341 36661 : TYPE_UNSIGNED (arg0_type));
10342 36661 : gcc_assert (TYPE_PRECISION (cast_type)
10343 : == 2 * TYPE_PRECISION (long_long_unsigned_type_node));
10344 : fcodei = END_BUILTINS;
10345 : }
10346 : else
10347 : fcodei = END_BUILTINS;
10348 244733 : if (cast_type)
10349 : {
10350 244733 : switch (fcode)
10351 : {
10352 175580 : case BUILT_IN_CLZG:
10353 175580 : case BUILT_IN_CLRSBG:
10354 175580 : addend = TYPE_PRECISION (arg0_type) - TYPE_PRECISION (cast_type);
10355 175580 : break;
10356 : default:
10357 : break;
10358 : }
10359 244733 : arg0 = fold_convert (cast_type, arg0);
10360 244733 : arg0_type = cast_type;
10361 : }
10362 :
10363 244839 : if (arg1)
10364 164147 : arg1 = fold_convert (integer_type_node, arg1);
10365 :
10366 244839 : tree arg2 = arg1;
10367 244839 : if (fcode == BUILT_IN_CLZG && addend)
10368 : {
10369 2838 : if (arg1)
10370 2805 : arg0 = save_expr (arg0);
10371 : arg2 = NULL_TREE;
10372 : }
10373 244839 : tree call = NULL_TREE, tem;
10374 244839 : if (TYPE_PRECISION (arg0_type) == MAX_FIXED_MODE_SIZE
10375 36763 : && (TYPE_PRECISION (arg0_type)
10376 36763 : == 2 * TYPE_PRECISION (long_long_unsigned_type_node))
10377 : /* If the target supports the optab, then don't do the expansion. */
10378 281500 : && !direct_internal_fn_supported_p (ifn, arg0_type, OPTIMIZE_FOR_BOTH))
10379 : {
10380 : /* __int128 expansions using up to 2 long long builtins. */
10381 36661 : arg0 = save_expr (arg0);
10382 36661 : tree type = (TYPE_UNSIGNED (arg0_type)
10383 36661 : ? long_long_unsigned_type_node
10384 36661 : : long_long_integer_type_node);
10385 73322 : tree hi = fold_build2 (RSHIFT_EXPR, arg0_type, arg0,
10386 : build_int_cst (integer_type_node,
10387 : MAX_FIXED_MODE_SIZE / 2));
10388 36661 : hi = fold_convert (type, hi);
10389 36661 : tree lo = fold_convert (type, arg0);
10390 36661 : switch (fcode)
10391 : {
10392 36578 : case BUILT_IN_CLZG:
10393 36578 : call = fold_builtin_bit_query (loc, fcode, lo, NULL_TREE);
10394 73156 : call = fold_build2 (PLUS_EXPR, integer_type_node, call,
10395 : build_int_cst (integer_type_node,
10396 : MAX_FIXED_MODE_SIZE / 2));
10397 36578 : if (arg2)
10398 36558 : call = fold_build3 (COND_EXPR, integer_type_node,
10399 : fold_build2 (NE_EXPR, boolean_type_node,
10400 : lo, build_zero_cst (type)),
10401 : call, arg2);
10402 36578 : call = fold_build3 (COND_EXPR, integer_type_node,
10403 : fold_build2 (NE_EXPR, boolean_type_node,
10404 : hi, build_zero_cst (type)),
10405 : fold_builtin_bit_query (loc, fcode, hi,
10406 : NULL_TREE),
10407 : call);
10408 36578 : break;
10409 27 : case BUILT_IN_CTZG:
10410 27 : call = fold_builtin_bit_query (loc, fcode, hi, NULL_TREE);
10411 54 : call = fold_build2 (PLUS_EXPR, integer_type_node, call,
10412 : build_int_cst (integer_type_node,
10413 : MAX_FIXED_MODE_SIZE / 2));
10414 27 : if (arg2)
10415 18 : call = fold_build3 (COND_EXPR, integer_type_node,
10416 : fold_build2 (NE_EXPR, boolean_type_node,
10417 : hi, build_zero_cst (type)),
10418 : call, arg2);
10419 27 : call = fold_build3 (COND_EXPR, integer_type_node,
10420 : fold_build2 (NE_EXPR, boolean_type_node,
10421 : lo, build_zero_cst (type)),
10422 : fold_builtin_bit_query (loc, fcode, lo,
10423 : NULL_TREE),
10424 : call);
10425 27 : break;
10426 9 : case BUILT_IN_CLRSBG:
10427 9 : tem = fold_builtin_bit_query (loc, fcode, lo, NULL_TREE);
10428 18 : tem = fold_build2 (PLUS_EXPR, integer_type_node, tem,
10429 : build_int_cst (integer_type_node,
10430 : MAX_FIXED_MODE_SIZE / 2));
10431 18 : tem = fold_build3 (COND_EXPR, integer_type_node,
10432 : fold_build2 (LT_EXPR, boolean_type_node,
10433 : fold_build2 (BIT_XOR_EXPR, type,
10434 : lo, hi),
10435 : build_zero_cst (type)),
10436 : build_int_cst (integer_type_node,
10437 : MAX_FIXED_MODE_SIZE / 2 - 1),
10438 : tem);
10439 9 : call = fold_builtin_bit_query (loc, fcode, hi, NULL_TREE);
10440 9 : call = save_expr (call);
10441 18 : call = fold_build3 (COND_EXPR, integer_type_node,
10442 : fold_build2 (NE_EXPR, boolean_type_node,
10443 : call,
10444 : build_int_cst (integer_type_node,
10445 : MAX_FIXED_MODE_SIZE
10446 : / 2 - 1)),
10447 : call, tem);
10448 9 : break;
10449 9 : case BUILT_IN_FFSG:
10450 9 : call = fold_builtin_bit_query (loc, fcode, hi, NULL_TREE);
10451 18 : call = fold_build2 (PLUS_EXPR, integer_type_node, call,
10452 : build_int_cst (integer_type_node,
10453 : MAX_FIXED_MODE_SIZE / 2));
10454 9 : call = fold_build3 (COND_EXPR, integer_type_node,
10455 : fold_build2 (NE_EXPR, boolean_type_node,
10456 : hi, build_zero_cst (type)),
10457 : call, integer_zero_node);
10458 9 : call = fold_build3 (COND_EXPR, integer_type_node,
10459 : fold_build2 (NE_EXPR, boolean_type_node,
10460 : lo, build_zero_cst (type)),
10461 : fold_builtin_bit_query (loc, fcode, lo,
10462 : NULL_TREE),
10463 : call);
10464 9 : break;
10465 9 : case BUILT_IN_PARITYG:
10466 9 : call = fold_builtin_bit_query (loc, fcode,
10467 : fold_build2 (BIT_XOR_EXPR, type,
10468 : lo, hi), NULL_TREE);
10469 9 : break;
10470 29 : case BUILT_IN_POPCOUNTG:
10471 29 : call = fold_build2 (PLUS_EXPR, integer_type_node,
10472 : fold_builtin_bit_query (loc, fcode, hi,
10473 : NULL_TREE),
10474 : fold_builtin_bit_query (loc, fcode, lo,
10475 : NULL_TREE));
10476 29 : break;
10477 0 : default:
10478 0 : gcc_unreachable ();
10479 : }
10480 : }
10481 : else
10482 : {
10483 : /* Only keep second argument to IFN_CLZ/IFN_CTZ if it is the
10484 : value defined at zero during GIMPLE, or for large/huge _BitInt
10485 : (which are then lowered during bitint lowering). */
10486 208178 : if (arg2 && !BITINT_TYPE_P (TREE_TYPE (arg0)))
10487 : {
10488 124746 : int val;
10489 124746 : if (fcode == BUILT_IN_CLZG)
10490 : {
10491 62881 : if (CLZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (arg0_type),
10492 : val) != 2
10493 62881 : || wi::to_widest (arg2) != val)
10494 62851 : arg2 = NULL_TREE;
10495 : }
10496 61865 : else if (CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_TYPE_MODE (arg0_type),
10497 : val) != 2
10498 61865 : || wi::to_widest (arg2) != val)
10499 61856 : arg2 = NULL_TREE;
10500 124746 : if (!direct_internal_fn_supported_p (ifn, arg0_type,
10501 : OPTIMIZE_FOR_BOTH))
10502 : arg2 = NULL_TREE;
10503 124647 : if (arg2 == NULL_TREE)
10504 124707 : arg0 = save_expr (arg0);
10505 : }
10506 208178 : if (fcodei == END_BUILTINS || arg2)
10507 231 : call = build_call_expr_internal_loc (loc, ifn, integer_type_node,
10508 : arg2 ? 2 : 1, arg0, arg2);
10509 : else
10510 208033 : call = build_call_expr_loc (loc, builtin_decl_explicit (fcodei), 1,
10511 : arg0);
10512 : }
10513 244839 : if (addend)
10514 2856 : call = fold_build2 (PLUS_EXPR, integer_type_node, call,
10515 : build_int_cst (integer_type_node, addend));
10516 244839 : if (arg1 && arg2 == NULL_TREE)
10517 127512 : call = fold_build3 (COND_EXPR, integer_type_node,
10518 : fold_build2 (NE_EXPR, boolean_type_node,
10519 : arg0, build_zero_cst (arg0_type)),
10520 : call, arg1);
10521 :
10522 : return call;
10523 : }
10524 :
10525 : /* Fold or build a __builtin_bswapg (ARG) (if IFN is IFN_BSWAP) or
10526 : __builtin_bitreverseg (ARG (otherwise) call. The FE should have
10527 : verified earlier that the argument type is unsigned INTEGER_TYPE
10528 : or BITINT_TYPE, for __builtin_bswapg with precision divisible by 8. */
10529 :
10530 : tree
10531 148 : fold_build_builtin_bswapg_bitreverseg (location_t loc, enum internal_fn ifn,
10532 : tree arg)
10533 : {
10534 148 : tree type = TYPE_MAIN_VARIANT (TREE_TYPE (arg));
10535 148 : if (ifn == IFN_BSWAP && TYPE_PRECISION (type) == 8)
10536 11 : return fold_convert_loc (loc, type, arg);
10537 137 : struct { tree type; built_in_function bswap, bitreverse; } fns[]
10538 137 : = { { unsigned_char_type_node, END_BUILTINS, BUILT_IN_BITREVERSE8 },
10539 137 : { uint16_type_node, BUILT_IN_BSWAP16, BUILT_IN_BITREVERSE16 },
10540 137 : { uint32_type_node, BUILT_IN_BSWAP32, BUILT_IN_BITREVERSE32 },
10541 137 : { uint64_type_node, BUILT_IN_BSWAP64, BUILT_IN_BITREVERSE64 },
10542 137 : { uint128_type_node, BUILT_IN_BSWAP128, BUILT_IN_BITREVERSE128 } };
10543 137 : if (TREE_CODE (arg) == INTEGER_CST)
10544 : {
10545 76 : wide_int res;
10546 76 : if (ifn == IFN_BSWAP)
10547 37 : res = wi::bswap (wi::to_wide (arg));
10548 : else
10549 45 : res = wi::bitreverse (wi::to_wide (arg));
10550 76 : return wide_int_to_tree (type, res);
10551 76 : }
10552 232 : for (unsigned i = 0; i < ARRAY_SIZE (fns); ++i)
10553 219 : if (fns[i].type
10554 219 : && TYPE_PRECISION (fns[i].type) >= TYPE_PRECISION (type))
10555 : {
10556 48 : arg = fold_convert_loc (loc, fns[i].type, arg);
10557 48 : tree fndecl
10558 48 : = builtin_decl_explicit (ifn == IFN_BSWAP
10559 : ? fns[i].bswap : fns[i].bitreverse);
10560 48 : tree ret = build_call_expr_loc (loc, fndecl, 1, arg);
10561 48 : if (TYPE_PRECISION (type) != TYPE_PRECISION (fns[i].type))
10562 4 : ret = fold_build2_loc (loc, RSHIFT_EXPR, fns[i].type, ret,
10563 : build_int_cst (unsigned_type_node,
10564 4 : TYPE_PRECISION (fns[i].type)
10565 4 : - TYPE_PRECISION (type)));
10566 48 : return fold_convert_loc (loc, type, ret);
10567 : }
10568 13 : gcc_assert (TREE_CODE (type) == BITINT_TYPE);
10569 13 : return build_call_expr_internal_loc (loc, ifn, type, 1, arg);
10570 : }
10571 :
10572 : /* Fold __builtin_{add,sub}c{,l,ll} into pair of internal functions
10573 : that return both result of arithmetics and overflowed boolean
10574 : flag in a complex integer result. */
10575 :
10576 : static tree
10577 54 : fold_builtin_addc_subc (location_t loc, enum built_in_function fcode,
10578 : tree *args)
10579 : {
10580 54 : enum internal_fn ifn;
10581 :
10582 54 : switch (fcode)
10583 : {
10584 : case BUILT_IN_ADDC:
10585 : case BUILT_IN_ADDCL:
10586 : case BUILT_IN_ADDCLL:
10587 : ifn = IFN_ADD_OVERFLOW;
10588 : break;
10589 28 : case BUILT_IN_SUBC:
10590 28 : case BUILT_IN_SUBCL:
10591 28 : case BUILT_IN_SUBCLL:
10592 28 : ifn = IFN_SUB_OVERFLOW;
10593 28 : break;
10594 0 : default:
10595 0 : gcc_unreachable ();
10596 : }
10597 :
10598 54 : tree type = TREE_TYPE (args[0]);
10599 54 : tree ctype = build_complex_type (type);
10600 54 : tree call = build_call_expr_internal_loc (loc, ifn, ctype, 2,
10601 : args[0], args[1]);
10602 : /* Force SAVE_EXPR even for calls which satisfy tree_invariant_p_1,
10603 : as while the call itself is const, the REALPART_EXPR store is
10604 : certainly not. And in any case, we want just one call,
10605 : not multiple and trying to CSE them later. */
10606 54 : TREE_SIDE_EFFECTS (call) = 1;
10607 54 : tree tgt = save_expr (call);
10608 54 : tree intres = build1_loc (loc, REALPART_EXPR, type, tgt);
10609 54 : tree ovfres = build1_loc (loc, IMAGPART_EXPR, type, tgt);
10610 54 : call = build_call_expr_internal_loc (loc, ifn, ctype, 2,
10611 : intres, args[2]);
10612 54 : TREE_SIDE_EFFECTS (call) = 1;
10613 54 : tgt = save_expr (call);
10614 54 : intres = build1_loc (loc, REALPART_EXPR, type, tgt);
10615 54 : tree ovfres2 = build1_loc (loc, IMAGPART_EXPR, type, tgt);
10616 54 : ovfres = build2_loc (loc, BIT_IOR_EXPR, type, ovfres, ovfres2);
10617 54 : tree mem_arg3 = build_fold_indirect_ref_loc (loc, args[3]);
10618 54 : tree store
10619 54 : = fold_build2_loc (loc, MODIFY_EXPR, void_type_node, mem_arg3, ovfres);
10620 54 : return build2_loc (loc, COMPOUND_EXPR, type, store, intres);
10621 : }
10622 :
10623 : /* Fold a call to __builtin_FILE to a constant string. */
10624 :
10625 : static inline tree
10626 5775 : fold_builtin_FILE (location_t loc)
10627 : {
10628 5775 : if (const char *fname = LOCATION_FILE (loc))
10629 : {
10630 : /* The documentation says this builtin is equivalent to the preprocessor
10631 : __FILE__ macro so it appears appropriate to use the same file prefix
10632 : mappings. */
10633 5775 : fname = remap_macro_filename (fname);
10634 5775 : return build_string_literal (fname);
10635 : }
10636 :
10637 0 : return build_string_literal ("");
10638 : }
10639 :
10640 : /* Fold a call to __builtin_FUNCTION to a constant string. */
10641 :
10642 : static inline tree
10643 68 : fold_builtin_FUNCTION ()
10644 : {
10645 68 : const char *name = "";
10646 :
10647 68 : if (current_function_decl)
10648 43 : name = lang_hooks.decl_printable_name (current_function_decl, 0);
10649 :
10650 68 : return build_string_literal (name);
10651 : }
10652 :
10653 : /* Fold a call to __builtin_LINE to an integer constant. */
10654 :
10655 : static inline tree
10656 11535 : fold_builtin_LINE (location_t loc, tree type)
10657 : {
10658 11535 : return build_int_cst (type, LOCATION_LINE (loc));
10659 : }
10660 :
10661 : /* Fold a call to built-in function FNDECL with 0 arguments.
10662 : This function returns NULL_TREE if no simplification was possible. */
10663 :
10664 : static tree
10665 23342922 : fold_builtin_0 (location_t loc, tree fndecl)
10666 : {
10667 23342922 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
10668 23342922 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10669 23342922 : switch (fcode)
10670 : {
10671 5775 : case BUILT_IN_FILE:
10672 5775 : return fold_builtin_FILE (loc);
10673 :
10674 68 : case BUILT_IN_FUNCTION:
10675 68 : return fold_builtin_FUNCTION ();
10676 :
10677 11535 : case BUILT_IN_LINE:
10678 11535 : return fold_builtin_LINE (loc, type);
10679 :
10680 32650 : CASE_FLT_FN (BUILT_IN_INF):
10681 32650 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_INF):
10682 32650 : case BUILT_IN_INFD32:
10683 32650 : case BUILT_IN_INFD64:
10684 32650 : case BUILT_IN_INFD128:
10685 32650 : case BUILT_IN_INFD64X:
10686 32650 : return fold_builtin_inf (loc, type, true);
10687 :
10688 215717 : CASE_FLT_FN (BUILT_IN_HUGE_VAL):
10689 215717 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_HUGE_VAL):
10690 215717 : return fold_builtin_inf (loc, type, false);
10691 :
10692 0 : case BUILT_IN_CLASSIFY_TYPE:
10693 0 : return fold_builtin_classify_type (NULL_TREE);
10694 :
10695 19379208 : case BUILT_IN_UNREACHABLE:
10696 : /* Rewrite any explicit calls to __builtin_unreachable. */
10697 19379208 : if (sanitize_flags_p (SANITIZE_UNREACHABLE))
10698 116 : return build_builtin_unreachable (loc);
10699 : break;
10700 :
10701 : default:
10702 : break;
10703 : }
10704 : return NULL_TREE;
10705 : }
10706 :
10707 : /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
10708 : This function returns NULL_TREE if no simplification was possible. */
10709 :
10710 : static tree
10711 16009262 : fold_builtin_1 (location_t loc, tree expr, tree fndecl, tree arg0)
10712 : {
10713 16009262 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
10714 16009262 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10715 :
10716 16009262 : if (error_operand_p (arg0))
10717 : return NULL_TREE;
10718 :
10719 16009262 : if (tree ret = fold_const_call (as_combined_fn (fcode), type, arg0))
10720 : return ret;
10721 :
10722 15421678 : switch (fcode)
10723 : {
10724 2683340 : case BUILT_IN_CONSTANT_P:
10725 2683340 : {
10726 2683340 : tree val = fold_builtin_constant_p (arg0);
10727 :
10728 : /* Gimplification will pull the CALL_EXPR for the builtin out of
10729 : an if condition. When not optimizing, we'll not CSE it back.
10730 : To avoid link error types of regressions, return false now. */
10731 2683340 : if (!val && !optimize)
10732 1568 : val = integer_zero_node;
10733 :
10734 : return val;
10735 : }
10736 :
10737 2156 : case BUILT_IN_CLASSIFY_TYPE:
10738 2156 : return fold_builtin_classify_type (arg0);
10739 :
10740 429433 : case BUILT_IN_STRLEN:
10741 429433 : return fold_builtin_strlen (loc, expr, type, arg0);
10742 :
10743 353211 : CASE_FLT_FN (BUILT_IN_FABS):
10744 353211 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FABS):
10745 353211 : case BUILT_IN_FABSD32:
10746 353211 : case BUILT_IN_FABSD64:
10747 353211 : case BUILT_IN_FABSD128:
10748 353211 : case BUILT_IN_FABSD64X:
10749 353211 : return fold_builtin_fabs (loc, arg0, type);
10750 :
10751 96170 : case BUILT_IN_ABS:
10752 96170 : case BUILT_IN_LABS:
10753 96170 : case BUILT_IN_LLABS:
10754 96170 : case BUILT_IN_IMAXABS:
10755 96170 : case BUILT_IN_UABS:
10756 96170 : case BUILT_IN_ULABS:
10757 96170 : case BUILT_IN_ULLABS:
10758 96170 : case BUILT_IN_UMAXABS:
10759 96170 : return fold_builtin_abs (loc, arg0, type);
10760 :
10761 25461 : CASE_FLT_FN (BUILT_IN_CONJ):
10762 25461 : if (validate_arg (arg0, COMPLEX_TYPE)
10763 25461 : && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10764 25461 : return fold_build1_loc (loc, CONJ_EXPR, type, arg0);
10765 : break;
10766 :
10767 764 : CASE_FLT_FN (BUILT_IN_CREAL):
10768 764 : if (validate_arg (arg0, COMPLEX_TYPE)
10769 764 : && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10770 764 : return non_lvalue_loc (loc, fold_build1_loc (loc, REALPART_EXPR, type, arg0));
10771 : break;
10772 :
10773 1884 : CASE_FLT_FN (BUILT_IN_CIMAG):
10774 1884 : if (validate_arg (arg0, COMPLEX_TYPE)
10775 1884 : && TREE_CODE (TREE_TYPE (TREE_TYPE (arg0))) == REAL_TYPE)
10776 1884 : return non_lvalue_loc (loc, fold_build1_loc (loc, IMAGPART_EXPR, type, arg0));
10777 : break;
10778 :
10779 95106 : CASE_FLT_FN (BUILT_IN_CARG):
10780 95106 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_CARG):
10781 95106 : return fold_builtin_carg (loc, arg0, type);
10782 :
10783 211 : case BUILT_IN_ISASCII:
10784 211 : return fold_builtin_isascii (loc, arg0);
10785 :
10786 168 : case BUILT_IN_TOASCII:
10787 168 : return fold_builtin_toascii (loc, arg0);
10788 :
10789 325 : case BUILT_IN_ISDIGIT:
10790 325 : return fold_builtin_isdigit (loc, arg0);
10791 :
10792 336723 : CASE_FLT_FN (BUILT_IN_FINITE):
10793 336723 : case BUILT_IN_FINITED32:
10794 336723 : case BUILT_IN_FINITED64:
10795 336723 : case BUILT_IN_FINITED128:
10796 336723 : case BUILT_IN_ISFINITE:
10797 336723 : {
10798 336723 : tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISFINITE);
10799 336723 : if (ret)
10800 : return ret;
10801 336499 : return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10802 : }
10803 :
10804 226070 : CASE_FLT_FN (BUILT_IN_ISINF):
10805 226070 : case BUILT_IN_ISINFD32:
10806 226070 : case BUILT_IN_ISINFD64:
10807 226070 : case BUILT_IN_ISINFD128:
10808 226070 : {
10809 226070 : tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF);
10810 226070 : if (ret)
10811 : return ret;
10812 225949 : return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10813 : }
10814 :
10815 222599 : case BUILT_IN_ISNORMAL:
10816 222599 : return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10817 :
10818 708 : case BUILT_IN_ISINF_SIGN:
10819 708 : return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISINF_SIGN);
10820 :
10821 225720 : CASE_FLT_FN (BUILT_IN_ISNAN):
10822 225720 : case BUILT_IN_ISNAND32:
10823 225720 : case BUILT_IN_ISNAND64:
10824 225720 : case BUILT_IN_ISNAND128:
10825 225720 : {
10826 225720 : tree ret = fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISNAN);
10827 225720 : if (ret)
10828 : return ret;
10829 225596 : return fold_builtin_interclass_mathfn (loc, fndecl, arg0);
10830 : }
10831 :
10832 27815 : case BUILT_IN_ISSIGNALING:
10833 27815 : return fold_builtin_classify (loc, fndecl, arg0, BUILT_IN_ISSIGNALING);
10834 :
10835 611653 : case BUILT_IN_FREE:
10836 611653 : if (integer_zerop (arg0))
10837 1064 : return build_empty_stmt (loc);
10838 : break;
10839 :
10840 7379 : case BUILT_IN_CLZG:
10841 7379 : case BUILT_IN_CTZG:
10842 7379 : case BUILT_IN_CLRSBG:
10843 7379 : case BUILT_IN_FFSG:
10844 7379 : case BUILT_IN_PARITYG:
10845 7379 : case BUILT_IN_POPCOUNTG:
10846 7379 : return fold_builtin_bit_query (loc, fcode, arg0, NULL_TREE);
10847 :
10848 : default:
10849 : break;
10850 : }
10851 :
10852 : return NULL_TREE;
10853 :
10854 : }
10855 :
10856 : /* Folds a call EXPR (which may be null) to built-in function FNDECL
10857 : with 2 arguments, ARG0 and ARG1. This function returns NULL_TREE
10858 : if no simplification was possible. */
10859 :
10860 : static tree
10861 16942640 : fold_builtin_2 (location_t loc, tree expr, tree fndecl, tree arg0, tree arg1)
10862 : {
10863 16942640 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
10864 16942640 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10865 :
10866 16942640 : if (error_operand_p (arg0)
10867 16942640 : || error_operand_p (arg1))
10868 : return NULL_TREE;
10869 :
10870 16942636 : if (tree ret = fold_const_call (as_combined_fn (fcode), type, arg0, arg1))
10871 : return ret;
10872 :
10873 16732787 : switch (fcode)
10874 : {
10875 6504 : CASE_FLT_FN_REENT (BUILT_IN_GAMMA): /* GAMMA_R */
10876 6504 : CASE_FLT_FN_REENT (BUILT_IN_LGAMMA): /* LGAMMA_R */
10877 6504 : if (validate_arg (arg0, REAL_TYPE)
10878 6504 : && validate_arg (arg1, POINTER_TYPE))
10879 6504 : return do_mpfr_lgamma_r (arg0, arg1, type);
10880 : break;
10881 :
10882 84583 : CASE_FLT_FN (BUILT_IN_FREXP):
10883 84583 : return fold_builtin_frexp (loc, arg0, arg1, type);
10884 :
10885 65280 : CASE_FLT_FN (BUILT_IN_MODF):
10886 65280 : return fold_builtin_modf (loc, arg0, arg1, type);
10887 :
10888 2560 : case BUILT_IN_STRSPN:
10889 2560 : return fold_builtin_strspn (loc, expr, arg0, arg1, type);
10890 :
10891 2465 : case BUILT_IN_STRCSPN:
10892 2465 : return fold_builtin_strcspn (loc, expr, arg0, arg1, type);
10893 :
10894 76927 : case BUILT_IN_STRPBRK:
10895 76927 : return fold_builtin_strpbrk (loc, expr, arg0, arg1, type);
10896 :
10897 6030237 : case BUILT_IN_EXPECT:
10898 6030237 : return fold_builtin_expect (loc, arg0, arg1, NULL_TREE, NULL_TREE);
10899 :
10900 448703 : case BUILT_IN_ISGREATER:
10901 448703 : return fold_builtin_unordered_cmp (loc, fndecl,
10902 448703 : arg0, arg1, UNLE_EXPR, LE_EXPR);
10903 445288 : case BUILT_IN_ISGREATEREQUAL:
10904 445288 : return fold_builtin_unordered_cmp (loc, fndecl,
10905 445288 : arg0, arg1, UNLT_EXPR, LT_EXPR);
10906 224258 : case BUILT_IN_ISLESS:
10907 224258 : return fold_builtin_unordered_cmp (loc, fndecl,
10908 224258 : arg0, arg1, UNGE_EXPR, GE_EXPR);
10909 781816 : case BUILT_IN_ISLESSEQUAL:
10910 781816 : return fold_builtin_unordered_cmp (loc, fndecl,
10911 781816 : arg0, arg1, UNGT_EXPR, GT_EXPR);
10912 222392 : case BUILT_IN_ISLESSGREATER:
10913 222392 : return fold_builtin_unordered_cmp (loc, fndecl,
10914 222392 : arg0, arg1, UNEQ_EXPR, EQ_EXPR);
10915 223586 : case BUILT_IN_ISUNORDERED:
10916 223586 : return fold_builtin_unordered_cmp (loc, fndecl,
10917 : arg0, arg1, UNORDERED_EXPR,
10918 223586 : NOP_EXPR);
10919 :
10920 709 : case BUILT_IN_ISEQSIG:
10921 709 : return fold_builtin_iseqsig (loc, arg0, arg1);
10922 :
10923 : /* We do the folding for va_start in the expander. */
10924 : case BUILT_IN_VA_START:
10925 : break;
10926 :
10927 200221 : case BUILT_IN_OBJECT_SIZE:
10928 200221 : case BUILT_IN_DYNAMIC_OBJECT_SIZE:
10929 200221 : return fold_builtin_object_size (arg0, arg1, fcode);
10930 :
10931 101115 : case BUILT_IN_ATOMIC_ALWAYS_LOCK_FREE:
10932 101115 : return fold_builtin_atomic_always_lock_free (arg0, arg1);
10933 :
10934 37060 : case BUILT_IN_ATOMIC_IS_LOCK_FREE:
10935 37060 : return fold_builtin_atomic_is_lock_free (arg0, arg1);
10936 :
10937 164317 : case BUILT_IN_CLZG:
10938 164317 : case BUILT_IN_CTZG:
10939 164317 : return fold_builtin_bit_query (loc, fcode, arg0, arg1);
10940 :
10941 : default:
10942 : break;
10943 : }
10944 : return NULL_TREE;
10945 : }
10946 :
10947 : /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
10948 : and ARG2.
10949 : This function returns NULL_TREE if no simplification was possible. */
10950 :
10951 : static tree
10952 6836313 : fold_builtin_3 (location_t loc, tree fndecl,
10953 : tree arg0, tree arg1, tree arg2)
10954 : {
10955 6836313 : tree type = TREE_TYPE (TREE_TYPE (fndecl));
10956 6836313 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
10957 :
10958 6836313 : if (error_operand_p (arg0)
10959 6836313 : || error_operand_p (arg1)
10960 13672626 : || error_operand_p (arg2))
10961 : return NULL_TREE;
10962 :
10963 6836311 : if (tree ret = fold_const_call (as_combined_fn (fcode), type,
10964 : arg0, arg1, arg2))
10965 : return ret;
10966 :
10967 6819316 : switch (fcode)
10968 : {
10969 :
10970 145 : CASE_FLT_FN (BUILT_IN_SINCOS):
10971 145 : return fold_builtin_sincos (loc, arg0, arg1, arg2);
10972 :
10973 70383 : CASE_FLT_FN (BUILT_IN_REMQUO):
10974 70383 : if (validate_arg (arg0, REAL_TYPE)
10975 70383 : && validate_arg (arg1, REAL_TYPE)
10976 140766 : && validate_arg (arg2, POINTER_TYPE))
10977 70383 : return do_mpfr_remquo (arg0, arg1, arg2);
10978 : break;
10979 :
10980 2494543 : case BUILT_IN_MEMCMP:
10981 2494543 : return fold_builtin_memcmp (loc, arg0, arg1, arg2);
10982 :
10983 510018 : case BUILT_IN_EXPECT:
10984 510018 : return fold_builtin_expect (loc, arg0, arg1, arg2, NULL_TREE);
10985 :
10986 337 : case BUILT_IN_EXPECT_WITH_PROBABILITY:
10987 337 : return fold_builtin_expect (loc, arg0, arg1, NULL_TREE, arg2);
10988 :
10989 459437 : case BUILT_IN_ADD_OVERFLOW:
10990 459437 : case BUILT_IN_SUB_OVERFLOW:
10991 459437 : case BUILT_IN_MUL_OVERFLOW:
10992 459437 : case BUILT_IN_ADD_OVERFLOW_P:
10993 459437 : case BUILT_IN_SUB_OVERFLOW_P:
10994 459437 : case BUILT_IN_MUL_OVERFLOW_P:
10995 459437 : case BUILT_IN_SADD_OVERFLOW:
10996 459437 : case BUILT_IN_SADDL_OVERFLOW:
10997 459437 : case BUILT_IN_SADDLL_OVERFLOW:
10998 459437 : case BUILT_IN_SSUB_OVERFLOW:
10999 459437 : case BUILT_IN_SSUBL_OVERFLOW:
11000 459437 : case BUILT_IN_SSUBLL_OVERFLOW:
11001 459437 : case BUILT_IN_SMUL_OVERFLOW:
11002 459437 : case BUILT_IN_SMULL_OVERFLOW:
11003 459437 : case BUILT_IN_SMULLL_OVERFLOW:
11004 459437 : case BUILT_IN_UADD_OVERFLOW:
11005 459437 : case BUILT_IN_UADDL_OVERFLOW:
11006 459437 : case BUILT_IN_UADDLL_OVERFLOW:
11007 459437 : case BUILT_IN_USUB_OVERFLOW:
11008 459437 : case BUILT_IN_USUBL_OVERFLOW:
11009 459437 : case BUILT_IN_USUBLL_OVERFLOW:
11010 459437 : case BUILT_IN_UMUL_OVERFLOW:
11011 459437 : case BUILT_IN_UMULL_OVERFLOW:
11012 459437 : case BUILT_IN_UMULLL_OVERFLOW:
11013 459437 : return fold_builtin_arith_overflow (loc, fcode, arg0, arg1, arg2);
11014 :
11015 : default:
11016 : break;
11017 : }
11018 : return NULL_TREE;
11019 : }
11020 :
11021 : /* Folds a call EXPR (which may be null) to built-in function FNDECL.
11022 : ARGS is an array of NARGS arguments. IGNORE is true if the result
11023 : of the function call is ignored. This function returns NULL_TREE
11024 : if no simplification was possible. */
11025 :
11026 : static tree
11027 65628703 : fold_builtin_n (location_t loc, tree expr, tree fndecl, tree *args,
11028 : int nargs, bool)
11029 : {
11030 65628703 : tree ret = NULL_TREE;
11031 :
11032 65628703 : switch (nargs)
11033 : {
11034 23342922 : case 0:
11035 23342922 : ret = fold_builtin_0 (loc, fndecl);
11036 23342922 : break;
11037 16009262 : case 1:
11038 16009262 : ret = fold_builtin_1 (loc, expr, fndecl, args[0]);
11039 16009262 : break;
11040 16942640 : case 2:
11041 16942640 : ret = fold_builtin_2 (loc, expr, fndecl, args[0], args[1]);
11042 16942640 : break;
11043 6836313 : case 3:
11044 6836313 : ret = fold_builtin_3 (loc, fndecl, args[0], args[1], args[2]);
11045 6836313 : break;
11046 2497566 : default:
11047 2497566 : ret = fold_builtin_varargs (loc, fndecl, args, nargs);
11048 2497566 : break;
11049 : }
11050 65628703 : if (ret)
11051 : {
11052 7813694 : ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
11053 7813694 : SET_EXPR_LOCATION (ret, loc);
11054 7813694 : return ret;
11055 : }
11056 : return NULL_TREE;
11057 : }
11058 :
11059 : /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
11060 : list ARGS along with N new arguments in NEWARGS. SKIP is the number
11061 : of arguments in ARGS to be omitted. OLDNARGS is the number of
11062 : elements in ARGS. */
11063 :
11064 : static tree
11065 4 : rewrite_call_expr_valist (location_t loc, int oldnargs, tree *args,
11066 : int skip, tree fndecl, int n, va_list newargs)
11067 : {
11068 4 : int nargs = oldnargs - skip + n;
11069 4 : tree *buffer;
11070 :
11071 4 : if (n > 0)
11072 : {
11073 0 : int i, j;
11074 :
11075 0 : buffer = XALLOCAVEC (tree, nargs);
11076 0 : for (i = 0; i < n; i++)
11077 0 : buffer[i] = va_arg (newargs, tree);
11078 0 : for (j = skip; j < oldnargs; j++, i++)
11079 0 : buffer[i] = args[j];
11080 : }
11081 : else
11082 4 : buffer = args + skip;
11083 :
11084 4 : return build_call_expr_loc_array (loc, fndecl, nargs, buffer);
11085 : }
11086 :
11087 : /* Return true if FNDECL shouldn't be folded right now.
11088 : If a built-in function has an inline attribute always_inline
11089 : wrapper, defer folding it after always_inline functions have
11090 : been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
11091 : might not be performed. */
11092 :
11093 : bool
11094 143125643 : avoid_folding_inline_builtin (tree fndecl)
11095 : {
11096 143125643 : return (DECL_DECLARED_INLINE_P (fndecl)
11097 12245 : && DECL_DISREGARD_INLINE_LIMITS (fndecl)
11098 12203 : && cfun
11099 12203 : && !cfun->always_inline_functions_inlined
11100 143137846 : && lookup_attribute ("always_inline", DECL_ATTRIBUTES (fndecl)));
11101 : }
11102 :
11103 : /* A wrapper function for builtin folding that prevents warnings for
11104 : "statement without effect" and the like, caused by removing the
11105 : call node earlier than the warning is generated. */
11106 :
11107 : tree
11108 192433108 : fold_call_expr (location_t loc, tree exp, bool ignore)
11109 : {
11110 192433108 : tree ret = NULL_TREE;
11111 192433108 : tree fndecl = get_callee_fndecl (exp);
11112 190779091 : if (fndecl && fndecl_built_in_p (fndecl)
11113 : /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
11114 : yet. Defer folding until we see all the arguments
11115 : (after inlining). */
11116 249631059 : && !CALL_EXPR_VA_ARG_PACK (exp))
11117 : {
11118 57197921 : int nargs = call_expr_nargs (exp);
11119 :
11120 : /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
11121 : instead last argument is __builtin_va_arg_pack (). Defer folding
11122 : even in that case, until arguments are finalized. */
11123 57197921 : if (nargs && TREE_CODE (CALL_EXPR_ARG (exp, nargs - 1)) == CALL_EXPR)
11124 : {
11125 215980 : tree fndecl2 = get_callee_fndecl (CALL_EXPR_ARG (exp, nargs - 1));
11126 215980 : if (fndecl2 && fndecl_built_in_p (fndecl2, BUILT_IN_VA_ARG_PACK))
11127 : return NULL_TREE;
11128 : }
11129 :
11130 57197854 : if (avoid_folding_inline_builtin (fndecl))
11131 : return NULL_TREE;
11132 :
11133 57194319 : if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
11134 69521102 : return targetm.fold_builtin (fndecl, call_expr_nargs (exp),
11135 69521102 : CALL_EXPR_ARGP (exp), ignore);
11136 : else
11137 : {
11138 22433768 : tree *args = CALL_EXPR_ARGP (exp);
11139 22433768 : ret = fold_builtin_n (loc, exp, fndecl, args, nargs, ignore);
11140 22433768 : if (ret)
11141 : return ret;
11142 : }
11143 : }
11144 : return NULL_TREE;
11145 : }
11146 :
11147 : /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
11148 : N arguments are passed in the array ARGARRAY. Return a folded
11149 : expression or NULL_TREE if no simplification was possible. */
11150 :
11151 : tree
11152 71135352 : fold_builtin_call_array (location_t loc, tree,
11153 : tree fn,
11154 : int n,
11155 : tree *argarray)
11156 : {
11157 71135352 : if (TREE_CODE (fn) != ADDR_EXPR)
11158 : return NULL_TREE;
11159 :
11160 71135352 : tree fndecl = TREE_OPERAND (fn, 0);
11161 71135352 : if (TREE_CODE (fndecl) == FUNCTION_DECL
11162 71135352 : && fndecl_built_in_p (fndecl))
11163 : {
11164 : /* If last argument is __builtin_va_arg_pack (), arguments to this
11165 : function are not finalized yet. Defer folding until they are. */
11166 70533560 : if (n && TREE_CODE (argarray[n - 1]) == CALL_EXPR)
11167 : {
11168 103424 : tree fndecl2 = get_callee_fndecl (argarray[n - 1]);
11169 103424 : if (fndecl2 && fndecl_built_in_p (fndecl2, BUILT_IN_VA_ARG_PACK))
11170 : return NULL_TREE;
11171 : }
11172 70533532 : if (avoid_folding_inline_builtin (fndecl))
11173 : return NULL_TREE;
11174 70533532 : if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
11175 33393867 : return targetm.fold_builtin (fndecl, n, argarray, false);
11176 : else
11177 37139665 : return fold_builtin_n (loc, NULL_TREE, fndecl, argarray, n, false);
11178 : }
11179 :
11180 : return NULL_TREE;
11181 : }
11182 :
11183 : /* Construct a new CALL_EXPR using the tail of the argument list of EXP
11184 : along with N new arguments specified as the "..." parameters. SKIP
11185 : is the number of arguments in EXP to be omitted. This function is used
11186 : to do varargs-to-varargs transformations. */
11187 :
11188 : static tree
11189 4 : rewrite_call_expr (location_t loc, tree exp, int skip, tree fndecl, int n, ...)
11190 : {
11191 4 : va_list ap;
11192 4 : tree t;
11193 :
11194 4 : va_start (ap, n);
11195 8 : t = rewrite_call_expr_valist (loc, call_expr_nargs (exp),
11196 4 : CALL_EXPR_ARGP (exp), skip, fndecl, n, ap);
11197 4 : va_end (ap);
11198 :
11199 4 : return t;
11200 : }
11201 :
11202 : /* Validate a single argument ARG against a tree code CODE representing
11203 : a type. Return true when argument is valid. */
11204 :
11205 : static bool
11206 13191359 : validate_arg (const_tree arg, enum tree_code code)
11207 : {
11208 13191359 : if (!arg)
11209 : return false;
11210 13191336 : else if (code == POINTER_TYPE)
11211 6810992 : return POINTER_TYPE_P (TREE_TYPE (arg));
11212 6380344 : else if (code == INTEGER_TYPE)
11213 3654296 : return INTEGRAL_TYPE_P (TREE_TYPE (arg));
11214 2726048 : return code == TREE_CODE (TREE_TYPE (arg));
11215 : }
11216 :
11217 : /* This function validates the types of a function call argument list
11218 : against a specified list of tree_codes. If the last specifier is a 0,
11219 : that represents an ellipses, otherwise the last specifier must be a
11220 : VOID_TYPE.
11221 :
11222 : This is the GIMPLE version of validate_arglist. Eventually we want to
11223 : completely convert builtins.cc to work from GIMPLEs and the tree based
11224 : validate_arglist will then be removed. */
11225 :
11226 : bool
11227 136 : validate_gimple_arglist (const gcall *call, ...)
11228 : {
11229 136 : enum tree_code code;
11230 136 : bool res = 0;
11231 136 : va_list ap;
11232 136 : const_tree arg;
11233 136 : size_t i;
11234 :
11235 136 : va_start (ap, call);
11236 136 : i = 0;
11237 :
11238 544 : do
11239 : {
11240 544 : code = (enum tree_code) va_arg (ap, int);
11241 544 : switch (code)
11242 : {
11243 0 : case 0:
11244 : /* This signifies an ellipses, any further arguments are all ok. */
11245 0 : res = true;
11246 0 : goto end;
11247 136 : case VOID_TYPE:
11248 : /* This signifies an endlink, if no arguments remain, return
11249 : true, otherwise return false. */
11250 136 : res = (i == gimple_call_num_args (call));
11251 136 : goto end;
11252 408 : default:
11253 : /* If no parameters remain or the parameter's code does not
11254 : match the specified code, return false. Otherwise continue
11255 : checking any remaining arguments. */
11256 408 : arg = gimple_call_arg (call, i++);
11257 408 : if (!validate_arg (arg, code))
11258 0 : goto end;
11259 : break;
11260 : }
11261 : }
11262 : while (1);
11263 :
11264 : /* We need gotos here since we can only have one VA_CLOSE in a
11265 : function. */
11266 136 : end: ;
11267 136 : va_end (ap);
11268 :
11269 136 : return res;
11270 : }
11271 :
11272 : /* Default target-specific builtin expander that does nothing. */
11273 :
11274 : rtx
11275 0 : default_expand_builtin (tree exp ATTRIBUTE_UNUSED,
11276 : rtx target ATTRIBUTE_UNUSED,
11277 : rtx subtarget ATTRIBUTE_UNUSED,
11278 : machine_mode mode ATTRIBUTE_UNUSED,
11279 : int ignore ATTRIBUTE_UNUSED)
11280 : {
11281 0 : return NULL_RTX;
11282 : }
11283 :
11284 : /* Returns true is EXP represents data that would potentially reside
11285 : in a readonly section. */
11286 :
11287 : bool
11288 200974 : readonly_data_expr (tree exp)
11289 : {
11290 200974 : STRIP_NOPS (exp);
11291 :
11292 200974 : if (TREE_CODE (exp) != ADDR_EXPR)
11293 : return false;
11294 :
11295 25465 : exp = get_base_address (TREE_OPERAND (exp, 0));
11296 25465 : if (!exp)
11297 : return false;
11298 :
11299 : /* Make sure we call decl_readonly_section only for trees it
11300 : can handle (since it returns true for everything it doesn't
11301 : understand). */
11302 25465 : if (TREE_CODE (exp) == STRING_CST
11303 5725 : || TREE_CODE (exp) == CONSTRUCTOR
11304 5725 : || (VAR_P (exp) && TREE_STATIC (exp)))
11305 22355 : return decl_readonly_section (exp, 0);
11306 : else
11307 : return false;
11308 : }
11309 :
11310 : /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
11311 : to the call, and TYPE is its return type.
11312 :
11313 : Return NULL_TREE if no simplification was possible, otherwise return the
11314 : simplified form of the call as a tree.
11315 :
11316 : The simplified form may be a constant or other expression which
11317 : computes the same value, but in a more efficient manner (including
11318 : calls to other builtin functions).
11319 :
11320 : The call may contain arguments which need to be evaluated, but
11321 : which are not useful to determine the result of the call. In
11322 : this case we return a chain of COMPOUND_EXPRs. The LHS of each
11323 : COMPOUND_EXPR will be an argument which must be evaluated.
11324 : COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11325 : COMPOUND_EXPR in the chain will contain the tree for the simplified
11326 : form of the builtin function call. */
11327 :
11328 : static tree
11329 76927 : fold_builtin_strpbrk (location_t loc, tree, tree s1, tree s2, tree type)
11330 : {
11331 76927 : if (!validate_arg (s1, POINTER_TYPE)
11332 76927 : || !validate_arg (s2, POINTER_TYPE))
11333 : return NULL_TREE;
11334 :
11335 76927 : tree fn;
11336 76927 : const char *p1, *p2;
11337 :
11338 76927 : p2 = c_getstr (s2);
11339 76927 : if (p2 == NULL)
11340 : return NULL_TREE;
11341 :
11342 92 : p1 = c_getstr (s1);
11343 92 : if (p1 != NULL)
11344 : {
11345 22 : const char *r = strpbrk (p1, p2);
11346 22 : tree tem;
11347 :
11348 22 : if (r == NULL)
11349 0 : return build_int_cst (TREE_TYPE (s1), 0);
11350 :
11351 : /* Return an offset into the constant string argument. */
11352 22 : tem = fold_build_pointer_plus_hwi_loc (loc, s1, r - p1);
11353 22 : return fold_convert_loc (loc, type, tem);
11354 : }
11355 :
11356 70 : if (p2[0] == '\0')
11357 : /* strpbrk(x, "") == NULL.
11358 : Evaluate and ignore s1 in case it had side-effects. */
11359 26 : return omit_one_operand_loc (loc, type, integer_zero_node, s1);
11360 :
11361 44 : if (p2[1] != '\0')
11362 : return NULL_TREE; /* Really call strpbrk. */
11363 :
11364 76879 : fn = builtin_decl_implicit (BUILT_IN_STRCHR);
11365 41 : if (!fn)
11366 : return NULL_TREE;
11367 :
11368 : /* New argument list transforming strpbrk(s1, s2) to
11369 : strchr(s1, s2[0]). */
11370 41 : return build_call_expr_loc (loc, fn, 2, s1,
11371 41 : build_int_cst (integer_type_node, p2[0]));
11372 : }
11373 :
11374 : /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
11375 : to the call.
11376 :
11377 : Return NULL_TREE if no simplification was possible, otherwise return the
11378 : simplified form of the call as a tree.
11379 :
11380 : The simplified form may be a constant or other expression which
11381 : computes the same value, but in a more efficient manner (including
11382 : calls to other builtin functions).
11383 :
11384 : The call may contain arguments which need to be evaluated, but
11385 : which are not useful to determine the result of the call. In
11386 : this case we return a chain of COMPOUND_EXPRs. The LHS of each
11387 : COMPOUND_EXPR will be an argument which must be evaluated.
11388 : COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11389 : COMPOUND_EXPR in the chain will contain the tree for the simplified
11390 : form of the builtin function call. */
11391 :
11392 : static tree
11393 2560 : fold_builtin_strspn (location_t loc, tree expr, tree s1, tree s2, tree type)
11394 : {
11395 2560 : if (!validate_arg (s1, POINTER_TYPE)
11396 2560 : || !validate_arg (s2, POINTER_TYPE))
11397 : return NULL_TREE;
11398 :
11399 2560 : if (!check_nul_terminated_array (expr, s1)
11400 2560 : || !check_nul_terminated_array (expr, s2))
11401 58 : return NULL_TREE;
11402 :
11403 2502 : const char *p1 = c_getstr (s1), *p2 = c_getstr (s2);
11404 :
11405 : /* If either argument is "", return NULL_TREE. */
11406 2502 : if ((p1 && *p1 == '\0') || (p2 && *p2 == '\0'))
11407 : /* Evaluate and ignore both arguments in case either one has
11408 : side-effects. */
11409 147 : return omit_two_operands_loc (loc, type, size_zero_node, s1, s2);
11410 : return NULL_TREE;
11411 : }
11412 :
11413 : /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
11414 : to the call.
11415 :
11416 : Return NULL_TREE if no simplification was possible, otherwise return the
11417 : simplified form of the call as a tree.
11418 :
11419 : The simplified form may be a constant or other expression which
11420 : computes the same value, but in a more efficient manner (including
11421 : calls to other builtin functions).
11422 :
11423 : The call may contain arguments which need to be evaluated, but
11424 : which are not useful to determine the result of the call. In
11425 : this case we return a chain of COMPOUND_EXPRs. The LHS of each
11426 : COMPOUND_EXPR will be an argument which must be evaluated.
11427 : COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11428 : COMPOUND_EXPR in the chain will contain the tree for the simplified
11429 : form of the builtin function call. */
11430 :
11431 : static tree
11432 2465 : fold_builtin_strcspn (location_t loc, tree expr, tree s1, tree s2, tree type)
11433 : {
11434 2465 : if (!validate_arg (s1, POINTER_TYPE)
11435 2465 : || !validate_arg (s2, POINTER_TYPE))
11436 : return NULL_TREE;
11437 :
11438 2465 : if (!check_nul_terminated_array (expr, s1)
11439 2465 : || !check_nul_terminated_array (expr, s2))
11440 58 : return NULL_TREE;
11441 :
11442 : /* If the first argument is "", return NULL_TREE. */
11443 2407 : const char *p1 = c_getstr (s1);
11444 2407 : if (p1 && *p1 == '\0')
11445 : {
11446 : /* Evaluate and ignore argument s2 in case it has
11447 : side-effects. */
11448 65 : return omit_one_operand_loc (loc, type, size_zero_node, s2);
11449 : }
11450 :
11451 : /* If the second argument is "", return __builtin_strlen(s1). */
11452 2342 : const char *p2 = c_getstr (s2);
11453 2342 : if (p2 && *p2 == '\0')
11454 : {
11455 2400 : tree fn = builtin_decl_implicit (BUILT_IN_STRLEN);
11456 :
11457 : /* If the replacement _DECL isn't initialized, don't do the
11458 : transformation. */
11459 81 : if (!fn)
11460 : return NULL_TREE;
11461 :
11462 81 : return fold_convert_loc (loc, type,
11463 81 : build_call_expr_loc (loc, fn, 1, s1));
11464 : }
11465 : return NULL_TREE;
11466 : }
11467 :
11468 : /* Fold the next_arg or va_start call EXP. Returns true if there was an error
11469 : produced. False otherwise. This is done so that we don't output the error
11470 : or warning twice or three times. */
11471 :
11472 : bool
11473 42113 : fold_builtin_next_arg (tree exp, bool va_start_p)
11474 : {
11475 42113 : tree fntype = TREE_TYPE (current_function_decl);
11476 42113 : int nargs = call_expr_nargs (exp);
11477 42113 : tree arg;
11478 : /* There is good chance the current input_location points inside the
11479 : definition of the va_start macro (perhaps on the token for
11480 : builtin) in a system header, so warnings will not be emitted.
11481 : Use the location in real source code. */
11482 42113 : location_t current_location =
11483 42113 : linemap_unwind_to_first_non_reserved_loc (line_table, input_location,
11484 : NULL);
11485 :
11486 42113 : if (!stdarg_p (fntype))
11487 : {
11488 8 : error ("%<va_start%> used in function with fixed arguments");
11489 8 : return true;
11490 : }
11491 :
11492 42105 : if (va_start_p)
11493 : {
11494 41947 : if (va_start_p && (nargs != 2))
11495 : {
11496 0 : error ("wrong number of arguments to function %<va_start%>");
11497 0 : return true;
11498 : }
11499 41947 : arg = CALL_EXPR_ARG (exp, 1);
11500 : }
11501 : /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
11502 : when we checked the arguments and if needed issued a warning. */
11503 : else
11504 : {
11505 158 : if (nargs == 0)
11506 : {
11507 : /* Evidently an out of date version of <stdarg.h>; can't validate
11508 : va_start's second argument, but can still work as intended. */
11509 0 : warning_at (current_location,
11510 0 : OPT_Wvarargs,
11511 : "%<__builtin_next_arg%> called without an argument");
11512 0 : return true;
11513 : }
11514 158 : else if (nargs > 1)
11515 : {
11516 0 : error ("wrong number of arguments to function %<__builtin_next_arg%>");
11517 0 : return true;
11518 : }
11519 158 : arg = CALL_EXPR_ARG (exp, 0);
11520 : }
11521 :
11522 42105 : if (TREE_CODE (arg) == SSA_NAME
11523 42105 : && SSA_NAME_VAR (arg))
11524 : arg = SSA_NAME_VAR (arg);
11525 :
11526 : /* We destructively modify the call to be __builtin_va_start (ap, 0)
11527 : or __builtin_next_arg (0) the first time we see it, after checking
11528 : the arguments and if needed issuing a warning. */
11529 42105 : if (!integer_zerop (arg))
11530 : {
11531 7025 : tree last_parm = tree_last (DECL_ARGUMENTS (current_function_decl));
11532 :
11533 : /* Strip off all nops for the sake of the comparison. This
11534 : is not quite the same as STRIP_NOPS. It does more.
11535 : We must also strip off INDIRECT_EXPR for C++ reference
11536 : parameters. */
11537 14052 : while (CONVERT_EXPR_P (arg)
11538 14063 : || INDIRECT_REF_P (arg))
11539 11 : arg = TREE_OPERAND (arg, 0);
11540 7025 : if (arg != last_parm)
11541 : {
11542 : /* FIXME: Sometimes with the tree optimizers we can get the
11543 : not the last argument even though the user used the last
11544 : argument. We just warn and set the arg to be the last
11545 : argument so that we will get wrong-code because of
11546 : it. */
11547 12 : warning_at (current_location,
11548 12 : OPT_Wvarargs,
11549 : "second parameter of %<va_start%> not last named argument");
11550 : }
11551 :
11552 : /* Undefined by C99 7.15.1.4p4 (va_start):
11553 : "If the parameter parmN is declared with the register storage
11554 : class, with a function or array type, or with a type that is
11555 : not compatible with the type that results after application of
11556 : the default argument promotions, the behavior is undefined."
11557 : */
11558 7013 : else if (DECL_REGISTER (arg))
11559 : {
11560 12 : warning_at (current_location,
11561 12 : OPT_Wvarargs,
11562 : "undefined behavior when second parameter of "
11563 : "%<va_start%> is declared with %<register%> storage");
11564 : }
11565 :
11566 : /* We want to verify the second parameter just once before the tree
11567 : optimizers are run and then avoid keeping it in the tree,
11568 : as otherwise we could warn even for correct code like:
11569 : void foo (int i, ...)
11570 : { va_list ap; i++; va_start (ap, i); va_end (ap); } */
11571 7025 : if (va_start_p)
11572 7023 : CALL_EXPR_ARG (exp, 1) = integer_zero_node;
11573 : else
11574 2 : CALL_EXPR_ARG (exp, 0) = integer_zero_node;
11575 : }
11576 : return false;
11577 : }
11578 :
11579 :
11580 : /* Expand a call EXP to __builtin_object_size. */
11581 :
11582 : static rtx
11583 618 : expand_builtin_object_size (tree exp)
11584 : {
11585 618 : tree ost;
11586 618 : int object_size_type;
11587 618 : tree fndecl = get_callee_fndecl (exp);
11588 :
11589 618 : if (!validate_arglist (exp, POINTER_TYPE, INTEGER_TYPE, VOID_TYPE))
11590 : {
11591 0 : error ("first argument of %qD must be a pointer, second integer constant",
11592 : fndecl);
11593 0 : expand_builtin_trap ();
11594 0 : return const0_rtx;
11595 : }
11596 :
11597 618 : ost = CALL_EXPR_ARG (exp, 1);
11598 618 : STRIP_NOPS (ost);
11599 :
11600 618 : if (TREE_CODE (ost) != INTEGER_CST
11601 618 : || tree_int_cst_sgn (ost) < 0
11602 1236 : || compare_tree_int (ost, 3) > 0)
11603 : {
11604 0 : error ("last argument of %qD is not integer constant between 0 and 3",
11605 : fndecl);
11606 0 : expand_builtin_trap ();
11607 0 : return const0_rtx;
11608 : }
11609 :
11610 618 : object_size_type = tree_to_shwi (ost);
11611 :
11612 618 : return object_size_type < 2 ? constm1_rtx : const0_rtx;
11613 : }
11614 :
11615 : /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
11616 : FCODE is the BUILT_IN_* to use.
11617 : Return NULL_RTX if we failed; the caller should emit a normal call,
11618 : otherwise try to get the result in TARGET, if convenient (and in
11619 : mode MODE if that's convenient). */
11620 :
11621 : static rtx
11622 837 : expand_builtin_memory_chk (tree exp, rtx target, machine_mode mode,
11623 : enum built_in_function fcode)
11624 : {
11625 1410 : if (!validate_arglist (exp,
11626 : POINTER_TYPE,
11627 : fcode == BUILT_IN_MEMSET_CHK
11628 : ? INTEGER_TYPE : POINTER_TYPE,
11629 : INTEGER_TYPE, INTEGER_TYPE, VOID_TYPE))
11630 : return NULL_RTX;
11631 :
11632 837 : tree dest = CALL_EXPR_ARG (exp, 0);
11633 837 : tree src = CALL_EXPR_ARG (exp, 1);
11634 837 : tree len = CALL_EXPR_ARG (exp, 2);
11635 837 : tree size = CALL_EXPR_ARG (exp, 3);
11636 :
11637 : /* FIXME: Set access mode to write only for memset et al. */
11638 837 : bool sizes_ok = check_access (exp, len, /*maxread=*/NULL_TREE,
11639 : /*srcstr=*/NULL_TREE, size, access_read_write);
11640 :
11641 837 : if (!tree_fits_uhwi_p (size))
11642 : return NULL_RTX;
11643 :
11644 627 : if (tree_fits_uhwi_p (len) || integer_all_onesp (size))
11645 : {
11646 : /* Avoid transforming the checking call to an ordinary one when
11647 : an overflow has been detected or when the call couldn't be
11648 : validated because the size is not constant. */
11649 186 : if (!sizes_ok && !integer_all_onesp (size) && tree_int_cst_lt (size, len))
11650 : return NULL_RTX;
11651 :
11652 0 : tree fn = NULL_TREE;
11653 : /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
11654 : mem{cpy,pcpy,move,set} is available. */
11655 0 : switch (fcode)
11656 : {
11657 0 : case BUILT_IN_MEMCPY_CHK:
11658 0 : fn = builtin_decl_explicit (BUILT_IN_MEMCPY);
11659 0 : break;
11660 0 : case BUILT_IN_MEMPCPY_CHK:
11661 0 : fn = builtin_decl_explicit (BUILT_IN_MEMPCPY);
11662 0 : break;
11663 0 : case BUILT_IN_MEMMOVE_CHK:
11664 0 : fn = builtin_decl_explicit (BUILT_IN_MEMMOVE);
11665 0 : break;
11666 0 : case BUILT_IN_MEMSET_CHK:
11667 0 : fn = builtin_decl_explicit (BUILT_IN_MEMSET);
11668 0 : break;
11669 : default:
11670 : break;
11671 : }
11672 :
11673 0 : if (! fn)
11674 : return NULL_RTX;
11675 :
11676 0 : fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 3, dest, src, len);
11677 0 : gcc_assert (TREE_CODE (fn) == CALL_EXPR);
11678 0 : CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
11679 0 : return expand_expr (fn, target, mode, EXPAND_NORMAL);
11680 : }
11681 441 : else if (fcode == BUILT_IN_MEMSET_CHK)
11682 : return NULL_RTX;
11683 : else
11684 : {
11685 293 : unsigned int dest_align = get_pointer_alignment (dest);
11686 :
11687 : /* If DEST is not a pointer type, call the normal function. */
11688 293 : if (dest_align == 0)
11689 : return NULL_RTX;
11690 :
11691 : /* If SRC and DEST are the same (and not volatile), do nothing. */
11692 293 : if (operand_equal_p (src, dest, 0))
11693 : {
11694 0 : tree expr;
11695 :
11696 0 : if (fcode != BUILT_IN_MEMPCPY_CHK)
11697 : {
11698 : /* Evaluate and ignore LEN in case it has side-effects. */
11699 0 : expand_expr (len, const0_rtx, VOIDmode, EXPAND_NORMAL);
11700 0 : return expand_expr (dest, target, mode, EXPAND_NORMAL);
11701 : }
11702 :
11703 0 : expr = fold_build_pointer_plus (dest, len);
11704 0 : return expand_expr (expr, target, mode, EXPAND_NORMAL);
11705 : }
11706 :
11707 : /* __memmove_chk special case. */
11708 293 : if (fcode == BUILT_IN_MEMMOVE_CHK)
11709 : {
11710 79 : unsigned int src_align = get_pointer_alignment (src);
11711 :
11712 79 : if (src_align == 0)
11713 : return NULL_RTX;
11714 :
11715 : /* If src is categorized for a readonly section we can use
11716 : normal __memcpy_chk. */
11717 79 : if (readonly_data_expr (src))
11718 : {
11719 15 : tree fn = builtin_decl_explicit (BUILT_IN_MEMCPY_CHK);
11720 15 : if (!fn)
11721 : return NULL_RTX;
11722 15 : fn = build_call_nofold_loc (EXPR_LOCATION (exp), fn, 4,
11723 : dest, src, len, size);
11724 15 : gcc_assert (TREE_CODE (fn) == CALL_EXPR);
11725 15 : CALL_EXPR_TAILCALL (fn) = CALL_EXPR_TAILCALL (exp);
11726 15 : return expand_expr (fn, target, mode, EXPAND_NORMAL);
11727 : }
11728 : }
11729 278 : return NULL_RTX;
11730 : }
11731 : }
11732 :
11733 : /* Emit warning if a buffer overflow is detected at compile time. */
11734 :
11735 : static void
11736 1086 : maybe_emit_chk_warning (tree exp, enum built_in_function fcode)
11737 : {
11738 : /* The source string. */
11739 1086 : tree srcstr = NULL_TREE;
11740 : /* The size of the destination object returned by __builtin_object_size. */
11741 1086 : tree objsize = NULL_TREE;
11742 : /* The string that is being concatenated with (as in __strcat_chk)
11743 : or null if it isn't. */
11744 1086 : tree catstr = NULL_TREE;
11745 : /* The maximum length of the source sequence in a bounded operation
11746 : (such as __strncat_chk) or null if the operation isn't bounded
11747 : (such as __strcat_chk). */
11748 1086 : tree maxread = NULL_TREE;
11749 : /* The exact size of the access (such as in __strncpy_chk). */
11750 1086 : tree size = NULL_TREE;
11751 : /* The access by the function that's checked. Except for snprintf
11752 : both writing and reading is checked. */
11753 1086 : access_mode mode = access_read_write;
11754 :
11755 1086 : switch (fcode)
11756 : {
11757 275 : case BUILT_IN_STRCPY_CHK:
11758 275 : case BUILT_IN_STPCPY_CHK:
11759 275 : srcstr = CALL_EXPR_ARG (exp, 1);
11760 275 : objsize = CALL_EXPR_ARG (exp, 2);
11761 275 : break;
11762 :
11763 151 : case BUILT_IN_STRCAT_CHK:
11764 : /* For __strcat_chk the warning will be emitted only if overflowing
11765 : by at least strlen (dest) + 1 bytes. */
11766 151 : catstr = CALL_EXPR_ARG (exp, 0);
11767 151 : srcstr = CALL_EXPR_ARG (exp, 1);
11768 151 : objsize = CALL_EXPR_ARG (exp, 2);
11769 151 : break;
11770 :
11771 108 : case BUILT_IN_STRNCAT_CHK:
11772 108 : catstr = CALL_EXPR_ARG (exp, 0);
11773 108 : srcstr = CALL_EXPR_ARG (exp, 1);
11774 108 : maxread = CALL_EXPR_ARG (exp, 2);
11775 108 : objsize = CALL_EXPR_ARG (exp, 3);
11776 108 : break;
11777 :
11778 243 : case BUILT_IN_STRNCPY_CHK:
11779 243 : case BUILT_IN_STPNCPY_CHK:
11780 243 : srcstr = CALL_EXPR_ARG (exp, 1);
11781 243 : size = CALL_EXPR_ARG (exp, 2);
11782 243 : objsize = CALL_EXPR_ARG (exp, 3);
11783 243 : break;
11784 :
11785 309 : case BUILT_IN_SNPRINTF_CHK:
11786 309 : case BUILT_IN_VSNPRINTF_CHK:
11787 309 : maxread = CALL_EXPR_ARG (exp, 1);
11788 309 : objsize = CALL_EXPR_ARG (exp, 3);
11789 : /* The only checked access the write to the destination. */
11790 309 : mode = access_write_only;
11791 309 : break;
11792 0 : default:
11793 0 : gcc_unreachable ();
11794 : }
11795 :
11796 1086 : if (catstr && maxread)
11797 : {
11798 : /* Check __strncat_chk. There is no way to determine the length
11799 : of the string to which the source string is being appended so
11800 : just warn when the length of the source string is not known. */
11801 108 : check_strncat_sizes (exp, objsize);
11802 108 : return;
11803 : }
11804 :
11805 978 : check_access (exp, size, maxread, srcstr, objsize, mode);
11806 : }
11807 :
11808 : /* Emit warning if a buffer overflow is detected at compile time
11809 : in __sprintf_chk/__vsprintf_chk calls. */
11810 :
11811 : static void
11812 1327 : maybe_emit_sprintf_chk_warning (tree exp, enum built_in_function fcode)
11813 : {
11814 1327 : tree size, len, fmt;
11815 1327 : const char *fmt_str;
11816 1327 : int nargs = call_expr_nargs (exp);
11817 :
11818 : /* Verify the required arguments in the original call. */
11819 :
11820 1327 : if (nargs < 4)
11821 : return;
11822 1327 : size = CALL_EXPR_ARG (exp, 2);
11823 1327 : fmt = CALL_EXPR_ARG (exp, 3);
11824 :
11825 1327 : if (! tree_fits_uhwi_p (size) || integer_all_onesp (size))
11826 21 : return;
11827 :
11828 : /* Check whether the format is a literal string constant. */
11829 1306 : fmt_str = c_getstr (fmt);
11830 1306 : if (fmt_str == NULL)
11831 : return;
11832 :
11833 1270 : if (!init_target_chars ())
11834 : return;
11835 :
11836 : /* If the format doesn't contain % args or %%, we know its size. */
11837 1270 : if (strchr (fmt_str, target_percent) == 0)
11838 22 : len = build_int_cstu (size_type_node, strlen (fmt_str));
11839 : /* If the format is "%s" and first ... argument is a string literal,
11840 : we know it too. */
11841 1248 : else if (fcode == BUILT_IN_SPRINTF_CHK
11842 1094 : && strcmp (fmt_str, target_percent_s) == 0)
11843 : {
11844 49 : tree arg;
11845 :
11846 49 : if (nargs < 5)
11847 : return;
11848 49 : arg = CALL_EXPR_ARG (exp, 4);
11849 49 : if (! POINTER_TYPE_P (TREE_TYPE (arg)))
11850 : return;
11851 :
11852 45 : len = c_strlen (arg, 1);
11853 45 : if (!len || ! tree_fits_uhwi_p (len))
11854 : return;
11855 : }
11856 : else
11857 : return;
11858 :
11859 : /* Add one for the terminating nul. */
11860 34 : len = fold_build2 (PLUS_EXPR, TREE_TYPE (len), len, size_one_node);
11861 :
11862 34 : check_access (exp, /*size=*/NULL_TREE, /*maxread=*/NULL_TREE, len, size,
11863 : access_write_only);
11864 : }
11865 :
11866 : /* Fold a call to __builtin_object_size with arguments PTR and OST,
11867 : if possible. */
11868 :
11869 : static tree
11870 200221 : fold_builtin_object_size (tree ptr, tree ost, enum built_in_function fcode)
11871 : {
11872 200221 : tree bytes;
11873 200221 : int object_size_type;
11874 :
11875 200221 : if (!validate_arg (ptr, POINTER_TYPE)
11876 200221 : || !validate_arg (ost, INTEGER_TYPE))
11877 : return NULL_TREE;
11878 :
11879 200221 : STRIP_NOPS (ost);
11880 :
11881 200221 : if (TREE_CODE (ost) != INTEGER_CST
11882 200221 : || tree_int_cst_sgn (ost) < 0
11883 400442 : || compare_tree_int (ost, 3) > 0)
11884 0 : return NULL_TREE;
11885 :
11886 200221 : object_size_type = tree_to_shwi (ost);
11887 :
11888 : /* __builtin_object_size doesn't evaluate side-effects in its arguments;
11889 : if there are any side-effects, it returns (size_t) -1 for types 0 and 1
11890 : and (size_t) 0 for types 2 and 3. */
11891 200221 : if (TREE_SIDE_EFFECTS (ptr))
11892 603 : return build_int_cst_type (size_type_node, object_size_type < 2 ? -1 : 0);
11893 :
11894 199618 : if (fcode == BUILT_IN_DYNAMIC_OBJECT_SIZE)
11895 67036 : object_size_type |= OST_DYNAMIC;
11896 :
11897 199618 : if (TREE_CODE (ptr) == ADDR_EXPR)
11898 : {
11899 12143 : compute_builtin_object_size (ptr, object_size_type, &bytes);
11900 12143 : if ((object_size_type & OST_DYNAMIC)
11901 10885 : || int_fits_type_p (bytes, size_type_node))
11902 12143 : return fold_convert (size_type_node, bytes);
11903 : }
11904 187475 : else if (TREE_CODE (ptr) == SSA_NAME)
11905 : {
11906 : /* If object size is not known yet, delay folding until
11907 : later. Maybe subsequent passes will help determining
11908 : it. */
11909 102020 : if (compute_builtin_object_size (ptr, object_size_type, &bytes)
11910 102020 : && ((object_size_type & OST_DYNAMIC)
11911 2538 : || int_fits_type_p (bytes, size_type_node)))
11912 4808 : return fold_convert (size_type_node, bytes);
11913 : }
11914 :
11915 : return NULL_TREE;
11916 : }
11917 :
11918 : /* Builtins with folding operations that operate on "..." arguments
11919 : need special handling; we need to store the arguments in a convenient
11920 : data structure before attempting any folding. Fortunately there are
11921 : only a few builtins that fall into this category. FNDECL is the
11922 : function, EXP is the CALL_EXPR for the call. */
11923 :
11924 : static tree
11925 2497566 : fold_builtin_varargs (location_t loc, tree fndecl, tree *args, int nargs)
11926 : {
11927 2497566 : enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
11928 2497566 : tree ret = NULL_TREE;
11929 :
11930 2497566 : switch (fcode)
11931 : {
11932 97101 : case BUILT_IN_FPCLASSIFY:
11933 97101 : ret = fold_builtin_fpclassify (loc, args, nargs);
11934 97101 : break;
11935 :
11936 54 : case BUILT_IN_ADDC:
11937 54 : case BUILT_IN_ADDCL:
11938 54 : case BUILT_IN_ADDCLL:
11939 54 : case BUILT_IN_SUBC:
11940 54 : case BUILT_IN_SUBCL:
11941 54 : case BUILT_IN_SUBCLL:
11942 54 : return fold_builtin_addc_subc (loc, fcode, args);
11943 :
11944 : default:
11945 : break;
11946 : }
11947 97101 : if (ret)
11948 : {
11949 97101 : ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
11950 97101 : SET_EXPR_LOCATION (ret, loc);
11951 97101 : suppress_warning (ret);
11952 97101 : return ret;
11953 : }
11954 : return NULL_TREE;
11955 : }
11956 :
11957 : /* Initialize format string characters in the target charset. */
11958 :
11959 : bool
11960 288396 : init_target_chars (void)
11961 : {
11962 288396 : static bool init;
11963 288396 : if (!init)
11964 : {
11965 113748 : target_newline = lang_hooks.to_target_charset ('\n');
11966 113748 : target_percent = lang_hooks.to_target_charset ('%');
11967 113748 : target_c = lang_hooks.to_target_charset ('c');
11968 113748 : target_s = lang_hooks.to_target_charset ('s');
11969 113748 : if (target_newline == 0 || target_percent == 0 || target_c == 0
11970 113748 : || target_s == 0)
11971 : return false;
11972 :
11973 113748 : target_percent_c[0] = target_percent;
11974 113748 : target_percent_c[1] = target_c;
11975 113748 : target_percent_c[2] = '\0';
11976 :
11977 113748 : target_percent_s[0] = target_percent;
11978 113748 : target_percent_s[1] = target_s;
11979 113748 : target_percent_s[2] = '\0';
11980 :
11981 113748 : target_percent_s_newline[0] = target_percent;
11982 113748 : target_percent_s_newline[1] = target_s;
11983 113748 : target_percent_s_newline[2] = target_newline;
11984 113748 : target_percent_s_newline[3] = '\0';
11985 :
11986 113748 : init = true;
11987 : }
11988 : return true;
11989 : }
11990 :
11991 : /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
11992 : and no overflow/underflow occurred. INEXACT is true if M was not
11993 : exactly calculated. TYPE is the tree type for the result. This
11994 : function assumes that you cleared the MPFR flags and then
11995 : calculated M to see if anything subsequently set a flag prior to
11996 : entering this function. Return NULL_TREE if any checks fail. */
11997 :
11998 : static tree
11999 2979 : do_mpfr_ckconv (mpfr_srcptr m, tree type, int inexact)
12000 : {
12001 : /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
12002 : overflow/underflow occurred. If -frounding-math, proceed iff the
12003 : result of calling FUNC was exact. */
12004 4832 : if (mpfr_number_p (m) && !mpfr_overflow_p () && !mpfr_underflow_p ()
12005 4832 : && (!flag_rounding_math || !inexact))
12006 : {
12007 1853 : REAL_VALUE_TYPE rr;
12008 :
12009 1853 : real_from_mpfr (&rr, m, type, MPFR_RNDN);
12010 : /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
12011 : check for overflow/underflow. If the REAL_VALUE_TYPE is zero
12012 : but the mpfr_t is not, then we underflowed in the
12013 : conversion. */
12014 1853 : if (real_isfinite (&rr)
12015 1853 : && (rr.cl == rvc_zero) == (mpfr_zero_p (m) != 0))
12016 : {
12017 1853 : REAL_VALUE_TYPE rmode;
12018 :
12019 1853 : real_convert (&rmode, TYPE_MODE (type), &rr);
12020 : /* Proceed iff the specified mode can hold the value. */
12021 1853 : if (real_identical (&rmode, &rr))
12022 1853 : return build_real (type, rmode);
12023 : }
12024 : }
12025 : return NULL_TREE;
12026 : }
12027 :
12028 : /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
12029 : number and no overflow/underflow occurred. INEXACT is true if M
12030 : was not exactly calculated. TYPE is the tree type for the result.
12031 : This function assumes that you cleared the MPFR flags and then
12032 : calculated M to see if anything subsequently set a flag prior to
12033 : entering this function. Return NULL_TREE if any checks fail, if
12034 : FORCE_CONVERT is true, then bypass the checks. */
12035 :
12036 : static tree
12037 4129 : do_mpc_ckconv (mpc_srcptr m, tree type, int inexact, int force_convert)
12038 : {
12039 : /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
12040 : overflow/underflow occurred. If -frounding-math, proceed iff the
12041 : result of calling FUNC was exact. */
12042 4129 : if (force_convert
12043 4129 : || (mpfr_number_p (mpc_realref (m)) && mpfr_number_p (mpc_imagref (m))
12044 3810 : && !mpfr_overflow_p () && !mpfr_underflow_p ()
12045 3810 : && (!flag_rounding_math || !inexact)))
12046 : {
12047 3950 : REAL_VALUE_TYPE re, im;
12048 :
12049 3950 : real_from_mpfr (&re, mpc_realref (m), TREE_TYPE (type), MPFR_RNDN);
12050 3950 : real_from_mpfr (&im, mpc_imagref (m), TREE_TYPE (type), MPFR_RNDN);
12051 : /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
12052 : check for overflow/underflow. If the REAL_VALUE_TYPE is zero
12053 : but the mpfr_t is not, then we underflowed in the
12054 : conversion. */
12055 3950 : if (force_convert
12056 3950 : || (real_isfinite (&re) && real_isfinite (&im)
12057 3810 : && (re.cl == rvc_zero) == (mpfr_zero_p (mpc_realref (m)) != 0)
12058 3810 : && (im.cl == rvc_zero) == (mpfr_zero_p (mpc_imagref (m)) != 0)))
12059 : {
12060 3950 : REAL_VALUE_TYPE re_mode, im_mode;
12061 :
12062 3950 : real_convert (&re_mode, TYPE_MODE (TREE_TYPE (type)), &re);
12063 3950 : real_convert (&im_mode, TYPE_MODE (TREE_TYPE (type)), &im);
12064 : /* Proceed iff the specified mode can hold the value. */
12065 3950 : if (force_convert
12066 3950 : || (real_identical (&re_mode, &re)
12067 3810 : && real_identical (&im_mode, &im)))
12068 3950 : return build_complex (type, build_real (TREE_TYPE (type), re_mode),
12069 7900 : build_real (TREE_TYPE (type), im_mode));
12070 : }
12071 : }
12072 : return NULL_TREE;
12073 : }
12074 :
12075 : /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
12076 : the pointer *(ARG_QUO) and return the result. The type is taken
12077 : from the type of ARG0 and is used for setting the precision of the
12078 : calculation and results. */
12079 :
12080 : static tree
12081 70383 : do_mpfr_remquo (tree arg0, tree arg1, tree arg_quo)
12082 : {
12083 70383 : tree const type = TREE_TYPE (arg0);
12084 70383 : tree result = NULL_TREE;
12085 :
12086 70383 : STRIP_NOPS (arg0);
12087 70383 : STRIP_NOPS (arg1);
12088 :
12089 : /* To proceed, MPFR must exactly represent the target floating point
12090 : format, which only happens when the target base equals two. */
12091 70383 : if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
12092 70383 : && TREE_CODE (arg0) == REAL_CST && !TREE_OVERFLOW (arg0)
12093 72688 : && TREE_CODE (arg1) == REAL_CST && !TREE_OVERFLOW (arg1))
12094 : {
12095 2305 : const REAL_VALUE_TYPE *const ra0 = TREE_REAL_CST_PTR (arg0);
12096 2305 : const REAL_VALUE_TYPE *const ra1 = TREE_REAL_CST_PTR (arg1);
12097 :
12098 2305 : if (real_isfinite (ra0) && real_isfinite (ra1))
12099 : {
12100 2305 : const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
12101 2305 : const int prec = fmt->p;
12102 2305 : const mpfr_rnd_t rnd = fmt->round_towards_zero? MPFR_RNDZ : MPFR_RNDN;
12103 2305 : tree result_rem;
12104 2305 : long integer_quo;
12105 2305 : mpfr_t m0, m1;
12106 :
12107 2305 : mpfr_inits2 (prec, m0, m1, NULL);
12108 2305 : mpfr_from_real (m0, ra0, MPFR_RNDN);
12109 2305 : mpfr_from_real (m1, ra1, MPFR_RNDN);
12110 2305 : mpfr_clear_flags ();
12111 2305 : mpfr_remquo (m0, &integer_quo, m0, m1, rnd);
12112 : /* Remquo is independent of the rounding mode, so pass
12113 : inexact=0 to do_mpfr_ckconv(). */
12114 2305 : result_rem = do_mpfr_ckconv (m0, type, /*inexact=*/ 0);
12115 2305 : mpfr_clears (m0, m1, NULL);
12116 2305 : if (result_rem)
12117 : {
12118 : /* MPFR calculates quo in the host's long so it may
12119 : return more bits in quo than the target int can hold
12120 : if sizeof(host long) > sizeof(target int). This can
12121 : happen even for native compilers in LP64 mode. In
12122 : these cases, modulo the quo value with the largest
12123 : number that the target int can hold while leaving one
12124 : bit for the sign. */
12125 1179 : if (sizeof (integer_quo) * CHAR_BIT > INT_TYPE_SIZE)
12126 1179 : integer_quo %= (long)(1UL << (INT_TYPE_SIZE - 1));
12127 :
12128 : /* Dereference the quo pointer argument. */
12129 1179 : arg_quo = build_fold_indirect_ref (arg_quo);
12130 : /* Proceed iff a valid pointer type was passed in. */
12131 1179 : if (TYPE_MAIN_VARIANT (TREE_TYPE (arg_quo)) == integer_type_node)
12132 : {
12133 : /* Set the value. */
12134 1179 : tree result_quo
12135 1179 : = fold_build2 (MODIFY_EXPR, TREE_TYPE (arg_quo), arg_quo,
12136 : build_int_cst (TREE_TYPE (arg_quo),
12137 : integer_quo));
12138 1179 : TREE_SIDE_EFFECTS (result_quo) = 1;
12139 : /* Combine the quo assignment with the rem. */
12140 1179 : result = fold_build2 (COMPOUND_EXPR, type,
12141 : result_quo, result_rem);
12142 1179 : suppress_warning (result, OPT_Wunused_value);
12143 1179 : result = non_lvalue (result);
12144 : }
12145 : }
12146 : }
12147 : }
12148 70383 : return result;
12149 : }
12150 :
12151 : /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
12152 : resulting value as a tree with type TYPE. The mpfr precision is
12153 : set to the precision of TYPE. We assume that this mpfr function
12154 : returns zero if the result could be calculated exactly within the
12155 : requested precision. In addition, the integer pointer represented
12156 : by ARG_SG will be dereferenced and set to the appropriate signgam
12157 : (-1,1) value. */
12158 :
12159 : static tree
12160 6504 : do_mpfr_lgamma_r (tree arg, tree arg_sg, tree type)
12161 : {
12162 6504 : tree result = NULL_TREE;
12163 :
12164 6504 : STRIP_NOPS (arg);
12165 :
12166 : /* To proceed, MPFR must exactly represent the target floating point
12167 : format, which only happens when the target base equals two. Also
12168 : verify ARG is a constant and that ARG_SG is an int pointer. */
12169 6504 : if (REAL_MODE_FORMAT (TYPE_MODE (type))->b == 2
12170 6504 : && TREE_CODE (arg) == REAL_CST && !TREE_OVERFLOW (arg)
12171 6470 : && TREE_CODE (TREE_TYPE (arg_sg)) == POINTER_TYPE
12172 12974 : && TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (arg_sg))) == integer_type_node)
12173 : {
12174 6470 : const REAL_VALUE_TYPE *const ra = TREE_REAL_CST_PTR (arg);
12175 :
12176 : /* In addition to NaN and Inf, the argument cannot be zero or a
12177 : negative integer. */
12178 6470 : if (real_isfinite (ra)
12179 6470 : && ra->cl != rvc_zero
12180 12940 : && !(real_isneg (ra) && real_isinteger (ra, TYPE_MODE (type))))
12181 : {
12182 674 : const struct real_format *fmt = REAL_MODE_FORMAT (TYPE_MODE (type));
12183 674 : const int prec = fmt->p;
12184 674 : const mpfr_rnd_t rnd = fmt->round_towards_zero? MPFR_RNDZ : MPFR_RNDN;
12185 674 : int inexact, sg;
12186 674 : tree result_lg;
12187 :
12188 674 : auto_mpfr m (prec);
12189 674 : mpfr_from_real (m, ra, MPFR_RNDN);
12190 674 : mpfr_clear_flags ();
12191 674 : inexact = mpfr_lgamma (m, &sg, m, rnd);
12192 674 : result_lg = do_mpfr_ckconv (m, type, inexact);
12193 674 : if (result_lg)
12194 : {
12195 674 : tree result_sg;
12196 :
12197 : /* Dereference the arg_sg pointer argument. */
12198 674 : arg_sg = build_fold_indirect_ref (arg_sg);
12199 : /* Assign the signgam value into *arg_sg. */
12200 674 : result_sg = fold_build2 (MODIFY_EXPR,
12201 : TREE_TYPE (arg_sg), arg_sg,
12202 : build_int_cst (TREE_TYPE (arg_sg), sg));
12203 674 : TREE_SIDE_EFFECTS (result_sg) = 1;
12204 : /* Combine the signgam assignment with the lgamma result. */
12205 674 : result = non_lvalue (fold_build2 (COMPOUND_EXPR, type,
12206 : result_sg, result_lg));
12207 : }
12208 674 : }
12209 : }
12210 :
12211 6504 : return result;
12212 : }
12213 :
12214 : /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
12215 : mpc function FUNC on it and return the resulting value as a tree
12216 : with type TYPE. The mpfr precision is set to the precision of
12217 : TYPE. We assume that function FUNC returns zero if the result
12218 : could be calculated exactly within the requested precision. If
12219 : DO_NONFINITE is true, then fold expressions containing Inf or NaN
12220 : in the arguments and/or results. */
12221 :
12222 : tree
12223 4481 : do_mpc_arg2 (tree arg0, tree arg1, tree type, int do_nonfinite,
12224 : int (*func)(mpc_ptr, mpc_srcptr, mpc_srcptr, mpc_rnd_t))
12225 : {
12226 4481 : tree result = NULL_TREE;
12227 :
12228 4481 : STRIP_NOPS (arg0);
12229 4481 : STRIP_NOPS (arg1);
12230 :
12231 : /* To proceed, MPFR must exactly represent the target floating point
12232 : format, which only happens when the target base equals two. */
12233 4481 : if (TREE_CODE (arg0) == COMPLEX_CST && !TREE_OVERFLOW (arg0)
12234 4481 : && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TREE_TYPE (arg0)))
12235 4481 : && TREE_CODE (arg1) == COMPLEX_CST && !TREE_OVERFLOW (arg1)
12236 4481 : && SCALAR_FLOAT_TYPE_P (TREE_TYPE (TREE_TYPE (arg1)))
12237 8962 : && REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (TREE_TYPE (arg0))))->b == 2)
12238 : {
12239 4481 : const REAL_VALUE_TYPE *const re0 = TREE_REAL_CST_PTR (TREE_REALPART (arg0));
12240 4481 : const REAL_VALUE_TYPE *const im0 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg0));
12241 4481 : const REAL_VALUE_TYPE *const re1 = TREE_REAL_CST_PTR (TREE_REALPART (arg1));
12242 4481 : const REAL_VALUE_TYPE *const im1 = TREE_REAL_CST_PTR (TREE_IMAGPART (arg1));
12243 :
12244 4481 : if (do_nonfinite
12245 4481 : || (real_isfinite (re0) && real_isfinite (im0)
12246 4017 : && real_isfinite (re1) && real_isfinite (im1)))
12247 : {
12248 4129 : const struct real_format *const fmt =
12249 4129 : REAL_MODE_FORMAT (TYPE_MODE (TREE_TYPE (type)));
12250 4129 : const int prec = fmt->p;
12251 4129 : const mpfr_rnd_t rnd = fmt->round_towards_zero
12252 4129 : ? MPFR_RNDZ : MPFR_RNDN;
12253 4129 : const mpc_rnd_t crnd = fmt->round_towards_zero ? MPC_RNDZZ : MPC_RNDNN;
12254 4129 : int inexact;
12255 4129 : mpc_t m0, m1;
12256 :
12257 4129 : mpc_init2 (m0, prec);
12258 4129 : mpc_init2 (m1, prec);
12259 4129 : mpfr_from_real (mpc_realref (m0), re0, rnd);
12260 4129 : mpfr_from_real (mpc_imagref (m0), im0, rnd);
12261 4129 : mpfr_from_real (mpc_realref (m1), re1, rnd);
12262 4129 : mpfr_from_real (mpc_imagref (m1), im1, rnd);
12263 4129 : mpfr_clear_flags ();
12264 4129 : inexact = func (m0, m0, m1, crnd);
12265 4129 : result = do_mpc_ckconv (m0, type, inexact, do_nonfinite);
12266 4129 : mpc_clear (m0);
12267 4129 : mpc_clear (m1);
12268 : }
12269 : }
12270 :
12271 4481 : return result;
12272 : }
12273 :
12274 : /* A wrapper function for builtin folding that prevents warnings for
12275 : "statement without effect" and the like, caused by removing the
12276 : call node earlier than the warning is generated. */
12277 :
12278 : tree
12279 6055336 : fold_call_stmt (gcall *stmt, bool ignore)
12280 : {
12281 6055336 : tree ret = NULL_TREE;
12282 6055336 : tree fndecl = gimple_call_fndecl (stmt);
12283 6055336 : location_t loc = gimple_location (stmt);
12284 6055336 : if (fndecl && fndecl_built_in_p (fndecl)
12285 12110672 : && !gimple_call_va_arg_pack_p (stmt))
12286 : {
12287 6055270 : int nargs = gimple_call_num_args (stmt);
12288 6055270 : tree *args = (nargs > 0
12289 6055270 : ? gimple_call_arg_ptr (stmt, 0)
12290 : : &error_mark_node);
12291 :
12292 6055270 : if (avoid_folding_inline_builtin (fndecl))
12293 : return NULL_TREE;
12294 6055270 : if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_MD)
12295 : {
12296 0 : return targetm.fold_builtin (fndecl, nargs, args, ignore);
12297 : }
12298 : else
12299 : {
12300 6055270 : ret = fold_builtin_n (loc, NULL_TREE, fndecl, args, nargs, ignore);
12301 6055270 : if (ret)
12302 : {
12303 : /* Propagate location information from original call to
12304 : expansion of builtin. Otherwise things like
12305 : maybe_emit_chk_warning, that operate on the expansion
12306 : of a builtin, will use the wrong location information. */
12307 4973 : if (gimple_has_location (stmt))
12308 : {
12309 4972 : tree realret = ret;
12310 4972 : if (TREE_CODE (ret) == NOP_EXPR)
12311 4972 : realret = TREE_OPERAND (ret, 0);
12312 4972 : if (CAN_HAVE_LOCATION_P (realret)
12313 9166 : && !EXPR_HAS_LOCATION (realret))
12314 6 : SET_EXPR_LOCATION (realret, loc);
12315 4972 : return realret;
12316 : }
12317 : return ret;
12318 : }
12319 : }
12320 : }
12321 : return NULL_TREE;
12322 : }
12323 :
12324 : /* Look up the function in builtin_decl that corresponds to DECL
12325 : and set ASMSPEC as its user assembler name. DECL must be a
12326 : function decl that declares a builtin. */
12327 :
12328 : void
12329 151720 : set_builtin_user_assembler_name (tree decl, const char *asmspec)
12330 : {
12331 151720 : gcc_assert (fndecl_built_in_p (decl, BUILT_IN_NORMAL)
12332 : && asmspec != 0);
12333 :
12334 151720 : tree builtin = builtin_decl_explicit (DECL_FUNCTION_CODE (decl));
12335 151720 : set_user_assembler_name (builtin, asmspec);
12336 :
12337 151720 : if (DECL_FUNCTION_CODE (decl) == BUILT_IN_FFS
12338 151720 : && INT_TYPE_SIZE < BITS_PER_WORD)
12339 : {
12340 1 : scalar_int_mode mode = int_mode_for_size (INT_TYPE_SIZE, 0).require ();
12341 1 : set_user_assembler_libfunc ("ffs", asmspec);
12342 1 : set_optab_libfunc (ffs_optab, mode, "ffs");
12343 : }
12344 151720 : }
12345 :
12346 : /* Return true if DECL is a builtin that expands to a constant or similarly
12347 : simple code. */
12348 : bool
12349 32445827 : is_simple_builtin (tree decl)
12350 : {
12351 32445827 : if (decl && fndecl_built_in_p (decl, BUILT_IN_NORMAL))
12352 31149260 : switch (DECL_FUNCTION_CODE (decl))
12353 : {
12354 : /* Builtins that expand to constants. */
12355 : case BUILT_IN_CONSTANT_P:
12356 : case BUILT_IN_EXPECT:
12357 : case BUILT_IN_OBJECT_SIZE:
12358 : case BUILT_IN_UNREACHABLE:
12359 : /* Simple register moves or loads from stack. */
12360 : case BUILT_IN_ASSUME_ALIGNED:
12361 : case BUILT_IN_RETURN_ADDRESS:
12362 : case BUILT_IN_EXTRACT_RETURN_ADDR:
12363 : case BUILT_IN_FROB_RETURN_ADDR:
12364 : case BUILT_IN_RETURN:
12365 : case BUILT_IN_AGGREGATE_INCOMING_ADDRESS:
12366 : case BUILT_IN_FRAME_ADDRESS:
12367 : case BUILT_IN_VA_END:
12368 : case BUILT_IN_STACK_SAVE:
12369 : case BUILT_IN_STACK_RESTORE:
12370 : case BUILT_IN_DWARF_CFA:
12371 : /* Exception state returns or moves registers around. */
12372 : case BUILT_IN_EH_FILTER:
12373 : case BUILT_IN_EH_POINTER:
12374 : case BUILT_IN_EH_COPY_VALUES:
12375 : return true;
12376 :
12377 28226448 : default:
12378 28226448 : return false;
12379 : }
12380 :
12381 : return false;
12382 : }
12383 :
12384 : /* Return true if DECL is a builtin that is not expensive, i.e., they are
12385 : most probably expanded inline into reasonably simple code. This is a
12386 : superset of is_simple_builtin. */
12387 : bool
12388 19398695 : is_inexpensive_builtin (tree decl)
12389 : {
12390 19398695 : if (!decl)
12391 : return false;
12392 19384572 : else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_MD)
12393 : return true;
12394 18062801 : else if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
12395 15248392 : switch (DECL_FUNCTION_CODE (decl))
12396 : {
12397 : case BUILT_IN_ABS:
12398 : CASE_BUILT_IN_ALLOCA:
12399 : case BUILT_IN_BSWAP16:
12400 : case BUILT_IN_BSWAP32:
12401 : case BUILT_IN_BSWAP64:
12402 : case BUILT_IN_BSWAP128:
12403 : case BUILT_IN_BITREVERSE8:
12404 : case BUILT_IN_BITREVERSE16:
12405 : case BUILT_IN_BITREVERSE32:
12406 : case BUILT_IN_BITREVERSE64:
12407 : case BUILT_IN_BITREVERSE128:
12408 : case BUILT_IN_CLZ:
12409 : case BUILT_IN_CLZIMAX:
12410 : case BUILT_IN_CLZL:
12411 : case BUILT_IN_CLZLL:
12412 : case BUILT_IN_CTZ:
12413 : case BUILT_IN_CTZIMAX:
12414 : case BUILT_IN_CTZL:
12415 : case BUILT_IN_CTZLL:
12416 : case BUILT_IN_FFS:
12417 : case BUILT_IN_FFSIMAX:
12418 : case BUILT_IN_FFSL:
12419 : case BUILT_IN_FFSLL:
12420 : case BUILT_IN_IMAXABS:
12421 : case BUILT_IN_FINITE:
12422 : case BUILT_IN_FINITEF:
12423 : case BUILT_IN_FINITEL:
12424 : case BUILT_IN_FINITED32:
12425 : case BUILT_IN_FINITED64:
12426 : case BUILT_IN_FINITED128:
12427 : case BUILT_IN_FPCLASSIFY:
12428 : case BUILT_IN_ISFINITE:
12429 : case BUILT_IN_ISINF_SIGN:
12430 : case BUILT_IN_ISINF:
12431 : case BUILT_IN_ISINFF:
12432 : case BUILT_IN_ISINFL:
12433 : case BUILT_IN_ISINFD32:
12434 : case BUILT_IN_ISINFD64:
12435 : case BUILT_IN_ISINFD128:
12436 : case BUILT_IN_ISNAN:
12437 : case BUILT_IN_ISNANF:
12438 : case BUILT_IN_ISNANL:
12439 : case BUILT_IN_ISNAND32:
12440 : case BUILT_IN_ISNAND64:
12441 : case BUILT_IN_ISNAND128:
12442 : case BUILT_IN_ISNORMAL:
12443 : case BUILT_IN_ISGREATER:
12444 : case BUILT_IN_ISGREATEREQUAL:
12445 : case BUILT_IN_ISLESS:
12446 : case BUILT_IN_ISLESSEQUAL:
12447 : case BUILT_IN_ISLESSGREATER:
12448 : case BUILT_IN_ISUNORDERED:
12449 : case BUILT_IN_ISEQSIG:
12450 : case BUILT_IN_VA_ARG_PACK:
12451 : case BUILT_IN_VA_ARG_PACK_LEN:
12452 : case BUILT_IN_VA_COPY:
12453 : case BUILT_IN_TRAP:
12454 : case BUILT_IN_UNREACHABLE_TRAP:
12455 : case BUILT_IN_SAVEREGS:
12456 : case BUILT_IN_POPCOUNTL:
12457 : case BUILT_IN_POPCOUNTLL:
12458 : case BUILT_IN_POPCOUNTIMAX:
12459 : case BUILT_IN_POPCOUNT:
12460 : case BUILT_IN_PARITYL:
12461 : case BUILT_IN_PARITYLL:
12462 : case BUILT_IN_PARITYIMAX:
12463 : case BUILT_IN_PARITY:
12464 : case BUILT_IN_LABS:
12465 : case BUILT_IN_LLABS:
12466 : case BUILT_IN_PREFETCH:
12467 : case BUILT_IN_ACC_ON_DEVICE:
12468 : return true;
12469 :
12470 14550623 : default:
12471 14550623 : return is_simple_builtin (decl);
12472 : }
12473 :
12474 : return false;
12475 : }
12476 :
12477 : /* Return true if T is a constant and the value cast to a target char
12478 : can be represented by a host char.
12479 : Store the casted char constant in *P if so. */
12480 :
12481 : bool
12482 3530 : target_char_cst_p (tree t, char *p)
12483 : {
12484 3530 : if (!tree_fits_uhwi_p (t) || CHAR_TYPE_SIZE != HOST_BITS_PER_CHAR)
12485 : return false;
12486 :
12487 1910 : *p = (char)tree_to_uhwi (t);
12488 1910 : return true;
12489 : }
12490 :
12491 : /* Return true if the builtin DECL is implemented in a standard library.
12492 : Otherwise return false which doesn't guarantee it is not (thus the list
12493 : of handled builtins below may be incomplete). */
12494 :
12495 : bool
12496 41630 : builtin_with_linkage_p (tree decl)
12497 : {
12498 41630 : if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
12499 41346 : switch (DECL_FUNCTION_CODE (decl))
12500 : {
12501 1304 : CASE_FLT_FN (BUILT_IN_ACOS):
12502 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ACOS):
12503 1304 : CASE_FLT_FN (BUILT_IN_ACOSH):
12504 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ACOSH):
12505 1304 : CASE_FLT_FN (BUILT_IN_ASIN):
12506 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ASIN):
12507 1304 : CASE_FLT_FN (BUILT_IN_ASINH):
12508 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ASINH):
12509 1304 : CASE_FLT_FN (BUILT_IN_ATAN):
12510 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ATAN):
12511 1304 : CASE_FLT_FN (BUILT_IN_ATANH):
12512 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ATANH):
12513 1304 : CASE_FLT_FN (BUILT_IN_ATAN2):
12514 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ATAN2):
12515 1304 : CASE_FLT_FN (BUILT_IN_CBRT):
12516 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_CBRT):
12517 1304 : CASE_FLT_FN (BUILT_IN_CEIL):
12518 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_CEIL):
12519 1304 : CASE_FLT_FN (BUILT_IN_COPYSIGN):
12520 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_COPYSIGN):
12521 1304 : CASE_FLT_FN (BUILT_IN_COS):
12522 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_COS):
12523 1304 : CASE_FLT_FN (BUILT_IN_COSH):
12524 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_COSH):
12525 1304 : CASE_FLT_FN (BUILT_IN_ERF):
12526 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ERF):
12527 1304 : CASE_FLT_FN (BUILT_IN_ERFC):
12528 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ERFC):
12529 1304 : CASE_FLT_FN (BUILT_IN_EXP):
12530 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_EXP):
12531 1304 : CASE_FLT_FN (BUILT_IN_EXP2):
12532 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_EXP2):
12533 1304 : CASE_FLT_FN (BUILT_IN_EXPM1):
12534 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_EXPM1):
12535 1304 : CASE_FLT_FN (BUILT_IN_FABS):
12536 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FABS):
12537 1304 : CASE_FLT_FN (BUILT_IN_FDIM):
12538 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FDIM):
12539 1304 : CASE_FLT_FN (BUILT_IN_FLOOR):
12540 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FLOOR):
12541 1304 : CASE_FLT_FN (BUILT_IN_FMA):
12542 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMA):
12543 1304 : CASE_FLT_FN (BUILT_IN_FMAX):
12544 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMAX):
12545 1304 : CASE_FLT_FN (BUILT_IN_FMIN):
12546 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMIN):
12547 1304 : CASE_FLT_FN (BUILT_IN_FMOD):
12548 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FMOD):
12549 1304 : CASE_FLT_FN (BUILT_IN_FREXP):
12550 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_FREXP):
12551 1304 : CASE_FLT_FN (BUILT_IN_HYPOT):
12552 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_HYPOT):
12553 1304 : CASE_FLT_FN (BUILT_IN_ILOGB):
12554 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ILOGB):
12555 1304 : CASE_FLT_FN (BUILT_IN_LDEXP):
12556 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LDEXP):
12557 1304 : CASE_FLT_FN (BUILT_IN_LGAMMA):
12558 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LGAMMA):
12559 1304 : CASE_FLT_FN (BUILT_IN_LLRINT):
12560 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LLRINT):
12561 1304 : CASE_FLT_FN (BUILT_IN_LLROUND):
12562 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LLROUND):
12563 1304 : CASE_FLT_FN (BUILT_IN_LOG):
12564 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LOG):
12565 1304 : CASE_FLT_FN (BUILT_IN_LOG10):
12566 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LOG10):
12567 1304 : CASE_FLT_FN (BUILT_IN_LOG1P):
12568 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LOG1P):
12569 1304 : CASE_FLT_FN (BUILT_IN_LOG2):
12570 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LOG2):
12571 1304 : CASE_FLT_FN (BUILT_IN_LOGB):
12572 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LOGB):
12573 1304 : CASE_FLT_FN (BUILT_IN_LRINT):
12574 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LRINT):
12575 1304 : CASE_FLT_FN (BUILT_IN_LROUND):
12576 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_LROUND):
12577 1304 : CASE_FLT_FN (BUILT_IN_MODF):
12578 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_MODF):
12579 1304 : CASE_FLT_FN (BUILT_IN_NAN):
12580 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_NAN):
12581 1304 : CASE_FLT_FN (BUILT_IN_NEARBYINT):
12582 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_NEARBYINT):
12583 1304 : CASE_FLT_FN (BUILT_IN_NEXTAFTER):
12584 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_NEXTAFTER):
12585 1304 : CASE_FLT_FN (BUILT_IN_NEXTTOWARD):
12586 1304 : CASE_FLT_FN (BUILT_IN_POW):
12587 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_POW):
12588 1304 : CASE_FLT_FN (BUILT_IN_REMAINDER):
12589 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_REMAINDER):
12590 1304 : CASE_FLT_FN (BUILT_IN_REMQUO):
12591 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_REMQUO):
12592 1304 : CASE_FLT_FN (BUILT_IN_RINT):
12593 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_RINT):
12594 1304 : CASE_FLT_FN (BUILT_IN_ROUND):
12595 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_ROUND):
12596 1304 : CASE_FLT_FN (BUILT_IN_SCALBLN):
12597 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_SCALBLN):
12598 1304 : CASE_FLT_FN (BUILT_IN_SCALBN):
12599 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_SCALBN):
12600 1304 : CASE_FLT_FN (BUILT_IN_SIN):
12601 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_SIN):
12602 1304 : CASE_FLT_FN (BUILT_IN_SINH):
12603 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_SINH):
12604 1304 : CASE_FLT_FN (BUILT_IN_SINCOS):
12605 1304 : CASE_FLT_FN (BUILT_IN_SQRT):
12606 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_SQRT):
12607 1304 : CASE_FLT_FN (BUILT_IN_TAN):
12608 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_TAN):
12609 1304 : CASE_FLT_FN (BUILT_IN_TANH):
12610 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_TANH):
12611 1304 : CASE_FLT_FN (BUILT_IN_TGAMMA):
12612 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_TGAMMA):
12613 1304 : CASE_FLT_FN (BUILT_IN_TRUNC):
12614 1304 : CASE_FLT_FN_FLOATN_NX (BUILT_IN_TRUNC):
12615 1304 : return true;
12616 :
12617 16 : case BUILT_IN_STPCPY:
12618 16 : case BUILT_IN_STPNCPY:
12619 : /* stpcpy is both referenced in libiberty's pex-win32.c and provided
12620 : by libiberty's stpcpy.c for MinGW targets so we need to return true
12621 : in order to be able to build libiberty in LTO mode for them. */
12622 16 : return true;
12623 :
12624 : default:
12625 : break;
12626 : }
12627 : return false;
12628 : }
12629 :
12630 : /* Return true if OFFRNG is bounded to a subrange of offset values
12631 : valid for the largest possible object. */
12632 :
12633 : bool
12634 501 : access_ref::offset_bounded () const
12635 : {
12636 501 : tree min = TYPE_MIN_VALUE (ptrdiff_type_node);
12637 501 : tree max = TYPE_MAX_VALUE (ptrdiff_type_node);
12638 975 : return wi::to_offset (min) <= offrng[0] && offrng[1] <= wi::to_offset (max);
12639 : }
12640 :
12641 : /* If CALLEE has known side effects, fill in INFO and return true.
12642 : See tree-ssa-structalias.cc:find_func_aliases
12643 : for the list of builtins we might need to handle here. */
12644 :
12645 : attr_fnspec
12646 112705605 : builtin_fnspec (tree callee)
12647 : {
12648 112705605 : built_in_function code = DECL_FUNCTION_CODE (callee);
12649 :
12650 112705605 : switch (code)
12651 : {
12652 : /* All the following functions read memory pointed to by
12653 : their second argument and write memory pointed to by first
12654 : argument.
12655 : strcat/strncat additionally reads memory pointed to by the first
12656 : argument. */
12657 133309 : case BUILT_IN_STRCAT:
12658 133309 : case BUILT_IN_STRCAT_CHK:
12659 133309 : return "1cW 1 ";
12660 42143 : case BUILT_IN_STRNCAT:
12661 42143 : case BUILT_IN_STRNCAT_CHK:
12662 42143 : return "1cW 13";
12663 262620 : case BUILT_IN_STRCPY:
12664 262620 : case BUILT_IN_STRCPY_CHK:
12665 262620 : return "1cO 1 ";
12666 32280 : case BUILT_IN_STPCPY:
12667 32280 : case BUILT_IN_STPCPY_CHK:
12668 32280 : return ".cO 1 ";
12669 18518344 : case BUILT_IN_STRNCPY:
12670 18518344 : case BUILT_IN_MEMCPY:
12671 18518344 : case BUILT_IN_MEMMOVE:
12672 18518344 : case BUILT_IN_TM_MEMCPY:
12673 18518344 : case BUILT_IN_TM_MEMMOVE:
12674 18518344 : case BUILT_IN_STRNCPY_CHK:
12675 18518344 : case BUILT_IN_MEMCPY_CHK:
12676 18518344 : case BUILT_IN_MEMMOVE_CHK:
12677 18518344 : return "1cO313";
12678 142923 : case BUILT_IN_MEMPCPY:
12679 142923 : case BUILT_IN_MEMPCPY_CHK:
12680 142923 : return ".cO313";
12681 57683 : case BUILT_IN_STPNCPY:
12682 57683 : case BUILT_IN_STPNCPY_CHK:
12683 57683 : return ".cO313";
12684 0 : case BUILT_IN_BCOPY:
12685 0 : return ".c23O3";
12686 0 : case BUILT_IN_BZERO:
12687 0 : return ".cO2";
12688 8970246 : case BUILT_IN_MEMCMP:
12689 8970246 : case BUILT_IN_MEMCMP_EQ:
12690 8970246 : case BUILT_IN_BCMP:
12691 8970246 : case BUILT_IN_STRNCMP:
12692 8970246 : case BUILT_IN_STRNCMP_EQ:
12693 8970246 : case BUILT_IN_STRNCASECMP:
12694 8970246 : return ".cR3R3";
12695 :
12696 : /* The following functions read memory pointed to by their
12697 : first argument. */
12698 804 : CASE_BUILT_IN_TM_LOAD (1):
12699 804 : CASE_BUILT_IN_TM_LOAD (2):
12700 804 : CASE_BUILT_IN_TM_LOAD (4):
12701 804 : CASE_BUILT_IN_TM_LOAD (8):
12702 804 : CASE_BUILT_IN_TM_LOAD (FLOAT):
12703 804 : CASE_BUILT_IN_TM_LOAD (DOUBLE):
12704 804 : CASE_BUILT_IN_TM_LOAD (LDOUBLE):
12705 804 : CASE_BUILT_IN_TM_LOAD (M64):
12706 804 : CASE_BUILT_IN_TM_LOAD (M128):
12707 804 : CASE_BUILT_IN_TM_LOAD (M256):
12708 804 : case BUILT_IN_TM_LOG:
12709 804 : case BUILT_IN_TM_LOG_1:
12710 804 : case BUILT_IN_TM_LOG_2:
12711 804 : case BUILT_IN_TM_LOG_4:
12712 804 : case BUILT_IN_TM_LOG_8:
12713 804 : case BUILT_IN_TM_LOG_FLOAT:
12714 804 : case BUILT_IN_TM_LOG_DOUBLE:
12715 804 : case BUILT_IN_TM_LOG_LDOUBLE:
12716 804 : case BUILT_IN_TM_LOG_M64:
12717 804 : case BUILT_IN_TM_LOG_M128:
12718 804 : case BUILT_IN_TM_LOG_M256:
12719 804 : return ".cR ";
12720 :
12721 477010 : case BUILT_IN_INDEX:
12722 477010 : case BUILT_IN_RINDEX:
12723 477010 : case BUILT_IN_STRCHR:
12724 477010 : case BUILT_IN_STRLEN:
12725 477010 : case BUILT_IN_STRRCHR:
12726 477010 : return ".cR ";
12727 70426 : case BUILT_IN_STRNLEN:
12728 70426 : return ".cR2";
12729 :
12730 : /* These read memory pointed to by the first argument.
12731 : Allocating memory does not have any side-effects apart from
12732 : being the definition point for the pointer.
12733 : Unix98 specifies that errno is set on allocation failure. */
12734 17783 : case BUILT_IN_STRDUP:
12735 17783 : return "mCR ";
12736 13304 : case BUILT_IN_STRNDUP:
12737 13304 : return "mCR2";
12738 : /* Allocating memory does not have any side-effects apart from
12739 : being the definition point for the pointer. */
12740 10726906 : case BUILT_IN_MALLOC:
12741 10726906 : case BUILT_IN_ALIGNED_ALLOC:
12742 10726906 : case BUILT_IN_CALLOC:
12743 10726906 : case BUILT_IN_GOMP_ALLOC:
12744 10726906 : return "mC";
12745 833926 : CASE_BUILT_IN_ALLOCA:
12746 833926 : return "mc";
12747 : /* These read memory pointed to by the first argument with size
12748 : in the third argument. */
12749 533240 : case BUILT_IN_MEMCHR:
12750 533240 : return ".cR3";
12751 : /* These read memory pointed to by the first and second arguments. */
12752 11300693 : case BUILT_IN_STRSTR:
12753 11300693 : case BUILT_IN_STRPBRK:
12754 11300693 : case BUILT_IN_STRCASECMP:
12755 11300693 : case BUILT_IN_STRCSPN:
12756 11300693 : case BUILT_IN_STRSPN:
12757 11300693 : case BUILT_IN_STRCMP:
12758 11300693 : case BUILT_IN_STRCMP_EQ:
12759 11300693 : return ".cR R ";
12760 : /* Freeing memory kills the pointed-to memory. More importantly
12761 : the call has to serve as a barrier for moving loads and stores
12762 : across it. */
12763 6136177 : case BUILT_IN_STACK_RESTORE:
12764 6136177 : case BUILT_IN_FREE:
12765 6136177 : case BUILT_IN_GOMP_FREE:
12766 6136177 : return ".co ";
12767 104786 : case BUILT_IN_VA_END:
12768 104786 : return ".cO ";
12769 : /* Realloc serves both as allocation point and deallocation point. */
12770 1054775 : case BUILT_IN_REALLOC:
12771 1054775 : case BUILT_IN_GOMP_REALLOC:
12772 1054775 : return ".Cw ";
12773 15732 : case BUILT_IN_GAMMA_R:
12774 15732 : case BUILT_IN_GAMMAF_R:
12775 15732 : case BUILT_IN_GAMMAL_R:
12776 15732 : case BUILT_IN_LGAMMA_R:
12777 15732 : case BUILT_IN_LGAMMAF_R:
12778 15732 : case BUILT_IN_LGAMMAL_R:
12779 15732 : return ".C. Ot";
12780 46007 : case BUILT_IN_FREXP:
12781 46007 : case BUILT_IN_FREXPF:
12782 46007 : case BUILT_IN_FREXPL:
12783 46007 : case BUILT_IN_MODF:
12784 46007 : case BUILT_IN_MODFF:
12785 46007 : case BUILT_IN_MODFL:
12786 46007 : return ".c. Ot";
12787 7586 : case BUILT_IN_REMQUO:
12788 7586 : case BUILT_IN_REMQUOF:
12789 7586 : case BUILT_IN_REMQUOL:
12790 7586 : return ".c. . Ot";
12791 158 : case BUILT_IN_SINCOS:
12792 158 : case BUILT_IN_SINCOSF:
12793 158 : case BUILT_IN_SINCOSL:
12794 158 : return ".c. OtOt";
12795 4278502 : case BUILT_IN_MEMSET:
12796 4278502 : case BUILT_IN_MEMSET_CHK:
12797 4278502 : case BUILT_IN_TM_MEMSET:
12798 4278502 : return "1cO3";
12799 366 : CASE_BUILT_IN_TM_STORE (1):
12800 366 : CASE_BUILT_IN_TM_STORE (2):
12801 366 : CASE_BUILT_IN_TM_STORE (4):
12802 366 : CASE_BUILT_IN_TM_STORE (8):
12803 366 : CASE_BUILT_IN_TM_STORE (FLOAT):
12804 366 : CASE_BUILT_IN_TM_STORE (DOUBLE):
12805 366 : CASE_BUILT_IN_TM_STORE (LDOUBLE):
12806 366 : CASE_BUILT_IN_TM_STORE (M64):
12807 366 : CASE_BUILT_IN_TM_STORE (M128):
12808 366 : CASE_BUILT_IN_TM_STORE (M256):
12809 366 : return ".cO ";
12810 2301226 : case BUILT_IN_STACK_SAVE:
12811 2301226 : case BUILT_IN_RETURN:
12812 2301226 : case BUILT_IN_EH_POINTER:
12813 2301226 : case BUILT_IN_EH_FILTER:
12814 2301226 : case BUILT_IN_UNWIND_RESUME:
12815 2301226 : case BUILT_IN_CXA_END_CLEANUP:
12816 2301226 : case BUILT_IN_EH_COPY_VALUES:
12817 2301226 : case BUILT_IN_FRAME_ADDRESS:
12818 2301226 : case BUILT_IN_APPLY_ARGS:
12819 2301226 : case BUILT_IN_ASAN_BEFORE_DYNAMIC_INIT:
12820 2301226 : case BUILT_IN_ASAN_AFTER_DYNAMIC_INIT:
12821 2301226 : case BUILT_IN_PREFETCH:
12822 2301226 : case BUILT_IN_DWARF_CFA:
12823 2301226 : case BUILT_IN_RETURN_ADDRESS:
12824 2301226 : return ".c";
12825 2070615 : case BUILT_IN_ASSUME_ALIGNED:
12826 2070615 : case BUILT_IN_EXPECT:
12827 2070615 : case BUILT_IN_EXPECT_WITH_PROBABILITY:
12828 2070615 : return "1cX ";
12829 : /* But posix_memalign stores a pointer into the memory pointed to
12830 : by its first argument. */
12831 5680 : case BUILT_IN_POSIX_MEMALIGN:
12832 5680 : return ".cOt";
12833 4438 : case BUILT_IN_OMP_GET_MAPPED_PTR:
12834 4438 : return ". R ";
12835 :
12836 44545917 : default:
12837 44545917 : return "";
12838 : }
12839 : }
|
