| blob | 37c7c98e5c7db645235436a73411a0680b2317d8 |
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). */
1286 /* Argument 0 is an address. */
1289 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1293 {
1296 }
1297 else
1299 /* Argument 1 must be either zero or one. */
1301 {
1305 }
1307 /* Argument 2 (locality) must be a compile-time constant int. */
1311 {
1314 }
1315 else
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 {
2475 /* These builtins have no optabs (yet). */
2479 }
2481 /* There's no easy way to detect the case we need to set EDOM. */
2485 /* Optab mode depends on the mode of the input argument. */
2491 }
2493 /* Expand a call to one of the builtin math functions that operate on
2494 floating point argument and output an integer result (ilogb, isinf,
2495 isnan, etc).
2496 Return 0 if a normal call should be emitted rather than expanding the
2497 function in-line. EXP is the expression that is a call to the builtin
2498 function; if convenient, the result should be placed in TARGET. */
2500 static rtx
2502 {
2504 rtx op0;
2506 machine_mode mode;
2507 tree arg;
2517 {
2522 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2523 need to expand the argument again. This way, we will not perform
2524 side-effects more the once. */
2539 }
2542 }
2544 /* Expand a call to the builtin sincos math function.
2545 Return NULL_RTX if a normal call should be emitted rather than expanding the
2546 function in-line. EXP is the expression that is a call to the builtin
2547 function. */
2549 static rtx
2551 {
2553 machine_mode mode;
2567 /* Make a suitable register to place result in. */
2570 /* Check if sincos insn is available, otherwise emit the call. */
2585 /* Compute into target1 and target2.
2586 Set TARGET to wherever the result comes back. */
2590 /* Move target1 and target2 to the memory locations indicated
2591 by op1 and op2. */
2596 }
2598 /* Expand call EXP to the fegetround builtin (from C99 fenv.h), returning the
2599 result and setting it in TARGET. Otherwise return NULL_RTX on failure. */
2600 static rtx
2602 {
2621 }
2623 /* Expand call EXP to either feclearexcept or feraiseexcept builtins (from C99
2624 fenv.h), returning the result and setting it in TARGET. Otherwise return
2625 NULL_RTX on failure. */
2626 static rtx
2629 {
2652 }
2654 /* Expand a call to the internal cexpi builtin to the sincos math function.
2655 EXP is the expression that is a call to the builtin function; if convenient,
2656 the result should be placed in TARGET. */
2658 static rtx
2660 {
2663 machine_mode mode;
2674 /* Try expanding via a sincos optab, fall back to emitting a libcall
2675 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2676 is only generated from sincos, cexp or if we have either of them. */
2678 {
2684 /* Compute into op1 and op2. */
2686 }
2688 {
2699 else
2709 /* Make sure not to fold the sincos call again. */
2713 }
2714 else
2715 {
2725 else
2728 /* If we don't have a decl for cexp create one. This is the
2729 friendliest fallback if the user calls __builtin_cexpi
2730 without full target C99 function support. */
2732 {
2733 tree fntype;
2745 }
2750 /* Make sure not to fold the cexp call again. */
2754 }
2756 /* Now build the proper return type. */
2761 }
2763 /* Conveniently construct a function call expression. FNDECL names the
2764 function to be called, N is the number of arguments, and the "..."
2765 parameters are the argument expressions. Unlike build_call_exr
2766 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2768 static tree
2770 {
2780 }
2782 /* Expand the __builtin_issignaling builtin. This needs to handle
2783 all floating point formats that do support NaNs (for those that
2784 don't it just sets target to 0). */
2786 static rtx
2788 {
2796 /* Expand the argument yielding a RTX expression. */
2799 /* If mode doesn't support NaN, always return 0.
2800 Don't use !HONOR_SNANS (fmode) here, so there is some possibility of
2801 __builtin_issignaling working without -fsignaling-nans. Especially
2802 when -fno-signaling-nans is the default.
2803 On the other side, MODE_HAS_NANS (fmode) is unnecessary, with
2804 -ffinite-math-only even __builtin_isnan or __builtin_fpclassify
2805 fold to 0 or non-NaN/Inf classification. */
2807 {
2810 }
2812 /* Check if the back end provides an insn that handles issignaling for the
2813 argument's mode. */
2816 {
2822 }
2825 {
2826 scalar_int_mode imode;
2827 rtx hi;
2829 {
2838 /* For decimal128, TImode support isn't always there and even when
2839 it is, working on the DImode high part is usually better. */
2841 {
2844 else
2845 {
2846 scalar_int_mode imode2;
2848 {
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 {
2944 {
2945 scalar_int_mode imode2;
2947 {
2951 }
2952 }
2954 {
2958 }
2959 }
2961 {
2962 poly_int64 offset
2967 }
2971 {
2975 /* For non-MIPS/PA IEEE quad, expand to:
2976 (((hi ^ bit) | ((lo | -lo) >> 63)) & mask) > val. */
2989 }
2990 else
2991 {
2992 /* For MIPS/PA IEEE quad, expand to:
2993 (hi & val) == val. */
2998 }
2999 }
3002 extended:
3003 {
3008 {
3012 }
3014 {
3015 /* Motorola, always big endian, with 16-bit gap in between
3016 16-bit sign+exponent and 64-bit mantissa. */
3020 }
3022 {
3023 /* Intel little endian, 64-bit mantissa followed by 16-bit
3024 sign+exponent and then either 16 or 48 bits of gap. */
3028 }
3029 else
3030 {
3031 /* Big endian Itanium. */
3035 }
3040 /* For Intel/Motorola extended format, expand to:
3041 (ex & mask) == mask && ((hi ^ bit) | ((lo | -lo) >> 31)) > val. */
3057 }
3061 }
3064 }
3066 /* Expand a call to one of the builtin rounding functions gcc defines
3067 as an extension (lfloor and lceil). As these are gcc extensions we
3068 do not need to worry about setting errno to EDOM.
3069 If expanding via optab fails, lower expression to (int)(floor(x)).
3070 EXP is the expression that is a call to the builtin function;
3071 if convenient, the result should be placed in TARGET. */
3073 static rtx
3075 {
3076 convert_optab builtin_optab;
3081 tree fallback_fndecl;
3082 machine_mode mode;
3083 tree arg;
3091 {
3108 }
3110 /* Make a suitable register to place result in. */
3115 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
3116 need to expand the argument again. This way, we will not perform
3117 side-effects more the once. */
3124 /* Compute into TARGET. */
3126 {
3127 /* Output the entire sequence. */
3132 }
3134 /* If we were unable to expand via the builtin, stop the sequence
3135 (without outputting the insns). */
3138 /* Fall back to floating point rounding optab. */
3141 /* For non-C99 targets we may end up without a fallback fndecl here
3142 if the user called __builtin_lfloor directly. In this case emit
3143 a call to the floor/ceil variants nevertheless. This should result
3144 in the best user experience for not full C99 targets. */
3146 {
3147 tree fntype;
3151 {
3184 }
3189 }
3196 /* Truncate the result of floating point optab to integer
3197 via expand_fix (). */
3202 }
3204 /* Expand a call to one of the builtin math functions doing integer
3205 conversion (lrint).
3206 Return 0 if a normal call should be emitted rather than expanding the
3207 function in-line. EXP is the expression that is a call to the builtin
3208 function; if convenient, the result should be placed in TARGET. */
3210 static rtx
3212 {
3213 convert_optab builtin_optab;
3214 rtx op0;
3217 tree arg;
3218 machine_mode mode;
3227 {
3246 }
3248 /* There's no easy way to detect the case we need to set EDOM. */
3252 /* Make a suitable register to place result in. */
3255 /* There's no easy way to detect the case we need to set EDOM. */
3257 {
3260 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
3261 need to expand the argument again. This way, we will not perform
3262 side-effects more the once. */
3270 {
3271 /* Output the entire sequence. */
3276 }
3278 /* If we were unable to expand via the builtin, stop the sequence
3279 (without outputting the insns) and call to the library function
3280 with the stabilized argument list. */
3282 }
3285 {
3286 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
3287 targets, (int) round (x) should never be transformed into
3288 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
3289 a call to lround in the hope that the target provides at least some
3290 C99 functions. This should result in the best user experience for
3291 not full C99 targets.
3292 As scalar float conversions with same mode are useless in GIMPLE,
3293 we can end up e.g. with _Float32 argument passed to float builtin,
3294 try to get the type from the builtin prototype first. */
3297 fallback_fndecl
3301 fallback_fndecl
3305 {
3312 }
3313 }
3316 }
3318 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
3319 a normal call should be emitted rather than expanding the function
3320 in-line. EXP is the expression that is a call to the builtin
3321 function; if convenient, the result should be placed in TARGET. */
3323 static rtx
3325 {
3328 machine_mode mode;
3329 machine_mode mode2;
3338 /* Emit a libcall to libgcc. */
3340 /* Mode of the 2nd argument must match that of an int. */
3358 }
3360 /* Expand expression EXP which is a call to the strlen builtin. Return
3361 NULL_RTX if we failed and the caller should emit a normal call, otherwise
3362 try to get the result in TARGET, if convenient. */
3364 static rtx
3366 machine_mode target_mode)
3367 {
3373 /* If the length can be computed at compile-time, return it. */
3377 /* If the length can be computed at compile-time and is constant
3378 integer, but there are side-effects in src, evaluate
3379 src for side-effects, then return len.
3380 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
3381 can be optimized into: i++; x = 3; */
3384 {
3387 }
3391 /* If SRC is not a pointer type, don't do this operation inline. */
3395 /* Bail out if we can't compute strlen in the right mode. */
3396 machine_mode insn_mode;
3399 {
3403 }
3407 /* Make a place to hold the source address. We will not expand
3408 the actual source until we are sure that the expansion will
3409 not fail -- there are trees that cannot be expanded twice. */
3412 /* Mark the beginning of the strlen sequence so we can emit the
3413 source operand later. */
3424 /* Check to see if the argument was declared attribute nonstring
3425 and if so, issue a warning since at this point it's not known
3426 to be nul-terminated. */
3429 /* Now that we are assured of success, expand the source. */
3433 {
3434 #ifdef POINTERS_EXTEND_UNSIGNED
3437 POINTERS_EXTEND_UNSIGNED);
3438 #endif
3440 }
3446 else
3449 /* Return the value in the proper mode for this function. */
3454 else
3458 }
3460 /* Expand call EXP to the strnlen built-in, returning the result
3461 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
3463 static rtx
3465 {
3479 /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
3480 so these conversions aren't necessary. */
3481 c_strlen_data lendata = { };
3487 {
3493 }
3499 int_range_max r;
3507 {
3512 }
3522 }
3524 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3525 bytes from bytes at DATA + OFFSET and return it reinterpreted as
3526 a target constant. */
3528 static rtx
3530 fixed_size_mode mode)
3531 {
3532 /* The REPresentation pointed to by DATA need not be a nul-terminated
3533 string but the caller guarantees it's large enough for MODE. */
3537 }
3539 /* LEN specify length of the block of memcpy/memset operation.
3540 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3541 In some cases we can make very likely guess on max size, then we
3542 set it into PROBABLE_MAX_SIZE. */
3544 static void
3549 {
3551 {
3554 }
3555 else
3556 {
3560 /* Determine bounds from the type. */
3563 else
3568 else
3572 {
3573 int_range_max r;
3578 {
3581 }
3582 }
3584 {
3589 }
3591 {
3592 /* Code like
3594 int n;
3595 if (n < 100)
3596 memcpy (a, b, n)
3598 Produce anti range allowing negative values of N. We still
3599 can use the information and make a guess that N is not negative.
3600 */
3603 }
3604 }
3608 }
3610 /* Expand a call EXP to the memcpy builtin.
3611 Return NULL_RTX if we failed, the caller should emit a normal call,
3612 otherwise try to get the result in TARGET, if convenient (and in
3613 mode MODE if that's convenient). */
3615 static rtx
3617 {
3628 }
3630 /* Check a call EXP to the memmove built-in for validity.
3631 Return NULL_RTX on both success and failure. */
3633 static rtx
3635 {
3646 }
3648 /* Expand a call EXP to the mempcpy builtin.
3649 Return NULL_RTX if we failed; the caller should emit a normal call,
3650 otherwise try to get the result in TARGET, if convenient (and in
3651 mode MODE if that's convenient). */
3653 static rtx
3655 {
3664 /* Policy does not generally allow using compute_objsize (which
3665 is used internally by check_memop_size) to change code generation
3666 or drive optimization decisions.
3668 In this instance it is safe because the code we generate has
3669 the same semantics regardless of the return value of
3670 check_memop_sizes. Exactly the same amount of data is copied
3671 and the return value is exactly the same in both cases.
3673 Furthermore, check_memop_size always uses mode 0 for the call to
3674 compute_objsize, so the imprecise nature of compute_objsize is
3675 avoided. */
3677 /* Avoid expanding mempcpy into memcpy when the call is determined
3678 to overflow the buffer. This also prevents the same overflow
3679 from being diagnosed again when expanding memcpy. */
3683 }
3685 /* Helper function to do the actual work for expand of memory copy family
3686 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3687 of memory from SRC to DEST and assign to TARGET if convenient. Return
3688 value is based on RETMODE argument. */
3690 static rtx
3694 {
3706 /* If DEST is not a pointer type, call the normal function. */
3710 /* If either SRC is not a pointer type, don't do this
3711 operation in-line. */
3727 /* Try to get the byte representation of the constant SRC points to,
3728 with its byte size in NBYTES. */
3732 /* If the function's constant bound LEN_RTX is less than or equal
3733 to the byte size of the representation of the constant argument,
3734 and if block move would be done by pieces, we can avoid loading
3735 the bytes from memory and only store the computed constant.
3736 This works in the overlap (memmove) case as well because
3737 store_by_pieces just generates a series of stores of constants
3738 from the representation returned by getbyterep(). */
3745 {
3747 builtin_memcpy_read_str,
3753 }
3758 /* Copy word part most expediently. */
3765 && !might_overlap
3775 /* Bail out when a mempcpy call would be expanded as libcall and when
3776 we have a target that provides a fast implementation
3777 of mempcpy routine. */
3785 {
3788 }
3791 {
3793 /* stpcpy pointer to last byte. */
3796 }
3799 }
3801 static rtx
3804 {
3807 }
3809 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3810 we failed, the caller should emit a normal call, otherwise try to
3811 get the result in TARGET, if convenient.
3812 Return value is based on RETMODE argument. */
3814 static rtx
3816 {
3818 rtx dest_mem;
3819 rtx src_mem;
3827 {
3830 }
3840 {
3842 /* movstr is supposed to set end to the address of the NUL
3843 terminator. If the caller requested a mempcpy-like return value,
3844 adjust it. */
3846 {
3850 }
3851 }
3853 }
3855 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3856 NULL_RTX if we failed the caller should emit a normal call, otherwise
3857 try to get the result in TARGET, if convenient (and in mode MODE if that's
3858 convenient). */
3860 static rtx
3862 {
3870 }
3872 /* Helper function to do the actual work for expand_builtin_strcpy. The
3873 arguments to the builtin_strcpy call DEST and SRC are broken out
3874 so that this can also be called without constructing an actual CALL_EXPR.
3875 The other arguments and return value are the same as for
3876 expand_builtin_strcpy. */
3878 static rtx
3880 {
3882 }
3884 /* Expand a call EXP to the stpcpy builtin.
3885 Return NULL_RTX if we failed the caller should emit a normal call,
3886 otherwise try to get the result in TARGET, if convenient (and in
3887 mode MODE if that's convenient). */
3889 static rtx
3891 {
3901 /* If return value is ignored, transform stpcpy into strcpy. */
3903 {
3907 }
3908 else
3909 {
3911 rtx ret;
3913 /* Ensure we get an actual string whose length can be evaluated at
3914 compile-time, not an expression containing a string. This is
3915 because the latter will potentially produce pessimized code
3916 when used to produce the return value. */
3917 c_strlen_data lendata = { };
3932 {
3936 {
3940 {
3942 {
3945 else
3947 }
3956 }
3957 }
3958 }
3962 }
3963 }
3965 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
3966 arguments while being careful to avoid duplicate warnings (which could
3967 be issued if the expander were to expand the call, resulting in it
3968 being emitted in expand_call(). */
3970 static rtx
3972 {
3974 {
3975 /* The call has been successfully expanded. Check for nonstring
3976 arguments and issue warnings as appropriate. */
3979 }
3982 }
3984 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3985 bytes from constant string DATA + OFFSET and return it as target
3986 constant. */
3988 rtx
3990 fixed_size_mode mode)
3991 {
3998 }
4000 /* Helper to check the sizes of sequences and the destination of calls
4001 to __builtin_strncat and __builtin___strncat_chk. Returns true on
4002 success (no overflow or invalid sizes), false otherwise. */
4004 static bool
4006 {
4011 /* Try to determine the range of lengths that the source expression
4012 refers to. */
4013 c_strlen_data lendata = { };
4016 /* Try to verify that the destination is big enough for the shortest
4017 string. */
4021 {
4022 /* If it hasn't been provided by __strncat_chk, try to determine
4023 the size of the destination object into which the source is
4024 being copied. */
4026 }
4028 /* Add one for the terminating nul. */
4031 size_one_node)
4034 /* The strncat function copies at most MAXREAD bytes and always appends
4035 the terminating nul so the specified upper bound should never be equal
4036 to (or greater than) the size of the destination. */
4039 {
4046 }
4054 /* The number of bytes to write is LEN but check_access will alsoa
4055 check SRCLEN if LEN's value isn't known. */
4058 }
4060 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4061 NULL_RTX if we failed the caller should emit a normal call. */
4063 static rtx
4065 {
4073 /* The number of bytes to write (not the maximum). */
4076 /* The length of the source sequence. */
4079 /* We must be passed a constant len and src parameter. */
4085 /* We're required to pad with trailing zeros if the requested
4086 len is greater than strlen(s2)+1. In that case try to
4087 use store_by_pieces, if it fails, punt. */
4089 {
4092 rtx dest_mem;
4096 builtin_strncpy_read_str,
4103 builtin_strncpy_read_str,
4105 RETURN_BEGIN);
4109 }
4112 }
4114 /* Return the RTL of a register in MODE generated from PREV in the
4115 previous iteration. */
4117 static rtx
4119 {
4122 {
4123 /* Use the previous data in the same mode. */
4129 /* Don't use the previous data to write QImode if it is in a
4130 vector mode. */
4139 {
4140 /* This case occurs when PREV_MODE is a vector and when
4141 MODE is too small to store using vector operations.
4142 After register allocation, the code will need to move the
4143 lowpart of the vector register into a non-vector register.
4145 Also, the target has chosen to use a hard register
4146 instead of going with the default choice of using a
4147 pseudo register. We should respect that choice and try to
4148 avoid creating a pseudo register with the same mode as the
4149 current hard register.
4151 In principle, we could just use a lowpart MODE subreg of
4152 the vector register. However, the vector register mode might
4153 be too wide for non-vector registers, and we already know
4154 that the non-vector mode is too small for vector registers.
4155 It's therefore likely that we'd need to spill to memory in
4156 the vector mode and reload the non-vector value from there.
4158 Try to avoid that by reducing the vector register to the
4159 smallest size that it can hold. This should increase the
4160 chances that non-vector registers can hold both the inner
4161 and outer modes of the subreg that we generate later. */
4162 machine_mode m;
4163 fixed_size_mode candidate;
4166 {
4173 {
4175 prev_mode);
4179 }
4180 }
4183 }
4186 }
4188 }
4190 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4191 bytes from constant string DATA + OFFSET and return it as target
4192 constant. If PREV isn't nullptr, it has the RTL info from the
4193 previous iteration. */
4195 rtx
4197 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
4198 fixed_size_mode mode)
4199 {
4204 mode);
4210 {
4215 /* Return CONST_VECTOR when called by a query function. */
4218 /* Use the move expander with CONST_VECTOR. */
4222 }
4229 }
4231 /* Callback routine for store_by_pieces. Return the RTL of a register
4232 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4233 char value given in the RTL register data. For example, if mode is
4234 4 bytes wide, return the RTL for 0x01010101*data. If PREV isn't
4235 nullptr, it has the RTL info from the previous iteration. */
4237 static rtx
4239 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
4240 fixed_size_mode mode)
4241 {
4255 {
4258 /* vec_duplicate_optab is a precondition to pick a vector mode for
4259 the memset expander. */
4271 }
4280 }
4282 /* Expand expression EXP, which is a call to the memset builtin. Return
4283 NULL_RTX if we failed the caller should emit a normal call, otherwise
4284 try to get the result in TARGET, if convenient (and in mode MODE if that's
4285 convenient). */
4287 rtx
4289 {
4299 }
4301 /* Check that store_by_pieces allows BITS + LEN (so that we don't
4302 expand something too unreasonably long), and every power of 2 in
4303 BITS. It is assumed that LEN has already been tested by
4304 itself. */
4305 static bool
4307 by_pieces_constfn constfun,
4311 {
4317 /* BITS set are expected to be generally in the low range and
4318 contiguous. We do NOT want to repeat the test above in case BITS
4319 has a single bit set, so we terminate the loop when BITS == BIT.
4320 In the unlikely case that BITS has the MSB set, also terminate in
4321 case BIT gets shifted out. */
4323 {
4330 }
4333 }
4335 /* Try to store VAL (or, if NULL_RTX, VALC) in LEN bytes starting at TO.
4336 Return TRUE if successful, FALSE otherwise. TO is assumed to be
4337 aligned at an ALIGN-bits boundary. LEN must be a multiple of
4338 1<<CTZ_LEN between MIN_LEN and MAX_LEN.
4340 The strategy is to issue one store_by_pieces for each power of two,
4341 from most to least significant, guarded by a test on whether there
4342 are at least that many bytes left to copy in LEN.
4344 ??? Should we skip some powers of two in favor of loops? Maybe start
4345 at the max of TO/LEN/word alignment, at least when optimizing for
4346 size, instead of ensuring O(log len) dynamic compares? */
4348 bool
4353 {
4363 /* Bits more significant than TST_BITS are part of the shared prefix
4364 in the binary representation of both min_len and max_len. Since
4365 they're identical, we don't need to test them in the loop. */
4369 /* Save the pre-blksize values. */
4373 /* Check whether it's profitable to start by storing a fixed BLKSIZE
4374 bytes, to lower max_bits. In the unlikely case of a constant LEN
4375 (implied by identical MAX_LEN and MIN_LEN), we want to issue a
4376 single store_by_pieces, but otherwise, select the minimum multiple
4377 of the ALIGN (in bytes) and of the MCD of the possible LENs, that
4378 brings MAX_LEN below TST_BITS, if that's lower than min_len. */
4381 {
4386 }
4389 else
4390 /* Huh, max_len < min_len? Punt. See pr100843.c. */
4393 /* ??? Maybe try smaller fixed-prefix blksizes before
4394 punting? */
4397 {
4405 }
4406 else
4409 /* Check that we can use store by pieces for the maximum store count
4410 we may issue (initial fixed-size block, plus conditional
4411 power-of-two-sized from max_bits to ctz_len. */
4418 /* Skip the test in case of overflow in xlenest. It shouldn't
4419 happen because of the way max_bits and blksize are related, but
4420 it doesn't hurt to test. */
4423 builtin_memset_read_str,
4425 {
4432 {
4435 /* Check that blksize plus the bits to be stored as blocks
4436 sized at powers of two can be stored by pieces. This is
4437 like the test above, but with smaller max_bits. Skip
4438 orig_max_bits (it would be redundant). Also skip in case
4439 of overflow. */
4443 builtin_memset_read_str,
4445 {
4448 }
4451 builtin_memset_read_str,
4453 {
4460 }
4462 {
4463 /* We'll get here if can_store_by_pieces refuses to
4464 store even a single QImode. We'll fall back to
4465 QImode stores then. */
4467 {
4472 }
4475 }
4476 }
4479 /* If the boundaries are such that min and max may run a
4480 different number of trips in the initial loop, the remainder
4481 needs not be between the moduli, so set tst_bits to cover all
4482 bits. Otherwise, if the trip counts are the same, max_len
4483 has the common prefix, and the previously-computed tst_bits
4484 is usable. */
4487 }
4489 by_pieces_constfn constfun;
4492 {
4495 val);
4496 }
4497 else
4498 {
4501 }
4509 {
4517 /* Adjust PTR, TO and REM. Since TO's address is likely
4518 PTR+offset, we have to replace it. */
4523 }
4525 /* Iterate over power-of-two block sizes from the maximum length to
4526 the least significant bit possibly set in the length. */
4528 {
4534 /* If we're past the bits shared between min_ and max_len, expand
4535 a test on the dynamic length, comparing it with the
4536 BLKSIZE. */
4538 {
4543 }
4544 /* If we are at a bit that is in the prefix shared by min_ and
4545 max_len, skip the current BLKSIZE if the bit is clear, but do
4546 not skip the loop, even if it doesn't require
4547 prechecking. */
4553 {
4556 /* Since we may run this multiple times, don't assume we
4557 know anything about the offset. */
4559 }
4564 {
4572 }
4573 else
4574 {
4575 /* Issue a store of BLKSIZE bytes. */
4581 }
4582 /* Adjust REM and PTR, unless this is the last iteration. */
4584 {
4589 }
4597 {
4600 /* Given conditional stores, the offset can no longer be
4601 known, so clear it. */
4603 }
4604 }
4607 }
4609 /* Helper function to do the actual work for expand_builtin_memset. The
4610 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4611 so that this can also be called without constructing an actual CALL_EXPR.
4612 The other arguments and return value are the same as for
4613 expand_builtin_memset. */
4615 static rtx
4618 {
4621 machine_mode val_mode;
4633 /* If DEST is not a pointer type, don't do this operation in-line. */
4644 /* If the LEN parameter is zero, return DEST. */
4646 {
4647 /* Evaluate and ignore VAL in case it has side-effects. */
4650 }
4652 /* Stabilize the arguments in case we fail. */
4665 {
4666 rtx val_rtx;
4671 /* Assume that we can memset by pieces if we can store
4672 * the coefficients by pieces (in the required modes).
4673 * We can't pass builtin_memset_gen_str as that emits RTL. */
4679 {
4684 }
4688 probable_max_size)
4693 dest_align))
4699 }
4702 {
4709 RETURN_BEGIN);
4714 probable_max_size)
4719 dest_align))
4725 }
4736 {
4739 }
4743 do_libcall:
4752 else
4757 }
4759 /* Expand expression EXP, which is a call to the bzero builtin. Return
4760 NULL_RTX if we failed the caller should emit a normal call. */
4762 static rtx
4764 {
4771 /* New argument list transforming bzero(ptr x, int y) to
4772 memset(ptr x, int 0, size_t y). This is done this way
4773 so that if it isn't expanded inline, we fallback to
4774 calling bzero instead of memset. */
4782 }
4784 /* Try to expand cmpstr operation ICODE with the given operands.
4785 Return the result rtx on success, otherwise return null. */
4787 static rtx
4789 HOST_WIDE_INT align)
4790 {
4804 }
4806 /* Expand expression EXP, which is a call to the memcmp built-in function.
4807 Return NULL_RTX if we failed and the caller should emit a normal call,
4808 otherwise try to get the result in TARGET, if convenient.
4809 RESULT_EQ is true if we can relax the returned value to be either zero
4810 or nonzero, without caring about the sign. */
4812 static rtx
4814 {
4823 /* Due to the performance benefit, always inline the calls first
4824 when result_eq is false. */
4828 {
4832 }
4840 /* If we don't have POINTER_TYPE, call the function. */
4848 /* Set MEM_SIZE as appropriate. */
4850 {
4853 }
4857 /* Try to get the byte representation of the constant ARG2 (or, only
4858 when the function's result is used for equality to zero, ARG1)
4859 points to, with its byte size in NBYTES. */
4863 {
4864 /* For equality to zero the arguments are interchangeable. */
4868 }
4870 /* If the function's constant bound LEN_RTX is less than or equal
4871 to the byte size of the representation of the constant argument,
4872 and if block move would be done by pieces, we can avoid loading
4873 the bytes from memory and only store the computed constant result. */
4886 {
4887 /* Return the value in the proper mode for this function. */
4892 {
4895 }
4898 }
4901 }
4903 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4904 if we failed the caller should emit a normal call, otherwise try to get
4905 the result in TARGET, if convenient. */
4907 static rtx
4909 {
4916 /* Due to the performance benefit, always inline the calls first. */
4930 /* If we don't have POINTER_TYPE, call the function. */
4934 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4941 /* Try to call cmpstrsi. */
4946 /* Try to determine at least one length and call cmpstrnsi. */
4948 {
4949 tree len;
4950 rtx arg3_rtx;
4960 /* If we don't have a constant length for the first, use the length
4961 of the second, if we know it. We don't require a constant for
4962 this case; some cost analysis could be done if both are available
4963 but neither is constant. For now, assume they're equally cheap,
4964 unless one has side effects. If both strings have constant lengths,
4965 use the smaller. */
4981 else
4984 /* If both arguments have side effects, we cannot optimize. */
4986 {
4988 result = expand_cmpstrn_or_cmpmem
4991 }
4992 }
4996 {
4997 /* Return the value in the proper mode for this function. */
5005 }
5007 /* Expand the library call ourselves using a stabilized argument
5008 list to avoid re-evaluating the function's arguments twice. */
5014 }
5016 /* Expand expression EXP, which is a call to the strncmp builtin. Return
5017 NULL_RTX if we failed the caller should emit a normal call, otherwise
5018 try to get the result in TARGET, if convenient. */
5020 static rtx
5022 ATTRIBUTE_UNUSED machine_mode mode)
5023 {
5036 /* Due to the performance benefit, always inline the calls first. */
5042 /* If c_strlen can determine an expression for one of the string
5043 lengths, and it doesn't have side effects, then emit cmpstrnsi
5044 using length MIN(strlen(string)+1, arg3). */
5049 tree len;
5061 /* If we don't have a constant length for the first, use the length
5062 of the second, if we know it. If neither string is constant length,
5063 use the given length argument. We don't require a constant for
5064 this case; some cost analysis could be done if both are available
5065 but neither is constant. For now, assume they're equally cheap,
5066 unless one has side effects. If both strings have constant lengths,
5067 use the smaller. */
5085 else
5088 /* If we are not using the given length, we must incorporate it here.
5089 The actual new length parameter will be MIN(len,arg3) in this case. */
5091 {
5094 }
5104 {
5105 /* Return the value in the proper mode for this function. */
5113 }
5115 /* Expand the library call ourselves using a stabilized argument
5116 list to avoid re-evaluating the function's arguments twice. */
5122 }
5124 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
5125 if that's convenient. */
5127 rtx
5129 {
5130 rtx val;
5133 /* Don't do __builtin_saveregs more than once in a function.
5134 Save the result of the first call and reuse it. */
5138 /* When this function is called, it means that registers must be
5139 saved on entry to this function. So we migrate the call to the
5140 first insn of this function. */
5144 /* Do whatever the machine needs done in this case. */
5152 /* Put the insns after the NOTE that starts the function. If this
5153 is inside a start_sequence, make the outer-level insn chain current, so
5154 the code is placed at the start of the function. */
5160 }
5162 /* Expand a call to __builtin_next_arg. */
5164 static rtx
5166 {
5167 /* Checking arguments is already done in fold_builtin_next_arg
5168 that must be called before this function. */
5173 }
5175 /* Make it easier for the backends by protecting the valist argument
5176 from multiple evaluations. */
5178 static tree
5180 {
5183 /* The current way of determining the type of valist is completely
5184 bogus. We should have the information on the va builtin instead. */
5189 {
5193 /* For this case, the backends will be expecting a pointer to
5194 vatype, but it's possible we've actually been given an array
5195 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
5196 So fix it. */
5198 {
5201 }
5202 }
5203 else
5204 {
5208 {
5214 }
5220 }
5223 }
5225 /* The "standard" definition of va_list is void*. */
5227 tree
5229 {
5231 }
5233 /* The "standard" abi va_list is va_list_type_node. */
5235 tree
5237 {
5239 }
5241 /* The "standard" type of va_list is va_list_type_node. */
5243 tree
5245 {
5252 {
5253 /* If va_list is an array type, the argument may have decayed
5254 to a pointer type, e.g. by being passed to another function.
5255 In that case, unwrap both types so that we can compare the
5256 underlying records. */
5259 {
5262 }
5263 }
5268 }
5270 /* The "standard" implementation of va_start: just assign `nextarg' to
5271 the variable. */
5273 void
5275 {
5278 }
5280 /* Expand EXP, a call to __builtin_va_start. */
5282 static rtx
5284 {
5285 rtx nextarg;
5286 tree valist;
5290 {
5293 }
5303 else
5307 }
5309 /* Expand EXP, a call to __builtin_va_end. */
5311 static rtx
5313 {
5316 /* Evaluate for side effects, if needed. I hate macros that don't
5317 do that. */
5322 }
5324 /* Expand EXP, a call to __builtin_va_copy. We do this as a
5325 builtin rather than just as an assignment in stdarg.h because of the
5326 nastiness of array-type va_list types. */
5328 static rtx
5330 {
5343 {
5347 }
5348 else
5349 {
5352 /* Evaluate to pointers. */
5361 /* "Dereference" to BLKmode memories. */
5369 /* Copy. */
5371 }
5374 }
5376 /* Expand a call to one of the builtin functions __builtin_frame_address or
5377 __builtin_return_address. */
5379 static rtx
5381 {
5382 /* The argument must be a nonnegative integer constant.
5383 It counts the number of frames to scan up the stack.
5384 The value is either the frame pointer value or the return
5385 address saved in that frame. */
5387 /* Warning about missing arg was already issued. */
5390 {
5393 }
5394 else
5395 {
5396 /* Number of frames to scan up the stack. */
5401 /* Some ports cannot access arbitrary stack frames. */
5403 {
5406 }
5409 {
5410 /* Warn since no effort is made to ensure that any frame
5411 beyond the current one exists or can be safely reached. */
5414 }
5416 /* For __builtin_frame_address, return what we've got. */
5424 }
5425 }
5427 #if ! STACK_GROWS_DOWNWARD
5428 # define STACK_TOPS GT
5429 #else
5430 # define STACK_TOPS LT
5431 #endif
5433 #ifdef POINTERS_EXTEND_UNSIGNED
5434 # define STACK_UNSIGNED POINTERS_EXTEND_UNSIGNED
5435 #else
5436 # define STACK_UNSIGNED true
5437 #endif
5439 /* Expand a call to builtin function __builtin_stack_address. */
5441 static rtx
5443 {
5445 STACK_UNSIGNED);
5447 #ifdef STACK_ADDRESS_OFFSET
5448 /* Unbias the stack pointer, bringing it to the boundary between the
5449 stack area claimed by the active function calling this builtin,
5450 and stack ranges that could get clobbered if it called another
5451 function. It should NOT encompass any stack red zone, that is
5452 used in leaf functions.
5454 On SPARC, the register save area is *not* considered active or
5455 used by the active function, but rather as akin to the area in
5456 which call-preserved registers are saved by callees. This
5457 enables __strub_leave to clear what would otherwise overlap with
5458 its own register save area.
5460 If the address is computed too high or too low, parts of a stack
5461 range that should be scrubbed may be left unscrubbed, scrubbing
5462 may corrupt active portions of the stack frame, and stack ranges
5463 may be doubly-scrubbed by caller and callee.
5465 In order for it to be just right, the area delimited by
5466 @code{__builtin_stack_address} and @code{__builtin_frame_address
5467 (0)} should encompass caller's registers saved by the function,
5468 local on-stack variables and @code{alloca} stack areas.
5469 Accumulated outgoing on-stack arguments, preallocated as part of
5470 a function's own prologue, are to be regarded as part of the
5471 (caller) function's active area as well, whereas those pushed or
5472 allocated temporarily for a call are regarded as part of the
5473 callee's stack range, rather than the caller's. */
5475 #endif
5478 }
5480 /* Expand a call to builtin function __builtin_strub_enter. */
5482 static rtx
5484 {
5502 }
5504 /* Expand a call to builtin function __builtin_strub_update. */
5506 static rtx
5508 {
5517 #ifdef RED_ZONE_SIZE
5518 /* Here's how the strub enter, update and leave functions deal with red zones.
5520 If it weren't for red zones, update, called from within a strub context,
5521 would bump the watermark to the top of the stack. Enter and leave, running
5522 in the caller, would use the caller's top of stack address both to
5523 initialize the watermark passed to the callee, and to start strubbing the
5524 stack afterwards.
5526 Ideally, we'd update the watermark so as to cover the used amount of red
5527 zone, and strub starting at the caller's other end of the (presumably
5528 unused) red zone. Normally, only leaf functions use the red zone, but at
5529 this point we can't tell whether a function is a leaf, nor can we tell how
5530 much of the red zone it uses. Furthermore, some strub contexts may have
5531 been inlined so that update and leave are called from the same stack frame,
5532 and the strub builtins may all have been inlined, turning a strub function
5533 into a leaf.
5535 So cleaning the range from the caller's stack pointer (one end of the red
5536 zone) to the (potentially inlined) callee's (other end of the) red zone
5537 could scribble over the caller's own red zone.
5539 We avoid this possibility by arranging for callers that are strub contexts
5540 to use their own watermark as the strub starting point. So, if A calls B,
5541 and B calls C, B will tell A to strub up to the end of B's red zone, and
5542 will strub itself only the part of C's stack frame and red zone that
5543 doesn't overlap with B's. With that, we don't need to know who's leaf and
5544 who isn't: inlined calls will shrink their strub window to zero, each
5545 remaining call will strub some portion of the stack, and eventually the
5546 strub context will return to a caller that isn't a strub context itself,
5547 that will therefore use its own stack pointer as the strub starting point.
5548 It's not a leaf, because strub contexts can't be inlined into non-strub
5549 contexts, so it doesn't use the red zone, and it will therefore correctly
5550 strub up the callee's stack frame up to the end of the callee's red zone.
5551 Neat! */
5553 {
5555 #if STACK_GROWS_DOWNWARD
5557 #endif
5560 }
5561 #endif
5577 /* If this is an inlined strub function, also bump the watermark for the
5578 enclosing function. This avoids a problem with the following scenario: A
5579 calls B and B calls C, and both B and C get inlined into A. B allocates
5580 temporary stack space before calling C. If we don't update A's watermark,
5581 we may use an outdated baseline for the post-C strub_leave, erasing B's
5582 temporary stack allocation. We only need this if we're fully expanding
5583 strub_leave inline. */
5588 {
5600 }
5605 }
5608 /* Expand a call to builtin function __builtin_strub_leave. */
5610 static rtx
5612 {
5624 {
5630 }
5643 #if ! STACK_GROWS_DOWNWARD
5646 #else
5649 #endif
5651 /* We're going to modify it, so make sure it's not e.g. the stack pointer. */
5661 else
5662 {
5663 /* Ok, now we've determined we want to copy the block, so convert the
5664 addresses to Pmode, as needed to dereference them to access ptr_mode
5665 memory locations, so that we don't have to convert anything within the
5666 loop. */
5673 /* ??? It would be nice to use setmem or similar patterns here,
5674 but they do not necessarily obey the stack growth direction,
5675 which has security implications. We also have to avoid calls
5676 (memset, bzero or any machine-specific ones), which are
5677 likely unsafe here (see TARGET_STRUB_MAY_USE_MEMSET). */
5678 #if ! STACK_GROWS_DOWNWARD
5686 #else
5694 #endif
5698 }
5703 }
5705 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5706 failed and the caller should emit a normal call. */
5708 static rtx
5710 {
5711 rtx op0;
5712 rtx result;
5715 HOST_WIDE_INT max_size;
5718 bool valid_arglist
5721 VOID_TYPE)
5729 /* Compute the argument. */
5732 /* Compute the alignment. */
5734 ? BIGGEST_ALIGNMENT
5737 /* Compute the maximum size. */
5742 /* Allocate the desired space. If the allocation stems from the declaration
5743 of a variable-sized object, it cannot accumulate. */
5744 result
5748 /* Dynamic allocations for variables are recorded during gimplification. */
5753 }
5755 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5756 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5757 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5758 handle_builtin_stack_restore function. */
5760 static rtx
5762 {
5769 OPTAB_LIB_WIDEN);
5772 OPTAB_LIB_WIDEN);
5777 }
5779 /* Expand a call to bswap builtin in EXP.
5780 Return NULL_RTX if a normal call should be emitted rather than expanding the
5781 function in-line. If convenient, the result should be placed in TARGET.
5782 SUBTARGET may be used as the target for computing one of EXP's operands. */
5784 static rtx
5786 rtx subtarget)
5787 {
5788 tree arg;
5789 rtx op0;
5807 }
5809 /* Expand a call to a unary builtin in EXP.
5810 Return NULL_RTX if a normal call should be emitted rather than expanding the
5811 function in-line. If convenient, the result should be placed in TARGET.
5812 SUBTARGET may be used as the target for computing one of EXP's operands. */
5814 static rtx
5817 {
5818 rtx op0;
5823 /* Compute the argument. */
5825 (subtarget
5829 /* Compute op, into TARGET if possible.
5830 Set TARGET to wherever the result comes back. */
5836 }
5838 /* Expand a call to __builtin_expect. We just return our argument
5839 as the builtin_expect semantic should've been already executed by
5840 tree branch prediction pass. */
5842 static rtx
5844 {
5845 tree arg;
5852 /* When guessing was done, the hints should be already stripped away. */
5856 }
5858 /* Expand a call to __builtin_expect_with_probability. We just return our
5859 argument as the builtin_expect semantic should've been already executed by
5860 tree branch prediction pass. */
5862 static rtx
5864 {
5865 tree arg;
5872 /* When guessing was done, the hints should be already stripped away. */
5876 }
5879 /* Expand a call to __builtin_assume_aligned. We just return our first
5880 argument as the builtin_assume_aligned semantic should've been already
5881 executed by CCP. */
5883 static rtx
5885 {
5889 EXPAND_NORMAL);
5894 }
5896 void
5898 {
5900 {
5902 /* For trap insns when not accumulating outgoing args force
5903 REG_ARGS_SIZE note to prevent crossjumping of calls with
5904 different args sizes. */
5907 }
5908 else
5909 {
5913 }
5916 }
5918 /* Expand a call to __builtin_unreachable. We do nothing except emit
5919 a barrier saying that control flow will not pass here.
5921 It is the responsibility of the program being compiled to ensure
5922 that control flow does never reach __builtin_unreachable. */
5923 static void
5925 {
5926 /* Use gimple_build_builtin_unreachable or builtin_decl_unreachable
5927 to avoid this. */
5930 }
5932 /* Expand EXP, a call to fabs, fabsf or fabsl.
5933 Return NULL_RTX if a normal call should be emitted rather than expanding
5934 the function inline. If convenient, the result should be placed
5935 in TARGET. SUBTARGET may be used as the target for computing
5936 the operand. */
5938 static rtx
5940 {
5941 machine_mode mode;
5942 tree arg;
5943 rtx op0;
5953 }
5955 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5956 Return NULL is a normal call should be emitted rather than expanding the
5957 function inline. If convenient, the result should be placed in TARGET.
5958 SUBTARGET may be used as the target for computing the operand. */
5960 static rtx
5962 {
5964 tree arg;
5976 }
5978 /* Emit a call to __builtin___clear_cache. */
5980 void
5982 {
5984 BUILTIN_ASM_NAME_PTR
5991 }
5993 /* Emit a call to __builtin___clear_cache, unless the target specifies
5994 it as do-nothing. This function can be used by trampoline
5995 finalizers to duplicate the effects of expanding a call to the
5996 clear_cache builtin. */
5998 void
6000 {
6007 {
6008 /* We have a "clear_cache" insn, and it will handle everything. */
6016 }
6017 else
6018 {
6019 #ifndef CLEAR_INSN_CACHE
6020 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
6021 does nothing. There is no need to call it. Do nothing. */
6024 }
6027 }
6029 /* Expand a call to __builtin___clear_cache. */
6031 static void
6033 {
6037 /* We must not expand to a library call. If we did, any
6038 fallback library function in libgcc that might contain a call to
6039 __builtin___clear_cache() would recurse infinitely. */
6041 {
6044 }
6053 }
6055 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
6057 static rtx
6059 {
6062 /* If we don't need too much alignment, we'll have been guaranteed
6063 proper alignment by get_trampoline_type. */
6067 /* Round address up to desired boundary. */
6078 }
6080 static rtx
6082 {
6098 /* If ONSTACK, the TRAMP argument should be the address of a field
6099 within the local function's FRAME decl. Either way, let's see if
6100 we can fill in the MEM_ATTRs for this memory. */
6104 /* Creator of a heap trampoline is responsible for making sure the
6105 address is aligned to at least STACK_BOUNDARY. Normally malloc
6106 will ensure this anyhow. */
6109 {
6113 }
6115 /* The FUNC argument should be the address of the nested function.
6116 Extract the actual function decl to pass to the hook. */
6123 /* Generate insns to initialize the trampoline. */
6127 {
6133 }
6136 }
6138 static rtx
6140 {
6141 rtx tramp;
6152 }
6154 /* Expand a call to the builtin descriptor initialization routine.
6155 A descriptor is made up of a couple of pointers to the static
6156 chain and the code entry in this order. */
6158 static rtx
6160 {
6165 VOID_TYPE))
6180 /* Generate insns to initialize the descriptor. */
6186 }
6188 /* Expand a call to the builtin descriptor adjustment routine. */
6190 static rtx
6192 {
6193 rtx tramp;
6200 /* Unalign the descriptor to allow runtime identification. */
6205 }
6207 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
6208 function. The function first checks whether the back end provides
6209 an insn to implement signbit for the respective mode. If not, it
6210 checks whether the floating point format of the value is such that
6211 the sign bit can be extracted. If that is not the case, error out.
6212 EXP is the expression that is a call to the builtin function; if
6213 convenient, the result should be placed in TARGET. */
6214 static rtx
6216 {
6218 scalar_float_mode fmode;
6220 tree arg;
6223 rtx temp;
6236 /* Expand the argument yielding a RTX expression. */
6239 /* Check if the back end provides an insn that handles signbit for the
6240 argument's mode. */
6243 {
6249 }
6251 /* For floating point formats without a sign bit, implement signbit
6252 as "ARG < 0.0". */
6255 {
6256 /* But we can't do this if the format supports signed zero. */
6262 }
6265 {
6268 }
6269 else
6270 {
6272 /* Handle targets with different FP word orders. */
6275 else
6279 }
6281 /* Force the intermediate word_mode (or narrower) result into a
6282 register. This avoids attempting to create paradoxical SUBREGs
6283 of floating point modes below. */
6286 /* If the bitpos is within the "result mode" lowpart, the operation
6287 can be implement with a single bitwise AND. Otherwise, we need
6288 a right shift and an AND. */
6291 {
6299 }
6300 else
6301 {
6302 /* Perform a logical right shift to place the signbit in the least
6303 significant bit, then truncate the result to the desired mode
6304 and mask just this bit. */
6309 }
6312 }
6314 /* Expand fork or exec calls. TARGET is the desired target of the
6315 call. EXP is the call. FN is the
6316 identificator of the actual function. IGNORE is nonzero if the
6317 value is to be ignored. */
6319 static rtx
6321 {
6323 tree call;
6325 /* If we are not profiling, just call the function. */
6329 /* Otherwise call the wrapper. This should be equivalent for the rest of
6330 compiler, so the code does not diverge, and the wrapper may run the
6331 code necessary for keeping the profiling sane. */
6334 {
6365 }
6377 }
6380 \f
6381 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
6382 the pointer in these functions is void*, the tree optimizers may remove
6383 casts. The mode computed in expand_builtin isn't reliable either, due
6384 to __sync_bool_compare_and_swap.
6386 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
6387 group of builtins. This gives us log2 of the mode size. */
6391 {
6392 /* The size is not negotiable, so ask not to get BLKmode in return
6393 if the target indicates that a smaller size would be better. */
6395 }
6397 /* Expand the memory expression LOC and return the appropriate memory operand
6398 for the builtin_sync operations. */
6400 static rtx
6402 {
6412 /* Note that we explicitly do not want any alias information for this
6413 memory, so that we kill all other live memories. Otherwise we don't
6414 satisfy the full barrier semantics of the intrinsic. */
6421 /* The alignment needs to be at least according to that of the mode. */
6428 }
6430 /* Make sure an argument is in the right mode.
6431 EXP is the tree argument.
6432 MODE is the mode it should be in. */
6434 static rtx
6436 {
6437 rtx val;
6438 machine_mode old_mode;
6442 {
6443 /* Undo argument promotion if possible, as combine might not
6444 be able to do it later due to MEM_VOLATILE_P uses in the
6445 patterns. */
6448 {
6458 }
6459 }
6462 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
6463 of CONST_INTs, where we know the old_mode only from the call argument. */
6470 }
6473 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
6474 EXP is the CALL_EXPR. CODE is the rtx code
6475 that corresponds to the arithmetic or logical operation from the name;
6476 an exception here is that NOT actually means NAND. TARGET is an optional
6477 place for us to store the results; AFTER is true if this is the
6478 fetch_and_xxx form. */
6480 static rtx
6483 rtx target)
6484 {
6489 {
6496 {
6525 }
6526 }
6528 /* Expand the operands. */
6533 after);
6534 }
6536 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
6537 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
6538 true if this is the boolean form. TARGET is a place for us to store the
6539 results; this is NOT optional if IS_BOOL is true. */
6541 static rtx
6544 {
6548 /* Expand the operands. */
6555 {
6558 else
6560 }
6563 MEMMODEL_SYNC_SEQ_CST))
6567 }
6569 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
6570 general form is actually an atomic exchange, and some targets only
6571 support a reduced form with the second argument being a constant 1.
6572 EXP is the CALL_EXPR; TARGET is an optional place for us to store
6573 the results. */
6575 static rtx
6577 rtx target)
6578 {
6581 /* Expand the operands. */
6586 }
6588 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
6590 static void
6592 {
6593 rtx mem;
6595 /* Expand the operands. */
6599 }
6601 /* Given an integer representing an ``enum memmodel'', verify its
6602 correctness and return the memory model enum. */
6604 static enum memmodel
6606 {
6607 /* If the parameter is not a constant, it's a run time value so we'll just
6608 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
6620 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
6624 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
6625 be conservative and promote consume to acquire. */
6630 }
6632 /* Expand the __atomic_exchange intrinsic:
6633 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
6634 EXP is the CALL_EXPR.
6635 TARGET is an optional place for us to store the results. */
6637 static rtx
6639 {
6648 /* Expand the operands. */
6653 }
6655 /* Expand the __atomic_compare_exchange intrinsic:
6656 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
6657 TYPE desired, BOOL weak,
6658 enum memmodel success,
6659 enum memmodel failure)
6660 EXP is the CALL_EXPR.
6661 TARGET is an optional place for us to store the results. */
6663 static rtx
6665 rtx target)
6666 {
6669 tree weak;
6679 {
6682 }
6688 /* Expand the operands. */
6704 /* Lest the rtl backend create a race condition with an imporoper store
6705 to memory, always create a new pseudo for OLDVAL. */
6712 /* Conditionally store back to EXPECT, lest we create a race condition
6713 with an improper store to memory. */
6714 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6715 the normal case where EXPECT is totally private, i.e. a register. At
6716 which point the store can be unconditional. */
6724 }
6726 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6727 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6728 call. The weak parameter must be dropped to match the expected parameter
6729 list and the expected argument changed from value to pointer to memory
6730 slot. */
6732 static void
6734 {
6750 /* Skip the boolean weak parameter. */
6753 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6756 built_in_function fncode
6761 fndecl);
6766 {
6773 }
6774 }
6776 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6778 void
6780 {
6792 {
6795 }
6798 {
6801 }
6803 /* Expand the operands. */
6816 {
6819 }
6823 {
6829 }
6830 }
6832 /* Expand the __atomic_load intrinsic:
6833 TYPE __atomic_load (TYPE *object, enum memmodel)
6834 EXP is the CALL_EXPR.
6835 TARGET is an optional place for us to store the results. */
6837 static rtx
6839 {
6847 /* Expand the operand. */
6851 }
6854 /* Expand the __atomic_store intrinsic:
6855 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6856 EXP is the CALL_EXPR.
6857 TARGET is an optional place for us to store the results. */
6859 static rtx
6861 {
6870 /* Expand the operands. */
6875 }
6877 /* Expand the __atomic_fetch_XXX intrinsic:
6878 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6879 EXP is the CALL_EXPR.
6880 TARGET is an optional place for us to store the results.
6881 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6882 FETCH_AFTER is true if returning the result of the operation.
6883 FETCH_AFTER is false if returning the value before the operation.
6884 IGNORE is true if the result is not used.
6885 EXT_CALL is the correct builtin for an external call if this cannot be
6886 resolved to an instruction sequence. */
6888 static rtx
6892 {
6895 tree fndecl;
6896 tree addr;
6900 /* Expand the operands. */
6904 /* Only try generating instructions if inlining is turned on. */
6906 {
6910 }
6912 /* Return if a different routine isn't needed for the library call. */
6916 /* Change the call to the specified function. */
6924 /* If we will emit code after the call, the call cannot be a tail call.
6925 If it is emitted as a tail call, a barrier is emitted after it, and
6926 then all trailing code is removed. */
6930 /* Expand the call here so we can emit trailing code. */
6933 /* Replace the original function just in case it matters. */
6936 /* Then issue the arithmetic correction to return the right result. */
6938 {
6940 {
6942 OPTAB_LIB_WIDEN);
6944 }
6945 else
6947 OPTAB_LIB_WIDEN);
6948 }
6950 }
6952 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6954 void
6956 {
6964 optab optab;
6976 {
6991 }
6994 {
7001 }
7003 rtx target;
7006 else
7027 {
7034 is_atomic
7039 }
7043 {
7048 }
7049 else
7051 OPTAB_DIRECT);
7054 }
7056 /* Expand IFN_ATOMIC_*_FETCH_CMP_0 internal function. */
7058 void
7060 {
7067 optab optab;
7068 rtx_code code;
7080 {
7103 }
7107 {
7115 }
7117 rtx target;
7120 else
7135 {
7142 is_atomic
7147 }
7150 {
7155 }
7156 }
7158 /* Expand an atomic clear operation.
7159 void _atomic_clear (BOOL *obj, enum memmodel)
7160 EXP is the call expression. */
7162 static rtx
7164 {
7172 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
7173 Failing that, a store is issued by __atomic_store. The only way this can
7174 fail is if the bool type is larger than a word size. Unlikely, but
7175 handle it anyway for completeness. Assume a single threaded model since
7176 there is no atomic support in this case, and no barriers are required. */
7181 }
7183 /* Expand an atomic test_and_set operation.
7184 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
7185 EXP is the call expression. */
7187 static rtx
7189 {
7190 rtx mem;
7192 machine_mode mode;
7199 }
7202 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
7203 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
7205 static tree
7207 {
7209 machine_mode mode;
7215 /* We need a corresponding integer mode for the access to be lock-free. */
7223 {
7226 /* Either this argument is null, or it's a fake pointer encoding
7227 the alignment of the object. */
7233 else
7235 }
7236 else
7237 {
7240 /* This function is usually invoked and folded immediately by the front
7241 end before anything else has a chance to look at it. The pointer
7242 parameter at this point is usually cast to a void *, so check for that
7243 and look past the cast. */
7253 /* Get the underlying type of the object. */
7256 }
7258 /* If the object has smaller alignment, the lock free routines cannot
7259 be used. */
7263 /* Check if a compare_and_swap pattern exists for the mode which represents
7264 the required size. The pattern is not allowed to fail, so the existence
7265 of the pattern indicates support is present. Also require that an
7266 atomic load exists for the required size. */
7269 else
7271 }
7273 /* Return true if the parameters to call EXP represent an object which will
7274 always generate lock free instructions. The first argument represents the
7275 size of the object, and the second parameter is a pointer to the object
7276 itself. If NULL is passed for the object, then the result is based on
7277 typical alignment for an object of the specified size. Otherwise return
7278 false. */
7280 static rtx
7282 {
7283 tree size;
7288 {
7291 }
7297 }
7299 /* Return a one or zero if it can be determined that object ARG1 of size ARG
7300 is lock free on this architecture. */
7302 static tree
7304 {
7308 /* If it isn't always lock free, don't generate a result. */
7313 }
7315 /* Return true if the parameters to call EXP represent an object which will
7316 always generate lock free instructions. The first argument represents the
7317 size of the object, and the second parameter is a pointer to the object
7318 itself. If NULL is passed for the object, then the result is based on
7319 typical alignment for an object of the specified size. Otherwise return
7320 NULL*/
7322 static rtx
7324 {
7325 tree size;
7330 {
7333 }
7338 /* If the value is known at compile time, return the RTX for it. */
7344 }
7346 /* Expand the __atomic_thread_fence intrinsic:
7347 void __atomic_thread_fence (enum memmodel)
7348 EXP is the CALL_EXPR. */
7350 static void
7352 {
7355 }
7357 /* Expand the __atomic_signal_fence intrinsic:
7358 void __atomic_signal_fence (enum memmodel)
7359 EXP is the CALL_EXPR. */
7361 static void
7363 {
7366 }
7368 /* Expand the __sync_synchronize intrinsic. */
7370 static void
7372 {
7374 }
7376 static rtx
7378 {
7384 {
7386 /* If the target is not sutitable then create a new target. */
7394 }
7397 }
7399 static void
7401 {
7407 {
7414 }
7416 }
7418 \f
7419 /* Emit code to restore the current value of stack. */
7421 static void
7423 {
7435 }
7437 /* Emit code to save the current value of stack. */
7439 static rtx
7441 {
7446 }
7448 /* Emit code to get the openacc gang, worker or vector id or size. */
7450 static rtx
7452 {
7454 rtx fallback_retval;
7457 {
7470 }
7473 {
7476 }
7480 {
7483 }
7487 {
7495 }
7504 {
7507 }
7515 }
7517 /* Expand a string compare operation using a sequence of char comparison
7518 to get rid of the calling overhead, with result going to TARGET if
7519 that's convenient.
7521 VAR_STR is the variable string source;
7522 CONST_STR is the constant string source;
7523 LENGTH is the number of chars to compare;
7524 CONST_STR_N indicates which source string is the constant string;
7525 IS_MEMCMP indicates whether it's a memcmp or strcmp.
7527 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
7529 target = (int) (unsigned char) var_str[0]
7530 - (int) (unsigned char) const_str[0];
7531 if (target != 0)
7532 goto ne_label;
7533 ...
7534 target = (int) (unsigned char) var_str[length - 2]
7535 - (int) (unsigned char) const_str[length - 2];
7536 if (target != 0)
7537 goto ne_label;
7538 target = (int) (unsigned char) var_str[length - 1]
7539 - (int) (unsigned char) const_str[length - 1];
7540 ne_label:
7541 */
7543 static rtx
7547 {
7549 rtx var_rtx_array
7556 scalar_int_mode unit_mode
7562 {
7563 var_rtx
7574 /* Force the difference into result register. We cannot reassign
7575 result here ("result = diff") or we may end up returning
7576 uninitialized result when expand_simple_binop allocates a new
7577 pseudo-register for returning. */
7585 }
7593 }
7595 /* Inline expansion of a call to str(n)cmp and memcmp, with result going
7596 to TARGET if that's convenient.
7597 If the call is not been inlined, return NULL_RTX. */
7599 static rtx
7601 {
7606 /* Do NOT apply this inlining expansion when optimizing for size or
7607 optimization level below 2 or if unused *cmp hasn't been DCEd. */
7615 /* On a target where the type of the call (int) has same or narrower presicion
7616 than unsigned char, give up the inlining expansion. */
7629 /* Get the object representation of the initializers of ARG1 and ARG2
7630 as strings, provided they refer to constant objects, with their byte
7631 sizes in LEN1 and LEN2, respectively. */
7635 /* Fail if neither argument refers to an initialized constant. */
7640 {
7641 /* Fail if the memcmp/strncmp bound is not a constant. */
7648 {
7649 /* Fail if the memcmp bound is greater than the size of either
7650 of the two constant objects. */
7654 }
7655 }
7658 {
7659 /* For string functions (i.e., strcmp and strncmp) reduce LEN1
7660 and LEN2 to the length of the nul-terminated string stored
7661 in each. */
7666 }
7668 /* See inline_string_cmp. */
7676 else
7679 /* For strncmp only, compute the new bound as the smallest of
7680 the lengths of the two strings (plus 1) and the bound provided
7681 to the function. */
7686 /* If the bound of the comparison is larger than the threshold,
7687 do nothing. */
7693 /* Now, start inline expansion the call. */
7697 }
7699 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
7700 represents the size of the first argument to that call, or VOIDmode
7701 if the argument is a pointer. IGNORE will be true if the result
7702 isn't used. */
7703 static rtx
7706 {
7713 {
7716 }
7720 /* An optional second argument can be used as a failsafe value on
7721 some machines. If it isn't present, then the failsafe value is
7722 assumed to be 0. */
7724 {
7727 }
7728 else
7731 /* If the result isn't used, the behavior is undefined. It would be
7732 nice to emit a warning here, but path splitting means this might
7733 happen with legitimate code. So simply drop the builtin
7734 expansion in that case; we've handled any side-effects above. */
7738 /* If we don't have a suitable target, create one to hold the result. */
7746 }
7748 /* Expand an expression EXP that calls a built-in function,
7749 with result going to TARGET if that's convenient
7750 (and in mode MODE if that's convenient).
7751 SUBTARGET may be used as the target for computing one of EXP's operands.
7752 IGNORE is nonzero if the value is to be ignored. */
7754 rtx
7757 {
7765 /* When ASan is enabled, we don't want to expand some memory/string
7766 builtins and rely on libsanitizer's hooks. This allows us to avoid
7767 redundant checks and be sure, that possible overflow will be detected
7768 by ASan. */
7775 {
7787 }
7792 /* When not optimizing, generate calls to library functions for a certain
7793 set of builtins. */
7816 /* The built-in function expanders test for target == const0_rtx
7817 to determine whether the function's result will be ignored. */
7821 /* If the result of a pure or const built-in function is ignored, and
7822 none of its arguments are volatile, we can avoid expanding the
7823 built-in call and just evaluate the arguments for side-effects. */
7827 {
7829 tree arg;
7830 call_expr_arg_iterator iter;
7834 {
7837 }
7840 {
7844 }
7845 }
7848 {
7866 /* Just do a normal library call if we were unable to fold
7867 the values. */
7956 feclearexcept_optab);
7963 feraiseexcept_optab);
7971 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7972 FUNCTION with a copy of the parameters described by
7973 ARGUMENTS, and ARGSIZE. It returns a block of memory
7974 allocated on the stack into which is stored all the registers
7975 that might possibly be used for returning the result of a
7976 function. ARGUMENTS is the value returned by
7977 __builtin_apply_args. ARGSIZE is the number of bytes of
7978 arguments that must be copied. ??? How should this value be
7979 computed? We'll also need a safe worst case value for varargs
7980 functions. */
7987 else
7988 {
7996 }
7998 /* __builtin_return (RESULT) causes the function to return the
7999 value described by RESULT. RESULT is address of the block of
8000 memory returned by __builtin_apply. */
8010 /* All valid uses of __builtin_va_arg_pack () are removed during
8011 inlining. */
8016 /* All valid uses of __builtin_va_arg_pack_len () are removed during
8017 inlining. */
8021 /* Return the address of the first anonymous stack arg. */
8062 /* Returns the address of the area where the structure is returned.
8063 0 otherwise. */
8069 else
8072 CASE_BUILT_IN_ALLOCA:
8199 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
8200 back to a BUILT_IN_STRCMP. Remember to delete the 3rd parameter
8201 when changing it to a strcmp call. */
8207 /* Change this call back to a BUILT_IN_STRCMP. */
8211 /* Delete the last parameter. */
8218 /* FALLTHROUGH */
8226 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
8227 back to a BUILT_IN_STRNCMP. */
8233 /* Change it back to a BUILT_IN_STRNCMP. */
8236 /* FALLTHROUGH */
8251 {
8254 }
8258 /* This should have been lowered to the builtins below. */
8262 /* __builtin_setjmp_setup is passed a pointer to an array of five words
8263 and the receiver label. */
8265 {
8273 }
8277 /* __builtin_setjmp_receiver is passed the receiver label. */
8279 {
8284 nonlocal_goto_handler_labels
8286 nonlocal_goto_handler_labels);
8287 /* ??? Do not let expand_label treat us as such since we would
8288 not want to be both on the list of non-local labels and on
8289 the list of forced labels. */
8292 }
8295 /* __builtin_longjmp is passed a pointer to an array of five words.
8296 It's similar to the C library longjmp function but works with
8297 __builtin_setjmp above. */
8300 {
8306 {
8309 }
8313 }
8322 /* This updates the setjmp buffer that is its argument with the value
8323 of the current stack pointer. */
8326 {
8327 rtx buf_addr
8332 }
8353 /* Various hooks for the DWARF 2 __throw routine. */
8359 #ifdef DWARF2_UNWIND_INFO
8365 #endif
8571 mode = get_builtin_sync_mode
8583 mode = get_builtin_sync_mode
8630 {
8634 mode =
8640 /* If this is turned into an external library call, the weak parameter
8641 must be dropped to match the expected parameter list. */
8646 /* Skip the boolean weak parameter. */
8651 }
8680 {
8690 }
8696 {
8706 }
8712 {
8722 }
8728 {
8738 }
8744 {
8754 }
8760 {
8770 }
8906 /* Do library call, if we failed to expand the builtin when
8907 folding. */
8927 }
8929 /* The switch statement above can drop through to cause the function
8930 to be called normally. */
8932 }
8934 /* Determine whether a tree node represents a call to a built-in
8935 function. If the tree T is a call to a built-in function with
8936 the right number of arguments of the appropriate types, return
8937 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8938 Otherwise the return value is END_BUILTINS. */
8940 enum built_in_function
8942 {
8945 const_call_expr_arg_iterator iter;
8957 {
8958 /* If a function doesn't take a variable number of arguments,
8959 the last element in the list will have type `void'. */
8962 {
8966 }
8975 {
8978 }
8980 {
8983 }
8985 {
8988 }
8990 {
8993 }
8994 else
8996 }
8998 /* Variable-length argument list. */
9000 }
9002 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
9003 evaluate to a constant. */
9005 static tree
9007 {
9008 /* We return 1 for a numeric type that's known to be a constant
9009 value at compile-time or for an aggregate type that's a
9010 literal constant. */
9013 /* If we know this is a constant, emit the constant of one. */
9019 {
9026 }
9028 /* If this expression has side effects, show we don't know it to be a
9029 constant. Likewise if it's a pointer or aggregate type since in
9030 those case we only want literals, since those are only optimized
9031 when generating RTL, not later.
9032 And finally, if we are compiling an initializer, not code, we
9033 need to return a definite result now; there's not going to be any
9034 more optimization done. */
9039 || folding_initializer
9044 }
9046 /* Create builtin_expect or builtin_expect_with_probability
9047 with PRED and EXPECTED as its arguments and return it as a truthvalue.
9048 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
9049 builtin_expect_with_probability instead uses third argument as PROBABILITY
9050 value. */
9052 static tree
9055 {
9070 else
9072 predictor);
9076 }
9078 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
9079 NULL_TREE if no simplification is possible. */
9081 tree
9083 tree arg3)
9084 {
9088 /* Distribute the expected value over short-circuiting operators.
9089 See through the cast from truthvalue_type_node to long. */
9096 /* If this is a builtin_expect within a builtin_expect keep the
9097 inner one. See through a comparison against a constant. It
9098 might have been added to create a thruthvalue. */
9108 BUILT_IN_EXPECT_WITH_PROBABILITY))
9114 {
9124 }
9126 /* If the argument isn't invariant then there's nothing else we can do. */
9130 /* If we expect that a comparison against the argument will fold to
9131 a constant return the constant. In practice, this means a true
9132 constant or the address of a non-weak symbol. */
9136 {
9137 do
9138 {
9140 }
9145 }
9147 /* Otherwise, ARG0 already has the proper type for the return value. */
9149 }
9151 /* Fold a call to __builtin_classify_type with argument ARG. */
9153 static tree
9155 {
9160 }
9162 /* Fold a call EXPR (which may be null) to __builtin_strlen with argument
9163 ARG. */
9165 static tree
9167 {
9170 else
9171 {
9172 c_strlen_data lendata = { };
9178 /* TODO: Move this to gimple-ssa-warn-access once the pass runs
9179 also early enough to detect invalid reads in multimensional
9180 arrays and struct members. */
9185 {
9191 }
9194 }
9195 }
9197 /* Fold a call to __builtin_inf or __builtin_huge_val. */
9199 static tree
9201 {
9202 /* __builtin_inff is intended to be usable to define INFINITY on all
9203 targets. If an infinity is not available, INFINITY expands "to a
9204 positive constant of type float that overflows at translation
9205 time", footnote "In this case, using INFINITY will violate the
9206 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
9207 Thus we pedwarn to ensure this constraint violation is
9208 diagnosed. */
9213 }
9215 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
9216 NULL_TREE if no simplification can be made. */
9218 static tree
9221 {
9222 tree type;
9232 /* Calculate the result when the argument is a constant. */
9237 /* Canonicalize sincos to cexpi. */
9239 {
9242 }
9244 {
9251 }
9263 }
9265 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
9266 Return NULL_TREE if no simplification can be made. */
9268 static tree
9270 {
9276 /* If the LEN parameter is zero, return zero. */
9281 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9285 /* If len parameter is one, return an expression corresponding to
9286 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
9288 {
9290 tree cst_uchar_ptr_node
9293 tree ind1
9297 cst_uchar_ptr_node,
9298 arg1)));
9299 tree ind2
9303 cst_uchar_ptr_node,
9304 arg2)));
9306 }
9309 }
9311 /* Fold a call to builtin isascii with argument ARG. */
9313 static tree
9315 {
9318 else
9319 {
9320 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
9326 }
9327 }
9329 /* Fold a call to builtin toascii with argument ARG. */
9331 static tree
9333 {
9337 /* Transform toascii(c) -> (c & 0x7f). */
9340 }
9342 /* Fold a call to builtin isdigit with argument ARG. */
9344 static tree
9346 {
9349 else
9350 {
9351 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
9352 /* According to the C standard, isdigit is unaffected by locale.
9353 However, it definitely is affected by the target character set. */
9354 unsigned HOST_WIDE_INT target_digit0
9365 }
9366 }
9368 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
9370 static tree
9372 {
9378 }
9380 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
9382 static tree
9384 {
9390 }
9392 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
9394 static tree
9396 {
9399 {
9403 {
9408 }
9409 }
9412 }
9414 /* Fold a call to builtin frexp, we can assume the base is 2. */
9416 static tree
9418 {
9429 /* Proceed if a valid pointer type was passed in. */
9431 {
9436 {
9438 /* For +-0, return (*exp = 0, +-0). */
9444 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
9447 {
9448 /* Since the frexp function always expects base 2, and in
9449 GCC normalized significands are already in the range
9450 [0.5, 1.0), we have exactly what frexp wants. */
9455 }
9459 }
9461 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9467 }
9470 }
9472 /* Fold a call to builtin modf. */
9474 static tree
9476 {
9487 /* Proceed if a valid pointer type was passed in. */
9489 {
9492 tree res;
9495 {
9498 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
9502 /* For +-Inf, return (*arg1 = arg0, +-0). */
9508 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
9511 /* If the original number was negative and already
9512 integral, then the fractional part is -0.0. */
9516 }
9518 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9526 }
9529 }
9531 /* Given a location LOC, an interclass builtin function decl FNDECL
9532 and its single argument ARG, return an folded expression computing
9533 the same, or NULL_TREE if we either couldn't or didn't want to fold
9534 (the latter happen if there's an RTL instruction available). */
9536 static tree
9538 {
9539 machine_mode mode;
9551 /* If there is no optab, try generic code. */
9553 {
9554 tree result;
9557 {
9558 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
9561 REAL_VALUE_TYPE r;
9565 {
9566 /* NaN and Inf are encoded in the high-order double value
9567 only. The low-order value is not significant. */
9571 }
9578 }
9581 {
9582 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9585 REAL_VALUE_TYPE r;
9589 {
9590 /* NaN and Inf are encoded in the high-order double value
9591 only. The low-order value is not significant. */
9595 }
9601 /*result = fold_build2_loc (loc, UNGT_EXPR,
9602 TREE_TYPE (TREE_TYPE (fndecl)),
9603 fold_build1_loc (loc, ABS_EXPR, type, arg),
9604 build_real (type, r));
9605 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9606 TREE_TYPE (TREE_TYPE (fndecl)),
9607 result);*/
9609 }
9611 {
9612 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9613 islessequal(fabs(x),DBL_MAX). */
9623 {
9624 /* Use double to test the normal range of IBM extended
9625 precision. Emin for IBM extended precision is
9626 different to emin for IEEE double, being 53 higher
9627 since the low double exponent is at least 53 lower
9628 than the high double exponent. */
9632 }
9644 {
9645 /* Testing the high end of the range is done just using
9646 the high double, using the same test as isfinite().
9647 For the subnormal end of the range we first test the
9648 high double, then if its magnitude is equal to the
9649 limit of 0x1p-969, we test whether the low double is
9650 non-zero and opposite sign to the high double. */
9666 integer_type_node,
9672 }
9673 else
9674 {
9675 tree const isge_fn
9678 }
9682 }
9685 }
9688 }
9690 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9691 ARG is the argument for the call. */
9693 static tree
9695 {
9702 {
9711 {
9712 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9713 /* In a boolean context, GCC will fold the inner COND_EXPR to
9714 1. So e.g. "if (isinf_sign(x))" would be folded to just
9715 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9723 {
9736 integer_zero_node);
9737 }
9740 }
9755 {
9758 {
9759 /* NaN and Inf are encoded in the high-order double value
9760 only. The low-order value is not significant. */
9762 }
9763 }
9768 /* Folding to true for REAL_CST is done in fold_const_call_ss.
9769 Don't use tree_expr_signaling_nan_p (arg) -> integer_one_node
9770 and !tree_expr_maybe_signaling_nan_p (arg) -> integer_zero_node
9771 here, so there is some possibility of __builtin_issignaling working
9772 without -fsignaling-nans. Especially when -fno-signaling-nans is
9773 the default. */
9780 }
9781 }
9783 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9784 This builtin will generate code to return the appropriate floating
9785 point classification depending on the value of the floating point
9786 number passed in. The possible return values must be supplied as
9787 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9788 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9789 one floating point argument which is "type generic". */
9791 static tree
9793 {
9796 machine_mode mode;
9797 REAL_VALUE_TYPE r;
9800 /* Verify the required arguments in the original call. */
9820 /* fpclassify(x) ->
9821 isnan(x) ? FP_NAN :
9822 (fabs(x) == Inf ? FP_INFINITE :
9823 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9824 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9838 {
9843 }
9846 {
9849 }
9852 }
9854 /* Fold a call to an unordered comparison function such as
9855 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9856 being called and ARG0 and ARG1 are the arguments for the call.
9857 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9858 the opposite of the desired result. UNORDERED_CODE is used
9859 for modes that can hold NaNs and ORDERED_CODE is used for
9860 the rest. */
9862 static tree
9866 {
9880 /* Choose the wider of two real types. */
9894 {
9900 }
9906 }
9908 /* Fold a call to __builtin_iseqsig(). ARG0 and ARG1 are the arguments.
9909 After choosing the wider floating-point type for the comparison,
9910 the code is folded to:
9911 SAVE_EXPR<ARG0> >= SAVE_EXPR<ARG1> && SAVE_EXPR<ARG0> <= SAVE_EXPR<ARG1> */
9913 static tree
9915 {
9927 /* Choose the wider of two real types. */
9942 }
9944 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9945 arithmetics if it can never overflow, or into internal functions that
9946 return both result of arithmetics and overflowed boolean flag in
9947 a complex integer result, or some other check for overflow.
9948 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9949 checking part of that. */
9951 static tree
9954 {
9956 /* The code of the expression corresponding to the built-in. */
9961 {
9964 /* FALLTHRU */
9977 /* FALLTHRU */
9990 /* FALLTHRU */
10003 }
10005 /* For the "generic" overloads, the first two arguments can have different
10006 types and the last argument determines the target type to use to check
10007 for overflow. The arguments of the other overloads all have the same
10008 type. */
10011 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
10012 arguments are constant, attempt to fold the built-in call into a constant
10013 expression indicating whether or not it detected an overflow. */
10017 /* Perform the computation in the target type and check for overflow. */
10021 arg2);
10025 {
10033 }
10034 else
10035 {
10039 tree tgt;
10041 {
10044 }
10045 else
10046 {
10047 /* Force SAVE_EXPR even for calls which satisfy tree_invariant_p_1,
10048 as while the call itself is const, the REALPART_EXPR store is
10049 certainly not. And in any case, we want just one call,
10050 not multiple and trying to CSE them later. */
10053 }
10057 }
10063 tree store
10066 }
10068 /* Fold __builtin_{clz,ctz,clrsb,ffs,parity,popcount}g into corresponding
10069 internal function. */
10071 static tree
10074 {
10082 {
10125 }
10129 {
10136 {
10140 }
10141 else
10142 {
10144 ? long_long_unsigned_type_node
10147 }
10148 }
10150 {
10151 cast_type
10157 }
10158 else
10161 {
10163 {
10170 }
10173 }
10180 {
10184 }
10189 /* If the target supports the optab, then don't do the expansion. */
10191 {
10192 /* __int128 expansions using up to 2 long long builtins. */
10195 ? long_long_unsigned_type_node
10203 {
10218 NULL_TREE),
10219 call);
10235 NULL_TREE),
10236 call);
10250 tem);
10255 call,
10257 MAX_FIXED_MODE_SIZE
10274 NULL_TREE),
10275 call);
10285 NULL_TREE),
10287 NULL_TREE));
10291 }
10292 }
10293 else
10294 {
10295 /* Only keep second argument to IFN_CLZ/IFN_CTZ if it is the
10296 value defined at zero during GIMPLE, or for large/huge _BitInt
10297 (which are then lowered during bitint lowering). */
10299 {
10302 {
10307 }
10313 OPTIMIZE_FOR_BOTH))
10317 }
10321 else
10323 arg0);
10324 }
10335 }
10337 /* Fold __builtin_{add,sub}c{,l,ll} into pair of internal functions
10338 that return both result of arithmetics and overflowed boolean
10339 flag in a complex integer result. */
10341 static tree
10344 {
10348 {
10361 }
10367 /* Force SAVE_EXPR even for calls which satisfy tree_invariant_p_1,
10368 as while the call itself is const, the REALPART_EXPR store is
10369 certainly not. And in any case, we want just one call,
10370 not multiple and trying to CSE them later. */
10383 tree store
10386 }
10388 /* Fold a call to __builtin_FILE to a constant string. */
10392 {
10394 {
10395 /* The documentation says this builtin is equivalent to the preprocessor
10396 __FILE__ macro so it appears appropriate to use the same file prefix
10397 mappings. */
10400 }
10403 }
10405 /* Fold a call to __builtin_FUNCTION to a constant string. */
10409 {
10416 }
10418 /* Fold a call to __builtin_LINE to an integer constant. */
10422 {
10424 }
10426 /* Fold a call to built-in function FNDECL with 0 arguments.
10427 This function returns NULL_TREE if no simplification was possible. */
10429 static tree
10431 {
10435 {
10460 /* Rewrite any explicit calls to __builtin_unreachable. */
10467 }
10469 }
10471 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
10472 This function returns NULL_TREE if no simplification was possible. */
10474 static tree
10476 {
10487 {
10489 {
10492 /* Gimplification will pull the CALL_EXPR for the builtin out of
10493 an if condition. When not optimizing, we'll not CSE it back.
10494 To avoid link error types of regressions, return false now. */
10499 }
10556 {
10561 }
10567 {
10572 }
10604 }
10608 }
10610 /* Folds a call EXPR (which may be null) to built-in function FNDECL
10611 with 2 arguments, ARG0 and ARG1. This function returns NULL_TREE
10612 if no simplification was possible. */
10614 static tree
10616 {
10628 {
10672 NOP_EXPR);
10677 /* We do the folding for va_start in the expander. */
10697 }
10699 }
10701 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
10702 and ARG2.
10703 This function returns NULL_TREE if no simplification was possible. */
10705 static tree
10708 {
10722 {
10771 }
10773 }
10775 /* Folds a call EXPR (which may be null) to built-in function FNDECL.
10776 ARGS is an array of NARGS arguments. IGNORE is true if the result
10777 of the function call is ignored. This function returns NULL_TREE
10778 if no simplification was possible. */
10780 static tree
10783 {
10787 {
10803 }
10805 {
10809 }
10811 }
10813 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
10814 list ARGS along with N new arguments in NEWARGS. SKIP is the number
10815 of arguments in ARGS to be omitted. OLDNARGS is the number of
10816 elements in ARGS. */
10818 static tree
10821 {
10826 {
10834 }
10835 else
10839 }
10841 /* Return true if FNDECL shouldn't be folded right now.
10842 If a built-in function has an inline attribute always_inline
10843 wrapper, defer folding it after always_inline functions have
10844 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
10845 might not be performed. */
10847 bool
10849 {
10852 && cfun
10855 }
10857 /* A wrapper function for builtin folding that prevents warnings for
10858 "statement without effect" and the like, caused by removing the
10859 call node earlier than the warning is generated. */
10861 tree
10863 {
10867 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
10868 yet. Defer folding until we see all the arguments
10869 (after inlining). */
10871 {
10874 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
10875 instead last argument is __builtin_va_arg_pack (). Defer folding
10876 even in that case, until arguments are finalized. */
10878 {
10882 }
10890 else
10891 {
10896 }
10897 }
10899 }
10901 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
10902 N arguments are passed in the array ARGARRAY. Return a folded
10903 expression or NULL_TREE if no simplification was possible. */
10905 tree
10907 tree fn,
10910 {
10917 {
10918 /* If last argument is __builtin_va_arg_pack (), arguments to this
10919 function are not finalized yet. Defer folding until they are. */
10921 {
10925 }
10930 else
10932 }
10935 }
10937 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
10938 along with N new arguments specified as the "..." parameters. SKIP
10939 is the number of arguments in EXP to be omitted. This function is used
10940 to do varargs-to-varargs transformations. */
10942 static tree
10944 {
10946 tree t;
10954 }
10956 /* Validate a single argument ARG against a tree code CODE representing
10957 a type. Return true when argument is valid. */
10959 static bool
10961 {
10969 }
10971 /* This function validates the types of a function call argument list
10972 against a specified list of tree_codes. If the last specifier is a 0,
10973 that represents an ellipses, otherwise the last specifier must be a
10974 VOID_TYPE.
10976 This is the GIMPLE version of validate_arglist. Eventually we want to
10977 completely convert builtins.cc to work from GIMPLEs and the tree based
10978 validate_arglist will then be removed. */
10980 bool
10982 {
10986 const_tree arg;
10992 do
10993 {
10996 {
10998 /* This signifies an ellipses, any further arguments are all ok. */
11002 /* This signifies an endlink, if no arguments remain, return
11003 true, otherwise return false. */
11007 /* If no parameters remain or the parameter's code does not
11008 match the specified code, return false. Otherwise continue
11009 checking any remaining arguments. */
11014 }
11015 }
11018 /* We need gotos here since we can only have one VA_CLOSE in a
11019 function. */
11020 end: ;
11024 }
11026 /* Default target-specific builtin expander that does nothing. */
11028 rtx
11030 rtx target ATTRIBUTE_UNUSED,
11031 rtx subtarget ATTRIBUTE_UNUSED,
11032 machine_mode mode ATTRIBUTE_UNUSED,
11034 {
11036 }
11038 /* Returns true is EXP represents data that would potentially reside
11039 in a readonly section. */
11041 bool
11043 {
11053 /* Make sure we call decl_readonly_section only for trees it
11054 can handle (since it returns true for everything it doesn't
11055 understand). */
11060 else
11062 }
11064 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
11065 to the call, and TYPE is its return type.
11067 Return NULL_TREE if no simplification was possible, otherwise return the
11068 simplified form of the call as a tree.
11070 The simplified form may be a constant or other expression which
11071 computes the same value, but in a more efficient manner (including
11072 calls to other builtin functions).
11074 The call may contain arguments which need to be evaluated, but
11075 which are not useful to determine the result of the call. In
11076 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11077 COMPOUND_EXPR will be an argument which must be evaluated.
11078 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11079 COMPOUND_EXPR in the chain will contain the tree for the simplified
11080 form of the builtin function call. */
11082 static tree
11084 {
11089 tree fn;
11098 {
11100 tree tem;
11105 /* Return an offset into the constant string argument. */
11108 }
11111 /* strpbrk(x, "") == NULL.
11112 Evaluate and ignore s1 in case it had side-effects. */
11122 /* New argument list transforming strpbrk(s1, s2) to
11123 strchr(s1, s2[0]). */
11126 }
11128 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
11129 to the call.
11131 Return NULL_TREE if no simplification was possible, otherwise return the
11132 simplified form of the call as a tree.
11134 The simplified form may be a constant or other expression which
11135 computes the same value, but in a more efficient manner (including
11136 calls to other builtin functions).
11138 The call may contain arguments which need to be evaluated, but
11139 which are not useful to determine the result of the call. In
11140 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11141 COMPOUND_EXPR will be an argument which must be evaluated.
11142 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11143 COMPOUND_EXPR in the chain will contain the tree for the simplified
11144 form of the builtin function call. */
11146 static tree
11148 {
11159 /* If either argument is "", return NULL_TREE. */
11161 /* Evaluate and ignore both arguments in case either one has
11162 side-effects. */
11166 }
11168 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
11169 to the call.
11171 Return NULL_TREE if no simplification was possible, otherwise return the
11172 simplified form of the call as a tree.
11174 The simplified form may be a constant or other expression which
11175 computes the same value, but in a more efficient manner (including
11176 calls to other builtin functions).
11178 The call may contain arguments which need to be evaluated, but
11179 which are not useful to determine the result of the call. In
11180 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11181 COMPOUND_EXPR will be an argument which must be evaluated.
11182 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11183 COMPOUND_EXPR in the chain will contain the tree for the simplified
11184 form of the builtin function call. */
11186 static tree
11188 {
11197 /* If the first argument is "", return NULL_TREE. */
11200 {
11201 /* Evaluate and ignore argument s2 in case it has
11202 side-effects. */
11205 }
11207 /* If the second argument is "", return __builtin_strlen(s1). */
11210 {
11213 /* If the replacement _DECL isn't initialized, don't do the
11214 transformation. */
11219 }
11221 }
11223 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
11224 produced. False otherwise. This is done so that we don't output the error
11225 or warning twice or three times. */
11227 bool
11229 {
11232 tree arg;
11233 /* There is good chance the current input_location points inside the
11234 definition of the va_start macro (perhaps on the token for
11235 builtin) in a system header, so warnings will not be emitted.
11236 Use the location in real source code. */
11237 location_t current_location =
11239 NULL);
11242 {
11245 }
11248 {
11250 {
11253 }
11255 }
11256 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
11257 when we checked the arguments and if needed issued a warning. */
11258 else
11259 {
11261 {
11262 /* Evidently an out of date version of <stdarg.h>; can't validate
11263 va_start's second argument, but can still work as intended. */
11265 OPT_Wvarargs,
11268 }
11270 {
11273 }
11275 }
11281 /* We destructively modify the call to be __builtin_va_start (ap, 0)
11282 or __builtin_next_arg (0) the first time we see it, after checking
11283 the arguments and if needed issuing a warning. */
11285 {
11288 /* Strip off all nops for the sake of the comparison. This
11289 is not quite the same as STRIP_NOPS. It does more.
11290 We must also strip off INDIRECT_EXPR for C++ reference
11291 parameters. */
11296 {
11297 /* FIXME: Sometimes with the tree optimizers we can get the
11298 not the last argument even though the user used the last
11299 argument. We just warn and set the arg to be the last
11300 argument so that we will get wrong-code because of
11301 it. */
11303 OPT_Wvarargs,
11305 }
11307 /* Undefined by C99 7.15.1.4p4 (va_start):
11308 "If the parameter parmN is declared with the register storage
11309 class, with a function or array type, or with a type that is
11310 not compatible with the type that results after application of
11311 the default argument promotions, the behavior is undefined."
11312 */
11314 {
11316 OPT_Wvarargs,
11317 "undefined behavior when second parameter of "
11319 }
11321 /* We want to verify the second parameter just once before the tree
11322 optimizers are run and then avoid keeping it in the tree,
11323 as otherwise we could warn even for correct code like:
11324 void foo (int i, ...)
11325 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
11328 else
11330 }
11332 }
11335 /* Expand a call EXP to __builtin_object_size. */
11337 static rtx
11339 {
11340 tree ost;
11345 {
11347 fndecl);
11350 }
11358 {
11360 fndecl);
11363 }
11368 }
11370 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
11371 FCODE is the BUILT_IN_* to use.
11372 Return NULL_RTX if we failed; the caller should emit a normal call,
11373 otherwise try to get the result in TARGET, if convenient (and in
11374 mode MODE if that's convenient). */
11376 static rtx
11379 {
11381 POINTER_TYPE,
11382 fcode == BUILT_IN_MEMSET_CHK
11392 /* FIXME: Set access mode to write only for memset et al. */
11400 {
11401 /* Avoid transforming the checking call to an ordinary one when
11402 an overflow has been detected or when the call couldn't be
11403 validated because the size is not constant. */
11408 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
11409 mem{cpy,pcpy,move,set} is available. */
11411 {
11426 }
11435 }
11438 else
11439 {
11442 /* If DEST is not a pointer type, call the normal function. */
11446 /* If SRC and DEST are the same (and not volatile), do nothing. */
11448 {
11449 tree expr;
11452 {
11453 /* Evaluate and ignore LEN in case it has side-effects. */
11456 }
11460 }
11462 /* __memmove_chk special case. */
11464 {
11470 /* If src is categorized for a readonly section we can use
11471 normal __memcpy_chk. */
11473 {
11482 }
11483 }
11485 }
11486 }
11488 /* Emit warning if a buffer overflow is detected at compile time. */
11490 static void
11492 {
11493 /* The source string. */
11495 /* The size of the destination object returned by __builtin_object_size. */
11497 /* The string that is being concatenated with (as in __strcat_chk)
11498 or null if it isn't. */
11500 /* The maximum length of the source sequence in a bounded operation
11501 (such as __strncat_chk) or null if the operation isn't bounded
11502 (such as __strcat_chk). */
11504 /* The exact size of the access (such as in __strncpy_chk). */
11506 /* The access by the function that's checked. Except for snprintf
11507 both writing and reading is checked. */
11511 {
11519 /* For __strcat_chk the warning will be emitted only if overflowing
11520 by at least strlen (dest) + 1 bytes. */
11544 /* The only checked access the write to the destination. */
11549 }
11552 {
11553 /* Check __strncat_chk. There is no way to determine the length
11554 of the string to which the source string is being appended so
11555 just warn when the length of the source string is not known. */
11558 }
11561 }
11563 /* Emit warning if a buffer overflow is detected at compile time
11564 in __sprintf_chk/__vsprintf_chk calls. */
11566 static void
11568 {
11573 /* Verify the required arguments in the original call. */
11583 /* Check whether the format is a literal string constant. */
11591 /* If the format doesn't contain % args or %%, we know its size. */
11594 /* If the format is "%s" and first ... argument is a string literal,
11595 we know it too. */
11598 {
11599 tree arg;
11610 }
11611 else
11614 /* Add one for the terminating nul. */
11618 access_write_only);
11619 }
11621 /* Fold a call to __builtin_object_size with arguments PTR and OST,
11622 if possible. */
11624 static tree
11626 {
11627 tree bytes;
11643 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
11644 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
11645 and (size_t) 0 for types 2 and 3. */
11653 {
11658 }
11660 {
11661 /* If object size is not known yet, delay folding until
11662 later. Maybe subsequent passes will help determining
11663 it. */
11668 }
11671 }
11673 /* Builtins with folding operations that operate on "..." arguments
11674 need special handling; we need to store the arguments in a convenient
11675 data structure before attempting any folding. Fortunately there are
11676 only a few builtins that fall into this category. FNDECL is the
11677 function, EXP is the CALL_EXPR for the call. */
11679 static tree
11681 {
11686 {
11701 }
11703 {
11708 }
11710 }
11712 /* Initialize format string characters in the target charset. */
11714 bool
11716 {
11719 {
11742 }
11744 }
11746 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
11747 and no overflow/underflow occurred. INEXACT is true if M was not
11748 exactly calculated. TYPE is the tree type for the result. This
11749 function assumes that you cleared the MPFR flags and then
11750 calculated M to see if anything subsequently set a flag prior to
11751 entering this function. Return NULL_TREE if any checks fail. */
11753 static tree
11755 {
11756 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
11757 overflow/underflow occurred. If -frounding-math, proceed iff the
11758 result of calling FUNC was exact. */
11761 {
11762 REAL_VALUE_TYPE rr;
11765 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
11766 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
11767 but the mpfr_t is not, then we underflowed in the
11768 conversion. */
11771 {
11772 REAL_VALUE_TYPE rmode;
11775 /* Proceed iff the specified mode can hold the value. */
11778 }
11779 }
11781 }
11783 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
11784 number and no overflow/underflow occurred. INEXACT is true if M
11785 was not exactly calculated. TYPE is the tree type for the result.
11786 This function assumes that you cleared the MPFR flags and then
11787 calculated M to see if anything subsequently set a flag prior to
11788 entering this function. Return NULL_TREE if any checks fail, if
11789 FORCE_CONVERT is true, then bypass the checks. */
11791 static tree
11793 {
11794 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
11795 overflow/underflow occurred. If -frounding-math, proceed iff the
11796 result of calling FUNC was exact. */
11801 {
11806 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
11807 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
11808 but the mpfr_t is not, then we underflowed in the
11809 conversion. */
11814 {
11819 /* Proceed iff the specified mode can hold the value. */
11825 }
11826 }
11828 }
11830 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
11831 the pointer *(ARG_QUO) and return the result. The type is taken
11832 from the type of ARG0 and is used for setting the precision of the
11833 calculation and results. */
11835 static tree
11837 {
11844 /* To proceed, MPFR must exactly represent the target floating point
11845 format, which only happens when the target base equals two. */
11849 {
11854 {
11858 tree result_rem;
11867 /* Remquo is independent of the rounding mode, so pass
11868 inexact=0 to do_mpfr_ckconv(). */
11872 {
11873 /* MPFR calculates quo in the host's long so it may
11874 return more bits in quo than the target int can hold
11875 if sizeof(host long) > sizeof(target int). This can
11876 happen even for native compilers in LP64 mode. In
11877 these cases, modulo the quo value with the largest
11878 number that the target int can hold while leaving one
11879 bit for the sign. */
11883 /* Dereference the quo pointer argument. */
11885 /* Proceed iff a valid pointer type was passed in. */
11887 {
11888 /* Set the value. */
11889 tree result_quo
11892 integer_quo));
11894 /* Combine the quo assignment with the rem. */
11899 }
11900 }
11901 }
11902 }
11904 }
11906 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
11907 resulting value as a tree with type TYPE. The mpfr precision is
11908 set to the precision of TYPE. We assume that this mpfr function
11909 returns zero if the result could be calculated exactly within the
11910 requested precision. In addition, the integer pointer represented
11911 by ARG_SG will be dereferenced and set to the appropriate signgam
11912 (-1,1) value. */
11914 static tree
11916 {
11921 /* To proceed, MPFR must exactly represent the target floating point
11922 format, which only happens when the target base equals two. Also
11923 verify ARG is a constant and that ARG_SG is an int pointer. */
11928 {
11931 /* In addition to NaN and Inf, the argument cannot be zero or a
11932 negative integer. */
11936 {
11941 tree result_lg;
11949 {
11950 tree result_sg;
11952 /* Dereference the arg_sg pointer argument. */
11954 /* Assign the signgam value into *arg_sg. */
11959 /* Combine the signgam assignment with the lgamma result. */
11962 }
11963 }
11964 }
11967 }
11969 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
11970 mpc function FUNC on it and return the resulting value as a tree
11971 with type TYPE. The mpfr precision is set to the precision of
11972 TYPE. We assume that function FUNC returns zero if the result
11973 could be calculated exactly within the requested precision. If
11974 DO_NONFINITE is true, then fold expressions containing Inf or NaN
11975 in the arguments and/or results. */
11977 tree
11980 {
11986 /* To proceed, MPFR must exactly represent the target floating point
11987 format, which only happens when the target base equals two. */
11993 {
12002 {
12023 }
12024 }
12027 }
12029 /* A wrapper function for builtin folding that prevents warnings for
12030 "statement without effect" and the like, caused by removing the
12031 call node earlier than the warning is generated. */
12033 tree
12035 {
12041 {
12050 {
12052 }
12053 else
12054 {
12057 {
12058 /* Propagate location information from original call to
12059 expansion of builtin. Otherwise things like
12060 maybe_emit_chk_warning, that operate on the expansion
12061 of a builtin, will use the wrong location information. */
12063 {
12071 }
12073 }
12074 }
12075 }
12077 }
12079 /* Look up the function in builtin_decl that corresponds to DECL
12080 and set ASMSPEC as its user assembler name. DECL must be a
12081 function decl that declares a builtin. */
12083 void
12085 {
12094 {
12098 }
12099 }
12101 /* Return true if DECL is a builtin that expands to a constant or similarly
12102 simple code. */
12103 bool
12105 {
12108 {
12109 /* Builtins that expand to constants. */
12114 /* Simple register moves or loads from stack. */
12126 /* Exception state returns or moves registers around. */
12134 }
12137 }
12139 /* Return true if DECL is a builtin that is not expensive, i.e., they are
12140 most probably expanded inline into reasonably simple code. This is a
12141 superset of is_simple_builtin. */
12142 bool
12144 {
12151 {
12153 CASE_BUILT_IN_ALLOCA:
12222 }
12225 }
12227 /* Return true if T is a constant and the value cast to a target char
12228 can be represented by a host char.
12229 Store the casted char constant in *P if so. */
12231 bool
12233 {
12239 }
12241 /* Return true if the builtin DECL is implemented in a standard library.
12242 Otherwise return false which doesn't guarantee it is not (thus the list
12243 of handled builtins below may be incomplete). */
12245 bool
12247 {
12250 {
12369 /* stpcpy is both referenced in libiberty's pex-win32.c and provided
12370 by libiberty's stpcpy.c for MinGW targets so we need to return true
12371 in order to be able to build libiberty in LTO mode for them. */
12376 }
12378 }
12380 /* Return true if OFFRNG is bounded to a subrange of offset values
12381 valid for the largest possible object. */
12383 bool
12385 {
12389 }
12391 /* If CALLEE has known side effects, fill in INFO and return true.
12392 See tree-ssa-structalias.cc:find_func_aliases
12393 for the list of builtins we might need to handle here. */
12395 attr_fnspec
12397 {
12401 {
12402 /* All the following functions read memory pointed to by
12403 their second argument and write memory pointed to by first
12404 argument.
12405 strcat/strncat additionally reads memory pointed to by the first
12406 argument. */
12446 /* The following functions read memory pointed to by their
12447 first argument. */
12480 /* These read memory pointed to by the first argument.
12481 Allocating memory does not have any side-effects apart from
12482 being the definition point for the pointer.
12483 Unix98 specifies that errno is set on allocation failure. */
12488 /* Allocating memory does not have any side-effects apart from
12489 being the definition point for the pointer. */
12495 CASE_BUILT_IN_ALLOCA:
12497 /* These read memory pointed to by the first argument with size
12498 in the third argument. */
12501 /* These read memory pointed to by the first and second arguments. */
12510 /* Freeing memory kills the pointed-to memory. More importantly
12511 the call has to serve as a barrier for moving loads and stores
12512 across it. */
12519 /* Realloc serves both as allocation point and deallocation point. */
12579 /* But posix_memalign stores a pointer into the memory pointed to
12580 by its first argument. */
12586 }
12587 }