| blob | f94151bd84d8f762de63277b78d3d76597a92b09 |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2019 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. */
77 #if SWITCHABLE_TARGET
79 #endif
81 /* Define the names of the builtin function types and codes. */
85 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
87 {
89 };
91 /* Setup an array of builtin_info_type, make sure each element decl is
92 initialized to NULL_TREE. */
95 /* Non-zero if __builtin_constant_p should be folded right away. */
129 memop_ret retmode,
198 /* Return true if NAME starts with __builtin_ or __sync_. */
200 static bool
202 {
210 }
212 /* Return true if NODE should be considered for inline expansion regardless
213 of the optimization level. This means whenever a function is invoked with
214 its "internal" name, which normally contains the prefix "__builtin". */
216 bool
218 {
219 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
220 we want the name used to call the function, not the name it
221 will have. */
224 }
226 /* Compute values M and N such that M divides (address of EXP - N) and such
227 that N < M. If these numbers can be determined, store M in alignp and N in
228 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
229 *alignp and any bit-offset to *bitposp.
231 Note that the address (and thus the alignment) computed here is based
232 on the address to which a symbol resolves, whereas DECL_ALIGN is based
233 on the address at which an object is actually located. These two
234 addresses are not always the same. For example, on ARM targets,
235 the address &foo of a Thumb function foo() has the lowest bit set,
236 whereas foo() itself starts on an even address.
238 If ADDR_P is true we are taking the address of the memory reference EXP
239 and thus cannot rely on the access taking place. */
241 static bool
244 {
246 tree offset;
247 machine_mode mode;
252 /* Get the innermost object and the constant (bitpos) and possibly
253 variable (offset) offset of the access. */
257 /* Extract alignment information from the innermost object and
258 possibly adjust bitpos and offset. */
260 {
261 /* Function addresses can encode extra information besides their
262 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
263 allows the low bit to be used as a virtual bit, we know
264 that the address itself must be at least 2-byte aligned. */
267 }
269 ;
271 {
272 /* The alignment of a CONST_DECL is determined by its initializer. */
279 }
281 {
284 }
288 {
294 /* If the address is explicitely aligned, handle that. */
297 {
302 }
304 known_alignment
308 /* Re-apply explicit alignment to the bitpos. */
311 /* The alignment of the pointer operand in a TARGET_MEM_REF
312 has to take the variable offset parts into account. */
314 {
316 {
321 }
325 }
327 /* When EXP is an actual memory reference then we can use
328 TYPE_ALIGN of a pointer indirection to derive alignment.
329 Do so only if get_pointer_alignment_1 did not reveal absolute
330 alignment knowledge and if using that alignment would
331 improve the situation. */
337 else
338 {
339 /* Else adjust bitpos accordingly. */
344 }
345 }
347 {
348 /* STRING_CST are the only constant objects we allow to be not
349 wrapped inside a CONST_DECL. */
355 }
357 /* If there is a non-constant offset part extract the maximum
358 alignment that can prevail. */
360 {
363 {
367 }
368 }
370 /* Account for the alignment of runtime coefficients, so that the constant
371 bitpos is guaranteed to be accurate. */
374 {
377 }
382 }
384 /* For a memory reference expression EXP compute values M and N such that M
385 divides (&EXP - N) and such that N < M. If these numbers can be determined,
386 store M in alignp and N in *BITPOSP and return true. Otherwise return false
387 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
389 bool
392 {
394 }
396 /* Return the alignment in bits of EXP, an object. */
398 unsigned int
400 {
406 /* align and bitpos now specify known low bits of the pointer.
407 ptr & (align - 1) == bitpos. */
412 }
414 /* For a pointer valued expression EXP compute values M and N such that M
415 divides (EXP - N) and such that N < M. If these numbers can be determined,
416 store M in alignp and N in *BITPOSP and return true. Return false if
417 the results are just a conservative approximation.
419 If EXP is not a pointer, false is returned too. */
421 bool
424 {
431 {
438 else
439 {
442 {
446 }
447 }
451 }
454 {
459 {
462 /* Make sure to return a sensible alignment when the multiplication
463 by BITS_PER_UNIT overflowed. */
466 /* We cannot really tell whether this result is an approximation. */
468 }
469 else
470 {
474 }
475 }
477 {
482 }
487 }
489 /* Return the alignment in bits of EXP, a pointer valued expression.
490 The alignment returned is, by default, the alignment of the thing that
491 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
493 Otherwise, look at the expression to see if we can do better, i.e., if the
494 expression is actually pointing at an object whose alignment is tighter. */
496 unsigned int
498 {
504 /* align and bitpos now specify known low bits of the pointer.
505 ptr & (align - 1) == bitpos. */
511 }
513 /* Return the number of leading non-zero elements in the sequence
514 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
515 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
517 unsigned
519 {
525 {
526 /* Optimize the common case of plain char. */
528 {
532 }
533 }
534 else
535 {
537 {
541 }
542 }
544 }
546 /* For a call at LOC to a function FN that expects a string in the argument
547 ARG, issue a diagnostic due to it being a called with an argument
548 declared at NONSTR that is a character array with no terminating NUL. */
550 void
552 {
560 {
564 }
565 }
567 /* If EXP refers to an unterminated constant character array return
568 the declaration of the object of which the array is a member or
569 element and if SIZE is not null, set *SIZE to the size of
570 the unterminated array and set *EXACT if the size is exact or
571 clear it otherwise. Otherwise return null. */
573 tree
575 {
576 /* C_STRLEN will return NULL and set DECL in the info
577 structure if EXP references a unterminated array. */
578 c_strlen_data lendata = { };
581 {
583 {
586 {
587 /* Constant offsets are already accounted for in LENDATA.MINLEN,
588 but not in a SSA_NAME + CST expression. */
593 {
594 /* Subtract the offset from the size of the array. */
599 }
600 else
602 }
603 else
607 }
609 }
612 }
614 /* Compute the length of a null-terminated character string or wide
615 character string handling character sizes of 1, 2, and 4 bytes.
616 TREE_STRING_LENGTH is not the right way because it evaluates to
617 the size of the character array in bytes (as opposed to characters)
618 and because it can contain a zero byte in the middle.
620 ONLY_VALUE should be nonzero if the result is not going to be emitted
621 into the instruction stream and zero if it is going to be expanded.
622 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
623 is returned, otherwise NULL, since
624 len = c_strlen (ARG, 1); if (len) expand_expr (len, ...); would not
625 evaluate the side-effects.
627 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
628 accesses. Note that this implies the result is not going to be emitted
629 into the instruction stream.
631 Additional information about the string accessed may be recorded
632 in DATA. For example, if ARG references an unterminated string,
633 then the declaration will be stored in the DECL field. If the
634 length of the unterminated string can be determined, it'll be
635 stored in the LEN field. Note this length could well be different
636 than what a C strlen call would return.
638 ELTSIZE is 1 for normal single byte character strings, and 2 or
639 4 for wide characer strings. ELTSIZE is by default 1.
641 The value returned is of type `ssizetype'. */
643 tree
645 {
646 /* If we were not passed a DATA pointer, then get one to a local
647 structure. That avoids having to check DATA for NULL before
648 each time we want to use it. */
649 c_strlen_data local_strlen_data = { };
658 {
665 }
673 /* Offset from the beginning of the string in bytes. */
674 tree byteoff;
675 tree memsize;
676 tree decl;
681 /* Determine the size of the string element. */
685 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
686 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
687 in case the latter is less than the size of the array, such as when
688 SRC refers to a short string literal used to initialize a large array.
689 In that case, the elements of the array after the terminating NUL are
690 all NUL. */
699 /* PTR can point to the byte representation of any string type, including
700 char* and wchar_t*. */
704 {
705 /* The code below works only for single byte character types. */
709 /* If the string has an internal NUL character followed by any
710 non-NUL characters (e.g., "foo\0bar"), we can't compute
711 the offset to the following NUL if we don't know where to
712 start searching for it. */
715 /* Return when an embedded null character is found or none at all.
716 In the latter case, set the DECL/LEN field in the DATA structure
717 so that callers may examine them. */
721 {
726 }
728 /* For empty strings the result should be zero. */
732 /* We don't know the starting offset, but we do know that the string
733 has no internal zero bytes. If the offset falls within the bounds
734 of the string subtract the offset from the length of the string,
735 and return that. Otherwise the length is zero. Take care to
736 use SAVE_EXPR in case the OFFSET has side-effects. */
743 offsave);
747 }
749 /* Offset from the beginning of the string in elements. */
750 HOST_WIDE_INT eltoff;
752 /* We have a known offset into the string. Start searching there for
753 a null character if we can represent it as a single HOST_WIDE_INT. */
758 else
761 /* If the offset is known to be out of bounds, warn, and call strlen at
762 runtime. */
764 {
765 /* Suppress multiple warnings for propagated constant strings. */
770 eltoff))
771 {
775 }
777 }
779 /* If eltoff is larger than strelts but less than maxelts the
780 string length is zero, since the excess memory will be zero. */
784 /* Use strlen to search for the first zero byte. Since any strings
785 constructed with build_string will have nulls appended, we win even
786 if we get handed something like (char[4])"abcd".
788 Since ELTOFF is our starting index into the string, no further
789 calculation is needed. */
793 /* Don't know what to return if there was no zero termination.
794 Ideally this would turn into a gcc_checking_assert over time.
795 Set DECL/LEN so callers can examine them. */
797 {
802 }
805 }
807 /* Return a constant integer corresponding to target reading
808 GET_MODE_BITSIZE (MODE) bits from string constant STR. If
809 NULL_TERMINATED_P, reading stops after '\0' character, all further ones
810 are assumed to be zero, otherwise it reads as many characters
811 as needed. */
813 rtx
816 {
817 HOST_WIDE_INT ch;
831 {
843 }
847 }
849 /* Cast a target constant CST to target CHAR and if that value fits into
850 host char type, return zero and put that value into variable pointed to by
851 P. */
853 static int
855 {
862 /* Do not care if it fits or not right here. */
877 }
879 /* Similar to save_expr, but assumes that arbitrary code is not executed
880 in between the multiple evaluations. In particular, we assume that a
881 non-addressable local variable will not be modified. */
883 static tree
885 {
893 }
895 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
896 times to get the address of either a higher stack frame, or a return
897 address located within it (depending on FNDECL_CODE). */
899 static rtx
901 {
905 {
906 /* For a zero count with __builtin_return_address, we don't care what
907 frame address we return, because target-specific definitions will
908 override us. Therefore frame pointer elimination is OK, and using
909 the soft frame pointer is OK.
911 For a nonzero count, or a zero count with __builtin_frame_address,
912 we require a stable offset from the current frame pointer to the
913 previous one, so we must use the hard frame pointer, and
914 we must disable frame pointer elimination. */
917 else
918 {
921 /* Tell reload not to eliminate the frame pointer. */
923 }
924 }
929 /* On the SPARC, the return address is not in the frame, it is in a
930 register. There is no way to access it off of the current frame
931 pointer, but it can be accessed off the previous frame pointer by
932 reading the value from the register window save area. */
934 count--;
936 /* Scan back COUNT frames to the specified frame. */
938 {
939 /* Assume the dynamic chain pointer is in the word that the
940 frame address points to, unless otherwise specified. */
945 }
947 /* For __builtin_frame_address, return what we've got. But, on
948 the SPARC for example, we may have to add a bias. */
952 /* For __builtin_return_address, get the return address from that frame. */
953 #ifdef RETURN_ADDR_RTX
955 #else
959 #endif
961 }
963 /* Alias set used for setjmp buffer. */
966 /* Construct the leading half of a __builtin_setjmp call. Control will
967 return to RECEIVER_LABEL. This is also called directly by the SJLJ
968 exception handling code. */
970 void
972 {
974 rtx stack_save;
975 rtx mem;
984 /* We store the frame pointer and the address of receiver_label in
985 the buffer and use the rest of it for the stack save area, which
986 is machine-dependent. */
1005 /* If there is further processing to do, do it. */
1009 /* We have a nonlocal label. */
1011 }
1013 /* Construct the trailing part of a __builtin_setjmp call. This is
1014 also called directly by the SJLJ exception handling code.
1015 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
1017 void
1019 {
1020 rtx chain;
1022 /* Mark the FP as used when we get here, so we have to make sure it's
1023 marked as used by this function. */
1026 /* Mark the static chain as clobbered here so life information
1027 doesn't get messed up for it. */
1033 {
1034 /* If the argument pointer can be eliminated in favor of the
1035 frame pointer, we don't need to restore it. We assume here
1036 that if such an elimination is present, it can always be used.
1037 This is the case on all known machines; if we don't make this
1038 assumption, we do unnecessary saving on many machines. */
1048 {
1049 /* Now restore our arg pointer from the address at which it
1050 was saved in our stack frame. */
1053 }
1054 }
1060 else
1063 /* We must not allow the code we just generated to be reordered by
1064 scheduling. Specifically, the update of the frame pointer must
1065 happen immediately, not later. */
1067 }
1069 /* __builtin_longjmp is passed a pointer to an array of five words (not
1070 all will be used on all machines). It operates similarly to the C
1071 library function of the same name, but is more efficient. Much of
1072 the code below is copied from the handling of non-local gotos. */
1074 static void
1076 {
1081 /* DRAP is needed for stack realign if longjmp is expanded to current
1082 function */
1093 /* We require that the user must pass a second argument of 1, because
1094 that is what builtin_setjmp will return. */
1100 else
1101 {
1112 /* Pick up FP, label, and SP from the block and jump. This code is
1113 from expand_goto in stmt.c; see there for detailed comments. */
1115 /* We have to pass a value to the nonlocal_goto pattern that will
1116 get copied into the static_chain pointer, but it does not matter
1117 what that value is, because builtin_setjmp does not use it. */
1119 else
1120 {
1126 /* Restore the frame pointer and stack pointer. We must use a
1127 temporary since the setjmp buffer may be a local. */
1131 /* Ensure the frame pointer move is not optimized. */
1140 }
1141 }
1143 /* Search backwards and mark the jump insn as a non-local goto.
1144 Note that this precludes the use of __builtin_longjmp to a
1145 __builtin_setjmp target in the same function. However, we've
1146 already cautioned the user that these functions are for
1147 internal exception handling use only. */
1149 {
1153 {
1156 }
1159 }
1160 }
1164 {
1166 }
1168 /* This function validates the types of a function call argument list
1169 against a specified list of tree_codes. If the last specifier is a 0,
1170 that represents an ellipsis, otherwise the last specifier must be a
1171 VOID_TYPE. */
1173 static bool
1175 {
1179 const_call_expr_arg_iterator iter;
1180 const_tree arg;
1185 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1190 {
1194 {
1196 /* This signifies an ellipses, any further arguments are all ok. */
1200 /* This signifies an endlink, if no arguments remain, return
1201 true, otherwise return false. */
1205 /* The actual argument must be nonnull when either the whole
1206 called function has been declared nonnull, or when the formal
1207 argument corresponding to the actual argument has been. */
1210 {
1215 }
1216 /* FALLTHRU */
1218 /* If no parameters remain or the parameter's code does not
1219 match the specified code, return false. Otherwise continue
1220 checking any remaining arguments. */
1225 }
1226 }
1228 /* We need gotos here since we can only have one VA_CLOSE in a
1229 function. */
1230 end: ;
1236 }
1238 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1239 and the address of the save area. */
1241 static rtx
1243 {
1258 /* Copy the address of the save location to a register just in case it was
1259 based on the frame pointer. */
1268 /* ??? We no longer need to pass the static chain value, afaik. */
1271 else
1272 {
1278 /* Restore the frame pointer and stack pointer. We must use a
1279 temporary since the setjmp buffer may be a local. */
1283 /* Ensure the frame pointer move is not optimized. */
1289 /* USE of hard_frame_pointer_rtx added for consistency;
1290 not clear if really needed. */
1294 /* If the architecture is using a GP register, we must
1295 conservatively assume that the target function makes use of it.
1296 The prologue of functions with nonlocal gotos must therefore
1297 initialize the GP register to the appropriate value, and we
1298 must then make sure that this value is live at the point
1299 of the jump. (Note that this doesn't necessarily apply
1300 to targets with a nonlocal_goto pattern; they are free
1301 to implement it in their own way. Note also that this is
1302 a no-op if the GP register is a global invariant.) */
1308 }
1310 /* Search backwards to the jump insn and mark it as a
1311 non-local goto. */
1313 {
1315 {
1318 }
1321 }
1324 }
1326 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1327 (not all will be used on all machines) that was passed to __builtin_setjmp.
1328 It updates the stack pointer in that block to the current value. This is
1329 also called directly by the SJLJ exception handling code. */
1331 void
1333 {
1336 rtx stack_save
1338 memory_address
1344 }
1346 /* Expand a call to __builtin_prefetch. For a target that does not support
1347 data prefetch, evaluate the memory address argument in case it has side
1348 effects. */
1350 static void
1352 {
1362 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1363 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1364 locality). */
1368 else
1372 else
1375 /* Argument 0 is an address. */
1378 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1380 {
1383 }
1385 /* Argument 1 must be either zero or one. */
1387 {
1391 }
1393 /* Argument 2 (locality) must be a compile-time constant int. */
1395 {
1398 }
1400 /* Argument 2 must be 0, 1, 2, or 3. */
1402 {
1405 }
1408 {
1416 }
1418 /* Don't do anything with direct references to volatile memory, but
1419 generate code to handle other side effects. */
1422 }
1424 /* Get a MEM rtx for expression EXP which is the address of an operand
1425 to be used in a string instruction (cmpstrsi, cpymemsi, ..). LEN is
1426 the maximum length of the block of memory that might be accessed or
1427 NULL if unknown. */
1429 static rtx
1431 {
1435 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1436 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1443 /* Get an expression we can use to find the attributes to assign to MEM.
1444 First remove any nops. */
1449 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1450 (as builtin stringops may alias with anything). */
1457 /* If the MEM_REF has no acceptable address, try to get the base object
1458 from the original address we got, and build an all-aliasing
1459 unknown-sized access to that one. */
1465 {
1470 size_zero_node,
1471 NULL)),
1474 }
1477 }
1478 \f
1479 /* Built-in functions to perform an untyped call and return. */
1481 #define apply_args_mode \
1482 (this_target_builtins->x_apply_args_mode)
1483 #define apply_result_mode \
1484 (this_target_builtins->x_apply_result_mode)
1486 /* Return the size required for the block returned by __builtin_apply_args,
1487 and initialize apply_args_mode. */
1489 static int
1491 {
1496 /* The values computed by this function never change. */
1498 {
1499 /* The first value is the incoming arg-pointer. */
1502 /* The second value is the structure value address unless this is
1503 passed as an "invisible" first argument. */
1509 {
1519 }
1520 else
1521 {
1523 }
1524 }
1526 }
1528 /* Return the size required for the block returned by __builtin_apply,
1529 and initialize apply_result_mode. */
1531 static int
1533 {
1537 /* The values computed by this function never change. */
1539 {
1544 {
1554 }
1555 else
1558 /* Allow targets that use untyped_call and untyped_return to override
1559 the size so that machine-specific information can be stored here. */
1560 #ifdef APPLY_RESULT_SIZE
1562 #endif
1563 }
1565 }
1567 /* Create a vector describing the result block RESULT. If SAVEP is true,
1568 the result block is used to save the values; otherwise it is used to
1569 restore the values. */
1571 static rtx
1573 {
1575 fixed_size_mode mode;
1582 {
1592 }
1594 }
1596 /* Save the state required to perform an untyped call with the same
1597 arguments as were passed to the current function. */
1599 static rtx
1601 {
1604 fixed_size_mode mode;
1605 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1607 /* Create a block where the arg-pointer, structure value address,
1608 and argument registers can be saved. */
1611 /* Walk past the arg-pointer and structure value address. */
1616 /* Save each register used in calling a function to the block. */
1619 {
1628 }
1630 /* Save the arg pointer to the block. */
1632 /* We need the pointer as the caller actually passed them to us, not
1633 as we might have pretended they were passed. Make sure it's a valid
1634 operand, as emit_move_insn isn't expected to handle a PLUS. */
1636 tem
1639 NULL_RTX);
1644 /* Save the structure value address unless this is passed as an
1645 "invisible" first argument. */
1650 /* Return the address of the block. */
1652 }
1654 /* __builtin_apply_args returns block of memory allocated on
1655 the stack into which is stored the arg pointer, structure
1656 value address, static chain, and all the registers that might
1657 possibly be used in performing a function call. The code is
1658 moved to the start of the function so the incoming values are
1659 saved. */
1661 static rtx
1663 {
1664 /* Don't do __builtin_apply_args more than once in a function.
1665 Save the result of the first call and reuse it. */
1668 {
1669 /* When this function is called, it means that registers must be
1670 saved on entry to this function. So we migrate the
1671 call to the first insn of this function. */
1672 rtx temp;
1681 /* Put the insns after the NOTE that starts the function.
1682 If this is inside a start_sequence, make the outer-level insn
1683 chain current, so the code is placed at the start of the
1684 function. If internal_arg_pointer is a non-virtual pseudo,
1685 it needs to be placed after the function that initializes
1686 that pseudo. */
1691 else
1695 }
1696 }
1698 /* Perform an untyped call and save the state required to perform an
1699 untyped return of whatever value was returned by the given function. */
1701 static rtx
1703 {
1705 fixed_size_mode mode;
1714 /* Create a block where the return registers can be saved. */
1717 /* Fetch the arg pointer from the ARGUMENTS block. */
1724 /* Push a new argument block and copy the arguments. Do not allow
1725 the (potential) memcpy call below to interfere with our stack
1726 manipulations. */
1728 NO_DEFER_POP;
1730 /* Save the stack with nonlocal if available. */
1733 else
1736 /* Allocate a block of memory onto the stack and copy the memory
1737 arguments to the outgoing arguments address. We can pass TRUE
1738 as the 4th argument because we just saved the stack pointer
1739 and will restore it right after the call. */
1742 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1743 may have already set current_function_calls_alloca to true.
1744 current_function_calls_alloca won't be set if argsize is zero,
1745 so we have to guarantee need_drap is true here. */
1751 {
1754 else
1756 }
1763 /* Refer to the argument block. */
1768 /* Walk past the arg-pointer and structure value address. */
1773 /* Restore each of the registers previously saved. Make USE insns
1774 for each of these registers for use in making the call. */
1777 {
1785 }
1787 /* Restore the structure value address unless this is passed as an
1788 "invisible" first argument. */
1791 {
1797 }
1799 /* All arguments and registers used for the call are set up by now! */
1802 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1803 and we don't want to load it into a register as an optimization,
1804 because prepare_call_address already did it if it should be done. */
1808 /* Generate the actual call instruction and save the return value. */
1810 {
1814 }
1816 {
1819 /* Locate the unique return register. It is not possible to
1820 express a call that sets more than one return register using
1821 call_value; use untyped_call for that. In fact, untyped_call
1822 only needs to save the return registers in the given block. */
1825 {
1829 }
1836 }
1837 else
1840 /* Find the CALL insn we just emitted, and attach the register usage
1841 information. */
1845 /* Restore the stack. */
1848 else
1852 OK_DEFER_POP;
1854 /* Return the address of the result block. */
1857 }
1859 /* Perform an untyped return. */
1861 static void
1863 {
1865 fixed_size_mode mode;
1866 rtx reg;
1875 {
1880 }
1882 /* Restore the return value and note that each value is used. */
1886 {
1898 }
1900 /* Put the USE insns before the return. */
1903 /* Return whatever values was restored by jumping directly to the end
1904 of the function. */
1906 }
1908 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1910 static enum type_class
1912 {
1914 {
1933 }
1934 }
1936 /* Expand a call EXP to __builtin_classify_type. */
1938 static rtx
1940 {
1944 }
1946 /* This helper macro, meant to be used in mathfn_built_in below, determines
1947 which among a set of builtin math functions is appropriate for a given type
1948 mode. The `F' (float) and `L' (long double) are automatically generated
1949 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1950 types, there are additional types that are considered with 'F32', 'F64',
1951 'F128', etc. suffixes. */
1952 #define CASE_MATHFN(MATHFN) \
1953 CASE_CFN_##MATHFN: \
1954 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1955 fcodel = BUILT_IN_##MATHFN##L ; break;
1956 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1957 types. */
1958 #define CASE_MATHFN_FLOATN(MATHFN) \
1959 CASE_CFN_##MATHFN: \
1960 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1961 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1962 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1963 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1964 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1965 break;
1966 /* Similar to above, but appends _R after any F/L suffix. */
1967 #define CASE_MATHFN_REENT(MATHFN) \
1968 case CFN_BUILT_IN_##MATHFN##_R: \
1969 case CFN_BUILT_IN_##MATHFN##F_R: \
1970 case CFN_BUILT_IN_##MATHFN##L_R: \
1971 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1972 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1974 /* Return a function equivalent to FN but operating on floating-point
1975 values of type TYPE, or END_BUILTINS if no such function exists.
1976 This is purely an operation on function codes; it does not guarantee
1977 that the target actually has an implementation of the function. */
1979 static built_in_function
1981 {
1982 tree mtype;
1993 {
2085 }
2108 else
2110 }
2112 /* Return mathematic function equivalent to FN but operating directly on TYPE,
2113 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2114 otherwise use the explicit declaration. If we can't do the conversion,
2115 return null. */
2117 static tree
2119 {
2128 }
2130 /* Like mathfn_built_in_1, but always use the implicit array. */
2132 tree
2134 {
2136 }
2138 /* Like mathfn_built_in_1, but take a built_in_function and
2139 always use the implicit array. */
2141 tree
2143 {
2145 }
2147 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2148 return its code, otherwise return IFN_LAST. Note that this function
2149 only tests whether the function is defined in internals.def, not whether
2150 it is actually available on the target. */
2152 internal_fn
2154 {
2158 {
2159 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2160 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2161 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2162 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2163 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2164 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2165 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2182 }
2183 }
2185 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2186 on the current target by a call to an internal function, return the
2187 code of that internal function, otherwise return IFN_LAST. The caller
2188 is responsible for ensuring that any side-effects of the built-in
2189 call are dealt with correctly. E.g. if CALL sets errno, the caller
2190 must decide that the errno result isn't needed or make it available
2191 in some other way. */
2193 internal_fn
2195 {
2197 {
2200 {
2205 }
2206 }
2208 }
2210 /* Expand a call to the builtin trinary math functions (fma).
2211 Return NULL_RTX if a normal call should be emitted rather than expanding the
2212 function in-line. EXP is the expression that is a call to the builtin
2213 function; if convenient, the result should be placed in TARGET.
2214 SUBTARGET may be used as the target for computing one of EXP's
2215 operands. */
2217 static rtx
2219 {
2220 optab builtin_optab;
2225 machine_mode mode;
2235 {
2241 }
2243 /* Make a suitable register to place result in. */
2246 /* Before working hard, check whether the instruction is available. */
2252 /* Always stabilize the argument list. */
2263 /* Compute into RESULT.
2264 Set RESULT to wherever the result comes back. */
2268 /* If we were unable to expand via the builtin, stop the sequence
2269 (without outputting the insns) and call to the library function
2270 with the stabilized argument list. */
2272 {
2275 }
2277 /* Output the entire sequence. */
2283 }
2285 /* Expand a call to the builtin sin and cos math functions.
2286 Return NULL_RTX if a normal call should be emitted rather than expanding the
2287 function in-line. EXP is the expression that is a call to the builtin
2288 function; if convenient, the result should be placed in TARGET.
2289 SUBTARGET may be used as the target for computing one of EXP's
2290 operands. */
2292 static rtx
2294 {
2295 optab builtin_optab;
2296 rtx op0;
2299 machine_mode mode;
2300 tree arg;
2308 {
2314 }
2316 /* Make a suitable register to place result in. */
2319 /* Check if sincos insn is available, otherwise fallback
2320 to sin or cos insn. */
2323 {
2330 }
2332 /* Before working hard, check whether the instruction is available. */
2334 {
2337 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2338 need to expand the argument again. This way, we will not perform
2339 side-effects more the once. */
2346 /* Compute into RESULT.
2347 Set RESULT to wherever the result comes back. */
2349 {
2353 {
2362 }
2364 }
2365 else
2369 {
2370 /* Output the entire sequence. */
2375 }
2377 /* If we were unable to expand via the builtin, stop the sequence
2378 (without outputting the insns) and call to the library function
2379 with the stabilized argument list. */
2381 }
2384 }
2386 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2387 return an RTL instruction code that implements the functionality.
2388 If that isn't possible or available return CODE_FOR_nothing. */
2390 static enum insn_code
2392 {
2395 machine_mode mode;
2398 {
2412 /* These builtins have no optabs (yet). */
2416 }
2418 /* There's no easy way to detect the case we need to set EDOM. */
2422 /* Optab mode depends on the mode of the input argument. */
2428 }
2430 /* Expand a call to one of the builtin math functions that operate on
2431 floating point argument and output an integer result (ilogb, isinf,
2432 isnan, etc).
2433 Return 0 if a normal call should be emitted rather than expanding the
2434 function in-line. EXP is the expression that is a call to the builtin
2435 function; if convenient, the result should be placed in TARGET. */
2437 static rtx
2439 {
2441 rtx op0;
2443 machine_mode mode;
2444 tree arg;
2454 {
2459 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2460 need to expand the argument again. This way, we will not perform
2461 side-effects more the once. */
2476 }
2479 }
2481 /* Expand a call to the builtin sincos math function.
2482 Return NULL_RTX if a normal call should be emitted rather than expanding the
2483 function in-line. EXP is the expression that is a call to the builtin
2484 function. */
2486 static rtx
2488 {
2490 machine_mode mode;
2504 /* Make a suitable register to place result in. */
2507 /* Check if sincos insn is available, otherwise emit the call. */
2522 /* Compute into target1 and target2.
2523 Set TARGET to wherever the result comes back. */
2527 /* Move target1 and target2 to the memory locations indicated
2528 by op1 and op2. */
2533 }
2535 /* Expand a call to the internal cexpi builtin to the sincos math function.
2536 EXP is the expression that is a call to the builtin function; if convenient,
2537 the result should be placed in TARGET. */
2539 static rtx
2541 {
2544 machine_mode mode;
2555 /* Try expanding via a sincos optab, fall back to emitting a libcall
2556 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2557 is only generated from sincos, cexp or if we have either of them. */
2559 {
2565 /* Compute into op1 and op2. */
2567 }
2569 {
2580 else
2590 /* Make sure not to fold the sincos call again. */
2594 }
2595 else
2596 {
2606 else
2609 /* If we don't have a decl for cexp create one. This is the
2610 friendliest fallback if the user calls __builtin_cexpi
2611 without full target C99 function support. */
2613 {
2614 tree fntype;
2626 }
2631 /* Make sure not to fold the cexp call again. */
2635 }
2637 /* Now build the proper return type. */
2642 }
2644 /* Conveniently construct a function call expression. FNDECL names the
2645 function to be called, N is the number of arguments, and the "..."
2646 parameters are the argument expressions. Unlike build_call_exr
2647 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2649 static tree
2651 {
2661 }
2663 /* Expand a call to one of the builtin rounding functions gcc defines
2664 as an extension (lfloor and lceil). As these are gcc extensions we
2665 do not need to worry about setting errno to EDOM.
2666 If expanding via optab fails, lower expression to (int)(floor(x)).
2667 EXP is the expression that is a call to the builtin function;
2668 if convenient, the result should be placed in TARGET. */
2670 static rtx
2672 {
2673 convert_optab builtin_optab;
2678 tree fallback_fndecl;
2679 machine_mode mode;
2680 tree arg;
2688 {
2705 }
2707 /* Make a suitable register to place result in. */
2712 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2713 need to expand the argument again. This way, we will not perform
2714 side-effects more the once. */
2721 /* Compute into TARGET. */
2723 {
2724 /* Output the entire sequence. */
2729 }
2731 /* If we were unable to expand via the builtin, stop the sequence
2732 (without outputting the insns). */
2735 /* Fall back to floating point rounding optab. */
2738 /* For non-C99 targets we may end up without a fallback fndecl here
2739 if the user called __builtin_lfloor directly. In this case emit
2740 a call to the floor/ceil variants nevertheless. This should result
2741 in the best user experience for not full C99 targets. */
2743 {
2744 tree fntype;
2748 {
2781 }
2786 }
2793 /* Truncate the result of floating point optab to integer
2794 via expand_fix (). */
2799 }
2801 /* Expand a call to one of the builtin math functions doing integer
2802 conversion (lrint).
2803 Return 0 if a normal call should be emitted rather than expanding the
2804 function in-line. EXP is the expression that is a call to the builtin
2805 function; if convenient, the result should be placed in TARGET. */
2807 static rtx
2809 {
2810 convert_optab builtin_optab;
2811 rtx op0;
2814 tree arg;
2815 machine_mode mode;
2824 {
2843 }
2845 /* There's no easy way to detect the case we need to set EDOM. */
2849 /* Make a suitable register to place result in. */
2852 /* There's no easy way to detect the case we need to set EDOM. */
2854 {
2857 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2858 need to expand the argument again. This way, we will not perform
2859 side-effects more the once. */
2867 {
2868 /* Output the entire sequence. */
2873 }
2875 /* If we were unable to expand via the builtin, stop the sequence
2876 (without outputting the insns) and call to the library function
2877 with the stabilized argument list. */
2879 }
2882 {
2883 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2884 targets, (int) round (x) should never be transformed into
2885 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2886 a call to lround in the hope that the target provides at least some
2887 C99 functions. This should result in the best user experience for
2888 not full C99 targets. */
2889 tree fallback_fndecl = mathfn_built_in_1
2898 }
2901 }
2903 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2904 a normal call should be emitted rather than expanding the function
2905 in-line. EXP is the expression that is a call to the builtin
2906 function; if convenient, the result should be placed in TARGET. */
2908 static rtx
2910 {
2913 machine_mode mode;
2914 machine_mode mode2;
2923 /* Emit a libcall to libgcc. */
2925 /* Mode of the 2nd argument must match that of an int. */
2943 }
2945 /* Expand expression EXP which is a call to the strlen builtin. Return
2946 NULL_RTX if we failed and the caller should emit a normal call, otherwise
2947 try to get the result in TARGET, if convenient. */
2949 static rtx
2951 machine_mode target_mode)
2952 {
2957 rtx pat;
2958 tree len;
2960 rtx src_reg;
2962 machine_mode insn_mode;
2966 /* If the length can be computed at compile-time, return it. */
2971 /* If the length can be computed at compile-time and is constant
2972 integer, but there are side-effects in src, evaluate
2973 src for side-effects, then return len.
2974 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2975 can be optimized into: i++; x = 3; */
2978 {
2981 }
2985 /* If SRC is not a pointer type, don't do this operation inline. */
2989 /* Bail out if we can't compute strlen in the right mode. */
2991 {
2995 }
2999 /* Make a place to hold the source address. We will not expand
3000 the actual source until we are sure that the expansion will
3001 not fail -- there are trees that cannot be expanded twice. */
3004 /* Mark the beginning of the strlen sequence so we can emit the
3005 source operand later. */
3015 /* Check to see if the argument was declared attribute nonstring
3016 and if so, issue a warning since at this point it's not known
3017 to be nul-terminated. */
3020 /* Now that we are assured of success, expand the source. */
3024 {
3025 #ifdef POINTERS_EXTEND_UNSIGNED
3028 POINTERS_EXTEND_UNSIGNED);
3029 #endif
3031 }
3037 else
3040 /* Return the value in the proper mode for this function. */
3045 else
3049 }
3051 /* Expand call EXP to the strnlen built-in, returning the result
3052 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
3054 static rtx
3056 {
3073 /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
3074 so these conversions aren't necessary. */
3075 c_strlen_data lendata = { };
3081 {
3085 "%K%qD specified bound %E "
3092 {
3093 /* Clear EXACT if LEN may be less than SRC suggests,
3094 such as in
3095 strnlen (&a[i], sizeof a)
3096 where the value of i is unknown. Unless i's value is
3097 zero, the call is unsafe because the bound is greater. */
3101 }
3107 {
3108 location_t warnloc
3112 exact
3118 {
3123 }
3124 }
3131 }
3144 "%K%qD specified bound [%wu, %wu] "
3151 {
3155 }
3161 {
3162 location_t warnloc
3166 exact
3172 {
3176 }
3177 }
3187 }
3189 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3190 bytes from constant string DATA + OFFSET and return it as target
3191 constant. */
3193 static rtx
3195 scalar_int_mode mode)
3196 {
3204 }
3206 /* LEN specify length of the block of memcpy/memset operation.
3207 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3208 In some cases we can make very likely guess on max size, then we
3209 set it into PROBABLE_MAX_SIZE. */
3211 static void
3216 {
3218 {
3221 }
3222 else
3223 {
3227 /* Determine bounds from the type. */
3230 else
3235 else
3241 {
3246 }
3248 {
3249 /* Anti range 0...N lets us to determine minimal size to N+1. */
3251 {
3254 }
3255 /* Code like
3257 int n;
3258 if (n < 100)
3259 memcpy (a, b, n)
3261 Produce anti range allowing negative values of N. We still
3262 can use the information and make a guess that N is not negative.
3263 */
3266 }
3267 }
3271 }
3273 /* Try to verify that the sizes and lengths of the arguments to a string
3274 manipulation function given by EXP are within valid bounds and that
3275 the operation does not lead to buffer overflow or read past the end.
3276 Arguments other than EXP may be null. When non-null, the arguments
3277 have the following meaning:
3278 DST is the destination of a copy call or NULL otherwise.
3279 SRC is the source of a copy call or NULL otherwise.
3280 DSTWRITE is the number of bytes written into the destination obtained
3281 from the user-supplied size argument to the function (such as in
3282 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3283 MAXREAD is the user-supplied bound on the length of the source sequence
3284 (such as in strncat(d, s, N). It specifies the upper limit on the number
3285 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3286 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3287 expression EXP is a string function call (as opposed to a memory call
3288 like memcpy). As an exception, SRCSTR can also be an integer denoting
3289 the precomputed size of the source string or object (for functions like
3290 memcpy).
3291 DSTSIZE is the size of the destination object specified by the last
3292 argument to the _chk builtins, typically resulting from the expansion
3293 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3294 DSTSIZE).
3296 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3297 SIZE_MAX.
3299 If the call is successfully verified as safe return true, otherwise
3300 return false. */
3302 static bool
3305 {
3308 /* The size of the largest object is half the address space, or
3309 PTRDIFF_MAX. (This is way too permissive.) */
3312 /* Either the length of the source string for string functions or
3313 the size of the source object for raw memory functions. */
3318 /* Set to true when the exact number of bytes written by a string
3319 function like strcpy is not known and the only thing that is
3320 known is that it must be at least one (for the terminating nul). */
3323 {
3324 /* SRCSTR is normally a pointer to string but as a special case
3325 it can be an integer denoting the length of a string. */
3327 {
3328 /* Try to determine the range of lengths the source string
3329 refers to. If it can be determined and is less than
3330 the upper bound given by MAXREAD add one to it for
3331 the terminating nul. Otherwise, set it to one for
3332 the same reason, or to MAXREAD as appropriate. */
3333 c_strlen_data lendata = { };
3338 {
3341 else
3352 }
3353 else
3354 {
3357 }
3358 }
3359 else
3361 }
3364 {
3365 /* When the only available piece of data is the object size
3366 there is nothing to do. */
3370 /* Otherwise, when the length of the source sequence is known
3371 (as with strlen), set DSTWRITE to it. */
3374 }
3384 /* First check the number of bytes to be written against the maximum
3385 object size. */
3389 {
3399 "%K%qD specified size %E "
3402 else
3404 "%K%qD specified size between %E and %E "
3412 }
3414 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3415 constant, and in range of unsigned HOST_WIDE_INT. */
3418 /* Next check the number of bytes to be written against the destination
3419 object size. */
3421 {
3426 || (dstwrite
3429 {
3437 {
3438 /* This is a call to strcpy with a destination of 0 size
3439 and a source of unknown length. The call will write
3440 at least one byte past the end of the destination. */
3442 "%K%qD writing %E or more bytes into a region "
3445 }
3448 "%K%qD writing %E byte into a region "
3450 "%K%qD writing %E bytes into a region "
3454 {
3455 /* Avoid printing the upper bound if it's invalid. */
3457 "%K%qD writing %E or more bytes into a region "
3460 }
3461 else
3463 "%K%qD writing between %E and %E bytes into "
3466 dstsize);
3468 /* Return error when an overflow has been detected. */
3470 }
3471 }
3473 /* Check the maximum length of the source sequence against the size
3474 of the destination object if known, or against the maximum size
3475 of an object. */
3477 {
3480 {
3485 {
3489 /* Warn about crazy big sizes first since that's more
3490 likely to be meaningful than saying that the bound
3491 is greater than the object size if both are big. */
3494 "%K%qD specified bound %E "
3498 else
3500 "%K%qD specified bound between %E and %E "
3506 }
3509 {
3515 "%K%qD specified bound %E "
3519 else
3521 "%K%qD specified bound between %E and %E "
3526 }
3527 }
3528 }
3530 /* Check for reading past the end of SRC. */
3535 {
3547 {
3548 /* Avoid printing the upper bound if it's invalid. */
3550 "%K%qD reading %E or more bytes from a region "
3553 }
3554 else
3556 "%K%qD reading between %E and %E bytes from a region "
3560 }
3563 }
3565 /* Helper to compute the size of the object referenced by the DEST
3566 expression which must have pointer type, using Object Size type
3567 OSTYPE (only the least significant 2 bits are used). Return
3568 an estimate of the size of the object if successful or NULL when
3569 the size cannot be determined. When the referenced object involves
3570 a non-constant offset in some range the returned value represents
3571 the largest size given the smallest non-negative offset in the
3572 range. If nonnull, set *PDECL to the decl of the referenced
3573 subobject if it can be determined, or to null otherwise.
3574 The function is intended for diagnostics and should not be used
3575 to influence code generation or optimization. */
3577 tree
3579 {
3586 /* Only the two least significant bits are meaningful. */
3593 {
3602 {
3603 /* compute_builtin_object_size fails for addresses with
3604 non-constant offsets. Try to determine the range of
3605 such an offset here and use it to adjust the constant
3606 size. */
3609 {
3611 {
3615 /* Ignore negative offsets for now. For others,
3616 use the lower bound as the most optimistic
3617 estimate of the (remaining) size. */
3619 ;
3623 else
3625 }
3626 }
3629 {
3634 {
3636 {
3639 /* Ignore negative offsets for now. For others,
3640 use the lower bound as the most optimistic
3641 estimate of the (remaining)size. */
3644 ;
3648 else
3650 }
3651 }
3652 }
3653 }
3656 }
3658 /* Unless computing the largest size (for memcpy and other raw memory
3659 functions), try to determine the size of the object from its type. */
3665 {
3669 {
3670 /* If the declaration of the destination object is known
3671 to have zero size, return zero. */
3680 {
3685 else
3687 }
3692 }
3695 }
3698 {
3701 }
3708 {
3711 }
3721 {
3724 }
3727 }
3729 /* Helper to determine and check the sizes of the source and the destination
3730 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3731 call expression, DEST is the destination argument, SRC is the source
3732 argument or null, and LEN is the number of bytes. Use Object Size type-0
3733 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3734 (no overflow or invalid sizes), false otherwise. */
3736 static bool
3738 {
3739 /* For functions like memset and memcpy that operate on raw memory
3740 try to determine the size of the largest source and destination
3741 object using type-0 Object Size regardless of the object size
3742 type specified by the option. */
3748 }
3750 /* Validate memchr arguments without performing any expansion.
3751 Return NULL_RTX. */
3753 static rtx
3755 {
3763 /* Diagnose calls where the specified length exceeds the size
3764 of the object. */
3766 {
3770 }
3773 }
3775 /* Expand a call EXP to the memcpy builtin.
3776 Return NULL_RTX if we failed, the caller should emit a normal call,
3777 otherwise try to get the result in TARGET, if convenient (and in
3778 mode MODE if that's convenient). */
3780 static rtx
3782 {
3795 }
3797 /* Check a call EXP to the memmove built-in for validity.
3798 Return NULL_RTX on both success and failure. */
3800 static rtx
3802 {
3815 }
3817 /* Expand a call EXP to the mempcpy builtin.
3818 Return NULL_RTX if we failed; the caller should emit a normal call,
3819 otherwise try to get the result in TARGET, if convenient (and in
3820 mode MODE if that's convenient). */
3822 static rtx
3824 {
3833 /* Policy does not generally allow using compute_objsize (which
3834 is used internally by check_memop_size) to change code generation
3835 or drive optimization decisions.
3837 In this instance it is safe because the code we generate has
3838 the same semantics regardless of the return value of
3839 check_memop_sizes. Exactly the same amount of data is copied
3840 and the return value is exactly the same in both cases.
3842 Furthermore, check_memop_size always uses mode 0 for the call to
3843 compute_objsize, so the imprecise nature of compute_objsize is
3844 avoided. */
3846 /* Avoid expanding mempcpy into memcpy when the call is determined
3847 to overflow the buffer. This also prevents the same overflow
3848 from being diagnosed again when expanding memcpy. */
3854 }
3856 /* Helper function to do the actual work for expand of memory copy family
3857 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3858 of memory from SRC to DEST and assign to TARGET if convenient. Return
3859 value is based on RETMODE argument. */
3861 static rtx
3865 {
3878 /* If DEST is not a pointer type, call the normal function. */
3882 /* If either SRC is not a pointer type, don't do this
3883 operation in-line. */
3900 /* If SRC is a string constant and block move would be done by
3901 pieces, we can avoid loading the string from memory and only
3902 stored the computed constants. This works in the overlap
3903 (memmove) case as well because store_by_pieces just generates a
3904 series of stores of constants from the string constant returned
3905 by c_getstr(). */
3912 {
3914 builtin_memcpy_read_str,
3920 }
3925 /* Copy word part most expediently. */
3932 && !might_overlap
3941 /* Bail out when a mempcpy call would be expanded as libcall and when
3942 we have a target that provides a fast implementation
3943 of mempcpy routine. */
3951 {
3954 }
3957 {
3959 /* stpcpy pointer to last byte. */
3962 }
3965 }
3967 static rtx
3970 {
3973 }
3975 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3976 we failed, the caller should emit a normal call, otherwise try to
3977 get the result in TARGET, if convenient.
3978 Return value is based on RETMODE argument. */
3980 static rtx
3982 {
3984 rtx dest_mem;
3985 rtx src_mem;
3993 {
3996 }
4006 {
4008 /* movstr is supposed to set end to the address of the NUL
4009 terminator. If the caller requested a mempcpy-like return value,
4010 adjust it. */
4012 {
4016 }
4017 }
4019 }
4021 /* Do some very basic size validation of a call to the strcpy builtin
4022 given by EXP. Return NULL_RTX to have the built-in expand to a call
4023 to the library function. */
4025 static rtx
4027 {
4035 /* There is no way here to determine the length of the string in
4036 the destination to which the SRC string is being appended so
4037 just diagnose cases when the souce string is longer than
4038 the destination object. */
4043 destsize);
4046 }
4048 /* Expand expression EXP, which is a call to the strcpy builtin. Return
4049 NULL_RTX if we failed the caller should emit a normal call, otherwise
4050 try to get the result in TARGET, if convenient (and in mode MODE if that's
4051 convenient). */
4053 static rtx
4055 {
4063 {
4067 }
4070 {
4071 /* Check to see if the argument was declared attribute nonstring
4072 and if so, issue a warning since at this point it's not known
4073 to be nul-terminated. */
4077 }
4080 }
4082 /* Helper function to do the actual work for expand_builtin_strcpy. The
4083 arguments to the builtin_strcpy call DEST and SRC are broken out
4084 so that this can also be called without constructing an actual CALL_EXPR.
4085 The other arguments and return value are the same as for
4086 expand_builtin_strcpy. */
4088 static rtx
4090 {
4091 /* Detect strcpy calls with unterminated arrays.. */
4093 {
4094 /* NONSTR refers to the non-nul terminated constant array. */
4098 }
4101 }
4103 /* Expand a call EXP to the stpcpy builtin.
4104 Return NULL_RTX if we failed the caller should emit a normal call,
4105 otherwise try to get the result in TARGET, if convenient (and in
4106 mode MODE if that's convenient). */
4108 static rtx
4110 {
4121 {
4125 }
4127 /* If return value is ignored, transform stpcpy into strcpy. */
4129 {
4133 }
4134 else
4135 {
4137 rtx ret;
4139 /* Ensure we get an actual string whose length can be evaluated at
4140 compile-time, not an expression containing a string. This is
4141 because the latter will potentially produce pessimized code
4142 when used to produce the return value. */
4143 c_strlen_data lendata = { };
4161 {
4165 {
4169 {
4171 {
4174 else
4176 }
4185 }
4186 }
4187 }
4191 }
4192 }
4194 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
4195 arguments while being careful to avoid duplicate warnings (which could
4196 be issued if the expander were to expand the call, resulting in it
4197 being emitted in expand_call(). */
4199 static rtx
4201 {
4203 {
4204 /* The call has been successfully expanded. Check for nonstring
4205 arguments and issue warnings as appropriate. */
4208 }
4211 }
4213 /* Check a call EXP to the stpncpy built-in for validity.
4214 Return NULL_RTX on both success and failure. */
4216 static rtx
4218 {
4224 /* The source and destination of the call. */
4228 /* The exact number of bytes to write (not the maximum). */
4231 /* The size of the destination object. */
4237 }
4239 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4240 bytes from constant string DATA + OFFSET and return it as target
4241 constant. */
4243 rtx
4245 scalar_int_mode mode)
4246 {
4253 }
4255 /* Helper to check the sizes of sequences and the destination of calls
4256 to __builtin_strncat and __builtin___strncat_chk. Returns true on
4257 success (no overflow or invalid sizes), false otherwise. */
4259 static bool
4261 {
4266 /* Try to determine the range of lengths that the source expression
4267 refers to. */
4268 c_strlen_data lendata = { };
4271 /* Try to verify that the destination is big enough for the shortest
4272 string. */
4275 {
4276 /* If it hasn't been provided by __strncat_chk, try to determine
4277 the size of the destination object into which the source is
4278 being copied. */
4280 }
4282 /* Add one for the terminating nul. */
4285 size_one_node)
4288 /* The strncat function copies at most MAXREAD bytes and always appends
4289 the terminating nul so the specified upper bound should never be equal
4290 to (or greater than) the size of the destination. */
4293 {
4302 }
4310 /* The number of bytes to write is LEN but check_access will also
4311 check SRCLEN if LEN's value isn't known. */
4313 objsize);
4314 }
4316 /* Similar to expand_builtin_strcat, do some very basic size validation
4317 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4318 the built-in expand to a call to the library function. */
4320 static rtx
4322 {
4330 /* The upper bound on the number of bytes to write. */
4332 /* The length of the source sequence. */
4335 /* Try to determine the range of lengths that the source expression
4336 refers to. Since the lengths are only used for warning and not
4337 for code generation disable strict mode below. */
4340 {
4341 c_strlen_data lendata = { };
4344 }
4346 /* Try to verify that the destination is big enough for the shortest
4347 string. First try to determine the size of the destination object
4348 into which the source is being copied. */
4351 /* Add one for the terminating nul. */
4352 tree srclen = (maxlen
4354 size_one_node)
4357 /* The strncat function copies at most MAXREAD bytes and always appends
4358 the terminating nul so the specified upper bound should never be equal
4359 to (or greater than) the size of the destination. */
4362 {
4371 }
4379 /* The number of bytes to write is SRCLEN. */
4383 }
4385 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4386 NULL_RTX if we failed the caller should emit a normal call. */
4388 static rtx
4390 {
4395 {
4398 /* The number of bytes to write (not the maximum). */
4400 /* The length of the source sequence. */
4404 {
4408 /* The number of bytes to write is LEN but check_access will also
4409 check SLEN if LEN's value isn't known. */
4411 destsize);
4412 }
4414 /* We must be passed a constant len and src parameter. */
4420 /* We're required to pad with trailing zeros if the requested
4421 len is greater than strlen(s2)+1. In that case try to
4422 use store_by_pieces, if it fails, punt. */
4424 {
4427 rtx dest_mem;
4431 builtin_strncpy_read_str,
4438 builtin_strncpy_read_str,
4440 RETURN_BEGIN);
4444 }
4445 }
4447 }
4449 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4450 bytes from constant string DATA + OFFSET and return it as target
4451 constant. */
4453 rtx
4455 scalar_int_mode mode)
4456 {
4463 }
4465 /* Callback routine for store_by_pieces. Return the RTL of a register
4466 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4467 char value given in the RTL register data. For example, if mode is
4468 4 bytes wide, return the RTL for 0x01010101*data. */
4470 static rtx
4472 scalar_int_mode mode)
4473 {
4489 }
4491 /* Expand expression EXP, which is a call to the memset builtin. Return
4492 NULL_RTX if we failed the caller should emit a normal call, otherwise
4493 try to get the result in TARGET, if convenient (and in mode MODE if that's
4494 convenient). */
4496 static rtx
4498 {
4510 }
4512 /* Helper function to do the actual work for expand_builtin_memset. The
4513 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4514 so that this can also be called without constructing an actual CALL_EXPR.
4515 The other arguments and return value are the same as for
4516 expand_builtin_memset. */
4518 static rtx
4521 {
4524 machine_mode val_mode;
4536 /* If DEST is not a pointer type, don't do this operation in-line. */
4547 /* If the LEN parameter is zero, return DEST. */
4549 {
4550 /* Evaluate and ignore VAL in case it has side-effects. */
4553 }
4555 /* Stabilize the arguments in case we fail. */
4567 {
4568 rtx val_rtx;
4573 /* Assume that we can memset by pieces if we can store
4574 * the coefficients by pieces (in the required modes).
4575 * We can't pass builtin_memset_gen_str as that emits RTL. */
4581 {
4586 }
4590 probable_max_size))
4596 }
4602 {
4609 RETURN_BEGIN);
4614 probable_max_size))
4620 }
4628 probable_max_size);
4631 {
4634 }
4638 do_libcall:
4647 else
4652 }
4654 /* Expand expression EXP, which is a call to the bzero builtin. Return
4655 NULL_RTX if we failed the caller should emit a normal call. */
4657 static rtx
4659 {
4668 /* New argument list transforming bzero(ptr x, int y) to
4669 memset(ptr x, int 0, size_t y). This is done this way
4670 so that if it isn't expanded inline, we fallback to
4671 calling bzero instead of memset. */
4679 }
4681 /* Try to expand cmpstr operation ICODE with the given operands.
4682 Return the result rtx on success, otherwise return null. */
4684 static rtx
4686 HOST_WIDE_INT align)
4687 {
4701 }
4703 /* Expand expression EXP, which is a call to the memcmp built-in function.
4704 Return NULL_RTX if we failed and the caller should emit a normal call,
4705 otherwise try to get the result in TARGET, if convenient.
4706 RESULT_EQ is true if we can relax the returned value to be either zero
4707 or nonzero, without caring about the sign. */
4709 static rtx
4711 {
4722 /* Diagnose calls where the specified length exceeds the size of either
4723 object. */
4729 {
4734 }
4736 /* If the specified length exceeds the size of either object,
4737 call the function. */
4741 /* Due to the performance benefit, always inline the calls first
4742 when result_eq is false. */
4746 {
4750 }
4758 /* If we don't have POINTER_TYPE, call the function. */
4766 /* Set MEM_SIZE as appropriate. */
4768 {
4771 }
4777 {
4781 }
4783 /* If SRC is a string constant and block move would be done
4784 by pieces, we can avoid loading the string from memory
4785 and only stored the computed constants. */
4797 {
4798 /* Return the value in the proper mode for this function. */
4803 {
4806 }
4809 }
4812 }
4814 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4815 if we failed the caller should emit a normal call, otherwise try to get
4816 the result in TARGET, if convenient. */
4818 static rtx
4820 {
4824 /* Due to the performance benefit, always inline the calls first. */
4841 /* If we don't have POINTER_TYPE, call the function. */
4845 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4852 /* Try to call cmpstrsi. */
4857 /* Try to determine at least one length and call cmpstrnsi. */
4859 {
4860 tree len;
4861 rtx arg3_rtx;
4871 /* If we don't have a constant length for the first, use the length
4872 of the second, if we know it. We don't require a constant for
4873 this case; some cost analysis could be done if both are available
4874 but neither is constant. For now, assume they're equally cheap,
4875 unless one has side effects. If both strings have constant lengths,
4876 use the smaller. */
4892 else
4895 /* If both arguments have side effects, we cannot optimize. */
4897 {
4899 result = expand_cmpstrn_or_cmpmem
4902 }
4903 }
4907 {
4908 /* Check to see if the argument was declared attribute nonstring
4909 and if so, issue a warning since at this point it's not known
4910 to be nul-terminated. */
4913 /* Return the value in the proper mode for this function. */
4921 }
4923 /* Expand the library call ourselves using a stabilized argument
4924 list to avoid re-evaluating the function's arguments twice. */
4929 }
4931 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4932 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4933 the result in TARGET, if convenient. */
4935 static rtx
4937 ATTRIBUTE_UNUSED machine_mode mode)
4938 {
4943 /* Due to the performance benefit, always inline the calls first. */
4949 /* If c_strlen can determine an expression for one of the string
4950 lengths, and it doesn't have side effects, then emit cmpstrnsi
4951 using length MIN(strlen(string)+1, arg3). */
4956 tree len;
4977 /* If we don't have a constant length for the first, use the length
4978 of the second, if we know it. If neither string is constant length,
4979 use the given length argument. We don't require a constant for
4980 this case; some cost analysis could be done if both are available
4981 but neither is constant. For now, assume they're equally cheap,
4982 unless one has side effects. If both strings have constant lengths,
4983 use the smaller. */
5001 else
5004 /* If we are not using the given length, we must incorporate it here.
5005 The actual new length parameter will be MIN(len,arg3) in this case. */
5007 {
5010 }
5020 {
5021 /* Check to see if the argument was declared attribute nonstring
5022 and if so, issue a warning since at this point it's not known
5023 to be nul-terminated. */
5026 /* Return the value in the proper mode for this function. */
5034 }
5036 /* Expand the library call ourselves using a stabilized argument
5037 list to avoid re-evaluating the function's arguments twice. */
5042 }
5044 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
5045 if that's convenient. */
5047 rtx
5049 {
5050 rtx val;
5053 /* Don't do __builtin_saveregs more than once in a function.
5054 Save the result of the first call and reuse it. */
5058 /* When this function is called, it means that registers must be
5059 saved on entry to this function. So we migrate the call to the
5060 first insn of this function. */
5064 /* Do whatever the machine needs done in this case. */
5072 /* Put the insns after the NOTE that starts the function. If this
5073 is inside a start_sequence, make the outer-level insn chain current, so
5074 the code is placed at the start of the function. */
5080 }
5082 /* Expand a call to __builtin_next_arg. */
5084 static rtx
5086 {
5087 /* Checking arguments is already done in fold_builtin_next_arg
5088 that must be called before this function. */
5093 }
5095 /* Make it easier for the backends by protecting the valist argument
5096 from multiple evaluations. */
5098 static tree
5100 {
5103 /* The current way of determining the type of valist is completely
5104 bogus. We should have the information on the va builtin instead. */
5109 {
5113 /* For this case, the backends will be expecting a pointer to
5114 vatype, but it's possible we've actually been given an array
5115 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
5116 So fix it. */
5118 {
5121 }
5122 }
5123 else
5124 {
5128 {
5134 }
5140 }
5143 }
5145 /* The "standard" definition of va_list is void*. */
5147 tree
5149 {
5151 }
5153 /* The "standard" abi va_list is va_list_type_node. */
5155 tree
5157 {
5159 }
5161 /* The "standard" type of va_list is va_list_type_node. */
5163 tree
5165 {
5172 {
5173 /* If va_list is an array type, the argument may have decayed
5174 to a pointer type, e.g. by being passed to another function.
5175 In that case, unwrap both types so that we can compare the
5176 underlying records. */
5179 {
5182 }
5183 }
5188 }
5190 /* The "standard" implementation of va_start: just assign `nextarg' to
5191 the variable. */
5193 void
5195 {
5198 }
5200 /* Expand EXP, a call to __builtin_va_start. */
5202 static rtx
5204 {
5205 rtx nextarg;
5206 tree valist;
5210 {
5213 }
5223 else
5227 }
5229 /* Expand EXP, a call to __builtin_va_end. */
5231 static rtx
5233 {
5236 /* Evaluate for side effects, if needed. I hate macros that don't
5237 do that. */
5242 }
5244 /* Expand EXP, a call to __builtin_va_copy. We do this as a
5245 builtin rather than just as an assignment in stdarg.h because of the
5246 nastiness of array-type va_list types. */
5248 static rtx
5250 {
5263 {
5267 }
5268 else
5269 {
5272 /* Evaluate to pointers. */
5281 /* "Dereference" to BLKmode memories. */
5289 /* Copy. */
5291 }
5294 }
5296 /* Expand a call to one of the builtin functions __builtin_frame_address or
5297 __builtin_return_address. */
5299 static rtx
5301 {
5302 /* The argument must be a nonnegative integer constant.
5303 It counts the number of frames to scan up the stack.
5304 The value is either the frame pointer value or the return
5305 address saved in that frame. */
5307 /* Warning about missing arg was already issued. */
5310 {
5313 }
5314 else
5315 {
5316 /* Number of frames to scan up the stack. */
5321 /* Some ports cannot access arbitrary stack frames. */
5323 {
5326 }
5329 {
5330 /* Warn since no effort is made to ensure that any frame
5331 beyond the current one exists or can be safely reached. */
5334 }
5336 /* For __builtin_frame_address, return what we've got. */
5344 }
5345 }
5347 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5348 failed and the caller should emit a normal call. */
5350 static rtx
5352 {
5353 rtx op0;
5354 rtx result;
5357 HOST_WIDE_INT max_size;
5360 bool valid_arglist
5363 VOID_TYPE)
5374 || (!alloca_for_var
5377 ))
5378 {
5379 /* -Walloca-larger-than and -Wvla-larger-than settings of
5380 less than HOST_WIDE_INT_MAX override the more general
5381 -Walloc-size-larger-than so unless either of the former
5382 options is smaller than the last one (wchich would imply
5383 that the call was already checked), check the alloca
5384 arguments for overflow. */
5388 }
5390 /* Compute the argument. */
5393 /* Compute the alignment. */
5395 ? BIGGEST_ALIGNMENT
5398 /* Compute the maximum size. */
5403 /* Allocate the desired space. If the allocation stems from the declaration
5404 of a variable-sized object, it cannot accumulate. */
5405 result
5409 /* Dynamic allocations for variables are recorded during gimplification. */
5414 }
5416 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5417 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5418 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5419 handle_builtin_stack_restore function. */
5421 static rtx
5423 {
5430 OPTAB_LIB_WIDEN);
5433 OPTAB_LIB_WIDEN);
5438 }
5440 /* Expand a call to bswap builtin in EXP.
5441 Return NULL_RTX if a normal call should be emitted rather than expanding the
5442 function in-line. If convenient, the result should be placed in TARGET.
5443 SUBTARGET may be used as the target for computing one of EXP's operands. */
5445 static rtx
5447 rtx subtarget)
5448 {
5449 tree arg;
5450 rtx op0;
5468 }
5470 /* Expand a call to a unary builtin in EXP.
5471 Return NULL_RTX if a normal call should be emitted rather than expanding the
5472 function in-line. If convenient, the result should be placed in TARGET.
5473 SUBTARGET may be used as the target for computing one of EXP's operands. */
5475 static rtx
5478 {
5479 rtx op0;
5484 /* Compute the argument. */
5486 (subtarget
5490 /* Compute op, into TARGET if possible.
5491 Set TARGET to wherever the result comes back. */
5497 }
5499 /* Expand a call to __builtin_expect. We just return our argument
5500 as the builtin_expect semantic should've been already executed by
5501 tree branch prediction pass. */
5503 static rtx
5505 {
5506 tree arg;
5513 /* When guessing was done, the hints should be already stripped away. */
5517 }
5519 /* Expand a call to __builtin_expect_with_probability. We just return our
5520 argument as the builtin_expect semantic should've been already executed by
5521 tree branch prediction pass. */
5523 static rtx
5525 {
5526 tree arg;
5533 /* When guessing was done, the hints should be already stripped away. */
5537 }
5540 /* Expand a call to __builtin_assume_aligned. We just return our first
5541 argument as the builtin_assume_aligned semantic should've been already
5542 executed by CCP. */
5544 static rtx
5546 {
5550 EXPAND_NORMAL);
5555 }
5557 void
5559 {
5561 {
5563 /* For trap insns when not accumulating outgoing args force
5564 REG_ARGS_SIZE note to prevent crossjumping of calls with
5565 different args sizes. */
5568 }
5569 else
5570 {
5574 }
5577 }
5579 /* Expand a call to __builtin_unreachable. We do nothing except emit
5580 a barrier saying that control flow will not pass here.
5582 It is the responsibility of the program being compiled to ensure
5583 that control flow does never reach __builtin_unreachable. */
5584 static void
5586 {
5588 }
5590 /* Expand EXP, a call to fabs, fabsf or fabsl.
5591 Return NULL_RTX if a normal call should be emitted rather than expanding
5592 the function inline. If convenient, the result should be placed
5593 in TARGET. SUBTARGET may be used as the target for computing
5594 the operand. */
5596 static rtx
5598 {
5599 machine_mode mode;
5600 tree arg;
5601 rtx op0;
5611 }
5613 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5614 Return NULL is a normal call should be emitted rather than expanding the
5615 function inline. If convenient, the result should be placed in TARGET.
5616 SUBTARGET may be used as the target for computing the operand. */
5618 static rtx
5620 {
5622 tree arg;
5634 }
5636 /* Expand a call to __builtin___clear_cache. */
5638 static rtx
5640 {
5642 {
5643 #ifdef CLEAR_INSN_CACHE
5644 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5645 does something. Just do the default expansion to a call to
5646 __clear_cache(). */
5648 #else
5649 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5650 does nothing. There is no need to call it. Do nothing. */
5653 }
5655 /* We have a "clear_cache" insn, and it will handle everything. */
5659 /* We must not expand to a library call. If we did, any
5660 fallback library function in libgcc that might contain a call to
5661 __builtin___clear_cache() would recurse infinitely. */
5663 {
5666 }
5669 {
5682 }
5684 }
5686 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5688 static rtx
5690 {
5693 /* If we don't need too much alignment, we'll have been guaranteed
5694 proper alignment by get_trampoline_type. */
5698 /* Round address up to desired boundary. */
5709 }
5711 static rtx
5713 {
5729 /* If ONSTACK, the TRAMP argument should be the address of a field
5730 within the local function's FRAME decl. Either way, let's see if
5731 we can fill in the MEM_ATTRs for this memory. */
5735 /* Creator of a heap trampoline is responsible for making sure the
5736 address is aligned to at least STACK_BOUNDARY. Normally malloc
5737 will ensure this anyhow. */
5740 {
5744 }
5746 /* The FUNC argument should be the address of the nested function.
5747 Extract the actual function decl to pass to the hook. */
5754 /* Generate insns to initialize the trampoline. */
5758 {
5764 }
5767 }
5769 static rtx
5771 {
5772 rtx tramp;
5783 }
5785 /* Expand a call to the builtin descriptor initialization routine.
5786 A descriptor is made up of a couple of pointers to the static
5787 chain and the code entry in this order. */
5789 static rtx
5791 {
5796 VOID_TYPE))
5811 /* Generate insns to initialize the descriptor. */
5817 }
5819 /* Expand a call to the builtin descriptor adjustment routine. */
5821 static rtx
5823 {
5824 rtx tramp;
5831 /* Unalign the descriptor to allow runtime identification. */
5836 }
5838 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5839 function. The function first checks whether the back end provides
5840 an insn to implement signbit for the respective mode. If not, it
5841 checks whether the floating point format of the value is such that
5842 the sign bit can be extracted. If that is not the case, error out.
5843 EXP is the expression that is a call to the builtin function; if
5844 convenient, the result should be placed in TARGET. */
5845 static rtx
5847 {
5849 scalar_float_mode fmode;
5851 tree arg;
5854 rtx temp;
5867 /* Expand the argument yielding a RTX expression. */
5870 /* Check if the back end provides an insn that handles signbit for the
5871 argument's mode. */
5874 {
5880 }
5882 /* For floating point formats without a sign bit, implement signbit
5883 as "ARG < 0.0". */
5886 {
5887 /* But we can't do this if the format supports signed zero. */
5893 }
5896 {
5899 }
5900 else
5901 {
5903 /* Handle targets with different FP word orders. */
5906 else
5910 }
5912 /* Force the intermediate word_mode (or narrower) result into a
5913 register. This avoids attempting to create paradoxical SUBREGs
5914 of floating point modes below. */
5917 /* If the bitpos is within the "result mode" lowpart, the operation
5918 can be implement with a single bitwise AND. Otherwise, we need
5919 a right shift and an AND. */
5922 {
5930 }
5931 else
5932 {
5933 /* Perform a logical right shift to place the signbit in the least
5934 significant bit, then truncate the result to the desired mode
5935 and mask just this bit. */
5940 }
5943 }
5945 /* Expand fork or exec calls. TARGET is the desired target of the
5946 call. EXP is the call. FN is the
5947 identificator of the actual function. IGNORE is nonzero if the
5948 value is to be ignored. */
5950 static rtx
5952 {
5954 tree call;
5956 /* If we are not profiling, just call the function. */
5960 /* Otherwise call the wrapper. This should be equivalent for the rest of
5961 compiler, so the code does not diverge, and the wrapper may run the
5962 code necessary for keeping the profiling sane. */
5965 {
5996 }
6008 }
6011 \f
6012 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
6013 the pointer in these functions is void*, the tree optimizers may remove
6014 casts. The mode computed in expand_builtin isn't reliable either, due
6015 to __sync_bool_compare_and_swap.
6017 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
6018 group of builtins. This gives us log2 of the mode size. */
6022 {
6023 /* The size is not negotiable, so ask not to get BLKmode in return
6024 if the target indicates that a smaller size would be better. */
6026 }
6028 /* Expand the memory expression LOC and return the appropriate memory operand
6029 for the builtin_sync operations. */
6031 static rtx
6033 {
6043 /* Note that we explicitly do not want any alias information for this
6044 memory, so that we kill all other live memories. Otherwise we don't
6045 satisfy the full barrier semantics of the intrinsic. */
6052 /* The alignment needs to be at least according to that of the mode. */
6059 }
6061 /* Make sure an argument is in the right mode.
6062 EXP is the tree argument.
6063 MODE is the mode it should be in. */
6065 static rtx
6067 {
6068 rtx val;
6069 machine_mode old_mode;
6072 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
6073 of CONST_INTs, where we know the old_mode only from the call argument. */
6080 }
6083 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
6084 EXP is the CALL_EXPR. CODE is the rtx code
6085 that corresponds to the arithmetic or logical operation from the name;
6086 an exception here is that NOT actually means NAND. TARGET is an optional
6087 place for us to store the results; AFTER is true if this is the
6088 fetch_and_xxx form. */
6090 static rtx
6093 rtx target)
6094 {
6099 {
6106 {
6135 }
6136 }
6138 /* Expand the operands. */
6143 after);
6144 }
6146 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
6147 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
6148 true if this is the boolean form. TARGET is a place for us to store the
6149 results; this is NOT optional if IS_BOOL is true. */
6151 static rtx
6154 {
6158 /* Expand the operands. */
6165 {
6168 else
6170 }
6173 MEMMODEL_SYNC_SEQ_CST))
6177 }
6179 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
6180 general form is actually an atomic exchange, and some targets only
6181 support a reduced form with the second argument being a constant 1.
6182 EXP is the CALL_EXPR; TARGET is an optional place for us to store
6183 the results. */
6185 static rtx
6187 rtx target)
6188 {
6191 /* Expand the operands. */
6196 }
6198 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
6200 static void
6202 {
6203 rtx mem;
6205 /* Expand the operands. */
6209 }
6211 /* Given an integer representing an ``enum memmodel'', verify its
6212 correctness and return the memory model enum. */
6214 static enum memmodel
6216 {
6217 rtx op;
6219 location_t loc
6222 /* If the parameter is not a constant, it's a run time value so we'll just
6223 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
6233 {
6237 }
6239 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
6241 {
6245 }
6247 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
6248 be conservative and promote consume to acquire. */
6253 }
6255 /* Expand the __atomic_exchange intrinsic:
6256 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
6257 EXP is the CALL_EXPR.
6258 TARGET is an optional place for us to store the results. */
6260 static rtx
6262 {
6271 /* Expand the operands. */
6276 }
6278 /* Expand the __atomic_compare_exchange intrinsic:
6279 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
6280 TYPE desired, BOOL weak,
6281 enum memmodel success,
6282 enum memmodel failure)
6283 EXP is the CALL_EXPR.
6284 TARGET is an optional place for us to store the results. */
6286 static rtx
6288 rtx target)
6289 {
6293 tree weak;
6295 location_t loc
6302 {
6304 "failure memory model cannot be stronger than success "
6307 }
6310 {
6312 "invalid failure memory model for "
6316 }
6322 /* Expand the operands. */
6338 /* Lest the rtl backend create a race condition with an imporoper store
6339 to memory, always create a new pseudo for OLDVAL. */
6346 /* Conditionally store back to EXPECT, lest we create a race condition
6347 with an improper store to memory. */
6348 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6349 the normal case where EXPECT is totally private, i.e. a register. At
6350 which point the store can be unconditional. */
6358 }
6360 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6361 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6362 call. The weak parameter must be dropped to match the expected parameter
6363 list and the expected argument changed from value to pointer to memory
6364 slot. */
6366 static void
6368 {
6384 /* Skip the boolean weak parameter. */
6387 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6390 built_in_function fncode
6395 fndecl);
6400 {
6407 }
6408 }
6410 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6412 void
6414 {
6420 tree lhs;
6422 location_t loc
6429 {
6431 "failure memory model cannot be stronger than success "
6434 }
6437 {
6439 "invalid failure memory model for "
6443 }
6446 {
6449 }
6451 /* Expand the operands. */
6464 {
6467 }
6471 {
6477 }
6478 }
6480 /* Expand the __atomic_load intrinsic:
6481 TYPE __atomic_load (TYPE *object, enum memmodel)
6482 EXP is the CALL_EXPR.
6483 TARGET is an optional place for us to store the results. */
6485 static rtx
6487 {
6488 rtx mem;
6493 {
6494 location_t loc
6499 }
6504 /* Expand the operand. */
6508 }
6511 /* Expand the __atomic_store intrinsic:
6512 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6513 EXP is the CALL_EXPR.
6514 TARGET is an optional place for us to store the results. */
6516 static rtx
6518 {
6525 {
6526 location_t loc
6531 }
6536 /* Expand the operands. */
6541 }
6543 /* Expand the __atomic_fetch_XXX intrinsic:
6544 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6545 EXP is the CALL_EXPR.
6546 TARGET is an optional place for us to store the results.
6547 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6548 FETCH_AFTER is true if returning the result of the operation.
6549 FETCH_AFTER is false if returning the value before the operation.
6550 IGNORE is true if the result is not used.
6551 EXT_CALL is the correct builtin for an external call if this cannot be
6552 resolved to an instruction sequence. */
6554 static rtx
6558 {
6561 tree fndecl;
6562 tree addr;
6566 /* Expand the operands. */
6570 /* Only try generating instructions if inlining is turned on. */
6572 {
6576 }
6578 /* Return if a different routine isn't needed for the library call. */
6582 /* Change the call to the specified function. */
6590 /* If we will emit code after the call, the call cannot be a tail call.
6591 If it is emitted as a tail call, a barrier is emitted after it, and
6592 then all trailing code is removed. */
6596 /* Expand the call here so we can emit trailing code. */
6599 /* Replace the original function just in case it matters. */
6602 /* Then issue the arithmetic correction to return the right result. */
6604 {
6606 {
6608 OPTAB_LIB_WIDEN);
6610 }
6611 else
6613 OPTAB_LIB_WIDEN);
6614 }
6616 }
6618 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6620 void
6622 {
6630 optab optab;
6642 {
6657 }
6660 {
6667 }
6689 {
6694 }
6695 else
6697 OPTAB_DIRECT);
6700 }
6702 /* Expand an atomic clear operation.
6703 void _atomic_clear (BOOL *obj, enum memmodel)
6704 EXP is the call expression. */
6706 static rtx
6708 {
6709 machine_mode mode;
6718 {
6719 location_t loc
6724 }
6726 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6727 Failing that, a store is issued by __atomic_store. The only way this can
6728 fail is if the bool type is larger than a word size. Unlikely, but
6729 handle it anyway for completeness. Assume a single threaded model since
6730 there is no atomic support in this case, and no barriers are required. */
6735 }
6737 /* Expand an atomic test_and_set operation.
6738 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6739 EXP is the call expression. */
6741 static rtx
6743 {
6744 rtx mem;
6746 machine_mode mode;
6753 }
6756 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6757 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6759 static tree
6761 {
6763 machine_mode mode;
6769 /* We need a corresponding integer mode for the access to be lock-free. */
6777 {
6780 /* Either this argument is null, or it's a fake pointer encoding
6781 the alignment of the object. */
6787 else
6789 }
6790 else
6791 {
6794 /* This function is usually invoked and folded immediately by the front
6795 end before anything else has a chance to look at it. The pointer
6796 parameter at this point is usually cast to a void *, so check for that
6797 and look past the cast. */
6807 /* Get the underlying type of the object. */
6810 }
6812 /* If the object has smaller alignment, the lock free routines cannot
6813 be used. */
6817 /* Check if a compare_and_swap pattern exists for the mode which represents
6818 the required size. The pattern is not allowed to fail, so the existence
6819 of the pattern indicates support is present. Also require that an
6820 atomic load exists for the required size. */
6823 else
6825 }
6827 /* Return true if the parameters to call EXP represent an object which will
6828 always generate lock free instructions. The first argument represents the
6829 size of the object, and the second parameter is a pointer to the object
6830 itself. If NULL is passed for the object, then the result is based on
6831 typical alignment for an object of the specified size. Otherwise return
6832 false. */
6834 static rtx
6836 {
6837 tree size;
6842 {
6845 }
6851 }
6853 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6854 is lock free on this architecture. */
6856 static tree
6858 {
6862 /* If it isn't always lock free, don't generate a result. */
6867 }
6869 /* Return true if the parameters to call EXP represent an object which will
6870 always generate lock free instructions. The first argument represents the
6871 size of the object, and the second parameter is a pointer to the object
6872 itself. If NULL is passed for the object, then the result is based on
6873 typical alignment for an object of the specified size. Otherwise return
6874 NULL*/
6876 static rtx
6878 {
6879 tree size;
6884 {
6887 }
6892 /* If the value is known at compile time, return the RTX for it. */
6898 }
6900 /* Expand the __atomic_thread_fence intrinsic:
6901 void __atomic_thread_fence (enum memmodel)
6902 EXP is the CALL_EXPR. */
6904 static void
6906 {
6909 }
6911 /* Expand the __atomic_signal_fence intrinsic:
6912 void __atomic_signal_fence (enum memmodel)
6913 EXP is the CALL_EXPR. */
6915 static void
6917 {
6920 }
6922 /* Expand the __sync_synchronize intrinsic. */
6924 static void
6926 {
6928 }
6930 static rtx
6932 {
6938 {
6940 /* If the target is not sutitable then create a new target. */
6948 }
6951 }
6953 static void
6955 {
6961 {
6968 }
6970 }
6972 \f
6973 /* Emit code to restore the current value of stack. */
6975 static void
6977 {
6989 }
6991 /* Emit code to save the current value of stack. */
6993 static rtx
6995 {
7000 }
7002 /* Emit code to get the openacc gang, worker or vector id or size. */
7004 static rtx
7006 {
7008 rtx fallback_retval;
7011 {
7024 }
7027 {
7030 }
7034 {
7037 }
7041 {
7049 }
7058 {
7061 }
7069 }
7071 /* Expand a string compare operation using a sequence of char comparison
7072 to get rid of the calling overhead, with result going to TARGET if
7073 that's convenient.
7075 VAR_STR is the variable string source;
7076 CONST_STR is the constant string source;
7077 LENGTH is the number of chars to compare;
7078 CONST_STR_N indicates which source string is the constant string;
7079 IS_MEMCMP indicates whether it's a memcmp or strcmp.
7081 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
7083 target = (int) (unsigned char) var_str[0]
7084 - (int) (unsigned char) const_str[0];
7085 if (target != 0)
7086 goto ne_label;
7087 ...
7088 target = (int) (unsigned char) var_str[length - 2]
7089 - (int) (unsigned char) const_str[length - 2];
7090 if (target != 0)
7091 goto ne_label;
7092 target = (int) (unsigned char) var_str[length - 1]
7093 - (int) (unsigned char) const_str[length - 1];
7094 ne_label:
7095 */
7097 static rtx
7101 {
7103 rtx var_rtx_array
7110 scalar_int_mode unit_mode
7116 {
7117 var_rtx
7131 }
7139 }
7141 /* Inline expansion a call to str(n)cmp, with result going to
7142 TARGET if that's convenient.
7143 If the call is not been inlined, return NULL_RTX. */
7144 static rtx
7146 {
7152 /* Do NOT apply this inlining expansion when optimizing for size or
7153 optimization level below 2. */
7161 /* On a target where the type of the call (int) has same or narrower presicion
7162 than unsigned char, give up the inlining expansion. */
7178 /* If neither strings is constant string, the call is not qualify. */
7182 /* For strncmp, if the length is not a const, not qualify. */
7184 {
7187 else
7189 }
7204 else
7213 /* If the length of the comparision is larger than the threshold,
7214 do nothing. */
7216 param_builtin_string_cmp_inline_length)
7221 /* Now, start inline expansion the call. */
7225 }
7227 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
7228 represents the size of the first argument to that call, or VOIDmode
7229 if the argument is a pointer. IGNORE will be true if the result
7230 isn't used. */
7231 static rtx
7234 {
7241 {
7244 }
7248 /* An optional second argument can be used as a failsafe value on
7249 some machines. If it isn't present, then the failsafe value is
7250 assumed to be 0. */
7252 {
7255 }
7256 else
7259 /* If the result isn't used, the behavior is undefined. It would be
7260 nice to emit a warning here, but path splitting means this might
7261 happen with legitimate code. So simply drop the builtin
7262 expansion in that case; we've handled any side-effects above. */
7266 /* If we don't have a suitable target, create one to hold the result. */
7274 }
7276 /* Expand an expression EXP that calls a built-in function,
7277 with result going to TARGET if that's convenient
7278 (and in mode MODE if that's convenient).
7279 SUBTARGET may be used as the target for computing one of EXP's operands.
7280 IGNORE is nonzero if the value is to be ignored. */
7282 rtx
7285 {
7293 /* When ASan is enabled, we don't want to expand some memory/string
7294 builtins and rely on libsanitizer's hooks. This allows us to avoid
7295 redundant checks and be sure, that possible overflow will be detected
7296 by ASan. */
7302 /* When not optimizing, generate calls to library functions for a certain
7303 set of builtins. */
7317 /* The built-in function expanders test for target == const0_rtx
7318 to determine whether the function's result will be ignored. */
7322 /* If the result of a pure or const built-in function is ignored, and
7323 none of its arguments are volatile, we can avoid expanding the
7324 built-in call and just evaluate the arguments for side-effects. */
7328 {
7330 tree arg;
7331 call_expr_arg_iterator iter;
7335 {
7338 }
7341 {
7345 }
7346 }
7349 {
7367 /* Just do a normal library call if we were unable to fold
7368 the values. */
7445 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7446 FUNCTION with a copy of the parameters described by
7447 ARGUMENTS, and ARGSIZE. It returns a block of memory
7448 allocated on the stack into which is stored all the registers
7449 that might possibly be used for returning the result of a
7450 function. ARGUMENTS is the value returned by
7451 __builtin_apply_args. ARGSIZE is the number of bytes of
7452 arguments that must be copied. ??? How should this value be
7453 computed? We'll also need a safe worst case value for varargs
7454 functions. */
7461 else
7462 {
7470 }
7472 /* __builtin_return (RESULT) causes the function to return the
7473 value described by RESULT. RESULT is address of the block of
7474 memory returned by __builtin_apply. */
7484 /* All valid uses of __builtin_va_arg_pack () are removed during
7485 inlining. */
7490 /* All valid uses of __builtin_va_arg_pack_len () are removed during
7491 inlining. */
7495 /* Return the address of the first anonymous stack arg. */
7517 /* Returns the address of the area where the structure is returned.
7518 0 otherwise. */
7524 else
7527 CASE_BUILT_IN_ALLOCA:
7677 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7678 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7679 when changing it to a strcmp call. */
7685 /* Change this call back to a BUILT_IN_STRCMP. */
7689 /* Delete the last parameter. */
7696 /* FALLTHROUGH */
7704 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7705 back to a BUILT_IN_STRNCMP. */
7711 /* Change it back to a BUILT_IN_STRNCMP. */
7714 /* FALLTHROUGH */
7729 {
7732 }
7736 /* This should have been lowered to the builtins below. */
7740 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7741 and the receiver label. */
7743 {
7749 /* This is copied from the handling of non-local gotos. */
7751 nonlocal_goto_handler_labels
7753 nonlocal_goto_handler_labels);
7754 /* ??? Do not let expand_label treat us as such since we would
7755 not want to be both on the list of non-local labels and on
7756 the list of forced labels. */
7759 }
7763 /* __builtin_setjmp_receiver is passed the receiver label. */
7765 {
7771 }
7774 /* __builtin_longjmp is passed a pointer to an array of five words.
7775 It's similar to the C library longjmp function but works with
7776 __builtin_setjmp above. */
7779 {
7785 {
7788 }
7792 }
7801 /* This updates the setjmp buffer that is its argument with the value
7802 of the current stack pointer. */
7805 {
7806 rtx buf_addr
7811 }
7831 /* Various hooks for the DWARF 2 __throw routine. */
7837 #ifdef DWARF2_UNWIND_INFO
7843 #endif
8045 mode = get_builtin_sync_mode
8057 mode = get_builtin_sync_mode
8104 {
8108 mode =
8114 /* If this is turned into an external library call, the weak parameter
8115 must be dropped to match the expected parameter list. */
8120 /* Skip the boolean weak parameter. */
8125 }
8154 {
8164 }
8170 {
8180 }
8186 {
8196 }
8202 {
8212 }
8218 {
8228 }
8234 {
8244 }
8381 /* Do library call, if we failed to expand the builtin when
8382 folding. */
8402 }
8404 /* The switch statement above can drop through to cause the function
8405 to be called normally. */
8407 }
8409 /* Determine whether a tree node represents a call to a built-in
8410 function. If the tree T is a call to a built-in function with
8411 the right number of arguments of the appropriate types, return
8412 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8413 Otherwise the return value is END_BUILTINS. */
8415 enum built_in_function
8417 {
8420 const_call_expr_arg_iterator iter;
8432 {
8433 /* If a function doesn't take a variable number of arguments,
8434 the last element in the list will have type `void'. */
8437 {
8441 }
8450 {
8453 }
8455 {
8458 }
8460 {
8463 }
8465 {
8468 }
8469 else
8471 }
8473 /* Variable-length argument list. */
8475 }
8477 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
8478 evaluate to a constant. */
8480 static tree
8482 {
8483 /* We return 1 for a numeric type that's known to be a constant
8484 value at compile-time or for an aggregate type that's a
8485 literal constant. */
8488 /* If we know this is a constant, emit the constant of one. */
8494 {
8501 }
8503 /* If this expression has side effects, show we don't know it to be a
8504 constant. Likewise if it's a pointer or aggregate type since in
8505 those case we only want literals, since those are only optimized
8506 when generating RTL, not later.
8507 And finally, if we are compiling an initializer, not code, we
8508 need to return a definite result now; there's not going to be any
8509 more optimization done. */
8514 || folding_initializer
8519 }
8521 /* Create builtin_expect or builtin_expect_with_probability
8522 with PRED and EXPECTED as its arguments and return it as a truthvalue.
8523 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
8524 builtin_expect_with_probability instead uses third argument as PROBABILITY
8525 value. */
8527 static tree
8530 {
8545 else
8547 predictor);
8551 }
8553 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
8554 NULL_TREE if no simplification is possible. */
8556 tree
8558 tree arg3)
8559 {
8563 /* Distribute the expected value over short-circuiting operators.
8564 See through the cast from truthvalue_type_node to long. */
8571 /* If this is a builtin_expect within a builtin_expect keep the
8572 inner one. See through a comparison against a constant. It
8573 might have been added to create a thruthvalue. */
8589 {
8599 }
8601 /* If the argument isn't invariant then there's nothing else we can do. */
8605 /* If we expect that a comparison against the argument will fold to
8606 a constant return the constant. In practice, this means a true
8607 constant or the address of a non-weak symbol. */
8611 {
8612 do
8613 {
8615 }
8620 }
8622 /* Otherwise, ARG0 already has the proper type for the return value. */
8624 }
8626 /* Fold a call to __builtin_classify_type with argument ARG. */
8628 static tree
8630 {
8635 }
8637 /* Fold a call to __builtin_strlen with argument ARG. */
8639 static tree
8641 {
8644 else
8645 {
8646 c_strlen_data lendata = { };
8656 {
8662 }
8665 }
8666 }
8668 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8670 static tree
8672 {
8673 REAL_VALUE_TYPE real;
8675 /* __builtin_inff is intended to be usable to define INFINITY on all
8676 targets. If an infinity is not available, INFINITY expands "to a
8677 positive constant of type float that overflows at translation
8678 time", footnote "In this case, using INFINITY will violate the
8679 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8680 Thus we pedwarn to ensure this constraint violation is
8681 diagnosed. */
8687 }
8689 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8690 NULL_TREE if no simplification can be made. */
8692 static tree
8695 {
8696 tree type;
8706 /* Calculate the result when the argument is a constant. */
8711 /* Canonicalize sincos to cexpi. */
8713 {
8716 }
8718 {
8725 }
8737 }
8739 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8740 Return NULL_TREE if no simplification can be made. */
8742 static tree
8744 {
8750 /* If the LEN parameter is zero, return zero. */
8755 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8759 /* If len parameter is one, return an expression corresponding to
8760 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8762 {
8764 tree cst_uchar_ptr_node
8767 tree ind1
8771 cst_uchar_ptr_node,
8772 arg1)));
8773 tree ind2
8777 cst_uchar_ptr_node,
8778 arg2)));
8780 }
8783 }
8785 /* Fold a call to builtin isascii with argument ARG. */
8787 static tree
8789 {
8792 else
8793 {
8794 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8800 }
8801 }
8803 /* Fold a call to builtin toascii with argument ARG. */
8805 static tree
8807 {
8811 /* Transform toascii(c) -> (c & 0x7f). */
8814 }
8816 /* Fold a call to builtin isdigit with argument ARG. */
8818 static tree
8820 {
8823 else
8824 {
8825 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8826 /* According to the C standard, isdigit is unaffected by locale.
8827 However, it definitely is affected by the target character set. */
8828 unsigned HOST_WIDE_INT target_digit0
8839 }
8840 }
8842 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8844 static tree
8846 {
8852 }
8854 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8856 static tree
8858 {
8864 }
8866 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8868 static tree
8870 {
8873 {
8877 {
8882 }
8883 }
8886 }
8888 /* Fold a call to builtin frexp, we can assume the base is 2. */
8890 static tree
8892 {
8903 /* Proceed if a valid pointer type was passed in. */
8905 {
8910 {
8912 /* For +-0, return (*exp = 0, +-0). */
8918 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8921 {
8922 /* Since the frexp function always expects base 2, and in
8923 GCC normalized significands are already in the range
8924 [0.5, 1.0), we have exactly what frexp wants. */
8929 }
8933 }
8935 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8939 }
8942 }
8944 /* Fold a call to builtin modf. */
8946 static tree
8948 {
8959 /* Proceed if a valid pointer type was passed in. */
8961 {
8966 {
8969 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8973 /* For +-Inf, return (*arg1 = arg0, +-0). */
8979 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8982 /* If the original number was negative and already
8983 integral, then the fractional part is -0.0. */
8987 }
8989 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8995 }
8998 }
9000 /* Given a location LOC, an interclass builtin function decl FNDECL
9001 and its single argument ARG, return an folded expression computing
9002 the same, or NULL_TREE if we either couldn't or didn't want to fold
9003 (the latter happen if there's an RTL instruction available). */
9005 static tree
9007 {
9008 machine_mode mode;
9020 /* If there is no optab, try generic code. */
9022 {
9023 tree result;
9026 {
9027 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
9030 REAL_VALUE_TYPE r;
9034 {
9035 /* NaN and Inf are encoded in the high-order double value
9036 only. The low-order value is not significant. */
9040 }
9047 }
9050 {
9051 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9054 REAL_VALUE_TYPE r;
9058 {
9059 /* NaN and Inf are encoded in the high-order double value
9060 only. The low-order value is not significant. */
9064 }
9070 /*result = fold_build2_loc (loc, UNGT_EXPR,
9071 TREE_TYPE (TREE_TYPE (fndecl)),
9072 fold_build1_loc (loc, ABS_EXPR, type, arg),
9073 build_real (type, r));
9074 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9075 TREE_TYPE (TREE_TYPE (fndecl)),
9076 result);*/
9078 }
9080 {
9081 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9082 islessequal(fabs(x),DBL_MAX). */
9092 {
9093 /* Use double to test the normal range of IBM extended
9094 precision. Emin for IBM extended precision is
9095 different to emin for IEEE double, being 53 higher
9096 since the low double exponent is at least 53 lower
9097 than the high double exponent. */
9101 }
9113 {
9114 /* Testing the high end of the range is done just using
9115 the high double, using the same test as isfinite().
9116 For the subnormal end of the range we first test the
9117 high double, then if its magnitude is equal to the
9118 limit of 0x1p-969, we test whether the low double is
9119 non-zero and opposite sign to the high double. */
9135 integer_type_node,
9141 }
9142 else
9143 {
9144 tree const isge_fn
9147 }
9151 }
9154 }
9157 }
9159 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9160 ARG is the argument for the call. */
9162 static tree
9164 {
9171 {
9179 {
9180 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9181 /* In a boolean context, GCC will fold the inner COND_EXPR to
9182 1. So e.g. "if (isinf_sign(x))" would be folded to just
9183 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9191 {
9204 integer_zero_node);
9205 }
9208 }
9221 {
9224 {
9225 /* NaN and Inf are encoded in the high-order double value
9226 only. The low-order value is not significant. */
9228 }
9229 }
9235 }
9236 }
9238 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9239 This builtin will generate code to return the appropriate floating
9240 point classification depending on the value of the floating point
9241 number passed in. The possible return values must be supplied as
9242 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9243 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9244 one floating point argument which is "type generic". */
9246 static tree
9248 {
9251 machine_mode mode;
9252 REAL_VALUE_TYPE r;
9255 /* Verify the required arguments in the original call. */
9275 /* fpclassify(x) ->
9276 isnan(x) ? FP_NAN :
9277 (fabs(x) == Inf ? FP_INFINITE :
9278 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9279 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9293 {
9299 }
9302 {
9305 }
9308 }
9310 /* Fold a call to an unordered comparison function such as
9311 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9312 being called and ARG0 and ARG1 are the arguments for the call.
9313 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9314 the opposite of the desired result. UNORDERED_CODE is used
9315 for modes that can hold NaNs and ORDERED_CODE is used for
9316 the rest. */
9318 static tree
9322 {
9336 /* Choose the wider of two real types. */
9348 {
9352 }
9357 }
9359 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9360 arithmetics if it can never overflow, or into internal functions that
9361 return both result of arithmetics and overflowed boolean flag in
9362 a complex integer result, or some other check for overflow.
9363 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9364 checking part of that. */
9366 static tree
9369 {
9371 /* The code of the expression corresponding to the built-in. */
9376 {
9379 /* FALLTHRU */
9392 /* FALLTHRU */
9405 /* FALLTHRU */
9418 }
9420 /* For the "generic" overloads, the first two arguments can have different
9421 types and the last argument determines the target type to use to check
9422 for overflow. The arguments of the other overloads all have the same
9423 type. */
9426 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
9427 arguments are constant, attempt to fold the built-in call into a constant
9428 expression indicating whether or not it detected an overflow. */
9432 /* Perform the computation in the target type and check for overflow. */
9436 arg2);
9440 {
9448 }
9449 else
9450 {
9458 }
9464 tree store
9467 }
9469 /* Fold a call to __builtin_FILE to a constant string. */
9473 {
9475 {
9476 /* The documentation says this builtin is equivalent to the preprocessor
9477 __FILE__ macro so it appears appropriate to use the same file prefix
9478 mappings. */
9481 }
9484 }
9486 /* Fold a call to __builtin_FUNCTION to a constant string. */
9490 {
9497 }
9499 /* Fold a call to __builtin_LINE to an integer constant. */
9503 {
9505 }
9507 /* Fold a call to built-in function FNDECL with 0 arguments.
9508 This function returns NULL_TREE if no simplification was possible. */
9510 static tree
9512 {
9516 {
9542 }
9544 }
9546 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9547 This function returns NULL_TREE if no simplification was possible. */
9549 static tree
9551 {
9562 {
9564 {
9567 /* Gimplification will pull the CALL_EXPR for the builtin out of
9568 an if condition. When not optimizing, we'll not CSE it back.
9569 To avoid link error types of regressions, return false now. */
9574 }
9630 {
9635 }
9641 {
9646 }
9667 }
9671 }
9673 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9674 This function returns NULL_TREE if no simplification was possible. */
9676 static tree
9678 {
9690 {
9734 NOP_EXPR);
9736 /* We do the folding for va_start in the expander. */
9751 }
9753 }
9755 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9756 and ARG2.
9757 This function returns NULL_TREE if no simplification was possible. */
9759 static tree
9762 {
9776 {
9825 }
9827 }
9829 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9830 arguments. IGNORE is true if the result of the
9831 function call is ignored. This function returns NULL_TREE if no
9832 simplification was possible. */
9834 tree
9836 {
9840 {
9856 }
9858 {
9862 }
9864 }
9866 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9867 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9868 of arguments in ARGS to be omitted. OLDNARGS is the number of
9869 elements in ARGS. */
9871 static tree
9874 {
9879 {
9887 }
9888 else
9892 }
9894 /* Return true if FNDECL shouldn't be folded right now.
9895 If a built-in function has an inline attribute always_inline
9896 wrapper, defer folding it after always_inline functions have
9897 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9898 might not be performed. */
9900 bool
9902 {
9905 && cfun
9908 }
9910 /* A wrapper function for builtin folding that prevents warnings for
9911 "statement without effect" and the like, caused by removing the
9912 call node earlier than the warning is generated. */
9914 tree
9916 {
9920 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9921 yet. Defer folding until we see all the arguments
9922 (after inlining). */
9924 {
9927 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9928 instead last argument is __builtin_va_arg_pack (). Defer folding
9929 even in that case, until arguments are finalized. */
9931 {
9935 }
9943 else
9944 {
9949 }
9950 }
9952 }
9954 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9955 N arguments are passed in the array ARGARRAY. Return a folded
9956 expression or NULL_TREE if no simplification was possible. */
9958 tree
9960 tree fn,
9963 {
9970 {
9971 /* If last argument is __builtin_va_arg_pack (), arguments to this
9972 function are not finalized yet. Defer folding until they are. */
9974 {
9978 }
9983 else
9985 }
9988 }
9990 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9991 along with N new arguments specified as the "..." parameters. SKIP
9992 is the number of arguments in EXP to be omitted. This function is used
9993 to do varargs-to-varargs transformations. */
9995 static tree
9997 {
9999 tree t;
10007 }
10009 /* Validate a single argument ARG against a tree code CODE representing
10010 a type. Return true when argument is valid. */
10012 static bool
10014 {
10022 }
10024 /* This function validates the types of a function call argument list
10025 against a specified list of tree_codes. If the last specifier is a 0,
10026 that represents an ellipses, otherwise the last specifier must be a
10027 VOID_TYPE.
10029 This is the GIMPLE version of validate_arglist. Eventually we want to
10030 completely convert builtins.c to work from GIMPLEs and the tree based
10031 validate_arglist will then be removed. */
10033 bool
10035 {
10039 const_tree arg;
10045 do
10046 {
10049 {
10051 /* This signifies an ellipses, any further arguments are all ok. */
10055 /* This signifies an endlink, if no arguments remain, return
10056 true, otherwise return false. */
10060 /* If no parameters remain or the parameter's code does not
10061 match the specified code, return false. Otherwise continue
10062 checking any remaining arguments. */
10067 }
10068 }
10071 /* We need gotos here since we can only have one VA_CLOSE in a
10072 function. */
10073 end: ;
10077 }
10079 /* Default target-specific builtin expander that does nothing. */
10081 rtx
10083 rtx target ATTRIBUTE_UNUSED,
10084 rtx subtarget ATTRIBUTE_UNUSED,
10085 machine_mode mode ATTRIBUTE_UNUSED,
10087 {
10089 }
10091 /* Returns true is EXP represents data that would potentially reside
10092 in a readonly section. */
10094 bool
10096 {
10106 /* Make sure we call decl_readonly_section only for trees it
10107 can handle (since it returns true for everything it doesn't
10108 understand). */
10113 else
10115 }
10117 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
10118 to the call, and TYPE is its return type.
10120 Return NULL_TREE if no simplification was possible, otherwise return the
10121 simplified form of the call as a tree.
10123 The simplified form may be a constant or other expression which
10124 computes the same value, but in a more efficient manner (including
10125 calls to other builtin functions).
10127 The call may contain arguments which need to be evaluated, but
10128 which are not useful to determine the result of the call. In
10129 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10130 COMPOUND_EXPR will be an argument which must be evaluated.
10131 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10132 COMPOUND_EXPR in the chain will contain the tree for the simplified
10133 form of the builtin function call. */
10135 static tree
10137 {
10141 else
10142 {
10143 tree fn;
10152 {
10154 tree tem;
10159 /* Return an offset into the constant string argument. */
10162 }
10165 /* strpbrk(x, "") == NULL.
10166 Evaluate and ignore s1 in case it had side-effects. */
10176 /* New argument list transforming strpbrk(s1, s2) to
10177 strchr(s1, s2[0]). */
10180 }
10181 }
10183 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
10184 to the call.
10186 Return NULL_TREE if no simplification was possible, otherwise return the
10187 simplified form of the call as a tree.
10189 The simplified form may be a constant or other expression which
10190 computes the same value, but in a more efficient manner (including
10191 calls to other builtin functions).
10193 The call may contain arguments which need to be evaluated, but
10194 which are not useful to determine the result of the call. In
10195 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10196 COMPOUND_EXPR will be an argument which must be evaluated.
10197 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10198 COMPOUND_EXPR in the chain will contain the tree for the simplified
10199 form of the builtin function call. */
10201 static tree
10203 {
10207 else
10208 {
10211 /* If either argument is "", return NULL_TREE. */
10213 /* Evaluate and ignore both arguments in case either one has
10214 side-effects. */
10218 }
10219 }
10221 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
10222 to the call.
10224 Return NULL_TREE if no simplification was possible, otherwise return the
10225 simplified form of the call as a tree.
10227 The simplified form may be a constant or other expression which
10228 computes the same value, but in a more efficient manner (including
10229 calls to other builtin functions).
10231 The call may contain arguments which need to be evaluated, but
10232 which are not useful to determine the result of the call. In
10233 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10234 COMPOUND_EXPR will be an argument which must be evaluated.
10235 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10236 COMPOUND_EXPR in the chain will contain the tree for the simplified
10237 form of the builtin function call. */
10239 static tree
10241 {
10245 else
10246 {
10247 /* If the first argument is "", return NULL_TREE. */
10250 {
10251 /* Evaluate and ignore argument s2 in case it has
10252 side-effects. */
10255 }
10257 /* If the second argument is "", return __builtin_strlen(s1). */
10260 {
10263 /* If the replacement _DECL isn't initialized, don't do the
10264 transformation. */
10269 }
10271 }
10272 }
10274 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
10275 produced. False otherwise. This is done so that we don't output the error
10276 or warning twice or three times. */
10278 bool
10280 {
10283 tree arg;
10284 /* There is good chance the current input_location points inside the
10285 definition of the va_start macro (perhaps on the token for
10286 builtin) in a system header, so warnings will not be emitted.
10287 Use the location in real source code. */
10288 location_t current_location =
10290 NULL);
10293 {
10296 }
10299 {
10301 {
10304 }
10306 }
10307 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
10308 when we checked the arguments and if needed issued a warning. */
10309 else
10310 {
10312 {
10313 /* Evidently an out of date version of <stdarg.h>; can't validate
10314 va_start's second argument, but can still work as intended. */
10316 OPT_Wvarargs,
10319 }
10321 {
10324 }
10326 }
10331 /* We destructively modify the call to be __builtin_va_start (ap, 0)
10332 or __builtin_next_arg (0) the first time we see it, after checking
10333 the arguments and if needed issuing a warning. */
10335 {
10338 /* Strip off all nops for the sake of the comparison. This
10339 is not quite the same as STRIP_NOPS. It does more.
10340 We must also strip off INDIRECT_EXPR for C++ reference
10341 parameters. */
10346 {
10347 /* FIXME: Sometimes with the tree optimizers we can get the
10348 not the last argument even though the user used the last
10349 argument. We just warn and set the arg to be the last
10350 argument so that we will get wrong-code because of
10351 it. */
10353 OPT_Wvarargs,
10355 }
10357 /* Undefined by C99 7.15.1.4p4 (va_start):
10358 "If the parameter parmN is declared with the register storage
10359 class, with a function or array type, or with a type that is
10360 not compatible with the type that results after application of
10361 the default argument promotions, the behavior is undefined."
10362 */
10364 {
10366 OPT_Wvarargs,
10367 "undefined behavior when second parameter of "
10369 }
10371 /* We want to verify the second parameter just once before the tree
10372 optimizers are run and then avoid keeping it in the tree,
10373 as otherwise we could warn even for correct code like:
10374 void foo (int i, ...)
10375 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
10378 else
10380 }
10382 }
10385 /* Expand a call EXP to __builtin_object_size. */
10387 static rtx
10389 {
10390 tree ost;
10395 {
10400 }
10408 {
10413 }
10418 }
10420 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10421 FCODE is the BUILT_IN_* to use.
10422 Return NULL_RTX if we failed; the caller should emit a normal call,
10423 otherwise try to get the result in TARGET, if convenient (and in
10424 mode MODE if that's convenient). */
10426 static rtx
10429 {
10431 POINTER_TYPE,
10432 fcode == BUILT_IN_MEMSET_CHK
10449 {
10450 /* Avoid transforming the checking call to an ordinary one when
10451 an overflow has been detected or when the call couldn't be
10452 validated because the size is not constant. */
10457 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10458 mem{cpy,pcpy,move,set} is available. */
10460 {
10475 }
10484 }
10487 else
10488 {
10491 /* If DEST is not a pointer type, call the normal function. */
10495 /* If SRC and DEST are the same (and not volatile), do nothing. */
10497 {
10498 tree expr;
10501 {
10502 /* Evaluate and ignore LEN in case it has side-effects. */
10505 }
10509 }
10511 /* __memmove_chk special case. */
10513 {
10519 /* If src is categorized for a readonly section we can use
10520 normal __memcpy_chk. */
10522 {
10531 }
10532 }
10534 }
10535 }
10537 /* Emit warning if a buffer overflow is detected at compile time. */
10539 static void
10541 {
10542 /* The source string. */
10544 /* The size of the destination object. */
10546 /* The string that is being concatenated with (as in __strcat_chk)
10547 or null if it isn't. */
10549 /* The maximum length of the source sequence in a bounded operation
10550 (such as __strncat_chk) or null if the operation isn't bounded
10551 (such as __strcat_chk). */
10553 /* The exact size of the access (such as in __strncpy_chk). */
10557 {
10565 /* For __strcat_chk the warning will be emitted only if overflowing
10566 by at least strlen (dest) + 1 bytes. */
10593 }
10596 {
10597 /* Check __strncat_chk. There is no way to determine the length
10598 of the string to which the source string is being appended so
10599 just warn when the length of the source string is not known. */
10602 }
10604 /* The destination argument is the first one for all built-ins above. */
10608 }
10610 /* Emit warning if a buffer overflow is detected at compile time
10611 in __sprintf_chk/__vsprintf_chk calls. */
10613 static void
10615 {
10620 /* Verify the required arguments in the original call. */
10630 /* Check whether the format is a literal string constant. */
10638 /* If the format doesn't contain % args or %%, we know its size. */
10641 /* If the format is "%s" and first ... argument is a string literal,
10642 we know it too. */
10645 {
10646 tree arg;
10657 }
10658 else
10661 /* Add one for the terminating nul. */
10666 }
10668 /* Emit warning if a free is called with address of a variable. */
10670 static void
10672 {
10689 else
10692 }
10694 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10695 if possible. */
10697 static tree
10699 {
10716 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10717 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10718 and (size_t) 0 for types 2 and 3. */
10723 {
10727 }
10729 {
10730 /* If object size is not known yet, delay folding until
10731 later. Maybe subsequent passes will help determining
10732 it. */
10736 }
10739 }
10741 /* Builtins with folding operations that operate on "..." arguments
10742 need special handling; we need to store the arguments in a convenient
10743 data structure before attempting any folding. Fortunately there are
10744 only a few builtins that fall into this category. FNDECL is the
10745 function, EXP is the CALL_EXPR for the call. */
10747 static tree
10749 {
10754 {
10761 }
10763 {
10768 }
10770 }
10772 /* Initialize format string characters in the target charset. */
10774 bool
10776 {
10779 {
10802 }
10804 }
10806 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10807 and no overflow/underflow occurred. INEXACT is true if M was not
10808 exactly calculated. TYPE is the tree type for the result. This
10809 function assumes that you cleared the MPFR flags and then
10810 calculated M to see if anything subsequently set a flag prior to
10811 entering this function. Return NULL_TREE if any checks fail. */
10813 static tree
10815 {
10816 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10817 overflow/underflow occurred. If -frounding-math, proceed iff the
10818 result of calling FUNC was exact. */
10821 {
10822 REAL_VALUE_TYPE rr;
10825 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10826 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10827 but the mpft_t is not, then we underflowed in the
10828 conversion. */
10831 {
10832 REAL_VALUE_TYPE rmode;
10835 /* Proceed iff the specified mode can hold the value. */
10838 }
10839 }
10841 }
10843 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10844 number and no overflow/underflow occurred. INEXACT is true if M
10845 was not exactly calculated. TYPE is the tree type for the result.
10846 This function assumes that you cleared the MPFR flags and then
10847 calculated M to see if anything subsequently set a flag prior to
10848 entering this function. Return NULL_TREE if any checks fail, if
10849 FORCE_CONVERT is true, then bypass the checks. */
10851 static tree
10853 {
10854 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10855 overflow/underflow occurred. If -frounding-math, proceed iff the
10856 result of calling FUNC was exact. */
10861 {
10866 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10867 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10868 but the mpft_t is not, then we underflowed in the
10869 conversion. */
10874 {
10879 /* Proceed iff the specified mode can hold the value. */
10885 }
10886 }
10888 }
10890 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10891 the pointer *(ARG_QUO) and return the result. The type is taken
10892 from the type of ARG0 and is used for setting the precision of the
10893 calculation and results. */
10895 static tree
10897 {
10904 /* To proceed, MPFR must exactly represent the target floating point
10905 format, which only happens when the target base equals two. */
10909 {
10914 {
10918 tree result_rem;
10927 /* Remquo is independent of the rounding mode, so pass
10928 inexact=0 to do_mpfr_ckconv(). */
10932 {
10933 /* MPFR calculates quo in the host's long so it may
10934 return more bits in quo than the target int can hold
10935 if sizeof(host long) > sizeof(target int). This can
10936 happen even for native compilers in LP64 mode. In
10937 these cases, modulo the quo value with the largest
10938 number that the target int can hold while leaving one
10939 bit for the sign. */
10943 /* Dereference the quo pointer argument. */
10945 /* Proceed iff a valid pointer type was passed in. */
10947 {
10948 /* Set the value. */
10949 tree result_quo
10952 integer_quo));
10954 /* Combine the quo assignment with the rem. */
10957 }
10958 }
10959 }
10960 }
10962 }
10964 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10965 resulting value as a tree with type TYPE. The mpfr precision is
10966 set to the precision of TYPE. We assume that this mpfr function
10967 returns zero if the result could be calculated exactly within the
10968 requested precision. In addition, the integer pointer represented
10969 by ARG_SG will be dereferenced and set to the appropriate signgam
10970 (-1,1) value. */
10972 static tree
10974 {
10979 /* To proceed, MPFR must exactly represent the target floating point
10980 format, which only happens when the target base equals two. Also
10981 verify ARG is a constant and that ARG_SG is an int pointer. */
10986 {
10989 /* In addition to NaN and Inf, the argument cannot be zero or a
10990 negative integer. */
10994 {
10999 mpfr_t m;
11000 tree result_lg;
11009 {
11010 tree result_sg;
11012 /* Dereference the arg_sg pointer argument. */
11014 /* Assign the signgam value into *arg_sg. */
11019 /* Combine the signgam assignment with the lgamma result. */
11022 }
11023 }
11024 }
11027 }
11029 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
11030 mpc function FUNC on it and return the resulting value as a tree
11031 with type TYPE. The mpfr precision is set to the precision of
11032 TYPE. We assume that function FUNC returns zero if the result
11033 could be calculated exactly within the requested precision. If
11034 DO_NONFINITE is true, then fold expressions containing Inf or NaN
11035 in the arguments and/or results. */
11037 tree
11040 {
11046 /* To proceed, MPFR must exactly represent the target floating point
11047 format, which only happens when the target base equals two. */
11053 {
11062 {
11082 }
11083 }
11086 }
11088 /* A wrapper function for builtin folding that prevents warnings for
11089 "statement without effect" and the like, caused by removing the
11090 call node earlier than the warning is generated. */
11092 tree
11094 {
11100 {
11109 {
11111 }
11112 else
11113 {
11116 {
11117 /* Propagate location information from original call to
11118 expansion of builtin. Otherwise things like
11119 maybe_emit_chk_warning, that operate on the expansion
11120 of a builtin, will use the wrong location information. */
11122 {
11130 }
11132 }
11133 }
11134 }
11136 }
11138 /* Look up the function in builtin_decl that corresponds to DECL
11139 and set ASMSPEC as its user assembler name. DECL must be a
11140 function decl that declares a builtin. */
11142 void
11144 {
11153 {
11157 }
11158 }
11160 /* Return true if DECL is a builtin that expands to a constant or similarly
11161 simple code. */
11162 bool
11164 {
11167 {
11168 /* Builtins that expand to constants. */
11173 /* Simple register moves or loads from stack. */
11184 /* Exception state returns or moves registers around. */
11192 }
11195 }
11197 /* Return true if DECL is a builtin that is not expensive, i.e., they are
11198 most probably expanded inline into reasonably simple code. This is a
11199 superset of is_simple_builtin. */
11200 bool
11202 {
11209 {
11211 CASE_BUILT_IN_ALLOCA:
11277 }
11280 }
11282 /* Return true if T is a constant and the value cast to a target char
11283 can be represented by a host char.
11284 Store the casted char constant in *P if so. */
11286 bool
11288 {
11294 }
11296 /* Return true if the builtin DECL is implemented in a standard library.
11297 Otherwise returns false which doesn't guarantee it is not (thus the list of
11298 handled builtins below may be incomplete). */
11300 bool
11302 {
11305 {
11379 }
11381 }