| blob | 6135bc5a4e2359a1f514310ac28d6dd34808de13 |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2019 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* Legacy warning! Please add no further builtin simplifications here
21 (apart from pure constant folding) - builtin simplifications should go
22 to match.pd or gimple-fold.c instead. */
77 #if SWITCHABLE_TARGET
79 #endif
81 /* Define the names of the builtin function types and codes. */
85 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
87 {
89 };
91 /* Setup an array of builtin_info_type, make sure each element decl is
92 initialized to NULL_TREE. */
95 /* Non-zero if __builtin_constant_p should be folded right away. */
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 (src, 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 SRC 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 = { };
657 {
664 }
672 /* Offset from the beginning of the string in bytes. */
673 tree byteoff;
674 tree memsize;
675 tree decl;
680 /* Determine the size of the string element. */
684 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
685 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
686 in case the latter is less than the size of the array, such as when
687 SRC refers to a short string literal used to initialize a large array.
688 In that case, the elements of the array after the terminating NUL are
689 all NUL. */
698 /* PTR can point to the byte representation of any string type, including
699 char* and wchar_t*. */
703 {
704 /* The code below works only for single byte character types. */
708 /* If the string has an internal NUL character followed by any
709 non-NUL characters (e.g., "foo\0bar"), we can't compute
710 the offset to the following NUL if we don't know where to
711 start searching for it. */
714 /* Return when an embedded null character is found or none at all.
715 In the latter case, set the DECL/LEN field in the DATA structure
716 so that callers may examine them. */
720 {
725 }
727 /* For empty strings the result should be zero. */
731 /* We don't know the starting offset, but we do know that the string
732 has no internal zero bytes. If the offset falls within the bounds
733 of the string subtract the offset from the length of the string,
734 and return that. Otherwise the length is zero. Take care to
735 use SAVE_EXPR in case the OFFSET has side-effects. */
742 offsave);
746 }
748 /* Offset from the beginning of the string in elements. */
749 HOST_WIDE_INT eltoff;
751 /* We have a known offset into the string. Start searching there for
752 a null character if we can represent it as a single HOST_WIDE_INT. */
757 else
760 /* If the offset is known to be out of bounds, warn, and call strlen at
761 runtime. */
763 {
764 /* Suppress multiple warnings for propagated constant strings. */
767 {
770 eltoff);
772 }
774 }
776 /* If eltoff is larger than strelts but less than maxelts the
777 string length is zero, since the excess memory will be zero. */
781 /* Use strlen to search for the first zero byte. Since any strings
782 constructed with build_string will have nulls appended, we win even
783 if we get handed something like (char[4])"abcd".
785 Since ELTOFF is our starting index into the string, no further
786 calculation is needed. */
790 /* Don't know what to return if there was no zero termination.
791 Ideally this would turn into a gcc_checking_assert over time.
792 Set DECL/LEN so callers can examine them. */
794 {
799 }
802 }
804 /* Return a constant integer corresponding to target reading
805 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
807 static rtx
809 {
810 HOST_WIDE_INT ch;
824 {
836 }
840 }
842 /* Cast a target constant CST to target CHAR and if that value fits into
843 host char type, return zero and put that value into variable pointed to by
844 P. */
846 static int
848 {
855 /* Do not care if it fits or not right here. */
870 }
872 /* Similar to save_expr, but assumes that arbitrary code is not executed
873 in between the multiple evaluations. In particular, we assume that a
874 non-addressable local variable will not be modified. */
876 static tree
878 {
886 }
888 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
889 times to get the address of either a higher stack frame, or a return
890 address located within it (depending on FNDECL_CODE). */
892 static rtx
894 {
898 {
899 /* For a zero count with __builtin_return_address, we don't care what
900 frame address we return, because target-specific definitions will
901 override us. Therefore frame pointer elimination is OK, and using
902 the soft frame pointer is OK.
904 For a nonzero count, or a zero count with __builtin_frame_address,
905 we require a stable offset from the current frame pointer to the
906 previous one, so we must use the hard frame pointer, and
907 we must disable frame pointer elimination. */
910 else
911 {
914 /* Tell reload not to eliminate the frame pointer. */
916 }
917 }
922 /* On the SPARC, the return address is not in the frame, it is in a
923 register. There is no way to access it off of the current frame
924 pointer, but it can be accessed off the previous frame pointer by
925 reading the value from the register window save area. */
927 count--;
929 /* Scan back COUNT frames to the specified frame. */
931 {
932 /* Assume the dynamic chain pointer is in the word that the
933 frame address points to, unless otherwise specified. */
938 }
940 /* For __builtin_frame_address, return what we've got. But, on
941 the SPARC for example, we may have to add a bias. */
945 /* For __builtin_return_address, get the return address from that frame. */
946 #ifdef RETURN_ADDR_RTX
948 #else
952 #endif
954 }
956 /* Alias set used for setjmp buffer. */
959 /* Construct the leading half of a __builtin_setjmp call. Control will
960 return to RECEIVER_LABEL. This is also called directly by the SJLJ
961 exception handling code. */
963 void
965 {
967 rtx stack_save;
968 rtx mem;
977 /* We store the frame pointer and the address of receiver_label in
978 the buffer and use the rest of it for the stack save area, which
979 is machine-dependent. */
998 /* If there is further processing to do, do it. */
1002 /* We have a nonlocal label. */
1004 }
1006 /* Construct the trailing part of a __builtin_setjmp call. This is
1007 also called directly by the SJLJ exception handling code.
1008 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
1010 void
1012 {
1013 rtx chain;
1015 /* Mark the FP as used when we get here, so we have to make sure it's
1016 marked as used by this function. */
1019 /* Mark the static chain as clobbered here so life information
1020 doesn't get messed up for it. */
1025 /* Now put in the code to restore the frame pointer, and argument
1026 pointer, if needed. */
1028 {
1029 /* First adjust our frame pointer to its actual value. It was
1030 previously set to the start of the virtual area corresponding to
1031 the stacked variables when we branched here and now needs to be
1032 adjusted to the actual hardware fp value.
1034 Assignments to virtual registers are converted by
1035 instantiate_virtual_regs into the corresponding assignment
1036 to the underlying register (fp in this case) that makes
1037 the original assignment true.
1038 So the following insn will actually be decrementing fp by
1039 TARGET_STARTING_FRAME_OFFSET. */
1042 /* Restoring the frame pointer also modifies the hard frame pointer.
1043 Mark it used (so that the previous assignment remains live once
1044 the frame pointer is eliminated) and clobbered (to represent the
1045 implicit update from the assignment). */
1048 }
1051 {
1052 /* If the argument pointer can be eliminated in favor of the
1053 frame pointer, we don't need to restore it. We assume here
1054 that if such an elimination is present, it can always be used.
1055 This is the case on all known machines; if we don't make this
1056 assumption, we do unnecessary saving on many machines. */
1066 {
1067 /* Now restore our arg pointer from the address at which it
1068 was saved in our stack frame. */
1071 }
1072 }
1078 else
1081 /* We must not allow the code we just generated to be reordered by
1082 scheduling. Specifically, the update of the frame pointer must
1083 happen immediately, not later. */
1085 }
1087 /* __builtin_longjmp is passed a pointer to an array of five words (not
1088 all will be used on all machines). It operates similarly to the C
1089 library function of the same name, but is more efficient. Much of
1090 the code below is copied from the handling of non-local gotos. */
1092 static void
1094 {
1099 /* DRAP is needed for stack realign if longjmp is expanded to current
1100 function */
1111 /* We require that the user must pass a second argument of 1, because
1112 that is what builtin_setjmp will return. */
1118 else
1119 {
1130 /* Pick up FP, label, and SP from the block and jump. This code is
1131 from expand_goto in stmt.c; see there for detailed comments. */
1133 /* We have to pass a value to the nonlocal_goto pattern that will
1134 get copied into the static_chain pointer, but it does not matter
1135 what that value is, because builtin_setjmp does not use it. */
1137 else
1138 {
1144 /* Restore the frame pointer and stack pointer. We must use a
1145 temporary since the setjmp buffer may be a local. */
1153 }
1154 }
1156 /* Search backwards and mark the jump insn as a non-local goto.
1157 Note that this precludes the use of __builtin_longjmp to a
1158 __builtin_setjmp target in the same function. However, we've
1159 already cautioned the user that these functions are for
1160 internal exception handling use only. */
1162 {
1166 {
1169 }
1172 }
1173 }
1177 {
1179 }
1181 /* This function validates the types of a function call argument list
1182 against a specified list of tree_codes. If the last specifier is a 0,
1183 that represents an ellipsis, otherwise the last specifier must be a
1184 VOID_TYPE. */
1186 static bool
1188 {
1192 const_call_expr_arg_iterator iter;
1193 const_tree arg;
1198 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1203 {
1207 {
1209 /* This signifies an ellipses, any further arguments are all ok. */
1213 /* This signifies an endlink, if no arguments remain, return
1214 true, otherwise return false. */
1218 /* The actual argument must be nonnull when either the whole
1219 called function has been declared nonnull, or when the formal
1220 argument corresponding to the actual argument has been. */
1223 {
1228 }
1229 /* FALLTHRU */
1231 /* If no parameters remain or the parameter's code does not
1232 match the specified code, return false. Otherwise continue
1233 checking any remaining arguments. */
1238 }
1239 }
1241 /* We need gotos here since we can only have one VA_CLOSE in a
1242 function. */
1243 end: ;
1249 }
1251 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1252 and the address of the save area. */
1254 static rtx
1256 {
1271 /* Copy the address of the save location to a register just in case it was
1272 based on the frame pointer. */
1281 /* ??? We no longer need to pass the static chain value, afaik. */
1284 else
1285 {
1291 /* Restore the frame pointer and stack pointer. We must use a
1292 temporary since the setjmp buffer may be a local. */
1297 /* USE of hard_frame_pointer_rtx added for consistency;
1298 not clear if really needed. */
1302 /* If the architecture is using a GP register, we must
1303 conservatively assume that the target function makes use of it.
1304 The prologue of functions with nonlocal gotos must therefore
1305 initialize the GP register to the appropriate value, and we
1306 must then make sure that this value is live at the point
1307 of the jump. (Note that this doesn't necessarily apply
1308 to targets with a nonlocal_goto pattern; they are free
1309 to implement it in their own way. Note also that this is
1310 a no-op if the GP register is a global invariant.) */
1316 }
1318 /* Search backwards to the jump insn and mark it as a
1319 non-local goto. */
1321 {
1323 {
1326 }
1329 }
1332 }
1334 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1335 (not all will be used on all machines) that was passed to __builtin_setjmp.
1336 It updates the stack pointer in that block to the current value. This is
1337 also called directly by the SJLJ exception handling code. */
1339 void
1341 {
1344 rtx stack_save
1346 memory_address
1352 }
1354 /* Expand a call to __builtin_prefetch. For a target that does not support
1355 data prefetch, evaluate the memory address argument in case it has side
1356 effects. */
1358 static void
1360 {
1370 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1371 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1372 locality). */
1376 else
1380 else
1383 /* Argument 0 is an address. */
1386 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1388 {
1391 }
1393 /* Argument 1 must be either zero or one. */
1395 {
1399 }
1401 /* Argument 2 (locality) must be a compile-time constant int. */
1403 {
1406 }
1408 /* Argument 2 must be 0, 1, 2, or 3. */
1410 {
1413 }
1416 {
1424 }
1426 /* Don't do anything with direct references to volatile memory, but
1427 generate code to handle other side effects. */
1430 }
1432 /* Get a MEM rtx for expression EXP which is the address of an operand
1433 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1434 the maximum length of the block of memory that might be accessed or
1435 NULL if unknown. */
1437 static rtx
1439 {
1443 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1444 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1451 /* Get an expression we can use to find the attributes to assign to MEM.
1452 First remove any nops. */
1457 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1458 (as builtin stringops may alias with anything). */
1465 /* If the MEM_REF has no acceptable address, try to get the base object
1466 from the original address we got, and build an all-aliasing
1467 unknown-sized access to that one. */
1473 {
1478 size_zero_node,
1479 NULL)),
1482 }
1485 }
1486 \f
1487 /* Built-in functions to perform an untyped call and return. */
1489 #define apply_args_mode \
1490 (this_target_builtins->x_apply_args_mode)
1491 #define apply_result_mode \
1492 (this_target_builtins->x_apply_result_mode)
1494 /* Return the size required for the block returned by __builtin_apply_args,
1495 and initialize apply_args_mode. */
1497 static int
1499 {
1504 /* The values computed by this function never change. */
1506 {
1507 /* The first value is the incoming arg-pointer. */
1510 /* The second value is the structure value address unless this is
1511 passed as an "invisible" first argument. */
1517 {
1527 }
1528 else
1529 {
1531 }
1532 }
1534 }
1536 /* Return the size required for the block returned by __builtin_apply,
1537 and initialize apply_result_mode. */
1539 static int
1541 {
1545 /* The values computed by this function never change. */
1547 {
1552 {
1562 }
1563 else
1566 /* Allow targets that use untyped_call and untyped_return to override
1567 the size so that machine-specific information can be stored here. */
1568 #ifdef APPLY_RESULT_SIZE
1570 #endif
1571 }
1573 }
1575 /* Create a vector describing the result block RESULT. If SAVEP is true,
1576 the result block is used to save the values; otherwise it is used to
1577 restore the values. */
1579 static rtx
1581 {
1583 fixed_size_mode mode;
1590 {
1600 }
1602 }
1604 /* Save the state required to perform an untyped call with the same
1605 arguments as were passed to the current function. */
1607 static rtx
1609 {
1612 fixed_size_mode mode;
1613 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1615 /* Create a block where the arg-pointer, structure value address,
1616 and argument registers can be saved. */
1619 /* Walk past the arg-pointer and structure value address. */
1624 /* Save each register used in calling a function to the block. */
1627 {
1636 }
1638 /* Save the arg pointer to the block. */
1640 /* We need the pointer as the caller actually passed them to us, not
1641 as we might have pretended they were passed. Make sure it's a valid
1642 operand, as emit_move_insn isn't expected to handle a PLUS. */
1644 tem
1647 NULL_RTX);
1652 /* Save the structure value address unless this is passed as an
1653 "invisible" first argument. */
1655 {
1659 }
1661 /* Return the address of the block. */
1663 }
1665 /* __builtin_apply_args returns block of memory allocated on
1666 the stack into which is stored the arg pointer, structure
1667 value address, static chain, and all the registers that might
1668 possibly be used in performing a function call. The code is
1669 moved to the start of the function so the incoming values are
1670 saved. */
1672 static rtx
1674 {
1675 /* Don't do __builtin_apply_args more than once in a function.
1676 Save the result of the first call and reuse it. */
1679 {
1680 /* When this function is called, it means that registers must be
1681 saved on entry to this function. So we migrate the
1682 call to the first insn of this function. */
1683 rtx temp;
1692 /* Put the insns after the NOTE that starts the function.
1693 If this is inside a start_sequence, make the outer-level insn
1694 chain current, so the code is placed at the start of the
1695 function. If internal_arg_pointer is a non-virtual pseudo,
1696 it needs to be placed after the function that initializes
1697 that pseudo. */
1702 else
1706 }
1707 }
1709 /* Perform an untyped call and save the state required to perform an
1710 untyped return of whatever value was returned by the given function. */
1712 static rtx
1714 {
1716 fixed_size_mode mode;
1725 /* Create a block where the return registers can be saved. */
1728 /* Fetch the arg pointer from the ARGUMENTS block. */
1735 /* Push a new argument block and copy the arguments. Do not allow
1736 the (potential) memcpy call below to interfere with our stack
1737 manipulations. */
1739 NO_DEFER_POP;
1741 /* Save the stack with nonlocal if available. */
1744 else
1747 /* Allocate a block of memory onto the stack and copy the memory
1748 arguments to the outgoing arguments address. We can pass TRUE
1749 as the 4th argument because we just saved the stack pointer
1750 and will restore it right after the call. */
1753 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1754 may have already set current_function_calls_alloca to true.
1755 current_function_calls_alloca won't be set if argsize is zero,
1756 so we have to guarantee need_drap is true here. */
1762 {
1765 else
1767 }
1774 /* Refer to the argument block. */
1779 /* Walk past the arg-pointer and structure value address. */
1784 /* Restore each of the registers previously saved. Make USE insns
1785 for each of these registers for use in making the call. */
1788 {
1796 }
1798 /* Restore the structure value address unless this is passed as an
1799 "invisible" first argument. */
1802 {
1809 }
1811 /* All arguments and registers used for the call are set up by now! */
1814 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1815 and we don't want to load it into a register as an optimization,
1816 because prepare_call_address already did it if it should be done. */
1820 /* Generate the actual call instruction and save the return value. */
1822 {
1826 }
1828 {
1831 /* Locate the unique return register. It is not possible to
1832 express a call that sets more than one return register using
1833 call_value; use untyped_call for that. In fact, untyped_call
1834 only needs to save the return registers in the given block. */
1837 {
1841 }
1848 }
1849 else
1852 /* Find the CALL insn we just emitted, and attach the register usage
1853 information. */
1857 /* Restore the stack. */
1860 else
1864 OK_DEFER_POP;
1866 /* Return the address of the result block. */
1869 }
1871 /* Perform an untyped return. */
1873 static void
1875 {
1877 fixed_size_mode mode;
1878 rtx reg;
1887 {
1892 }
1894 /* Restore the return value and note that each value is used. */
1898 {
1910 }
1912 /* Put the USE insns before the return. */
1915 /* Return whatever values was restored by jumping directly to the end
1916 of the function. */
1918 }
1920 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1922 static enum type_class
1924 {
1926 {
1945 }
1946 }
1948 /* Expand a call EXP to __builtin_classify_type. */
1950 static rtx
1952 {
1956 }
1958 /* This helper macro, meant to be used in mathfn_built_in below, determines
1959 which among a set of builtin math functions is appropriate for a given type
1960 mode. The `F' (float) and `L' (long double) are automatically generated
1961 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1962 types, there are additional types that are considered with 'F32', 'F64',
1963 'F128', etc. suffixes. */
1964 #define CASE_MATHFN(MATHFN) \
1965 CASE_CFN_##MATHFN: \
1966 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1967 fcodel = BUILT_IN_##MATHFN##L ; break;
1968 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1969 types. */
1970 #define CASE_MATHFN_FLOATN(MATHFN) \
1971 CASE_CFN_##MATHFN: \
1972 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1973 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1974 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1975 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1976 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1977 break;
1978 /* Similar to above, but appends _R after any F/L suffix. */
1979 #define CASE_MATHFN_REENT(MATHFN) \
1980 case CFN_BUILT_IN_##MATHFN##_R: \
1981 case CFN_BUILT_IN_##MATHFN##F_R: \
1982 case CFN_BUILT_IN_##MATHFN##L_R: \
1983 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1984 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1986 /* Return a function equivalent to FN but operating on floating-point
1987 values of type TYPE, or END_BUILTINS if no such function exists.
1988 This is purely an operation on function codes; it does not guarantee
1989 that the target actually has an implementation of the function. */
1991 static built_in_function
1993 {
1994 tree mtype;
2005 {
2096 }
2119 else
2121 }
2123 /* Return mathematic function equivalent to FN but operating directly on TYPE,
2124 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2125 otherwise use the explicit declaration. If we can't do the conversion,
2126 return null. */
2128 static tree
2130 {
2139 }
2141 /* Like mathfn_built_in_1, but always use the implicit array. */
2143 tree
2145 {
2147 }
2149 /* Like mathfn_built_in_1, but take a built_in_function and
2150 always use the implicit array. */
2152 tree
2154 {
2156 }
2158 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2159 return its code, otherwise return IFN_LAST. Note that this function
2160 only tests whether the function is defined in internals.def, not whether
2161 it is actually available on the target. */
2163 internal_fn
2165 {
2169 {
2170 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2171 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2172 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2173 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2174 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2175 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2176 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2193 }
2194 }
2196 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2197 on the current target by a call to an internal function, return the
2198 code of that internal function, otherwise return IFN_LAST. The caller
2199 is responsible for ensuring that any side-effects of the built-in
2200 call are dealt with correctly. E.g. if CALL sets errno, the caller
2201 must decide that the errno result isn't needed or make it available
2202 in some other way. */
2204 internal_fn
2206 {
2208 {
2211 {
2216 }
2217 }
2219 }
2221 /* Expand a call to the builtin trinary math functions (fma).
2222 Return NULL_RTX if a normal call should be emitted rather than expanding the
2223 function in-line. EXP is the expression that is a call to the builtin
2224 function; if convenient, the result should be placed in TARGET.
2225 SUBTARGET may be used as the target for computing one of EXP's
2226 operands. */
2228 static rtx
2230 {
2231 optab builtin_optab;
2236 machine_mode mode;
2246 {
2252 }
2254 /* Make a suitable register to place result in. */
2257 /* Before working hard, check whether the instruction is available. */
2263 /* Always stabilize the argument list. */
2274 /* Compute into RESULT.
2275 Set RESULT to wherever the result comes back. */
2279 /* If we were unable to expand via the builtin, stop the sequence
2280 (without outputting the insns) and call to the library function
2281 with the stabilized argument list. */
2283 {
2286 }
2288 /* Output the entire sequence. */
2294 }
2296 /* Expand a call to the builtin sin and cos math functions.
2297 Return NULL_RTX if a normal call should be emitted rather than expanding the
2298 function in-line. EXP is the expression that is a call to the builtin
2299 function; if convenient, the result should be placed in TARGET.
2300 SUBTARGET may be used as the target for computing one of EXP's
2301 operands. */
2303 static rtx
2305 {
2306 optab builtin_optab;
2307 rtx op0;
2310 machine_mode mode;
2311 tree arg;
2319 {
2325 }
2327 /* Make a suitable register to place result in. */
2330 /* Check if sincos insn is available, otherwise fallback
2331 to sin or cos insn. */
2334 {
2341 }
2343 /* Before working hard, check whether the instruction is available. */
2345 {
2348 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2349 need to expand the argument again. This way, we will not perform
2350 side-effects more the once. */
2357 /* Compute into RESULT.
2358 Set RESULT to wherever the result comes back. */
2360 {
2364 {
2373 }
2375 }
2376 else
2380 {
2381 /* Output the entire sequence. */
2386 }
2388 /* If we were unable to expand via the builtin, stop the sequence
2389 (without outputting the insns) and call to the library function
2390 with the stabilized argument list. */
2392 }
2395 }
2397 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2398 return an RTL instruction code that implements the functionality.
2399 If that isn't possible or available return CODE_FOR_nothing. */
2401 static enum insn_code
2403 {
2406 machine_mode mode;
2409 {
2423 /* These builtins have no optabs (yet). */
2427 }
2429 /* There's no easy way to detect the case we need to set EDOM. */
2433 /* Optab mode depends on the mode of the input argument. */
2439 }
2441 /* Expand a call to one of the builtin math functions that operate on
2442 floating point argument and output an integer result (ilogb, isinf,
2443 isnan, etc).
2444 Return 0 if a normal call should be emitted rather than expanding the
2445 function in-line. EXP is the expression that is a call to the builtin
2446 function; if convenient, the result should be placed in TARGET. */
2448 static rtx
2450 {
2452 rtx op0;
2454 machine_mode mode;
2455 tree arg;
2465 {
2470 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2471 need to expand the argument again. This way, we will not perform
2472 side-effects more the once. */
2487 }
2490 }
2492 /* Expand a call to the builtin sincos math function.
2493 Return NULL_RTX if a normal call should be emitted rather than expanding the
2494 function in-line. EXP is the expression that is a call to the builtin
2495 function. */
2497 static rtx
2499 {
2501 machine_mode mode;
2515 /* Make a suitable register to place result in. */
2518 /* Check if sincos insn is available, otherwise emit the call. */
2533 /* Compute into target1 and target2.
2534 Set TARGET to wherever the result comes back. */
2538 /* Move target1 and target2 to the memory locations indicated
2539 by op1 and op2. */
2544 }
2546 /* Expand a call to the internal cexpi builtin to the sincos math function.
2547 EXP is the expression that is a call to the builtin function; if convenient,
2548 the result should be placed in TARGET. */
2550 static rtx
2552 {
2555 machine_mode mode;
2566 /* Try expanding via a sincos optab, fall back to emitting a libcall
2567 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2568 is only generated from sincos, cexp or if we have either of them. */
2570 {
2576 /* Compute into op1 and op2. */
2578 }
2580 {
2591 else
2601 /* Make sure not to fold the sincos call again. */
2605 }
2606 else
2607 {
2617 else
2620 /* If we don't have a decl for cexp create one. This is the
2621 friendliest fallback if the user calls __builtin_cexpi
2622 without full target C99 function support. */
2624 {
2625 tree fntype;
2637 }
2642 /* Make sure not to fold the cexp call again. */
2646 }
2648 /* Now build the proper return type. */
2653 }
2655 /* Conveniently construct a function call expression. FNDECL names the
2656 function to be called, N is the number of arguments, and the "..."
2657 parameters are the argument expressions. Unlike build_call_exr
2658 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2660 static tree
2662 {
2672 }
2674 /* Expand a call to one of the builtin rounding functions gcc defines
2675 as an extension (lfloor and lceil). As these are gcc extensions we
2676 do not need to worry about setting errno to EDOM.
2677 If expanding via optab fails, lower expression to (int)(floor(x)).
2678 EXP is the expression that is a call to the builtin function;
2679 if convenient, the result should be placed in TARGET. */
2681 static rtx
2683 {
2684 convert_optab builtin_optab;
2689 tree fallback_fndecl;
2690 machine_mode mode;
2691 tree arg;
2699 {
2716 }
2718 /* Make a suitable register to place result in. */
2723 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2724 need to expand the argument again. This way, we will not perform
2725 side-effects more the once. */
2732 /* Compute into TARGET. */
2734 {
2735 /* Output the entire sequence. */
2740 }
2742 /* If we were unable to expand via the builtin, stop the sequence
2743 (without outputting the insns). */
2746 /* Fall back to floating point rounding optab. */
2749 /* For non-C99 targets we may end up without a fallback fndecl here
2750 if the user called __builtin_lfloor directly. In this case emit
2751 a call to the floor/ceil variants nevertheless. This should result
2752 in the best user experience for not full C99 targets. */
2754 {
2755 tree fntype;
2759 {
2792 }
2797 }
2804 /* Truncate the result of floating point optab to integer
2805 via expand_fix (). */
2810 }
2812 /* Expand a call to one of the builtin math functions doing integer
2813 conversion (lrint).
2814 Return 0 if a normal call should be emitted rather than expanding the
2815 function in-line. EXP is the expression that is a call to the builtin
2816 function; if convenient, the result should be placed in TARGET. */
2818 static rtx
2820 {
2821 convert_optab builtin_optab;
2822 rtx op0;
2825 tree arg;
2826 machine_mode mode;
2835 {
2854 }
2856 /* There's no easy way to detect the case we need to set EDOM. */
2860 /* Make a suitable register to place result in. */
2863 /* There's no easy way to detect the case we need to set EDOM. */
2865 {
2868 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2869 need to expand the argument again. This way, we will not perform
2870 side-effects more the once. */
2878 {
2879 /* Output the entire sequence. */
2884 }
2886 /* If we were unable to expand via the builtin, stop the sequence
2887 (without outputting the insns) and call to the library function
2888 with the stabilized argument list. */
2890 }
2893 {
2894 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2895 targets, (int) round (x) should never be transformed into
2896 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2897 a call to lround in the hope that the target provides at least some
2898 C99 functions. This should result in the best user experience for
2899 not full C99 targets. */
2900 tree fallback_fndecl = mathfn_built_in_1
2909 }
2912 }
2914 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2915 a normal call should be emitted rather than expanding the function
2916 in-line. EXP is the expression that is a call to the builtin
2917 function; if convenient, the result should be placed in TARGET. */
2919 static rtx
2921 {
2924 machine_mode mode;
2925 machine_mode mode2;
2934 /* Emit a libcall to libgcc. */
2936 /* Mode of the 2nd argument must match that of an int. */
2954 }
2956 /* Expand expression EXP which is a call to the strlen builtin. Return
2957 NULL_RTX if we failed and the caller should emit a normal call, otherwise
2958 try to get the result in TARGET, if convenient. */
2960 static rtx
2962 machine_mode target_mode)
2963 {
2968 rtx pat;
2969 tree len;
2971 rtx src_reg;
2973 machine_mode insn_mode;
2977 /* If the length can be computed at compile-time, return it. */
2982 /* If the length can be computed at compile-time and is constant
2983 integer, but there are side-effects in src, evaluate
2984 src for side-effects, then return len.
2985 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2986 can be optimized into: i++; x = 3; */
2989 {
2992 }
2996 /* If SRC is not a pointer type, don't do this operation inline. */
3000 /* Bail out if we can't compute strlen in the right mode. */
3002 {
3006 }
3010 /* Make a place to hold the source address. We will not expand
3011 the actual source until we are sure that the expansion will
3012 not fail -- there are trees that cannot be expanded twice. */
3015 /* Mark the beginning of the strlen sequence so we can emit the
3016 source operand later. */
3026 /* Check to see if the argument was declared attribute nonstring
3027 and if so, issue a warning since at this point it's not known
3028 to be nul-terminated. */
3031 /* Now that we are assured of success, expand the source. */
3035 {
3036 #ifdef POINTERS_EXTEND_UNSIGNED
3039 POINTERS_EXTEND_UNSIGNED);
3040 #endif
3042 }
3048 else
3051 /* Return the value in the proper mode for this function. */
3056 else
3060 }
3062 /* Expand call EXP to the strnlen built-in, returning the result
3063 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
3065 static rtx
3067 {
3084 /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
3085 so these conversions aren't necessary. */
3086 c_strlen_data lendata = { };
3092 {
3096 "%K%qD specified bound %E "
3103 {
3104 /* Clear EXACT if LEN may be less than SRC suggests,
3105 such as in
3106 strnlen (&a[i], sizeof a)
3107 where the value of i is unknown. Unless i's value is
3108 zero, the call is unsafe because the bound is greater. */
3112 }
3118 {
3119 location_t warnloc
3123 exact
3129 {
3134 }
3135 }
3142 }
3155 "%K%qD specified bound [%wu, %wu] "
3162 {
3166 }
3172 {
3173 location_t warnloc
3177 exact
3183 {
3187 }
3188 }
3198 }
3200 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3201 bytes from constant string DATA + OFFSET and return it as target
3202 constant. */
3204 static rtx
3206 scalar_int_mode mode)
3207 {
3215 }
3217 /* LEN specify length of the block of memcpy/memset operation.
3218 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3219 In some cases we can make very likely guess on max size, then we
3220 set it into PROBABLE_MAX_SIZE. */
3222 static void
3227 {
3229 {
3232 }
3233 else
3234 {
3238 /* Determine bounds from the type. */
3241 else
3246 else
3252 {
3257 }
3259 {
3260 /* Anti range 0...N lets us to determine minimal size to N+1. */
3262 {
3265 }
3266 /* Code like
3268 int n;
3269 if (n < 100)
3270 memcpy (a, b, n)
3272 Produce anti range allowing negative values of N. We still
3273 can use the information and make a guess that N is not negative.
3274 */
3277 }
3278 }
3282 }
3284 /* Try to verify that the sizes and lengths of the arguments to a string
3285 manipulation function given by EXP are within valid bounds and that
3286 the operation does not lead to buffer overflow or read past the end.
3287 Arguments other than EXP may be null. When non-null, the arguments
3288 have the following meaning:
3289 DST is the destination of a copy call or NULL otherwise.
3290 SRC is the source of a copy call or NULL otherwise.
3291 DSTWRITE is the number of bytes written into the destination obtained
3292 from the user-supplied size argument to the function (such as in
3293 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3294 MAXREAD is the user-supplied bound on the length of the source sequence
3295 (such as in strncat(d, s, N). It specifies the upper limit on the number
3296 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3297 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3298 expression EXP is a string function call (as opposed to a memory call
3299 like memcpy). As an exception, SRCSTR can also be an integer denoting
3300 the precomputed size of the source string or object (for functions like
3301 memcpy).
3302 DSTSIZE is the size of the destination object specified by the last
3303 argument to the _chk builtins, typically resulting from the expansion
3304 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3305 DSTSIZE).
3307 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3308 SIZE_MAX.
3310 If the call is successfully verified as safe return true, otherwise
3311 return false. */
3313 static bool
3316 {
3319 /* The size of the largest object is half the address space, or
3320 PTRDIFF_MAX. (This is way too permissive.) */
3323 /* Either the length of the source string for string functions or
3324 the size of the source object for raw memory functions. */
3329 /* Set to true when the exact number of bytes written by a string
3330 function like strcpy is not known and the only thing that is
3331 known is that it must be at least one (for the terminating nul). */
3334 {
3335 /* SRCSTR is normally a pointer to string but as a special case
3336 it can be an integer denoting the length of a string. */
3338 {
3339 /* Try to determine the range of lengths the source string
3340 refers to. If it can be determined and is less than
3341 the upper bound given by MAXREAD add one to it for
3342 the terminating nul. Otherwise, set it to one for
3343 the same reason, or to MAXREAD as appropriate. */
3344 c_strlen_data lendata = { };
3349 {
3352 else
3363 }
3364 else
3365 {
3368 }
3369 }
3370 else
3372 }
3375 {
3376 /* When the only available piece of data is the object size
3377 there is nothing to do. */
3381 /* Otherwise, when the length of the source sequence is known
3382 (as with strlen), set DSTWRITE to it. */
3385 }
3395 /* First check the number of bytes to be written against the maximum
3396 object size. */
3400 {
3410 "%K%qD specified size %E "
3413 else
3415 "%K%qD specified size between %E and %E "
3423 }
3425 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3426 constant, and in range of unsigned HOST_WIDE_INT. */
3429 /* Next check the number of bytes to be written against the destination
3430 object size. */
3432 {
3437 || (dstwrite
3440 {
3448 {
3449 /* This is a call to strcpy with a destination of 0 size
3450 and a source of unknown length. The call will write
3451 at least one byte past the end of the destination. */
3453 "%K%qD writing %E or more bytes into a region "
3456 }
3459 "%K%qD writing %E byte into a region "
3461 "%K%qD writing %E bytes into a region "
3465 {
3466 /* Avoid printing the upper bound if it's invalid. */
3468 "%K%qD writing %E or more bytes into a region "
3471 }
3472 else
3474 "%K%qD writing between %E and %E bytes into "
3477 dstsize);
3479 /* Return error when an overflow has been detected. */
3481 }
3482 }
3484 /* Check the maximum length of the source sequence against the size
3485 of the destination object if known, or against the maximum size
3486 of an object. */
3488 {
3491 /* Use the lower end for MAXREAD from now on. */
3496 {
3501 {
3505 /* Warn about crazy big sizes first since that's more
3506 likely to be meaningful than saying that the bound
3507 is greater than the object size if both are big. */
3510 "%K%qD specified bound %E "
3514 else
3516 "%K%qD specified bound between %E and %E "
3522 }
3525 {
3531 "%K%qD specified bound %E "
3535 else
3537 "%K%qD specified bound between %E and %E "
3542 }
3543 }
3544 }
3546 /* Check for reading past the end of SRC. */
3551 {
3563 {
3564 /* Avoid printing the upper bound if it's invalid. */
3566 "%K%qD reading %E or more bytes from a region "
3569 }
3570 else
3572 "%K%qD reading between %E and %E bytes from a region "
3576 }
3579 }
3581 /* Helper to compute the size of the object referenced by the DEST
3582 expression which must have pointer type, using Object Size type
3583 OSTYPE (only the least significant 2 bits are used). Return
3584 an estimate of the size of the object if successful or NULL when
3585 the size cannot be determined. When the referenced object involves
3586 a non-constant offset in some range the returned value represents
3587 the largest size given the smallest non-negative offset in the
3588 range. The function is intended for diagnostics and should not
3589 be used to influence code generation or optimization. */
3591 tree
3593 {
3596 /* Only the two least significant bits are meaningful. */
3603 {
3612 {
3613 /* compute_builtin_object_size fails for addresses with
3614 non-constant offsets. Try to determine the range of
3615 such an offset here and use it to adjust the constant
3616 size. */
3619 {
3621 {
3625 /* Ignore negative offsets for now. For others,
3626 use the lower bound as the most optimistic
3627 estimate of the (remaining) size. */
3629 ;
3633 else
3635 }
3636 }
3639 {
3644 {
3646 {
3649 /* Ignore negative offsets for now. For others,
3650 use the lower bound as the most optimistic
3651 estimate of the (remaining)size. */
3653 ;
3657 else
3659 }
3660 }
3661 }
3662 }
3665 }
3667 /* Unless computing the largest size (for memcpy and other raw memory
3668 functions), try to determine the size of the object from its type. */
3683 {
3684 /* Return the constant size unless it's zero (that's a zero-length
3685 array likely at the end of a struct). */
3690 }
3693 }
3695 /* Helper to determine and check the sizes of the source and the destination
3696 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3697 call expression, DEST is the destination argument, SRC is the source
3698 argument or null, and LEN is the number of bytes. Use Object Size type-0
3699 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3700 (no overflow or invalid sizes), false otherwise. */
3702 static bool
3704 {
3705 /* For functions like memset and memcpy that operate on raw memory
3706 try to determine the size of the largest source and destination
3707 object using type-0 Object Size regardless of the object size
3708 type specified by the option. */
3714 }
3716 /* Validate memchr arguments without performing any expansion.
3717 Return NULL_RTX. */
3719 static rtx
3721 {
3729 /* Diagnose calls where the specified length exceeds the size
3730 of the object. */
3732 {
3736 }
3739 }
3741 /* Expand a call EXP to the memcpy builtin.
3742 Return NULL_RTX if we failed, the caller should emit a normal call,
3743 otherwise try to get the result in TARGET, if convenient (and in
3744 mode MODE if that's convenient). */
3746 static rtx
3748 {
3761 }
3763 /* Check a call EXP to the memmove built-in for validity.
3764 Return NULL_RTX on both success and failure. */
3766 static rtx
3768 {
3780 }
3782 /* Expand a call EXP to the mempcpy builtin.
3783 Return NULL_RTX if we failed; the caller should emit a normal call,
3784 otherwise try to get the result in TARGET, if convenient (and in
3785 mode MODE if that's convenient). */
3787 static rtx
3789 {
3798 /* Policy does not generally allow using compute_objsize (which
3799 is used internally by check_memop_size) to change code generation
3800 or drive optimization decisions.
3802 In this instance it is safe because the code we generate has
3803 the same semantics regardless of the return value of
3804 check_memop_sizes. Exactly the same amount of data is copied
3805 and the return value is exactly the same in both cases.
3807 Furthermore, check_memop_size always uses mode 0 for the call to
3808 compute_objsize, so the imprecise nature of compute_objsize is
3809 avoided. */
3811 /* Avoid expanding mempcpy into memcpy when the call is determined
3812 to overflow the buffer. This also prevents the same overflow
3813 from being diagnosed again when expanding memcpy. */
3819 }
3821 /* Helper function to do the actual work for expand of memory copy family
3822 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3823 of memory from SRC to DEST and assign to TARGET if convenient. Return
3824 value is based on RETMODE argument. */
3826 static rtx
3829 {
3840 /* If DEST is not a pointer type, call the normal function. */
3844 /* If either SRC is not a pointer type, don't do this
3845 operation in-line. */
3862 /* If SRC is a string constant and block move would be done
3863 by pieces, we can avoid loading the string from memory
3864 and only stored the computed constants. */
3871 {
3873 builtin_memcpy_read_str,
3879 }
3884 /* Copy word part most expediently. */
3898 {
3901 }
3904 {
3906 /* stpcpy pointer to last byte. */
3909 }
3912 }
3914 static rtx
3917 {
3919 retmode);
3920 }
3922 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3923 we failed, the caller should emit a normal call, otherwise try to
3924 get the result in TARGET, if convenient.
3925 Return value is based on RETMODE argument. */
3927 static rtx
3929 {
3931 rtx dest_mem;
3932 rtx src_mem;
3940 {
3943 }
3953 {
3955 /* movstr is supposed to set end to the address of the NUL
3956 terminator. If the caller requested a mempcpy-like return value,
3957 adjust it. */
3959 {
3963 }
3964 }
3966 }
3968 /* Do some very basic size validation of a call to the strcpy builtin
3969 given by EXP. Return NULL_RTX to have the built-in expand to a call
3970 to the library function. */
3972 static rtx
3974 {
3982 /* There is no way here to determine the length of the string in
3983 the destination to which the SRC string is being appended so
3984 just diagnose cases when the souce string is longer than
3985 the destination object. */
3990 destsize);
3993 }
3995 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3996 NULL_RTX if we failed the caller should emit a normal call, otherwise
3997 try to get the result in TARGET, if convenient (and in mode MODE if that's
3998 convenient). */
4000 static rtx
4002 {
4010 {
4014 }
4017 {
4018 /* Check to see if the argument was declared attribute nonstring
4019 and if so, issue a warning since at this point it's not known
4020 to be nul-terminated. */
4024 }
4027 }
4029 /* Helper function to do the actual work for expand_builtin_strcpy. The
4030 arguments to the builtin_strcpy call DEST and SRC are broken out
4031 so that this can also be called without constructing an actual CALL_EXPR.
4032 The other arguments and return value are the same as for
4033 expand_builtin_strcpy. */
4035 static rtx
4037 {
4038 /* Detect strcpy calls with unterminated arrays.. */
4040 {
4041 /* NONSTR refers to the non-nul terminated constant array. */
4045 }
4048 }
4050 /* Expand a call EXP to the stpcpy builtin.
4051 Return NULL_RTX if we failed the caller should emit a normal call,
4052 otherwise try to get the result in TARGET, if convenient (and in
4053 mode MODE if that's convenient). */
4055 static rtx
4057 {
4068 {
4072 }
4074 /* If return value is ignored, transform stpcpy into strcpy. */
4076 {
4080 }
4081 else
4082 {
4084 rtx ret;
4086 /* Ensure we get an actual string whose length can be evaluated at
4087 compile-time, not an expression containing a string. This is
4088 because the latter will potentially produce pessimized code
4089 when used to produce the return value. */
4090 c_strlen_data lendata = { };
4108 {
4112 {
4116 {
4118 {
4121 else
4123 }
4132 }
4133 }
4134 }
4138 }
4139 }
4141 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
4142 arguments while being careful to avoid duplicate warnings (which could
4143 be issued if the expander were to expand the call, resulting in it
4144 being emitted in expand_call(). */
4146 static rtx
4148 {
4150 {
4151 /* The call has been successfully expanded. Check for nonstring
4152 arguments and issue warnings as appropriate. */
4155 }
4158 }
4160 /* Check a call EXP to the stpncpy built-in for validity.
4161 Return NULL_RTX on both success and failure. */
4163 static rtx
4165 {
4171 /* The source and destination of the call. */
4175 /* The exact number of bytes to write (not the maximum). */
4178 /* The size of the destination object. */
4184 }
4186 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4187 bytes from constant string DATA + OFFSET and return it as target
4188 constant. */
4190 rtx
4192 scalar_int_mode mode)
4193 {
4200 }
4202 /* Helper to check the sizes of sequences and the destination of calls
4203 to __builtin_strncat and __builtin___strncat_chk. Returns true on
4204 success (no overflow or invalid sizes), false otherwise. */
4206 static bool
4208 {
4213 /* Try to determine the range of lengths that the source expression
4214 refers to. */
4215 c_strlen_data lendata = { };
4218 /* Try to verify that the destination is big enough for the shortest
4219 string. */
4222 {
4223 /* If it hasn't been provided by __strncat_chk, try to determine
4224 the size of the destination object into which the source is
4225 being copied. */
4227 }
4229 /* Add one for the terminating nul. */
4232 size_one_node)
4235 /* The strncat function copies at most MAXREAD bytes and always appends
4236 the terminating nul so the specified upper bound should never be equal
4237 to (or greater than) the size of the destination. */
4240 {
4249 }
4257 /* The number of bytes to write is LEN but check_access will also
4258 check SRCLEN if LEN's value isn't known. */
4260 objsize);
4261 }
4263 /* Similar to expand_builtin_strcat, do some very basic size validation
4264 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4265 the built-in expand to a call to the library function. */
4267 static rtx
4269 {
4277 /* The upper bound on the number of bytes to write. */
4279 /* The length of the source sequence. */
4282 /* Try to determine the range of lengths that the source expression
4283 refers to. Since the lengths are only used for warning and not
4284 for code generation disable strict mode below. */
4287 {
4288 c_strlen_data lendata = { };
4291 }
4293 /* Try to verify that the destination is big enough for the shortest
4294 string. First try to determine the size of the destination object
4295 into which the source is being copied. */
4298 /* Add one for the terminating nul. */
4299 tree srclen = (maxlen
4301 size_one_node)
4304 /* The strncat function copies at most MAXREAD bytes and always appends
4305 the terminating nul so the specified upper bound should never be equal
4306 to (or greater than) the size of the destination. */
4309 {
4318 }
4326 /* The number of bytes to write is SRCLEN. */
4330 }
4332 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4333 NULL_RTX if we failed the caller should emit a normal call. */
4335 static rtx
4337 {
4342 {
4345 /* The number of bytes to write (not the maximum). */
4347 /* The length of the source sequence. */
4351 {
4355 /* The number of bytes to write is LEN but check_access will also
4356 check SLEN if LEN's value isn't known. */
4358 destsize);
4359 }
4361 /* We must be passed a constant len and src parameter. */
4367 /* We're required to pad with trailing zeros if the requested
4368 len is greater than strlen(s2)+1. In that case try to
4369 use store_by_pieces, if it fails, punt. */
4371 {
4374 rtx dest_mem;
4378 builtin_strncpy_read_str,
4385 builtin_strncpy_read_str,
4387 RETURN_BEGIN);
4391 }
4392 }
4394 }
4396 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4397 bytes from constant string DATA + OFFSET and return it as target
4398 constant. */
4400 rtx
4402 scalar_int_mode mode)
4403 {
4410 }
4412 /* Callback routine for store_by_pieces. Return the RTL of a register
4413 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4414 char value given in the RTL register data. For example, if mode is
4415 4 bytes wide, return the RTL for 0x01010101*data. */
4417 static rtx
4419 scalar_int_mode mode)
4420 {
4436 }
4438 /* Expand expression EXP, which is a call to the memset builtin. Return
4439 NULL_RTX if we failed the caller should emit a normal call, otherwise
4440 try to get the result in TARGET, if convenient (and in mode MODE if that's
4441 convenient). */
4443 static rtx
4445 {
4457 }
4459 /* Helper function to do the actual work for expand_builtin_memset. The
4460 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4461 so that this can also be called without constructing an actual CALL_EXPR.
4462 The other arguments and return value are the same as for
4463 expand_builtin_memset. */
4465 static rtx
4468 {
4471 machine_mode val_mode;
4483 /* If DEST is not a pointer type, don't do this operation in-line. */
4494 /* If the LEN parameter is zero, return DEST. */
4496 {
4497 /* Evaluate and ignore VAL in case it has side-effects. */
4500 }
4502 /* Stabilize the arguments in case we fail. */
4514 {
4515 rtx val_rtx;
4520 /* Assume that we can memset by pieces if we can store
4521 * the coefficients by pieces (in the required modes).
4522 * We can't pass builtin_memset_gen_str as that emits RTL. */
4528 {
4533 }
4537 probable_max_size))
4543 }
4549 {
4556 RETURN_BEGIN);
4561 probable_max_size))
4567 }
4575 probable_max_size);
4578 {
4581 }
4585 do_libcall:
4594 else
4599 }
4601 /* Expand expression EXP, which is a call to the bzero builtin. Return
4602 NULL_RTX if we failed the caller should emit a normal call. */
4604 static rtx
4606 {
4615 /* New argument list transforming bzero(ptr x, int y) to
4616 memset(ptr x, int 0, size_t y). This is done this way
4617 so that if it isn't expanded inline, we fallback to
4618 calling bzero instead of memset. */
4626 }
4628 /* Try to expand cmpstr operation ICODE with the given operands.
4629 Return the result rtx on success, otherwise return null. */
4631 static rtx
4633 HOST_WIDE_INT align)
4634 {
4648 }
4650 /* Expand expression EXP, which is a call to the memcmp built-in function.
4651 Return NULL_RTX if we failed and the caller should emit a normal call,
4652 otherwise try to get the result in TARGET, if convenient.
4653 RESULT_EQ is true if we can relax the returned value to be either zero
4654 or nonzero, without caring about the sign. */
4656 static rtx
4658 {
4669 /* Diagnose calls where the specified length exceeds the size of either
4670 object. */
4676 {
4681 }
4683 /* If the specified length exceeds the size of either object,
4684 call the function. */
4688 /* Due to the performance benefit, always inline the calls first
4689 when result_eq is false. */
4693 {
4697 }
4705 /* If we don't have POINTER_TYPE, call the function. */
4713 /* Set MEM_SIZE as appropriate. */
4715 {
4718 }
4724 {
4728 }
4730 /* If SRC is a string constant and block move would be done
4731 by pieces, we can avoid loading the string from memory
4732 and only stored the computed constants. */
4744 {
4745 /* Return the value in the proper mode for this function. */
4750 {
4753 }
4756 }
4759 }
4761 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4762 if we failed the caller should emit a normal call, otherwise try to get
4763 the result in TARGET, if convenient. */
4765 static rtx
4767 {
4771 /* Due to the performance benefit, always inline the calls first. */
4788 /* If we don't have POINTER_TYPE, call the function. */
4792 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4799 /* Try to call cmpstrsi. */
4804 /* Try to determine at least one length and call cmpstrnsi. */
4806 {
4807 tree len;
4808 rtx arg3_rtx;
4818 /* If we don't have a constant length for the first, use the length
4819 of the second, if we know it. We don't require a constant for
4820 this case; some cost analysis could be done if both are available
4821 but neither is constant. For now, assume they're equally cheap,
4822 unless one has side effects. If both strings have constant lengths,
4823 use the smaller. */
4839 else
4842 /* If both arguments have side effects, we cannot optimize. */
4844 {
4846 result = expand_cmpstrn_or_cmpmem
4849 }
4850 }
4854 {
4855 /* Check to see if the argument was declared attribute nonstring
4856 and if so, issue a warning since at this point it's not known
4857 to be nul-terminated. */
4860 /* Return the value in the proper mode for this function. */
4868 }
4870 /* Expand the library call ourselves using a stabilized argument
4871 list to avoid re-evaluating the function's arguments twice. */
4876 }
4878 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4879 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4880 the result in TARGET, if convenient. */
4882 static rtx
4884 ATTRIBUTE_UNUSED machine_mode mode)
4885 {
4890 /* Due to the performance benefit, always inline the calls first. */
4896 /* If c_strlen can determine an expression for one of the string
4897 lengths, and it doesn't have side effects, then emit cmpstrnsi
4898 using length MIN(strlen(string)+1, arg3). */
4903 tree len;
4924 /* If we don't have a constant length for the first, use the length
4925 of the second, if we know it. If neither string is constant length,
4926 use the given length argument. We don't require a constant for
4927 this case; some cost analysis could be done if both are available
4928 but neither is constant. For now, assume they're equally cheap,
4929 unless one has side effects. If both strings have constant lengths,
4930 use the smaller. */
4948 else
4951 /* If we are not using the given length, we must incorporate it here.
4952 The actual new length parameter will be MIN(len,arg3) in this case. */
4954 {
4957 }
4967 {
4968 /* Check to see if the argument was declared attribute nonstring
4969 and if so, issue a warning since at this point it's not known
4970 to be nul-terminated. */
4973 /* Return the value in the proper mode for this function. */
4981 }
4983 /* Expand the library call ourselves using a stabilized argument
4984 list to avoid re-evaluating the function's arguments twice. */
4989 }
4991 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4992 if that's convenient. */
4994 rtx
4996 {
4997 rtx val;
5000 /* Don't do __builtin_saveregs more than once in a function.
5001 Save the result of the first call and reuse it. */
5005 /* When this function is called, it means that registers must be
5006 saved on entry to this function. So we migrate the call to the
5007 first insn of this function. */
5011 /* Do whatever the machine needs done in this case. */
5019 /* Put the insns after the NOTE that starts the function. If this
5020 is inside a start_sequence, make the outer-level insn chain current, so
5021 the code is placed at the start of the function. */
5027 }
5029 /* Expand a call to __builtin_next_arg. */
5031 static rtx
5033 {
5034 /* Checking arguments is already done in fold_builtin_next_arg
5035 that must be called before this function. */
5040 }
5042 /* Make it easier for the backends by protecting the valist argument
5043 from multiple evaluations. */
5045 static tree
5047 {
5050 /* The current way of determining the type of valist is completely
5051 bogus. We should have the information on the va builtin instead. */
5056 {
5060 /* For this case, the backends will be expecting a pointer to
5061 vatype, but it's possible we've actually been given an array
5062 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
5063 So fix it. */
5065 {
5068 }
5069 }
5070 else
5071 {
5075 {
5081 }
5087 }
5090 }
5092 /* The "standard" definition of va_list is void*. */
5094 tree
5096 {
5098 }
5100 /* The "standard" abi va_list is va_list_type_node. */
5102 tree
5104 {
5106 }
5108 /* The "standard" type of va_list is va_list_type_node. */
5110 tree
5112 {
5119 {
5120 /* If va_list is an array type, the argument may have decayed
5121 to a pointer type, e.g. by being passed to another function.
5122 In that case, unwrap both types so that we can compare the
5123 underlying records. */
5126 {
5129 }
5130 }
5135 }
5137 /* The "standard" implementation of va_start: just assign `nextarg' to
5138 the variable. */
5140 void
5142 {
5145 }
5147 /* Expand EXP, a call to __builtin_va_start. */
5149 static rtx
5151 {
5152 rtx nextarg;
5153 tree valist;
5157 {
5160 }
5170 else
5174 }
5176 /* Expand EXP, a call to __builtin_va_end. */
5178 static rtx
5180 {
5183 /* Evaluate for side effects, if needed. I hate macros that don't
5184 do that. */
5189 }
5191 /* Expand EXP, a call to __builtin_va_copy. We do this as a
5192 builtin rather than just as an assignment in stdarg.h because of the
5193 nastiness of array-type va_list types. */
5195 static rtx
5197 {
5210 {
5214 }
5215 else
5216 {
5219 /* Evaluate to pointers. */
5228 /* "Dereference" to BLKmode memories. */
5236 /* Copy. */
5238 }
5241 }
5243 /* Expand a call to one of the builtin functions __builtin_frame_address or
5244 __builtin_return_address. */
5246 static rtx
5248 {
5249 /* The argument must be a nonnegative integer constant.
5250 It counts the number of frames to scan up the stack.
5251 The value is either the frame pointer value or the return
5252 address saved in that frame. */
5254 /* Warning about missing arg was already issued. */
5257 {
5260 }
5261 else
5262 {
5263 /* Number of frames to scan up the stack. */
5268 /* Some ports cannot access arbitrary stack frames. */
5270 {
5273 }
5276 {
5277 /* Warn since no effort is made to ensure that any frame
5278 beyond the current one exists or can be safely reached. */
5281 }
5283 /* For __builtin_frame_address, return what we've got. */
5291 }
5292 }
5294 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5295 failed and the caller should emit a normal call. */
5297 static rtx
5299 {
5300 rtx op0;
5301 rtx result;
5304 HOST_WIDE_INT max_size;
5307 bool valid_arglist
5310 VOID_TYPE)
5321 || (!alloca_for_var
5324 ))
5325 {
5326 /* -Walloca-larger-than and -Wvla-larger-than settings of
5327 less than HOST_WIDE_INT_MAX override the more general
5328 -Walloc-size-larger-than so unless either of the former
5329 options is smaller than the last one (wchich would imply
5330 that the call was already checked), check the alloca
5331 arguments for overflow. */
5335 }
5337 /* Compute the argument. */
5340 /* Compute the alignment. */
5342 ? BIGGEST_ALIGNMENT
5345 /* Compute the maximum size. */
5350 /* Allocate the desired space. If the allocation stems from the declaration
5351 of a variable-sized object, it cannot accumulate. */
5352 result
5357 }
5359 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5360 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5361 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5362 handle_builtin_stack_restore function. */
5364 static rtx
5366 {
5373 OPTAB_LIB_WIDEN);
5376 OPTAB_LIB_WIDEN);
5381 }
5383 /* Expand a call to bswap builtin in EXP.
5384 Return NULL_RTX if a normal call should be emitted rather than expanding the
5385 function in-line. If convenient, the result should be placed in TARGET.
5386 SUBTARGET may be used as the target for computing one of EXP's operands. */
5388 static rtx
5390 rtx subtarget)
5391 {
5392 tree arg;
5393 rtx op0;
5411 }
5413 /* Expand a call to a unary builtin in EXP.
5414 Return NULL_RTX if a normal call should be emitted rather than expanding the
5415 function in-line. If convenient, the result should be placed in TARGET.
5416 SUBTARGET may be used as the target for computing one of EXP's operands. */
5418 static rtx
5421 {
5422 rtx op0;
5427 /* Compute the argument. */
5429 (subtarget
5433 /* Compute op, into TARGET if possible.
5434 Set TARGET to wherever the result comes back. */
5440 }
5442 /* Expand a call to __builtin_expect. We just return our argument
5443 as the builtin_expect semantic should've been already executed by
5444 tree branch prediction pass. */
5446 static rtx
5448 {
5449 tree arg;
5456 /* When guessing was done, the hints should be already stripped away. */
5460 }
5462 /* Expand a call to __builtin_expect_with_probability. We just return our
5463 argument as the builtin_expect semantic should've been already executed by
5464 tree branch prediction pass. */
5466 static rtx
5468 {
5469 tree arg;
5476 /* When guessing was done, the hints should be already stripped away. */
5480 }
5483 /* Expand a call to __builtin_assume_aligned. We just return our first
5484 argument as the builtin_assume_aligned semantic should've been already
5485 executed by CCP. */
5487 static rtx
5489 {
5493 EXPAND_NORMAL);
5498 }
5500 void
5502 {
5504 {
5506 /* For trap insns when not accumulating outgoing args force
5507 REG_ARGS_SIZE note to prevent crossjumping of calls with
5508 different args sizes. */
5511 }
5512 else
5513 {
5517 }
5520 }
5522 /* Expand a call to __builtin_unreachable. We do nothing except emit
5523 a barrier saying that control flow will not pass here.
5525 It is the responsibility of the program being compiled to ensure
5526 that control flow does never reach __builtin_unreachable. */
5527 static void
5529 {
5531 }
5533 /* Expand EXP, a call to fabs, fabsf or fabsl.
5534 Return NULL_RTX if a normal call should be emitted rather than expanding
5535 the function inline. If convenient, the result should be placed
5536 in TARGET. SUBTARGET may be used as the target for computing
5537 the operand. */
5539 static rtx
5541 {
5542 machine_mode mode;
5543 tree arg;
5544 rtx op0;
5554 }
5556 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5557 Return NULL is a normal call should be emitted rather than expanding the
5558 function inline. If convenient, the result should be placed in TARGET.
5559 SUBTARGET may be used as the target for computing the operand. */
5561 static rtx
5563 {
5565 tree arg;
5577 }
5579 /* Expand a call to __builtin___clear_cache. */
5581 static rtx
5583 {
5585 {
5586 #ifdef CLEAR_INSN_CACHE
5587 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5588 does something. Just do the default expansion to a call to
5589 __clear_cache(). */
5591 #else
5592 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5593 does nothing. There is no need to call it. Do nothing. */
5596 }
5598 /* We have a "clear_cache" insn, and it will handle everything. */
5602 /* We must not expand to a library call. If we did, any
5603 fallback library function in libgcc that might contain a call to
5604 __builtin___clear_cache() would recurse infinitely. */
5606 {
5609 }
5612 {
5625 }
5627 }
5629 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5631 static rtx
5633 {
5636 /* If we don't need too much alignment, we'll have been guaranteed
5637 proper alignment by get_trampoline_type. */
5641 /* Round address up to desired boundary. */
5652 }
5654 static rtx
5656 {
5672 /* If ONSTACK, the TRAMP argument should be the address of a field
5673 within the local function's FRAME decl. Either way, let's see if
5674 we can fill in the MEM_ATTRs for this memory. */
5678 /* Creator of a heap trampoline is responsible for making sure the
5679 address is aligned to at least STACK_BOUNDARY. Normally malloc
5680 will ensure this anyhow. */
5683 {
5687 }
5689 /* The FUNC argument should be the address of the nested function.
5690 Extract the actual function decl to pass to the hook. */
5697 /* Generate insns to initialize the trampoline. */
5701 {
5707 }
5710 }
5712 static rtx
5714 {
5715 rtx tramp;
5726 }
5728 /* Expand a call to the builtin descriptor initialization routine.
5729 A descriptor is made up of a couple of pointers to the static
5730 chain and the code entry in this order. */
5732 static rtx
5734 {
5739 VOID_TYPE))
5753 /* Generate insns to initialize the descriptor. */
5759 }
5761 /* Expand a call to the builtin descriptor adjustment routine. */
5763 static rtx
5765 {
5766 rtx tramp;
5773 /* Unalign the descriptor to allow runtime identification. */
5778 }
5780 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5781 function. The function first checks whether the back end provides
5782 an insn to implement signbit for the respective mode. If not, it
5783 checks whether the floating point format of the value is such that
5784 the sign bit can be extracted. If that is not the case, error out.
5785 EXP is the expression that is a call to the builtin function; if
5786 convenient, the result should be placed in TARGET. */
5787 static rtx
5789 {
5791 scalar_float_mode fmode;
5793 tree arg;
5796 rtx temp;
5809 /* Expand the argument yielding a RTX expression. */
5812 /* Check if the back end provides an insn that handles signbit for the
5813 argument's mode. */
5816 {
5822 }
5824 /* For floating point formats without a sign bit, implement signbit
5825 as "ARG < 0.0". */
5828 {
5829 /* But we can't do this if the format supports signed zero. */
5835 }
5838 {
5841 }
5842 else
5843 {
5845 /* Handle targets with different FP word orders. */
5848 else
5852 }
5854 /* Force the intermediate word_mode (or narrower) result into a
5855 register. This avoids attempting to create paradoxical SUBREGs
5856 of floating point modes below. */
5859 /* If the bitpos is within the "result mode" lowpart, the operation
5860 can be implement with a single bitwise AND. Otherwise, we need
5861 a right shift and an AND. */
5864 {
5872 }
5873 else
5874 {
5875 /* Perform a logical right shift to place the signbit in the least
5876 significant bit, then truncate the result to the desired mode
5877 and mask just this bit. */
5882 }
5885 }
5887 /* Expand fork or exec calls. TARGET is the desired target of the
5888 call. EXP is the call. FN is the
5889 identificator of the actual function. IGNORE is nonzero if the
5890 value is to be ignored. */
5892 static rtx
5894 {
5896 tree call;
5898 /* If we are not profiling, just call the function. */
5902 /* Otherwise call the wrapper. This should be equivalent for the rest of
5903 compiler, so the code does not diverge, and the wrapper may run the
5904 code necessary for keeping the profiling sane. */
5907 {
5938 }
5950 }
5953 \f
5954 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5955 the pointer in these functions is void*, the tree optimizers may remove
5956 casts. The mode computed in expand_builtin isn't reliable either, due
5957 to __sync_bool_compare_and_swap.
5959 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5960 group of builtins. This gives us log2 of the mode size. */
5964 {
5965 /* The size is not negotiable, so ask not to get BLKmode in return
5966 if the target indicates that a smaller size would be better. */
5968 }
5970 /* Expand the memory expression LOC and return the appropriate memory operand
5971 for the builtin_sync operations. */
5973 static rtx
5975 {
5985 /* Note that we explicitly do not want any alias information for this
5986 memory, so that we kill all other live memories. Otherwise we don't
5987 satisfy the full barrier semantics of the intrinsic. */
5994 /* The alignment needs to be at least according to that of the mode. */
6001 }
6003 /* Make sure an argument is in the right mode.
6004 EXP is the tree argument.
6005 MODE is the mode it should be in. */
6007 static rtx
6009 {
6010 rtx val;
6011 machine_mode old_mode;
6014 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
6015 of CONST_INTs, where we know the old_mode only from the call argument. */
6022 }
6025 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
6026 EXP is the CALL_EXPR. CODE is the rtx code
6027 that corresponds to the arithmetic or logical operation from the name;
6028 an exception here is that NOT actually means NAND. TARGET is an optional
6029 place for us to store the results; AFTER is true if this is the
6030 fetch_and_xxx form. */
6032 static rtx
6035 rtx target)
6036 {
6041 {
6048 {
6077 }
6078 }
6080 /* Expand the operands. */
6085 after);
6086 }
6088 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
6089 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
6090 true if this is the boolean form. TARGET is a place for us to store the
6091 results; this is NOT optional if IS_BOOL is true. */
6093 static rtx
6096 {
6100 /* Expand the operands. */
6107 {
6110 else
6112 }
6115 MEMMODEL_SYNC_SEQ_CST))
6119 }
6121 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
6122 general form is actually an atomic exchange, and some targets only
6123 support a reduced form with the second argument being a constant 1.
6124 EXP is the CALL_EXPR; TARGET is an optional place for us to store
6125 the results. */
6127 static rtx
6129 rtx target)
6130 {
6133 /* Expand the operands. */
6138 }
6140 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
6142 static void
6144 {
6145 rtx mem;
6147 /* Expand the operands. */
6151 }
6153 /* Given an integer representing an ``enum memmodel'', verify its
6154 correctness and return the memory model enum. */
6156 static enum memmodel
6158 {
6159 rtx op;
6161 location_t loc
6164 /* If the parameter is not a constant, it's a run time value so we'll just
6165 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
6175 {
6179 }
6181 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
6183 {
6187 }
6189 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
6190 be conservative and promote consume to acquire. */
6195 }
6197 /* Expand the __atomic_exchange intrinsic:
6198 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
6199 EXP is the CALL_EXPR.
6200 TARGET is an optional place for us to store the results. */
6202 static rtx
6204 {
6213 /* Expand the operands. */
6218 }
6220 /* Expand the __atomic_compare_exchange intrinsic:
6221 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
6222 TYPE desired, BOOL weak,
6223 enum memmodel success,
6224 enum memmodel failure)
6225 EXP is the CALL_EXPR.
6226 TARGET is an optional place for us to store the results. */
6228 static rtx
6230 rtx target)
6231 {
6235 tree weak;
6237 location_t loc
6244 {
6246 "failure memory model cannot be stronger than success "
6249 }
6252 {
6254 "invalid failure memory model for "
6258 }
6264 /* Expand the operands. */
6280 /* Lest the rtl backend create a race condition with an imporoper store
6281 to memory, always create a new pseudo for OLDVAL. */
6288 /* Conditionally store back to EXPECT, lest we create a race condition
6289 with an improper store to memory. */
6290 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6291 the normal case where EXPECT is totally private, i.e. a register. At
6292 which point the store can be unconditional. */
6300 }
6302 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6303 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6304 call. The weak parameter must be dropped to match the expected parameter
6305 list and the expected argument changed from value to pointer to memory
6306 slot. */
6308 static void
6310 {
6326 /* Skip the boolean weak parameter. */
6329 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6332 built_in_function fncode
6337 fndecl);
6342 {
6349 }
6350 }
6352 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6354 void
6356 {
6362 tree lhs;
6364 location_t loc
6371 {
6373 "failure memory model cannot be stronger than success "
6376 }
6379 {
6381 "invalid failure memory model for "
6385 }
6388 {
6391 }
6393 /* Expand the operands. */
6406 {
6409 }
6413 {
6419 }
6420 }
6422 /* Expand the __atomic_load intrinsic:
6423 TYPE __atomic_load (TYPE *object, enum memmodel)
6424 EXP is the CALL_EXPR.
6425 TARGET is an optional place for us to store the results. */
6427 static rtx
6429 {
6430 rtx mem;
6435 {
6436 location_t loc
6441 }
6446 /* Expand the operand. */
6450 }
6453 /* Expand the __atomic_store intrinsic:
6454 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6455 EXP is the CALL_EXPR.
6456 TARGET is an optional place for us to store the results. */
6458 static rtx
6460 {
6467 {
6468 location_t loc
6473 }
6478 /* Expand the operands. */
6483 }
6485 /* Expand the __atomic_fetch_XXX intrinsic:
6486 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6487 EXP is the CALL_EXPR.
6488 TARGET is an optional place for us to store the results.
6489 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6490 FETCH_AFTER is true if returning the result of the operation.
6491 FETCH_AFTER is false if returning the value before the operation.
6492 IGNORE is true if the result is not used.
6493 EXT_CALL is the correct builtin for an external call if this cannot be
6494 resolved to an instruction sequence. */
6496 static rtx
6500 {
6503 tree fndecl;
6504 tree addr;
6508 /* Expand the operands. */
6512 /* Only try generating instructions if inlining is turned on. */
6514 {
6518 }
6520 /* Return if a different routine isn't needed for the library call. */
6524 /* Change the call to the specified function. */
6532 /* If we will emit code after the call, the call cannot be a tail call.
6533 If it is emitted as a tail call, a barrier is emitted after it, and
6534 then all trailing code is removed. */
6538 /* Expand the call here so we can emit trailing code. */
6541 /* Replace the original function just in case it matters. */
6544 /* Then issue the arithmetic correction to return the right result. */
6546 {
6548 {
6550 OPTAB_LIB_WIDEN);
6552 }
6553 else
6555 OPTAB_LIB_WIDEN);
6556 }
6558 }
6560 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6562 void
6564 {
6572 optab optab;
6584 {
6599 }
6602 {
6609 }
6631 {
6636 }
6637 else
6639 OPTAB_DIRECT);
6642 }
6644 /* Expand an atomic clear operation.
6645 void _atomic_clear (BOOL *obj, enum memmodel)
6646 EXP is the call expression. */
6648 static rtx
6650 {
6651 machine_mode mode;
6660 {
6661 location_t loc
6666 }
6668 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6669 Failing that, a store is issued by __atomic_store. The only way this can
6670 fail is if the bool type is larger than a word size. Unlikely, but
6671 handle it anyway for completeness. Assume a single threaded model since
6672 there is no atomic support in this case, and no barriers are required. */
6677 }
6679 /* Expand an atomic test_and_set operation.
6680 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6681 EXP is the call expression. */
6683 static rtx
6685 {
6686 rtx mem;
6688 machine_mode mode;
6695 }
6698 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6699 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6701 static tree
6703 {
6705 machine_mode mode;
6711 /* We need a corresponding integer mode for the access to be lock-free. */
6719 {
6722 /* Either this argument is null, or it's a fake pointer encoding
6723 the alignment of the object. */
6729 else
6731 }
6732 else
6733 {
6736 /* This function is usually invoked and folded immediately by the front
6737 end before anything else has a chance to look at it. The pointer
6738 parameter at this point is usually cast to a void *, so check for that
6739 and look past the cast. */
6749 /* Get the underlying type of the object. */
6752 }
6754 /* If the object has smaller alignment, the lock free routines cannot
6755 be used. */
6759 /* Check if a compare_and_swap pattern exists for the mode which represents
6760 the required size. The pattern is not allowed to fail, so the existence
6761 of the pattern indicates support is present. Also require that an
6762 atomic load exists for the required size. */
6765 else
6767 }
6769 /* Return true if the parameters to call EXP represent an object which will
6770 always generate lock free instructions. The first argument represents the
6771 size of the object, and the second parameter is a pointer to the object
6772 itself. If NULL is passed for the object, then the result is based on
6773 typical alignment for an object of the specified size. Otherwise return
6774 false. */
6776 static rtx
6778 {
6779 tree size;
6784 {
6787 }
6793 }
6795 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6796 is lock free on this architecture. */
6798 static tree
6800 {
6804 /* If it isn't always lock free, don't generate a result. */
6809 }
6811 /* Return true if the parameters to call EXP represent an object which will
6812 always generate lock free instructions. The first argument represents the
6813 size of the object, and the second parameter is a pointer to the object
6814 itself. If NULL is passed for the object, then the result is based on
6815 typical alignment for an object of the specified size. Otherwise return
6816 NULL*/
6818 static rtx
6820 {
6821 tree size;
6826 {
6829 }
6834 /* If the value is known at compile time, return the RTX for it. */
6840 }
6842 /* Expand the __atomic_thread_fence intrinsic:
6843 void __atomic_thread_fence (enum memmodel)
6844 EXP is the CALL_EXPR. */
6846 static void
6848 {
6851 }
6853 /* Expand the __atomic_signal_fence intrinsic:
6854 void __atomic_signal_fence (enum memmodel)
6855 EXP is the CALL_EXPR. */
6857 static void
6859 {
6862 }
6864 /* Expand the __sync_synchronize intrinsic. */
6866 static void
6868 {
6870 }
6872 static rtx
6874 {
6880 {
6882 /* If the target is not sutitable then create a new target. */
6890 }
6893 }
6895 static void
6897 {
6903 {
6910 }
6912 }
6914 \f
6915 /* Emit code to restore the current value of stack. */
6917 static void
6919 {
6931 }
6933 /* Emit code to save the current value of stack. */
6935 static rtx
6937 {
6942 }
6944 /* Emit code to get the openacc gang, worker or vector id or size. */
6946 static rtx
6948 {
6950 rtx fallback_retval;
6953 {
6966 }
6969 {
6972 }
6976 {
6979 }
6983 {
6991 }
7000 {
7003 }
7011 }
7013 /* Expand a string compare operation using a sequence of char comparison
7014 to get rid of the calling overhead, with result going to TARGET if
7015 that's convenient.
7017 VAR_STR is the variable string source;
7018 CONST_STR is the constant string source;
7019 LENGTH is the number of chars to compare;
7020 CONST_STR_N indicates which source string is the constant string;
7021 IS_MEMCMP indicates whether it's a memcmp or strcmp.
7023 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
7025 target = (int) (unsigned char) var_str[0]
7026 - (int) (unsigned char) const_str[0];
7027 if (target != 0)
7028 goto ne_label;
7029 ...
7030 target = (int) (unsigned char) var_str[length - 2]
7031 - (int) (unsigned char) const_str[length - 2];
7032 if (target != 0)
7033 goto ne_label;
7034 target = (int) (unsigned char) var_str[length - 1]
7035 - (int) (unsigned char) const_str[length - 1];
7036 ne_label:
7037 */
7039 static rtx
7043 {
7045 rtx var_rtx_array
7052 scalar_int_mode unit_mode
7058 {
7059 var_rtx
7073 }
7081 }
7083 /* Inline expansion a call to str(n)cmp, with result going to
7084 TARGET if that's convenient.
7085 If the call is not been inlined, return NULL_RTX. */
7086 static rtx
7088 {
7094 /* Do NOT apply this inlining expansion when optimizing for size or
7095 optimization level below 2. */
7103 /* On a target where the type of the call (int) has same or narrower presicion
7104 than unsigned char, give up the inlining expansion. */
7120 /* If neither strings is constant string, the call is not qualify. */
7124 /* For strncmp, if the length is not a const, not qualify. */
7135 else
7144 /* If the length of the comparision is larger than the threshold,
7145 do nothing. */
7152 /* Now, start inline expansion the call. */
7156 }
7158 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
7159 represents the size of the first argument to that call, or VOIDmode
7160 if the argument is a pointer. IGNORE will be true if the result
7161 isn't used. */
7162 static rtx
7165 {
7172 {
7175 }
7179 /* An optional second argument can be used as a failsafe value on
7180 some machines. If it isn't present, then the failsafe value is
7181 assumed to be 0. */
7183 {
7186 }
7187 else
7190 /* If the result isn't used, the behavior is undefined. It would be
7191 nice to emit a warning here, but path splitting means this might
7192 happen with legitimate code. So simply drop the builtin
7193 expansion in that case; we've handled any side-effects above. */
7197 /* If we don't have a suitable target, create one to hold the result. */
7205 }
7207 /* Expand an expression EXP that calls a built-in function,
7208 with result going to TARGET if that's convenient
7209 (and in mode MODE if that's convenient).
7210 SUBTARGET may be used as the target for computing one of EXP's operands.
7211 IGNORE is nonzero if the value is to be ignored. */
7213 rtx
7216 {
7225 /* When ASan is enabled, we don't want to expand some memory/string
7226 builtins and rely on libsanitizer's hooks. This allows us to avoid
7227 redundant checks and be sure, that possible overflow will be detected
7228 by ASan. */
7233 /* When not optimizing, generate calls to library functions for a certain
7234 set of builtins. */
7248 /* The built-in function expanders test for target == const0_rtx
7249 to determine whether the function's result will be ignored. */
7253 /* If the result of a pure or const built-in function is ignored, and
7254 none of its arguments are volatile, we can avoid expanding the
7255 built-in call and just evaluate the arguments for side-effects. */
7259 {
7261 tree arg;
7262 call_expr_arg_iterator iter;
7266 {
7269 }
7272 {
7276 }
7277 }
7280 {
7298 /* Just do a normal library call if we were unable to fold
7299 the values. */
7376 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7377 FUNCTION with a copy of the parameters described by
7378 ARGUMENTS, and ARGSIZE. It returns a block of memory
7379 allocated on the stack into which is stored all the registers
7380 that might possibly be used for returning the result of a
7381 function. ARGUMENTS is the value returned by
7382 __builtin_apply_args. ARGSIZE is the number of bytes of
7383 arguments that must be copied. ??? How should this value be
7384 computed? We'll also need a safe worst case value for varargs
7385 functions. */
7392 else
7393 {
7401 }
7403 /* __builtin_return (RESULT) causes the function to return the
7404 value described by RESULT. RESULT is address of the block of
7405 memory returned by __builtin_apply. */
7415 /* All valid uses of __builtin_va_arg_pack () are removed during
7416 inlining. */
7421 /* All valid uses of __builtin_va_arg_pack_len () are removed during
7422 inlining. */
7426 /* Return the address of the first anonymous stack arg. */
7448 /* Returns the address of the area where the structure is returned.
7449 0 otherwise. */
7455 else
7458 CASE_BUILT_IN_ALLOCA:
7608 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7609 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7610 when changing it to a strcmp call. */
7616 /* Change this call back to a BUILT_IN_STRCMP. */
7620 /* Delete the last parameter. */
7627 /* FALLTHROUGH */
7635 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7636 back to a BUILT_IN_STRNCMP. */
7642 /* Change it back to a BUILT_IN_STRNCMP. */
7645 /* FALLTHROUGH */
7660 {
7663 }
7667 /* This should have been lowered to the builtins below. */
7671 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7672 and the receiver label. */
7674 {
7680 /* This is copied from the handling of non-local gotos. */
7682 nonlocal_goto_handler_labels
7684 nonlocal_goto_handler_labels);
7685 /* ??? Do not let expand_label treat us as such since we would
7686 not want to be both on the list of non-local labels and on
7687 the list of forced labels. */
7690 }
7694 /* __builtin_setjmp_receiver is passed the receiver label. */
7696 {
7702 }
7705 /* __builtin_longjmp is passed a pointer to an array of five words.
7706 It's similar to the C library longjmp function but works with
7707 __builtin_setjmp above. */
7710 {
7716 {
7719 }
7723 }
7732 /* This updates the setjmp buffer that is its argument with the value
7733 of the current stack pointer. */
7736 {
7737 rtx buf_addr
7742 }
7762 /* Various hooks for the DWARF 2 __throw routine. */
7768 #ifdef DWARF2_UNWIND_INFO
7774 #endif
7976 mode = get_builtin_sync_mode
7988 mode = get_builtin_sync_mode
8035 {
8039 mode =
8045 /* If this is turned into an external library call, the weak parameter
8046 must be dropped to match the expected parameter list. */
8051 /* Skip the boolean weak parameter. */
8056 }
8085 {
8095 }
8101 {
8111 }
8117 {
8127 }
8133 {
8143 }
8149 {
8159 }
8165 {
8175 }
8312 /* Do library call, if we failed to expand the builtin when
8313 folding. */
8333 }
8335 /* The switch statement above can drop through to cause the function
8336 to be called normally. */
8338 }
8340 /* Determine whether a tree node represents a call to a built-in
8341 function. If the tree T is a call to a built-in function with
8342 the right number of arguments of the appropriate types, return
8343 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8344 Otherwise the return value is END_BUILTINS. */
8346 enum built_in_function
8348 {
8351 const_call_expr_arg_iterator iter;
8363 {
8364 /* If a function doesn't take a variable number of arguments,
8365 the last element in the list will have type `void'. */
8368 {
8372 }
8381 {
8384 }
8386 {
8389 }
8391 {
8394 }
8396 {
8399 }
8400 else
8402 }
8404 /* Variable-length argument list. */
8406 }
8408 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
8409 evaluate to a constant. */
8411 static tree
8413 {
8414 /* We return 1 for a numeric type that's known to be a constant
8415 value at compile-time or for an aggregate type that's a
8416 literal constant. */
8419 /* If we know this is a constant, emit the constant of one. */
8425 {
8432 }
8434 /* If this expression has side effects, show we don't know it to be a
8435 constant. Likewise if it's a pointer or aggregate type since in
8436 those case we only want literals, since those are only optimized
8437 when generating RTL, not later.
8438 And finally, if we are compiling an initializer, not code, we
8439 need to return a definite result now; there's not going to be any
8440 more optimization done. */
8445 || folding_initializer
8450 }
8452 /* Create builtin_expect or builtin_expect_with_probability
8453 with PRED and EXPECTED as its arguments and return it as a truthvalue.
8454 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
8455 builtin_expect_with_probability instead uses third argument as PROBABILITY
8456 value. */
8458 static tree
8461 {
8476 else
8478 predictor);
8482 }
8484 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
8485 NULL_TREE if no simplification is possible. */
8487 tree
8489 tree arg3)
8490 {
8494 /* Distribute the expected value over short-circuiting operators.
8495 See through the cast from truthvalue_type_node to long. */
8502 /* If this is a builtin_expect within a builtin_expect keep the
8503 inner one. See through a comparison against a constant. It
8504 might have been added to create a thruthvalue. */
8520 {
8530 }
8532 /* If the argument isn't invariant then there's nothing else we can do. */
8536 /* If we expect that a comparison against the argument will fold to
8537 a constant return the constant. In practice, this means a true
8538 constant or the address of a non-weak symbol. */
8542 {
8543 do
8544 {
8546 }
8551 }
8553 /* Otherwise, ARG0 already has the proper type for the return value. */
8555 }
8557 /* Fold a call to __builtin_classify_type with argument ARG. */
8559 static tree
8561 {
8566 }
8568 /* Fold a call to __builtin_strlen with argument ARG. */
8570 static tree
8572 {
8575 else
8576 {
8577 c_strlen_data lendata = { };
8587 {
8593 }
8596 }
8597 }
8599 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8601 static tree
8603 {
8604 REAL_VALUE_TYPE real;
8606 /* __builtin_inff is intended to be usable to define INFINITY on all
8607 targets. If an infinity is not available, INFINITY expands "to a
8608 positive constant of type float that overflows at translation
8609 time", footnote "In this case, using INFINITY will violate the
8610 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8611 Thus we pedwarn to ensure this constraint violation is
8612 diagnosed. */
8618 }
8620 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8621 NULL_TREE if no simplification can be made. */
8623 static tree
8626 {
8627 tree type;
8637 /* Calculate the result when the argument is a constant. */
8642 /* Canonicalize sincos to cexpi. */
8644 {
8647 }
8649 {
8656 }
8668 }
8670 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8671 Return NULL_TREE if no simplification can be made. */
8673 static tree
8675 {
8681 /* If the LEN parameter is zero, return zero. */
8686 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8690 /* If len parameter is one, return an expression corresponding to
8691 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8693 {
8695 tree cst_uchar_ptr_node
8698 tree ind1
8702 cst_uchar_ptr_node,
8703 arg1)));
8704 tree ind2
8708 cst_uchar_ptr_node,
8709 arg2)));
8711 }
8714 }
8716 /* Fold a call to builtin isascii with argument ARG. */
8718 static tree
8720 {
8723 else
8724 {
8725 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8731 }
8732 }
8734 /* Fold a call to builtin toascii with argument ARG. */
8736 static tree
8738 {
8742 /* Transform toascii(c) -> (c & 0x7f). */
8745 }
8747 /* Fold a call to builtin isdigit with argument ARG. */
8749 static tree
8751 {
8754 else
8755 {
8756 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8757 /* According to the C standard, isdigit is unaffected by locale.
8758 However, it definitely is affected by the target character set. */
8759 unsigned HOST_WIDE_INT target_digit0
8770 }
8771 }
8773 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8775 static tree
8777 {
8783 }
8785 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8787 static tree
8789 {
8795 }
8797 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8799 static tree
8801 {
8804 {
8808 {
8813 }
8814 }
8817 }
8819 /* Fold a call to builtin frexp, we can assume the base is 2. */
8821 static tree
8823 {
8834 /* Proceed if a valid pointer type was passed in. */
8836 {
8841 {
8843 /* For +-0, return (*exp = 0, +-0). */
8849 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8852 {
8853 /* Since the frexp function always expects base 2, and in
8854 GCC normalized significands are already in the range
8855 [0.5, 1.0), we have exactly what frexp wants. */
8860 }
8864 }
8866 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8870 }
8873 }
8875 /* Fold a call to builtin modf. */
8877 static tree
8879 {
8890 /* Proceed if a valid pointer type was passed in. */
8892 {
8897 {
8900 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8904 /* For +-Inf, return (*arg1 = arg0, +-0). */
8910 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8913 /* If the original number was negative and already
8914 integral, then the fractional part is -0.0. */
8918 }
8920 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8926 }
8929 }
8931 /* Given a location LOC, an interclass builtin function decl FNDECL
8932 and its single argument ARG, return an folded expression computing
8933 the same, or NULL_TREE if we either couldn't or didn't want to fold
8934 (the latter happen if there's an RTL instruction available). */
8936 static tree
8938 {
8939 machine_mode mode;
8951 /* If there is no optab, try generic code. */
8953 {
8954 tree result;
8957 {
8958 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8961 REAL_VALUE_TYPE r;
8965 {
8966 /* NaN and Inf are encoded in the high-order double value
8967 only. The low-order value is not significant. */
8971 }
8978 }
8981 {
8982 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8985 REAL_VALUE_TYPE r;
8989 {
8990 /* NaN and Inf are encoded in the high-order double value
8991 only. The low-order value is not significant. */
8995 }
9001 /*result = fold_build2_loc (loc, UNGT_EXPR,
9002 TREE_TYPE (TREE_TYPE (fndecl)),
9003 fold_build1_loc (loc, ABS_EXPR, type, arg),
9004 build_real (type, r));
9005 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9006 TREE_TYPE (TREE_TYPE (fndecl)),
9007 result);*/
9009 }
9011 {
9012 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9013 islessequal(fabs(x),DBL_MAX). */
9023 {
9024 /* Use double to test the normal range of IBM extended
9025 precision. Emin for IBM extended precision is
9026 different to emin for IEEE double, being 53 higher
9027 since the low double exponent is at least 53 lower
9028 than the high double exponent. */
9032 }
9044 {
9045 /* Testing the high end of the range is done just using
9046 the high double, using the same test as isfinite().
9047 For the subnormal end of the range we first test the
9048 high double, then if its magnitude is equal to the
9049 limit of 0x1p-969, we test whether the low double is
9050 non-zero and opposite sign to the high double. */
9066 integer_type_node,
9072 }
9073 else
9074 {
9075 tree const isge_fn
9078 }
9082 }
9085 }
9088 }
9090 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9091 ARG is the argument for the call. */
9093 static tree
9095 {
9102 {
9110 {
9111 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9112 /* In a boolean context, GCC will fold the inner COND_EXPR to
9113 1. So e.g. "if (isinf_sign(x))" would be folded to just
9114 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9122 {
9135 integer_zero_node);
9136 }
9139 }
9152 {
9155 {
9156 /* NaN and Inf are encoded in the high-order double value
9157 only. The low-order value is not significant. */
9159 }
9160 }
9166 }
9167 }
9169 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9170 This builtin will generate code to return the appropriate floating
9171 point classification depending on the value of the floating point
9172 number passed in. The possible return values must be supplied as
9173 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9174 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9175 one floating point argument which is "type generic". */
9177 static tree
9179 {
9182 machine_mode mode;
9183 REAL_VALUE_TYPE r;
9186 /* Verify the required arguments in the original call. */
9206 /* fpclassify(x) ->
9207 isnan(x) ? FP_NAN :
9208 (fabs(x) == Inf ? FP_INFINITE :
9209 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9210 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9224 {
9230 }
9233 {
9236 }
9239 }
9241 /* Fold a call to an unordered comparison function such as
9242 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9243 being called and ARG0 and ARG1 are the arguments for the call.
9244 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9245 the opposite of the desired result. UNORDERED_CODE is used
9246 for modes that can hold NaNs and ORDERED_CODE is used for
9247 the rest. */
9249 static tree
9253 {
9267 /* Choose the wider of two real types. */
9279 {
9283 }
9288 }
9290 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9291 arithmetics if it can never overflow, or into internal functions that
9292 return both result of arithmetics and overflowed boolean flag in
9293 a complex integer result, or some other check for overflow.
9294 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9295 checking part of that. */
9297 static tree
9300 {
9302 /* The code of the expression corresponding to the type-generic
9303 built-in, or ERROR_MARK for the type-specific ones. */
9308 {
9311 /* FALLTHRU */
9314 /* FALLTHRU */
9325 /* FALLTHRU */
9328 /* FALLTHRU */
9339 /* FALLTHRU */
9342 /* FALLTHRU */
9353 }
9355 /* For the "generic" overloads, the first two arguments can have different
9356 types and the last argument determines the target type to use to check
9357 for overflow. The arguments of the other overloads all have the same
9358 type. */
9361 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
9362 arguments are constant, attempt to fold the built-in call into a constant
9363 expression indicating whether or not it detected an overflow. */
9367 /* Perform the computation in the target type and check for overflow. */
9371 arg2);
9385 tree store
9388 }
9390 /* Fold a call to __builtin_FILE to a constant string. */
9394 {
9396 {
9397 /* The documentation says this builtin is equivalent to the preprocessor
9398 __FILE__ macro so it appears appropriate to use the same file prefix
9399 mappings. */
9402 }
9405 }
9407 /* Fold a call to __builtin_FUNCTION to a constant string. */
9411 {
9418 }
9420 /* Fold a call to __builtin_LINE to an integer constant. */
9424 {
9426 }
9428 /* Fold a call to built-in function FNDECL with 0 arguments.
9429 This function returns NULL_TREE if no simplification was possible. */
9431 static tree
9433 {
9437 {
9463 }
9465 }
9467 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9468 This function returns NULL_TREE if no simplification was possible. */
9470 static tree
9472 {
9483 {
9485 {
9488 /* Gimplification will pull the CALL_EXPR for the builtin out of
9489 an if condition. When not optimizing, we'll not CSE it back.
9490 To avoid link error types of regressions, return false now. */
9495 }
9551 {
9556 }
9562 {
9567 }
9588 }
9592 }
9594 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9595 This function returns NULL_TREE if no simplification was possible. */
9597 static tree
9599 {
9611 {
9655 NOP_EXPR);
9657 /* We do the folding for va_start in the expander. */
9672 }
9674 }
9676 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9677 and ARG2.
9678 This function returns NULL_TREE if no simplification was possible. */
9680 static tree
9683 {
9697 {
9746 }
9748 }
9750 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9751 arguments. IGNORE is true if the result of the
9752 function call is ignored. This function returns NULL_TREE if no
9753 simplification was possible. */
9755 tree
9757 {
9761 {
9777 }
9779 {
9783 }
9785 }
9787 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9788 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9789 of arguments in ARGS to be omitted. OLDNARGS is the number of
9790 elements in ARGS. */
9792 static tree
9795 {
9800 {
9808 }
9809 else
9813 }
9815 /* Return true if FNDECL shouldn't be folded right now.
9816 If a built-in function has an inline attribute always_inline
9817 wrapper, defer folding it after always_inline functions have
9818 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9819 might not be performed. */
9821 bool
9823 {
9826 && cfun
9829 }
9831 /* A wrapper function for builtin folding that prevents warnings for
9832 "statement without effect" and the like, caused by removing the
9833 call node earlier than the warning is generated. */
9835 tree
9837 {
9841 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9842 yet. Defer folding until we see all the arguments
9843 (after inlining). */
9845 {
9848 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9849 instead last argument is __builtin_va_arg_pack (). Defer folding
9850 even in that case, until arguments are finalized. */
9852 {
9856 }
9864 else
9865 {
9870 }
9871 }
9873 }
9875 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9876 N arguments are passed in the array ARGARRAY. Return a folded
9877 expression or NULL_TREE if no simplification was possible. */
9879 tree
9881 tree fn,
9884 {
9891 {
9892 /* If last argument is __builtin_va_arg_pack (), arguments to this
9893 function are not finalized yet. Defer folding until they are. */
9895 {
9899 }
9904 else
9906 }
9909 }
9911 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9912 along with N new arguments specified as the "..." parameters. SKIP
9913 is the number of arguments in EXP to be omitted. This function is used
9914 to do varargs-to-varargs transformations. */
9916 static tree
9918 {
9920 tree t;
9928 }
9930 /* Validate a single argument ARG against a tree code CODE representing
9931 a type. Return true when argument is valid. */
9933 static bool
9935 {
9943 }
9945 /* This function validates the types of a function call argument list
9946 against a specified list of tree_codes. If the last specifier is a 0,
9947 that represents an ellipses, otherwise the last specifier must be a
9948 VOID_TYPE.
9950 This is the GIMPLE version of validate_arglist. Eventually we want to
9951 completely convert builtins.c to work from GIMPLEs and the tree based
9952 validate_arglist will then be removed. */
9954 bool
9956 {
9960 const_tree arg;
9966 do
9967 {
9970 {
9972 /* This signifies an ellipses, any further arguments are all ok. */
9976 /* This signifies an endlink, if no arguments remain, return
9977 true, otherwise return false. */
9981 /* If no parameters remain or the parameter's code does not
9982 match the specified code, return false. Otherwise continue
9983 checking any remaining arguments. */
9988 }
9989 }
9992 /* We need gotos here since we can only have one VA_CLOSE in a
9993 function. */
9994 end: ;
9998 }
10000 /* Default target-specific builtin expander that does nothing. */
10002 rtx
10004 rtx target ATTRIBUTE_UNUSED,
10005 rtx subtarget ATTRIBUTE_UNUSED,
10006 machine_mode mode ATTRIBUTE_UNUSED,
10008 {
10010 }
10012 /* Returns true is EXP represents data that would potentially reside
10013 in a readonly section. */
10015 bool
10017 {
10027 /* Make sure we call decl_readonly_section only for trees it
10028 can handle (since it returns true for everything it doesn't
10029 understand). */
10034 else
10036 }
10038 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
10039 to the call, and TYPE is its return type.
10041 Return NULL_TREE if no simplification was possible, otherwise return the
10042 simplified form of the call as a tree.
10044 The simplified form may be a constant or other expression which
10045 computes the same value, but in a more efficient manner (including
10046 calls to other builtin functions).
10048 The call may contain arguments which need to be evaluated, but
10049 which are not useful to determine the result of the call. In
10050 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10051 COMPOUND_EXPR will be an argument which must be evaluated.
10052 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10053 COMPOUND_EXPR in the chain will contain the tree for the simplified
10054 form of the builtin function call. */
10056 static tree
10058 {
10062 else
10063 {
10064 tree fn;
10073 {
10075 tree tem;
10080 /* Return an offset into the constant string argument. */
10083 }
10086 /* strpbrk(x, "") == NULL.
10087 Evaluate and ignore s1 in case it had side-effects. */
10097 /* New argument list transforming strpbrk(s1, s2) to
10098 strchr(s1, s2[0]). */
10101 }
10102 }
10104 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
10105 to the call.
10107 Return NULL_TREE if no simplification was possible, otherwise return the
10108 simplified form of the call as a tree.
10110 The simplified form may be a constant or other expression which
10111 computes the same value, but in a more efficient manner (including
10112 calls to other builtin functions).
10114 The call may contain arguments which need to be evaluated, but
10115 which are not useful to determine the result of the call. In
10116 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10117 COMPOUND_EXPR will be an argument which must be evaluated.
10118 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10119 COMPOUND_EXPR in the chain will contain the tree for the simplified
10120 form of the builtin function call. */
10122 static tree
10124 {
10128 else
10129 {
10132 /* If either argument is "", return NULL_TREE. */
10134 /* Evaluate and ignore both arguments in case either one has
10135 side-effects. */
10139 }
10140 }
10142 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
10143 to the call.
10145 Return NULL_TREE if no simplification was possible, otherwise return the
10146 simplified form of the call as a tree.
10148 The simplified form may be a constant or other expression which
10149 computes the same value, but in a more efficient manner (including
10150 calls to other builtin functions).
10152 The call may contain arguments which need to be evaluated, but
10153 which are not useful to determine the result of the call. In
10154 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10155 COMPOUND_EXPR will be an argument which must be evaluated.
10156 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10157 COMPOUND_EXPR in the chain will contain the tree for the simplified
10158 form of the builtin function call. */
10160 static tree
10162 {
10166 else
10167 {
10168 /* If the first argument is "", return NULL_TREE. */
10171 {
10172 /* Evaluate and ignore argument s2 in case it has
10173 side-effects. */
10176 }
10178 /* If the second argument is "", return __builtin_strlen(s1). */
10181 {
10184 /* If the replacement _DECL isn't initialized, don't do the
10185 transformation. */
10190 }
10192 }
10193 }
10195 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
10196 produced. False otherwise. This is done so that we don't output the error
10197 or warning twice or three times. */
10199 bool
10201 {
10204 tree arg;
10205 /* There is good chance the current input_location points inside the
10206 definition of the va_start macro (perhaps on the token for
10207 builtin) in a system header, so warnings will not be emitted.
10208 Use the location in real source code. */
10209 location_t current_location =
10211 NULL);
10214 {
10217 }
10220 {
10222 {
10225 }
10227 }
10228 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
10229 when we checked the arguments and if needed issued a warning. */
10230 else
10231 {
10233 {
10234 /* Evidently an out of date version of <stdarg.h>; can't validate
10235 va_start's second argument, but can still work as intended. */
10237 OPT_Wvarargs,
10240 }
10242 {
10245 }
10247 }
10252 /* We destructively modify the call to be __builtin_va_start (ap, 0)
10253 or __builtin_next_arg (0) the first time we see it, after checking
10254 the arguments and if needed issuing a warning. */
10256 {
10259 /* Strip off all nops for the sake of the comparison. This
10260 is not quite the same as STRIP_NOPS. It does more.
10261 We must also strip off INDIRECT_EXPR for C++ reference
10262 parameters. */
10267 {
10268 /* FIXME: Sometimes with the tree optimizers we can get the
10269 not the last argument even though the user used the last
10270 argument. We just warn and set the arg to be the last
10271 argument so that we will get wrong-code because of
10272 it. */
10274 OPT_Wvarargs,
10276 }
10278 /* Undefined by C99 7.15.1.4p4 (va_start):
10279 "If the parameter parmN is declared with the register storage
10280 class, with a function or array type, or with a type that is
10281 not compatible with the type that results after application of
10282 the default argument promotions, the behavior is undefined."
10283 */
10285 {
10287 OPT_Wvarargs,
10288 "undefined behavior when second parameter of "
10290 }
10292 /* We want to verify the second parameter just once before the tree
10293 optimizers are run and then avoid keeping it in the tree,
10294 as otherwise we could warn even for correct code like:
10295 void foo (int i, ...)
10296 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
10299 else
10301 }
10303 }
10306 /* Expand a call EXP to __builtin_object_size. */
10308 static rtx
10310 {
10311 tree ost;
10316 {
10321 }
10329 {
10334 }
10339 }
10341 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10342 FCODE is the BUILT_IN_* to use.
10343 Return NULL_RTX if we failed; the caller should emit a normal call,
10344 otherwise try to get the result in TARGET, if convenient (and in
10345 mode MODE if that's convenient). */
10347 static rtx
10350 {
10352 POINTER_TYPE,
10353 fcode == BUILT_IN_MEMSET_CHK
10370 {
10371 /* Avoid transforming the checking call to an ordinary one when
10372 an overflow has been detected or when the call couldn't be
10373 validated because the size is not constant. */
10378 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10379 mem{cpy,pcpy,move,set} is available. */
10381 {
10396 }
10405 }
10408 else
10409 {
10412 /* If DEST is not a pointer type, call the normal function. */
10416 /* If SRC and DEST are the same (and not volatile), do nothing. */
10418 {
10419 tree expr;
10422 {
10423 /* Evaluate and ignore LEN in case it has side-effects. */
10426 }
10430 }
10432 /* __memmove_chk special case. */
10434 {
10440 /* If src is categorized for a readonly section we can use
10441 normal __memcpy_chk. */
10443 {
10452 }
10453 }
10455 }
10456 }
10458 /* Emit warning if a buffer overflow is detected at compile time. */
10460 static void
10462 {
10463 /* The source string. */
10465 /* The size of the destination object. */
10467 /* The string that is being concatenated with (as in __strcat_chk)
10468 or null if it isn't. */
10470 /* The maximum length of the source sequence in a bounded operation
10471 (such as __strncat_chk) or null if the operation isn't bounded
10472 (such as __strcat_chk). */
10474 /* The exact size of the access (such as in __strncpy_chk). */
10478 {
10486 /* For __strcat_chk the warning will be emitted only if overflowing
10487 by at least strlen (dest) + 1 bytes. */
10514 }
10517 {
10518 /* Check __strncat_chk. There is no way to determine the length
10519 of the string to which the source string is being appended so
10520 just warn when the length of the source string is not known. */
10523 }
10525 /* The destination argument is the first one for all built-ins above. */
10529 }
10531 /* Emit warning if a buffer overflow is detected at compile time
10532 in __sprintf_chk/__vsprintf_chk calls. */
10534 static void
10536 {
10541 /* Verify the required arguments in the original call. */
10551 /* Check whether the format is a literal string constant. */
10559 /* If the format doesn't contain % args or %%, we know its size. */
10562 /* If the format is "%s" and first ... argument is a string literal,
10563 we know it too. */
10566 {
10567 tree arg;
10578 }
10579 else
10582 /* Add one for the terminating nul. */
10587 }
10589 /* Emit warning if a free is called with address of a variable. */
10591 static void
10593 {
10607 else
10610 }
10612 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10613 if possible. */
10615 static tree
10617 {
10634 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10635 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10636 and (size_t) 0 for types 2 and 3. */
10641 {
10645 }
10647 {
10648 /* If object size is not known yet, delay folding until
10649 later. Maybe subsequent passes will help determining
10650 it. */
10654 }
10657 }
10659 /* Builtins with folding operations that operate on "..." arguments
10660 need special handling; we need to store the arguments in a convenient
10661 data structure before attempting any folding. Fortunately there are
10662 only a few builtins that fall into this category. FNDECL is the
10663 function, EXP is the CALL_EXPR for the call. */
10665 static tree
10667 {
10672 {
10679 }
10681 {
10686 }
10688 }
10690 /* Initialize format string characters in the target charset. */
10692 bool
10694 {
10697 {
10720 }
10722 }
10724 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10725 and no overflow/underflow occurred. INEXACT is true if M was not
10726 exactly calculated. TYPE is the tree type for the result. This
10727 function assumes that you cleared the MPFR flags and then
10728 calculated M to see if anything subsequently set a flag prior to
10729 entering this function. Return NULL_TREE if any checks fail. */
10731 static tree
10733 {
10734 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10735 overflow/underflow occurred. If -frounding-math, proceed iff the
10736 result of calling FUNC was exact. */
10739 {
10740 REAL_VALUE_TYPE rr;
10743 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10744 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10745 but the mpft_t is not, then we underflowed in the
10746 conversion. */
10749 {
10750 REAL_VALUE_TYPE rmode;
10753 /* Proceed iff the specified mode can hold the value. */
10756 }
10757 }
10759 }
10761 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10762 number and no overflow/underflow occurred. INEXACT is true if M
10763 was not exactly calculated. TYPE is the tree type for the result.
10764 This function assumes that you cleared the MPFR flags and then
10765 calculated M to see if anything subsequently set a flag prior to
10766 entering this function. Return NULL_TREE if any checks fail, if
10767 FORCE_CONVERT is true, then bypass the checks. */
10769 static tree
10771 {
10772 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10773 overflow/underflow occurred. If -frounding-math, proceed iff the
10774 result of calling FUNC was exact. */
10779 {
10784 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10785 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10786 but the mpft_t is not, then we underflowed in the
10787 conversion. */
10792 {
10797 /* Proceed iff the specified mode can hold the value. */
10803 }
10804 }
10806 }
10808 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10809 the pointer *(ARG_QUO) and return the result. The type is taken
10810 from the type of ARG0 and is used for setting the precision of the
10811 calculation and results. */
10813 static tree
10815 {
10822 /* To proceed, MPFR must exactly represent the target floating point
10823 format, which only happens when the target base equals two. */
10827 {
10832 {
10836 tree result_rem;
10845 /* Remquo is independent of the rounding mode, so pass
10846 inexact=0 to do_mpfr_ckconv(). */
10850 {
10851 /* MPFR calculates quo in the host's long so it may
10852 return more bits in quo than the target int can hold
10853 if sizeof(host long) > sizeof(target int). This can
10854 happen even for native compilers in LP64 mode. In
10855 these cases, modulo the quo value with the largest
10856 number that the target int can hold while leaving one
10857 bit for the sign. */
10861 /* Dereference the quo pointer argument. */
10863 /* Proceed iff a valid pointer type was passed in. */
10865 {
10866 /* Set the value. */
10867 tree result_quo
10870 integer_quo));
10872 /* Combine the quo assignment with the rem. */
10875 }
10876 }
10877 }
10878 }
10880 }
10882 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10883 resulting value as a tree with type TYPE. The mpfr precision is
10884 set to the precision of TYPE. We assume that this mpfr function
10885 returns zero if the result could be calculated exactly within the
10886 requested precision. In addition, the integer pointer represented
10887 by ARG_SG will be dereferenced and set to the appropriate signgam
10888 (-1,1) value. */
10890 static tree
10892 {
10897 /* To proceed, MPFR must exactly represent the target floating point
10898 format, which only happens when the target base equals two. Also
10899 verify ARG is a constant and that ARG_SG is an int pointer. */
10904 {
10907 /* In addition to NaN and Inf, the argument cannot be zero or a
10908 negative integer. */
10912 {
10917 mpfr_t m;
10918 tree result_lg;
10927 {
10928 tree result_sg;
10930 /* Dereference the arg_sg pointer argument. */
10932 /* Assign the signgam value into *arg_sg. */
10937 /* Combine the signgam assignment with the lgamma result. */
10940 }
10941 }
10942 }
10945 }
10947 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10948 mpc function FUNC on it and return the resulting value as a tree
10949 with type TYPE. The mpfr precision is set to the precision of
10950 TYPE. We assume that function FUNC returns zero if the result
10951 could be calculated exactly within the requested precision. If
10952 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10953 in the arguments and/or results. */
10955 tree
10958 {
10964 /* To proceed, MPFR must exactly represent the target floating point
10965 format, which only happens when the target base equals two. */
10971 {
10980 {
11000 }
11001 }
11004 }
11006 /* A wrapper function for builtin folding that prevents warnings for
11007 "statement without effect" and the like, caused by removing the
11008 call node earlier than the warning is generated. */
11010 tree
11012 {
11018 {
11027 {
11029 }
11030 else
11031 {
11034 {
11035 /* Propagate location information from original call to
11036 expansion of builtin. Otherwise things like
11037 maybe_emit_chk_warning, that operate on the expansion
11038 of a builtin, will use the wrong location information. */
11040 {
11048 }
11050 }
11051 }
11052 }
11054 }
11056 /* Look up the function in builtin_decl that corresponds to DECL
11057 and set ASMSPEC as its user assembler name. DECL must be a
11058 function decl that declares a builtin. */
11060 void
11062 {
11071 {
11075 }
11076 }
11078 /* Return true if DECL is a builtin that expands to a constant or similarly
11079 simple code. */
11080 bool
11082 {
11085 {
11086 /* Builtins that expand to constants. */
11091 /* Simple register moves or loads from stack. */
11102 /* Exception state returns or moves registers around. */
11110 }
11113 }
11115 /* Return true if DECL is a builtin that is not expensive, i.e., they are
11116 most probably expanded inline into reasonably simple code. This is a
11117 superset of is_simple_builtin. */
11118 bool
11120 {
11127 {
11129 CASE_BUILT_IN_ALLOCA:
11195 }
11198 }
11200 /* Return true if T is a constant and the value cast to a target char
11201 can be represented by a host char.
11202 Store the casted char constant in *P if so. */
11204 bool
11206 {
11212 }
11214 /* Return the maximum object size. */
11216 tree
11218 {
11219 /* To do: Make this a configurable parameter. */
11221 }