| blob | f8063c138a340a06d45b01c9bb7f43caf75e78b2 |
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. */
78 #if SWITCHABLE_TARGET
80 #endif
82 /* Define the names of the builtin function types and codes. */
86 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
88 {
90 };
92 /* Setup an array of builtin_info_type, make sure each element decl is
93 initialized to NULL_TREE. */
96 /* Non-zero if __builtin_constant_p should be folded right away. */
130 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 /* Determines the size of the member referenced by the COMPONENT_REF
3566 REF, using its initializer expression if necessary in order to
3567 determine the size of an initialized flexible array member.
3568 Returns the size (which might be zero for an object with
3569 an uninitialized flexible array member) or null if the size
3570 cannot be determined. */
3572 static tree
3574 {
3579 /* If the member is not last or has a size greater than one, return
3580 it. Otherwise it's either a flexible array member or a zero-length
3581 array member, or an array of length one treated as such. */
3589 /* If the reference is to a declared object and the member a true
3590 flexible array, try to determine its size from its initializer. */
3596 /* The size of any member of a declared object other than a flexible
3597 array member is that obtained above. */
3603 {
3608 }
3611 }
3613 /* Helper to compute the size of the object referenced by the DEST
3614 expression which must have pointer type, using Object Size type
3615 OSTYPE (only the least significant 2 bits are used). Return
3616 an estimate of the size of the object if successful or NULL when
3617 the size cannot be determined. When the referenced object involves
3618 a non-constant offset in some range the returned value represents
3619 the largest size given the smallest non-negative offset in the
3620 range. If nonnull, set *PDECL to the decl of the referenced
3621 subobject if it can be determined, or to null otherwise.
3622 The function is intended for diagnostics and should not be used
3623 to influence code generation or optimization. */
3625 tree
3627 {
3634 /* Only the two least significant bits are meaningful. */
3641 {
3650 {
3651 /* compute_builtin_object_size fails for addresses with
3652 non-constant offsets. Try to determine the range of
3653 such an offset here and use it to adjust the constant
3654 size. */
3657 {
3659 {
3663 /* Ignore negative offsets for now. For others,
3664 use the lower bound as the most optimistic
3665 estimate of the (remaining) size. */
3667 ;
3671 else
3673 }
3674 }
3677 {
3682 {
3684 {
3687 /* Ignore negative offsets for now. For others,
3688 use the lower bound as the most optimistic
3689 estimate of the (remaining)size. */
3692 ;
3696 else
3698 }
3699 }
3700 }
3701 }
3704 }
3706 /* Unless computing the largest size (for memcpy and other raw memory
3707 functions), try to determine the size of the object from its type. */
3713 {
3717 {
3718 /* If the declaration of the destination object is known
3719 to have zero size, return zero. */
3728 {
3732 else
3734 }
3739 }
3742 }
3745 {
3748 }
3755 {
3758 }
3768 {
3771 }
3774 }
3776 /* Helper to determine and check the sizes of the source and the destination
3777 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3778 call expression, DEST is the destination argument, SRC is the source
3779 argument or null, and LEN is the number of bytes. Use Object Size type-0
3780 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3781 (no overflow or invalid sizes), false otherwise. */
3783 static bool
3785 {
3786 /* For functions like memset and memcpy that operate on raw memory
3787 try to determine the size of the largest source and destination
3788 object using type-0 Object Size regardless of the object size
3789 type specified by the option. */
3795 }
3797 /* Validate memchr arguments without performing any expansion.
3798 Return NULL_RTX. */
3800 static rtx
3802 {
3810 /* Diagnose calls where the specified length exceeds the size
3811 of the object. */
3813 {
3817 }
3820 }
3822 /* Expand a call EXP to the memcpy builtin.
3823 Return NULL_RTX if we failed, the caller should emit a normal call,
3824 otherwise try to get the result in TARGET, if convenient (and in
3825 mode MODE if that's convenient). */
3827 static rtx
3829 {
3842 }
3844 /* Check a call EXP to the memmove built-in for validity.
3845 Return NULL_RTX on both success and failure. */
3847 static rtx
3849 {
3861 }
3863 /* Expand a call EXP to the mempcpy builtin.
3864 Return NULL_RTX if we failed; the caller should emit a normal call,
3865 otherwise try to get the result in TARGET, if convenient (and in
3866 mode MODE if that's convenient). */
3868 static rtx
3870 {
3879 /* Policy does not generally allow using compute_objsize (which
3880 is used internally by check_memop_size) to change code generation
3881 or drive optimization decisions.
3883 In this instance it is safe because the code we generate has
3884 the same semantics regardless of the return value of
3885 check_memop_sizes. Exactly the same amount of data is copied
3886 and the return value is exactly the same in both cases.
3888 Furthermore, check_memop_size always uses mode 0 for the call to
3889 compute_objsize, so the imprecise nature of compute_objsize is
3890 avoided. */
3892 /* Avoid expanding mempcpy into memcpy when the call is determined
3893 to overflow the buffer. This also prevents the same overflow
3894 from being diagnosed again when expanding memcpy. */
3900 }
3902 /* Helper function to do the actual work for expand of memory copy family
3903 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3904 of memory from SRC to DEST and assign to TARGET if convenient. Return
3905 value is based on RETMODE argument. */
3907 static rtx
3910 {
3923 /* If DEST is not a pointer type, call the normal function. */
3927 /* If either SRC is not a pointer type, don't do this
3928 operation in-line. */
3945 /* If SRC is a string constant and block move would be done
3946 by pieces, we can avoid loading the string from memory
3947 and only stored the computed constants. */
3954 {
3956 builtin_memcpy_read_str,
3962 }
3967 /* Copy word part most expediently. */
3982 /* Bail out when a mempcpy call would be expanded as libcall and when
3983 we have a target that provides a fast implementation
3984 of mempcpy routine. */
3992 {
3995 }
3998 {
4000 /* stpcpy pointer to last byte. */
4003 }
4006 }
4008 static rtx
4011 {
4013 retmode);
4014 }
4016 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
4017 we failed, the caller should emit a normal call, otherwise try to
4018 get the result in TARGET, if convenient.
4019 Return value is based on RETMODE argument. */
4021 static rtx
4023 {
4025 rtx dest_mem;
4026 rtx src_mem;
4034 {
4037 }
4047 {
4049 /* movstr is supposed to set end to the address of the NUL
4050 terminator. If the caller requested a mempcpy-like return value,
4051 adjust it. */
4053 {
4057 }
4058 }
4060 }
4062 /* Do some very basic size validation of a call to the strcpy builtin
4063 given by EXP. Return NULL_RTX to have the built-in expand to a call
4064 to the library function. */
4066 static rtx
4068 {
4076 /* There is no way here to determine the length of the string in
4077 the destination to which the SRC string is being appended so
4078 just diagnose cases when the souce string is longer than
4079 the destination object. */
4084 destsize);
4087 }
4089 /* Expand expression EXP, which is a call to the strcpy builtin. Return
4090 NULL_RTX if we failed the caller should emit a normal call, otherwise
4091 try to get the result in TARGET, if convenient (and in mode MODE if that's
4092 convenient). */
4094 static rtx
4096 {
4104 {
4108 }
4111 {
4112 /* Check to see if the argument was declared attribute nonstring
4113 and if so, issue a warning since at this point it's not known
4114 to be nul-terminated. */
4118 }
4121 }
4123 /* Helper function to do the actual work for expand_builtin_strcpy. The
4124 arguments to the builtin_strcpy call DEST and SRC are broken out
4125 so that this can also be called without constructing an actual CALL_EXPR.
4126 The other arguments and return value are the same as for
4127 expand_builtin_strcpy. */
4129 static rtx
4131 {
4132 /* Detect strcpy calls with unterminated arrays.. */
4134 {
4135 /* NONSTR refers to the non-nul terminated constant array. */
4139 }
4142 }
4144 /* Expand a call EXP to the stpcpy builtin.
4145 Return NULL_RTX if we failed the caller should emit a normal call,
4146 otherwise try to get the result in TARGET, if convenient (and in
4147 mode MODE if that's convenient). */
4149 static rtx
4151 {
4162 {
4166 }
4168 /* If return value is ignored, transform stpcpy into strcpy. */
4170 {
4174 }
4175 else
4176 {
4178 rtx ret;
4180 /* Ensure we get an actual string whose length can be evaluated at
4181 compile-time, not an expression containing a string. This is
4182 because the latter will potentially produce pessimized code
4183 when used to produce the return value. */
4184 c_strlen_data lendata = { };
4202 {
4206 {
4210 {
4212 {
4215 else
4217 }
4226 }
4227 }
4228 }
4232 }
4233 }
4235 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
4236 arguments while being careful to avoid duplicate warnings (which could
4237 be issued if the expander were to expand the call, resulting in it
4238 being emitted in expand_call(). */
4240 static rtx
4242 {
4244 {
4245 /* The call has been successfully expanded. Check for nonstring
4246 arguments and issue warnings as appropriate. */
4249 }
4252 }
4254 /* Check a call EXP to the stpncpy built-in for validity.
4255 Return NULL_RTX on both success and failure. */
4257 static rtx
4259 {
4265 /* The source and destination of the call. */
4269 /* The exact number of bytes to write (not the maximum). */
4272 /* The size of the destination object. */
4278 }
4280 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4281 bytes from constant string DATA + OFFSET and return it as target
4282 constant. */
4284 rtx
4286 scalar_int_mode mode)
4287 {
4294 }
4296 /* Helper to check the sizes of sequences and the destination of calls
4297 to __builtin_strncat and __builtin___strncat_chk. Returns true on
4298 success (no overflow or invalid sizes), false otherwise. */
4300 static bool
4302 {
4307 /* Try to determine the range of lengths that the source expression
4308 refers to. */
4309 c_strlen_data lendata = { };
4312 /* Try to verify that the destination is big enough for the shortest
4313 string. */
4316 {
4317 /* If it hasn't been provided by __strncat_chk, try to determine
4318 the size of the destination object into which the source is
4319 being copied. */
4321 }
4323 /* Add one for the terminating nul. */
4326 size_one_node)
4329 /* The strncat function copies at most MAXREAD bytes and always appends
4330 the terminating nul so the specified upper bound should never be equal
4331 to (or greater than) the size of the destination. */
4334 {
4343 }
4351 /* The number of bytes to write is LEN but check_access will also
4352 check SRCLEN if LEN's value isn't known. */
4354 objsize);
4355 }
4357 /* Similar to expand_builtin_strcat, do some very basic size validation
4358 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4359 the built-in expand to a call to the library function. */
4361 static rtx
4363 {
4371 /* The upper bound on the number of bytes to write. */
4373 /* The length of the source sequence. */
4376 /* Try to determine the range of lengths that the source expression
4377 refers to. Since the lengths are only used for warning and not
4378 for code generation disable strict mode below. */
4381 {
4382 c_strlen_data lendata = { };
4385 }
4387 /* Try to verify that the destination is big enough for the shortest
4388 string. First try to determine the size of the destination object
4389 into which the source is being copied. */
4392 /* Add one for the terminating nul. */
4393 tree srclen = (maxlen
4395 size_one_node)
4398 /* The strncat function copies at most MAXREAD bytes and always appends
4399 the terminating nul so the specified upper bound should never be equal
4400 to (or greater than) the size of the destination. */
4403 {
4412 }
4420 /* The number of bytes to write is SRCLEN. */
4424 }
4426 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4427 NULL_RTX if we failed the caller should emit a normal call. */
4429 static rtx
4431 {
4436 {
4439 /* The number of bytes to write (not the maximum). */
4441 /* The length of the source sequence. */
4445 {
4449 /* The number of bytes to write is LEN but check_access will also
4450 check SLEN if LEN's value isn't known. */
4452 destsize);
4453 }
4455 /* We must be passed a constant len and src parameter. */
4461 /* We're required to pad with trailing zeros if the requested
4462 len is greater than strlen(s2)+1. In that case try to
4463 use store_by_pieces, if it fails, punt. */
4465 {
4468 rtx dest_mem;
4472 builtin_strncpy_read_str,
4479 builtin_strncpy_read_str,
4481 RETURN_BEGIN);
4485 }
4486 }
4488 }
4490 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4491 bytes from constant string DATA + OFFSET and return it as target
4492 constant. */
4494 rtx
4496 scalar_int_mode mode)
4497 {
4504 }
4506 /* Callback routine for store_by_pieces. Return the RTL of a register
4507 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4508 char value given in the RTL register data. For example, if mode is
4509 4 bytes wide, return the RTL for 0x01010101*data. */
4511 static rtx
4513 scalar_int_mode mode)
4514 {
4530 }
4532 /* Expand expression EXP, which is a call to the memset builtin. Return
4533 NULL_RTX if we failed the caller should emit a normal call, otherwise
4534 try to get the result in TARGET, if convenient (and in mode MODE if that's
4535 convenient). */
4537 static rtx
4539 {
4551 }
4553 /* Helper function to do the actual work for expand_builtin_memset. The
4554 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4555 so that this can also be called without constructing an actual CALL_EXPR.
4556 The other arguments and return value are the same as for
4557 expand_builtin_memset. */
4559 static rtx
4562 {
4565 machine_mode val_mode;
4577 /* If DEST is not a pointer type, don't do this operation in-line. */
4588 /* If the LEN parameter is zero, return DEST. */
4590 {
4591 /* Evaluate and ignore VAL in case it has side-effects. */
4594 }
4596 /* Stabilize the arguments in case we fail. */
4608 {
4609 rtx val_rtx;
4614 /* Assume that we can memset by pieces if we can store
4615 * the coefficients by pieces (in the required modes).
4616 * We can't pass builtin_memset_gen_str as that emits RTL. */
4622 {
4627 }
4631 probable_max_size))
4637 }
4643 {
4650 RETURN_BEGIN);
4655 probable_max_size))
4661 }
4669 probable_max_size);
4672 {
4675 }
4679 do_libcall:
4688 else
4693 }
4695 /* Expand expression EXP, which is a call to the bzero builtin. Return
4696 NULL_RTX if we failed the caller should emit a normal call. */
4698 static rtx
4700 {
4709 /* New argument list transforming bzero(ptr x, int y) to
4710 memset(ptr x, int 0, size_t y). This is done this way
4711 so that if it isn't expanded inline, we fallback to
4712 calling bzero instead of memset. */
4720 }
4722 /* Try to expand cmpstr operation ICODE with the given operands.
4723 Return the result rtx on success, otherwise return null. */
4725 static rtx
4727 HOST_WIDE_INT align)
4728 {
4742 }
4744 /* Expand expression EXP, which is a call to the memcmp built-in function.
4745 Return NULL_RTX if we failed and the caller should emit a normal call,
4746 otherwise try to get the result in TARGET, if convenient.
4747 RESULT_EQ is true if we can relax the returned value to be either zero
4748 or nonzero, without caring about the sign. */
4750 static rtx
4752 {
4763 /* Diagnose calls where the specified length exceeds the size of either
4764 object. */
4770 {
4775 }
4777 /* If the specified length exceeds the size of either object,
4778 call the function. */
4782 /* Due to the performance benefit, always inline the calls first
4783 when result_eq is false. */
4787 {
4791 }
4799 /* If we don't have POINTER_TYPE, call the function. */
4807 /* Set MEM_SIZE as appropriate. */
4809 {
4812 }
4818 {
4822 }
4824 /* If SRC is a string constant and block move would be done
4825 by pieces, we can avoid loading the string from memory
4826 and only stored the computed constants. */
4838 {
4839 /* Return the value in the proper mode for this function. */
4844 {
4847 }
4850 }
4853 }
4855 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4856 if we failed the caller should emit a normal call, otherwise try to get
4857 the result in TARGET, if convenient. */
4859 static rtx
4861 {
4865 /* Due to the performance benefit, always inline the calls first. */
4882 /* If we don't have POINTER_TYPE, call the function. */
4886 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4893 /* Try to call cmpstrsi. */
4898 /* Try to determine at least one length and call cmpstrnsi. */
4900 {
4901 tree len;
4902 rtx arg3_rtx;
4912 /* If we don't have a constant length for the first, use the length
4913 of the second, if we know it. We don't require a constant for
4914 this case; some cost analysis could be done if both are available
4915 but neither is constant. For now, assume they're equally cheap,
4916 unless one has side effects. If both strings have constant lengths,
4917 use the smaller. */
4933 else
4936 /* If both arguments have side effects, we cannot optimize. */
4938 {
4940 result = expand_cmpstrn_or_cmpmem
4943 }
4944 }
4948 {
4949 /* Check to see if the argument was declared attribute nonstring
4950 and if so, issue a warning since at this point it's not known
4951 to be nul-terminated. */
4954 /* Return the value in the proper mode for this function. */
4962 }
4964 /* Expand the library call ourselves using a stabilized argument
4965 list to avoid re-evaluating the function's arguments twice. */
4970 }
4972 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4973 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4974 the result in TARGET, if convenient. */
4976 static rtx
4978 ATTRIBUTE_UNUSED machine_mode mode)
4979 {
4984 /* Due to the performance benefit, always inline the calls first. */
4990 /* If c_strlen can determine an expression for one of the string
4991 lengths, and it doesn't have side effects, then emit cmpstrnsi
4992 using length MIN(strlen(string)+1, arg3). */
4997 tree len;
5018 /* If we don't have a constant length for the first, use the length
5019 of the second, if we know it. If neither string is constant length,
5020 use the given length argument. We don't require a constant for
5021 this case; some cost analysis could be done if both are available
5022 but neither is constant. For now, assume they're equally cheap,
5023 unless one has side effects. If both strings have constant lengths,
5024 use the smaller. */
5042 else
5045 /* If we are not using the given length, we must incorporate it here.
5046 The actual new length parameter will be MIN(len,arg3) in this case. */
5048 {
5051 }
5061 {
5062 /* Check to see if the argument was declared attribute nonstring
5063 and if so, issue a warning since at this point it's not known
5064 to be nul-terminated. */
5067 /* Return the value in the proper mode for this function. */
5075 }
5077 /* Expand the library call ourselves using a stabilized argument
5078 list to avoid re-evaluating the function's arguments twice. */
5083 }
5085 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
5086 if that's convenient. */
5088 rtx
5090 {
5091 rtx val;
5094 /* Don't do __builtin_saveregs more than once in a function.
5095 Save the result of the first call and reuse it. */
5099 /* When this function is called, it means that registers must be
5100 saved on entry to this function. So we migrate the call to the
5101 first insn of this function. */
5105 /* Do whatever the machine needs done in this case. */
5113 /* Put the insns after the NOTE that starts the function. If this
5114 is inside a start_sequence, make the outer-level insn chain current, so
5115 the code is placed at the start of the function. */
5121 }
5123 /* Expand a call to __builtin_next_arg. */
5125 static rtx
5127 {
5128 /* Checking arguments is already done in fold_builtin_next_arg
5129 that must be called before this function. */
5134 }
5136 /* Make it easier for the backends by protecting the valist argument
5137 from multiple evaluations. */
5139 static tree
5141 {
5144 /* The current way of determining the type of valist is completely
5145 bogus. We should have the information on the va builtin instead. */
5150 {
5154 /* For this case, the backends will be expecting a pointer to
5155 vatype, but it's possible we've actually been given an array
5156 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
5157 So fix it. */
5159 {
5162 }
5163 }
5164 else
5165 {
5169 {
5175 }
5181 }
5184 }
5186 /* The "standard" definition of va_list is void*. */
5188 tree
5190 {
5192 }
5194 /* The "standard" abi va_list is va_list_type_node. */
5196 tree
5198 {
5200 }
5202 /* The "standard" type of va_list is va_list_type_node. */
5204 tree
5206 {
5213 {
5214 /* If va_list is an array type, the argument may have decayed
5215 to a pointer type, e.g. by being passed to another function.
5216 In that case, unwrap both types so that we can compare the
5217 underlying records. */
5220 {
5223 }
5224 }
5229 }
5231 /* The "standard" implementation of va_start: just assign `nextarg' to
5232 the variable. */
5234 void
5236 {
5239 }
5241 /* Expand EXP, a call to __builtin_va_start. */
5243 static rtx
5245 {
5246 rtx nextarg;
5247 tree valist;
5251 {
5254 }
5264 else
5268 }
5270 /* Expand EXP, a call to __builtin_va_end. */
5272 static rtx
5274 {
5277 /* Evaluate for side effects, if needed. I hate macros that don't
5278 do that. */
5283 }
5285 /* Expand EXP, a call to __builtin_va_copy. We do this as a
5286 builtin rather than just as an assignment in stdarg.h because of the
5287 nastiness of array-type va_list types. */
5289 static rtx
5291 {
5304 {
5308 }
5309 else
5310 {
5313 /* Evaluate to pointers. */
5322 /* "Dereference" to BLKmode memories. */
5330 /* Copy. */
5332 }
5335 }
5337 /* Expand a call to one of the builtin functions __builtin_frame_address or
5338 __builtin_return_address. */
5340 static rtx
5342 {
5343 /* The argument must be a nonnegative integer constant.
5344 It counts the number of frames to scan up the stack.
5345 The value is either the frame pointer value or the return
5346 address saved in that frame. */
5348 /* Warning about missing arg was already issued. */
5351 {
5354 }
5355 else
5356 {
5357 /* Number of frames to scan up the stack. */
5362 /* Some ports cannot access arbitrary stack frames. */
5364 {
5367 }
5370 {
5371 /* Warn since no effort is made to ensure that any frame
5372 beyond the current one exists or can be safely reached. */
5375 }
5377 /* For __builtin_frame_address, return what we've got. */
5385 }
5386 }
5388 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5389 failed and the caller should emit a normal call. */
5391 static rtx
5393 {
5394 rtx op0;
5395 rtx result;
5398 HOST_WIDE_INT max_size;
5401 bool valid_arglist
5404 VOID_TYPE)
5415 || (!alloca_for_var
5418 ))
5419 {
5420 /* -Walloca-larger-than and -Wvla-larger-than settings of
5421 less than HOST_WIDE_INT_MAX override the more general
5422 -Walloc-size-larger-than so unless either of the former
5423 options is smaller than the last one (wchich would imply
5424 that the call was already checked), check the alloca
5425 arguments for overflow. */
5429 }
5431 /* Compute the argument. */
5434 /* Compute the alignment. */
5436 ? BIGGEST_ALIGNMENT
5439 /* Compute the maximum size. */
5444 /* Allocate the desired space. If the allocation stems from the declaration
5445 of a variable-sized object, it cannot accumulate. */
5446 result
5451 }
5453 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5454 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5455 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5456 handle_builtin_stack_restore function. */
5458 static rtx
5460 {
5467 OPTAB_LIB_WIDEN);
5470 OPTAB_LIB_WIDEN);
5475 }
5477 /* Expand a call to bswap builtin in EXP.
5478 Return NULL_RTX if a normal call should be emitted rather than expanding the
5479 function in-line. If convenient, the result should be placed in TARGET.
5480 SUBTARGET may be used as the target for computing one of EXP's operands. */
5482 static rtx
5484 rtx subtarget)
5485 {
5486 tree arg;
5487 rtx op0;
5505 }
5507 /* Expand a call to a unary builtin in EXP.
5508 Return NULL_RTX if a normal call should be emitted rather than expanding the
5509 function in-line. If convenient, the result should be placed in TARGET.
5510 SUBTARGET may be used as the target for computing one of EXP's operands. */
5512 static rtx
5515 {
5516 rtx op0;
5521 /* Compute the argument. */
5523 (subtarget
5527 /* Compute op, into TARGET if possible.
5528 Set TARGET to wherever the result comes back. */
5534 }
5536 /* Expand a call to __builtin_expect. We just return our argument
5537 as the builtin_expect semantic should've been already executed by
5538 tree branch prediction pass. */
5540 static rtx
5542 {
5543 tree arg;
5550 /* When guessing was done, the hints should be already stripped away. */
5554 }
5556 /* Expand a call to __builtin_expect_with_probability. We just return our
5557 argument as the builtin_expect semantic should've been already executed by
5558 tree branch prediction pass. */
5560 static rtx
5562 {
5563 tree arg;
5570 /* When guessing was done, the hints should be already stripped away. */
5574 }
5577 /* Expand a call to __builtin_assume_aligned. We just return our first
5578 argument as the builtin_assume_aligned semantic should've been already
5579 executed by CCP. */
5581 static rtx
5583 {
5587 EXPAND_NORMAL);
5592 }
5594 void
5596 {
5598 {
5600 /* For trap insns when not accumulating outgoing args force
5601 REG_ARGS_SIZE note to prevent crossjumping of calls with
5602 different args sizes. */
5605 }
5606 else
5607 {
5611 }
5614 }
5616 /* Expand a call to __builtin_unreachable. We do nothing except emit
5617 a barrier saying that control flow will not pass here.
5619 It is the responsibility of the program being compiled to ensure
5620 that control flow does never reach __builtin_unreachable. */
5621 static void
5623 {
5625 }
5627 /* Expand EXP, a call to fabs, fabsf or fabsl.
5628 Return NULL_RTX if a normal call should be emitted rather than expanding
5629 the function inline. If convenient, the result should be placed
5630 in TARGET. SUBTARGET may be used as the target for computing
5631 the operand. */
5633 static rtx
5635 {
5636 machine_mode mode;
5637 tree arg;
5638 rtx op0;
5648 }
5650 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5651 Return NULL is a normal call should be emitted rather than expanding the
5652 function inline. If convenient, the result should be placed in TARGET.
5653 SUBTARGET may be used as the target for computing the operand. */
5655 static rtx
5657 {
5659 tree arg;
5671 }
5673 /* Expand a call to __builtin___clear_cache. */
5675 static rtx
5677 {
5679 {
5680 #ifdef CLEAR_INSN_CACHE
5681 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5682 does something. Just do the default expansion to a call to
5683 __clear_cache(). */
5685 #else
5686 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5687 does nothing. There is no need to call it. Do nothing. */
5690 }
5692 /* We have a "clear_cache" insn, and it will handle everything. */
5696 /* We must not expand to a library call. If we did, any
5697 fallback library function in libgcc that might contain a call to
5698 __builtin___clear_cache() would recurse infinitely. */
5700 {
5703 }
5706 {
5719 }
5721 }
5723 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5725 static rtx
5727 {
5730 /* If we don't need too much alignment, we'll have been guaranteed
5731 proper alignment by get_trampoline_type. */
5735 /* Round address up to desired boundary. */
5746 }
5748 static rtx
5750 {
5766 /* If ONSTACK, the TRAMP argument should be the address of a field
5767 within the local function's FRAME decl. Either way, let's see if
5768 we can fill in the MEM_ATTRs for this memory. */
5772 /* Creator of a heap trampoline is responsible for making sure the
5773 address is aligned to at least STACK_BOUNDARY. Normally malloc
5774 will ensure this anyhow. */
5777 {
5781 }
5783 /* The FUNC argument should be the address of the nested function.
5784 Extract the actual function decl to pass to the hook. */
5791 /* Generate insns to initialize the trampoline. */
5795 {
5801 }
5804 }
5806 static rtx
5808 {
5809 rtx tramp;
5820 }
5822 /* Expand a call to the builtin descriptor initialization routine.
5823 A descriptor is made up of a couple of pointers to the static
5824 chain and the code entry in this order. */
5826 static rtx
5828 {
5833 VOID_TYPE))
5848 /* Generate insns to initialize the descriptor. */
5854 }
5856 /* Expand a call to the builtin descriptor adjustment routine. */
5858 static rtx
5860 {
5861 rtx tramp;
5868 /* Unalign the descriptor to allow runtime identification. */
5873 }
5875 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5876 function. The function first checks whether the back end provides
5877 an insn to implement signbit for the respective mode. If not, it
5878 checks whether the floating point format of the value is such that
5879 the sign bit can be extracted. If that is not the case, error out.
5880 EXP is the expression that is a call to the builtin function; if
5881 convenient, the result should be placed in TARGET. */
5882 static rtx
5884 {
5886 scalar_float_mode fmode;
5888 tree arg;
5891 rtx temp;
5904 /* Expand the argument yielding a RTX expression. */
5907 /* Check if the back end provides an insn that handles signbit for the
5908 argument's mode. */
5911 {
5917 }
5919 /* For floating point formats without a sign bit, implement signbit
5920 as "ARG < 0.0". */
5923 {
5924 /* But we can't do this if the format supports signed zero. */
5930 }
5933 {
5936 }
5937 else
5938 {
5940 /* Handle targets with different FP word orders. */
5943 else
5947 }
5949 /* Force the intermediate word_mode (or narrower) result into a
5950 register. This avoids attempting to create paradoxical SUBREGs
5951 of floating point modes below. */
5954 /* If the bitpos is within the "result mode" lowpart, the operation
5955 can be implement with a single bitwise AND. Otherwise, we need
5956 a right shift and an AND. */
5959 {
5967 }
5968 else
5969 {
5970 /* Perform a logical right shift to place the signbit in the least
5971 significant bit, then truncate the result to the desired mode
5972 and mask just this bit. */
5977 }
5980 }
5982 /* Expand fork or exec calls. TARGET is the desired target of the
5983 call. EXP is the call. FN is the
5984 identificator of the actual function. IGNORE is nonzero if the
5985 value is to be ignored. */
5987 static rtx
5989 {
5991 tree call;
5993 /* If we are not profiling, just call the function. */
5997 /* Otherwise call the wrapper. This should be equivalent for the rest of
5998 compiler, so the code does not diverge, and the wrapper may run the
5999 code necessary for keeping the profiling sane. */
6002 {
6033 }
6045 }
6048 \f
6049 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
6050 the pointer in these functions is void*, the tree optimizers may remove
6051 casts. The mode computed in expand_builtin isn't reliable either, due
6052 to __sync_bool_compare_and_swap.
6054 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
6055 group of builtins. This gives us log2 of the mode size. */
6059 {
6060 /* The size is not negotiable, so ask not to get BLKmode in return
6061 if the target indicates that a smaller size would be better. */
6063 }
6065 /* Expand the memory expression LOC and return the appropriate memory operand
6066 for the builtin_sync operations. */
6068 static rtx
6070 {
6080 /* Note that we explicitly do not want any alias information for this
6081 memory, so that we kill all other live memories. Otherwise we don't
6082 satisfy the full barrier semantics of the intrinsic. */
6089 /* The alignment needs to be at least according to that of the mode. */
6096 }
6098 /* Make sure an argument is in the right mode.
6099 EXP is the tree argument.
6100 MODE is the mode it should be in. */
6102 static rtx
6104 {
6105 rtx val;
6106 machine_mode old_mode;
6109 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
6110 of CONST_INTs, where we know the old_mode only from the call argument. */
6117 }
6120 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
6121 EXP is the CALL_EXPR. CODE is the rtx code
6122 that corresponds to the arithmetic or logical operation from the name;
6123 an exception here is that NOT actually means NAND. TARGET is an optional
6124 place for us to store the results; AFTER is true if this is the
6125 fetch_and_xxx form. */
6127 static rtx
6130 rtx target)
6131 {
6136 {
6143 {
6172 }
6173 }
6175 /* Expand the operands. */
6180 after);
6181 }
6183 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
6184 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
6185 true if this is the boolean form. TARGET is a place for us to store the
6186 results; this is NOT optional if IS_BOOL is true. */
6188 static rtx
6191 {
6195 /* Expand the operands. */
6202 {
6205 else
6207 }
6210 MEMMODEL_SYNC_SEQ_CST))
6214 }
6216 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
6217 general form is actually an atomic exchange, and some targets only
6218 support a reduced form with the second argument being a constant 1.
6219 EXP is the CALL_EXPR; TARGET is an optional place for us to store
6220 the results. */
6222 static rtx
6224 rtx target)
6225 {
6228 /* Expand the operands. */
6233 }
6235 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
6237 static void
6239 {
6240 rtx mem;
6242 /* Expand the operands. */
6246 }
6248 /* Given an integer representing an ``enum memmodel'', verify its
6249 correctness and return the memory model enum. */
6251 static enum memmodel
6253 {
6254 rtx op;
6256 location_t loc
6259 /* If the parameter is not a constant, it's a run time value so we'll just
6260 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
6270 {
6274 }
6276 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
6278 {
6282 }
6284 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
6285 be conservative and promote consume to acquire. */
6290 }
6292 /* Expand the __atomic_exchange intrinsic:
6293 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
6294 EXP is the CALL_EXPR.
6295 TARGET is an optional place for us to store the results. */
6297 static rtx
6299 {
6308 /* Expand the operands. */
6313 }
6315 /* Expand the __atomic_compare_exchange intrinsic:
6316 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
6317 TYPE desired, BOOL weak,
6318 enum memmodel success,
6319 enum memmodel failure)
6320 EXP is the CALL_EXPR.
6321 TARGET is an optional place for us to store the results. */
6323 static rtx
6325 rtx target)
6326 {
6330 tree weak;
6332 location_t loc
6339 {
6341 "failure memory model cannot be stronger than success "
6344 }
6347 {
6349 "invalid failure memory model for "
6353 }
6359 /* Expand the operands. */
6375 /* Lest the rtl backend create a race condition with an imporoper store
6376 to memory, always create a new pseudo for OLDVAL. */
6383 /* Conditionally store back to EXPECT, lest we create a race condition
6384 with an improper store to memory. */
6385 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6386 the normal case where EXPECT is totally private, i.e. a register. At
6387 which point the store can be unconditional. */
6395 }
6397 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6398 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6399 call. The weak parameter must be dropped to match the expected parameter
6400 list and the expected argument changed from value to pointer to memory
6401 slot. */
6403 static void
6405 {
6421 /* Skip the boolean weak parameter. */
6424 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6427 built_in_function fncode
6432 fndecl);
6437 {
6444 }
6445 }
6447 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6449 void
6451 {
6457 tree lhs;
6459 location_t loc
6466 {
6468 "failure memory model cannot be stronger than success "
6471 }
6474 {
6476 "invalid failure memory model for "
6480 }
6483 {
6486 }
6488 /* Expand the operands. */
6501 {
6504 }
6508 {
6514 }
6515 }
6517 /* Expand the __atomic_load intrinsic:
6518 TYPE __atomic_load (TYPE *object, enum memmodel)
6519 EXP is the CALL_EXPR.
6520 TARGET is an optional place for us to store the results. */
6522 static rtx
6524 {
6525 rtx mem;
6530 {
6531 location_t loc
6536 }
6541 /* Expand the operand. */
6545 }
6548 /* Expand the __atomic_store intrinsic:
6549 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6550 EXP is the CALL_EXPR.
6551 TARGET is an optional place for us to store the results. */
6553 static rtx
6555 {
6562 {
6563 location_t loc
6568 }
6573 /* Expand the operands. */
6578 }
6580 /* Expand the __atomic_fetch_XXX intrinsic:
6581 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6582 EXP is the CALL_EXPR.
6583 TARGET is an optional place for us to store the results.
6584 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6585 FETCH_AFTER is true if returning the result of the operation.
6586 FETCH_AFTER is false if returning the value before the operation.
6587 IGNORE is true if the result is not used.
6588 EXT_CALL is the correct builtin for an external call if this cannot be
6589 resolved to an instruction sequence. */
6591 static rtx
6595 {
6598 tree fndecl;
6599 tree addr;
6603 /* Expand the operands. */
6607 /* Only try generating instructions if inlining is turned on. */
6609 {
6613 }
6615 /* Return if a different routine isn't needed for the library call. */
6619 /* Change the call to the specified function. */
6627 /* If we will emit code after the call, the call cannot be a tail call.
6628 If it is emitted as a tail call, a barrier is emitted after it, and
6629 then all trailing code is removed. */
6633 /* Expand the call here so we can emit trailing code. */
6636 /* Replace the original function just in case it matters. */
6639 /* Then issue the arithmetic correction to return the right result. */
6641 {
6643 {
6645 OPTAB_LIB_WIDEN);
6647 }
6648 else
6650 OPTAB_LIB_WIDEN);
6651 }
6653 }
6655 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6657 void
6659 {
6667 optab optab;
6679 {
6694 }
6697 {
6704 }
6726 {
6731 }
6732 else
6734 OPTAB_DIRECT);
6737 }
6739 /* Expand an atomic clear operation.
6740 void _atomic_clear (BOOL *obj, enum memmodel)
6741 EXP is the call expression. */
6743 static rtx
6745 {
6746 machine_mode mode;
6755 {
6756 location_t loc
6761 }
6763 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6764 Failing that, a store is issued by __atomic_store. The only way this can
6765 fail is if the bool type is larger than a word size. Unlikely, but
6766 handle it anyway for completeness. Assume a single threaded model since
6767 there is no atomic support in this case, and no barriers are required. */
6772 }
6774 /* Expand an atomic test_and_set operation.
6775 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6776 EXP is the call expression. */
6778 static rtx
6780 {
6781 rtx mem;
6783 machine_mode mode;
6790 }
6793 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6794 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6796 static tree
6798 {
6800 machine_mode mode;
6806 /* We need a corresponding integer mode for the access to be lock-free. */
6814 {
6817 /* Either this argument is null, or it's a fake pointer encoding
6818 the alignment of the object. */
6824 else
6826 }
6827 else
6828 {
6831 /* This function is usually invoked and folded immediately by the front
6832 end before anything else has a chance to look at it. The pointer
6833 parameter at this point is usually cast to a void *, so check for that
6834 and look past the cast. */
6844 /* Get the underlying type of the object. */
6847 }
6849 /* If the object has smaller alignment, the lock free routines cannot
6850 be used. */
6854 /* Check if a compare_and_swap pattern exists for the mode which represents
6855 the required size. The pattern is not allowed to fail, so the existence
6856 of the pattern indicates support is present. Also require that an
6857 atomic load exists for the required size. */
6860 else
6862 }
6864 /* Return true if the parameters to call EXP represent an object which will
6865 always generate lock free instructions. The first argument represents the
6866 size of the object, and the second parameter is a pointer to the object
6867 itself. If NULL is passed for the object, then the result is based on
6868 typical alignment for an object of the specified size. Otherwise return
6869 false. */
6871 static rtx
6873 {
6874 tree size;
6879 {
6882 }
6888 }
6890 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6891 is lock free on this architecture. */
6893 static tree
6895 {
6899 /* If it isn't always lock free, don't generate a result. */
6904 }
6906 /* Return true if the parameters to call EXP represent an object which will
6907 always generate lock free instructions. The first argument represents the
6908 size of the object, and the second parameter is a pointer to the object
6909 itself. If NULL is passed for the object, then the result is based on
6910 typical alignment for an object of the specified size. Otherwise return
6911 NULL*/
6913 static rtx
6915 {
6916 tree size;
6921 {
6924 }
6929 /* If the value is known at compile time, return the RTX for it. */
6935 }
6937 /* Expand the __atomic_thread_fence intrinsic:
6938 void __atomic_thread_fence (enum memmodel)
6939 EXP is the CALL_EXPR. */
6941 static void
6943 {
6946 }
6948 /* Expand the __atomic_signal_fence intrinsic:
6949 void __atomic_signal_fence (enum memmodel)
6950 EXP is the CALL_EXPR. */
6952 static void
6954 {
6957 }
6959 /* Expand the __sync_synchronize intrinsic. */
6961 static void
6963 {
6965 }
6967 static rtx
6969 {
6975 {
6977 /* If the target is not sutitable then create a new target. */
6985 }
6988 }
6990 static void
6992 {
6998 {
7005 }
7007 }
7009 \f
7010 /* Emit code to restore the current value of stack. */
7012 static void
7014 {
7026 }
7028 /* Emit code to save the current value of stack. */
7030 static rtx
7032 {
7037 }
7039 /* Emit code to get the openacc gang, worker or vector id or size. */
7041 static rtx
7043 {
7045 rtx fallback_retval;
7048 {
7061 }
7064 {
7067 }
7071 {
7074 }
7078 {
7086 }
7095 {
7098 }
7106 }
7108 /* Expand a string compare operation using a sequence of char comparison
7109 to get rid of the calling overhead, with result going to TARGET if
7110 that's convenient.
7112 VAR_STR is the variable string source;
7113 CONST_STR is the constant string source;
7114 LENGTH is the number of chars to compare;
7115 CONST_STR_N indicates which source string is the constant string;
7116 IS_MEMCMP indicates whether it's a memcmp or strcmp.
7118 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
7120 target = (int) (unsigned char) var_str[0]
7121 - (int) (unsigned char) const_str[0];
7122 if (target != 0)
7123 goto ne_label;
7124 ...
7125 target = (int) (unsigned char) var_str[length - 2]
7126 - (int) (unsigned char) const_str[length - 2];
7127 if (target != 0)
7128 goto ne_label;
7129 target = (int) (unsigned char) var_str[length - 1]
7130 - (int) (unsigned char) const_str[length - 1];
7131 ne_label:
7132 */
7134 static rtx
7138 {
7140 rtx var_rtx_array
7147 scalar_int_mode unit_mode
7153 {
7154 var_rtx
7168 }
7176 }
7178 /* Inline expansion a call to str(n)cmp, with result going to
7179 TARGET if that's convenient.
7180 If the call is not been inlined, return NULL_RTX. */
7181 static rtx
7183 {
7189 /* Do NOT apply this inlining expansion when optimizing for size or
7190 optimization level below 2. */
7198 /* On a target where the type of the call (int) has same or narrower presicion
7199 than unsigned char, give up the inlining expansion. */
7215 /* If neither strings is constant string, the call is not qualify. */
7219 /* For strncmp, if the length is not a const, not qualify. */
7221 {
7224 else
7226 }
7241 else
7250 /* If the length of the comparision is larger than the threshold,
7251 do nothing. */
7258 /* Now, start inline expansion the call. */
7262 }
7264 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
7265 represents the size of the first argument to that call, or VOIDmode
7266 if the argument is a pointer. IGNORE will be true if the result
7267 isn't used. */
7268 static rtx
7271 {
7278 {
7281 }
7285 /* An optional second argument can be used as a failsafe value on
7286 some machines. If it isn't present, then the failsafe value is
7287 assumed to be 0. */
7289 {
7292 }
7293 else
7296 /* If the result isn't used, the behavior is undefined. It would be
7297 nice to emit a warning here, but path splitting means this might
7298 happen with legitimate code. So simply drop the builtin
7299 expansion in that case; we've handled any side-effects above. */
7303 /* If we don't have a suitable target, create one to hold the result. */
7311 }
7313 /* Expand an expression EXP that calls a built-in function,
7314 with result going to TARGET if that's convenient
7315 (and in mode MODE if that's convenient).
7316 SUBTARGET may be used as the target for computing one of EXP's operands.
7317 IGNORE is nonzero if the value is to be ignored. */
7319 rtx
7322 {
7330 /* When ASan is enabled, we don't want to expand some memory/string
7331 builtins and rely on libsanitizer's hooks. This allows us to avoid
7332 redundant checks and be sure, that possible overflow will be detected
7333 by ASan. */
7339 /* When not optimizing, generate calls to library functions for a certain
7340 set of builtins. */
7354 /* The built-in function expanders test for target == const0_rtx
7355 to determine whether the function's result will be ignored. */
7359 /* If the result of a pure or const built-in function is ignored, and
7360 none of its arguments are volatile, we can avoid expanding the
7361 built-in call and just evaluate the arguments for side-effects. */
7365 {
7367 tree arg;
7368 call_expr_arg_iterator iter;
7372 {
7375 }
7378 {
7382 }
7383 }
7386 {
7404 /* Just do a normal library call if we were unable to fold
7405 the values. */
7482 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7483 FUNCTION with a copy of the parameters described by
7484 ARGUMENTS, and ARGSIZE. It returns a block of memory
7485 allocated on the stack into which is stored all the registers
7486 that might possibly be used for returning the result of a
7487 function. ARGUMENTS is the value returned by
7488 __builtin_apply_args. ARGSIZE is the number of bytes of
7489 arguments that must be copied. ??? How should this value be
7490 computed? We'll also need a safe worst case value for varargs
7491 functions. */
7498 else
7499 {
7507 }
7509 /* __builtin_return (RESULT) causes the function to return the
7510 value described by RESULT. RESULT is address of the block of
7511 memory returned by __builtin_apply. */
7521 /* All valid uses of __builtin_va_arg_pack () are removed during
7522 inlining. */
7527 /* All valid uses of __builtin_va_arg_pack_len () are removed during
7528 inlining. */
7532 /* Return the address of the first anonymous stack arg. */
7554 /* Returns the address of the area where the structure is returned.
7555 0 otherwise. */
7561 else
7564 CASE_BUILT_IN_ALLOCA:
7714 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7715 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7716 when changing it to a strcmp call. */
7722 /* Change this call back to a BUILT_IN_STRCMP. */
7726 /* Delete the last parameter. */
7733 /* FALLTHROUGH */
7741 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7742 back to a BUILT_IN_STRNCMP. */
7748 /* Change it back to a BUILT_IN_STRNCMP. */
7751 /* FALLTHROUGH */
7766 {
7769 }
7773 /* This should have been lowered to the builtins below. */
7777 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7778 and the receiver label. */
7780 {
7786 /* This is copied from the handling of non-local gotos. */
7788 nonlocal_goto_handler_labels
7790 nonlocal_goto_handler_labels);
7791 /* ??? Do not let expand_label treat us as such since we would
7792 not want to be both on the list of non-local labels and on
7793 the list of forced labels. */
7796 }
7800 /* __builtin_setjmp_receiver is passed the receiver label. */
7802 {
7808 }
7811 /* __builtin_longjmp is passed a pointer to an array of five words.
7812 It's similar to the C library longjmp function but works with
7813 __builtin_setjmp above. */
7816 {
7822 {
7825 }
7829 }
7838 /* This updates the setjmp buffer that is its argument with the value
7839 of the current stack pointer. */
7842 {
7843 rtx buf_addr
7848 }
7868 /* Various hooks for the DWARF 2 __throw routine. */
7874 #ifdef DWARF2_UNWIND_INFO
7880 #endif
8082 mode = get_builtin_sync_mode
8094 mode = get_builtin_sync_mode
8141 {
8145 mode =
8151 /* If this is turned into an external library call, the weak parameter
8152 must be dropped to match the expected parameter list. */
8157 /* Skip the boolean weak parameter. */
8162 }
8191 {
8201 }
8207 {
8217 }
8223 {
8233 }
8239 {
8249 }
8255 {
8265 }
8271 {
8281 }
8418 /* Do library call, if we failed to expand the builtin when
8419 folding. */
8439 }
8441 /* The switch statement above can drop through to cause the function
8442 to be called normally. */
8444 }
8446 /* Determine whether a tree node represents a call to a built-in
8447 function. If the tree T is a call to a built-in function with
8448 the right number of arguments of the appropriate types, return
8449 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8450 Otherwise the return value is END_BUILTINS. */
8452 enum built_in_function
8454 {
8457 const_call_expr_arg_iterator iter;
8469 {
8470 /* If a function doesn't take a variable number of arguments,
8471 the last element in the list will have type `void'. */
8474 {
8478 }
8487 {
8490 }
8492 {
8495 }
8497 {
8500 }
8502 {
8505 }
8506 else
8508 }
8510 /* Variable-length argument list. */
8512 }
8514 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
8515 evaluate to a constant. */
8517 static tree
8519 {
8520 /* We return 1 for a numeric type that's known to be a constant
8521 value at compile-time or for an aggregate type that's a
8522 literal constant. */
8525 /* If we know this is a constant, emit the constant of one. */
8531 {
8538 }
8540 /* If this expression has side effects, show we don't know it to be a
8541 constant. Likewise if it's a pointer or aggregate type since in
8542 those case we only want literals, since those are only optimized
8543 when generating RTL, not later.
8544 And finally, if we are compiling an initializer, not code, we
8545 need to return a definite result now; there's not going to be any
8546 more optimization done. */
8551 || folding_initializer
8556 }
8558 /* Create builtin_expect or builtin_expect_with_probability
8559 with PRED and EXPECTED as its arguments and return it as a truthvalue.
8560 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
8561 builtin_expect_with_probability instead uses third argument as PROBABILITY
8562 value. */
8564 static tree
8567 {
8582 else
8584 predictor);
8588 }
8590 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
8591 NULL_TREE if no simplification is possible. */
8593 tree
8595 tree arg3)
8596 {
8600 /* Distribute the expected value over short-circuiting operators.
8601 See through the cast from truthvalue_type_node to long. */
8608 /* If this is a builtin_expect within a builtin_expect keep the
8609 inner one. See through a comparison against a constant. It
8610 might have been added to create a thruthvalue. */
8626 {
8636 }
8638 /* If the argument isn't invariant then there's nothing else we can do. */
8642 /* If we expect that a comparison against the argument will fold to
8643 a constant return the constant. In practice, this means a true
8644 constant or the address of a non-weak symbol. */
8648 {
8649 do
8650 {
8652 }
8657 }
8659 /* Otherwise, ARG0 already has the proper type for the return value. */
8661 }
8663 /* Fold a call to __builtin_classify_type with argument ARG. */
8665 static tree
8667 {
8672 }
8674 /* Fold a call to __builtin_strlen with argument ARG. */
8676 static tree
8678 {
8681 else
8682 {
8683 c_strlen_data lendata = { };
8693 {
8699 }
8702 }
8703 }
8705 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8707 static tree
8709 {
8710 REAL_VALUE_TYPE real;
8712 /* __builtin_inff is intended to be usable to define INFINITY on all
8713 targets. If an infinity is not available, INFINITY expands "to a
8714 positive constant of type float that overflows at translation
8715 time", footnote "In this case, using INFINITY will violate the
8716 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8717 Thus we pedwarn to ensure this constraint violation is
8718 diagnosed. */
8724 }
8726 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8727 NULL_TREE if no simplification can be made. */
8729 static tree
8732 {
8733 tree type;
8743 /* Calculate the result when the argument is a constant. */
8748 /* Canonicalize sincos to cexpi. */
8750 {
8753 }
8755 {
8762 }
8774 }
8776 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8777 Return NULL_TREE if no simplification can be made. */
8779 static tree
8781 {
8787 /* If the LEN parameter is zero, return zero. */
8792 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8796 /* If len parameter is one, return an expression corresponding to
8797 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8799 {
8801 tree cst_uchar_ptr_node
8804 tree ind1
8808 cst_uchar_ptr_node,
8809 arg1)));
8810 tree ind2
8814 cst_uchar_ptr_node,
8815 arg2)));
8817 }
8820 }
8822 /* Fold a call to builtin isascii with argument ARG. */
8824 static tree
8826 {
8829 else
8830 {
8831 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8837 }
8838 }
8840 /* Fold a call to builtin toascii with argument ARG. */
8842 static tree
8844 {
8848 /* Transform toascii(c) -> (c & 0x7f). */
8851 }
8853 /* Fold a call to builtin isdigit with argument ARG. */
8855 static tree
8857 {
8860 else
8861 {
8862 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8863 /* According to the C standard, isdigit is unaffected by locale.
8864 However, it definitely is affected by the target character set. */
8865 unsigned HOST_WIDE_INT target_digit0
8876 }
8877 }
8879 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8881 static tree
8883 {
8889 }
8891 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8893 static tree
8895 {
8901 }
8903 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8905 static tree
8907 {
8910 {
8914 {
8919 }
8920 }
8923 }
8925 /* Fold a call to builtin frexp, we can assume the base is 2. */
8927 static tree
8929 {
8940 /* Proceed if a valid pointer type was passed in. */
8942 {
8947 {
8949 /* For +-0, return (*exp = 0, +-0). */
8955 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8958 {
8959 /* Since the frexp function always expects base 2, and in
8960 GCC normalized significands are already in the range
8961 [0.5, 1.0), we have exactly what frexp wants. */
8966 }
8970 }
8972 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8976 }
8979 }
8981 /* Fold a call to builtin modf. */
8983 static tree
8985 {
8996 /* Proceed if a valid pointer type was passed in. */
8998 {
9003 {
9006 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
9010 /* For +-Inf, return (*arg1 = arg0, +-0). */
9016 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
9019 /* If the original number was negative and already
9020 integral, then the fractional part is -0.0. */
9024 }
9026 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
9032 }
9035 }
9037 /* Given a location LOC, an interclass builtin function decl FNDECL
9038 and its single argument ARG, return an folded expression computing
9039 the same, or NULL_TREE if we either couldn't or didn't want to fold
9040 (the latter happen if there's an RTL instruction available). */
9042 static tree
9044 {
9045 machine_mode mode;
9057 /* If there is no optab, try generic code. */
9059 {
9060 tree result;
9063 {
9064 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
9067 REAL_VALUE_TYPE r;
9071 {
9072 /* NaN and Inf are encoded in the high-order double value
9073 only. The low-order value is not significant. */
9077 }
9084 }
9087 {
9088 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9091 REAL_VALUE_TYPE r;
9095 {
9096 /* NaN and Inf are encoded in the high-order double value
9097 only. The low-order value is not significant. */
9101 }
9107 /*result = fold_build2_loc (loc, UNGT_EXPR,
9108 TREE_TYPE (TREE_TYPE (fndecl)),
9109 fold_build1_loc (loc, ABS_EXPR, type, arg),
9110 build_real (type, r));
9111 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9112 TREE_TYPE (TREE_TYPE (fndecl)),
9113 result);*/
9115 }
9117 {
9118 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9119 islessequal(fabs(x),DBL_MAX). */
9129 {
9130 /* Use double to test the normal range of IBM extended
9131 precision. Emin for IBM extended precision is
9132 different to emin for IEEE double, being 53 higher
9133 since the low double exponent is at least 53 lower
9134 than the high double exponent. */
9138 }
9150 {
9151 /* Testing the high end of the range is done just using
9152 the high double, using the same test as isfinite().
9153 For the subnormal end of the range we first test the
9154 high double, then if its magnitude is equal to the
9155 limit of 0x1p-969, we test whether the low double is
9156 non-zero and opposite sign to the high double. */
9172 integer_type_node,
9178 }
9179 else
9180 {
9181 tree const isge_fn
9184 }
9188 }
9191 }
9194 }
9196 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9197 ARG is the argument for the call. */
9199 static tree
9201 {
9208 {
9216 {
9217 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9218 /* In a boolean context, GCC will fold the inner COND_EXPR to
9219 1. So e.g. "if (isinf_sign(x))" would be folded to just
9220 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9228 {
9241 integer_zero_node);
9242 }
9245 }
9258 {
9261 {
9262 /* NaN and Inf are encoded in the high-order double value
9263 only. The low-order value is not significant. */
9265 }
9266 }
9272 }
9273 }
9275 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9276 This builtin will generate code to return the appropriate floating
9277 point classification depending on the value of the floating point
9278 number passed in. The possible return values must be supplied as
9279 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9280 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9281 one floating point argument which is "type generic". */
9283 static tree
9285 {
9288 machine_mode mode;
9289 REAL_VALUE_TYPE r;
9292 /* Verify the required arguments in the original call. */
9312 /* fpclassify(x) ->
9313 isnan(x) ? FP_NAN :
9314 (fabs(x) == Inf ? FP_INFINITE :
9315 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9316 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9330 {
9336 }
9339 {
9342 }
9345 }
9347 /* Fold a call to an unordered comparison function such as
9348 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9349 being called and ARG0 and ARG1 are the arguments for the call.
9350 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9351 the opposite of the desired result. UNORDERED_CODE is used
9352 for modes that can hold NaNs and ORDERED_CODE is used for
9353 the rest. */
9355 static tree
9359 {
9373 /* Choose the wider of two real types. */
9385 {
9389 }
9394 }
9396 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9397 arithmetics if it can never overflow, or into internal functions that
9398 return both result of arithmetics and overflowed boolean flag in
9399 a complex integer result, or some other check for overflow.
9400 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9401 checking part of that. */
9403 static tree
9406 {
9408 /* The code of the expression corresponding to the built-in. */
9413 {
9416 /* FALLTHRU */
9429 /* FALLTHRU */
9442 /* FALLTHRU */
9455 }
9457 /* For the "generic" overloads, the first two arguments can have different
9458 types and the last argument determines the target type to use to check
9459 for overflow. The arguments of the other overloads all have the same
9460 type. */
9463 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
9464 arguments are constant, attempt to fold the built-in call into a constant
9465 expression indicating whether or not it detected an overflow. */
9469 /* Perform the computation in the target type and check for overflow. */
9473 arg2);
9477 {
9485 }
9486 else
9487 {
9495 }
9501 tree store
9504 }
9506 /* Fold a call to __builtin_FILE to a constant string. */
9510 {
9512 {
9513 /* The documentation says this builtin is equivalent to the preprocessor
9514 __FILE__ macro so it appears appropriate to use the same file prefix
9515 mappings. */
9518 }
9521 }
9523 /* Fold a call to __builtin_FUNCTION to a constant string. */
9527 {
9534 }
9536 /* Fold a call to __builtin_LINE to an integer constant. */
9540 {
9542 }
9544 /* Fold a call to built-in function FNDECL with 0 arguments.
9545 This function returns NULL_TREE if no simplification was possible. */
9547 static tree
9549 {
9553 {
9579 }
9581 }
9583 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9584 This function returns NULL_TREE if no simplification was possible. */
9586 static tree
9588 {
9599 {
9601 {
9604 /* Gimplification will pull the CALL_EXPR for the builtin out of
9605 an if condition. When not optimizing, we'll not CSE it back.
9606 To avoid link error types of regressions, return false now. */
9611 }
9667 {
9672 }
9678 {
9683 }
9704 }
9708 }
9710 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9711 This function returns NULL_TREE if no simplification was possible. */
9713 static tree
9715 {
9727 {
9771 NOP_EXPR);
9773 /* We do the folding for va_start in the expander. */
9788 }
9790 }
9792 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9793 and ARG2.
9794 This function returns NULL_TREE if no simplification was possible. */
9796 static tree
9799 {
9813 {
9862 }
9864 }
9866 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9867 arguments. IGNORE is true if the result of the
9868 function call is ignored. This function returns NULL_TREE if no
9869 simplification was possible. */
9871 tree
9873 {
9877 {
9893 }
9895 {
9899 }
9901 }
9903 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9904 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9905 of arguments in ARGS to be omitted. OLDNARGS is the number of
9906 elements in ARGS. */
9908 static tree
9911 {
9916 {
9924 }
9925 else
9929 }
9931 /* Return true if FNDECL shouldn't be folded right now.
9932 If a built-in function has an inline attribute always_inline
9933 wrapper, defer folding it after always_inline functions have
9934 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9935 might not be performed. */
9937 bool
9939 {
9942 && cfun
9945 }
9947 /* A wrapper function for builtin folding that prevents warnings for
9948 "statement without effect" and the like, caused by removing the
9949 call node earlier than the warning is generated. */
9951 tree
9953 {
9957 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9958 yet. Defer folding until we see all the arguments
9959 (after inlining). */
9961 {
9964 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9965 instead last argument is __builtin_va_arg_pack (). Defer folding
9966 even in that case, until arguments are finalized. */
9968 {
9972 }
9980 else
9981 {
9986 }
9987 }
9989 }
9991 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9992 N arguments are passed in the array ARGARRAY. Return a folded
9993 expression or NULL_TREE if no simplification was possible. */
9995 tree
9997 tree fn,
10000 {
10007 {
10008 /* If last argument is __builtin_va_arg_pack (), arguments to this
10009 function are not finalized yet. Defer folding until they are. */
10011 {
10015 }
10020 else
10022 }
10025 }
10027 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
10028 along with N new arguments specified as the "..." parameters. SKIP
10029 is the number of arguments in EXP to be omitted. This function is used
10030 to do varargs-to-varargs transformations. */
10032 static tree
10034 {
10036 tree t;
10044 }
10046 /* Validate a single argument ARG against a tree code CODE representing
10047 a type. Return true when argument is valid. */
10049 static bool
10051 {
10059 }
10061 /* This function validates the types of a function call argument list
10062 against a specified list of tree_codes. If the last specifier is a 0,
10063 that represents an ellipses, otherwise the last specifier must be a
10064 VOID_TYPE.
10066 This is the GIMPLE version of validate_arglist. Eventually we want to
10067 completely convert builtins.c to work from GIMPLEs and the tree based
10068 validate_arglist will then be removed. */
10070 bool
10072 {
10076 const_tree arg;
10082 do
10083 {
10086 {
10088 /* This signifies an ellipses, any further arguments are all ok. */
10092 /* This signifies an endlink, if no arguments remain, return
10093 true, otherwise return false. */
10097 /* If no parameters remain or the parameter's code does not
10098 match the specified code, return false. Otherwise continue
10099 checking any remaining arguments. */
10104 }
10105 }
10108 /* We need gotos here since we can only have one VA_CLOSE in a
10109 function. */
10110 end: ;
10114 }
10116 /* Default target-specific builtin expander that does nothing. */
10118 rtx
10120 rtx target ATTRIBUTE_UNUSED,
10121 rtx subtarget ATTRIBUTE_UNUSED,
10122 machine_mode mode ATTRIBUTE_UNUSED,
10124 {
10126 }
10128 /* Returns true is EXP represents data that would potentially reside
10129 in a readonly section. */
10131 bool
10133 {
10143 /* Make sure we call decl_readonly_section only for trees it
10144 can handle (since it returns true for everything it doesn't
10145 understand). */
10150 else
10152 }
10154 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
10155 to the call, and TYPE is its return type.
10157 Return NULL_TREE if no simplification was possible, otherwise return the
10158 simplified form of the call as a tree.
10160 The simplified form may be a constant or other expression which
10161 computes the same value, but in a more efficient manner (including
10162 calls to other builtin functions).
10164 The call may contain arguments which need to be evaluated, but
10165 which are not useful to determine the result of the call. In
10166 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10167 COMPOUND_EXPR will be an argument which must be evaluated.
10168 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10169 COMPOUND_EXPR in the chain will contain the tree for the simplified
10170 form of the builtin function call. */
10172 static tree
10174 {
10178 else
10179 {
10180 tree fn;
10189 {
10191 tree tem;
10196 /* Return an offset into the constant string argument. */
10199 }
10202 /* strpbrk(x, "") == NULL.
10203 Evaluate and ignore s1 in case it had side-effects. */
10213 /* New argument list transforming strpbrk(s1, s2) to
10214 strchr(s1, s2[0]). */
10217 }
10218 }
10220 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
10221 to the call.
10223 Return NULL_TREE if no simplification was possible, otherwise return the
10224 simplified form of the call as a tree.
10226 The simplified form may be a constant or other expression which
10227 computes the same value, but in a more efficient manner (including
10228 calls to other builtin functions).
10230 The call may contain arguments which need to be evaluated, but
10231 which are not useful to determine the result of the call. In
10232 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10233 COMPOUND_EXPR will be an argument which must be evaluated.
10234 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10235 COMPOUND_EXPR in the chain will contain the tree for the simplified
10236 form of the builtin function call. */
10238 static tree
10240 {
10244 else
10245 {
10248 /* If either argument is "", return NULL_TREE. */
10250 /* Evaluate and ignore both arguments in case either one has
10251 side-effects. */
10255 }
10256 }
10258 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
10259 to the call.
10261 Return NULL_TREE if no simplification was possible, otherwise return the
10262 simplified form of the call as a tree.
10264 The simplified form may be a constant or other expression which
10265 computes the same value, but in a more efficient manner (including
10266 calls to other builtin functions).
10268 The call may contain arguments which need to be evaluated, but
10269 which are not useful to determine the result of the call. In
10270 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10271 COMPOUND_EXPR will be an argument which must be evaluated.
10272 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10273 COMPOUND_EXPR in the chain will contain the tree for the simplified
10274 form of the builtin function call. */
10276 static tree
10278 {
10282 else
10283 {
10284 /* If the first argument is "", return NULL_TREE. */
10287 {
10288 /* Evaluate and ignore argument s2 in case it has
10289 side-effects. */
10292 }
10294 /* If the second argument is "", return __builtin_strlen(s1). */
10297 {
10300 /* If the replacement _DECL isn't initialized, don't do the
10301 transformation. */
10306 }
10308 }
10309 }
10311 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
10312 produced. False otherwise. This is done so that we don't output the error
10313 or warning twice or three times. */
10315 bool
10317 {
10320 tree arg;
10321 /* There is good chance the current input_location points inside the
10322 definition of the va_start macro (perhaps on the token for
10323 builtin) in a system header, so warnings will not be emitted.
10324 Use the location in real source code. */
10325 location_t current_location =
10327 NULL);
10330 {
10333 }
10336 {
10338 {
10341 }
10343 }
10344 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
10345 when we checked the arguments and if needed issued a warning. */
10346 else
10347 {
10349 {
10350 /* Evidently an out of date version of <stdarg.h>; can't validate
10351 va_start's second argument, but can still work as intended. */
10353 OPT_Wvarargs,
10356 }
10358 {
10361 }
10363 }
10368 /* We destructively modify the call to be __builtin_va_start (ap, 0)
10369 or __builtin_next_arg (0) the first time we see it, after checking
10370 the arguments and if needed issuing a warning. */
10372 {
10375 /* Strip off all nops for the sake of the comparison. This
10376 is not quite the same as STRIP_NOPS. It does more.
10377 We must also strip off INDIRECT_EXPR for C++ reference
10378 parameters. */
10383 {
10384 /* FIXME: Sometimes with the tree optimizers we can get the
10385 not the last argument even though the user used the last
10386 argument. We just warn and set the arg to be the last
10387 argument so that we will get wrong-code because of
10388 it. */
10390 OPT_Wvarargs,
10392 }
10394 /* Undefined by C99 7.15.1.4p4 (va_start):
10395 "If the parameter parmN is declared with the register storage
10396 class, with a function or array type, or with a type that is
10397 not compatible with the type that results after application of
10398 the default argument promotions, the behavior is undefined."
10399 */
10401 {
10403 OPT_Wvarargs,
10404 "undefined behavior when second parameter of "
10406 }
10408 /* We want to verify the second parameter just once before the tree
10409 optimizers are run and then avoid keeping it in the tree,
10410 as otherwise we could warn even for correct code like:
10411 void foo (int i, ...)
10412 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
10415 else
10417 }
10419 }
10422 /* Expand a call EXP to __builtin_object_size. */
10424 static rtx
10426 {
10427 tree ost;
10432 {
10437 }
10445 {
10450 }
10455 }
10457 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10458 FCODE is the BUILT_IN_* to use.
10459 Return NULL_RTX if we failed; the caller should emit a normal call,
10460 otherwise try to get the result in TARGET, if convenient (and in
10461 mode MODE if that's convenient). */
10463 static rtx
10466 {
10468 POINTER_TYPE,
10469 fcode == BUILT_IN_MEMSET_CHK
10486 {
10487 /* Avoid transforming the checking call to an ordinary one when
10488 an overflow has been detected or when the call couldn't be
10489 validated because the size is not constant. */
10494 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10495 mem{cpy,pcpy,move,set} is available. */
10497 {
10512 }
10521 }
10524 else
10525 {
10528 /* If DEST is not a pointer type, call the normal function. */
10532 /* If SRC and DEST are the same (and not volatile), do nothing. */
10534 {
10535 tree expr;
10538 {
10539 /* Evaluate and ignore LEN in case it has side-effects. */
10542 }
10546 }
10548 /* __memmove_chk special case. */
10550 {
10556 /* If src is categorized for a readonly section we can use
10557 normal __memcpy_chk. */
10559 {
10568 }
10569 }
10571 }
10572 }
10574 /* Emit warning if a buffer overflow is detected at compile time. */
10576 static void
10578 {
10579 /* The source string. */
10581 /* The size of the destination object. */
10583 /* The string that is being concatenated with (as in __strcat_chk)
10584 or null if it isn't. */
10586 /* The maximum length of the source sequence in a bounded operation
10587 (such as __strncat_chk) or null if the operation isn't bounded
10588 (such as __strcat_chk). */
10590 /* The exact size of the access (such as in __strncpy_chk). */
10594 {
10602 /* For __strcat_chk the warning will be emitted only if overflowing
10603 by at least strlen (dest) + 1 bytes. */
10630 }
10633 {
10634 /* Check __strncat_chk. There is no way to determine the length
10635 of the string to which the source string is being appended so
10636 just warn when the length of the source string is not known. */
10639 }
10641 /* The destination argument is the first one for all built-ins above. */
10645 }
10647 /* Emit warning if a buffer overflow is detected at compile time
10648 in __sprintf_chk/__vsprintf_chk calls. */
10650 static void
10652 {
10657 /* Verify the required arguments in the original call. */
10667 /* Check whether the format is a literal string constant. */
10675 /* If the format doesn't contain % args or %%, we know its size. */
10678 /* If the format is "%s" and first ... argument is a string literal,
10679 we know it too. */
10682 {
10683 tree arg;
10694 }
10695 else
10698 /* Add one for the terminating nul. */
10703 }
10705 /* Emit warning if a free is called with address of a variable. */
10707 static void
10709 {
10726 else
10729 }
10731 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10732 if possible. */
10734 static tree
10736 {
10753 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10754 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10755 and (size_t) 0 for types 2 and 3. */
10760 {
10764 }
10766 {
10767 /* If object size is not known yet, delay folding until
10768 later. Maybe subsequent passes will help determining
10769 it. */
10773 }
10776 }
10778 /* Builtins with folding operations that operate on "..." arguments
10779 need special handling; we need to store the arguments in a convenient
10780 data structure before attempting any folding. Fortunately there are
10781 only a few builtins that fall into this category. FNDECL is the
10782 function, EXP is the CALL_EXPR for the call. */
10784 static tree
10786 {
10791 {
10798 }
10800 {
10805 }
10807 }
10809 /* Initialize format string characters in the target charset. */
10811 bool
10813 {
10816 {
10839 }
10841 }
10843 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10844 and no overflow/underflow occurred. INEXACT is true if M was not
10845 exactly calculated. TYPE is the tree type for the result. This
10846 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. */
10850 static tree
10852 {
10853 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10854 overflow/underflow occurred. If -frounding-math, proceed iff the
10855 result of calling FUNC was exact. */
10858 {
10859 REAL_VALUE_TYPE rr;
10862 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10863 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10864 but the mpft_t is not, then we underflowed in the
10865 conversion. */
10868 {
10869 REAL_VALUE_TYPE rmode;
10872 /* Proceed iff the specified mode can hold the value. */
10875 }
10876 }
10878 }
10880 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10881 number and no overflow/underflow occurred. INEXACT is true if M
10882 was not exactly calculated. TYPE is the tree type for the result.
10883 This function assumes that you cleared the MPFR flags and then
10884 calculated M to see if anything subsequently set a flag prior to
10885 entering this function. Return NULL_TREE if any checks fail, if
10886 FORCE_CONVERT is true, then bypass the checks. */
10888 static tree
10890 {
10891 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10892 overflow/underflow occurred. If -frounding-math, proceed iff the
10893 result of calling FUNC was exact. */
10898 {
10903 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10904 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10905 but the mpft_t is not, then we underflowed in the
10906 conversion. */
10911 {
10916 /* Proceed iff the specified mode can hold the value. */
10922 }
10923 }
10925 }
10927 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10928 the pointer *(ARG_QUO) and return the result. The type is taken
10929 from the type of ARG0 and is used for setting the precision of the
10930 calculation and results. */
10932 static tree
10934 {
10941 /* To proceed, MPFR must exactly represent the target floating point
10942 format, which only happens when the target base equals two. */
10946 {
10951 {
10955 tree result_rem;
10964 /* Remquo is independent of the rounding mode, so pass
10965 inexact=0 to do_mpfr_ckconv(). */
10969 {
10970 /* MPFR calculates quo in the host's long so it may
10971 return more bits in quo than the target int can hold
10972 if sizeof(host long) > sizeof(target int). This can
10973 happen even for native compilers in LP64 mode. In
10974 these cases, modulo the quo value with the largest
10975 number that the target int can hold while leaving one
10976 bit for the sign. */
10980 /* Dereference the quo pointer argument. */
10982 /* Proceed iff a valid pointer type was passed in. */
10984 {
10985 /* Set the value. */
10986 tree result_quo
10989 integer_quo));
10991 /* Combine the quo assignment with the rem. */
10994 }
10995 }
10996 }
10997 }
10999 }
11001 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
11002 resulting value as a tree with type TYPE. The mpfr precision is
11003 set to the precision of TYPE. We assume that this mpfr function
11004 returns zero if the result could be calculated exactly within the
11005 requested precision. In addition, the integer pointer represented
11006 by ARG_SG will be dereferenced and set to the appropriate signgam
11007 (-1,1) value. */
11009 static tree
11011 {
11016 /* To proceed, MPFR must exactly represent the target floating point
11017 format, which only happens when the target base equals two. Also
11018 verify ARG is a constant and that ARG_SG is an int pointer. */
11023 {
11026 /* In addition to NaN and Inf, the argument cannot be zero or a
11027 negative integer. */
11031 {
11036 mpfr_t m;
11037 tree result_lg;
11046 {
11047 tree result_sg;
11049 /* Dereference the arg_sg pointer argument. */
11051 /* Assign the signgam value into *arg_sg. */
11056 /* Combine the signgam assignment with the lgamma result. */
11059 }
11060 }
11061 }
11064 }
11066 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
11067 mpc function FUNC on it and return the resulting value as a tree
11068 with type TYPE. The mpfr precision is set to the precision of
11069 TYPE. We assume that function FUNC returns zero if the result
11070 could be calculated exactly within the requested precision. If
11071 DO_NONFINITE is true, then fold expressions containing Inf or NaN
11072 in the arguments and/or results. */
11074 tree
11077 {
11083 /* To proceed, MPFR must exactly represent the target floating point
11084 format, which only happens when the target base equals two. */
11090 {
11099 {
11119 }
11120 }
11123 }
11125 /* A wrapper function for builtin folding that prevents warnings for
11126 "statement without effect" and the like, caused by removing the
11127 call node earlier than the warning is generated. */
11129 tree
11131 {
11137 {
11146 {
11148 }
11149 else
11150 {
11153 {
11154 /* Propagate location information from original call to
11155 expansion of builtin. Otherwise things like
11156 maybe_emit_chk_warning, that operate on the expansion
11157 of a builtin, will use the wrong location information. */
11159 {
11167 }
11169 }
11170 }
11171 }
11173 }
11175 /* Look up the function in builtin_decl that corresponds to DECL
11176 and set ASMSPEC as its user assembler name. DECL must be a
11177 function decl that declares a builtin. */
11179 void
11181 {
11190 {
11194 }
11195 }
11197 /* Return true if DECL is a builtin that expands to a constant or similarly
11198 simple code. */
11199 bool
11201 {
11204 {
11205 /* Builtins that expand to constants. */
11210 /* Simple register moves or loads from stack. */
11221 /* Exception state returns or moves registers around. */
11229 }
11232 }
11234 /* Return true if DECL is a builtin that is not expensive, i.e., they are
11235 most probably expanded inline into reasonably simple code. This is a
11236 superset of is_simple_builtin. */
11237 bool
11239 {
11246 {
11248 CASE_BUILT_IN_ALLOCA:
11314 }
11317 }
11319 /* Return true if T is a constant and the value cast to a target char
11320 can be represented by a host char.
11321 Store the casted char constant in *P if so. */
11323 bool
11325 {
11331 }
11333 /* Return true if the builtin DECL is implemented in a standard library.
11334 Otherwise returns false which doesn't guarantee it is not (thus the list of
11335 handled builtins below may be incomplete). */
11337 bool
11339 {
11342 {
11416 }
11418 }