| blob | 284926f884d07919e48705ec057dea148a49e4ce |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2020 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.c instead. */
81 #if SWITCHABLE_TARGET
83 #endif
85 /* Define the names of the builtin function types and codes. */
89 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
91 {
93 };
95 /* Setup an array of builtin_info_type, make sure each element decl is
96 initialized to NULL_TREE. */
99 /* Non-zero if __builtin_constant_p should be folded right away. */
133 memop_ret retmode,
204 {
205 /* Set to valid. */
207 /* Invalidate. */
210 /* Set the default bounds of the access and adjust below. */
214 /* When BOUND is nonnull and a range can be extracted from it,
215 set the bounds of the access to reflect both it and MINACCESS.
216 BNDRNG[0] is the size of the minimum access. */
219 {
223 }
224 }
226 /* Return true if NAME starts with __builtin_ or __sync_. */
228 static bool
230 {
238 }
240 /* Return true if NODE should be considered for inline expansion regardless
241 of the optimization level. This means whenever a function is invoked with
242 its "internal" name, which normally contains the prefix "__builtin". */
244 bool
246 {
247 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
248 we want the name used to call the function, not the name it
249 will have. */
252 }
254 /* Compute values M and N such that M divides (address of EXP - N) and such
255 that N < M. If these numbers can be determined, store M in alignp and N in
256 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
257 *alignp and any bit-offset to *bitposp.
259 Note that the address (and thus the alignment) computed here is based
260 on the address to which a symbol resolves, whereas DECL_ALIGN is based
261 on the address at which an object is actually located. These two
262 addresses are not always the same. For example, on ARM targets,
263 the address &foo of a Thumb function foo() has the lowest bit set,
264 whereas foo() itself starts on an even address.
266 If ADDR_P is true we are taking the address of the memory reference EXP
267 and thus cannot rely on the access taking place. */
269 static bool
272 {
274 tree offset;
275 machine_mode mode;
280 /* Get the innermost object and the constant (bitpos) and possibly
281 variable (offset) offset of the access. */
285 /* Extract alignment information from the innermost object and
286 possibly adjust bitpos and offset. */
288 {
289 /* Function addresses can encode extra information besides their
290 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
291 allows the low bit to be used as a virtual bit, we know
292 that the address itself must be at least 2-byte aligned. */
295 }
297 ;
299 {
300 /* The alignment of a CONST_DECL is determined by its initializer. */
307 }
309 {
312 }
316 {
322 /* If the address is explicitely aligned, handle that. */
325 {
330 }
332 known_alignment
336 /* Re-apply explicit alignment to the bitpos. */
339 /* The alignment of the pointer operand in a TARGET_MEM_REF
340 has to take the variable offset parts into account. */
342 {
344 {
349 }
353 }
355 /* When EXP is an actual memory reference then we can use
356 TYPE_ALIGN of a pointer indirection to derive alignment.
357 Do so only if get_pointer_alignment_1 did not reveal absolute
358 alignment knowledge and if using that alignment would
359 improve the situation. */
365 else
366 {
367 /* Else adjust bitpos accordingly. */
372 }
373 }
375 {
376 /* STRING_CST are the only constant objects we allow to be not
377 wrapped inside a CONST_DECL. */
383 }
385 /* If there is a non-constant offset part extract the maximum
386 alignment that can prevail. */
388 {
391 {
395 }
396 }
398 /* Account for the alignment of runtime coefficients, so that the constant
399 bitpos is guaranteed to be accurate. */
402 {
405 }
410 }
412 /* For a memory reference expression EXP compute values M and N such that M
413 divides (&EXP - N) and such that N < M. If these numbers can be determined,
414 store M in alignp and N in *BITPOSP and return true. Otherwise return false
415 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
417 bool
420 {
422 }
424 /* Return the alignment in bits of EXP, an object. */
426 unsigned int
428 {
434 /* align and bitpos now specify known low bits of the pointer.
435 ptr & (align - 1) == bitpos. */
440 }
442 /* For a pointer valued expression EXP compute values M and N such that M
443 divides (EXP - N) and such that N < M. If these numbers can be determined,
444 store M in alignp and N in *BITPOSP and return true. Return false if
445 the results are just a conservative approximation.
447 If EXP is not a pointer, false is returned too. */
449 bool
452 {
459 {
466 else
467 {
470 {
474 }
475 }
479 }
482 {
487 {
490 /* Make sure to return a sensible alignment when the multiplication
491 by BITS_PER_UNIT overflowed. */
494 /* We cannot really tell whether this result is an approximation. */
496 }
497 else
498 {
502 }
503 }
505 {
510 }
515 }
517 /* Return the alignment in bits of EXP, a pointer valued expression.
518 The alignment returned is, by default, the alignment of the thing that
519 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
521 Otherwise, look at the expression to see if we can do better, i.e., if the
522 expression is actually pointing at an object whose alignment is tighter. */
524 unsigned int
526 {
532 /* align and bitpos now specify known low bits of the pointer.
533 ptr & (align - 1) == bitpos. */
539 }
541 /* Return the number of leading non-zero elements in the sequence
542 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
543 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
545 unsigned
547 {
553 {
554 /* Optimize the common case of plain char. */
556 {
560 }
561 }
562 else
563 {
565 {
569 }
570 }
572 }
574 /* For a call EXPR at LOC to a function FNAME that expects a string
575 in the argument ARG, issue a diagnostic due to it being a called
576 with an argument that is a character array with no terminating
577 NUL. SIZE is the EXACT size of the array, and BNDRNG the number
578 of characters in which the NUL is expected. Either EXPR or FNAME
579 may be null but noth both. SIZE may be null when BNDRNG is null. */
581 void
586 {
593 /* Format the bound range as a string to keep the nuber of messages
594 from exploding. */
598 {
601 else
605 }
610 {
613 {
616 "%K%qD specified bound %s exceeds "
619 else
620 {
623 exact
626 : (maybe
628 "exceed the size of at most %E "
631 "the size of at most %E "
634 }
635 }
636 else
640 }
641 else
642 {
644 {
647 "%qs specified bound %s exceeds "
650 else
651 {
654 exact
657 : (maybe
659 "exceed the size of at most %E "
662 "the size of at most %E "
665 }
666 }
667 else
670 fname);
671 }
674 {
680 }
681 }
683 /* For a call EXPR (which may be null) that expects a string argument
684 SRC as an argument, returns false if SRC is a character array with
685 no terminating NUL. When nonnull, BOUND is the number of characters
686 in which to expect the terminating NUL. RDONLY is true for read-only
687 accesses such as strcmp, false for read-write such as strcpy. When
688 EXPR is also issues a warning. */
690 bool
693 {
694 /* The constant size of the array SRC points to. The actual size
695 may be less of EXACT is true, but not more. */
696 tree size;
697 /* True if SRC involves a non-constant offset into the array. */
699 /* The unterminated constant array SRC points to. */
704 /* NONSTR refers to the non-nul terminated constant array and SIZE
705 is the constant size of the array in bytes. EXACT is true when
706 SIZE is exact. */
710 {
713 else
714 {
718 }
721 {
724 }
727 }
734 }
736 /* If EXP refers to an unterminated constant character array return
737 the declaration of the object of which the array is a member or
738 element and if SIZE is not null, set *SIZE to the size of
739 the unterminated array and set *EXACT if the size is exact or
740 clear it otherwise. Otherwise return null. */
742 tree
744 {
745 /* C_STRLEN will return NULL and set DECL in the info
746 structure if EXP references a unterminated array. */
747 c_strlen_data lendata = { };
750 {
752 {
755 {
756 /* Constant offsets are already accounted for in LENDATA.MINLEN,
757 but not in a SSA_NAME + CST expression. */
762 {
763 /* Subtract the offset from the size of the array. */
768 }
769 else
771 }
772 else
776 }
778 }
781 }
783 /* Compute the length of a null-terminated character string or wide
784 character string handling character sizes of 1, 2, and 4 bytes.
785 TREE_STRING_LENGTH is not the right way because it evaluates to
786 the size of the character array in bytes (as opposed to characters)
787 and because it can contain a zero byte in the middle.
789 ONLY_VALUE should be nonzero if the result is not going to be emitted
790 into the instruction stream and zero if it is going to be expanded.
791 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
792 is returned, otherwise NULL, since
793 len = c_strlen (ARG, 1); if (len) expand_expr (len, ...); would not
794 evaluate the side-effects.
796 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
797 accesses. Note that this implies the result is not going to be emitted
798 into the instruction stream.
800 Additional information about the string accessed may be recorded
801 in DATA. For example, if ARG references an unterminated string,
802 then the declaration will be stored in the DECL field. If the
803 length of the unterminated string can be determined, it'll be
804 stored in the LEN field. Note this length could well be different
805 than what a C strlen call would return.
807 ELTSIZE is 1 for normal single byte character strings, and 2 or
808 4 for wide characer strings. ELTSIZE is by default 1.
810 The value returned is of type `ssizetype'. */
812 tree
814 {
815 /* If we were not passed a DATA pointer, then get one to a local
816 structure. That avoids having to check DATA for NULL before
817 each time we want to use it. */
818 c_strlen_data local_strlen_data = { };
827 {
834 }
842 /* Offset from the beginning of the string in bytes. */
843 tree byteoff;
844 tree memsize;
845 tree decl;
850 /* Determine the size of the string element. */
854 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
855 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
856 in case the latter is less than the size of the array, such as when
857 SRC refers to a short string literal used to initialize a large array.
858 In that case, the elements of the array after the terminating NUL are
859 all NUL. */
868 /* PTR can point to the byte representation of any string type, including
869 char* and wchar_t*. */
873 {
874 /* The code below works only for single byte character types. */
878 /* If the string has an internal NUL character followed by any
879 non-NUL characters (e.g., "foo\0bar"), we can't compute
880 the offset to the following NUL if we don't know where to
881 start searching for it. */
884 /* Return when an embedded null character is found or none at all.
885 In the latter case, set the DECL/LEN field in the DATA structure
886 so that callers may examine them. */
890 {
895 }
897 /* For empty strings the result should be zero. */
901 /* We don't know the starting offset, but we do know that the string
902 has no internal zero bytes. If the offset falls within the bounds
903 of the string subtract the offset from the length of the string,
904 and return that. Otherwise the length is zero. Take care to
905 use SAVE_EXPR in case the OFFSET has side-effects. */
912 offsave);
916 }
918 /* Offset from the beginning of the string in elements. */
919 HOST_WIDE_INT eltoff;
921 /* We have a known offset into the string. Start searching there for
922 a null character if we can represent it as a single HOST_WIDE_INT. */
927 else
930 /* If the offset is known to be out of bounds, warn, and call strlen at
931 runtime. */
933 {
934 /* Suppress multiple warnings for propagated constant strings. */
939 eltoff))
940 {
944 }
946 }
948 /* If eltoff is larger than strelts but less than maxelts the
949 string length is zero, since the excess memory will be zero. */
953 /* Use strlen to search for the first zero byte. Since any strings
954 constructed with build_string will have nulls appended, we win even
955 if we get handed something like (char[4])"abcd".
957 Since ELTOFF is our starting index into the string, no further
958 calculation is needed. */
962 /* Don't know what to return if there was no zero termination.
963 Ideally this would turn into a gcc_checking_assert over time.
964 Set DECL/LEN so callers can examine them. */
966 {
971 }
974 }
976 /* Return a constant integer corresponding to target reading
977 GET_MODE_BITSIZE (MODE) bits from string constant STR. If
978 NULL_TERMINATED_P, reading stops after '\0' character, all further ones
979 are assumed to be zero, otherwise it reads as many characters
980 as needed. */
982 rtx
985 {
986 HOST_WIDE_INT ch;
1000 {
1012 }
1016 }
1018 /* Cast a target constant CST to target CHAR and if that value fits into
1019 host char type, return zero and put that value into variable pointed to by
1020 P. */
1022 static int
1024 {
1031 /* Do not care if it fits or not right here. */
1046 }
1048 /* Similar to save_expr, but assumes that arbitrary code is not executed
1049 in between the multiple evaluations. In particular, we assume that a
1050 non-addressable local variable will not be modified. */
1052 static tree
1054 {
1062 }
1064 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
1065 times to get the address of either a higher stack frame, or a return
1066 address located within it (depending on FNDECL_CODE). */
1068 static rtx
1070 {
1074 {
1075 /* For a zero count with __builtin_return_address, we don't care what
1076 frame address we return, because target-specific definitions will
1077 override us. Therefore frame pointer elimination is OK, and using
1078 the soft frame pointer is OK.
1080 For a nonzero count, or a zero count with __builtin_frame_address,
1081 we require a stable offset from the current frame pointer to the
1082 previous one, so we must use the hard frame pointer, and
1083 we must disable frame pointer elimination. */
1086 else
1087 {
1090 /* Tell reload not to eliminate the frame pointer. */
1092 }
1093 }
1098 /* On the SPARC, the return address is not in the frame, it is in a
1099 register. There is no way to access it off of the current frame
1100 pointer, but it can be accessed off the previous frame pointer by
1101 reading the value from the register window save area. */
1103 count--;
1105 /* Scan back COUNT frames to the specified frame. */
1107 {
1108 /* Assume the dynamic chain pointer is in the word that the
1109 frame address points to, unless otherwise specified. */
1114 }
1116 /* For __builtin_frame_address, return what we've got. But, on
1117 the SPARC for example, we may have to add a bias. */
1121 /* For __builtin_return_address, get the return address from that frame. */
1122 #ifdef RETURN_ADDR_RTX
1124 #else
1128 #endif
1130 }
1132 /* Alias set used for setjmp buffer. */
1135 /* Construct the leading half of a __builtin_setjmp call. Control will
1136 return to RECEIVER_LABEL. This is also called directly by the SJLJ
1137 exception handling code. */
1139 void
1141 {
1143 rtx stack_save;
1144 rtx mem;
1153 /* We store the frame pointer and the address of receiver_label in
1154 the buffer and use the rest of it for the stack save area, which
1155 is machine-dependent. */
1174 /* If there is further processing to do, do it. */
1178 /* We have a nonlocal label. */
1180 }
1182 /* Construct the trailing part of a __builtin_setjmp call. This is
1183 also called directly by the SJLJ exception handling code.
1184 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
1186 void
1188 {
1189 rtx chain;
1191 /* Mark the FP as used when we get here, so we have to make sure it's
1192 marked as used by this function. */
1195 /* Mark the static chain as clobbered here so life information
1196 doesn't get messed up for it. */
1202 {
1203 /* If the argument pointer can be eliminated in favor of the
1204 frame pointer, we don't need to restore it. We assume here
1205 that if such an elimination is present, it can always be used.
1206 This is the case on all known machines; if we don't make this
1207 assumption, we do unnecessary saving on many machines. */
1217 {
1218 /* Now restore our arg pointer from the address at which it
1219 was saved in our stack frame. */
1222 }
1223 }
1229 else
1232 /* We must not allow the code we just generated to be reordered by
1233 scheduling. Specifically, the update of the frame pointer must
1234 happen immediately, not later. */
1236 }
1238 /* __builtin_longjmp is passed a pointer to an array of five words (not
1239 all will be used on all machines). It operates similarly to the C
1240 library function of the same name, but is more efficient. Much of
1241 the code below is copied from the handling of non-local gotos. */
1243 static void
1245 {
1250 /* DRAP is needed for stack realign if longjmp is expanded to current
1251 function */
1262 /* We require that the user must pass a second argument of 1, because
1263 that is what builtin_setjmp will return. */
1269 else
1270 {
1281 /* Pick up FP, label, and SP from the block and jump. This code is
1282 from expand_goto in stmt.c; see there for detailed comments. */
1284 /* We have to pass a value to the nonlocal_goto pattern that will
1285 get copied into the static_chain pointer, but it does not matter
1286 what that value is, because builtin_setjmp does not use it. */
1288 else
1289 {
1295 /* Restore the frame pointer and stack pointer. We must use a
1296 temporary since the setjmp buffer may be a local. */
1300 /* Ensure the frame pointer move is not optimized. */
1309 }
1310 }
1312 /* Search backwards and mark the jump insn as a non-local goto.
1313 Note that this precludes the use of __builtin_longjmp to a
1314 __builtin_setjmp target in the same function. However, we've
1315 already cautioned the user that these functions are for
1316 internal exception handling use only. */
1318 {
1322 {
1325 }
1328 }
1329 }
1333 {
1335 }
1337 /* This function validates the types of a function call argument list
1338 against a specified list of tree_codes. If the last specifier is a 0,
1339 that represents an ellipsis, otherwise the last specifier must be a
1340 VOID_TYPE. */
1342 static bool
1344 {
1348 const_call_expr_arg_iterator iter;
1349 const_tree arg;
1354 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1359 {
1363 {
1365 /* This signifies an ellipses, any further arguments are all ok. */
1369 /* This signifies an endlink, if no arguments remain, return
1370 true, otherwise return false. */
1374 /* The actual argument must be nonnull when either the whole
1375 called function has been declared nonnull, or when the formal
1376 argument corresponding to the actual argument has been. */
1379 {
1384 }
1385 /* FALLTHRU */
1387 /* If no parameters remain or the parameter's code does not
1388 match the specified code, return false. Otherwise continue
1389 checking any remaining arguments. */
1394 }
1395 }
1397 /* We need gotos here since we can only have one VA_CLOSE in a
1398 function. */
1399 end: ;
1405 }
1407 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1408 and the address of the save area. */
1410 static rtx
1412 {
1427 /* Copy the address of the save location to a register just in case it was
1428 based on the frame pointer. */
1437 /* ??? We no longer need to pass the static chain value, afaik. */
1440 else
1441 {
1447 /* Restore the frame pointer and stack pointer. We must use a
1448 temporary since the setjmp buffer may be a local. */
1452 /* Ensure the frame pointer move is not optimized. */
1458 /* USE of hard_frame_pointer_rtx added for consistency;
1459 not clear if really needed. */
1463 /* If the architecture is using a GP register, we must
1464 conservatively assume that the target function makes use of it.
1465 The prologue of functions with nonlocal gotos must therefore
1466 initialize the GP register to the appropriate value, and we
1467 must then make sure that this value is live at the point
1468 of the jump. (Note that this doesn't necessarily apply
1469 to targets with a nonlocal_goto pattern; they are free
1470 to implement it in their own way. Note also that this is
1471 a no-op if the GP register is a global invariant.) */
1477 }
1479 /* Search backwards to the jump insn and mark it as a
1480 non-local goto. */
1482 {
1484 {
1487 }
1490 }
1493 }
1495 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1496 (not all will be used on all machines) that was passed to __builtin_setjmp.
1497 It updates the stack pointer in that block to the current value. This is
1498 also called directly by the SJLJ exception handling code. */
1500 void
1502 {
1505 rtx stack_save
1507 memory_address
1513 }
1515 /* Expand a call to __builtin_prefetch. For a target that does not support
1516 data prefetch, evaluate the memory address argument in case it has side
1517 effects. */
1519 static void
1521 {
1531 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1532 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1533 locality). */
1537 else
1541 else
1544 /* Argument 0 is an address. */
1547 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1549 {
1552 }
1554 /* Argument 1 must be either zero or one. */
1556 {
1560 }
1562 /* Argument 2 (locality) must be a compile-time constant int. */
1564 {
1567 }
1569 /* Argument 2 must be 0, 1, 2, or 3. */
1571 {
1574 }
1577 {
1585 }
1587 /* Don't do anything with direct references to volatile memory, but
1588 generate code to handle other side effects. */
1591 }
1593 /* Get a MEM rtx for expression EXP which is the address of an operand
1594 to be used in a string instruction (cmpstrsi, cpymemsi, ..). LEN is
1595 the maximum length of the block of memory that might be accessed or
1596 NULL if unknown. */
1598 static rtx
1600 {
1604 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1605 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1612 /* Get an expression we can use to find the attributes to assign to MEM.
1613 First remove any nops. */
1618 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1619 (as builtin stringops may alias with anything). */
1626 /* If the MEM_REF has no acceptable address, try to get the base object
1627 from the original address we got, and build an all-aliasing
1628 unknown-sized access to that one. */
1634 {
1639 size_zero_node,
1640 NULL)),
1643 }
1646 }
1647 \f
1648 /* Built-in functions to perform an untyped call and return. */
1650 #define apply_args_mode \
1651 (this_target_builtins->x_apply_args_mode)
1652 #define apply_result_mode \
1653 (this_target_builtins->x_apply_result_mode)
1655 /* Return the size required for the block returned by __builtin_apply_args,
1656 and initialize apply_args_mode. */
1658 static int
1660 {
1665 /* The values computed by this function never change. */
1667 {
1668 /* The first value is the incoming arg-pointer. */
1671 /* The second value is the structure value address unless this is
1672 passed as an "invisible" first argument. */
1678 {
1688 }
1689 else
1690 {
1692 }
1693 }
1695 }
1697 /* Return the size required for the block returned by __builtin_apply,
1698 and initialize apply_result_mode. */
1700 static int
1702 {
1706 /* The values computed by this function never change. */
1708 {
1713 {
1723 }
1724 else
1727 /* Allow targets that use untyped_call and untyped_return to override
1728 the size so that machine-specific information can be stored here. */
1729 #ifdef APPLY_RESULT_SIZE
1731 #endif
1732 }
1734 }
1736 /* Create a vector describing the result block RESULT. If SAVEP is true,
1737 the result block is used to save the values; otherwise it is used to
1738 restore the values. */
1740 static rtx
1742 {
1744 fixed_size_mode mode;
1751 {
1761 }
1763 }
1765 /* Save the state required to perform an untyped call with the same
1766 arguments as were passed to the current function. */
1768 static rtx
1770 {
1773 fixed_size_mode mode;
1774 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1776 /* Create a block where the arg-pointer, structure value address,
1777 and argument registers can be saved. */
1780 /* Walk past the arg-pointer and structure value address. */
1785 /* Save each register used in calling a function to the block. */
1788 {
1797 }
1799 /* Save the arg pointer to the block. */
1801 /* We need the pointer as the caller actually passed them to us, not
1802 as we might have pretended they were passed. Make sure it's a valid
1803 operand, as emit_move_insn isn't expected to handle a PLUS. */
1805 tem
1808 NULL_RTX);
1813 /* Save the structure value address unless this is passed as an
1814 "invisible" first argument. */
1819 /* Return the address of the block. */
1821 }
1823 /* __builtin_apply_args returns block of memory allocated on
1824 the stack into which is stored the arg pointer, structure
1825 value address, static chain, and all the registers that might
1826 possibly be used in performing a function call. The code is
1827 moved to the start of the function so the incoming values are
1828 saved. */
1830 static rtx
1832 {
1833 /* Don't do __builtin_apply_args more than once in a function.
1834 Save the result of the first call and reuse it. */
1837 {
1838 /* When this function is called, it means that registers must be
1839 saved on entry to this function. So we migrate the
1840 call to the first insn of this function. */
1841 rtx temp;
1850 /* Put the insns after the NOTE that starts the function.
1851 If this is inside a start_sequence, make the outer-level insn
1852 chain current, so the code is placed at the start of the
1853 function. If internal_arg_pointer is a non-virtual pseudo,
1854 it needs to be placed after the function that initializes
1855 that pseudo. */
1860 else
1864 }
1865 }
1867 /* Perform an untyped call and save the state required to perform an
1868 untyped return of whatever value was returned by the given function. */
1870 static rtx
1872 {
1874 fixed_size_mode mode;
1883 /* Create a block where the return registers can be saved. */
1886 /* Fetch the arg pointer from the ARGUMENTS block. */
1893 /* Push a new argument block and copy the arguments. Do not allow
1894 the (potential) memcpy call below to interfere with our stack
1895 manipulations. */
1897 NO_DEFER_POP;
1899 /* Save the stack with nonlocal if available. */
1902 else
1905 /* Allocate a block of memory onto the stack and copy the memory
1906 arguments to the outgoing arguments address. We can pass TRUE
1907 as the 4th argument because we just saved the stack pointer
1908 and will restore it right after the call. */
1911 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1912 may have already set current_function_calls_alloca to true.
1913 current_function_calls_alloca won't be set if argsize is zero,
1914 so we have to guarantee need_drap is true here. */
1920 {
1923 else
1925 }
1932 /* Refer to the argument block. */
1937 /* Walk past the arg-pointer and structure value address. */
1942 /* Restore each of the registers previously saved. Make USE insns
1943 for each of these registers for use in making the call. */
1946 {
1954 }
1956 /* Restore the structure value address unless this is passed as an
1957 "invisible" first argument. */
1960 {
1966 }
1968 /* All arguments and registers used for the call are set up by now! */
1971 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1972 and we don't want to load it into a register as an optimization,
1973 because prepare_call_address already did it if it should be done. */
1977 /* Generate the actual call instruction and save the return value. */
1979 {
1983 }
1985 {
1988 /* Locate the unique return register. It is not possible to
1989 express a call that sets more than one return register using
1990 call_value; use untyped_call for that. In fact, untyped_call
1991 only needs to save the return registers in the given block. */
1994 {
1998 }
2005 }
2006 else
2009 /* Find the CALL insn we just emitted, and attach the register usage
2010 information. */
2014 /* Restore the stack. */
2017 else
2021 OK_DEFER_POP;
2023 /* Return the address of the result block. */
2026 }
2028 /* Perform an untyped return. */
2030 static void
2032 {
2034 fixed_size_mode mode;
2035 rtx reg;
2044 {
2049 }
2051 /* Restore the return value and note that each value is used. */
2055 {
2067 }
2069 /* Put the USE insns before the return. */
2072 /* Return whatever values was restored by jumping directly to the end
2073 of the function. */
2075 }
2077 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
2079 static enum type_class
2081 {
2083 {
2102 }
2103 }
2105 /* Expand a call EXP to __builtin_classify_type. */
2107 static rtx
2109 {
2113 }
2115 /* This helper macro, meant to be used in mathfn_built_in below, determines
2116 which among a set of builtin math functions is appropriate for a given type
2117 mode. The `F' (float) and `L' (long double) are automatically generated
2118 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
2119 types, there are additional types that are considered with 'F32', 'F64',
2120 'F128', etc. suffixes. */
2121 #define CASE_MATHFN(MATHFN) \
2122 CASE_CFN_##MATHFN: \
2123 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
2124 fcodel = BUILT_IN_##MATHFN##L ; break;
2125 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
2126 types. */
2127 #define CASE_MATHFN_FLOATN(MATHFN) \
2128 CASE_CFN_##MATHFN: \
2129 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
2130 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
2131 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
2132 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
2133 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
2134 break;
2135 /* Similar to above, but appends _R after any F/L suffix. */
2136 #define CASE_MATHFN_REENT(MATHFN) \
2137 case CFN_BUILT_IN_##MATHFN##_R: \
2138 case CFN_BUILT_IN_##MATHFN##F_R: \
2139 case CFN_BUILT_IN_##MATHFN##L_R: \
2140 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
2141 fcodel = BUILT_IN_##MATHFN##L_R ; break;
2143 /* Return a function equivalent to FN but operating on floating-point
2144 values of type TYPE, or END_BUILTINS if no such function exists.
2145 This is purely an operation on function codes; it does not guarantee
2146 that the target actually has an implementation of the function. */
2148 static built_in_function
2150 {
2151 tree mtype;
2162 {
2163 #define SEQ_OF_CASE_MATHFN \
2164 CASE_MATHFN (ACOS) \
2165 CASE_MATHFN (ACOSH) \
2166 CASE_MATHFN (ASIN) \
2167 CASE_MATHFN (ASINH) \
2168 CASE_MATHFN (ATAN) \
2169 CASE_MATHFN (ATAN2) \
2170 CASE_MATHFN (ATANH) \
2171 CASE_MATHFN (CBRT) \
2172 CASE_MATHFN_FLOATN (CEIL) \
2173 CASE_MATHFN (CEXPI) \
2174 CASE_MATHFN_FLOATN (COPYSIGN) \
2175 CASE_MATHFN (COS) \
2176 CASE_MATHFN (COSH) \
2177 CASE_MATHFN (DREM) \
2178 CASE_MATHFN (ERF) \
2179 CASE_MATHFN (ERFC) \
2180 CASE_MATHFN (EXP) \
2181 CASE_MATHFN (EXP10) \
2182 CASE_MATHFN (EXP2) \
2183 CASE_MATHFN (EXPM1) \
2184 CASE_MATHFN (FABS) \
2185 CASE_MATHFN (FDIM) \
2186 CASE_MATHFN_FLOATN (FLOOR) \
2187 CASE_MATHFN_FLOATN (FMA) \
2188 CASE_MATHFN_FLOATN (FMAX) \
2189 CASE_MATHFN_FLOATN (FMIN) \
2190 CASE_MATHFN (FMOD) \
2191 CASE_MATHFN (FREXP) \
2192 CASE_MATHFN (GAMMA) \
2194 CASE_MATHFN (HUGE_VAL) \
2195 CASE_MATHFN (HYPOT) \
2196 CASE_MATHFN (ILOGB) \
2197 CASE_MATHFN (ICEIL) \
2198 CASE_MATHFN (IFLOOR) \
2199 CASE_MATHFN (INF) \
2200 CASE_MATHFN (IRINT) \
2201 CASE_MATHFN (IROUND) \
2202 CASE_MATHFN (ISINF) \
2203 CASE_MATHFN (J0) \
2204 CASE_MATHFN (J1) \
2205 CASE_MATHFN (JN) \
2206 CASE_MATHFN (LCEIL) \
2207 CASE_MATHFN (LDEXP) \
2208 CASE_MATHFN (LFLOOR) \
2209 CASE_MATHFN (LGAMMA) \
2211 CASE_MATHFN (LLCEIL) \
2212 CASE_MATHFN (LLFLOOR) \
2213 CASE_MATHFN (LLRINT) \
2214 CASE_MATHFN (LLROUND) \
2215 CASE_MATHFN (LOG) \
2216 CASE_MATHFN (LOG10) \
2217 CASE_MATHFN (LOG1P) \
2218 CASE_MATHFN (LOG2) \
2219 CASE_MATHFN (LOGB) \
2220 CASE_MATHFN (LRINT) \
2221 CASE_MATHFN (LROUND) \
2222 CASE_MATHFN (MODF) \
2223 CASE_MATHFN (NAN) \
2224 CASE_MATHFN (NANS) \
2225 CASE_MATHFN_FLOATN (NEARBYINT) \
2226 CASE_MATHFN (NEXTAFTER) \
2227 CASE_MATHFN (NEXTTOWARD) \
2228 CASE_MATHFN (POW) \
2229 CASE_MATHFN (POWI) \
2230 CASE_MATHFN (POW10) \
2231 CASE_MATHFN (REMAINDER) \
2232 CASE_MATHFN (REMQUO) \
2233 CASE_MATHFN_FLOATN (RINT) \
2234 CASE_MATHFN_FLOATN (ROUND) \
2235 CASE_MATHFN_FLOATN (ROUNDEVEN) \
2236 CASE_MATHFN (SCALB) \
2237 CASE_MATHFN (SCALBLN) \
2238 CASE_MATHFN (SCALBN) \
2239 CASE_MATHFN (SIGNBIT) \
2240 CASE_MATHFN (SIGNIFICAND) \
2241 CASE_MATHFN (SIN) \
2242 CASE_MATHFN (SINCOS) \
2243 CASE_MATHFN (SINH) \
2244 CASE_MATHFN_FLOATN (SQRT) \
2245 CASE_MATHFN (TAN) \
2246 CASE_MATHFN (TANH) \
2247 CASE_MATHFN (TGAMMA) \
2248 CASE_MATHFN_FLOATN (TRUNC) \
2249 CASE_MATHFN (Y0) \
2250 CASE_MATHFN (Y1) \
2251 CASE_MATHFN (YN)
2253 SEQ_OF_CASE_MATHFN
2257 }
2280 else
2282 }
2284 #undef CASE_MATHFN
2285 #undef CASE_MATHFN_FLOATN
2286 #undef CASE_MATHFN_REENT
2288 /* Return mathematic function equivalent to FN but operating directly on TYPE,
2289 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2290 otherwise use the explicit declaration. If we can't do the conversion,
2291 return null. */
2293 static tree
2295 {
2304 }
2306 /* Like mathfn_built_in_1, but always use the implicit array. */
2308 tree
2310 {
2312 }
2314 /* Like mathfn_built_in_1, but take a built_in_function and
2315 always use the implicit array. */
2317 tree
2319 {
2321 }
2323 /* Return the type associated with a built in function, i.e., the one
2324 to be passed to mathfn_built_in to get the type-specific
2325 function. */
2327 tree
2329 {
2330 #define CASE_MATHFN(MATHFN) \
2331 case BUILT_IN_##MATHFN: \
2332 return double_type_node; \
2333 case BUILT_IN_##MATHFN##F: \
2334 return float_type_node; \
2335 case BUILT_IN_##MATHFN##L: \
2336 return long_double_type_node;
2338 #define CASE_MATHFN_FLOATN(MATHFN) \
2339 CASE_MATHFN(MATHFN) \
2340 case BUILT_IN_##MATHFN##F16: \
2341 return float16_type_node; \
2342 case BUILT_IN_##MATHFN##F32: \
2343 return float32_type_node; \
2344 case BUILT_IN_##MATHFN##F64: \
2345 return float64_type_node; \
2346 case BUILT_IN_##MATHFN##F128: \
2347 return float128_type_node; \
2348 case BUILT_IN_##MATHFN##F32X: \
2349 return float32x_type_node; \
2350 case BUILT_IN_##MATHFN##F64X: \
2351 return float64x_type_node; \
2352 case BUILT_IN_##MATHFN##F128X: \
2353 return float128x_type_node;
2355 /* Similar to above, but appends _R after any F/L suffix. */
2356 #define CASE_MATHFN_REENT(MATHFN) \
2357 case BUILT_IN_##MATHFN##_R: \
2358 return double_type_node; \
2359 case BUILT_IN_##MATHFN##F_R: \
2360 return float_type_node; \
2361 case BUILT_IN_##MATHFN##L_R: \
2362 return long_double_type_node;
2365 {
2366 SEQ_OF_CASE_MATHFN
2370 }
2372 #undef CASE_MATHFN
2373 #undef CASE_MATHFN_FLOATN
2374 #undef CASE_MATHFN_REENT
2375 #undef SEQ_OF_CASE_MATHFN
2376 }
2378 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2379 return its code, otherwise return IFN_LAST. Note that this function
2380 only tests whether the function is defined in internals.def, not whether
2381 it is actually available on the target. */
2383 internal_fn
2385 {
2389 {
2390 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2391 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2392 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2393 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2394 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2395 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2396 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2413 }
2414 }
2416 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2417 on the current target by a call to an internal function, return the
2418 code of that internal function, otherwise return IFN_LAST. The caller
2419 is responsible for ensuring that any side-effects of the built-in
2420 call are dealt with correctly. E.g. if CALL sets errno, the caller
2421 must decide that the errno result isn't needed or make it available
2422 in some other way. */
2424 internal_fn
2426 {
2428 {
2431 {
2436 }
2437 }
2439 }
2441 /* Expand a call to the builtin trinary math functions (fma).
2442 Return NULL_RTX if a normal call should be emitted rather than expanding the
2443 function in-line. EXP is the expression that is a call to the builtin
2444 function; if convenient, the result should be placed in TARGET.
2445 SUBTARGET may be used as the target for computing one of EXP's
2446 operands. */
2448 static rtx
2450 {
2451 optab builtin_optab;
2456 machine_mode mode;
2466 {
2472 }
2474 /* Make a suitable register to place result in. */
2477 /* Before working hard, check whether the instruction is available. */
2483 /* Always stabilize the argument list. */
2494 /* Compute into RESULT.
2495 Set RESULT to wherever the result comes back. */
2499 /* If we were unable to expand via the builtin, stop the sequence
2500 (without outputting the insns) and call to the library function
2501 with the stabilized argument list. */
2503 {
2506 }
2508 /* Output the entire sequence. */
2514 }
2516 /* Expand a call to the builtin sin and cos math functions.
2517 Return NULL_RTX if a normal call should be emitted rather than expanding the
2518 function in-line. EXP is the expression that is a call to the builtin
2519 function; if convenient, the result should be placed in TARGET.
2520 SUBTARGET may be used as the target for computing one of EXP's
2521 operands. */
2523 static rtx
2525 {
2526 optab builtin_optab;
2527 rtx op0;
2530 machine_mode mode;
2531 tree arg;
2539 {
2545 }
2547 /* Make a suitable register to place result in. */
2550 /* Check if sincos insn is available, otherwise fallback
2551 to sin or cos insn. */
2554 {
2561 }
2563 /* Before working hard, check whether the instruction is available. */
2565 {
2568 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2569 need to expand the argument again. This way, we will not perform
2570 side-effects more the once. */
2577 /* Compute into RESULT.
2578 Set RESULT to wherever the result comes back. */
2580 {
2584 {
2593 }
2595 }
2596 else
2600 {
2601 /* Output the entire sequence. */
2606 }
2608 /* If we were unable to expand via the builtin, stop the sequence
2609 (without outputting the insns) and call to the library function
2610 with the stabilized argument list. */
2612 }
2615 }
2617 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2618 return an RTL instruction code that implements the functionality.
2619 If that isn't possible or available return CODE_FOR_nothing. */
2621 static enum insn_code
2623 {
2626 machine_mode mode;
2629 {
2643 /* These builtins have no optabs (yet). */
2647 }
2649 /* There's no easy way to detect the case we need to set EDOM. */
2653 /* Optab mode depends on the mode of the input argument. */
2659 }
2661 /* Expand a call to one of the builtin math functions that operate on
2662 floating point argument and output an integer result (ilogb, isinf,
2663 isnan, etc).
2664 Return 0 if a normal call should be emitted rather than expanding the
2665 function in-line. EXP is the expression that is a call to the builtin
2666 function; if convenient, the result should be placed in TARGET. */
2668 static rtx
2670 {
2672 rtx op0;
2674 machine_mode mode;
2675 tree arg;
2685 {
2690 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2691 need to expand the argument again. This way, we will not perform
2692 side-effects more the once. */
2707 }
2710 }
2712 /* Expand a call to the builtin sincos math function.
2713 Return NULL_RTX if a normal call should be emitted rather than expanding the
2714 function in-line. EXP is the expression that is a call to the builtin
2715 function. */
2717 static rtx
2719 {
2721 machine_mode mode;
2735 /* Make a suitable register to place result in. */
2738 /* Check if sincos insn is available, otherwise emit the call. */
2753 /* Compute into target1 and target2.
2754 Set TARGET to wherever the result comes back. */
2758 /* Move target1 and target2 to the memory locations indicated
2759 by op1 and op2. */
2764 }
2766 /* Expand a call to the internal cexpi builtin to the sincos math function.
2767 EXP is the expression that is a call to the builtin function; if convenient,
2768 the result should be placed in TARGET. */
2770 static rtx
2772 {
2775 machine_mode mode;
2786 /* Try expanding via a sincos optab, fall back to emitting a libcall
2787 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2788 is only generated from sincos, cexp or if we have either of them. */
2790 {
2796 /* Compute into op1 and op2. */
2798 }
2800 {
2811 else
2821 /* Make sure not to fold the sincos call again. */
2825 }
2826 else
2827 {
2837 else
2840 /* If we don't have a decl for cexp create one. This is the
2841 friendliest fallback if the user calls __builtin_cexpi
2842 without full target C99 function support. */
2844 {
2845 tree fntype;
2857 }
2862 /* Make sure not to fold the cexp call again. */
2866 }
2868 /* Now build the proper return type. */
2873 }
2875 /* Conveniently construct a function call expression. FNDECL names the
2876 function to be called, N is the number of arguments, and the "..."
2877 parameters are the argument expressions. Unlike build_call_exr
2878 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2880 static tree
2882 {
2892 }
2894 /* Expand a call to one of the builtin rounding functions gcc defines
2895 as an extension (lfloor and lceil). As these are gcc extensions we
2896 do not need to worry about setting errno to EDOM.
2897 If expanding via optab fails, lower expression to (int)(floor(x)).
2898 EXP is the expression that is a call to the builtin function;
2899 if convenient, the result should be placed in TARGET. */
2901 static rtx
2903 {
2904 convert_optab builtin_optab;
2909 tree fallback_fndecl;
2910 machine_mode mode;
2911 tree arg;
2919 {
2936 }
2938 /* Make a suitable register to place result in. */
2943 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2944 need to expand the argument again. This way, we will not perform
2945 side-effects more the once. */
2952 /* Compute into TARGET. */
2954 {
2955 /* Output the entire sequence. */
2960 }
2962 /* If we were unable to expand via the builtin, stop the sequence
2963 (without outputting the insns). */
2966 /* Fall back to floating point rounding optab. */
2969 /* For non-C99 targets we may end up without a fallback fndecl here
2970 if the user called __builtin_lfloor directly. In this case emit
2971 a call to the floor/ceil variants nevertheless. This should result
2972 in the best user experience for not full C99 targets. */
2974 {
2975 tree fntype;
2979 {
3012 }
3017 }
3024 /* Truncate the result of floating point optab to integer
3025 via expand_fix (). */
3030 }
3032 /* Expand a call to one of the builtin math functions doing integer
3033 conversion (lrint).
3034 Return 0 if a normal call should be emitted rather than expanding the
3035 function in-line. EXP is the expression that is a call to the builtin
3036 function; if convenient, the result should be placed in TARGET. */
3038 static rtx
3040 {
3041 convert_optab builtin_optab;
3042 rtx op0;
3045 tree arg;
3046 machine_mode mode;
3055 {
3074 }
3076 /* There's no easy way to detect the case we need to set EDOM. */
3080 /* Make a suitable register to place result in. */
3083 /* There's no easy way to detect the case we need to set EDOM. */
3085 {
3088 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
3089 need to expand the argument again. This way, we will not perform
3090 side-effects more the once. */
3098 {
3099 /* Output the entire sequence. */
3104 }
3106 /* If we were unable to expand via the builtin, stop the sequence
3107 (without outputting the insns) and call to the library function
3108 with the stabilized argument list. */
3110 }
3113 {
3114 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
3115 targets, (int) round (x) should never be transformed into
3116 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
3117 a call to lround in the hope that the target provides at least some
3118 C99 functions. This should result in the best user experience for
3119 not full C99 targets. */
3120 tree fallback_fndecl = mathfn_built_in_1
3129 }
3132 }
3134 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
3135 a normal call should be emitted rather than expanding the function
3136 in-line. EXP is the expression that is a call to the builtin
3137 function; if convenient, the result should be placed in TARGET. */
3139 static rtx
3141 {
3144 machine_mode mode;
3145 machine_mode mode2;
3154 /* Emit a libcall to libgcc. */
3156 /* Mode of the 2nd argument must match that of an int. */
3174 }
3176 /* Expand expression EXP which is a call to the strlen builtin. Return
3177 NULL_RTX if we failed and the caller should emit a normal call, otherwise
3178 try to get the result in TARGET, if convenient. */
3180 static rtx
3182 machine_mode target_mode)
3183 {
3191 /* If the length can be computed at compile-time, return it. */
3195 /* If the length can be computed at compile-time and is constant
3196 integer, but there are side-effects in src, evaluate
3197 src for side-effects, then return len.
3198 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
3199 can be optimized into: i++; x = 3; */
3202 {
3205 }
3209 /* If SRC is not a pointer type, don't do this operation inline. */
3213 /* Bail out if we can't compute strlen in the right mode. */
3214 machine_mode insn_mode;
3217 {
3221 }
3225 /* Make a place to hold the source address. We will not expand
3226 the actual source until we are sure that the expansion will
3227 not fail -- there are trees that cannot be expanded twice. */
3230 /* Mark the beginning of the strlen sequence so we can emit the
3231 source operand later. */
3242 /* Check to see if the argument was declared attribute nonstring
3243 and if so, issue a warning since at this point it's not known
3244 to be nul-terminated. */
3247 /* Now that we are assured of success, expand the source. */
3251 {
3252 #ifdef POINTERS_EXTEND_UNSIGNED
3255 POINTERS_EXTEND_UNSIGNED);
3256 #endif
3258 }
3264 else
3267 /* Return the value in the proper mode for this function. */
3272 else
3276 }
3278 /* Expand call EXP to the strnlen built-in, returning the result
3279 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
3281 static rtx
3283 {
3299 /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
3300 so these conversions aren't necessary. */
3301 c_strlen_data lendata = { };
3307 {
3313 }
3324 {
3329 }
3339 }
3341 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3342 bytes from bytes at DATA + OFFSET and return it reinterpreted as
3343 a target constant. */
3345 static rtx
3347 scalar_int_mode mode)
3348 {
3349 /* The REPresentation pointed to by DATA need not be a nul-terminated
3350 string but the caller guarantees it's large enough for MODE. */
3354 }
3356 /* LEN specify length of the block of memcpy/memset operation.
3357 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3358 In some cases we can make very likely guess on max size, then we
3359 set it into PROBABLE_MAX_SIZE. */
3361 static void
3366 {
3368 {
3371 }
3372 else
3373 {
3377 /* Determine bounds from the type. */
3380 else
3385 else
3391 {
3396 }
3398 {
3399 /* Code like
3401 int n;
3402 if (n < 100)
3403 memcpy (a, b, n)
3405 Produce anti range allowing negative values of N. We still
3406 can use the information and make a guess that N is not negative.
3407 */
3410 }
3411 }
3415 }
3417 /* Issue a warning OPT for a bounded call EXP with a bound in RANGE
3418 accessing an object with SIZE. */
3420 static bool
3423 {
3432 {
3434 {
3436 warned = (func
3438 "%K%qD specified bound %E "
3442 "%Kspecified bound %E "
3445 else
3446 warned = (func
3448 "%K%qD specified bound [%E, %E] "
3453 "%Kspecified bound [%E, %E] "
3456 }
3460 warned = (func
3462 "%K%qD specified bound %E exceeds "
3466 "%Kspecified bound %E exceeds "
3469 else
3470 warned = (func
3472 "%K%qD specified bound [%E, %E] exceeds "
3476 "%Kspecified bound [%E, %E] exceeds "
3480 {
3482 {
3489 }
3491 }
3494 }
3497 {
3499 warned = (func
3501 "%K%qD specified size %E "
3505 "%Kspecified size %E "
3508 else
3509 warned = (func
3511 "%K%qD specified size between %E and %E "
3516 "%Kspecified size between %E and %E "
3519 }
3523 warned = (func
3525 "%K%qD specified bound %E exceeds "
3529 "%Kspecified bound %E exceeds "
3532 else
3533 warned = (func
3535 "%K%qD specified bound [%E, %E] exceeds "
3539 "%Kspecified bound [%E, %E] exceeds "
3544 {
3546 {
3553 }
3555 }
3558 }
3560 /* For an expression EXP issue an access warning controlled by option OPT
3561 with access to a region SIZE bytes in size in the RANGE of sizes.
3562 WRITE is true for a write access, READ for a read access, neither for
3563 call that may or may not perform an access but for which the range
3564 is expected to valid.
3565 Returns true when a warning has been issued. */
3567 static bool
3570 {
3574 {
3576 warned = (func
3578 "%K%qD accessing %E byte in a region "
3580 "%K%qD accessing %E bytes in a region "
3584 "%Kaccessing %E byte in a region "
3586 "%Kaccessing %E bytes in a region "
3590 {
3591 /* Avoid printing the upper bound if it's invalid. */
3592 warned = (func
3594 "%K%qD accessing %E or more bytes in "
3598 "%Kaccessing %E or more bytes in "
3601 }
3602 else
3603 warned = (func
3605 "%K%qD accessing between %E and %E bytes "
3608 size)
3610 "%Kaccessing between %E and %E bytes "
3613 size));
3615 }
3618 {
3620 warned = (func
3622 "%K%qD writing %E byte into a region "
3624 "%K%qD writing %E bytes into a region "
3628 "%Kwriting %E byte into a region "
3630 "%Kwriting %E bytes into a region "
3634 {
3635 /* Avoid printing the upper bound if it's invalid. */
3636 warned = (func
3638 "%K%qD writing %E or more bytes into "
3639 "a region of size %E overflows "
3643 "%Kwriting %E or more bytes into "
3644 "a region of size %E overflows "
3647 }
3648 else
3649 warned = (func
3651 "%K%qD writing between %E and %E bytes "
3652 "into a region of size %E overflows "
3655 size)
3657 "%Kwriting between %E and %E bytes "
3658 "into a region of size %E overflows "
3661 size));
3663 }
3666 {
3668 warned = (func
3679 {
3680 /* Avoid printing the upper bound if it's invalid. */
3681 warned = (func
3683 "%K%qD reading %E or more bytes from "
3687 "%Kreading %E or more bytes from a region "
3690 }
3691 else
3692 warned = (func
3694 "%K%qD reading between %E and %E bytes from "
3698 "%K reading between %E and %E bytes from "
3706 }
3710 warned = (func
3722 {
3723 /* Avoid printing the upper bound if it's invalid. */
3724 warned = (func
3726 "%K%qD expecting %E or more bytes in a region "
3730 "%Kexpecting %E or more bytes in a region "
3733 }
3734 else
3735 warned = (func
3737 "%K%qD expecting between %E and %E bytes in "
3741 "%Kexpectting between %E and %E bytes in "
3749 }
3751 /* Issue an inform message describing the target of an access REF.
3752 WRITE is set for a write access and clear for a read access. */
3754 static void
3756 {
3760 /* Convert offset range and avoid including a zero range since it isn't
3761 necessarily meaningful. */
3765 {
3768 }
3770 /* Convert size range and always include it since all sizes are
3771 meaningful. */
3775 {
3778 }
3781 location_t loc;
3784 {
3790 /* Handle calls through pointers to functions. */
3793 /* SIZRNG doesn't necessarily have the same range as the allocation
3794 size determined by gimple_call_alloc_size (). */
3798 else
3801 }
3802 else
3806 {
3808 {
3810 {
3813 else
3816 }
3817 else
3821 }
3824 {
3828 else
3830 "at offset %lli into destination object of size %s "
3832 }
3833 else
3835 "at offset [%lli, %lli] into destination object of size %s "
3840 }
3843 {
3845 {
3848 else
3851 }
3852 else
3856 }
3859 {
3863 else
3865 "at offset %lli into source object of size %s "
3867 }
3868 else
3870 "at offset [%lli, %lli] into source object of size %s "
3873 }
3875 /* Helper to set RANGE to the range of BOUND if it's nonnull, bounded
3876 by BNDRNG if nonnull and valid. */
3878 static void
3880 {
3888 {
3889 offset_int r[] =
3895 }
3896 else
3897 {
3900 }
3901 }
3903 /* Try to verify that the sizes and lengths of the arguments to a string
3904 manipulation function given by EXP are within valid bounds and that
3905 the operation does not lead to buffer overflow or read past the end.
3906 Arguments other than EXP may be null. When non-null, the arguments
3907 have the following meaning:
3908 DST is the destination of a copy call or NULL otherwise.
3909 SRC is the source of a copy call or NULL otherwise.
3910 DSTWRITE is the number of bytes written into the destination obtained
3911 from the user-supplied size argument to the function (such as in
3912 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3913 MAXREAD is the user-supplied bound on the length of the source sequence
3914 (such as in strncat(d, s, N). It specifies the upper limit on the number
3915 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3916 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3917 expression EXP is a string function call (as opposed to a memory call
3918 like memcpy). As an exception, SRCSTR can also be an integer denoting
3919 the precomputed size of the source string or object (for functions like
3920 memcpy).
3921 DSTSIZE is the size of the destination object.
3923 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3924 SIZE_MAX.
3926 WRITE is true for write accesses, READ is true for reads. Both are
3927 false for simple size checks in calls to functions that neither read
3928 from nor write to the region.
3930 When nonnull, PAD points to a more detailed description of the access.
3932 If the call is successfully verified as safe return true, otherwise
3933 return false. */
3935 bool
3939 {
3940 /* The size of the largest object is half the address space, or
3941 PTRDIFF_MAX. (This is way too permissive.) */
3944 /* Either an approximate/minimum the length of the source string for
3945 string functions or the size of the source object for raw memory
3946 functions. */
3949 /* The range of the access in bytes; first set to the write access
3950 for functions that write and then read for those that also (or
3951 just) read. */
3954 /* Set to true when the exact number of bytes written by a string
3955 function like strcpy is not known and the only thing that is
3956 known is that it must be at least one (for the terminating nul). */
3959 {
3960 /* SRCSTR is normally a pointer to string but as a special case
3961 it can be an integer denoting the length of a string. */
3963 {
3966 /* Try to determine the range of lengths the source string
3967 refers to. If it can be determined and is less than
3968 the upper bound given by MAXREAD add one to it for
3969 the terminating nul. Otherwise, set it to one for
3970 the same reason, or to MAXREAD as appropriate. */
3971 c_strlen_data lendata = { };
3979 {
3982 else
3993 }
3994 else
3995 {
3998 }
3999 }
4000 else
4002 }
4005 {
4006 /* When the only available piece of data is the object size
4007 there is nothing to do. */
4011 /* Otherwise, when the length of the source sequence is known
4012 (as with strlen), set DSTWRITE to it. */
4015 }
4020 /* Set RANGE to that of DSTWRITE if non-null, bounded by PAD->DST.BNDRNG
4021 if valid. */
4025 /* Read vs write access by built-ins can be determined from the const
4026 qualifiers on the pointer argument. In the absence of attribute
4027 access, non-const qualified pointer arguments to user-defined
4028 functions are assumed to both read and write the objects. */
4031 /* First check the number of bytes to be written against the maximum
4032 object size. */
4036 {
4043 }
4045 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
4046 constant, and in range of unsigned HOST_WIDE_INT. */
4049 /* Next check the number of bytes to be written against the destination
4050 object size. */
4052 {
4057 || (dstwrite
4060 {
4070 {
4071 /* This is a call to strcpy with a destination of 0 size
4072 and a source of unknown length. The call will write
4073 at least one byte past the end of the destination. */
4074 warned = (func
4076 "%K%qD writing %E or more bytes into "
4077 "a region of size %E overflows "
4081 "%Kwriting %E or more bytes into "
4082 "a region of size %E overflows "
4085 }
4086 else
4087 {
4088 const bool read
4090 const bool write
4093 OPT_Wstringop_overflow_,
4096 }
4099 {
4103 }
4105 /* Return error when an overflow has been detected. */
4107 }
4108 }
4110 /* Check the maximum length of the source sequence against the size
4111 of the destination object if known, or against the maximum size
4112 of an object. */
4114 {
4115 /* Set RANGE to that of MAXREAD, bounded by PAD->SRC.BNDRNG if
4116 PAD is nonnull and BNDRNG is valid. */
4127 {
4129 {
4133 }
4136 {
4138 ? OPT_Wstringop_overflow_
4142 }
4143 }
4146 }
4148 /* Check for reading past the end of SRC. */
4151 && dstwrite
4157 {
4158 /* Set RANGE to that of MAXREAD, bounded by PAD->SRC.BNDRNG if
4159 PAD is nonnull and BNDRNG is valid. */
4161 /* Set OVERREAD for reads starting just past the end of an object. */
4165 }
4168 {
4177 const bool read
4181 {
4185 }
4187 }
4190 }
4192 /* A convenience wrapper for check_access above to check access
4193 by a read-only function like puts. */
4195 static bool
4198 {
4207 }
4209 /* If STMT is a call to an allocation function, returns the constant
4210 maximum size of the object allocated by the call represented as
4211 sizetype. If nonnull, sets RNG1[] to the range of the size.
4212 When nonnull, uses RVALS for range information, otherwise calls
4213 get_range_info to get it.
4214 Returns null when STMT is not a call to a valid allocation function. */
4216 tree
4219 {
4223 tree allocfntype;
4226 else
4235 {
4240 }
4245 {
4256 {
4260 }
4261 }
4266 /* If RNG1 is not set, use the buffer. */
4273 {
4274 /* Use the full non-negative range on failure. */
4277 }
4282 /* To handle ranges do the math in wide_int and return the product
4283 of the upper bounds as a constant. Ignore anti-ranges. */
4287 {
4288 /* As above, use the full non-negative range on failure. */
4291 }
4293 /* Extend to the maximum precision to avoid overflow. */
4299 /* Compute products of both bounds for the caller but return the lesser
4300 of SIZE_MAX and the product of the upper bounds as a constant. */
4304 {
4307 }
4310 }
4312 /* For an access to an object referenced to by the function parameter PTR
4313 of pointer type, and set RNG[] to the range of sizes of the object
4314 obtainedfrom the attribute access specification for the current function.
4315 Return the function parameter on success and null otherwise. */
4317 tree
4319 {
4320 /* For a function argument try to determine the byte size of the array
4321 from the current function declaratation (e.g., attribute access or
4322 related). */
4329 rdwr_map rdwr_idx;
4335 {
4336 /* TODO: Try to extract the range from the argument based on
4337 those of subsequent assertions or based on known calls to
4338 the current function. */
4340 }
4345 /* Only consider ordinary array bound at level 2 (or above if it's
4346 ever added). */
4352 /* If the PTR argument points to an array multiply MINSIZE by the size
4353 of array element type. Otherwise, multiply it by the size of what
4354 the pointer points to. */
4364 }
4366 /* Wrapper around the wide_int overload of get_range. Returns the same
4367 result but accepts offset_int instead. */
4369 static bool
4372 {
4380 }
4382 /* Helper to compute the size of the object referenced by the PTR
4383 expression which must have pointer type, using Object Size type
4384 OSTYPE (only the least significant 2 bits are used).
4385 On success, sets PREF->REF to the DECL of the referenced object
4386 if it's unique, otherwise to null, PREF->OFFRNG to the range of
4387 offsets into it, and PREF->SIZRNG to the range of sizes of
4388 the object(s).
4389 VISITED is used to avoid visiting the same PHI operand multiple
4390 times, and, when nonnull, RVALS to determine range information.
4391 Returns true on success, false when the size cannot be determined.
4393 The function is intended for diagnostics and should not be used
4394 to influence code generation or optimization. */
4396 static bool
4399 {
4405 {
4406 /* Bail if the reference is to the pointer itself (as opposed
4407 to what it points to). */
4418 }
4423 {
4427 {
4428 /* For raw memory functions like memcpy bail if the size
4429 of the enclosing object cannot be determined. */
4435 /* Otherwise, use the size of the enclosing object and add
4436 the offset of the member to the offset computed so far. */
4444 }
4446 /* Bail if the reference is to the pointer itself (as opposed
4447 to what it points to). */
4452 /* Only return constant sizes for now while callers depend
4453 on it. INT0LEN is true for interior zero-length arrays. */
4457 {
4460 }
4467 }
4470 {
4475 /* Avoid arrays of pointers. FIXME: Hande pointers to arrays
4476 of known bound. */
4480 {
4481 /* Give up for MEM_REFs of vector types; those may be synthesized
4482 from multiple assignments to consecutive data members. See PR
4483 93200.
4484 FIXME: Deal with this more generally, e.g., by marking up such
4485 MEM_REFs at the time they're created. */
4489 }
4497 /* Fail unless the size of the object is zero. */
4501 {
4502 /* Convert the array index range determined above to a byte
4503 offset. */
4506 {
4507 /* Adjust the index by the low bound of the array domain
4508 (normally zero but 1 in Fortran). */
4512 }
4524 {
4525 /* Execpt for the permissive raw memory functions which
4526 use the size of the whole object determined above,
4527 use the size of the referenced array. */
4530 }
4531 }
4537 }
4540 {
4543 {
4544 /* If STMT is a call to an allocation function get the size
4545 from its argument(s). If successful, also set *PDECL to
4546 PTR for the caller to include in diagnostics. */
4549 {
4554 }
4556 }
4559 {
4560 /* For a function argument try to determine the byte size
4561 of the array from the current function declaratation
4562 (e.g., attribute access or related). */
4571 }
4573 /* TODO: Handle PHI. */
4582 /* Avoid conversions from non-pointers. */
4586 {
4587 /* If the the offset in the expression can be determined use
4588 it to adjust the overall offset. Otherwise, set the overall
4589 offset to the maximum. */
4593 {
4596 }
4600 }
4605 }
4614 {
4617 }
4620 }
4622 /* A "public" wrapper around the above. Clients should use this overload
4623 instead. */
4625 tree
4628 {
4631 bool success
4641 {
4647 }
4650 {
4655 }
4661 }
4663 /* Transitional wrapper around the above. The function should be removed
4664 once callers transition to one of the two above. */
4666 tree
4669 {
4670 /* Set the initial offsets to zero and size to negative to indicate
4671 none has been computed yet. */
4672 access_ref ref;
4684 }
4686 /* Helper to determine and check the sizes of the source and the destination
4687 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
4688 call expression, DEST is the destination argument, SRC is the source
4689 argument or null, and LEN is the number of bytes. Use Object Size type-0
4690 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
4691 (no overflow or invalid sizes), false otherwise. */
4693 static bool
4695 {
4696 /* For functions like memset and memcpy that operate on raw memory
4697 try to determine the size of the largest source and destination
4698 object using type-0 Object Size regardless of the object size
4699 type specified by the option. */
4706 }
4708 /* Validate memchr arguments without performing any expansion.
4709 Return NULL_RTX. */
4711 static rtx
4713 {
4724 }
4726 /* Expand a call EXP to the memcpy builtin.
4727 Return NULL_RTX if we failed, the caller should emit a normal call,
4728 otherwise try to get the result in TARGET, if convenient (and in
4729 mode MODE if that's convenient). */
4731 static rtx
4733 {
4746 }
4748 /* Check a call EXP to the memmove built-in for validity.
4749 Return NULL_RTX on both success and failure. */
4751 static rtx
4753 {
4766 }
4768 /* Expand a call EXP to the mempcpy builtin.
4769 Return NULL_RTX if we failed; the caller should emit a normal call,
4770 otherwise try to get the result in TARGET, if convenient (and in
4771 mode MODE if that's convenient). */
4773 static rtx
4775 {
4784 /* Policy does not generally allow using compute_objsize (which
4785 is used internally by check_memop_size) to change code generation
4786 or drive optimization decisions.
4788 In this instance it is safe because the code we generate has
4789 the same semantics regardless of the return value of
4790 check_memop_sizes. Exactly the same amount of data is copied
4791 and the return value is exactly the same in both cases.
4793 Furthermore, check_memop_size always uses mode 0 for the call to
4794 compute_objsize, so the imprecise nature of compute_objsize is
4795 avoided. */
4797 /* Avoid expanding mempcpy into memcpy when the call is determined
4798 to overflow the buffer. This also prevents the same overflow
4799 from being diagnosed again when expanding memcpy. */
4805 }
4807 /* Helper function to do the actual work for expand of memory copy family
4808 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
4809 of memory from SRC to DEST and assign to TARGET if convenient. Return
4810 value is based on RETMODE argument. */
4812 static rtx
4816 {
4828 /* If DEST is not a pointer type, call the normal function. */
4832 /* If either SRC is not a pointer type, don't do this
4833 operation in-line. */
4849 /* Try to get the byte representation of the constant SRC points to,
4850 with its byte size in NBYTES. */
4854 /* If the function's constant bound LEN_RTX is less than or equal
4855 to the byte size of the representation of the constant argument,
4856 and if block move would be done by pieces, we can avoid loading
4857 the bytes from memory and only store the computed constant.
4858 This works in the overlap (memmove) case as well because
4859 store_by_pieces just generates a series of stores of constants
4860 from the representation returned by getbyterep(). */
4867 {
4869 builtin_memcpy_read_str,
4875 }
4880 /* Copy word part most expediently. */
4887 && !might_overlap
4895 might_overlap);
4897 /* Bail out when a mempcpy call would be expanded as libcall and when
4898 we have a target that provides a fast implementation
4899 of mempcpy routine. */
4907 {
4910 }
4913 {
4915 /* stpcpy pointer to last byte. */
4918 }
4921 }
4923 static rtx
4926 {
4929 }
4931 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
4932 we failed, the caller should emit a normal call, otherwise try to
4933 get the result in TARGET, if convenient.
4934 Return value is based on RETMODE argument. */
4936 static rtx
4938 {
4940 rtx dest_mem;
4941 rtx src_mem;
4949 {
4952 }
4962 {
4964 /* movstr is supposed to set end to the address of the NUL
4965 terminator. If the caller requested a mempcpy-like return value,
4966 adjust it. */
4968 {
4972 }
4973 }
4975 }
4977 /* Do some very basic size validation of a call to the strcpy builtin
4978 given by EXP. Return NULL_RTX to have the built-in expand to a call
4979 to the library function. */
4981 static rtx
4983 {
4991 /* There is no way here to determine the length of the string in
4992 the destination to which the SRC string is being appended so
4993 just diagnose cases when the souce string is longer than
4994 the destination object. */
5005 }
5007 /* Expand expression EXP, which is a call to the strcpy builtin. Return
5008 NULL_RTX if we failed the caller should emit a normal call, otherwise
5009 try to get the result in TARGET, if convenient (and in mode MODE if that's
5010 convenient). */
5012 static rtx
5014 {
5022 {
5031 }
5034 {
5035 /* Check to see if the argument was declared attribute nonstring
5036 and if so, issue a warning since at this point it's not known
5037 to be nul-terminated. */
5041 }
5044 }
5046 /* Helper function to do the actual work for expand_builtin_strcpy. The
5047 arguments to the builtin_strcpy call DEST and SRC are broken out
5048 so that this can also be called without constructing an actual CALL_EXPR.
5049 The other arguments and return value are the same as for
5050 expand_builtin_strcpy. */
5052 static rtx
5054 {
5055 /* Detect strcpy calls with unterminated arrays.. */
5056 tree size;
5059 {
5060 /* NONSTR refers to the non-nul terminated constant array. */
5064 }
5067 }
5069 /* Expand a call EXP to the stpcpy builtin.
5070 Return NULL_RTX if we failed the caller should emit a normal call,
5071 otherwise try to get the result in TARGET, if convenient (and in
5072 mode MODE if that's convenient). */
5074 static rtx
5076 {
5087 {
5093 }
5095 /* If return value is ignored, transform stpcpy into strcpy. */
5097 {
5101 }
5102 else
5103 {
5105 rtx ret;
5107 /* Ensure we get an actual string whose length can be evaluated at
5108 compile-time, not an expression containing a string. This is
5109 because the latter will potentially produce pessimized code
5110 when used to produce the return value. */
5111 c_strlen_data lendata = { };
5129 {
5133 {
5137 {
5139 {
5142 else
5144 }
5153 }
5154 }
5155 }
5159 }
5160 }
5162 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
5163 arguments while being careful to avoid duplicate warnings (which could
5164 be issued if the expander were to expand the call, resulting in it
5165 being emitted in expand_call(). */
5167 static rtx
5169 {
5171 {
5172 /* The call has been successfully expanded. Check for nonstring
5173 arguments and issue warnings as appropriate. */
5176 }
5179 }
5181 /* Check a call EXP to the stpncpy built-in for validity.
5182 Return NULL_RTX on both success and failure. */
5184 static rtx
5186 {
5192 /* The source and destination of the call. */
5196 /* The exact number of bytes to write (not the maximum). */
5199 /* The size of the destination object. */
5203 }
5205 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
5206 bytes from constant string DATA + OFFSET and return it as target
5207 constant. */
5209 rtx
5211 scalar_int_mode mode)
5212 {
5219 }
5221 /* Helper to check the sizes of sequences and the destination of calls
5222 to __builtin_strncat and __builtin___strncat_chk. Returns true on
5223 success (no overflow or invalid sizes), false otherwise. */
5225 static bool
5227 {
5232 /* Try to determine the range of lengths that the source expression
5233 refers to. */
5234 c_strlen_data lendata = { };
5237 /* Try to verify that the destination is big enough for the shortest
5238 string. */
5242 {
5243 /* If it hasn't been provided by __strncat_chk, try to determine
5244 the size of the destination object into which the source is
5245 being copied. */
5247 }
5249 /* Add one for the terminating nul. */
5252 size_one_node)
5255 /* The strncat function copies at most MAXREAD bytes and always appends
5256 the terminating nul so the specified upper bound should never be equal
5257 to (or greater than) the size of the destination. */
5260 {
5269 }
5277 /* The number of bytes to write is LEN but check_access will alsoa
5278 check SRCLEN if LEN's value isn't known. */
5281 }
5283 /* Similar to expand_builtin_strcat, do some very basic size validation
5284 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
5285 the built-in expand to a call to the library function. */
5287 static rtx
5289 {
5297 /* The upper bound on the number of bytes to write. */
5300 /* Detect unterminated source (only). */
5304 /* The length of the source sequence. */
5307 /* Try to determine the range of lengths that the source expression
5308 refers to. Since the lengths are only used for warning and not
5309 for code generation disable strict mode below. */
5312 {
5313 c_strlen_data lendata = { };
5316 }
5319 /* Try to verify that the destination is big enough for the shortest
5320 string. First try to determine the size of the destination object
5321 into which the source is being copied. */
5324 /* Add one for the terminating nul. */
5325 tree srclen = (maxlen
5327 size_one_node)
5330 /* The strncat function copies at most MAXREAD bytes and always appends
5331 the terminating nul so the specified upper bound should never be equal
5332 to (or greater than) the size of the destination. */
5335 {
5344 }
5355 }
5357 /* Expand expression EXP, which is a call to the strncpy builtin. Return
5358 NULL_RTX if we failed the caller should emit a normal call. */
5360 static rtx
5362 {
5370 /* The number of bytes to write (not the maximum). */
5373 /* The length of the source sequence. */
5377 {
5382 /* The number of bytes to write is LEN but check_access will also
5383 check SLEN if LEN's value isn't known. */
5386 }
5388 /* We must be passed a constant len and src parameter. */
5394 /* We're required to pad with trailing zeros if the requested
5395 len is greater than strlen(s2)+1. In that case try to
5396 use store_by_pieces, if it fails, punt. */
5398 {
5401 rtx dest_mem;
5405 builtin_strncpy_read_str,
5412 builtin_strncpy_read_str,
5414 RETURN_BEGIN);
5418 }
5421 }
5423 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
5424 bytes from constant string DATA + OFFSET and return it as target
5425 constant. */
5427 rtx
5429 scalar_int_mode mode)
5430 {
5437 }
5439 /* Callback routine for store_by_pieces. Return the RTL of a register
5440 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
5441 char value given in the RTL register data. For example, if mode is
5442 4 bytes wide, return the RTL for 0x01010101*data. */
5444 static rtx
5446 scalar_int_mode mode)
5447 {
5463 }
5465 /* Expand expression EXP, which is a call to the memset builtin. Return
5466 NULL_RTX if we failed the caller should emit a normal call, otherwise
5467 try to get the result in TARGET, if convenient (and in mode MODE if that's
5468 convenient). */
5470 static rtx
5472 {
5484 }
5486 /* Helper function to do the actual work for expand_builtin_memset. The
5487 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
5488 so that this can also be called without constructing an actual CALL_EXPR.
5489 The other arguments and return value are the same as for
5490 expand_builtin_memset. */
5492 static rtx
5495 {
5498 machine_mode val_mode;
5510 /* If DEST is not a pointer type, don't do this operation in-line. */
5521 /* If the LEN parameter is zero, return DEST. */
5523 {
5524 /* Evaluate and ignore VAL in case it has side-effects. */
5527 }
5529 /* Stabilize the arguments in case we fail. */
5541 {
5542 rtx val_rtx;
5547 /* Assume that we can memset by pieces if we can store
5548 * the coefficients by pieces (in the required modes).
5549 * We can't pass builtin_memset_gen_str as that emits RTL. */
5555 {
5560 }
5564 probable_max_size))
5570 }
5576 {
5583 RETURN_BEGIN);
5588 probable_max_size))
5594 }
5602 probable_max_size);
5605 {
5608 }
5612 do_libcall:
5621 else
5626 }
5628 /* Expand expression EXP, which is a call to the bzero builtin. Return
5629 NULL_RTX if we failed the caller should emit a normal call. */
5631 static rtx
5633 {
5642 /* New argument list transforming bzero(ptr x, int y) to
5643 memset(ptr x, int 0, size_t y). This is done this way
5644 so that if it isn't expanded inline, we fallback to
5645 calling bzero instead of memset. */
5653 }
5655 /* Try to expand cmpstr operation ICODE with the given operands.
5656 Return the result rtx on success, otherwise return null. */
5658 static rtx
5660 HOST_WIDE_INT align)
5661 {
5675 }
5677 /* Expand expression EXP, which is a call to the memcmp built-in function.
5678 Return NULL_RTX if we failed and the caller should emit a normal call,
5679 otherwise try to get the result in TARGET, if convenient.
5680 RESULT_EQ is true if we can relax the returned value to be either zero
5681 or nonzero, without caring about the sign. */
5683 static rtx
5685 {
5694 /* Diagnose calls where the specified length exceeds the size of either
5695 object. */
5700 /* Due to the performance benefit, always inline the calls first
5701 when result_eq is false. */
5705 {
5709 }
5717 /* If we don't have POINTER_TYPE, call the function. */
5725 /* Set MEM_SIZE as appropriate. */
5727 {
5730 }
5734 /* Try to get the byte representation of the constant ARG2 (or, only
5735 when the function's result is used for equality to zero, ARG1)
5736 points to, with its byte size in NBYTES. */
5740 {
5741 /* For equality to zero the arguments are interchangeable. */
5745 }
5747 /* If the function's constant bound LEN_RTX is less than or equal
5748 to the byte size of the representation of the constant argument,
5749 and if block move would be done by pieces, we can avoid loading
5750 the bytes from memory and only store the computed constant result. */
5762 {
5763 /* Return the value in the proper mode for this function. */
5768 {
5771 }
5774 }
5777 }
5779 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
5780 if we failed the caller should emit a normal call, otherwise try to get
5781 the result in TARGET, if convenient. */
5783 static rtx
5785 {
5796 /* Due to the performance benefit, always inline the calls first. */
5810 /* If we don't have POINTER_TYPE, call the function. */
5814 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
5821 /* Try to call cmpstrsi. */
5826 /* Try to determine at least one length and call cmpstrnsi. */
5828 {
5829 tree len;
5830 rtx arg3_rtx;
5840 /* If we don't have a constant length for the first, use the length
5841 of the second, if we know it. We don't require a constant for
5842 this case; some cost analysis could be done if both are available
5843 but neither is constant. For now, assume they're equally cheap,
5844 unless one has side effects. If both strings have constant lengths,
5845 use the smaller. */
5861 else
5864 /* If both arguments have side effects, we cannot optimize. */
5866 {
5868 result = expand_cmpstrn_or_cmpmem
5871 }
5872 }
5876 {
5877 /* Check to see if the argument was declared attribute nonstring
5878 and if so, issue a warning since at this point it's not known
5879 to be nul-terminated. */
5882 /* Return the value in the proper mode for this function. */
5890 }
5892 /* Expand the library call ourselves using a stabilized argument
5893 list to avoid re-evaluating the function's arguments twice. */
5898 }
5900 /* Expand expression EXP, which is a call to the strncmp builtin. Return
5901 NULL_RTX if we failed the caller should emit a normal call, otherwise
5902 try to get the result in TARGET, if convenient. */
5904 static rtx
5906 ATTRIBUTE_UNUSED machine_mode mode)
5907 {
5927 {
5928 /* Check to see if the argument was declared attribute nonstring
5929 and if so, issue a warning since at this point it's not known
5930 to be nul-terminated. */
5933 {
5934 /* A strncmp read is constrained not just by the bound but
5935 also by the length of the shorter string. Specifying
5936 a bound that's larger than the size of either array makes
5937 no sense and is likely a bug. When the length of neither
5938 of the two strings is known but the sizes of both of
5939 the arrays they are stored in is, issue a warning if
5940 the bound is larger than than the size of the larger
5941 of the two arrays. */
5954 {
5960 }
5967 }
5968 }
5970 /* Due to the performance benefit, always inline the calls first. */
5976 /* If c_strlen can determine an expression for one of the string
5977 lengths, and it doesn't have side effects, then emit cmpstrnsi
5978 using length MIN(strlen(string)+1, arg3). */
5983 tree len;
5995 /* If we don't have a constant length for the first, use the length
5996 of the second, if we know it. If neither string is constant length,
5997 use the given length argument. We don't require a constant for
5998 this case; some cost analysis could be done if both are available
5999 but neither is constant. For now, assume they're equally cheap,
6000 unless one has side effects. If both strings have constant lengths,
6001 use the smaller. */
6019 else
6022 /* If we are not using the given length, we must incorporate it here.
6023 The actual new length parameter will be MIN(len,arg3) in this case. */
6025 {
6028 }
6038 {
6039 /* Return the value in the proper mode for this function. */
6047 }
6049 /* Expand the library call ourselves using a stabilized argument
6050 list to avoid re-evaluating the function's arguments twice. */
6057 }
6059 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
6060 if that's convenient. */
6062 rtx
6064 {
6065 rtx val;
6068 /* Don't do __builtin_saveregs more than once in a function.
6069 Save the result of the first call and reuse it. */
6073 /* When this function is called, it means that registers must be
6074 saved on entry to this function. So we migrate the call to the
6075 first insn of this function. */
6079 /* Do whatever the machine needs done in this case. */
6087 /* Put the insns after the NOTE that starts the function. If this
6088 is inside a start_sequence, make the outer-level insn chain current, so
6089 the code is placed at the start of the function. */
6095 }
6097 /* Expand a call to __builtin_next_arg. */
6099 static rtx
6101 {
6102 /* Checking arguments is already done in fold_builtin_next_arg
6103 that must be called before this function. */
6108 }
6110 /* Make it easier for the backends by protecting the valist argument
6111 from multiple evaluations. */
6113 static tree
6115 {
6118 /* The current way of determining the type of valist is completely
6119 bogus. We should have the information on the va builtin instead. */
6124 {
6128 /* For this case, the backends will be expecting a pointer to
6129 vatype, but it's possible we've actually been given an array
6130 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
6131 So fix it. */
6133 {
6136 }
6137 }
6138 else
6139 {
6143 {
6149 }
6155 }
6158 }
6160 /* The "standard" definition of va_list is void*. */
6162 tree
6164 {
6166 }
6168 /* The "standard" abi va_list is va_list_type_node. */
6170 tree
6172 {
6174 }
6176 /* The "standard" type of va_list is va_list_type_node. */
6178 tree
6180 {
6187 {
6188 /* If va_list is an array type, the argument may have decayed
6189 to a pointer type, e.g. by being passed to another function.
6190 In that case, unwrap both types so that we can compare the
6191 underlying records. */
6194 {
6197 }
6198 }
6203 }
6205 /* The "standard" implementation of va_start: just assign `nextarg' to
6206 the variable. */
6208 void
6210 {
6213 }
6215 /* Expand EXP, a call to __builtin_va_start. */
6217 static rtx
6219 {
6220 rtx nextarg;
6221 tree valist;
6225 {
6228 }
6238 else
6242 }
6244 /* Expand EXP, a call to __builtin_va_end. */
6246 static rtx
6248 {
6251 /* Evaluate for side effects, if needed. I hate macros that don't
6252 do that. */
6257 }
6259 /* Expand EXP, a call to __builtin_va_copy. We do this as a
6260 builtin rather than just as an assignment in stdarg.h because of the
6261 nastiness of array-type va_list types. */
6263 static rtx
6265 {
6278 {
6282 }
6283 else
6284 {
6287 /* Evaluate to pointers. */
6296 /* "Dereference" to BLKmode memories. */
6304 /* Copy. */
6306 }
6309 }
6311 /* Expand a call to one of the builtin functions __builtin_frame_address or
6312 __builtin_return_address. */
6314 static rtx
6316 {
6317 /* The argument must be a nonnegative integer constant.
6318 It counts the number of frames to scan up the stack.
6319 The value is either the frame pointer value or the return
6320 address saved in that frame. */
6322 /* Warning about missing arg was already issued. */
6325 {
6328 }
6329 else
6330 {
6331 /* Number of frames to scan up the stack. */
6336 /* Some ports cannot access arbitrary stack frames. */
6338 {
6341 }
6344 {
6345 /* Warn since no effort is made to ensure that any frame
6346 beyond the current one exists or can be safely reached. */
6349 }
6351 /* For __builtin_frame_address, return what we've got. */
6359 }
6360 }
6362 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
6363 failed and the caller should emit a normal call. */
6365 static rtx
6367 {
6368 rtx op0;
6369 rtx result;
6372 HOST_WIDE_INT max_size;
6375 bool valid_arglist
6378 VOID_TYPE)
6389 || (!alloca_for_var
6392 ))
6393 {
6394 /* -Walloca-larger-than and -Wvla-larger-than settings of
6395 less than HOST_WIDE_INT_MAX override the more general
6396 -Walloc-size-larger-than so unless either of the former
6397 options is smaller than the last one (wchich would imply
6398 that the call was already checked), check the alloca
6399 arguments for overflow. */
6403 }
6405 /* Compute the argument. */
6408 /* Compute the alignment. */
6410 ? BIGGEST_ALIGNMENT
6413 /* Compute the maximum size. */
6418 /* Allocate the desired space. If the allocation stems from the declaration
6419 of a variable-sized object, it cannot accumulate. */
6420 result
6424 /* Dynamic allocations for variables are recorded during gimplification. */
6429 }
6431 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
6432 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
6433 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
6434 handle_builtin_stack_restore function. */
6436 static rtx
6438 {
6445 OPTAB_LIB_WIDEN);
6448 OPTAB_LIB_WIDEN);
6453 }
6455 /* Expand a call to bswap builtin in EXP.
6456 Return NULL_RTX if a normal call should be emitted rather than expanding the
6457 function in-line. If convenient, the result should be placed in TARGET.
6458 SUBTARGET may be used as the target for computing one of EXP's operands. */
6460 static rtx
6462 rtx subtarget)
6463 {
6464 tree arg;
6465 rtx op0;
6483 }
6485 /* Expand a call to a unary builtin in EXP.
6486 Return NULL_RTX if a normal call should be emitted rather than expanding the
6487 function in-line. If convenient, the result should be placed in TARGET.
6488 SUBTARGET may be used as the target for computing one of EXP's operands. */
6490 static rtx
6493 {
6494 rtx op0;
6499 /* Compute the argument. */
6501 (subtarget
6505 /* Compute op, into TARGET if possible.
6506 Set TARGET to wherever the result comes back. */
6512 }
6514 /* Expand a call to __builtin_expect. We just return our argument
6515 as the builtin_expect semantic should've been already executed by
6516 tree branch prediction pass. */
6518 static rtx
6520 {
6521 tree arg;
6528 /* When guessing was done, the hints should be already stripped away. */
6532 }
6534 /* Expand a call to __builtin_expect_with_probability. We just return our
6535 argument as the builtin_expect semantic should've been already executed by
6536 tree branch prediction pass. */
6538 static rtx
6540 {
6541 tree arg;
6548 /* When guessing was done, the hints should be already stripped away. */
6552 }
6555 /* Expand a call to __builtin_assume_aligned. We just return our first
6556 argument as the builtin_assume_aligned semantic should've been already
6557 executed by CCP. */
6559 static rtx
6561 {
6565 EXPAND_NORMAL);
6570 }
6572 void
6574 {
6576 {
6578 /* For trap insns when not accumulating outgoing args force
6579 REG_ARGS_SIZE note to prevent crossjumping of calls with
6580 different args sizes. */
6583 }
6584 else
6585 {
6589 }
6592 }
6594 /* Expand a call to __builtin_unreachable. We do nothing except emit
6595 a barrier saying that control flow will not pass here.
6597 It is the responsibility of the program being compiled to ensure
6598 that control flow does never reach __builtin_unreachable. */
6599 static void
6601 {
6603 }
6605 /* Expand EXP, a call to fabs, fabsf or fabsl.
6606 Return NULL_RTX if a normal call should be emitted rather than expanding
6607 the function inline. If convenient, the result should be placed
6608 in TARGET. SUBTARGET may be used as the target for computing
6609 the operand. */
6611 static rtx
6613 {
6614 machine_mode mode;
6615 tree arg;
6616 rtx op0;
6626 }
6628 /* Expand EXP, a call to copysign, copysignf, or copysignl.
6629 Return NULL is a normal call should be emitted rather than expanding the
6630 function inline. If convenient, the result should be placed in TARGET.
6631 SUBTARGET may be used as the target for computing the operand. */
6633 static rtx
6635 {
6637 tree arg;
6649 }
6651 /* Expand a call to __builtin___clear_cache. */
6653 static rtx
6655 {
6657 {
6658 #ifdef CLEAR_INSN_CACHE
6659 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
6660 does something. Just do the default expansion to a call to
6661 __clear_cache(). */
6663 #else
6664 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
6665 does nothing. There is no need to call it. Do nothing. */
6668 }
6670 /* We have a "clear_cache" insn, and it will handle everything. */
6674 /* We must not expand to a library call. If we did, any
6675 fallback library function in libgcc that might contain a call to
6676 __builtin___clear_cache() would recurse infinitely. */
6678 {
6681 }
6684 {
6697 }
6699 }
6701 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
6703 static rtx
6705 {
6708 /* If we don't need too much alignment, we'll have been guaranteed
6709 proper alignment by get_trampoline_type. */
6713 /* Round address up to desired boundary. */
6724 }
6726 static rtx
6728 {
6744 /* If ONSTACK, the TRAMP argument should be the address of a field
6745 within the local function's FRAME decl. Either way, let's see if
6746 we can fill in the MEM_ATTRs for this memory. */
6750 /* Creator of a heap trampoline is responsible for making sure the
6751 address is aligned to at least STACK_BOUNDARY. Normally malloc
6752 will ensure this anyhow. */
6755 {
6759 }
6761 /* The FUNC argument should be the address of the nested function.
6762 Extract the actual function decl to pass to the hook. */
6769 /* Generate insns to initialize the trampoline. */
6773 {
6779 }
6782 }
6784 static rtx
6786 {
6787 rtx tramp;
6798 }
6800 /* Expand a call to the builtin descriptor initialization routine.
6801 A descriptor is made up of a couple of pointers to the static
6802 chain and the code entry in this order. */
6804 static rtx
6806 {
6811 VOID_TYPE))
6826 /* Generate insns to initialize the descriptor. */
6832 }
6834 /* Expand a call to the builtin descriptor adjustment routine. */
6836 static rtx
6838 {
6839 rtx tramp;
6846 /* Unalign the descriptor to allow runtime identification. */
6851 }
6853 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
6854 function. The function first checks whether the back end provides
6855 an insn to implement signbit for the respective mode. If not, it
6856 checks whether the floating point format of the value is such that
6857 the sign bit can be extracted. If that is not the case, error out.
6858 EXP is the expression that is a call to the builtin function; if
6859 convenient, the result should be placed in TARGET. */
6860 static rtx
6862 {
6864 scalar_float_mode fmode;
6866 tree arg;
6869 rtx temp;
6882 /* Expand the argument yielding a RTX expression. */
6885 /* Check if the back end provides an insn that handles signbit for the
6886 argument's mode. */
6889 {
6895 }
6897 /* For floating point formats without a sign bit, implement signbit
6898 as "ARG < 0.0". */
6901 {
6902 /* But we can't do this if the format supports signed zero. */
6908 }
6911 {
6914 }
6915 else
6916 {
6918 /* Handle targets with different FP word orders. */
6921 else
6925 }
6927 /* Force the intermediate word_mode (or narrower) result into a
6928 register. This avoids attempting to create paradoxical SUBREGs
6929 of floating point modes below. */
6932 /* If the bitpos is within the "result mode" lowpart, the operation
6933 can be implement with a single bitwise AND. Otherwise, we need
6934 a right shift and an AND. */
6937 {
6945 }
6946 else
6947 {
6948 /* Perform a logical right shift to place the signbit in the least
6949 significant bit, then truncate the result to the desired mode
6950 and mask just this bit. */
6955 }
6958 }
6960 /* Expand fork or exec calls. TARGET is the desired target of the
6961 call. EXP is the call. FN is the
6962 identificator of the actual function. IGNORE is nonzero if the
6963 value is to be ignored. */
6965 static rtx
6967 {
6969 tree call;
6972 {
6974 /* Detect unterminated path. */
6978 /* Also detect unterminated first argument. */
6980 {
6988 }
6989 }
6992 /* If we are not profiling, just call the function. */
6996 /* Otherwise call the wrapper. This should be equivalent for the rest of
6997 compiler, so the code does not diverge, and the wrapper may run the
6998 code necessary for keeping the profiling sane. */
7001 {
7032 }
7044 }
7047 \f
7048 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
7049 the pointer in these functions is void*, the tree optimizers may remove
7050 casts. The mode computed in expand_builtin isn't reliable either, due
7051 to __sync_bool_compare_and_swap.
7053 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
7054 group of builtins. This gives us log2 of the mode size. */
7058 {
7059 /* The size is not negotiable, so ask not to get BLKmode in return
7060 if the target indicates that a smaller size would be better. */
7062 }
7064 /* Expand the memory expression LOC and return the appropriate memory operand
7065 for the builtin_sync operations. */
7067 static rtx
7069 {
7079 /* Note that we explicitly do not want any alias information for this
7080 memory, so that we kill all other live memories. Otherwise we don't
7081 satisfy the full barrier semantics of the intrinsic. */
7088 /* The alignment needs to be at least according to that of the mode. */
7095 }
7097 /* Make sure an argument is in the right mode.
7098 EXP is the tree argument.
7099 MODE is the mode it should be in. */
7101 static rtx
7103 {
7104 rtx val;
7105 machine_mode old_mode;
7109 {
7110 /* Undo argument promotion if possible, as combine might not
7111 be able to do it later due to MEM_VOLATILE_P uses in the
7112 patterns. */
7115 {
7125 }
7126 }
7129 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
7130 of CONST_INTs, where we know the old_mode only from the call argument. */
7137 }
7140 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
7141 EXP is the CALL_EXPR. CODE is the rtx code
7142 that corresponds to the arithmetic or logical operation from the name;
7143 an exception here is that NOT actually means NAND. TARGET is an optional
7144 place for us to store the results; AFTER is true if this is the
7145 fetch_and_xxx form. */
7147 static rtx
7150 rtx target)
7151 {
7156 {
7163 {
7192 }
7193 }
7195 /* Expand the operands. */
7200 after);
7201 }
7203 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
7204 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
7205 true if this is the boolean form. TARGET is a place for us to store the
7206 results; this is NOT optional if IS_BOOL is true. */
7208 static rtx
7211 {
7215 /* Expand the operands. */
7222 {
7225 else
7227 }
7230 MEMMODEL_SYNC_SEQ_CST))
7234 }
7236 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
7237 general form is actually an atomic exchange, and some targets only
7238 support a reduced form with the second argument being a constant 1.
7239 EXP is the CALL_EXPR; TARGET is an optional place for us to store
7240 the results. */
7242 static rtx
7244 rtx target)
7245 {
7248 /* Expand the operands. */
7253 }
7255 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
7257 static void
7259 {
7260 rtx mem;
7262 /* Expand the operands. */
7266 }
7268 /* Given an integer representing an ``enum memmodel'', verify its
7269 correctness and return the memory model enum. */
7271 static enum memmodel
7273 {
7274 rtx op;
7276 location_t loc
7279 /* If the parameter is not a constant, it's a run time value so we'll just
7280 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
7290 {
7294 }
7296 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
7298 {
7302 }
7304 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
7305 be conservative and promote consume to acquire. */
7310 }
7312 /* Expand the __atomic_exchange intrinsic:
7313 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
7314 EXP is the CALL_EXPR.
7315 TARGET is an optional place for us to store the results. */
7317 static rtx
7319 {
7328 /* Expand the operands. */
7333 }
7335 /* Expand the __atomic_compare_exchange intrinsic:
7336 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
7337 TYPE desired, BOOL weak,
7338 enum memmodel success,
7339 enum memmodel failure)
7340 EXP is the CALL_EXPR.
7341 TARGET is an optional place for us to store the results. */
7343 static rtx
7345 rtx target)
7346 {
7350 tree weak;
7352 location_t loc
7359 {
7361 "failure memory model cannot be stronger than success "
7364 }
7367 {
7369 "invalid failure memory model for "
7373 }
7379 /* Expand the operands. */
7395 /* Lest the rtl backend create a race condition with an imporoper store
7396 to memory, always create a new pseudo for OLDVAL. */
7403 /* Conditionally store back to EXPECT, lest we create a race condition
7404 with an improper store to memory. */
7405 /* ??? With a rearrangement of atomics at the gimple level, we can handle
7406 the normal case where EXPECT is totally private, i.e. a register. At
7407 which point the store can be unconditional. */
7415 }
7417 /* Helper function for expand_ifn_atomic_compare_exchange - expand
7418 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
7419 call. The weak parameter must be dropped to match the expected parameter
7420 list and the expected argument changed from value to pointer to memory
7421 slot. */
7423 static void
7425 {
7441 /* Skip the boolean weak parameter. */
7444 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
7447 built_in_function fncode
7452 fndecl);
7457 {
7464 }
7465 }
7467 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
7469 void
7471 {
7477 tree lhs;
7479 location_t loc
7486 {
7488 "failure memory model cannot be stronger than success "
7491 }
7494 {
7496 "invalid failure memory model for "
7500 }
7503 {
7506 }
7508 /* Expand the operands. */
7521 {
7524 }
7528 {
7534 }
7535 }
7537 /* Expand the __atomic_load intrinsic:
7538 TYPE __atomic_load (TYPE *object, enum memmodel)
7539 EXP is the CALL_EXPR.
7540 TARGET is an optional place for us to store the results. */
7542 static rtx
7544 {
7545 rtx mem;
7550 {
7551 location_t loc
7556 }
7561 /* Expand the operand. */
7565 }
7568 /* Expand the __atomic_store intrinsic:
7569 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
7570 EXP is the CALL_EXPR.
7571 TARGET is an optional place for us to store the results. */
7573 static rtx
7575 {
7582 {
7583 location_t loc
7588 }
7593 /* Expand the operands. */
7598 }
7600 /* Expand the __atomic_fetch_XXX intrinsic:
7601 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
7602 EXP is the CALL_EXPR.
7603 TARGET is an optional place for us to store the results.
7604 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
7605 FETCH_AFTER is true if returning the result of the operation.
7606 FETCH_AFTER is false if returning the value before the operation.
7607 IGNORE is true if the result is not used.
7608 EXT_CALL is the correct builtin for an external call if this cannot be
7609 resolved to an instruction sequence. */
7611 static rtx
7615 {
7618 tree fndecl;
7619 tree addr;
7623 /* Expand the operands. */
7627 /* Only try generating instructions if inlining is turned on. */
7629 {
7633 }
7635 /* Return if a different routine isn't needed for the library call. */
7639 /* Change the call to the specified function. */
7647 /* If we will emit code after the call, the call cannot be a tail call.
7648 If it is emitted as a tail call, a barrier is emitted after it, and
7649 then all trailing code is removed. */
7653 /* Expand the call here so we can emit trailing code. */
7656 /* Replace the original function just in case it matters. */
7659 /* Then issue the arithmetic correction to return the right result. */
7661 {
7663 {
7665 OPTAB_LIB_WIDEN);
7667 }
7668 else
7670 OPTAB_LIB_WIDEN);
7671 }
7673 }
7675 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
7677 void
7679 {
7687 optab optab;
7699 {
7714 }
7717 {
7724 }
7746 {
7751 }
7752 else
7754 OPTAB_DIRECT);
7757 }
7759 /* Expand an atomic clear operation.
7760 void _atomic_clear (BOOL *obj, enum memmodel)
7761 EXP is the call expression. */
7763 static rtx
7765 {
7766 machine_mode mode;
7775 {
7776 location_t loc
7781 }
7783 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
7784 Failing that, a store is issued by __atomic_store. The only way this can
7785 fail is if the bool type is larger than a word size. Unlikely, but
7786 handle it anyway for completeness. Assume a single threaded model since
7787 there is no atomic support in this case, and no barriers are required. */
7792 }
7794 /* Expand an atomic test_and_set operation.
7795 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
7796 EXP is the call expression. */
7798 static rtx
7800 {
7801 rtx mem;
7803 machine_mode mode;
7810 }
7813 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
7814 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
7816 static tree
7818 {
7820 machine_mode mode;
7826 /* We need a corresponding integer mode for the access to be lock-free. */
7834 {
7837 /* Either this argument is null, or it's a fake pointer encoding
7838 the alignment of the object. */
7844 else
7846 }
7847 else
7848 {
7851 /* This function is usually invoked and folded immediately by the front
7852 end before anything else has a chance to look at it. The pointer
7853 parameter at this point is usually cast to a void *, so check for that
7854 and look past the cast. */
7864 /* Get the underlying type of the object. */
7867 }
7869 /* If the object has smaller alignment, the lock free routines cannot
7870 be used. */
7874 /* Check if a compare_and_swap pattern exists for the mode which represents
7875 the required size. The pattern is not allowed to fail, so the existence
7876 of the pattern indicates support is present. Also require that an
7877 atomic load exists for the required size. */
7880 else
7882 }
7884 /* Return true if the parameters to call EXP represent an object which will
7885 always generate lock free instructions. The first argument represents the
7886 size of the object, and the second parameter is a pointer to the object
7887 itself. If NULL is passed for the object, then the result is based on
7888 typical alignment for an object of the specified size. Otherwise return
7889 false. */
7891 static rtx
7893 {
7894 tree size;
7899 {
7902 }
7908 }
7910 /* Return a one or zero if it can be determined that object ARG1 of size ARG
7911 is lock free on this architecture. */
7913 static tree
7915 {
7919 /* If it isn't always lock free, don't generate a result. */
7924 }
7926 /* Return true if the parameters to call EXP represent an object which will
7927 always generate lock free instructions. The first argument represents the
7928 size of the object, and the second parameter is a pointer to the object
7929 itself. If NULL is passed for the object, then the result is based on
7930 typical alignment for an object of the specified size. Otherwise return
7931 NULL*/
7933 static rtx
7935 {
7936 tree size;
7941 {
7944 }
7949 /* If the value is known at compile time, return the RTX for it. */
7955 }
7957 /* Expand the __atomic_thread_fence intrinsic:
7958 void __atomic_thread_fence (enum memmodel)
7959 EXP is the CALL_EXPR. */
7961 static void
7963 {
7966 }
7968 /* Expand the __atomic_signal_fence intrinsic:
7969 void __atomic_signal_fence (enum memmodel)
7970 EXP is the CALL_EXPR. */
7972 static void
7974 {
7977 }
7979 /* Expand the __sync_synchronize intrinsic. */
7981 static void
7983 {
7985 }
7987 static rtx
7989 {
7995 {
7997 /* If the target is not sutitable then create a new target. */
8005 }
8008 }
8010 static void
8012 {
8018 {
8025 }
8027 }
8029 \f
8030 /* Emit code to restore the current value of stack. */
8032 static void
8034 {
8046 }
8048 /* Emit code to save the current value of stack. */
8050 static rtx
8052 {
8057 }
8059 /* Emit code to get the openacc gang, worker or vector id or size. */
8061 static rtx
8063 {
8065 rtx fallback_retval;
8068 {
8081 }
8084 {
8087 }
8091 {
8094 }
8098 {
8106 }
8115 {
8118 }
8126 }
8128 /* Expand a string compare operation using a sequence of char comparison
8129 to get rid of the calling overhead, with result going to TARGET if
8130 that's convenient.
8132 VAR_STR is the variable string source;
8133 CONST_STR is the constant string source;
8134 LENGTH is the number of chars to compare;
8135 CONST_STR_N indicates which source string is the constant string;
8136 IS_MEMCMP indicates whether it's a memcmp or strcmp.
8138 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
8140 target = (int) (unsigned char) var_str[0]
8141 - (int) (unsigned char) const_str[0];
8142 if (target != 0)
8143 goto ne_label;
8144 ...
8145 target = (int) (unsigned char) var_str[length - 2]
8146 - (int) (unsigned char) const_str[length - 2];
8147 if (target != 0)
8148 goto ne_label;
8149 target = (int) (unsigned char) var_str[length - 1]
8150 - (int) (unsigned char) const_str[length - 1];
8151 ne_label:
8152 */
8154 static rtx
8158 {
8160 rtx var_rtx_array
8167 scalar_int_mode unit_mode
8173 {
8174 var_rtx
8188 }
8196 }
8198 /* Inline expansion of a call to str(n)cmp and memcmp, with result going
8199 to TARGET if that's convenient.
8200 If the call is not been inlined, return NULL_RTX. */
8202 static rtx
8204 {
8209 /* Do NOT apply this inlining expansion when optimizing for size or
8210 optimization level below 2. */
8218 /* On a target where the type of the call (int) has same or narrower presicion
8219 than unsigned char, give up the inlining expansion. */
8232 /* Get the object representation of the initializers of ARG1 and ARG2
8233 as strings, provided they refer to constant objects, with their byte
8234 sizes in LEN1 and LEN2, respectively. */
8238 /* Fail if neither argument refers to an initialized constant. */
8243 {
8244 /* Fail if the memcmp/strncmp bound is not a constant. */
8251 {
8252 /* Fail if the memcmp bound is greater than the size of either
8253 of the two constant objects. */
8257 }
8258 }
8261 {
8262 /* For string functions (i.e., strcmp and strncmp) reduce LEN1
8263 and LEN2 to the length of the nul-terminated string stored
8264 in each. */
8269 }
8271 /* See inline_string_cmp. */
8279 else
8282 /* For strncmp only, compute the new bound as the smallest of
8283 the lengths of the two strings (plus 1) and the bound provided
8284 to the function. */
8289 /* If the bound of the comparison is larger than the threshold,
8290 do nothing. */
8296 /* Now, start inline expansion the call. */
8300 }
8302 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
8303 represents the size of the first argument to that call, or VOIDmode
8304 if the argument is a pointer. IGNORE will be true if the result
8305 isn't used. */
8306 static rtx
8309 {
8316 {
8319 }
8323 /* An optional second argument can be used as a failsafe value on
8324 some machines. If it isn't present, then the failsafe value is
8325 assumed to be 0. */
8327 {
8330 }
8331 else
8334 /* If the result isn't used, the behavior is undefined. It would be
8335 nice to emit a warning here, but path splitting means this might
8336 happen with legitimate code. So simply drop the builtin
8337 expansion in that case; we've handled any side-effects above. */
8341 /* If we don't have a suitable target, create one to hold the result. */
8349 }
8351 /* Expand an expression EXP that calls a built-in function,
8352 with result going to TARGET if that's convenient
8353 (and in mode MODE if that's convenient).
8354 SUBTARGET may be used as the target for computing one of EXP's operands.
8355 IGNORE is nonzero if the value is to be ignored. */
8357 rtx
8360 {
8368 /* When ASan is enabled, we don't want to expand some memory/string
8369 builtins and rely on libsanitizer's hooks. This allows us to avoid
8370 redundant checks and be sure, that possible overflow will be detected
8371 by ASan. */
8377 /* When not optimizing, generate calls to library functions for a certain
8378 set of builtins. */
8392 /* The built-in function expanders test for target == const0_rtx
8393 to determine whether the function's result will be ignored. */
8397 /* If the result of a pure or const built-in function is ignored, and
8398 none of its arguments are volatile, we can avoid expanding the
8399 built-in call and just evaluate the arguments for side-effects. */
8403 {
8405 tree arg;
8406 call_expr_arg_iterator iter;
8410 {
8413 }
8416 {
8420 }
8421 }
8424 {
8442 /* Just do a normal library call if we were unable to fold
8443 the values. */
8520 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
8521 FUNCTION with a copy of the parameters described by
8522 ARGUMENTS, and ARGSIZE. It returns a block of memory
8523 allocated on the stack into which is stored all the registers
8524 that might possibly be used for returning the result of a
8525 function. ARGUMENTS is the value returned by
8526 __builtin_apply_args. ARGSIZE is the number of bytes of
8527 arguments that must be copied. ??? How should this value be
8528 computed? We'll also need a safe worst case value for varargs
8529 functions. */
8536 else
8537 {
8545 }
8547 /* __builtin_return (RESULT) causes the function to return the
8548 value described by RESULT. RESULT is address of the block of
8549 memory returned by __builtin_apply. */
8559 /* All valid uses of __builtin_va_arg_pack () are removed during
8560 inlining. */
8565 /* All valid uses of __builtin_va_arg_pack_len () are removed during
8566 inlining. */
8570 /* Return the address of the first anonymous stack arg. */
8592 /* Returns the address of the area where the structure is returned.
8593 0 otherwise. */
8599 else
8602 CASE_BUILT_IN_ALLOCA:
8720 {
8723 }
8792 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
8793 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
8794 when changing it to a strcmp call. */
8800 /* Change this call back to a BUILT_IN_STRCMP. */
8804 /* Delete the last parameter. */
8811 /* FALLTHROUGH */
8819 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
8820 back to a BUILT_IN_STRNCMP. */
8826 /* Change it back to a BUILT_IN_STRNCMP. */
8829 /* FALLTHROUGH */
8844 {
8847 }
8851 /* This should have been lowered to the builtins below. */
8855 /* __builtin_setjmp_setup is passed a pointer to an array of five words
8856 and the receiver label. */
8858 {
8864 /* This is copied from the handling of non-local gotos. */
8866 nonlocal_goto_handler_labels
8868 nonlocal_goto_handler_labels);
8869 /* ??? Do not let expand_label treat us as such since we would
8870 not want to be both on the list of non-local labels and on
8871 the list of forced labels. */
8874 }
8878 /* __builtin_setjmp_receiver is passed the receiver label. */
8880 {
8886 }
8889 /* __builtin_longjmp is passed a pointer to an array of five words.
8890 It's similar to the C library longjmp function but works with
8891 __builtin_setjmp above. */
8894 {
8900 {
8903 }
8907 }
8916 /* This updates the setjmp buffer that is its argument with the value
8917 of the current stack pointer. */
8920 {
8921 rtx buf_addr
8926 }
8946 /* Various hooks for the DWARF 2 __throw routine. */
8952 #ifdef DWARF2_UNWIND_INFO
8958 #endif
9160 mode = get_builtin_sync_mode
9172 mode = get_builtin_sync_mode
9219 {
9223 mode =
9229 /* If this is turned into an external library call, the weak parameter
9230 must be dropped to match the expected parameter list. */
9235 /* Skip the boolean weak parameter. */
9240 }
9269 {
9279 }
9285 {
9295 }
9301 {
9311 }
9317 {
9327 }
9333 {
9343 }
9349 {
9359 }
9496 /* Do library call, if we failed to expand the builtin when
9497 folding. */
9517 }
9519 /* The switch statement above can drop through to cause the function
9520 to be called normally. */
9522 }
9524 /* Determine whether a tree node represents a call to a built-in
9525 function. If the tree T is a call to a built-in function with
9526 the right number of arguments of the appropriate types, return
9527 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
9528 Otherwise the return value is END_BUILTINS. */
9530 enum built_in_function
9532 {
9535 const_call_expr_arg_iterator iter;
9547 {
9548 /* If a function doesn't take a variable number of arguments,
9549 the last element in the list will have type `void'. */
9552 {
9556 }
9565 {
9568 }
9570 {
9573 }
9575 {
9578 }
9580 {
9583 }
9584 else
9586 }
9588 /* Variable-length argument list. */
9590 }
9592 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
9593 evaluate to a constant. */
9595 static tree
9597 {
9598 /* We return 1 for a numeric type that's known to be a constant
9599 value at compile-time or for an aggregate type that's a
9600 literal constant. */
9603 /* If we know this is a constant, emit the constant of one. */
9609 {
9616 }
9618 /* If this expression has side effects, show we don't know it to be a
9619 constant. Likewise if it's a pointer or aggregate type since in
9620 those case we only want literals, since those are only optimized
9621 when generating RTL, not later.
9622 And finally, if we are compiling an initializer, not code, we
9623 need to return a definite result now; there's not going to be any
9624 more optimization done. */
9629 || folding_initializer
9634 }
9636 /* Create builtin_expect or builtin_expect_with_probability
9637 with PRED and EXPECTED as its arguments and return it as a truthvalue.
9638 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
9639 builtin_expect_with_probability instead uses third argument as PROBABILITY
9640 value. */
9642 static tree
9645 {
9660 else
9662 predictor);
9666 }
9668 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
9669 NULL_TREE if no simplification is possible. */
9671 tree
9673 tree arg3)
9674 {
9678 /* Distribute the expected value over short-circuiting operators.
9679 See through the cast from truthvalue_type_node to long. */
9686 /* If this is a builtin_expect within a builtin_expect keep the
9687 inner one. See through a comparison against a constant. It
9688 might have been added to create a thruthvalue. */
9704 {
9714 }
9716 /* If the argument isn't invariant then there's nothing else we can do. */
9720 /* If we expect that a comparison against the argument will fold to
9721 a constant return the constant. In practice, this means a true
9722 constant or the address of a non-weak symbol. */
9726 {
9727 do
9728 {
9730 }
9735 }
9737 /* Otherwise, ARG0 already has the proper type for the return value. */
9739 }
9741 /* Fold a call to __builtin_classify_type with argument ARG. */
9743 static tree
9745 {
9750 }
9752 /* Fold a call EXPR (which may be null) to __builtin_strlen with argument
9753 ARG. */
9755 static tree
9757 {
9760 else
9761 {
9762 c_strlen_data lendata = { };
9772 {
9778 }
9781 }
9782 }
9784 /* Fold a call to __builtin_inf or __builtin_huge_val. */
9786 static tree
9788 {
9789 REAL_VALUE_TYPE real;
9791 /* __builtin_inff is intended to be usable to define INFINITY on all
9792 targets. If an infinity is not available, INFINITY expands "to a
9793 positive constant of type float that overflows at translation
9794 time", footnote "In this case, using INFINITY will violate the
9795 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
9796 Thus we pedwarn to ensure this constraint violation is
9797 diagnosed. */
9803 }
9805 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
9806 NULL_TREE if no simplification can be made. */
9808 static tree
9811 {
9812 tree type;
9822 /* Calculate the result when the argument is a constant. */
9827 /* Canonicalize sincos to cexpi. */
9829 {
9832 }
9834 {
9841 }
9853 }
9855 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
9856 Return NULL_TREE if no simplification can be made. */
9858 static tree
9860 {
9866 /* If the LEN parameter is zero, return zero. */
9871 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
9875 /* If len parameter is one, return an expression corresponding to
9876 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
9878 {
9880 tree cst_uchar_ptr_node
9883 tree ind1
9887 cst_uchar_ptr_node,
9888 arg1)));
9889 tree ind2
9893 cst_uchar_ptr_node,
9894 arg2)));
9896 }
9899 }
9901 /* Fold a call to builtin isascii with argument ARG. */
9903 static tree
9905 {
9908 else
9909 {
9910 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
9916 }
9917 }
9919 /* Fold a call to builtin toascii with argument ARG. */
9921 static tree
9923 {
9927 /* Transform toascii(c) -> (c & 0x7f). */
9930 }
9932 /* Fold a call to builtin isdigit with argument ARG. */
9934 static tree
9936 {
9939 else
9940 {
9941 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
9942 /* According to the C standard, isdigit is unaffected by locale.
9943 However, it definitely is affected by the target character set. */
9944 unsigned HOST_WIDE_INT target_digit0
9955 }
9956 }
9958 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
9960 static tree
9962 {
9968 }
9970 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
9972 static tree
9974 {
9980 }
9982 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
9984 static tree
9986 {
9989 {
9993 {
9998 }
9999 }
10002 }
10004 /* Fold a call to builtin frexp, we can assume the base is 2. */
10006 static tree
10008 {
10019 /* Proceed if a valid pointer type was passed in. */
10021 {
10026 {
10028 /* For +-0, return (*exp = 0, +-0). */
10034 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
10037 {
10038 /* Since the frexp function always expects base 2, and in
10039 GCC normalized significands are already in the range
10040 [0.5, 1.0), we have exactly what frexp wants. */
10045 }
10049 }
10051 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
10055 }
10058 }
10060 /* Fold a call to builtin modf. */
10062 static tree
10064 {
10075 /* Proceed if a valid pointer type was passed in. */
10077 {
10082 {
10085 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
10089 /* For +-Inf, return (*arg1 = arg0, +-0). */
10095 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
10098 /* If the original number was negative and already
10099 integral, then the fractional part is -0.0. */
10103 }
10105 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
10111 }
10114 }
10116 /* Given a location LOC, an interclass builtin function decl FNDECL
10117 and its single argument ARG, return an folded expression computing
10118 the same, or NULL_TREE if we either couldn't or didn't want to fold
10119 (the latter happen if there's an RTL instruction available). */
10121 static tree
10123 {
10124 machine_mode mode;
10136 /* If there is no optab, try generic code. */
10138 {
10139 tree result;
10142 {
10143 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
10146 REAL_VALUE_TYPE r;
10150 {
10151 /* NaN and Inf are encoded in the high-order double value
10152 only. The low-order value is not significant. */
10156 }
10163 }
10166 {
10167 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
10170 REAL_VALUE_TYPE r;
10174 {
10175 /* NaN and Inf are encoded in the high-order double value
10176 only. The low-order value is not significant. */
10180 }
10186 /*result = fold_build2_loc (loc, UNGT_EXPR,
10187 TREE_TYPE (TREE_TYPE (fndecl)),
10188 fold_build1_loc (loc, ABS_EXPR, type, arg),
10189 build_real (type, r));
10190 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
10191 TREE_TYPE (TREE_TYPE (fndecl)),
10192 result);*/
10194 }
10196 {
10197 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
10198 islessequal(fabs(x),DBL_MAX). */
10208 {
10209 /* Use double to test the normal range of IBM extended
10210 precision. Emin for IBM extended precision is
10211 different to emin for IEEE double, being 53 higher
10212 since the low double exponent is at least 53 lower
10213 than the high double exponent. */
10217 }
10229 {
10230 /* Testing the high end of the range is done just using
10231 the high double, using the same test as isfinite().
10232 For the subnormal end of the range we first test the
10233 high double, then if its magnitude is equal to the
10234 limit of 0x1p-969, we test whether the low double is
10235 non-zero and opposite sign to the high double. */
10251 integer_type_node,
10257 }
10258 else
10259 {
10260 tree const isge_fn
10263 }
10267 }
10270 }
10273 }
10275 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
10276 ARG is the argument for the call. */
10278 static tree
10280 {
10287 {
10295 {
10296 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
10297 /* In a boolean context, GCC will fold the inner COND_EXPR to
10298 1. So e.g. "if (isinf_sign(x))" would be folded to just
10299 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
10307 {
10320 integer_zero_node);
10321 }
10324 }
10337 {
10340 {
10341 /* NaN and Inf are encoded in the high-order double value
10342 only. The low-order value is not significant. */
10344 }
10345 }
10351 }
10352 }
10354 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
10355 This builtin will generate code to return the appropriate floating
10356 point classification depending on the value of the floating point
10357 number passed in. The possible return values must be supplied as
10358 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
10359 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
10360 one floating point argument which is "type generic". */
10362 static tree
10364 {
10367 machine_mode mode;
10368 REAL_VALUE_TYPE r;
10371 /* Verify the required arguments in the original call. */
10391 /* fpclassify(x) ->
10392 isnan(x) ? FP_NAN :
10393 (fabs(x) == Inf ? FP_INFINITE :
10394 (fabs(x) >= DBL_MIN ? FP_NORMAL :
10395 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
10409 {
10415 }
10418 {
10421 }
10424 }
10426 /* Fold a call to an unordered comparison function such as
10427 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
10428 being called and ARG0 and ARG1 are the arguments for the call.
10429 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
10430 the opposite of the desired result. UNORDERED_CODE is used
10431 for modes that can hold NaNs and ORDERED_CODE is used for
10432 the rest. */
10434 static tree
10438 {
10452 /* Choose the wider of two real types. */
10464 {
10468 }
10473 }
10475 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
10476 arithmetics if it can never overflow, or into internal functions that
10477 return both result of arithmetics and overflowed boolean flag in
10478 a complex integer result, or some other check for overflow.
10479 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
10480 checking part of that. */
10482 static tree
10485 {
10487 /* The code of the expression corresponding to the built-in. */
10492 {
10495 /* FALLTHRU */
10508 /* FALLTHRU */
10521 /* FALLTHRU */
10534 }
10536 /* For the "generic" overloads, the first two arguments can have different
10537 types and the last argument determines the target type to use to check
10538 for overflow. The arguments of the other overloads all have the same
10539 type. */
10542 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
10543 arguments are constant, attempt to fold the built-in call into a constant
10544 expression indicating whether or not it detected an overflow. */
10548 /* Perform the computation in the target type and check for overflow. */
10552 arg2);
10556 {
10564 }
10565 else
10566 {
10574 }
10580 tree store
10583 }
10585 /* Fold a call to __builtin_FILE to a constant string. */
10589 {
10591 {
10592 /* The documentation says this builtin is equivalent to the preprocessor
10593 __FILE__ macro so it appears appropriate to use the same file prefix
10594 mappings. */
10597 }
10600 }
10602 /* Fold a call to __builtin_FUNCTION to a constant string. */
10606 {
10613 }
10615 /* Fold a call to __builtin_LINE to an integer constant. */
10619 {
10621 }
10623 /* Fold a call to built-in function FNDECL with 0 arguments.
10624 This function returns NULL_TREE if no simplification was possible. */
10626 static tree
10628 {
10632 {
10658 }
10660 }
10662 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
10663 This function returns NULL_TREE if no simplification was possible. */
10665 static tree
10667 {
10678 {
10680 {
10683 /* Gimplification will pull the CALL_EXPR for the builtin out of
10684 an if condition. When not optimizing, we'll not CSE it back.
10685 To avoid link error types of regressions, return false now. */
10690 }
10746 {
10751 }
10757 {
10762 }
10783 }
10787 }
10789 /* Folds a call EXPR (which may be null) to built-in function FNDECL
10790 with 2 arguments, ARG0 and ARG1. This function returns NULL_TREE
10791 if no simplification was possible. */
10793 static tree
10795 {
10807 {
10851 NOP_EXPR);
10853 /* We do the folding for va_start in the expander. */
10868 }
10870 }
10872 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
10873 and ARG2.
10874 This function returns NULL_TREE if no simplification was possible. */
10876 static tree
10879 {
10893 {
10942 }
10944 }
10946 /* Folds a call EXPR (which may be null) to built-in function FNDECL.
10947 ARGS is an array of NARGS arguments. IGNORE is true if the result
10948 of the function call is ignored. This function returns NULL_TREE
10949 if no simplification was possible. */
10951 static tree
10954 {
10958 {
10974 }
10976 {
10980 }
10982 }
10984 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
10985 list ARGS along with N new arguments in NEWARGS. SKIP is the number
10986 of arguments in ARGS to be omitted. OLDNARGS is the number of
10987 elements in ARGS. */
10989 static tree
10992 {
10997 {
11005 }
11006 else
11010 }
11012 /* Return true if FNDECL shouldn't be folded right now.
11013 If a built-in function has an inline attribute always_inline
11014 wrapper, defer folding it after always_inline functions have
11015 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
11016 might not be performed. */
11018 bool
11020 {
11023 && cfun
11026 }
11028 /* A wrapper function for builtin folding that prevents warnings for
11029 "statement without effect" and the like, caused by removing the
11030 call node earlier than the warning is generated. */
11032 tree
11034 {
11038 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
11039 yet. Defer folding until we see all the arguments
11040 (after inlining). */
11042 {
11045 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
11046 instead last argument is __builtin_va_arg_pack (). Defer folding
11047 even in that case, until arguments are finalized. */
11049 {
11053 }
11061 else
11062 {
11067 }
11068 }
11070 }
11072 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
11073 N arguments are passed in the array ARGARRAY. Return a folded
11074 expression or NULL_TREE if no simplification was possible. */
11076 tree
11078 tree fn,
11081 {
11088 {
11089 /* If last argument is __builtin_va_arg_pack (), arguments to this
11090 function are not finalized yet. Defer folding until they are. */
11092 {
11096 }
11101 else
11103 }
11106 }
11108 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
11109 along with N new arguments specified as the "..." parameters. SKIP
11110 is the number of arguments in EXP to be omitted. This function is used
11111 to do varargs-to-varargs transformations. */
11113 static tree
11115 {
11117 tree t;
11125 }
11127 /* Validate a single argument ARG against a tree code CODE representing
11128 a type. Return true when argument is valid. */
11130 static bool
11132 {
11140 }
11142 /* This function validates the types of a function call argument list
11143 against a specified list of tree_codes. If the last specifier is a 0,
11144 that represents an ellipses, otherwise the last specifier must be a
11145 VOID_TYPE.
11147 This is the GIMPLE version of validate_arglist. Eventually we want to
11148 completely convert builtins.c to work from GIMPLEs and the tree based
11149 validate_arglist will then be removed. */
11151 bool
11153 {
11157 const_tree arg;
11163 do
11164 {
11167 {
11169 /* This signifies an ellipses, any further arguments are all ok. */
11173 /* This signifies an endlink, if no arguments remain, return
11174 true, otherwise return false. */
11178 /* If no parameters remain or the parameter's code does not
11179 match the specified code, return false. Otherwise continue
11180 checking any remaining arguments. */
11185 }
11186 }
11189 /* We need gotos here since we can only have one VA_CLOSE in a
11190 function. */
11191 end: ;
11195 }
11197 /* Default target-specific builtin expander that does nothing. */
11199 rtx
11201 rtx target ATTRIBUTE_UNUSED,
11202 rtx subtarget ATTRIBUTE_UNUSED,
11203 machine_mode mode ATTRIBUTE_UNUSED,
11205 {
11207 }
11209 /* Returns true is EXP represents data that would potentially reside
11210 in a readonly section. */
11212 bool
11214 {
11224 /* Make sure we call decl_readonly_section only for trees it
11225 can handle (since it returns true for everything it doesn't
11226 understand). */
11231 else
11233 }
11235 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
11236 to the call, and TYPE is its return type.
11238 Return NULL_TREE if no simplification was possible, otherwise return the
11239 simplified form of the call as a tree.
11241 The simplified form may be a constant or other expression which
11242 computes the same value, but in a more efficient manner (including
11243 calls to other builtin functions).
11245 The call may contain arguments which need to be evaluated, but
11246 which are not useful to determine the result of the call. In
11247 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11248 COMPOUND_EXPR will be an argument which must be evaluated.
11249 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11250 COMPOUND_EXPR in the chain will contain the tree for the simplified
11251 form of the builtin function call. */
11253 static tree
11255 {
11260 tree fn;
11269 {
11271 tree tem;
11276 /* Return an offset into the constant string argument. */
11279 }
11282 /* strpbrk(x, "") == NULL.
11283 Evaluate and ignore s1 in case it had side-effects. */
11293 /* New argument list transforming strpbrk(s1, s2) to
11294 strchr(s1, s2[0]). */
11297 }
11299 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
11300 to the call.
11302 Return NULL_TREE if no simplification was possible, otherwise return the
11303 simplified form of the call as a tree.
11305 The simplified form may be a constant or other expression which
11306 computes the same value, but in a more efficient manner (including
11307 calls to other builtin functions).
11309 The call may contain arguments which need to be evaluated, but
11310 which are not useful to determine the result of the call. In
11311 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11312 COMPOUND_EXPR will be an argument which must be evaluated.
11313 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11314 COMPOUND_EXPR in the chain will contain the tree for the simplified
11315 form of the builtin function call. */
11317 static tree
11319 {
11330 /* If either argument is "", return NULL_TREE. */
11332 /* Evaluate and ignore both arguments in case either one has
11333 side-effects. */
11337 }
11339 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
11340 to the call.
11342 Return NULL_TREE if no simplification was possible, otherwise return the
11343 simplified form of the call as a tree.
11345 The simplified form may be a constant or other expression which
11346 computes the same value, but in a more efficient manner (including
11347 calls to other builtin functions).
11349 The call may contain arguments which need to be evaluated, but
11350 which are not useful to determine the result of the call. In
11351 this case we return a chain of COMPOUND_EXPRs. The LHS of each
11352 COMPOUND_EXPR will be an argument which must be evaluated.
11353 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
11354 COMPOUND_EXPR in the chain will contain the tree for the simplified
11355 form of the builtin function call. */
11357 static tree
11359 {
11368 /* If the first argument is "", return NULL_TREE. */
11371 {
11372 /* Evaluate and ignore argument s2 in case it has
11373 side-effects. */
11376 }
11378 /* If the second argument is "", return __builtin_strlen(s1). */
11381 {
11384 /* If the replacement _DECL isn't initialized, don't do the
11385 transformation. */
11390 }
11392 }
11394 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
11395 produced. False otherwise. This is done so that we don't output the error
11396 or warning twice or three times. */
11398 bool
11400 {
11403 tree arg;
11404 /* There is good chance the current input_location points inside the
11405 definition of the va_start macro (perhaps on the token for
11406 builtin) in a system header, so warnings will not be emitted.
11407 Use the location in real source code. */
11408 location_t current_location =
11410 NULL);
11413 {
11416 }
11419 {
11421 {
11424 }
11426 }
11427 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
11428 when we checked the arguments and if needed issued a warning. */
11429 else
11430 {
11432 {
11433 /* Evidently an out of date version of <stdarg.h>; can't validate
11434 va_start's second argument, but can still work as intended. */
11436 OPT_Wvarargs,
11439 }
11441 {
11444 }
11446 }
11451 /* We destructively modify the call to be __builtin_va_start (ap, 0)
11452 or __builtin_next_arg (0) the first time we see it, after checking
11453 the arguments and if needed issuing a warning. */
11455 {
11458 /* Strip off all nops for the sake of the comparison. This
11459 is not quite the same as STRIP_NOPS. It does more.
11460 We must also strip off INDIRECT_EXPR for C++ reference
11461 parameters. */
11466 {
11467 /* FIXME: Sometimes with the tree optimizers we can get the
11468 not the last argument even though the user used the last
11469 argument. We just warn and set the arg to be the last
11470 argument so that we will get wrong-code because of
11471 it. */
11473 OPT_Wvarargs,
11475 }
11477 /* Undefined by C99 7.15.1.4p4 (va_start):
11478 "If the parameter parmN is declared with the register storage
11479 class, with a function or array type, or with a type that is
11480 not compatible with the type that results after application of
11481 the default argument promotions, the behavior is undefined."
11482 */
11484 {
11486 OPT_Wvarargs,
11487 "undefined behavior when second parameter of "
11489 }
11491 /* We want to verify the second parameter just once before the tree
11492 optimizers are run and then avoid keeping it in the tree,
11493 as otherwise we could warn even for correct code like:
11494 void foo (int i, ...)
11495 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
11498 else
11500 }
11502 }
11505 /* Expand a call EXP to __builtin_object_size. */
11507 static rtx
11509 {
11510 tree ost;
11515 {
11520 }
11528 {
11533 }
11538 }
11540 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
11541 FCODE is the BUILT_IN_* to use.
11542 Return NULL_RTX if we failed; the caller should emit a normal call,
11543 otherwise try to get the result in TARGET, if convenient (and in
11544 mode MODE if that's convenient). */
11546 static rtx
11549 {
11551 POINTER_TYPE,
11552 fcode == BUILT_IN_MEMSET_CHK
11562 /* FIXME: Set access mode to write only for memset et al. */
11570 {
11571 /* Avoid transforming the checking call to an ordinary one when
11572 an overflow has been detected or when the call couldn't be
11573 validated because the size is not constant. */
11578 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
11579 mem{cpy,pcpy,move,set} is available. */
11581 {
11596 }
11605 }
11608 else
11609 {
11612 /* If DEST is not a pointer type, call the normal function. */
11616 /* If SRC and DEST are the same (and not volatile), do nothing. */
11618 {
11619 tree expr;
11622 {
11623 /* Evaluate and ignore LEN in case it has side-effects. */
11626 }
11630 }
11632 /* __memmove_chk special case. */
11634 {
11640 /* If src is categorized for a readonly section we can use
11641 normal __memcpy_chk. */
11643 {
11652 }
11653 }
11655 }
11656 }
11658 /* Emit warning if a buffer overflow is detected at compile time. */
11660 static void
11662 {
11663 /* The source string. */
11665 /* The size of the destination object returned by __builtin_object_size. */
11667 /* The string that is being concatenated with (as in __strcat_chk)
11668 or null if it isn't. */
11670 /* The maximum length of the source sequence in a bounded operation
11671 (such as __strncat_chk) or null if the operation isn't bounded
11672 (such as __strcat_chk). */
11674 /* The exact size of the access (such as in __strncpy_chk). */
11676 /* The access by the function that's checked. Except for snprintf
11677 both writing and reading is checked. */
11681 {
11689 /* For __strcat_chk the warning will be emitted only if overflowing
11690 by at least strlen (dest) + 1 bytes. */
11714 /* The only checked access the write to the destination. */
11719 }
11722 {
11723 /* Check __strncat_chk. There is no way to determine the length
11724 of the string to which the source string is being appended so
11725 just warn when the length of the source string is not known. */
11728 }
11731 }
11733 /* Emit warning if a buffer overflow is detected at compile time
11734 in __sprintf_chk/__vsprintf_chk calls. */
11736 static void
11738 {
11743 /* Verify the required arguments in the original call. */
11753 /* Check whether the format is a literal string constant. */
11761 /* If the format doesn't contain % args or %%, we know its size. */
11764 /* If the format is "%s" and first ... argument is a string literal,
11765 we know it too. */
11768 {
11769 tree arg;
11780 }
11781 else
11784 /* Add one for the terminating nul. */
11788 access_write_only);
11789 }
11791 /* Emit warning if a free is called with address of a variable. */
11793 static void
11795 {
11812 else
11815 }
11817 /* Fold a call to __builtin_object_size with arguments PTR and OST,
11818 if possible. */
11820 static tree
11822 {
11839 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
11840 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
11841 and (size_t) 0 for types 2 and 3. */
11846 {
11850 }
11852 {
11853 /* If object size is not known yet, delay folding until
11854 later. Maybe subsequent passes will help determining
11855 it. */
11859 }
11862 }
11864 /* Builtins with folding operations that operate on "..." arguments
11865 need special handling; we need to store the arguments in a convenient
11866 data structure before attempting any folding. Fortunately there are
11867 only a few builtins that fall into this category. FNDECL is the
11868 function, EXP is the CALL_EXPR for the call. */
11870 static tree
11872 {
11877 {
11884 }
11886 {
11891 }
11893 }
11895 /* Initialize format string characters in the target charset. */
11897 bool
11899 {
11902 {
11925 }
11927 }
11929 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
11930 and no overflow/underflow occurred. INEXACT is true if M was not
11931 exactly calculated. TYPE is the tree type for the result. This
11932 function assumes that you cleared the MPFR flags and then
11933 calculated M to see if anything subsequently set a flag prior to
11934 entering this function. Return NULL_TREE if any checks fail. */
11936 static tree
11938 {
11939 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
11940 overflow/underflow occurred. If -frounding-math, proceed iff the
11941 result of calling FUNC was exact. */
11944 {
11945 REAL_VALUE_TYPE rr;
11948 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
11949 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
11950 but the mpft_t is not, then we underflowed in the
11951 conversion. */
11954 {
11955 REAL_VALUE_TYPE rmode;
11958 /* Proceed iff the specified mode can hold the value. */
11961 }
11962 }
11964 }
11966 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
11967 number and no overflow/underflow occurred. INEXACT is true if M
11968 was not exactly calculated. TYPE is the tree type for the result.
11969 This function assumes that you cleared the MPFR flags and then
11970 calculated M to see if anything subsequently set a flag prior to
11971 entering this function. Return NULL_TREE if any checks fail, if
11972 FORCE_CONVERT is true, then bypass the checks. */
11974 static tree
11976 {
11977 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
11978 overflow/underflow occurred. If -frounding-math, proceed iff the
11979 result of calling FUNC was exact. */
11984 {
11989 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
11990 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
11991 but the mpft_t is not, then we underflowed in the
11992 conversion. */
11997 {
12002 /* Proceed iff the specified mode can hold the value. */
12008 }
12009 }
12011 }
12013 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
12014 the pointer *(ARG_QUO) and return the result. The type is taken
12015 from the type of ARG0 and is used for setting the precision of the
12016 calculation and results. */
12018 static tree
12020 {
12027 /* To proceed, MPFR must exactly represent the target floating point
12028 format, which only happens when the target base equals two. */
12032 {
12037 {
12041 tree result_rem;
12050 /* Remquo is independent of the rounding mode, so pass
12051 inexact=0 to do_mpfr_ckconv(). */
12055 {
12056 /* MPFR calculates quo in the host's long so it may
12057 return more bits in quo than the target int can hold
12058 if sizeof(host long) > sizeof(target int). This can
12059 happen even for native compilers in LP64 mode. In
12060 these cases, modulo the quo value with the largest
12061 number that the target int can hold while leaving one
12062 bit for the sign. */
12066 /* Dereference the quo pointer argument. */
12068 /* Proceed iff a valid pointer type was passed in. */
12070 {
12071 /* Set the value. */
12072 tree result_quo
12075 integer_quo));
12077 /* Combine the quo assignment with the rem. */
12080 }
12081 }
12082 }
12083 }
12085 }
12087 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
12088 resulting value as a tree with type TYPE. The mpfr precision is
12089 set to the precision of TYPE. We assume that this mpfr function
12090 returns zero if the result could be calculated exactly within the
12091 requested precision. In addition, the integer pointer represented
12092 by ARG_SG will be dereferenced and set to the appropriate signgam
12093 (-1,1) value. */
12095 static tree
12097 {
12102 /* To proceed, MPFR must exactly represent the target floating point
12103 format, which only happens when the target base equals two. Also
12104 verify ARG is a constant and that ARG_SG is an int pointer. */
12109 {
12112 /* In addition to NaN and Inf, the argument cannot be zero or a
12113 negative integer. */
12117 {
12122 mpfr_t m;
12123 tree result_lg;
12132 {
12133 tree result_sg;
12135 /* Dereference the arg_sg pointer argument. */
12137 /* Assign the signgam value into *arg_sg. */
12142 /* Combine the signgam assignment with the lgamma result. */
12145 }
12146 }
12147 }
12150 }
12152 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
12153 mpc function FUNC on it and return the resulting value as a tree
12154 with type TYPE. The mpfr precision is set to the precision of
12155 TYPE. We assume that function FUNC returns zero if the result
12156 could be calculated exactly within the requested precision. If
12157 DO_NONFINITE is true, then fold expressions containing Inf or NaN
12158 in the arguments and/or results. */
12160 tree
12163 {
12169 /* To proceed, MPFR must exactly represent the target floating point
12170 format, which only happens when the target base equals two. */
12176 {
12185 {
12206 }
12207 }
12210 }
12212 /* A wrapper function for builtin folding that prevents warnings for
12213 "statement without effect" and the like, caused by removing the
12214 call node earlier than the warning is generated. */
12216 tree
12218 {
12224 {
12233 {
12235 }
12236 else
12237 {
12240 {
12241 /* Propagate location information from original call to
12242 expansion of builtin. Otherwise things like
12243 maybe_emit_chk_warning, that operate on the expansion
12244 of a builtin, will use the wrong location information. */
12246 {
12254 }
12256 }
12257 }
12258 }
12260 }
12262 /* Look up the function in builtin_decl that corresponds to DECL
12263 and set ASMSPEC as its user assembler name. DECL must be a
12264 function decl that declares a builtin. */
12266 void
12268 {
12277 {
12281 }
12282 }
12284 /* Return true if DECL is a builtin that expands to a constant or similarly
12285 simple code. */
12286 bool
12288 {
12291 {
12292 /* Builtins that expand to constants. */
12297 /* Simple register moves or loads from stack. */
12308 /* Exception state returns or moves registers around. */
12316 }
12319 }
12321 /* Return true if DECL is a builtin that is not expensive, i.e., they are
12322 most probably expanded inline into reasonably simple code. This is a
12323 superset of is_simple_builtin. */
12324 bool
12326 {
12333 {
12335 CASE_BUILT_IN_ALLOCA:
12402 }
12405 }
12407 /* Return true if T is a constant and the value cast to a target char
12408 can be represented by a host char.
12409 Store the casted char constant in *P if so. */
12411 bool
12413 {
12419 }
12421 /* Return true if the builtin DECL is implemented in a standard library.
12422 Otherwise returns false which doesn't guarantee it is not (thus the list of
12423 handled builtins below may be incomplete). */
12425 bool
12427 {
12430 {
12504 }
12506 }