| blob | f8d94c4b435664ffdc0426f296098f75b006e7eb |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2024 Free Software Foundation, Inc.
4 This file is part of GCC.
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.
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.
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/>. */
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. */
87 #if SWITCHABLE_TARGET
89 #endif
91 /* Define the names of the builtin function types and codes. */
95 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
97 {
99 };
101 /* Setup an array of builtin_info_type, make sure each element decl is
102 initialized to NULL_TREE. */
105 /* Non-zero if __builtin_constant_p should be folded right away. */
124 optab);
139 memop_ret retmode,
200 /* Return true if NAME starts with __builtin_ or __sync_. */
202 static bool
204 {
208 }
210 /* Return true if NODE should be considered for inline expansion regardless
211 of the optimization level. This means whenever a function is invoked with
212 its "internal" name, which normally contains the prefix "__builtin". */
214 bool
216 {
217 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
218 we want the name used to call the function, not the name it
219 will have. */
222 }
224 /* Compute values M and N such that M divides (address of EXP - N) and such
225 that N < M. If these numbers can be determined, store M in alignp and N in
226 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
227 *alignp and any bit-offset to *bitposp.
229 Note that the address (and thus the alignment) computed here is based
230 on the address to which a symbol resolves, whereas DECL_ALIGN is based
231 on the address at which an object is actually located. These two
232 addresses are not always the same. For example, on ARM targets,
233 the address &foo of a Thumb function foo() has the lowest bit set,
234 whereas foo() itself starts on an even address.
236 If ADDR_P is true we are taking the address of the memory reference EXP
237 and thus cannot rely on the access taking place. */
239 bool
242 {
244 tree offset;
245 machine_mode mode;
250 /* Get the innermost object and the constant (bitpos) and possibly
251 variable (offset) offset of the access. */
255 /* Extract alignment information from the innermost object and
256 possibly adjust bitpos and offset. */
258 {
259 /* Function addresses can encode extra information besides their
260 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
261 allows the low bit to be used as a virtual bit, we know
262 that the address itself must be at least 2-byte aligned. */
265 }
267 ;
269 {
270 /* The alignment of a CONST_DECL is determined by its initializer. */
277 }
279 {
282 }
286 {
292 /* If the address is explicitely aligned, handle that. */
295 {
300 }
302 known_alignment
306 /* Re-apply explicit alignment to the bitpos. */
309 /* The alignment of the pointer operand in a TARGET_MEM_REF
310 has to take the variable offset parts into account. */
312 {
314 {
319 }
323 }
325 /* When EXP is an actual memory reference then we can use
326 TYPE_ALIGN of a pointer indirection to derive alignment.
327 Do so only if get_pointer_alignment_1 did not reveal absolute
328 alignment knowledge and if using that alignment would
329 improve the situation. */
335 else
336 {
337 /* Else adjust bitpos accordingly. */
342 }
343 }
345 {
346 /* STRING_CST are the only constant objects we allow to be not
347 wrapped inside a CONST_DECL. */
353 }
355 /* If there is a non-constant offset part extract the maximum
356 alignment that can prevail. */
358 {
361 {
365 }
366 }
368 /* Account for the alignment of runtime coefficients, so that the constant
369 bitpos is guaranteed to be accurate. */
372 {
375 }
380 }
382 /* For a memory reference expression EXP compute values M and N such that M
383 divides (&EXP - N) and such that N < M. If these numbers can be determined,
384 store M in alignp and N in *BITPOSP and return true. Otherwise return false
385 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
387 bool
390 {
391 /* Strip a WITH_SIZE_EXPR, get_inner_reference doesn't know how to deal
392 with it. */
396 }
398 /* Return the alignment in bits of EXP, an object. */
400 unsigned int
402 {
408 /* align and bitpos now specify known low bits of the pointer.
409 ptr & (align - 1) == bitpos. */
414 }
416 /* For a pointer valued expression EXP compute values M and N such that M
417 divides (EXP - N) and such that N < M. If these numbers can be determined,
418 store M in alignp and N in *BITPOSP and return true. Return false if
419 the results are just a conservative approximation.
421 If EXP is not a pointer, false is returned too. */
423 bool
426 {
433 {
440 else
441 {
444 {
448 }
449 }
453 }
456 {
461 {
464 /* Make sure to return a sensible alignment when the multiplication
465 by BITS_PER_UNIT overflowed. */
468 /* We cannot really tell whether this result is an approximation. */
470 }
471 else
472 {
476 }
477 }
479 {
484 }
489 }
491 /* Return the alignment in bits of EXP, a pointer valued expression.
492 The alignment returned is, by default, the alignment of the thing that
493 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
495 Otherwise, look at the expression to see if we can do better, i.e., if the
496 expression is actually pointing at an object whose alignment is tighter. */
498 unsigned int
500 {
506 /* align and bitpos now specify known low bits of the pointer.
507 ptr & (align - 1) == bitpos. */
513 }
515 /* Return the number of leading non-zero elements in the sequence
516 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
517 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
519 unsigned
521 {
527 {
528 /* Optimize the common case of plain char. */
530 {
534 }
535 }
536 else
537 {
539 {
543 }
544 }
546 }
548 /* Compute the length of a null-terminated character string or wide
549 character string handling character sizes of 1, 2, and 4 bytes.
550 TREE_STRING_LENGTH is not the right way because it evaluates to
551 the size of the character array in bytes (as opposed to characters)
552 and because it can contain a zero byte in the middle.
554 ONLY_VALUE should be nonzero if the result is not going to be emitted
555 into the instruction stream and zero if it is going to be expanded.
556 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
557 is returned, otherwise NULL, since
558 len = c_strlen (ARG, 1); if (len) expand_expr (len, ...); would not
559 evaluate the side-effects.
561 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
562 accesses. Note that this implies the result is not going to be emitted
563 into the instruction stream.
565 Additional information about the string accessed may be recorded
566 in DATA. For example, if ARG references an unterminated string,
567 then the declaration will be stored in the DECL field. If the
568 length of the unterminated string can be determined, it'll be
569 stored in the LEN field. Note this length could well be different
570 than what a C strlen call would return.
572 ELTSIZE is 1 for normal single byte character strings, and 2 or
573 4 for wide characer strings. ELTSIZE is by default 1.
575 The value returned is of type `ssizetype'. */
577 tree
579 {
580 /* If we were not passed a DATA pointer, then get one to a local
581 structure. That avoids having to check DATA for NULL before
582 each time we want to use it. */
583 c_strlen_data local_strlen_data = { };
592 {
599 }
607 /* Offset from the beginning of the string in bytes. */
608 tree byteoff;
609 tree memsize;
610 tree decl;
615 /* Determine the size of the string element. */
619 /* Set MAXELTS to ARRAY_SIZE (SRC) - 1, the maximum possible
620 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
621 in case the latter is less than the size of the array, such as when
622 SRC refers to a short string literal used to initialize a large array.
623 In that case, the elements of the array after the terminating NUL are
624 all NUL. */
633 /* PTR can point to the byte representation of any string type, including
634 char* and wchar_t*. */
638 {
639 /* The code below works only for single byte character types. */
643 /* If the string has an internal NUL character followed by any
644 non-NUL characters (e.g., "foo\0bar"), we can't compute
645 the offset to the following NUL if we don't know where to
646 start searching for it. */
649 /* Return when an embedded null character is found or none at all.
650 In the latter case, set the DECL/LEN field in the DATA structure
651 so that callers may examine them. */
655 {
660 }
662 /* For empty strings the result should be zero. */
666 /* We don't know the starting offset, but we do know that the string
667 has no internal zero bytes. If the offset falls within the bounds
668 of the string subtract the offset from the length of the string,
669 and return that. Otherwise the length is zero. Take care to
670 use SAVE_EXPR in case the OFFSET has side-effects. */
677 offsave);
681 }
683 /* Offset from the beginning of the string in elements. */
684 HOST_WIDE_INT eltoff;
686 /* We have a known offset into the string. Start searching there for
687 a null character if we can represent it as a single HOST_WIDE_INT. */
692 else
695 /* If the offset is known to be out of bounds, warn, and call strlen at
696 runtime. */
698 {
699 /* Suppress multiple warnings for propagated constant strings. */
704 eltoff))
705 {
709 }
711 }
713 /* If eltoff is larger than strelts but less than maxelts the
714 string length is zero, since the excess memory will be zero. */
718 /* Use strlen to search for the first zero byte. Since any strings
719 constructed with build_string will have nulls appended, we win even
720 if we get handed something like (char[4])"abcd".
722 Since ELTOFF is our starting index into the string, no further
723 calculation is needed. */
727 /* Don't know what to return if there was no zero termination.
728 Ideally this would turn into a gcc_checking_assert over time.
729 Set DECL/LEN so callers can examine them. */
731 {
736 }
739 }
741 /* Return a constant integer corresponding to target reading
742 GET_MODE_BITSIZE (MODE) bits from string constant STR. If
743 NULL_TERMINATED_P, reading stops after '\0' character, all further ones
744 are assumed to be zero, otherwise it reads as many characters
745 as needed. */
747 rtx
750 {
757 {
761 }
764 }
766 /* Cast a target constant CST to target CHAR and if that value fits into
767 host char type, return zero and put that value into variable pointed to by
768 P. */
770 static int
772 {
779 /* Do not care if it fits or not right here. */
794 }
796 /* Similar to save_expr, but assumes that arbitrary code is not executed
797 in between the multiple evaluations. In particular, we assume that a
798 non-addressable local variable will not be modified. */
800 static tree
802 {
810 }
812 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
813 times to get the address of either a higher stack frame, or a return
814 address located within it (depending on FNDECL_CODE). */
816 static rtx
818 {
822 {
823 /* For a zero count with __builtin_return_address, we don't care what
824 frame address we return, because target-specific definitions will
825 override us. Therefore frame pointer elimination is OK, and using
826 the soft frame pointer is OK.
828 For a nonzero count, or a zero count with __builtin_frame_address,
829 we require a stable offset from the current frame pointer to the
830 previous one, so we must use the hard frame pointer, and
831 we must disable frame pointer elimination. */
834 else
835 {
838 /* Tell reload not to eliminate the frame pointer. */
840 }
841 }
846 /* On the SPARC, the return address is not in the frame, it is in a
847 register. There is no way to access it off of the current frame
848 pointer, but it can be accessed off the previous frame pointer by
849 reading the value from the register window save area. */
851 count--;
853 /* Scan back COUNT frames to the specified frame. */
855 {
856 /* Assume the dynamic chain pointer is in the word that the
857 frame address points to, unless otherwise specified. */
862 }
864 /* For __builtin_frame_address, return what we've got. But, on
865 the SPARC for example, we may have to add a bias. */
869 /* For __builtin_return_address, get the return address from that frame. */
870 #ifdef RETURN_ADDR_RTX
872 #else
876 #endif
878 }
880 /* Alias set used for setjmp buffer. */
883 /* Construct the leading half of a __builtin_setjmp call. Control will
884 return to RECEIVER_LABEL. This is also called directly by the SJLJ
885 exception handling code. */
887 void
889 {
891 rtx stack_save;
892 rtx mem;
901 /* We store the frame pointer and the address of receiver_label in
902 the buffer and use the rest of it for the stack save area, which
903 is machine-dependent. */
922 /* If there is further processing to do, do it. */
926 /* We have a nonlocal label. */
928 }
930 /* Construct the trailing part of a __builtin_setjmp call. This is
931 also called directly by the SJLJ exception handling code.
932 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
934 void
936 {
937 rtx chain;
939 /* Mark the FP as used when we get here, so we have to make sure it's
940 marked as used by this function. */
943 /* Mark the static chain as clobbered here so life information
944 doesn't get messed up for it. */
950 {
951 /* If the argument pointer can be eliminated in favor of the
952 frame pointer, we don't need to restore it. We assume here
953 that if such an elimination is present, it can always be used.
954 This is the case on all known machines; if we don't make this
955 assumption, we do unnecessary saving on many machines. */
965 {
966 /* Now restore our arg pointer from the address at which it
967 was saved in our stack frame. */
970 }
971 }
977 else
980 /* We must not allow the code we just generated to be reordered by
981 scheduling. Specifically, the update of the frame pointer must
982 happen immediately, not later. */
984 }
986 /* __builtin_longjmp is passed a pointer to an array of five words (not
987 all will be used on all machines). It operates similarly to the C
988 library function of the same name, but is more efficient. Much of
989 the code below is copied from the handling of non-local gotos. */
991 static void
993 {
998 /* DRAP is needed for stack realign if longjmp is expanded to current
999 function */
1010 /* We require that the user must pass a second argument of 1, because
1011 that is what builtin_setjmp will return. */
1017 else
1018 {
1029 /* Pick up FP, label, and SP from the block and jump. This code is
1030 from expand_goto in stmt.cc; see there for detailed comments. */
1032 /* We have to pass a value to the nonlocal_goto pattern that will
1033 get copied into the static_chain pointer, but it does not matter
1034 what that value is, because builtin_setjmp does not use it. */
1036 else
1037 {
1043 /* Restore the frame pointer and stack pointer. We must use a
1044 temporary since the setjmp buffer may be a local. */
1048 /* Ensure the frame pointer move is not optimized. */
1057 }
1058 }
1060 /* Search backwards and mark the jump insn as a non-local goto.
1061 Note that this precludes the use of __builtin_longjmp to a
1062 __builtin_setjmp target in the same function. However, we've
1063 already cautioned the user that these functions are for
1064 internal exception handling use only. */
1066 {
1070 {
1073 }
1076 }
1077 }
1081 {
1083 }
1085 /* This function validates the types of a function call argument list
1086 against a specified list of tree_codes. If the last specifier is a 0,
1087 that represents an ellipsis, otherwise the last specifier must be a
1088 VOID_TYPE. */
1090 static bool
1092 {
1096 const_call_expr_arg_iterator iter;
1097 const_tree arg;
1102 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1107 {
1111 {
1113 /* This signifies an ellipses, any further arguments are all ok. */
1117 /* This signifies an endlink, if no arguments remain, return
1118 true, otherwise return false. */
1122 /* The actual argument must be nonnull when either the whole
1123 called function has been declared nonnull, or when the formal
1124 argument corresponding to the actual argument has been. */
1127 {
1132 }
1133 /* FALLTHRU */
1135 /* If no parameters remain or the parameter's code does not
1136 match the specified code, return false. Otherwise continue
1137 checking any remaining arguments. */
1142 }
1143 }
1145 /* We need gotos here since we can only have one VA_CLOSE in a
1146 function. */
1147 end: ;
1153 }
1155 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1156 and the address of the save area. */
1158 static rtx
1160 {
1175 /* Copy the address of the save location to a register just in case it was
1176 based on the frame pointer. */
1185 /* ??? We no longer need to pass the static chain value, afaik. */
1188 else
1189 {
1195 /* Restore the frame pointer and stack pointer. We must use a
1196 temporary since the setjmp buffer may be a local. */
1200 /* Ensure the frame pointer move is not optimized. */
1206 /* USE of hard_frame_pointer_rtx added for consistency;
1207 not clear if really needed. */
1211 /* If the architecture is using a GP register, we must
1212 conservatively assume that the target function makes use of it.
1213 The prologue of functions with nonlocal gotos must therefore
1214 initialize the GP register to the appropriate value, and we
1215 must then make sure that this value is live at the point
1216 of the jump. (Note that this doesn't necessarily apply
1217 to targets with a nonlocal_goto pattern; they are free
1218 to implement it in their own way. Note also that this is
1219 a no-op if the GP register is a global invariant.) */
1225 }
1227 /* Search backwards to the jump insn and mark it as a
1228 non-local goto. */
1230 {
1232 {
1235 }
1238 }
1241 }
1243 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1244 (not all will be used on all machines) that was passed to __builtin_setjmp.
1245 It updates the stack pointer in that block to the current value. This is
1246 also called directly by the SJLJ exception handling code. */
1248 void
1250 {
1253 rtx stack_save
1255 memory_address
1261 }
1263 /* Expand a call to __builtin_prefetch. For a target that does not support
1264 data prefetch, evaluate the memory address argument in case it has side
1265 effects. */
1267 static void
1269 {
1279 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1280 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1281 locality). */
1285 else
1289 else
1292 /* Argument 0 is an address. */
1295 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1297 {
1300 }
1302 /* Argument 1 must be either zero or one. */
1304 {
1308 }
1310 /* Argument 2 (locality) must be a compile-time constant int. */
1312 {
1315 }
1317 /* Argument 2 must be 0, 1, 2, or 3. */
1319 {
1322 }
1325 {
1333 }
1335 /* Don't do anything with direct references to volatile memory, but
1336 generate code to handle other side effects. */
1339 }
1341 /* Get a MEM rtx for expression EXP which is the address of an operand
1342 to be used in a string instruction (cmpstrsi, cpymemsi, ..). LEN is
1343 the maximum length of the block of memory that might be accessed or
1344 NULL if unknown. */
1346 rtx
1348 {
1352 gcc_checking_assert
1355 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1356 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1363 /* Get an expression we can use to find the attributes to assign to MEM.
1364 First remove any nops. */
1369 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1370 (as builtin stringops may alias with anything). */
1377 /* If the MEM_REF has no acceptable address, try to get the base object
1378 from the original address we got, and build an all-aliasing
1379 unknown-sized access to that one. */
1385 {
1391 size_zero_node,
1392 NULL)),
1395 /* Since we stripped parts make sure the offset is unknown and the
1396 alignment is computed from the original address. */
1399 }
1402 }
1403 \f
1404 /* Built-in functions to perform an untyped call and return. */
1406 /* Wrapper that implicitly applies a delta when getting or setting the
1407 enclosed value. */
1409 class delta_type
1410 {
1416 };
1418 #define saved_apply_args_size \
1419 (delta_type<int> (this_target_builtins->x_apply_args_size_plus_one, -1))
1420 #define apply_args_mode \
1421 (this_target_builtins->x_apply_args_mode)
1422 #define saved_apply_result_size \
1423 (delta_type<int> (this_target_builtins->x_apply_result_size_plus_one, -1))
1424 #define apply_result_mode \
1425 (this_target_builtins->x_apply_result_mode)
1427 /* Return the size required for the block returned by __builtin_apply_args,
1428 and initialize apply_args_mode. */
1430 static int
1432 {
1437 /* The values computed by this function never change. */
1439 {
1440 /* The first value is the incoming arg-pointer. */
1443 /* The second value is the structure value address unless this is
1444 passed as an "invisible" first argument. */
1450 {
1454 {
1460 }
1461 else
1463 }
1464 else
1468 }
1470 }
1472 /* Return the size required for the block returned by __builtin_apply,
1473 and initialize apply_result_mode. */
1475 static int
1477 {
1481 /* The values computed by this function never change. */
1483 {
1488 {
1492 {
1498 }
1499 else
1501 }
1502 else
1505 /* Allow targets that use untyped_call and untyped_return to override
1506 the size so that machine-specific information can be stored here. */
1507 #ifdef APPLY_RESULT_SIZE
1509 #endif
1512 }
1514 }
1516 /* Create a vector describing the result block RESULT. If SAVEP is true,
1517 the result block is used to save the values; otherwise it is used to
1518 restore the values. */
1520 static rtx
1522 {
1524 fixed_size_mode mode;
1531 {
1541 }
1543 }
1545 /* Save the state required to perform an untyped call with the same
1546 arguments as were passed to the current function. */
1548 static rtx
1550 {
1553 fixed_size_mode mode;
1554 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1556 /* Create a block where the arg-pointer, structure value address,
1557 and argument registers can be saved. */
1560 /* Walk past the arg-pointer and structure value address. */
1565 /* Save each register used in calling a function to the block. */
1568 {
1577 }
1579 /* Save the arg pointer to the block. */
1581 /* We need the pointer as the caller actually passed them to us, not
1582 as we might have pretended they were passed. Make sure it's a valid
1583 operand, as emit_move_insn isn't expected to handle a PLUS. */
1585 tem
1588 NULL_RTX);
1593 /* Save the structure value address unless this is passed as an
1594 "invisible" first argument. */
1599 /* Return the address of the block. */
1601 }
1603 /* __builtin_apply_args returns block of memory allocated on
1604 the stack into which is stored the arg pointer, structure
1605 value address, static chain, and all the registers that might
1606 possibly be used in performing a function call. The code is
1607 moved to the start of the function so the incoming values are
1608 saved. */
1610 static rtx
1612 {
1613 /* Don't do __builtin_apply_args more than once in a function.
1614 Save the result of the first call and reuse it. */
1617 {
1618 /* When this function is called, it means that registers must be
1619 saved on entry to this function. So we migrate the
1620 call to the first insn of this function. */
1621 rtx temp;
1630 /* Put the insns after the NOTE that starts the function.
1631 If this is inside a start_sequence, make the outer-level insn
1632 chain current, so the code is placed at the start of the
1633 function. If internal_arg_pointer is a non-virtual pseudo,
1634 it needs to be placed after the function that initializes
1635 that pseudo. */
1640 else
1644 }
1645 }
1647 /* Perform an untyped call and save the state required to perform an
1648 untyped return of whatever value was returned by the given function. */
1650 static rtx
1652 {
1654 fixed_size_mode mode;
1663 /* Create a block where the return registers can be saved. */
1666 /* Fetch the arg pointer from the ARGUMENTS block. */
1673 /* Push a new argument block and copy the arguments. Do not allow
1674 the (potential) memcpy call below to interfere with our stack
1675 manipulations. */
1677 NO_DEFER_POP;
1679 /* Save the stack with nonlocal if available. */
1682 else
1685 /* Allocate a block of memory onto the stack and copy the memory
1686 arguments to the outgoing arguments address. We can pass TRUE
1687 as the 4th argument because we just saved the stack pointer
1688 and will restore it right after the call. */
1691 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1692 may have already set current_function_calls_alloca to true.
1693 current_function_calls_alloca won't be set if argsize is zero,
1694 so we have to guarantee need_drap is true here. */
1700 {
1703 else
1705 }
1712 /* Refer to the argument block. */
1717 /* Walk past the arg-pointer and structure value address. */
1722 /* Restore each of the registers previously saved. Make USE insns
1723 for each of these registers for use in making the call. */
1726 {
1734 }
1736 /* Restore the structure value address unless this is passed as an
1737 "invisible" first argument. */
1740 {
1746 }
1748 /* All arguments and registers used for the call are set up by now! */
1751 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1752 and we don't want to load it into a register as an optimization,
1753 because prepare_call_address already did it if it should be done. */
1757 /* Generate the actual call instruction and save the return value. */
1759 {
1767 }
1769 {
1772 /* Locate the unique return register. It is not possible to
1773 express a call that sets more than one return register using
1774 call_value; use untyped_call for that. In fact, untyped_call
1775 only needs to save the return registers in the given block. */
1778 {
1782 }
1789 }
1790 else
1793 /* Find the CALL insn we just emitted, and attach the register usage
1794 information. */
1798 /* Restore the stack. */
1801 else
1805 OK_DEFER_POP;
1807 /* Return the address of the result block. */
1810 }
1812 /* Perform an untyped return. */
1814 static void
1816 {
1818 fixed_size_mode mode;
1819 rtx reg;
1828 {
1833 }
1835 /* Restore the return value and note that each value is used. */
1839 {
1851 }
1853 /* Put the USE insns before the return. */
1856 /* Return whatever values was restored by jumping directly to the end
1857 of the function. */
1859 }
1861 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1863 int
1865 {
1867 {
1889 }
1890 }
1892 /* Expand a call EXP to __builtin_classify_type. */
1894 static rtx
1896 {
1900 }
1902 /* This helper macro, meant to be used in mathfn_built_in below, determines
1903 which among a set of builtin math functions is appropriate for a given type
1904 mode. The `F' (float) and `L' (long double) are automatically generated
1905 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1906 types, there are additional types that are considered with 'F32', 'F64',
1907 'F128', etc. suffixes. */
1908 #define CASE_MATHFN(MATHFN) \
1909 CASE_CFN_##MATHFN: \
1910 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1911 fcodel = BUILT_IN_##MATHFN##L ; break;
1912 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1913 types. */
1914 #define CASE_MATHFN_FLOATN(MATHFN) \
1915 CASE_CFN_##MATHFN: \
1916 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1917 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1918 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1919 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1920 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1921 break;
1922 /* Similar to above, but appends _R after any F/L suffix. */
1923 #define CASE_MATHFN_REENT(MATHFN) \
1924 case CFN_BUILT_IN_##MATHFN##_R: \
1925 case CFN_BUILT_IN_##MATHFN##F_R: \
1926 case CFN_BUILT_IN_##MATHFN##L_R: \
1927 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1928 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1930 /* Return a function equivalent to FN but operating on floating-point
1931 values of type TYPE, or END_BUILTINS if no such function exists.
1932 This is purely an operation on function codes; it does not guarantee
1933 that the target actually has an implementation of the function. */
1935 static built_in_function
1937 {
1938 tree mtype;
1948 /* If <math.h> has been included somehow, HUGE_VAL and NAN definitions
1949 break the uses below. */
1950 #undef HUGE_VAL
1951 #undef NAN
1954 {
1955 #define SEQ_OF_CASE_MATHFN \
1956 CASE_MATHFN_FLOATN (ACOS) \
1957 CASE_MATHFN_FLOATN (ACOSH) \
1958 CASE_MATHFN_FLOATN (ASIN) \
1959 CASE_MATHFN_FLOATN (ASINH) \
1960 CASE_MATHFN_FLOATN (ATAN) \
1961 CASE_MATHFN_FLOATN (ATAN2) \
1962 CASE_MATHFN_FLOATN (ATANH) \
1963 CASE_MATHFN_FLOATN (CBRT) \
1964 CASE_MATHFN_FLOATN (CEIL) \
1965 CASE_MATHFN (CEXPI) \
1966 CASE_MATHFN_FLOATN (COPYSIGN) \
1967 CASE_MATHFN_FLOATN (COS) \
1968 CASE_MATHFN_FLOATN (COSH) \
1969 CASE_MATHFN (DREM) \
1970 CASE_MATHFN_FLOATN (ERF) \
1971 CASE_MATHFN_FLOATN (ERFC) \
1972 CASE_MATHFN_FLOATN (EXP) \
1973 CASE_MATHFN (EXP10) \
1974 CASE_MATHFN_FLOATN (EXP2) \
1975 CASE_MATHFN_FLOATN (EXPM1) \
1976 CASE_MATHFN_FLOATN (FABS) \
1977 CASE_MATHFN_FLOATN (FDIM) \
1978 CASE_MATHFN_FLOATN (FLOOR) \
1979 CASE_MATHFN_FLOATN (FMA) \
1980 CASE_MATHFN_FLOATN (FMAX) \
1981 CASE_MATHFN_FLOATN (FMIN) \
1982 CASE_MATHFN_FLOATN (FMOD) \
1983 CASE_MATHFN_FLOATN (FREXP) \
1984 CASE_MATHFN (GAMMA) \
1986 CASE_MATHFN_FLOATN (HUGE_VAL) \
1987 CASE_MATHFN_FLOATN (HYPOT) \
1988 CASE_MATHFN_FLOATN (ILOGB) \
1989 CASE_MATHFN (ICEIL) \
1990 CASE_MATHFN (IFLOOR) \
1991 CASE_MATHFN_FLOATN (INF) \
1992 CASE_MATHFN (IRINT) \
1993 CASE_MATHFN (IROUND) \
1994 CASE_MATHFN (ISINF) \
1995 CASE_MATHFN (J0) \
1996 CASE_MATHFN (J1) \
1997 CASE_MATHFN (JN) \
1998 CASE_MATHFN (LCEIL) \
1999 CASE_MATHFN_FLOATN (LDEXP) \
2000 CASE_MATHFN (LFLOOR) \
2001 CASE_MATHFN_FLOATN (LGAMMA) \
2003 CASE_MATHFN (LLCEIL) \
2004 CASE_MATHFN (LLFLOOR) \
2005 CASE_MATHFN_FLOATN (LLRINT) \
2006 CASE_MATHFN_FLOATN (LLROUND) \
2007 CASE_MATHFN_FLOATN (LOG) \
2008 CASE_MATHFN_FLOATN (LOG10) \
2009 CASE_MATHFN_FLOATN (LOG1P) \
2010 CASE_MATHFN_FLOATN (LOG2) \
2011 CASE_MATHFN_FLOATN (LOGB) \
2012 CASE_MATHFN_FLOATN (LRINT) \
2013 CASE_MATHFN_FLOATN (LROUND) \
2014 CASE_MATHFN_FLOATN (MODF) \
2015 CASE_MATHFN_FLOATN (NAN) \
2016 CASE_MATHFN_FLOATN (NANS) \
2017 CASE_MATHFN_FLOATN (NEARBYINT) \
2018 CASE_MATHFN_FLOATN (NEXTAFTER) \
2019 CASE_MATHFN (NEXTTOWARD) \
2020 CASE_MATHFN_FLOATN (POW) \
2021 CASE_MATHFN (POWI) \
2022 CASE_MATHFN (POW10) \
2023 CASE_MATHFN_FLOATN (REMAINDER) \
2024 CASE_MATHFN_FLOATN (REMQUO) \
2025 CASE_MATHFN_FLOATN (RINT) \
2026 CASE_MATHFN_FLOATN (ROUND) \
2027 CASE_MATHFN_FLOATN (ROUNDEVEN) \
2028 CASE_MATHFN (SCALB) \
2029 CASE_MATHFN_FLOATN (SCALBLN) \
2030 CASE_MATHFN_FLOATN (SCALBN) \
2031 CASE_MATHFN (SIGNBIT) \
2032 CASE_MATHFN (SIGNIFICAND) \
2033 CASE_MATHFN_FLOATN (SIN) \
2034 CASE_MATHFN (SINCOS) \
2035 CASE_MATHFN_FLOATN (SINH) \
2036 CASE_MATHFN_FLOATN (SQRT) \
2037 CASE_MATHFN_FLOATN (TAN) \
2038 CASE_MATHFN_FLOATN (TANH) \
2039 CASE_MATHFN_FLOATN (TGAMMA) \
2040 CASE_MATHFN_FLOATN (TRUNC) \
2041 CASE_MATHFN (Y0) \
2042 CASE_MATHFN (Y1) \
2043 CASE_MATHFN (YN)
2045 SEQ_OF_CASE_MATHFN
2049 }
2072 else
2074 }
2076 #undef CASE_MATHFN
2077 #undef CASE_MATHFN_FLOATN
2078 #undef CASE_MATHFN_REENT
2080 /* Return mathematic function equivalent to FN but operating directly on TYPE,
2081 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2082 otherwise use the explicit declaration. If we can't do the conversion,
2083 return null. */
2085 static tree
2087 {
2096 }
2098 /* Like mathfn_built_in_1, but always use the implicit array. */
2100 tree
2102 {
2104 }
2106 /* Like mathfn_built_in_1, but always use the explicit array. */
2108 tree
2110 {
2112 }
2114 /* Like mathfn_built_in_1, but take a built_in_function and
2115 always use the implicit array. */
2117 tree
2119 {
2121 }
2123 /* Return the type associated with a built in function, i.e., the one
2124 to be passed to mathfn_built_in to get the type-specific
2125 function. */
2127 tree
2129 {
2130 #define CASE_MATHFN(MATHFN) \
2131 case CFN_BUILT_IN_##MATHFN: \
2132 return double_type_node; \
2133 case CFN_BUILT_IN_##MATHFN##F: \
2134 return float_type_node; \
2135 case CFN_BUILT_IN_##MATHFN##L: \
2136 return long_double_type_node;
2138 #define CASE_MATHFN_FLOATN(MATHFN) \
2139 CASE_MATHFN(MATHFN) \
2140 case CFN_BUILT_IN_##MATHFN##F16: \
2141 return float16_type_node; \
2142 case CFN_BUILT_IN_##MATHFN##F32: \
2143 return float32_type_node; \
2144 case CFN_BUILT_IN_##MATHFN##F64: \
2145 return float64_type_node; \
2146 case CFN_BUILT_IN_##MATHFN##F128: \
2147 return float128_type_node; \
2148 case CFN_BUILT_IN_##MATHFN##F32X: \
2149 return float32x_type_node; \
2150 case CFN_BUILT_IN_##MATHFN##F64X: \
2151 return float64x_type_node; \
2152 case CFN_BUILT_IN_##MATHFN##F128X: \
2153 return float128x_type_node;
2155 /* Similar to above, but appends _R after any F/L suffix. */
2156 #define CASE_MATHFN_REENT(MATHFN) \
2157 case CFN_BUILT_IN_##MATHFN##_R: \
2158 return double_type_node; \
2159 case CFN_BUILT_IN_##MATHFN##F_R: \
2160 return float_type_node; \
2161 case CFN_BUILT_IN_##MATHFN##L_R: \
2162 return long_double_type_node;
2165 {
2166 SEQ_OF_CASE_MATHFN
2170 }
2172 #undef CASE_MATHFN
2173 #undef CASE_MATHFN_FLOATN
2174 #undef CASE_MATHFN_REENT
2175 #undef SEQ_OF_CASE_MATHFN
2176 }
2178 /* Check whether there is an internal function associated with function FN
2179 and return type RETURN_TYPE. Return the function if so, otherwise return
2180 IFN_LAST.
2182 Note that this function only tests whether the function is defined in
2183 internals.def, not whether it is actually available on the target. */
2185 static internal_fn
2187 {
2189 {
2190 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2191 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2192 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2193 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2194 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2195 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2196 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2213 }
2214 }
2216 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2217 return its code, otherwise return IFN_LAST. Note that this function
2218 only tests whether the function is defined in internals.def, not whether
2219 it is actually available on the target. */
2221 internal_fn
2223 {
2227 }
2229 /* Check whether there is an internal function associated with function CFN
2230 and return type RETURN_TYPE. Return the function if so, otherwise return
2231 IFN_LAST.
2233 Note that this function only tests whether the function is defined in
2234 internals.def, not whether it is actually available on the target. */
2236 internal_fn
2238 {
2242 }
2244 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2245 on the current target by a call to an internal function, return the
2246 code of that internal function, otherwise return IFN_LAST. The caller
2247 is responsible for ensuring that any side-effects of the built-in
2248 call are dealt with correctly. E.g. if CALL sets errno, the caller
2249 must decide that the errno result isn't needed or make it available
2250 in some other way. */
2252 internal_fn
2254 {
2256 {
2259 {
2264 }
2265 }
2267 }
2269 /* Expand a call to the builtin trinary math functions (fma).
2270 Return NULL_RTX if a normal call should be emitted rather than expanding the
2271 function in-line. EXP is the expression that is a call to the builtin
2272 function; if convenient, the result should be placed in TARGET.
2273 SUBTARGET may be used as the target for computing one of EXP's
2274 operands. */
2276 static rtx
2278 {
2279 optab builtin_optab;
2284 machine_mode mode;
2294 {
2300 }
2302 /* Make a suitable register to place result in. */
2305 /* Before working hard, check whether the instruction is available. */
2311 /* Always stabilize the argument list. */
2322 /* Compute into RESULT.
2323 Set RESULT to wherever the result comes back. */
2327 /* If we were unable to expand via the builtin, stop the sequence
2328 (without outputting the insns) and call to the library function
2329 with the stabilized argument list. */
2331 {
2334 }
2336 /* Output the entire sequence. */
2342 }
2344 /* Expand a call to the builtin sin and cos math functions.
2345 Return NULL_RTX if a normal call should be emitted rather than expanding the
2346 function in-line. EXP is the expression that is a call to the builtin
2347 function; if convenient, the result should be placed in TARGET.
2348 SUBTARGET may be used as the target for computing one of EXP's
2349 operands. */
2351 static rtx
2353 {
2354 optab builtin_optab;
2355 rtx op0;
2358 machine_mode mode;
2359 tree arg;
2367 {
2373 }
2375 /* Make a suitable register to place result in. */
2378 /* Check if sincos insn is available, otherwise fallback
2379 to sin or cos insn. */
2382 {
2389 }
2391 /* Before working hard, check whether the instruction is available. */
2393 {
2396 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2397 need to expand the argument again. This way, we will not perform
2398 side-effects more the once. */
2405 /* Compute into RESULT.
2406 Set RESULT to wherever the result comes back. */
2408 {
2412 {
2421 }
2423 }
2424 else
2428 {
2429 /* Output the entire sequence. */
2434 }
2436 /* If we were unable to expand via the builtin, stop the sequence
2437 (without outputting the insns) and call to the library function
2438 with the stabilized argument list. */
2440 }
2443 }
2445 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2446 return an RTL instruction code that implements the functionality.
2447 If that isn't possible or available return CODE_FOR_nothing. */
2449 static enum insn_code
2451 {
2454 machine_mode mode;
2457 {
2471 /* These builtins have no optabs (yet). */
2475 }
2477 /* There's no easy way to detect the case we need to set EDOM. */
2481 /* Optab mode depends on the mode of the input argument. */
2487 }
2489 /* Expand a call to one of the builtin math functions that operate on
2490 floating point argument and output an integer result (ilogb, isinf,
2491 isnan, etc).
2492 Return 0 if a normal call should be emitted rather than expanding the
2493 function in-line. EXP is the expression that is a call to the builtin
2494 function; if convenient, the result should be placed in TARGET. */
2496 static rtx
2498 {
2500 rtx op0;
2502 machine_mode mode;
2503 tree arg;
2513 {
2518 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2519 need to expand the argument again. This way, we will not perform
2520 side-effects more the once. */
2535 }
2538 }
2540 /* Expand a call to the builtin sincos math function.
2541 Return NULL_RTX if a normal call should be emitted rather than expanding the
2542 function in-line. EXP is the expression that is a call to the builtin
2543 function. */
2545 static rtx
2547 {
2549 machine_mode mode;
2563 /* Make a suitable register to place result in. */
2566 /* Check if sincos insn is available, otherwise emit the call. */
2581 /* Compute into target1 and target2.
2582 Set TARGET to wherever the result comes back. */
2586 /* Move target1 and target2 to the memory locations indicated
2587 by op1 and op2. */
2592 }
2594 /* Expand call EXP to the fegetround builtin (from C99 fenv.h), returning the
2595 result and setting it in TARGET. Otherwise return NULL_RTX on failure. */
2596 static rtx
2598 {
2617 }
2619 /* Expand call EXP to either feclearexcept or feraiseexcept builtins (from C99
2620 fenv.h), returning the result and setting it in TARGET. Otherwise return
2621 NULL_RTX on failure. */
2622 static rtx
2625 {
2648 }
2650 /* Expand a call to the internal cexpi builtin to the sincos math function.
2651 EXP is the expression that is a call to the builtin function; if convenient,
2652 the result should be placed in TARGET. */
2654 static rtx
2656 {
2659 machine_mode mode;
2670 /* Try expanding via a sincos optab, fall back to emitting a libcall
2671 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2672 is only generated from sincos, cexp or if we have either of them. */
2674 {
2680 /* Compute into op1 and op2. */
2682 }
2684 {
2695 else
2705 /* Make sure not to fold the sincos call again. */
2709 }
2710 else
2711 {
2721 else
2724 /* If we don't have a decl for cexp create one. This is the
2725 friendliest fallback if the user calls __builtin_cexpi
2726 without full target C99 function support. */
2728 {
2729 tree fntype;
2741 }
2746 /* Make sure not to fold the cexp call again. */
2750 }
2752 /* Now build the proper return type. */
2757 }
2759 /* Conveniently construct a function call expression. FNDECL names the
2760 function to be called, N is the number of arguments, and the "..."
2761 parameters are the argument expressions. Unlike build_call_exr
2762 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2764 static tree
2766 {
2776 }
2778 /* Expand the __builtin_issignaling builtin. This needs to handle
2779 all floating point formats that do support NaNs (for those that
2780 don't it just sets target to 0). */
2782 static rtx
2784 {
2792 /* Expand the argument yielding a RTX expression. */
2795 /* If mode doesn't support NaN, always return 0.
2796 Don't use !HONOR_SNANS (fmode) here, so there is some possibility of
2797 __builtin_issignaling working without -fsignaling-nans. Especially
2798 when -fno-signaling-nans is the default.
2799 On the other side, MODE_HAS_NANS (fmode) is unnecessary, with
2800 -ffinite-math-only even __builtin_isnan or __builtin_fpclassify
2801 fold to 0 or non-NaN/Inf classification. */
2803 {
2806 }
2808 /* Check if the back end provides an insn that handles issignaling for the
2809 argument's mode. */
2812 {
2818 }
2821 {
2822 scalar_int_mode imode;
2823 rtx hi;
2825 {
2834 /* For decimal128, TImode support isn't always there and even when
2835 it is, working on the DImode high part is usually better. */
2837 {
2840 fmode)))
2842 else
2843 {
2844 scalar_int_mode imode2;
2846 {
2852 }
2853 }
2855 {
2859 }
2860 }
2862 {
2863 poly_int64 offset
2866 }
2871 }
2872 /* In all of decimal{32,64,128}, there is MSB sign bit and sNaN
2873 have 6 bits below it all set. */
2874 rtx val
2880 }
2882 /* Only PDP11 has these defined differently but doesn't support NaNs. */
2890 {
2892 /* For IBM double double, recurse on the most significant double. */
2897 /* FALLTHRU */
2904 {
2910 {
2913 /* For non-MIPS/PA IEEE single/double/half or bfloat, expand to:
2914 ((temp ^ bit) & mask) > val. */
2921 }
2922 else
2923 {
2924 /* For MIPS/PA IEEE single/double, expand to:
2925 (temp & val) == val. */
2930 }
2931 }
2934 {
2937 /* For IEEE quad, TImode support isn't always there and even when
2938 it is, working on DImode parts is usually better. */
2940 {
2946 {
2947 scalar_int_mode imode2;
2949 {
2953 imode2));
2956 imode2));
2957 }
2958 }
2960 {
2964 }
2965 }
2967 {
2968 poly_int64 offset
2973 }
2977 {
2981 /* For non-MIPS/PA IEEE quad, expand to:
2982 (((hi ^ bit) | ((lo | -lo) >> 63)) & mask) > val. */
2995 }
2996 else
2997 {
2998 /* For MIPS/PA IEEE quad, expand to:
2999 (hi & val) == val. */
3004 }
3005 }
3008 extended:
3009 {
3014 {
3018 }
3020 {
3021 /* Motorola, always big endian, with 16-bit gap in between
3022 16-bit sign+exponent and 64-bit mantissa. */
3026 }
3028 {
3029 /* Intel little endian, 64-bit mantissa followed by 16-bit
3030 sign+exponent and then either 16 or 48 bits of gap. */
3034 }
3035 else
3036 {
3037 /* Big endian Itanium. */
3041 }
3046 /* For Intel/Motorola extended format, expand to:
3047 (ex & mask) == mask && ((hi ^ bit) | ((lo | -lo) >> 31)) > val. */
3063 }
3067 }
3070 }
3072 /* Expand a call to one of the builtin rounding functions gcc defines
3073 as an extension (lfloor and lceil). As these are gcc extensions we
3074 do not need to worry about setting errno to EDOM.
3075 If expanding via optab fails, lower expression to (int)(floor(x)).
3076 EXP is the expression that is a call to the builtin function;
3077 if convenient, the result should be placed in TARGET. */
3079 static rtx
3081 {
3082 convert_optab builtin_optab;
3087 tree fallback_fndecl;
3088 machine_mode mode;
3089 tree arg;
3097 {
3114 }
3116 /* Make a suitable register to place result in. */
3121 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
3122 need to expand the argument again. This way, we will not perform
3123 side-effects more the once. */
3130 /* Compute into TARGET. */
3132 {
3133 /* Output the entire sequence. */
3138 }
3140 /* If we were unable to expand via the builtin, stop the sequence
3141 (without outputting the insns). */
3144 /* Fall back to floating point rounding optab. */
3147 /* For non-C99 targets we may end up without a fallback fndecl here
3148 if the user called __builtin_lfloor directly. In this case emit
3149 a call to the floor/ceil variants nevertheless. This should result
3150 in the best user experience for not full C99 targets. */
3152 {
3153 tree fntype;
3157 {
3190 }
3195 }
3202 /* Truncate the result of floating point optab to integer
3203 via expand_fix (). */
3208 }
3210 /* Expand a call to one of the builtin math functions doing integer
3211 conversion (lrint).
3212 Return 0 if a normal call should be emitted rather than expanding the
3213 function in-line. EXP is the expression that is a call to the builtin
3214 function; if convenient, the result should be placed in TARGET. */
3216 static rtx
3218 {
3219 convert_optab builtin_optab;
3220 rtx op0;
3223 tree arg;
3224 machine_mode mode;
3233 {
3252 }
3254 /* There's no easy way to detect the case we need to set EDOM. */
3258 /* Make a suitable register to place result in. */
3261 /* There's no easy way to detect the case we need to set EDOM. */
3263 {
3266 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
3267 need to expand the argument again. This way, we will not perform
3268 side-effects more the once. */
3276 {
3277 /* Output the entire sequence. */
3282 }
3284 /* If we were unable to expand via the builtin, stop the sequence
3285 (without outputting the insns) and call to the library function
3286 with the stabilized argument list. */
3288 }
3291 {
3292 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
3293 targets, (int) round (x) should never be transformed into
3294 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
3295 a call to lround in the hope that the target provides at least some
3296 C99 functions. This should result in the best user experience for
3297 not full C99 targets.
3298 As scalar float conversions with same mode are useless in GIMPLE,
3299 we can end up e.g. with _Float32 argument passed to float builtin,
3300 try to get the type from the builtin prototype first. */
3303 fallback_fndecl
3307 fallback_fndecl
3311 {
3318 }
3319 }
3322 }
3324 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
3325 a normal call should be emitted rather than expanding the function
3326 in-line. EXP is the expression that is a call to the builtin
3327 function; if convenient, the result should be placed in TARGET. */
3329 static rtx
3331 {
3334 machine_mode mode;
3335 machine_mode mode2;
3344 /* Emit a libcall to libgcc. */
3346 /* Mode of the 2nd argument must match that of an int. */
3364 }
3366 /* Expand expression EXP which is a call to the strlen builtin. Return
3367 NULL_RTX if we failed and the caller should emit a normal call, otherwise
3368 try to get the result in TARGET, if convenient. */
3370 static rtx
3372 machine_mode target_mode)
3373 {
3379 /* If the length can be computed at compile-time, return it. */
3383 /* If the length can be computed at compile-time and is constant
3384 integer, but there are side-effects in src, evaluate
3385 src for side-effects, then return len.
3386 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
3387 can be optimized into: i++; x = 3; */
3390 {
3393 }
3397 /* If SRC is not a pointer type, don't do this operation inline. */
3401 /* Bail out if we can't compute strlen in the right mode. */
3402 machine_mode insn_mode;
3405 {
3409 }
3413 /* Make a place to hold the source address. We will not expand
3414 the actual source until we are sure that the expansion will
3415 not fail -- there are trees that cannot be expanded twice. */
3418 /* Mark the beginning of the strlen sequence so we can emit the
3419 source operand later. */
3430 /* Check to see if the argument was declared attribute nonstring
3431 and if so, issue a warning since at this point it's not known
3432 to be nul-terminated. */
3435 /* Now that we are assured of success, expand the source. */
3439 {
3440 #ifdef POINTERS_EXTEND_UNSIGNED
3443 POINTERS_EXTEND_UNSIGNED);
3444 #endif
3446 }
3452 else
3455 /* Return the value in the proper mode for this function. */
3460 else
3464 }
3466 /* Expand call EXP to the strnlen built-in, returning the result
3467 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
3469 static rtx
3471 {
3485 /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
3486 so these conversions aren't necessary. */
3487 c_strlen_data lendata = { };
3493 {
3499 }
3505 value_range r;
3513 {
3518 }
3528 }
3530 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3531 bytes from bytes at DATA + OFFSET and return it reinterpreted as
3532 a target constant. */
3534 static rtx
3536 fixed_size_mode mode)
3537 {
3538 /* The REPresentation pointed to by DATA need not be a nul-terminated
3539 string but the caller guarantees it's large enough for MODE. */
3543 }
3545 /* LEN specify length of the block of memcpy/memset operation.
3546 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3547 In some cases we can make very likely guess on max size, then we
3548 set it into PROBABLE_MAX_SIZE. */
3550 static void
3555 {
3557 {
3560 }
3561 else
3562 {
3566 /* Determine bounds from the type. */
3569 else
3574 else
3578 {
3579 value_range r;
3584 {
3587 }
3588 }
3590 {
3595 }
3597 {
3598 /* Code like
3600 int n;
3601 if (n < 100)
3602 memcpy (a, b, n)
3604 Produce anti range allowing negative values of N. We still
3605 can use the information and make a guess that N is not negative.
3606 */
3609 }
3610 }
3614 }
3616 /* Expand a call EXP to the memcpy builtin.
3617 Return NULL_RTX if we failed, the caller should emit a normal call,
3618 otherwise try to get the result in TARGET, if convenient (and in
3619 mode MODE if that's convenient). */
3621 static rtx
3623 {
3634 }
3636 /* Check a call EXP to the memmove built-in for validity.
3637 Return NULL_RTX on both success and failure. */
3639 static rtx
3641 {
3652 }
3654 /* Expand a call EXP to the mempcpy builtin.
3655 Return NULL_RTX if we failed; the caller should emit a normal call,
3656 otherwise try to get the result in TARGET, if convenient (and in
3657 mode MODE if that's convenient). */
3659 static rtx
3661 {
3670 /* Policy does not generally allow using compute_objsize (which
3671 is used internally by check_memop_size) to change code generation
3672 or drive optimization decisions.
3674 In this instance it is safe because the code we generate has
3675 the same semantics regardless of the return value of
3676 check_memop_sizes. Exactly the same amount of data is copied
3677 and the return value is exactly the same in both cases.
3679 Furthermore, check_memop_size always uses mode 0 for the call to
3680 compute_objsize, so the imprecise nature of compute_objsize is
3681 avoided. */
3683 /* Avoid expanding mempcpy into memcpy when the call is determined
3684 to overflow the buffer. This also prevents the same overflow
3685 from being diagnosed again when expanding memcpy. */
3689 }
3691 /* Helper function to do the actual work for expand of memory copy family
3692 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3693 of memory from SRC to DEST and assign to TARGET if convenient. Return
3694 value is based on RETMODE argument. */
3696 static rtx
3700 {
3712 /* If DEST is not a pointer type, call the normal function. */
3716 /* If either SRC is not a pointer type, don't do this
3717 operation in-line. */
3733 /* Try to get the byte representation of the constant SRC points to,
3734 with its byte size in NBYTES. */
3738 /* If the function's constant bound LEN_RTX is less than or equal
3739 to the byte size of the representation of the constant argument,
3740 and if block move would be done by pieces, we can avoid loading
3741 the bytes from memory and only store the computed constant.
3742 This works in the overlap (memmove) case as well because
3743 store_by_pieces just generates a series of stores of constants
3744 from the representation returned by getbyterep(). */
3751 {
3753 builtin_memcpy_read_str,
3759 }
3764 /* Copy word part most expediently. */
3771 && !might_overlap
3781 /* Bail out when a mempcpy call would be expanded as libcall and when
3782 we have a target that provides a fast implementation
3783 of mempcpy routine. */
3791 {
3794 }
3797 {
3799 /* stpcpy pointer to last byte. */
3802 }
3805 }
3807 static rtx
3810 {
3813 }
3815 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3816 we failed, the caller should emit a normal call, otherwise try to
3817 get the result in TARGET, if convenient.
3818 Return value is based on RETMODE argument. */
3820 static rtx
3822 {
3824 rtx dest_mem;
3825 rtx src_mem;
3833 {
3836 }
3846 {
3848 /* movstr is supposed to set end to the address of the NUL
3849 terminator. If the caller requested a mempcpy-like return value,
3850 adjust it. */
3852 {
3856 }
3857 }
3859 }
3861 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3862 NULL_RTX if we failed the caller should emit a normal call, otherwise
3863 try to get the result in TARGET, if convenient (and in mode MODE if that's
3864 convenient). */
3866 static rtx
3868 {
3876 }
3878 /* Helper function to do the actual work for expand_builtin_strcpy. The
3879 arguments to the builtin_strcpy call DEST and SRC are broken out
3880 so that this can also be called without constructing an actual CALL_EXPR.
3881 The other arguments and return value are the same as for
3882 expand_builtin_strcpy. */
3884 static rtx
3886 {
3888 }
3890 /* Expand a call EXP to the stpcpy builtin.
3891 Return NULL_RTX if we failed the caller should emit a normal call,
3892 otherwise try to get the result in TARGET, if convenient (and in
3893 mode MODE if that's convenient). */
3895 static rtx
3897 {
3907 /* If return value is ignored, transform stpcpy into strcpy. */
3909 {
3913 }
3914 else
3915 {
3917 rtx ret;
3919 /* Ensure we get an actual string whose length can be evaluated at
3920 compile-time, not an expression containing a string. This is
3921 because the latter will potentially produce pessimized code
3922 when used to produce the return value. */
3923 c_strlen_data lendata = { };
3938 {
3942 {
3946 {
3948 {
3951 else
3953 }
3962 }
3963 }
3964 }
3968 }
3969 }
3971 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
3972 arguments while being careful to avoid duplicate warnings (which could
3973 be issued if the expander were to expand the call, resulting in it
3974 being emitted in expand_call(). */
3976 static rtx
3978 {
3980 {
3981 /* The call has been successfully expanded. Check for nonstring
3982 arguments and issue warnings as appropriate. */
3985 }
3988 }
3990 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3991 bytes from constant string DATA + OFFSET and return it as target
3992 constant. */
3994 rtx
3996 fixed_size_mode mode)
3997 {
4004 }
4006 /* Helper to check the sizes of sequences and the destination of calls
4007 to __builtin_strncat and __builtin___strncat_chk. Returns true on
4008 success (no overflow or invalid sizes), false otherwise. */
4010 static bool
4012 {
4017 /* Try to determine the range of lengths that the source expression
4018 refers to. */
4019 c_strlen_data lendata = { };
4022 /* Try to verify that the destination is big enough for the shortest
4023 string. */
4027 {
4028 /* If it hasn't been provided by __strncat_chk, try to determine
4029 the size of the destination object into which the source is
4030 being copied. */
4032 }
4034 /* Add one for the terminating nul. */
4037 size_one_node)
4040 /* The strncat function copies at most MAXREAD bytes and always appends
4041 the terminating nul so the specified upper bound should never be equal
4042 to (or greater than) the size of the destination. */
4045 {
4052 }
4060 /* The number of bytes to write is LEN but check_access will alsoa
4061 check SRCLEN if LEN's value isn't known. */
4064 }
4066 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4067 NULL_RTX if we failed the caller should emit a normal call. */
4069 static rtx
4071 {
4079 /* The number of bytes to write (not the maximum). */
4082 /* The length of the source sequence. */
4085 /* We must be passed a constant len and src parameter. */
4091 /* We're required to pad with trailing zeros if the requested
4092 len is greater than strlen(s2)+1. In that case try to
4093 use store_by_pieces, if it fails, punt. */
4095 {
4098 rtx dest_mem;
4102 builtin_strncpy_read_str,
4109 builtin_strncpy_read_str,
4111 RETURN_BEGIN);
4115 }
4118 }
4120 /* Return the RTL of a register in MODE generated from PREV in the
4121 previous iteration. */
4123 static rtx
4125 {
4128 {
4129 /* Use the previous data in the same mode. */
4135 /* Don't use the previous data to write QImode if it is in a
4136 vector mode. */
4145 {
4146 /* This case occurs when PREV_MODE is a vector and when
4147 MODE is too small to store using vector operations.
4148 After register allocation, the code will need to move the
4149 lowpart of the vector register into a non-vector register.
4151 Also, the target has chosen to use a hard register
4152 instead of going with the default choice of using a
4153 pseudo register. We should respect that choice and try to
4154 avoid creating a pseudo register with the same mode as the
4155 current hard register.
4157 In principle, we could just use a lowpart MODE subreg of
4158 the vector register. However, the vector register mode might
4159 be too wide for non-vector registers, and we already know
4160 that the non-vector mode is too small for vector registers.
4161 It's therefore likely that we'd need to spill to memory in
4162 the vector mode and reload the non-vector value from there.
4164 Try to avoid that by reducing the vector register to the
4165 smallest size that it can hold. This should increase the
4166 chances that non-vector registers can hold both the inner
4167 and outer modes of the subreg that we generate later. */
4168 machine_mode m;
4169 fixed_size_mode candidate;
4172 {
4179 {
4181 prev_mode);
4185 }
4186 }
4189 }
4192 }
4194 }
4196 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4197 bytes from constant string DATA + OFFSET and return it as target
4198 constant. If PREV isn't nullptr, it has the RTL info from the
4199 previous iteration. */
4201 rtx
4203 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
4204 fixed_size_mode mode)
4205 {
4210 mode);
4216 {
4221 /* Return CONST_VECTOR when called by a query function. */
4224 /* Use the move expander with CONST_VECTOR. */
4228 }
4235 }
4237 /* Callback routine for store_by_pieces. Return the RTL of a register
4238 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4239 char value given in the RTL register data. For example, if mode is
4240 4 bytes wide, return the RTL for 0x01010101*data. If PREV isn't
4241 nullptr, it has the RTL info from the previous iteration. */
4243 static rtx
4245 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
4246 fixed_size_mode mode)
4247 {
4261 {
4264 /* vec_duplicate_optab is a precondition to pick a vector mode for
4265 the memset expander. */
4277 }
4286 }
4288 /* Expand expression EXP, which is a call to the memset builtin. Return
4289 NULL_RTX if we failed the caller should emit a normal call, otherwise
4290 try to get the result in TARGET, if convenient (and in mode MODE if that's
4291 convenient). */
4293 rtx
4295 {
4305 }
4307 /* Check that store_by_pieces allows BITS + LEN (so that we don't
4308 expand something too unreasonably long), and every power of 2 in
4309 BITS. It is assumed that LEN has already been tested by
4310 itself. */
4311 static bool
4313 by_pieces_constfn constfun,
4317 {
4323 /* BITS set are expected to be generally in the low range and
4324 contiguous. We do NOT want to repeat the test above in case BITS
4325 has a single bit set, so we terminate the loop when BITS == BIT.
4326 In the unlikely case that BITS has the MSB set, also terminate in
4327 case BIT gets shifted out. */
4329 {
4336 }
4339 }
4341 /* Try to store VAL (or, if NULL_RTX, VALC) in LEN bytes starting at TO.
4342 Return TRUE if successful, FALSE otherwise. TO is assumed to be
4343 aligned at an ALIGN-bits boundary. LEN must be a multiple of
4344 1<<CTZ_LEN between MIN_LEN and MAX_LEN.
4346 The strategy is to issue one store_by_pieces for each power of two,
4347 from most to least significant, guarded by a test on whether there
4348 are at least that many bytes left to copy in LEN.
4350 ??? Should we skip some powers of two in favor of loops? Maybe start
4351 at the max of TO/LEN/word alignment, at least when optimizing for
4352 size, instead of ensuring O(log len) dynamic compares? */
4354 bool
4359 {
4369 /* Bits more significant than TST_BITS are part of the shared prefix
4370 in the binary representation of both min_len and max_len. Since
4371 they're identical, we don't need to test them in the loop. */
4375 /* Save the pre-blksize values. */
4379 /* Check whether it's profitable to start by storing a fixed BLKSIZE
4380 bytes, to lower max_bits. In the unlikely case of a constant LEN
4381 (implied by identical MAX_LEN and MIN_LEN), we want to issue a
4382 single store_by_pieces, but otherwise, select the minimum multiple
4383 of the ALIGN (in bytes) and of the MCD of the possible LENs, that
4384 brings MAX_LEN below TST_BITS, if that's lower than min_len. */
4387 {
4392 }
4395 else
4396 /* Huh, max_len < min_len? Punt. See pr100843.c. */
4399 /* ??? Maybe try smaller fixed-prefix blksizes before
4400 punting? */
4403 {
4411 }
4412 else
4415 /* Check that we can use store by pieces for the maximum store count
4416 we may issue (initial fixed-size block, plus conditional
4417 power-of-two-sized from max_bits to ctz_len. */
4424 /* Skip the test in case of overflow in xlenest. It shouldn't
4425 happen because of the way max_bits and blksize are related, but
4426 it doesn't hurt to test. */
4429 builtin_memset_read_str,
4431 {
4438 {
4441 /* Check that blksize plus the bits to be stored as blocks
4442 sized at powers of two can be stored by pieces. This is
4443 like the test above, but with smaller max_bits. Skip
4444 orig_max_bits (it would be redundant). Also skip in case
4445 of overflow. */
4449 builtin_memset_read_str,
4451 {
4454 }
4457 builtin_memset_read_str,
4459 {
4466 }
4468 {
4469 /* We'll get here if can_store_by_pieces refuses to
4470 store even a single QImode. We'll fall back to
4471 QImode stores then. */
4473 {
4478 }
4481 }
4482 }
4485 /* If the boundaries are such that min and max may run a
4486 different number of trips in the initial loop, the remainder
4487 needs not be between the moduli, so set tst_bits to cover all
4488 bits. Otherwise, if the trip counts are the same, max_len
4489 has the common prefix, and the previously-computed tst_bits
4490 is usable. */
4493 }
4495 by_pieces_constfn constfun;
4498 {
4501 val);
4502 }
4503 else
4504 {
4507 }
4515 {
4523 /* Adjust PTR, TO and REM. Since TO's address is likely
4524 PTR+offset, we have to replace it. */
4529 }
4531 /* Iterate over power-of-two block sizes from the maximum length to
4532 the least significant bit possibly set in the length. */
4534 {
4540 /* If we're past the bits shared between min_ and max_len, expand
4541 a test on the dynamic length, comparing it with the
4542 BLKSIZE. */
4544 {
4549 }
4550 /* If we are at a bit that is in the prefix shared by min_ and
4551 max_len, skip the current BLKSIZE if the bit is clear, but do
4552 not skip the loop, even if it doesn't require
4553 prechecking. */
4559 {
4562 /* Since we may run this multiple times, don't assume we
4563 know anything about the offset. */
4565 }
4570 {
4578 }
4579 else
4580 {
4581 /* Issue a store of BLKSIZE bytes. */
4587 }
4588 /* Adjust REM and PTR, unless this is the last iteration. */
4590 {
4595 }
4603 {
4606 /* Given conditional stores, the offset can no longer be
4607 known, so clear it. */
4609 }
4610 }
4613 }
4615 /* Helper function to do the actual work for expand_builtin_memset. The
4616 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4617 so that this can also be called without constructing an actual CALL_EXPR.
4618 The other arguments and return value are the same as for
4619 expand_builtin_memset. */
4621 static rtx
4624 {
4627 machine_mode val_mode;
4639 /* If DEST is not a pointer type, don't do this operation in-line. */
4650 /* If the LEN parameter is zero, return DEST. */
4652 {
4653 /* Evaluate and ignore VAL in case it has side-effects. */
4656 }
4658 /* Stabilize the arguments in case we fail. */
4671 {
4672 rtx val_rtx;
4677 /* Assume that we can memset by pieces if we can store
4678 * the coefficients by pieces (in the required modes).
4679 * We can't pass builtin_memset_gen_str as that emits RTL. */
4685 {
4690 }
4694 probable_max_size)
4699 dest_align))
4705 }
4708 {
4715 RETURN_BEGIN);
4720 probable_max_size)
4725 dest_align))
4731 }
4742 {
4745 }
4749 do_libcall:
4758 else
4763 }
4765 /* Expand expression EXP, which is a call to the bzero builtin. Return
4766 NULL_RTX if we failed the caller should emit a normal call. */
4768 static rtx
4770 {
4777 /* New argument list transforming bzero(ptr x, int y) to
4778 memset(ptr x, int 0, size_t y). This is done this way
4779 so that if it isn't expanded inline, we fallback to
4780 calling bzero instead of memset. */
4788 }
4790 /* Try to expand cmpstr operation ICODE with the given operands.
4791 Return the result rtx on success, otherwise return null. */
4793 static rtx
4795 HOST_WIDE_INT align)
4796 {
4810 }
4812 /* Expand expression EXP, which is a call to the memcmp built-in function.
4813 Return NULL_RTX if we failed and the caller should emit a normal call,
4814 otherwise try to get the result in TARGET, if convenient.
4815 RESULT_EQ is true if we can relax the returned value to be either zero
4816 or nonzero, without caring about the sign. */
4818 static rtx
4820 {
4829 /* Due to the performance benefit, always inline the calls first
4830 when result_eq is false. */
4834 {
4838 }
4846 /* If we don't have POINTER_TYPE, call the function. */
4854 /* Set MEM_SIZE as appropriate. */
4856 {
4859 }
4863 /* Try to get the byte representation of the constant ARG2 (or, only
4864 when the function's result is used for equality to zero, ARG1)
4865 points to, with its byte size in NBYTES. */
4869 {
4870 /* For equality to zero the arguments are interchangeable. */
4874 }
4876 /* If the function's constant bound LEN_RTX is less than or equal
4877 to the byte size of the representation of the constant argument,
4878 and if block move would be done by pieces, we can avoid loading
4879 the bytes from memory and only store the computed constant result. */
4892 {
4893 /* Return the value in the proper mode for this function. */
4898 {
4901 }
4904 }
4907 }
4909 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4910 if we failed the caller should emit a normal call, otherwise try to get
4911 the result in TARGET, if convenient. */
4913 static rtx
4915 {
4922 /* Due to the performance benefit, always inline the calls first. */
4936 /* If we don't have POINTER_TYPE, call the function. */
4940 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4947 /* Try to call cmpstrsi. */
4952 /* Try to determine at least one length and call cmpstrnsi. */
4954 {
4955 tree len;
4956 rtx arg3_rtx;
4966 /* If we don't have a constant length for the first, use the length
4967 of the second, if we know it. We don't require a constant for
4968 this case; some cost analysis could be done if both are available
4969 but neither is constant. For now, assume they're equally cheap,
4970 unless one has side effects. If both strings have constant lengths,
4971 use the smaller. */
4987 else
4990 /* If both arguments have side effects, we cannot optimize. */
4992 {
4994 result = expand_cmpstrn_or_cmpmem
4997 }
4998 }
5002 {
5003 /* Return the value in the proper mode for this function. */
5011 }
5013 /* Expand the library call ourselves using a stabilized argument
5014 list to avoid re-evaluating the function's arguments twice. */
5020 }
5022 /* Expand expression EXP, which is a call to the strncmp builtin. Return
5023 NULL_RTX if we failed the caller should emit a normal call, otherwise
5024 try to get the result in TARGET, if convenient. */
5026 static rtx
5028 ATTRIBUTE_UNUSED machine_mode mode)
5029 {
5042 /* Due to the performance benefit, always inline the calls first. */
5048 /* If c_strlen can determine an expression for one of the string
5049 lengths, and it doesn't have side effects, then emit cmpstrnsi
5050 using length MIN(strlen(string)+1, arg3). */
5055 tree len;
5067 /* If we don't have a constant length for the first, use the length
5068 of the second, if we know it. If neither string is constant length,
5069 use the given length argument. We don't require a constant for
5070 this case; some cost analysis could be done if both are available
5071 but neither is constant. For now, assume they're equally cheap,
5072 unless one has side effects. If both strings have constant lengths,
5073 use the smaller. */
5091 else
5094 /* If we are not using the given length, we must incorporate it here.
5095 The actual new length parameter will be MIN(len,arg3) in this case. */
5097 {
5100 }
5110 {
5111 /* Return the value in the proper mode for this function. */
5119 }
5121 /* Expand the library call ourselves using a stabilized argument
5122 list to avoid re-evaluating the function's arguments twice. */
5128 }
5130 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
5131 if that's convenient. */
5133 rtx
5135 {
5136 rtx val;
5139 /* Don't do __builtin_saveregs more than once in a function.
5140 Save the result of the first call and reuse it. */
5144 /* When this function is called, it means that registers must be
5145 saved on entry to this function. So we migrate the call to the
5146 first insn of this function. */
5150 /* Do whatever the machine needs done in this case. */
5158 /* Put the insns after the NOTE that starts the function. If this
5159 is inside a start_sequence, make the outer-level insn chain current, so
5160 the code is placed at the start of the function. */
5166 }
5168 /* Expand a call to __builtin_next_arg. */
5170 static rtx
5172 {
5173 /* Checking arguments is already done in fold_builtin_next_arg
5174 that must be called before this function. */
5179 }
5181 /* Make it easier for the backends by protecting the valist argument
5182 from multiple evaluations. */
5184 static tree
5186 {
5189 /* The current way of determining the type of valist is completely
5190 bogus. We should have the information on the va builtin instead. */
5195 {
5199 /* For this case, the backends will be expecting a pointer to
5200 vatype, but it's possible we've actually been given an array
5201 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
5202 So fix it. */
5204 {
5207 }
5208 }
5209 else
5210 {
5214 {
5220 }
5226 }
5229 }
5231 /* The "standard" definition of va_list is void*. */
5233 tree
5235 {
5237 }
5239 /* The "standard" abi va_list is va_list_type_node. */
5241 tree
5243 {
5245 }
5247 /* The "standard" type of va_list is va_list_type_node. */
5249 tree
5251 {
5258 {
5259 /* If va_list is an array type, the argument may have decayed
5260 to a pointer type, e.g. by being passed to another function.
5261 In that case, unwrap both types so that we can compare the
5262 underlying records. */
5265 {
5268 }
5269 }
5274 }
5276 /* The "standard" implementation of va_start: just assign `nextarg' to
5277 the variable. */
5279 void
5281 {
5284 }
5286 /* Expand EXP, a call to __builtin_va_start. */
5288 static rtx
5290 {
5291 rtx nextarg;
5292 tree valist;
5296 {
5299 }
5309 else
5313 }
5315 /* Expand EXP, a call to __builtin_va_end. */
5317 static rtx
5319 {
5322 /* Evaluate for side effects, if needed. I hate macros that don't
5323 do that. */
5328 }
5330 /* Expand EXP, a call to __builtin_va_copy. We do this as a
5331 builtin rather than just as an assignment in stdarg.h because of the
5332 nastiness of array-type va_list types. */
5334 static rtx
5336 {
5349 {
5353 }
5354 else
5355 {
5358 /* Evaluate to pointers. */
5367 /* "Dereference" to BLKmode memories. */
5375 /* Copy. */
5377 }
5380 }
5382 /* Expand a call to one of the builtin functions __builtin_frame_address or
5383 __builtin_return_address. */
5385 static rtx
5387 {
5388 /* The argument must be a nonnegative integer constant.
5389 It counts the number of frames to scan up the stack.
5390 The value is either the frame pointer value or the return
5391 address saved in that frame. */
5393 /* Warning about missing arg was already issued. */
5396 {
5399 }
5400 else
5401 {
5402 /* Number of frames to scan up the stack. */
5407 /* Some ports cannot access arbitrary stack frames. */
5409 {
5412 }
5415 {
5416 /* Warn since no effort is made to ensure that any frame
5417 beyond the current one exists or can be safely reached. */
5420 }
5422 /* For __builtin_frame_address, return what we've got. */
5430 }
5431 }
5433 #if ! STACK_GROWS_DOWNWARD
5434 # define STACK_TOPS GT
5435 #else
5436 # define STACK_TOPS LT
5437 #endif
5439 #ifdef POINTERS_EXTEND_UNSIGNED
5440 # define STACK_UNSIGNED POINTERS_EXTEND_UNSIGNED
5441 #else
5442 # define STACK_UNSIGNED true
5443 #endif
5445 /* Expand a call to builtin function __builtin_stack_address. */
5447 static rtx
5449 {
5451 STACK_UNSIGNED);
5453 #ifdef STACK_ADDRESS_OFFSET
5454 /* Unbias the stack pointer, bringing it to the boundary between the
5455 stack area claimed by the active function calling this builtin,
5456 and stack ranges that could get clobbered if it called another
5457 function. It should NOT encompass any stack red zone, that is
5458 used in leaf functions.
5460 On SPARC, the register save area is *not* considered active or
5461 used by the active function, but rather as akin to the area in
5462 which call-preserved registers are saved by callees. This
5463 enables __strub_leave to clear what would otherwise overlap with
5464 its own register save area.
5466 If the address is computed too high or too low, parts of a stack
5467 range that should be scrubbed may be left unscrubbed, scrubbing
5468 may corrupt active portions of the stack frame, and stack ranges
5469 may be doubly-scrubbed by caller and callee.
5471 In order for it to be just right, the area delimited by
5472 @code{__builtin_stack_address} and @code{__builtin_frame_address
5473 (0)} should encompass caller's registers saved by the function,
5474 local on-stack variables and @code{alloca} stack areas.
5475 Accumulated outgoing on-stack arguments, preallocated as part of
5476 a function's own prologue, are to be regarded as part of the
5477 (caller) function's active area as well, whereas those pushed or
5478 allocated temporarily for a call are regarded as part of the
5479 callee's stack range, rather than the caller's. */
5481 #endif
5484 }
5486 /* Expand a call to builtin function __builtin_strub_enter. */
5488 static rtx
5490 {
5508 }
5510 /* Expand a call to builtin function __builtin_strub_update. */
5512 static rtx
5514 {
5523 #ifdef RED_ZONE_SIZE
5524 /* Here's how the strub enter, update and leave functions deal with red zones.
5526 If it weren't for red zones, update, called from within a strub context,
5527 would bump the watermark to the top of the stack. Enter and leave, running
5528 in the caller, would use the caller's top of stack address both to
5529 initialize the watermark passed to the callee, and to start strubbing the
5530 stack afterwards.
5532 Ideally, we'd update the watermark so as to cover the used amount of red
5533 zone, and strub starting at the caller's other end of the (presumably
5534 unused) red zone. Normally, only leaf functions use the red zone, but at
5535 this point we can't tell whether a function is a leaf, nor can we tell how
5536 much of the red zone it uses. Furthermore, some strub contexts may have
5537 been inlined so that update and leave are called from the same stack frame,
5538 and the strub builtins may all have been inlined, turning a strub function
5539 into a leaf.
5541 So cleaning the range from the caller's stack pointer (one end of the red
5542 zone) to the (potentially inlined) callee's (other end of the) red zone
5543 could scribble over the caller's own red zone.
5545 We avoid this possibility by arranging for callers that are strub contexts
5546 to use their own watermark as the strub starting point. So, if A calls B,
5547 and B calls C, B will tell A to strub up to the end of B's red zone, and
5548 will strub itself only the part of C's stack frame and red zone that
5549 doesn't overlap with B's. With that, we don't need to know who's leaf and
5550 who isn't: inlined calls will shrink their strub window to zero, each
5551 remaining call will strub some portion of the stack, and eventually the
5552 strub context will return to a caller that isn't a strub context itself,
5553 that will therefore use its own stack pointer as the strub starting point.
5554 It's not a leaf, because strub contexts can't be inlined into non-strub
5555 contexts, so it doesn't use the red zone, and it will therefore correctly
5556 strub up the callee's stack frame up to the end of the callee's red zone.
5557 Neat! */
5559 {
5561 #if STACK_GROWS_DOWNWARD
5563 #endif
5566 }
5567 #endif
5583 /* If this is an inlined strub function, also bump the watermark for the
5584 enclosing function. This avoids a problem with the following scenario: A
5585 calls B and B calls C, and both B and C get inlined into A. B allocates
5586 temporary stack space before calling C. If we don't update A's watermark,
5587 we may use an outdated baseline for the post-C strub_leave, erasing B's
5588 temporary stack allocation. We only need this if we're fully expanding
5589 strub_leave inline. */
5594 {
5606 }
5611 }
5614 /* Expand a call to builtin function __builtin_strub_leave. */
5616 static rtx
5618 {
5630 {
5636 }
5649 #if ! STACK_GROWS_DOWNWARD
5652 #else
5655 #endif
5657 /* We're going to modify it, so make sure it's not e.g. the stack pointer. */
5667 else
5668 {
5669 /* Ok, now we've determined we want to copy the block, so convert the
5670 addresses to Pmode, as needed to dereference them to access ptr_mode
5671 memory locations, so that we don't have to convert anything within the
5672 loop. */
5679 /* ??? It would be nice to use setmem or similar patterns here,
5680 but they do not necessarily obey the stack growth direction,
5681 which has security implications. We also have to avoid calls
5682 (memset, bzero or any machine-specific ones), which are
5683 likely unsafe here (see TARGET_STRUB_MAY_USE_MEMSET). */
5684 #if ! STACK_GROWS_DOWNWARD
5692 #else
5700 #endif
5704 }
5709 }
5711 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5712 failed and the caller should emit a normal call. */
5714 static rtx
5716 {
5717 rtx op0;
5718 rtx result;
5721 HOST_WIDE_INT max_size;
5724 bool valid_arglist
5727 VOID_TYPE)
5735 /* Compute the argument. */
5738 /* Compute the alignment. */
5740 ? BIGGEST_ALIGNMENT
5743 /* Compute the maximum size. */
5748 /* Allocate the desired space. If the allocation stems from the declaration
5749 of a variable-sized object, it cannot accumulate. */
5750 result
5754 /* Dynamic allocations for variables are recorded during gimplification. */
5759 }
5761 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5762 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5763 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5764 handle_builtin_stack_restore function. */
5766 static rtx
5768 {
5775 OPTAB_LIB_WIDEN);
5778 OPTAB_LIB_WIDEN);
5783 }
5785 /* Expand a call to bswap builtin in EXP.
5786 Return NULL_RTX if a normal call should be emitted rather than expanding the
5787 function in-line. If convenient, the result should be placed in TARGET.
5788 SUBTARGET may be used as the target for computing one of EXP's operands. */
5790 static rtx
5792 rtx subtarget)
5793 {
5794 tree arg;
5795 rtx op0;
5813 }
5815 /* Expand a call to a unary builtin in EXP.
5816 Return NULL_RTX if a normal call should be emitted rather than expanding the
5817 function in-line. If convenient, the result should be placed in TARGET.
5818 SUBTARGET may be used as the target for computing one of EXP's operands. */
5820 static rtx
5823 {
5824 rtx op0;
5829 /* Compute the argument. */
5831 (subtarget
5835 /* Compute op, into TARGET if possible.
5836 Set TARGET to wherever the result comes back. */
5842 }
5844 /* Expand a call to __builtin_expect. We just return our argument
5845 as the builtin_expect semantic should've been already executed by
5846 tree branch prediction pass. */
5848 static rtx
5850 {
5851 tree arg;
5858 /* When guessing was done, the hints should be already stripped away. */
5862 }
5864 /* Expand a call to __builtin_expect_with_probability. We just return our
5865 argument as the builtin_expect semantic should've been already executed by
5866 tree branch prediction pass. */
5868 static rtx
5870 {
5871 tree arg;
5878 /* When guessing was done, the hints should be already stripped away. */
5882 }
5885 /* Expand a call to __builtin_assume_aligned. We just return our first
5886 argument as the builtin_assume_aligned semantic should've been already
5887 executed by CCP. */
5889 static rtx
5891 {
5895 EXPAND_NORMAL);
5900 }
5902 void
5904 {
5906 {
5908 /* For trap insns when not accumulating outgoing args force
5909 REG_ARGS_SIZE note to prevent crossjumping of calls with
5910 different args sizes. */
5913 }
5914 else
5915 {
5919 }
5922 }
5924 /* Expand a call to __builtin_unreachable. We do nothing except emit
5925 a barrier saying that control flow will not pass here.
5927 It is the responsibility of the program being compiled to ensure
5928 that control flow does never reach __builtin_unreachable. */
5929 static void
5931 {
5932 /* Use gimple_build_builtin_unreachable or builtin_decl_unreachable
5933 to avoid this. */
5936 }
5938 /* Expand EXP, a call to fabs, fabsf or fabsl.
5939 Return NULL_RTX if a normal call should be emitted rather than expanding
5940 the function inline. If convenient, the result should be placed
5941 in TARGET. SUBTARGET may be used as the target for computing
5942 the operand. */
5944 static rtx
5946 {
5947 machine_mode mode;
5948 tree arg;
5949 rtx op0;
5959 }
5961 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5962 Return NULL is a normal call should be emitted rather than expanding the
5963 function inline. If convenient, the result should be placed in TARGET.
5964 SUBTARGET may be used as the target for computing the operand. */
5966 static rtx
5968 {
5970 tree arg;
5982 }
5984 /* Emit a call to __builtin___clear_cache. */
5986 void
5988 {
5990 BUILTIN_ASM_NAME_PTR
5997 }
5999 /* Emit a call to __builtin___clear_cache, unless the target specifies
6000 it as do-nothing. This function can be used by trampoline
6001 finalizers to duplicate the effects of expanding a call to the
6002 clear_cache builtin. */
6004 void
6006 {
6013 {
6014 /* We have a "clear_cache" insn, and it will handle everything. */
6022 }
6023 else
6024 {
6025 #ifndef CLEAR_INSN_CACHE
6026 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
6027 does nothing. There is no need to call it. Do nothing. */
6030 }
6033 }
6035 /* Expand a call to __builtin___clear_cache. */
6037 static void
6039 {
6043 /* We must not expand to a library call. If we did, any
6044 fallback library function in libgcc that might contain a call to
6045 __builtin___clear_cache() would recurse infinitely. */
6047 {
6050 }
6059 }
6061 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
6063 static rtx
6065 {
6068 /* If we don't need too much alignment, we'll have been guaranteed
6069 proper alignment by get_trampoline_type. */
6073 /* Round address up to desired boundary. */
6084 }
6086 static rtx
6088 {
6104 /* If ONSTACK, the TRAMP argument should be the address of a field
6105 within the local function's FRAME decl. Either way, let's see if
6106 we can fill in the MEM_ATTRs for this memory. */
6110 /* Creator of a heap trampoline is responsible for making sure the
6111 address is aligned to at least STACK_BOUNDARY. Normally malloc
6112 will ensure this anyhow. */
6115 {
6119 }
6121 /* The FUNC argument should be the address of the nested function.
6122 Extract the actual function decl to pass to the hook. */
6129 /* Generate insns to initialize the trampoline. */
6133 {
6139 }
6142 }
6144 static rtx
6146 {
6147 rtx tramp;
6158 }
6160 /* Expand a call to the builtin descriptor initialization routine.
6161 A descriptor is made up of a couple of pointers to the static
6162 chain and the code entry in this order. */
6164 static rtx
6166 {
6171 VOID_TYPE))
6186 /* Generate insns to initialize the descriptor. */
6192 }
6194 /* Expand a call to the builtin descriptor adjustment routine. */
6196 static rtx
6198 {
6199 rtx tramp;
6206 /* Unalign the descriptor to allow runtime identification. */
6211 }
6213 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
6214 function. The function first checks whether the back end provides
6215 an insn to implement signbit for the respective mode. If not, it
6216 checks whether the floating point format of the value is such that
6217 the sign bit can be extracted. If that is not the case, error out.
6218 EXP is the expression that is a call to the builtin function; if
6219 convenient, the result should be placed in TARGET. */
6220 static rtx
6222 {
6224 scalar_float_mode fmode;
6226 tree arg;
6229 rtx temp;
6242 /* Expand the argument yielding a RTX expression. */
6245 /* Check if the back end provides an insn that handles signbit for the
6246 argument's mode. */
6249 {
6255 }
6257 /* For floating point formats without a sign bit, implement signbit
6258 as "ARG < 0.0". */
6261 {
6262 /* But we can't do this if the format supports signed zero. */
6268 }
6271 {
6274 }
6275 else
6276 {
6278 /* Handle targets with different FP word orders. */
6281 else
6285 }
6287 /* Force the intermediate word_mode (or narrower) result into a
6288 register. This avoids attempting to create paradoxical SUBREGs
6289 of floating point modes below. */
6292 /* If the bitpos is within the "result mode" lowpart, the operation
6293 can be implement with a single bitwise AND. Otherwise, we need
6294 a right shift and an AND. */
6297 {
6305 }
6306 else
6307 {
6308 /* Perform a logical right shift to place the signbit in the least
6309 significant bit, then truncate the result to the desired mode
6310 and mask just this bit. */
6315 }
6318 }
6320 /* Expand fork or exec calls. TARGET is the desired target of the
6321 call. EXP is the call. FN is the
6322 identificator of the actual function. IGNORE is nonzero if the
6323 value is to be ignored. */
6325 static rtx
6327 {
6329 tree call;
6331 /* If we are not profiling, just call the function. */
6335 /* Otherwise call the wrapper. This should be equivalent for the rest of
6336 compiler, so the code does not diverge, and the wrapper may run the
6337 code necessary for keeping the profiling sane. */
6340 {
6371 }
6383 }
6386 \f
6387 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
6388 the pointer in these functions is void*, the tree optimizers may remove
6389 casts. The mode computed in expand_builtin isn't reliable either, due
6390 to __sync_bool_compare_and_swap.
6392 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
6393 group of builtins. This gives us log2 of the mode size. */
6397 {
6398 /* The size is not negotiable, so ask not to get BLKmode in return
6399 if the target indicates that a smaller size would be better. */
6401 }
6403 /* Expand the memory expression LOC and return the appropriate memory operand
6404 for the builtin_sync operations. */
6406 static rtx
6408 {
6418 /* Note that we explicitly do not want any alias information for this
6419 memory, so that we kill all other live memories. Otherwise we don't
6420 satisfy the full barrier semantics of the intrinsic. */
6427 /* The alignment needs to be at least according to that of the mode. */
6434 }
6436 /* Make sure an argument is in the right mode.
6437 EXP is the tree argument.
6438 MODE is the mode it should be in. */
6440 static rtx
6442 {
6443 rtx val;
6444 machine_mode old_mode;
6448 {
6449 /* Undo argument promotion if possible, as combine might not
6450 be able to do it later due to MEM_VOLATILE_P uses in the
6451 patterns. */
6454 {
6464 }
6465 }
6468 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
6469 of CONST_INTs, where we know the old_mode only from the call argument. */
6476 }
6479 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
6480 EXP is the CALL_EXPR. CODE is the rtx code
6481 that corresponds to the arithmetic or logical operation from the name;
6482 an exception here is that NOT actually means NAND. TARGET is an optional
6483 place for us to store the results; AFTER is true if this is the
6484 fetch_and_xxx form. */
6486 static rtx
6489 rtx target)
6490 {
6495 {
6502 {
6531 }
6532 }
6534 /* Expand the operands. */
6539 after);
6540 }
6542 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
6543 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
6544 true if this is the boolean form. TARGET is a place for us to store the
6545 results; this is NOT optional if IS_BOOL is true. */
6547 static rtx
6550 {
6554 /* Expand the operands. */
6561 {
6564 else
6566 }
6569 MEMMODEL_SYNC_SEQ_CST))
6573 }
6575 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
6576 general form is actually an atomic exchange, and some targets only
6577 support a reduced form with the second argument being a constant 1.
6578 EXP is the CALL_EXPR; TARGET is an optional place for us to store
6579 the results. */
6581 static rtx
6583 rtx target)
6584 {
6587 /* Expand the operands. */
6592 }
6594 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
6596 static void
6598 {
6599 rtx mem;
6601 /* Expand the operands. */
6605 }
6607 /* Given an integer representing an ``enum memmodel'', verify its
6608 correctness and return the memory model enum. */
6610 static enum memmodel
6612 {
6613 /* If the parameter is not a constant, it's a run time value so we'll just
6614 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
6626 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
6630 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
6631 be conservative and promote consume to acquire. */
6636 }
6638 /* Expand the __atomic_exchange intrinsic:
6639 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
6640 EXP is the CALL_EXPR.
6641 TARGET is an optional place for us to store the results. */
6643 static rtx
6645 {
6654 /* Expand the operands. */
6659 }
6661 /* Expand the __atomic_compare_exchange intrinsic:
6662 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
6663 TYPE desired, BOOL weak,
6664 enum memmodel success,
6665 enum memmodel failure)
6666 EXP is the CALL_EXPR.
6667 TARGET is an optional place for us to store the results. */
6669 static rtx
6671 rtx target)
6672 {
6675 tree weak;
6685 {
6688 }
6694 /* Expand the operands. */
6710 /* Lest the rtl backend create a race condition with an imporoper store
6711 to memory, always create a new pseudo for OLDVAL. */
6718 /* Conditionally store back to EXPECT, lest we create a race condition
6719 with an improper store to memory. */
6720 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6721 the normal case where EXPECT is totally private, i.e. a register. At
6722 which point the store can be unconditional. */
6730 }
6732 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6733 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6734 call. The weak parameter must be dropped to match the expected parameter
6735 list and the expected argument changed from value to pointer to memory
6736 slot. */
6738 static void
6740 {
6756 /* Skip the boolean weak parameter. */
6759 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6762 built_in_function fncode
6767 fndecl);
6772 {
6779 }
6780 }
6782 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6784 void
6786 {
6798 {
6801 }
6804 {
6807 }
6809 /* Expand the operands. */
6822 {
6825 }
6829 {
6835 }
6836 }
6838 /* Expand the __atomic_load intrinsic:
6839 TYPE __atomic_load (TYPE *object, enum memmodel)
6840 EXP is the CALL_EXPR.
6841 TARGET is an optional place for us to store the results. */
6843 static rtx
6845 {
6853 /* Expand the operand. */
6857 }
6860 /* Expand the __atomic_store intrinsic:
6861 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6862 EXP is the CALL_EXPR.
6863 TARGET is an optional place for us to store the results. */
6865 static rtx
6867 {
6876 /* Expand the operands. */
6881 }
6883 /* Expand the __atomic_fetch_XXX intrinsic:
6884 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6885 EXP is the CALL_EXPR.
6886 TARGET is an optional place for us to store the results.
6887 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6888 FETCH_AFTER is true if returning the result of the operation.
6889 FETCH_AFTER is false if returning the value before the operation.
6890 IGNORE is true if the result is not used.
6891 EXT_CALL is the correct builtin for an external call if this cannot be
6892 resolved to an instruction sequence. */
6894 static rtx
6898 {
6901 tree fndecl;
6902 tree addr;
6906 /* Expand the operands. */
6910 /* Only try generating instructions if inlining is turned on. */
6912 {
6916 }
6918 /* Return if a different routine isn't needed for the library call. */
6922 /* Change the call to the specified function. */
6930 /* If we will emit code after the call, the call cannot be a tail call.
6931 If it is emitted as a tail call, a barrier is emitted after it, and
6932 then all trailing code is removed. */
6936 /* Expand the call here so we can emit trailing code. */
6939 /* Replace the original function just in case it matters. */
6942 /* Then issue the arithmetic correction to return the right result. */
6944 {
6946 {
6948 OPTAB_LIB_WIDEN);
6950 }
6951 else
6953 OPTAB_LIB_WIDEN);
6954 }
6956 }
6958 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6960 void
6962 {
6970 optab optab;
6982 {
6997 }
7000 {
7007 }
7009 rtx target;
7012 else
7033 {
7040 is_atomic
7045 }
7049 {
7054 }
7055 else
7057 OPTAB_DIRECT);
7060 }
7062 /* Expand IFN_ATOMIC_*_FETCH_CMP_0 internal function. */
7064 void
7066 {
7073 optab optab;
7074 rtx_code code;
7086 {
7109 }
7113 {
7121 }
7123 rtx target;
7126 else
7141 {
7148 is_atomic
7153 }
7156 {
7161 }
7162 }
7164 /* Expand an atomic clear operation.
7165 void _atomic_clear (BOOL *obj, enum memmodel)
7166 EXP is the call expression. */
7168 static rtx
7170 {
7178 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
7179 Failing that, a store is issued by __atomic_store. The only way this can
7180 fail is if the bool type is larger than a word size. Unlikely, but
7181 handle it anyway for completeness. Assume a single threaded model since
7182 there is no atomic support in this case, and no barriers are required. */
7187 }
7189 /* Expand an atomic test_and_set operation.
7190 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
7191 EXP is the call expression. */
7193 static rtx
7195 {
7196 rtx mem;
7198 machine_mode mode;
7205 }
7208 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
7209 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
7211 static tree
7213 {
7215 machine_mode mode;
7221 /* We need a corresponding integer mode for the access to be lock-free. */
7229 {
7232 /* Either this argument is null, or it's a fake pointer encoding
7233 the alignment of the object. */
7239 else
7241 }
7242 else
7243 {
7246 /* This function is usually invoked and folded immediately by the front
7247 end before anything else has a chance to look at it. The pointer
7248 parameter at this point is usually cast to a void *, so check for that
7249 and look past the cast. */
7259 /* Get the underlying type of the object. */
7262 }
7264 /* If the object has smaller alignment, the lock free routines cannot
7265 be used. */
7269 /* Check if a compare_and_swap pattern exists for the mode which represents
7270 the required size. The pattern is not allowed to fail, so the existence
7271 of the pattern indicates support is present. Also require that an
7272 atomic load exists for the required size. */
7275 else
7277 }
7279 /* Return true if the parameters to call EXP represent an object which will
7280 always generate lock free instructions. The first argument represents the
7281 size of the object, and the second parameter is a pointer to the object
7282 itself. If NULL is passed for the object, then the result is based on
7283 typical alignment for an object of the specified size. Otherwise return
7284 false. */
7286 static rtx
7288 {
7289 tree size;
7294 {
7297 }
7303 }
7305 /* Return a one or zero if it can be determined that object ARG1 of size ARG
7306 is lock free on this architecture. */
7308 static tree
7310 {
7314 /* If it isn't always lock free, don't generate a result. */
7319 }
7321 /* Return true if the parameters to call EXP represent an object which will
7322 always generate lock free instructions. The first argument represents the
7323 size of the object, and the second parameter is a pointer to the object
7324 itself. If NULL is passed for the object, then the result is based on
7325 typical alignment for an object of the specified size. Otherwise return
7326 NULL*/
7328 static rtx
7330 {
7331 tree size;
7336 {
7339 }
7344 /* If the value is known at compile time, return the RTX for it. */
7350 }
7352 /* Expand the __atomic_thread_fence intrinsic:
7353 void __atomic_thread_fence (enum memmodel)
7354 EXP is the CALL_EXPR. */
7356 static void
7358 {
7361 }
7363 /* Expand the __atomic_signal_fence intrinsic:
7364 void __atomic_signal_fence (enum memmodel)
7365 EXP is the CALL_EXPR. */
7367 static void
7369 {
7372 }
7374 /* Expand the __sync_synchronize intrinsic. */
7376 static void
7378 {
7380 }
7382 static rtx
7384 {
7390 {
7392 /* If the target is not sutitable then create a new target. */
7400 }
7403 }
7405 static void
7407 {
7413 {
7420 }
7422 }
7424 \f
7425 /* Emit code to restore the current value of stack. */
7427 static void
7429 {
7441 }
7443 /* Emit code to save the current value of stack. */
7445 static rtx
7447 {
7452 }
7454 /* Emit code to get the openacc gang, worker or vector id or size. */
7456 static rtx
7458 {
7460 rtx fallback_retval;
7463 {
7476 }
7479 {
7482 }
7486 {
7489 }
7493 {
7501 }
7510 {
7513 }
7521 }
7523 /* Expand a string compare operation using a sequence of char comparison
7524 to get rid of the calling overhead, with result going to TARGET if
7525 that's convenient.
7527 VAR_STR is the variable string source;
7528 CONST_STR is the constant string source;
7529 LENGTH is the number of chars to compare;
7530 CONST_STR_N indicates which source string is the constant string;
7531 IS_MEMCMP indicates whether it's a memcmp or strcmp.
7533 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
7535 target = (int) (unsigned char) var_str[0]
7536 - (int) (unsigned char) const_str[0];
7537 if (target != 0)
7538 goto ne_label;
7539 ...
7540 target = (int) (unsigned char) var_str[length - 2]
7541 - (int) (unsigned char) const_str[length - 2];
7542 if (target != 0)
7543 goto ne_label;
7544 target = (int) (unsigned char) var_str[length - 1]
7545 - (int) (unsigned char) const_str[length - 1];
7546 ne_label:
7547 */
7549 static rtx
7553 {
7555 rtx var_rtx_array
7562 scalar_int_mode unit_mode
7568 {
7569 var_rtx
7580 /* Force the difference into result register. We cannot reassign
7581 result here ("result = diff") or we may end up returning
7582 uninitialized result when expand_simple_binop allocates a new
7583 pseudo-register for returning. */
7591 }
7599 }
7601 /* Inline expansion of a call to str(n)cmp and memcmp, with result going
7602 to TARGET if that's convenient.
7603 If the call is not been inlined, return NULL_RTX. */
7605 static rtx
7607 {
7612 /* Do NOT apply this inlining expansion when optimizing for size or
7613 optimization level below 2 or if unused *cmp hasn't been DCEd. */
7621 /* On a target where the type of the call (int) has same or narrower presicion
7622 than unsigned char, give up the inlining expansion. */
7635 /* Get the object representation of the initializers of ARG1 and ARG2
7636 as strings, provided they refer to constant objects, with their byte
7637 sizes in LEN1 and LEN2, respectively. */
7641 /* Fail if neither argument refers to an initialized constant. */
7646 {
7647 /* Fail if the memcmp/strncmp bound is not a constant. */
7654 {
7655 /* Fail if the memcmp bound is greater than the size of either
7656 of the two constant objects. */
7660 }
7661 }
7664 {
7665 /* For string functions (i.e., strcmp and strncmp) reduce LEN1
7666 and LEN2 to the length of the nul-terminated string stored
7667 in each. */
7672 }
7674 /* See inline_string_cmp. */
7682 else
7685 /* For strncmp only, compute the new bound as the smallest of
7686 the lengths of the two strings (plus 1) and the bound provided
7687 to the function. */
7692 /* If the bound of the comparison is larger than the threshold,
7693 do nothing. */
7699 /* Now, start inline expansion the call. */
7703 }
7705 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
7706 represents the size of the first argument to that call, or VOIDmode
7707 if the argument is a pointer. IGNORE will be true if the result
7708 isn't used. */
7709 static rtx
7712 {
7719 {
7722 }
7726 /* An optional second argument can be used as a failsafe value on
7727 some machines. If it isn't present, then the failsafe value is
7728 assumed to be 0. */
7730 {
7733 }
7734 else
7737 /* If the result isn't used, the behavior is undefined. It would be
7738 nice to emit a warning here, but path splitting means this might
7739 happen with legitimate code. So simply drop the builtin
7740 expansion in that case; we've handled any side-effects above. */
7744 /* If we don't have a suitable target, create one to hold the result. */
7752 }
7754 /* Expand an expression EXP that calls a built-in function,
7755 with result going to TARGET if that's convenient
7756 (and in mode MODE if that's convenient).
7757 SUBTARGET may be used as the target for computing one of EXP's operands.
7758 IGNORE is nonzero if the value is to be ignored. */
7760 rtx
7763 {
7771 /* When ASan is enabled, we don't want to expand some memory/string
7772 builtins and rely on libsanitizer's hooks. This allows us to avoid
7773 redundant checks and be sure, that possible overflow will be detected
7774 by ASan. */
7781 {
7793 }
7798 /* When not optimizing, generate calls to library functions for a certain
7799 set of builtins. */
7822 /* The built-in function expanders test for target == const0_rtx
7823 to determine whether the function's result will be ignored. */
7827 /* If the result of a pure or const built-in function is ignored, and
7828 none of its arguments are volatile, we can avoid expanding the
7829 built-in call and just evaluate the arguments for side-effects. */
7833 {
7835 tree arg;
7836 call_expr_arg_iterator iter;
7840 {
7843 }
7846 {
7850 }
7851 }
7854 {
7872 /* Just do a normal library call if we were unable to fold
7873 the values. */
7962 feclearexcept_optab);
7969 feraiseexcept_optab);
7977 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7978 FUNCTION with a copy of the parameters described by
7979 ARGUMENTS, and ARGSIZE. It returns a block of memory
7980 allocated on the stack into which is stored all the registers
7981 that might possibly be used for returning the result of a
7982 function. ARGUMENTS is the value returned by
7983 __builtin_apply_args. ARGSIZE is the number of bytes of
7984 arguments that must be copied. ??? How should this value be
7985 computed? We'll also need a safe worst case value for varargs
7986 functions. */
7993 else
7994 {
8002 }
8004 /* __builtin_return (RESULT) causes the function to return the
8005 value described by RESULT. RESULT is address of the block of
8006 memory returned by __builtin_apply. */
8016 /* All valid uses of __builtin_va_arg_pack () are removed during
8017 inlining. */
8022 /* All valid uses of __builtin_va_arg_pack_len () are removed during
8023 inlining. */
8027 /* Return the address of the first anonymous stack arg. */
8068 /* Returns the address of the area where the structure is returned.
8069 0 otherwise. */
8075 else
8078 CASE_BUILT_IN_ALLOCA:
8205 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
8206 back to a BUILT_IN_STRCMP. Remember to delete the 3rd parameter
8207 when changing it to a strcmp call. */
8213 /* Change this call back to a BUILT_IN_STRCMP. */
8217 /* Delete the last parameter. */
8224 /* FALLTHROUGH */
8232 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
8233 back to a BUILT_IN_STRNCMP. */
8239 /* Change it back to a BUILT_IN_STRNCMP. */
8242 /* FALLTHROUGH */
8257 {
8260 }
8264 /* This should have been lowered to the builtins below. */
8268 /* __builtin_setjmp_setup is passed a pointer to an array of five words
8269 and the receiver label. */
8271 {
8279 }
8283 /* __builtin_setjmp_receiver is passed the receiver label. */
8285 {
8290 nonlocal_goto_handler_labels
8292 nonlocal_goto_handler_labels);
8293 /* ??? Do not let expand_label treat us as such since we would
8294 not want to be both on the list of non-local labels and on
8295 the list of forced labels. */
8298 }
8301 /* __builtin_longjmp is passed a pointer to an array of five words.
8302 It's similar to the C library longjmp function but works with
8303 __builtin_setjmp above. */
8306 {
8312 {
8315 }
8319 }
8328 /* This updates the setjmp buffer that is its argument with the value
8329 of the current stack pointer. */
8332 {
8333 rtx buf_addr
8338 }
8359 /* Various hooks for the DWARF 2 __throw routine. */
8365 #ifdef DWARF2_UNWIND_INFO
8371 #endif
8577 mode = get_builtin_sync_mode
8589 mode = get_builtin_sync_mode
8636 {
8640 mode =
8646 /* If this is turned into an external library call, the weak parameter
8647 must be dropped to match the expected parameter list. */
8652 /* Skip the boolean weak parameter. */
8657 }
8686 {
8696 }
8702 {
8712 }
8718 {
8728 }
8734 {
8744 }
8750 {
8760 }
8766 {
8776 }
8912 /* Do library call, if we failed to expand the builtin when
8913 folding. */
8933 }
8935 /* The switch statement above can drop through to cause the function
8936 to be called normally. */
8938 }
8940 /* Determine whether a tree node represents a call to a built-in
8941 function. If the tree T is a call to a built-in function with
8942 the right number of arguments of the appropriate types, return
8943 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8944 Otherwise the return value is END_BUILTINS. */
8946 enum built_in_function
8948 {
8951 const_call_expr_arg_iterator iter;
8963 {
8964 /* If a function doesn't take a variable number of arguments,
8965 the last element in the list will have type `void'. */
8968 {
8972 }
8981 {
8984 }
8986 {
8989 }
8991 {
8994 }
8996 {
8999 }
9000 else
9002 }
9004 /* Variable-length argument list. */
9006 }
9008 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
9009 evaluate to a constant. */
9011 static tree
9013 {
9014 /* We return 1 for a numeric type that's known to be a constant
9015 value at compile-time or for an aggregate type that's a
9016 literal constant. */
9019 /* If we know this is a constant, emit the constant of one. */
9025 {
9032 }
9034 /* If this expression has side effects, show we don't know it to be a
9035 constant. Likewise if it's a pointer or aggregate type since in
9036 those case we only want literals, since those are only optimized
9037 when generating RTL, not later.
9038 And finally, if we are compiling an initializer, not code, we
9039 need to return a definite result now; there's not going to be any
9040 more optimization done. */
9045 || folding_initializer
9050 }
9052 /* Create builtin_expect or builtin_expect_with_probability
9053 with PRED and EXPECTED as its arguments and return it as a truthvalue.
9054 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
9055 builtin_expect_with_probability instead uses third argument as PROBABILITY
9056 value. */
9058 static tree
9061 {
9076 else
9078 predictor);
9082 }
9084 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
9085 NULL_TREE if no simplification is possible. */
9087 tree
9089 tree arg3)
9090 {
9094 /* Distribute the expected value over short-circuiting operators.
9095 See through the cast from truthvalue_type_node to long. */
9102 /* If this is a builtin_expect within a builtin_expect keep the
9103 inner one. See through a comparison against a constant. It
9104 might have been added to create a thruthvalue. */
9114 BUILT_IN_EXPECT_WITH_PROBABILITY))
9120 {
9130 }
9132 /* If the argument isn't invariant then there's nothing else we can do. */
9136 /* If we expect that a comparison against the argument will fold to
9137 a constant return the constant. In practice, this means a true
9138 constant or the address of a non-weak symbol. */
9142 {
9143 do
9144 {
9146 }
9151 }
9153 /* Otherwise, ARG0 already has the proper type for the return value. */
9155 }
9157 /* Fold a call to __builtin_classify_type with argument ARG. */
9159 static tree
9161 {
9166 }
9168 /* Fold a call EXPR (which may be null) to __builtin_strlen with argument
9169 ARG. */
9171 static tree
9173 {
9176 else
9177 {
9178 c_strlen_data lendata = { };
9184 /* TODO: Move this to gimple-ssa-warn-access once the pass runs
9185 also early enough to detect invalid reads in multimensional
9186 arrays and struct members. */
9191 {
9197 }
9200 }
9201 }
9203 /* Fold a call to __builtin_inf or __builtin_huge_val. */
9205 static tree
9207 {
9208 /* __builtin_inff is intended to be usable to define INFINITY on all
9209 targets. If an infinity is not available, INFINITY expands "to a
9210 positive constant of type float that overflows at translation
9211 time", footnote "In this case, using INFINITY will violate the
9212 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
9213 Thus we pedwarn to ensure this constraint violation is
9214 diagnosed. */
9219 }
9221 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
9222 NULL_TREE if no simplification can be made. */
9224 static tree
9227 {
9228 tree type;
9238 /* Calculate the result when the argument is a constant. */
9243 /* Canonicalize sincos to cexpi. */
9245 {
9248 }
9250 {
9257 }
9269 }
9271 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
9272 Return NULL_TREE if no simplification can be made. */
9274 static tree
9276 {
9282 /* If the LEN parameter is zero, return zero. */
9287 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9291 /* If len parameter is one, return an expression corresponding to
9292 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
9294 {
9296 tree cst_uchar_ptr_node
9299 tree ind1
9303 cst_uchar_ptr_node,
9304 arg1)));
9305 tree ind2
9309 cst_uchar_ptr_node,
9310 arg2)));
9312 }
9315 }
9317 /* Fold a call to builtin isascii with argument ARG. */
9319 static tree
9321 {
9324 else
9325 {
9326 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
9332 }
9333 }
9335 /* Fold a call to builtin toascii with argument ARG. */
9337 static tree
9339 {
9343 /* Transform toascii(c) -> (c & 0x7f). */
9346 }
9348 /* Fold a call to builtin isdigit with argument ARG. */
9350 static tree
9352 {
9355 else
9356 {
9357 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
9358 /* According to the C standard, isdigit is unaffected by locale.
9359 However, it definitely is affected by the target character set. */
9360 unsigned HOST_WIDE_INT target_digit0
9371 }
9372 }
9374 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
9376 static tree
9378 {
9384 }
9386 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
9388 static tree
9390 {
9396 }
9398 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
9400 static tree
9402 {
9405 {
9409 {
9414 }
9415 }
9418 }
9420 /* Fold a call to builtin frexp, we can assume the base is 2. */
9422 static tree
9424 {
9435 /* Proceed if a valid pointer type was passed in. */
9437 {
9442 {
9444 /* For +-0, return (*exp = 0, +-0). */
9450 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
9453 {
9454 /* Since the frexp function always expects base 2, and in
9455 GCC normalized significands are already in the range
9456 [0.5, 1.0), we have exactly what frexp wants. */
9461 }
9465 }
9467 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9473 }
9476 }
9478 /* Fold a call to builtin modf. */
9480 static tree
9482 {
9493 /* Proceed if a valid pointer type was passed in. */
9495 {
9498 tree res;
9501 {
9504 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
9508 /* For +-Inf, return (*arg1 = arg0, +-0). */
9514 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
9517 /* If the original number was negative and already
9518 integral, then the fractional part is -0.0. */
9522 }
9524 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9532 }
9535 }
9537 /* Given a location LOC, an interclass builtin function decl FNDECL
9538 and its single argument ARG, return an folded expression computing
9539 the same, or NULL_TREE if we either couldn't or didn't want to fold
9540 (the latter happen if there's an RTL instruction available). */
9542 static tree
9544 {
9545 machine_mode mode;
9557 /* If there is no optab, try generic code. */
9559 {
9560 tree result;
9563 {
9564 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
9567 REAL_VALUE_TYPE r;
9571 {
9572 /* NaN and Inf are encoded in the high-order double value
9573 only. The low-order value is not significant. */
9577 }
9584 }
9587 {
9588 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9591 REAL_VALUE_TYPE r;
9595 {
9596 /* NaN and Inf are encoded in the high-order double value
9597 only. The low-order value is not significant. */
9601 }
9607 /*result = fold_build2_loc (loc, UNGT_EXPR,
9608 TREE_TYPE (TREE_TYPE (fndecl)),
9609 fold_build1_loc (loc, ABS_EXPR, type, arg),
9610 build_real (type, r));
9611 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9612 TREE_TYPE (TREE_TYPE (fndecl)),
9613 result);*/
9615 }
9617 {
9618 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9619 islessequal(fabs(x),DBL_MAX). */
9629 {
9630 /* Use double to test the normal range of IBM extended
9631 precision. Emin for IBM extended precision is
9632 different to emin for IEEE double, being 53 higher
9633 since the low double exponent is at least 53 lower
9634 than the high double exponent. */
9638 }
9650 {
9651 /* Testing the high end of the range is done just using
9652 the high double, using the same test as isfinite().
9653 For the subnormal end of the range we first test the
9654 high double, then if its magnitude is equal to the
9655 limit of 0x1p-969, we test whether the low double is
9656 non-zero and opposite sign to the high double. */
9672 integer_type_node,
9678 }
9679 else
9680 {
9681 tree const isge_fn
9684 }
9688 }
9691 }
9694 }
9696 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9697 ARG is the argument for the call. */
9699 static tree
9701 {
9708 {
9717 {
9718 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9719 /* In a boolean context, GCC will fold the inner COND_EXPR to
9720 1. So e.g. "if (isinf_sign(x))" would be folded to just
9721 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9729 {
9742 integer_zero_node);
9743 }
9746 }
9761 {
9764 {
9765 /* NaN and Inf are encoded in the high-order double value
9766 only. The low-order value is not significant. */
9768 }
9769 }
9774 /* Folding to true for REAL_CST is done in fold_const_call_ss.
9775 Don't use tree_expr_signaling_nan_p (arg) -> integer_one_node
9776 and !tree_expr_maybe_signaling_nan_p (arg) -> integer_zero_node
9777 here, so there is some possibility of __builtin_issignaling working
9778 without -fsignaling-nans. Especially when -fno-signaling-nans is
9779 the default. */
9786 }
9787 }
9789 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9790 This builtin will generate code to return the appropriate floating
9791 point classification depending on the value of the floating point
9792 number passed in. The possible return values must be supplied as
9793 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9794 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9795 one floating point argument which is "type generic". */
9797 static tree
9799 {
9802 machine_mode mode;
9803 REAL_VALUE_TYPE r;
9806 /* Verify the required arguments in the original call. */
9826 /* fpclassify(x) ->
9827 isnan(x) ? FP_NAN :
9828 (fabs(x) == Inf ? FP_INFINITE :
9829 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9830 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9844 {
9849 }
9852 {
9855 }
9858 }
9860 /* Fold a call to an unordered comparison function such as
9861 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9862 being called and ARG0 and ARG1 are the arguments for the call.
9863 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9864 the opposite of the desired result. UNORDERED_CODE is used
9865 for modes that can hold NaNs and ORDERED_CODE is used for
9866 the rest. */
9868 static tree
9872 {
9886 /* Choose the wider of two real types. */
9900 {
9906 }
9912 }
9914 /* Fold a call to __builtin_iseqsig(). ARG0 and ARG1 are the arguments.
9915 After choosing the wider floating-point type for the comparison,
9916 the code is folded to:
9917 SAVE_EXPR<ARG0> >= SAVE_EXPR<ARG1> && SAVE_EXPR<ARG0> <= SAVE_EXPR<ARG1> */
9919 static tree
9921 {
9933 /* Choose the wider of two real types. */
9948 }
9950 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9951 arithmetics if it can never overflow, or into internal functions that
9952 return both result of arithmetics and overflowed boolean flag in
9953 a complex integer result, or some other check for overflow.
9954 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9955 checking part of that. */
9957 static tree
9960 {
9962 /* The code of the expression corresponding to the built-in. */
9967 {
9970 /* FALLTHRU */
9983 /* FALLTHRU */
9996 /* FALLTHRU */
10009 }
10011 /* For the "generic" overloads, the first two arguments can have different
10012 types and the last argument determines the target type to use to check
10013 for overflow. The arguments of the other overloads all have the same
10014 type. */
10017 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
10018 arguments are constant, attempt to fold the built-in call into a constant
10019 expression indicating whether or not it detected an overflow. */
10023 /* Perform the computation in the target type and check for overflow. */
10027 arg2);
10031 {
10039 }
10040 else
10041 {
10049 }
10055 tree store
10058 }
10060 /* Fold __builtin_{clz,ctz,clrsb,ffs,parity,popcount}g into corresponding
10061 internal function. */
10063 static tree
10066 {
10074 {
10117 }
10121 {
10128 {
10132 }
10133 else
10134 {
10136 ? long_long_unsigned_type_node
10139 }
10140 }
10142 {
10143 cast_type
10149 }
10150 else
10153 {
10155 {
10162 }
10165 }
10172 {
10176 }
10181 {
10182 /* __int128 expansions using up to 2 long long builtins. */
10185 ? long_long_unsigned_type_node
10193 {
10208 NULL_TREE),
10209 call);
10225 NULL_TREE),
10226 call);
10240 tem);
10245 call,
10247 MAX_FIXED_MODE_SIZE
10264 NULL_TREE),
10265 call);
10275 NULL_TREE),
10277 NULL_TREE));
10281 }
10282 }
10283 else
10284 {
10285 /* Only keep second argument to IFN_CLZ/IFN_CTZ if it is the
10286 value defined at zero during GIMPLE, or for large/huge _BitInt
10287 (which are then lowered during bitint lowering). */
10289 {
10292 {
10297 }
10303 OPTIMIZE_FOR_BOTH))
10307 }
10311 else
10313 arg0);
10314 }
10325 }
10327 /* Fold __builtin_{add,sub}c{,l,ll} into pair of internal functions
10328 that return both result of arithmetics and overflowed boolean
10329 flag in a complex integer result. */
10331 static tree
10334 {
10338 {
10351 }
10367 tree store
10370 }
10372 /* Fold a call to __builtin_FILE to a constant string. */
10376 {
10378 {
10379 /* The documentation says this builtin is equivalent to the preprocessor
10380 __FILE__ macro so it appears appropriate to use the same file prefix
10381 mappings. */
10384 }
10387 }
10389 /* Fold a call to __builtin_FUNCTION to a constant string. */
10393 {
10400 }
10402 /* Fold a call to __builtin_LINE to an integer constant. */
10406 {
10408 }
10410 /* Fold a call to built-in function FNDECL with 0 arguments.
10411 This function returns NULL_TREE if no simplification was possible. */
10413 static tree
10415 {
10419 {
10444 /* Rewrite any explicit calls to __builtin_unreachable. */
10451 }
10453 }
10455 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
10456 This function returns NULL_TREE if no simplification was possible. */
10458 static tree
10460 {
10471 {
10473 {
10476 /* Gimplification will pull the CALL_EXPR for the builtin out of
10477 an if condition. When not optimizing, we'll not CSE it back.
10478 To avoid link error types of regressions, return false now. */
10483 }
10540 {
10545 }
10551 {
10556 }
10588 }
10592 }
10594 /* Folds a call EXPR (which may be null) to built-in function FNDECL
10595 with 2 arguments, ARG0 and ARG1. This function returns NULL_TREE
10596 if no simplification was possible. */
10598 static tree
10600 {
10612 {
10656 NOP_EXPR);
10661 /* We do the folding for va_start in the expander. */
10681 }
10683 }
10685 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
10686 and ARG2.
10687 This function returns NULL_TREE if no simplification was possible. */
10689 static tree
10692 {
10706 {
10755 }
10757 }
10759 /* Folds a call EXPR (which may be null) to built-in function FNDECL.
10760 ARGS is an array of NARGS arguments. IGNORE is true if the result
10761 of the function call is ignored. This function returns NULL_TREE
10762 if no simplification was possible. */
10764 static tree
10767 {
10771 {
10787 }
10789 {
10793 }
10795 }
10797 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
10798 list ARGS along with N new arguments in NEWARGS. SKIP is the number
10799 of arguments in ARGS to be omitted. OLDNARGS is the number of
10800 elements in ARGS. */
10802 static tree
10805 {
10810 {
10818 }
10819 else
10823 }
10825 /* Return true if FNDECL shouldn't be folded right now.
10826 If a built-in function has an inline attribute always_inline
10827 wrapper, defer folding it after always_inline functions have
10828 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
10829 might not be performed. */
10831 bool
10833 {
10836 && cfun
10839 }
10841 /* A wrapper function for builtin folding that prevents warnings for
10842 "statement without effect" and the like, caused by removing the
10843 call node earlier than the warning is generated. */
10845 tree
10847 {
10851 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
10852 yet. Defer folding until we see all the arguments
10853 (after inlining). */
10855 {
10858 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
10859 instead last argument is __builtin_va_arg_pack (). Defer folding
10860 even in that case, until arguments are finalized. */
10862 {
10866 }
10874 else
10875 {
10880 }
10881 }
10883 }
10885 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
10886 N arguments are passed in the array ARGARRAY. Return a folded
10887 expression or NULL_TREE if no simplification was possible. */
10889 tree
10891 tree fn,
10894 {
10901 {
10902 /* If last argument is __builtin_va_arg_pack (), arguments to this
10903 function are not finalized yet. Defer folding until they are. */
10905 {
10909 }
10914 else
10916 }
10919 }
10921 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
10922 along with N new arguments specified as the "..." parameters. SKIP
10923 is the number of arguments in EXP to be omitted. This function is used
10924 to do varargs-to-varargs transformations. */
10926 static tree
10928 {
10930 tree t;
10938 }
10940 /* Validate a single argument ARG against a tree code CODE representing
10941 a type. Return true when argument is valid. */
10943 static bool
10945 {
10953 }
10955 /* This function validates the types of a function call argument list
10956 against a specified list of tree_codes. If the last specifier is a 0,
10957 that represents an ellipses, otherwise the last specifier must be a
10958 VOID_TYPE.
10960 This is the GIMPLE version of validate_arglist. Eventually we want to
10961 completely convert builtins.cc to work from GIMPLEs and the tree based
10962 validate_arglist will then be removed. */
10964 bool
10966 {
10970 const_tree arg;
10976 do
10977 {
10980 {
10982 /* This signifies an ellipses, any further arguments are all ok. */
10986 /* This signifies an endlink, if no arguments remain, return
10987 true, otherwise return false. */
10991 /* If no parameters remain or the parameter's code does not
10992 match the specified code, return false. Otherwise continue
10993 checking any remaining arguments. */
10998 }
10999 }
11002 /* We need gotos here since we can only have one VA_CLOSE in a
11003 function. */
11004 end: ;
11008 }
11010 /* Default target-specific builtin expander that does nothing. */
11012 rtx
11014 rtx target ATTRIBUTE_UNUSED,
11015 rtx subtarget ATTRIBUTE_UNUSED,
11016 machine_mode mode ATTRIBUTE_UNUSED,
11018 {
11020 }
11022 /* Returns true is EXP represents data that would potentially reside
11023 in a readonly section. */
11025 bool
11027 {
11037 /* Make sure we call decl_readonly_section only for trees it
11038 can handle (since it returns true for everything it doesn't
11039 understand). */
11044 else
11046 }
11048 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
11049 to the call, and TYPE is its return type.
11051 Return NULL_TREE if no simplification was possible, otherwise return the
11052 simplified form of the call as a tree.
11054 The simplified form may be a constant or other expression which
11055 computes the same value, but in a more efficient manner (including
11056 calls to other builtin functions).
11058 The call may contain arguments which need to be evaluated, but
11059 which are not useful to determine the result of the call. In
11060 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11061 COMPOUND_EXPR will be an argument which must be evaluated.
11062 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11063 COMPOUND_EXPR in the chain will contain the tree for the simplified
11064 form of the builtin function call. */
11066 static tree
11068 {
11073 tree fn;
11082 {
11084 tree tem;
11089 /* Return an offset into the constant string argument. */
11092 }
11095 /* strpbrk(x, "") == NULL.
11096 Evaluate and ignore s1 in case it had side-effects. */
11106 /* New argument list transforming strpbrk(s1, s2) to
11107 strchr(s1, s2[0]). */
11110 }
11112 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
11113 to the call.
11115 Return NULL_TREE if no simplification was possible, otherwise return the
11116 simplified form of the call as a tree.
11118 The simplified form may be a constant or other expression which
11119 computes the same value, but in a more efficient manner (including
11120 calls to other builtin functions).
11122 The call may contain arguments which need to be evaluated, but
11123 which are not useful to determine the result of the call. In
11124 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11125 COMPOUND_EXPR will be an argument which must be evaluated.
11126 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11127 COMPOUND_EXPR in the chain will contain the tree for the simplified
11128 form of the builtin function call. */
11130 static tree
11132 {
11143 /* If either argument is "", return NULL_TREE. */
11145 /* Evaluate and ignore both arguments in case either one has
11146 side-effects. */
11150 }
11152 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
11153 to the call.
11155 Return NULL_TREE if no simplification was possible, otherwise return the
11156 simplified form of the call as a tree.
11158 The simplified form may be a constant or other expression which
11159 computes the same value, but in a more efficient manner (including
11160 calls to other builtin functions).
11162 The call may contain arguments which need to be evaluated, but
11163 which are not useful to determine the result of the call. In
11164 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11165 COMPOUND_EXPR will be an argument which must be evaluated.
11166 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11167 COMPOUND_EXPR in the chain will contain the tree for the simplified
11168 form of the builtin function call. */
11170 static tree
11172 {
11181 /* If the first argument is "", return NULL_TREE. */
11184 {
11185 /* Evaluate and ignore argument s2 in case it has
11186 side-effects. */
11189 }
11191 /* If the second argument is "", return __builtin_strlen(s1). */
11194 {
11197 /* If the replacement _DECL isn't initialized, don't do the
11198 transformation. */
11203 }
11205 }
11207 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
11208 produced. False otherwise. This is done so that we don't output the error
11209 or warning twice or three times. */
11211 bool
11213 {
11216 tree arg;
11217 /* There is good chance the current input_location points inside the
11218 definition of the va_start macro (perhaps on the token for
11219 builtin) in a system header, so warnings will not be emitted.
11220 Use the location in real source code. */
11221 location_t current_location =
11223 NULL);
11226 {
11229 }
11232 {
11234 {
11237 }
11239 }
11240 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
11241 when we checked the arguments and if needed issued a warning. */
11242 else
11243 {
11245 {
11246 /* Evidently an out of date version of <stdarg.h>; can't validate
11247 va_start's second argument, but can still work as intended. */
11249 OPT_Wvarargs,
11252 }
11254 {
11257 }
11259 }
11265 /* We destructively modify the call to be __builtin_va_start (ap, 0)
11266 or __builtin_next_arg (0) the first time we see it, after checking
11267 the arguments and if needed issuing a warning. */
11269 {
11272 /* Strip off all nops for the sake of the comparison. This
11273 is not quite the same as STRIP_NOPS. It does more.
11274 We must also strip off INDIRECT_EXPR for C++ reference
11275 parameters. */
11280 {
11281 /* FIXME: Sometimes with the tree optimizers we can get the
11282 not the last argument even though the user used the last
11283 argument. We just warn and set the arg to be the last
11284 argument so that we will get wrong-code because of
11285 it. */
11287 OPT_Wvarargs,
11289 }
11291 /* Undefined by C99 7.15.1.4p4 (va_start):
11292 "If the parameter parmN is declared with the register storage
11293 class, with a function or array type, or with a type that is
11294 not compatible with the type that results after application of
11295 the default argument promotions, the behavior is undefined."
11296 */
11298 {
11300 OPT_Wvarargs,
11301 "undefined behavior when second parameter of "
11303 }
11305 /* We want to verify the second parameter just once before the tree
11306 optimizers are run and then avoid keeping it in the tree,
11307 as otherwise we could warn even for correct code like:
11308 void foo (int i, ...)
11309 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
11312 else
11314 }
11316 }
11319 /* Expand a call EXP to __builtin_object_size. */
11321 static rtx
11323 {
11324 tree ost;
11329 {
11331 fndecl);
11334 }
11342 {
11344 fndecl);
11347 }
11352 }
11354 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
11355 FCODE is the BUILT_IN_* to use.
11356 Return NULL_RTX if we failed; the caller should emit a normal call,
11357 otherwise try to get the result in TARGET, if convenient (and in
11358 mode MODE if that's convenient). */
11360 static rtx
11363 {
11365 POINTER_TYPE,
11366 fcode == BUILT_IN_MEMSET_CHK
11376 /* FIXME: Set access mode to write only for memset et al. */
11384 {
11385 /* Avoid transforming the checking call to an ordinary one when
11386 an overflow has been detected or when the call couldn't be
11387 validated because the size is not constant. */
11392 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
11393 mem{cpy,pcpy,move,set} is available. */
11395 {
11410 }
11419 }
11422 else
11423 {
11426 /* If DEST is not a pointer type, call the normal function. */
11430 /* If SRC and DEST are the same (and not volatile), do nothing. */
11432 {
11433 tree expr;
11436 {
11437 /* Evaluate and ignore LEN in case it has side-effects. */
11440 }
11444 }
11446 /* __memmove_chk special case. */
11448 {
11454 /* If src is categorized for a readonly section we can use
11455 normal __memcpy_chk. */
11457 {
11466 }
11467 }
11469 }
11470 }
11472 /* Emit warning if a buffer overflow is detected at compile time. */
11474 static void
11476 {
11477 /* The source string. */
11479 /* The size of the destination object returned by __builtin_object_size. */
11481 /* The string that is being concatenated with (as in __strcat_chk)
11482 or null if it isn't. */
11484 /* The maximum length of the source sequence in a bounded operation
11485 (such as __strncat_chk) or null if the operation isn't bounded
11486 (such as __strcat_chk). */
11488 /* The exact size of the access (such as in __strncpy_chk). */
11490 /* The access by the function that's checked. Except for snprintf
11491 both writing and reading is checked. */
11495 {
11503 /* For __strcat_chk the warning will be emitted only if overflowing
11504 by at least strlen (dest) + 1 bytes. */
11528 /* The only checked access the write to the destination. */
11533 }
11536 {
11537 /* Check __strncat_chk. There is no way to determine the length
11538 of the string to which the source string is being appended so
11539 just warn when the length of the source string is not known. */
11542 }
11545 }
11547 /* Emit warning if a buffer overflow is detected at compile time
11548 in __sprintf_chk/__vsprintf_chk calls. */
11550 static void
11552 {
11557 /* Verify the required arguments in the original call. */
11567 /* Check whether the format is a literal string constant. */
11575 /* If the format doesn't contain % args or %%, we know its size. */
11578 /* If the format is "%s" and first ... argument is a string literal,
11579 we know it too. */
11582 {
11583 tree arg;
11594 }
11595 else
11598 /* Add one for the terminating nul. */
11602 access_write_only);
11603 }
11605 /* Fold a call to __builtin_object_size with arguments PTR and OST,
11606 if possible. */
11608 static tree
11610 {
11611 tree bytes;
11627 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
11628 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
11629 and (size_t) 0 for types 2 and 3. */
11637 {
11642 }
11644 {
11645 /* If object size is not known yet, delay folding until
11646 later. Maybe subsequent passes will help determining
11647 it. */
11652 }
11655 }
11657 /* Builtins with folding operations that operate on "..." arguments
11658 need special handling; we need to store the arguments in a convenient
11659 data structure before attempting any folding. Fortunately there are
11660 only a few builtins that fall into this category. FNDECL is the
11661 function, EXP is the CALL_EXPR for the call. */
11663 static tree
11665 {
11670 {
11685 }
11687 {
11692 }
11694 }
11696 /* Initialize format string characters in the target charset. */
11698 bool
11700 {
11703 {
11726 }
11728 }
11730 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
11731 and no overflow/underflow occurred. INEXACT is true if M was not
11732 exactly calculated. TYPE is the tree type for the result. This
11733 function assumes that you cleared the MPFR flags and then
11734 calculated M to see if anything subsequently set a flag prior to
11735 entering this function. Return NULL_TREE if any checks fail. */
11737 static tree
11739 {
11740 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
11741 overflow/underflow occurred. If -frounding-math, proceed iff the
11742 result of calling FUNC was exact. */
11745 {
11746 REAL_VALUE_TYPE rr;
11749 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
11750 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
11751 but the mpfr_t is not, then we underflowed in the
11752 conversion. */
11755 {
11756 REAL_VALUE_TYPE rmode;
11759 /* Proceed iff the specified mode can hold the value. */
11762 }
11763 }
11765 }
11767 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
11768 number and no overflow/underflow occurred. INEXACT is true if M
11769 was not exactly calculated. TYPE is the tree type for the result.
11770 This function assumes that you cleared the MPFR flags and then
11771 calculated M to see if anything subsequently set a flag prior to
11772 entering this function. Return NULL_TREE if any checks fail, if
11773 FORCE_CONVERT is true, then bypass the checks. */
11775 static tree
11777 {
11778 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
11779 overflow/underflow occurred. If -frounding-math, proceed iff the
11780 result of calling FUNC was exact. */
11785 {
11790 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
11791 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
11792 but the mpfr_t is not, then we underflowed in the
11793 conversion. */
11798 {
11803 /* Proceed iff the specified mode can hold the value. */
11809 }
11810 }
11812 }
11814 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
11815 the pointer *(ARG_QUO) and return the result. The type is taken
11816 from the type of ARG0 and is used for setting the precision of the
11817 calculation and results. */
11819 static tree
11821 {
11828 /* To proceed, MPFR must exactly represent the target floating point
11829 format, which only happens when the target base equals two. */
11833 {
11838 {
11842 tree result_rem;
11851 /* Remquo is independent of the rounding mode, so pass
11852 inexact=0 to do_mpfr_ckconv(). */
11856 {
11857 /* MPFR calculates quo in the host's long so it may
11858 return more bits in quo than the target int can hold
11859 if sizeof(host long) > sizeof(target int). This can
11860 happen even for native compilers in LP64 mode. In
11861 these cases, modulo the quo value with the largest
11862 number that the target int can hold while leaving one
11863 bit for the sign. */
11867 /* Dereference the quo pointer argument. */
11869 /* Proceed iff a valid pointer type was passed in. */
11871 {
11872 /* Set the value. */
11873 tree result_quo
11876 integer_quo));
11878 /* Combine the quo assignment with the rem. */
11883 }
11884 }
11885 }
11886 }
11888 }
11890 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
11891 resulting value as a tree with type TYPE. The mpfr precision is
11892 set to the precision of TYPE. We assume that this mpfr function
11893 returns zero if the result could be calculated exactly within the
11894 requested precision. In addition, the integer pointer represented
11895 by ARG_SG will be dereferenced and set to the appropriate signgam
11896 (-1,1) value. */
11898 static tree
11900 {
11905 /* To proceed, MPFR must exactly represent the target floating point
11906 format, which only happens when the target base equals two. Also
11907 verify ARG is a constant and that ARG_SG is an int pointer. */
11912 {
11915 /* In addition to NaN and Inf, the argument cannot be zero or a
11916 negative integer. */
11920 {
11925 tree result_lg;
11933 {
11934 tree result_sg;
11936 /* Dereference the arg_sg pointer argument. */
11938 /* Assign the signgam value into *arg_sg. */
11943 /* Combine the signgam assignment with the lgamma result. */
11946 }
11947 }
11948 }
11951 }
11953 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
11954 mpc function FUNC on it and return the resulting value as a tree
11955 with type TYPE. The mpfr precision is set to the precision of
11956 TYPE. We assume that function FUNC returns zero if the result
11957 could be calculated exactly within the requested precision. If
11958 DO_NONFINITE is true, then fold expressions containing Inf or NaN
11959 in the arguments and/or results. */
11961 tree
11964 {
11970 /* To proceed, MPFR must exactly represent the target floating point
11971 format, which only happens when the target base equals two. */
11977 {
11986 {
12007 }
12008 }
12011 }
12013 /* A wrapper function for builtin folding that prevents warnings for
12014 "statement without effect" and the like, caused by removing the
12015 call node earlier than the warning is generated. */
12017 tree
12019 {
12025 {
12034 {
12036 }
12037 else
12038 {
12041 {
12042 /* Propagate location information from original call to
12043 expansion of builtin. Otherwise things like
12044 maybe_emit_chk_warning, that operate on the expansion
12045 of a builtin, will use the wrong location information. */
12047 {
12055 }
12057 }
12058 }
12059 }
12061 }
12063 /* Look up the function in builtin_decl that corresponds to DECL
12064 and set ASMSPEC as its user assembler name. DECL must be a
12065 function decl that declares a builtin. */
12067 void
12069 {
12078 {
12082 }
12083 }
12085 /* Return true if DECL is a builtin that expands to a constant or similarly
12086 simple code. */
12087 bool
12089 {
12092 {
12093 /* Builtins that expand to constants. */
12098 /* Simple register moves or loads from stack. */
12110 /* Exception state returns or moves registers around. */
12118 }
12121 }
12123 /* Return true if DECL is a builtin that is not expensive, i.e., they are
12124 most probably expanded inline into reasonably simple code. This is a
12125 superset of is_simple_builtin. */
12126 bool
12128 {
12135 {
12137 CASE_BUILT_IN_ALLOCA:
12206 }
12209 }
12211 /* Return true if T is a constant and the value cast to a target char
12212 can be represented by a host char.
12213 Store the casted char constant in *P if so. */
12215 bool
12217 {
12223 }
12225 /* Return true if the builtin DECL is implemented in a standard library.
12226 Otherwise return false which doesn't guarantee it is not (thus the list
12227 of handled builtins below may be incomplete). */
12229 bool
12231 {
12234 {
12353 /* stpcpy is both referenced in libiberty's pex-win32.c and provided
12354 by libiberty's stpcpy.c for MinGW targets so we need to return true
12355 in order to be able to build libiberty in LTO mode for them. */
12360 }
12362 }
12364 /* Return true if OFFRNG is bounded to a subrange of offset values
12365 valid for the largest possible object. */
12367 bool
12369 {
12373 }
12375 /* If CALLEE has known side effects, fill in INFO and return true.
12376 See tree-ssa-structalias.cc:find_func_aliases
12377 for the list of builtins we might need to handle here. */
12379 attr_fnspec
12381 {
12385 {
12386 /* All the following functions read memory pointed to by
12387 their second argument and write memory pointed to by first
12388 argument.
12389 strcat/strncat additionally reads memory pointed to by the first
12390 argument. */
12430 /* The following functions read memory pointed to by their
12431 first argument. */
12464 /* These read memory pointed to by the first argument.
12465 Allocating memory does not have any side-effects apart from
12466 being the definition point for the pointer.
12467 Unix98 specifies that errno is set on allocation failure. */
12472 /* Allocating memory does not have any side-effects apart from
12473 being the definition point for the pointer. */
12479 CASE_BUILT_IN_ALLOCA:
12481 /* These read memory pointed to by the first argument with size
12482 in the third argument. */
12485 /* These read memory pointed to by the first and second arguments. */
12494 /* Freeing memory kills the pointed-to memory. More importantly
12495 the call has to serve as a barrier for moving loads and stores
12496 across it. */
12503 /* Realloc serves both as allocation point and deallocation point. */
12563 /* But posix_memalign stores a pointer into the memory pointed to
12564 by its first argument. */
12570 }
12571 }