| blob | 39611de702123be2fa958767a4a17883ab7e6de0 |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2018 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. */
196 /* Return true if NAME starts with __builtin_ or __sync_. */
198 static bool
200 {
208 }
211 /* Return true if DECL is a function symbol representing a built-in. */
213 bool
215 {
217 }
219 /* Return true if NODE should be considered for inline expansion regardless
220 of the optimization level. This means whenever a function is invoked with
221 its "internal" name, which normally contains the prefix "__builtin". */
223 bool
225 {
226 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
227 we want the name used to call the function, not the name it
228 will have. */
231 }
233 /* Compute values M and N such that M divides (address of EXP - N) and such
234 that N < M. If these numbers can be determined, store M in alignp and N in
235 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
236 *alignp and any bit-offset to *bitposp.
238 Note that the address (and thus the alignment) computed here is based
239 on the address to which a symbol resolves, whereas DECL_ALIGN is based
240 on the address at which an object is actually located. These two
241 addresses are not always the same. For example, on ARM targets,
242 the address &foo of a Thumb function foo() has the lowest bit set,
243 whereas foo() itself starts on an even address.
245 If ADDR_P is true we are taking the address of the memory reference EXP
246 and thus cannot rely on the access taking place. */
248 static bool
251 {
253 tree offset;
254 machine_mode mode;
259 /* Get the innermost object and the constant (bitpos) and possibly
260 variable (offset) offset of the access. */
264 /* Extract alignment information from the innermost object and
265 possibly adjust bitpos and offset. */
267 {
268 /* Function addresses can encode extra information besides their
269 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
270 allows the low bit to be used as a virtual bit, we know
271 that the address itself must be at least 2-byte aligned. */
274 }
276 ;
278 {
279 /* The alignment of a CONST_DECL is determined by its initializer. */
286 }
288 {
291 }
295 {
301 /* If the address is explicitely aligned, handle that. */
304 {
309 }
311 known_alignment
315 /* Re-apply explicit alignment to the bitpos. */
318 /* The alignment of the pointer operand in a TARGET_MEM_REF
319 has to take the variable offset parts into account. */
321 {
323 {
328 }
332 }
334 /* When EXP is an actual memory reference then we can use
335 TYPE_ALIGN of a pointer indirection to derive alignment.
336 Do so only if get_pointer_alignment_1 did not reveal absolute
337 alignment knowledge and if using that alignment would
338 improve the situation. */
344 else
345 {
346 /* Else adjust bitpos accordingly. */
351 }
352 }
354 {
355 /* STRING_CST are the only constant objects we allow to be not
356 wrapped inside a CONST_DECL. */
362 }
364 /* If there is a non-constant offset part extract the maximum
365 alignment that can prevail. */
367 {
370 {
374 }
375 }
377 /* Account for the alignment of runtime coefficients, so that the constant
378 bitpos is guaranteed to be accurate. */
381 {
384 }
389 }
391 /* For a memory reference expression EXP compute values M and N such that M
392 divides (&EXP - N) and such that N < M. If these numbers can be determined,
393 store M in alignp and N in *BITPOSP and return true. Otherwise return false
394 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
396 bool
399 {
401 }
403 /* Return the alignment in bits of EXP, an object. */
405 unsigned int
407 {
413 /* align and bitpos now specify known low bits of the pointer.
414 ptr & (align - 1) == bitpos. */
419 }
421 /* For a pointer valued expression EXP compute values M and N such that M
422 divides (EXP - N) and such that N < M. If these numbers can be determined,
423 store M in alignp and N in *BITPOSP and return true. Return false if
424 the results are just a conservative approximation.
426 If EXP is not a pointer, false is returned too. */
428 bool
431 {
438 {
445 else
446 {
449 {
453 }
454 }
458 }
461 {
466 {
469 /* Make sure to return a sensible alignment when the multiplication
470 by BITS_PER_UNIT overflowed. */
473 /* We cannot really tell whether this result is an approximation. */
475 }
476 else
477 {
481 }
482 }
484 {
489 }
494 }
496 /* Return the alignment in bits of EXP, a pointer valued expression.
497 The alignment returned is, by default, the alignment of the thing that
498 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
500 Otherwise, look at the expression to see if we can do better, i.e., if the
501 expression is actually pointing at an object whose alignment is tighter. */
503 unsigned int
505 {
511 /* align and bitpos now specify known low bits of the pointer.
512 ptr & (align - 1) == bitpos. */
518 }
520 /* Return the number of leading non-zero elements in the sequence
521 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
522 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
524 unsigned
526 {
532 {
533 /* Optimize the common case of plain char. */
535 {
539 }
540 }
541 else
542 {
544 {
548 }
549 }
551 }
553 /* Compute the length of a null-terminated character string or wide
554 character string handling character sizes of 1, 2, and 4 bytes.
555 TREE_STRING_LENGTH is not the right way because it evaluates to
556 the size of the character array in bytes (as opposed to characters)
557 and because it can contain a zero byte in the middle.
559 ONLY_VALUE should be nonzero if the result is not going to be emitted
560 into the instruction stream and zero if it is going to be expanded.
561 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
562 is returned, otherwise NULL, since
563 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
564 evaluate the side-effects.
566 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
567 accesses. Note that this implies the result is not going to be emitted
568 into the instruction stream.
570 The value returned is of type `ssizetype'.
572 Unfortunately, string_constant can't access the values of const char
573 arrays with initializers, so neither can we do so here. */
575 tree
577 {
581 {
588 }
596 /* Offset from the beginning of the string in bytes. */
597 tree byteoff;
602 /* Determine the size of the string element. */
603 unsigned eltsize
606 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
607 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
608 in case the latter is less than the size of the array, such as when
609 SRC refers to a short string literal used to initialize a large array.
610 In that case, the elements of the array after the terminating NUL are
611 all NUL. */
619 {
622 }
624 /* PTR can point to the byte representation of any string type, including
625 char* and wchar_t*. */
629 {
630 /* If the string has an internal NUL character followed by any
631 non-NUL characters (e.g., "foo\0bar"), we can't compute
632 the offset to the following NUL if we don't know where to
633 start searching for it. */
636 {
637 /* Return when an embedded null character is found. */
639 }
644 /* We don't know the starting offset, but we do know that the string
645 has no internal zero bytes. If the offset falls within the bounds
646 of the string subtract the offset from the length of the string,
647 and return that. Otherwise the length is zero. Take care to
648 use SAVE_EXPR in case the OFFSET has side-effects. */
656 }
658 /* Offset from the beginning of the string in elements. */
659 HOST_WIDE_INT eltoff;
661 /* We have a known offset into the string. Start searching there for
662 a null character if we can represent it as a single HOST_WIDE_INT. */
667 else
670 /* If the offset is known to be out of bounds, warn, and call strlen at
671 runtime. */
673 {
674 /* Suppress multiple warnings for propagated constant strings. */
677 {
680 eltoff);
682 }
684 }
686 /* Use strlen to search for the first zero byte. Since any strings
687 constructed with build_string will have nulls appended, we win even
688 if we get handed something like (char[4])"abcd".
690 Since ELTOFF is our starting index into the string, no further
691 calculation is needed. */
696 }
698 /* Return a constant integer corresponding to target reading
699 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
701 static rtx
703 {
704 HOST_WIDE_INT ch;
718 {
730 }
734 }
736 /* Cast a target constant CST to target CHAR and if that value fits into
737 host char type, return zero and put that value into variable pointed to by
738 P. */
740 static int
742 {
749 /* Do not care if it fits or not right here. */
764 }
766 /* Similar to save_expr, but assumes that arbitrary code is not executed
767 in between the multiple evaluations. In particular, we assume that a
768 non-addressable local variable will not be modified. */
770 static tree
772 {
780 }
782 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
783 times to get the address of either a higher stack frame, or a return
784 address located within it (depending on FNDECL_CODE). */
786 static rtx
788 {
792 {
793 /* For a zero count with __builtin_return_address, we don't care what
794 frame address we return, because target-specific definitions will
795 override us. Therefore frame pointer elimination is OK, and using
796 the soft frame pointer is OK.
798 For a nonzero count, or a zero count with __builtin_frame_address,
799 we require a stable offset from the current frame pointer to the
800 previous one, so we must use the hard frame pointer, and
801 we must disable frame pointer elimination. */
804 else
805 {
808 /* Tell reload not to eliminate the frame pointer. */
810 }
811 }
816 /* On the SPARC, the return address is not in the frame, it is in a
817 register. There is no way to access it off of the current frame
818 pointer, but it can be accessed off the previous frame pointer by
819 reading the value from the register window save area. */
821 count--;
823 /* Scan back COUNT frames to the specified frame. */
825 {
826 /* Assume the dynamic chain pointer is in the word that the
827 frame address points to, unless otherwise specified. */
832 }
834 /* For __builtin_frame_address, return what we've got. But, on
835 the SPARC for example, we may have to add a bias. */
839 /* For __builtin_return_address, get the return address from that frame. */
840 #ifdef RETURN_ADDR_RTX
842 #else
846 #endif
848 }
850 /* Alias set used for setjmp buffer. */
853 /* Construct the leading half of a __builtin_setjmp call. Control will
854 return to RECEIVER_LABEL. This is also called directly by the SJLJ
855 exception handling code. */
857 void
859 {
861 rtx stack_save;
862 rtx mem;
871 /* We store the frame pointer and the address of receiver_label in
872 the buffer and use the rest of it for the stack save area, which
873 is machine-dependent. */
892 /* If there is further processing to do, do it. */
896 /* We have a nonlocal label. */
898 }
900 /* Construct the trailing part of a __builtin_setjmp call. This is
901 also called directly by the SJLJ exception handling code.
902 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
904 void
906 {
907 rtx chain;
909 /* Mark the FP as used when we get here, so we have to make sure it's
910 marked as used by this function. */
913 /* Mark the static chain as clobbered here so life information
914 doesn't get messed up for it. */
919 /* Now put in the code to restore the frame pointer, and argument
920 pointer, if needed. */
922 {
923 /* First adjust our frame pointer to its actual value. It was
924 previously set to the start of the virtual area corresponding to
925 the stacked variables when we branched here and now needs to be
926 adjusted to the actual hardware fp value.
928 Assignments to virtual registers are converted by
929 instantiate_virtual_regs into the corresponding assignment
930 to the underlying register (fp in this case) that makes
931 the original assignment true.
932 So the following insn will actually be decrementing fp by
933 TARGET_STARTING_FRAME_OFFSET. */
936 /* Restoring the frame pointer also modifies the hard frame pointer.
937 Mark it used (so that the previous assignment remains live once
938 the frame pointer is eliminated) and clobbered (to represent the
939 implicit update from the assignment). */
942 }
945 {
946 /* If the argument pointer can be eliminated in favor of the
947 frame pointer, we don't need to restore it. We assume here
948 that if such an elimination is present, it can always be used.
949 This is the case on all known machines; if we don't make this
950 assumption, we do unnecessary saving on many machines. */
960 {
961 /* Now restore our arg pointer from the address at which it
962 was saved in our stack frame. */
965 }
966 }
972 else
975 /* We must not allow the code we just generated to be reordered by
976 scheduling. Specifically, the update of the frame pointer must
977 happen immediately, not later. */
979 }
981 /* __builtin_longjmp is passed a pointer to an array of five words (not
982 all will be used on all machines). It operates similarly to the C
983 library function of the same name, but is more efficient. Much of
984 the code below is copied from the handling of non-local gotos. */
986 static void
988 {
993 /* DRAP is needed for stack realign if longjmp is expanded to current
994 function */
1005 /* We require that the user must pass a second argument of 1, because
1006 that is what builtin_setjmp will return. */
1012 else
1013 {
1024 /* Pick up FP, label, and SP from the block and jump. This code is
1025 from expand_goto in stmt.c; see there for detailed comments. */
1027 /* We have to pass a value to the nonlocal_goto pattern that will
1028 get copied into the static_chain pointer, but it does not matter
1029 what that value is, because builtin_setjmp does not use it. */
1031 else
1032 {
1044 }
1045 }
1047 /* Search backwards and mark the jump insn as a non-local goto.
1048 Note that this precludes the use of __builtin_longjmp to a
1049 __builtin_setjmp target in the same function. However, we've
1050 already cautioned the user that these functions are for
1051 internal exception handling use only. */
1053 {
1057 {
1060 }
1063 }
1064 }
1068 {
1070 }
1072 /* This function validates the types of a function call argument list
1073 against a specified list of tree_codes. If the last specifier is a 0,
1074 that represents an ellipsis, otherwise the last specifier must be a
1075 VOID_TYPE. */
1077 static bool
1079 {
1083 const_call_expr_arg_iterator iter;
1084 const_tree arg;
1089 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1094 {
1098 {
1100 /* This signifies an ellipses, any further arguments are all ok. */
1104 /* This signifies an endlink, if no arguments remain, return
1105 true, otherwise return false. */
1109 /* The actual argument must be nonnull when either the whole
1110 called function has been declared nonnull, or when the formal
1111 argument corresponding to the actual argument has been. */
1114 {
1119 }
1120 /* FALLTHRU */
1122 /* If no parameters remain or the parameter's code does not
1123 match the specified code, return false. Otherwise continue
1124 checking any remaining arguments. */
1129 }
1130 }
1132 /* We need gotos here since we can only have one VA_CLOSE in a
1133 function. */
1134 end: ;
1140 }
1142 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1143 and the address of the save area. */
1145 static rtx
1147 {
1162 /* Copy the address of the save location to a register just in case it was
1163 based on the frame pointer. */
1172 /* ??? We no longer need to pass the static chain value, afaik. */
1175 else
1176 {
1182 /* Restore frame pointer for containing function. */
1186 /* USE of hard_frame_pointer_rtx added for consistency;
1187 not clear if really needed. */
1191 /* If the architecture is using a GP register, we must
1192 conservatively assume that the target function makes use of it.
1193 The prologue of functions with nonlocal gotos must therefore
1194 initialize the GP register to the appropriate value, and we
1195 must then make sure that this value is live at the point
1196 of the jump. (Note that this doesn't necessarily apply
1197 to targets with a nonlocal_goto pattern; they are free
1198 to implement it in their own way. Note also that this is
1199 a no-op if the GP register is a global invariant.) */
1205 }
1207 /* Search backwards to the jump insn and mark it as a
1208 non-local goto. */
1210 {
1212 {
1215 }
1218 }
1221 }
1223 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1224 (not all will be used on all machines) that was passed to __builtin_setjmp.
1225 It updates the stack pointer in that block to the current value. This is
1226 also called directly by the SJLJ exception handling code. */
1228 void
1230 {
1233 rtx stack_save
1235 memory_address
1241 }
1243 /* Expand a call to __builtin_prefetch. For a target that does not support
1244 data prefetch, evaluate the memory address argument in case it has side
1245 effects. */
1247 static void
1249 {
1259 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1260 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1261 locality). */
1265 else
1269 else
1272 /* Argument 0 is an address. */
1275 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1277 {
1280 }
1282 /* Argument 1 must be either zero or one. */
1284 {
1288 }
1290 /* Argument 2 (locality) must be a compile-time constant int. */
1292 {
1295 }
1297 /* Argument 2 must be 0, 1, 2, or 3. */
1299 {
1302 }
1305 {
1313 }
1315 /* Don't do anything with direct references to volatile memory, but
1316 generate code to handle other side effects. */
1319 }
1321 /* Get a MEM rtx for expression EXP which is the address of an operand
1322 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1323 the maximum length of the block of memory that might be accessed or
1324 NULL if unknown. */
1326 static rtx
1328 {
1332 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1333 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1340 /* Get an expression we can use to find the attributes to assign to MEM.
1341 First remove any nops. */
1346 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1347 (as builtin stringops may alias with anything). */
1354 /* If the MEM_REF has no acceptable address, try to get the base object
1355 from the original address we got, and build an all-aliasing
1356 unknown-sized access to that one. */
1362 {
1367 size_zero_node,
1368 NULL)),
1371 }
1374 }
1375 \f
1376 /* Built-in functions to perform an untyped call and return. */
1378 #define apply_args_mode \
1379 (this_target_builtins->x_apply_args_mode)
1380 #define apply_result_mode \
1381 (this_target_builtins->x_apply_result_mode)
1383 /* Return the size required for the block returned by __builtin_apply_args,
1384 and initialize apply_args_mode. */
1386 static int
1388 {
1393 /* The values computed by this function never change. */
1395 {
1396 /* The first value is the incoming arg-pointer. */
1399 /* The second value is the structure value address unless this is
1400 passed as an "invisible" first argument. */
1406 {
1416 }
1417 else
1418 {
1420 }
1421 }
1423 }
1425 /* Return the size required for the block returned by __builtin_apply,
1426 and initialize apply_result_mode. */
1428 static int
1430 {
1434 /* The values computed by this function never change. */
1436 {
1441 {
1451 }
1452 else
1455 /* Allow targets that use untyped_call and untyped_return to override
1456 the size so that machine-specific information can be stored here. */
1457 #ifdef APPLY_RESULT_SIZE
1459 #endif
1460 }
1462 }
1464 /* Create a vector describing the result block RESULT. If SAVEP is true,
1465 the result block is used to save the values; otherwise it is used to
1466 restore the values. */
1468 static rtx
1470 {
1472 fixed_size_mode mode;
1479 {
1489 }
1491 }
1493 /* Save the state required to perform an untyped call with the same
1494 arguments as were passed to the current function. */
1496 static rtx
1498 {
1501 fixed_size_mode mode;
1502 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1504 /* Create a block where the arg-pointer, structure value address,
1505 and argument registers can be saved. */
1508 /* Walk past the arg-pointer and structure value address. */
1513 /* Save each register used in calling a function to the block. */
1516 {
1525 }
1527 /* Save the arg pointer to the block. */
1529 /* We need the pointer as the caller actually passed them to us, not
1530 as we might have pretended they were passed. Make sure it's a valid
1531 operand, as emit_move_insn isn't expected to handle a PLUS. */
1533 tem
1536 NULL_RTX);
1541 /* Save the structure value address unless this is passed as an
1542 "invisible" first argument. */
1544 {
1548 }
1550 /* Return the address of the block. */
1552 }
1554 /* __builtin_apply_args returns block of memory allocated on
1555 the stack into which is stored the arg pointer, structure
1556 value address, static chain, and all the registers that might
1557 possibly be used in performing a function call. The code is
1558 moved to the start of the function so the incoming values are
1559 saved. */
1561 static rtx
1563 {
1564 /* Don't do __builtin_apply_args more than once in a function.
1565 Save the result of the first call and reuse it. */
1568 {
1569 /* When this function is called, it means that registers must be
1570 saved on entry to this function. So we migrate the
1571 call to the first insn of this function. */
1572 rtx temp;
1581 /* Put the insns after the NOTE that starts the function.
1582 If this is inside a start_sequence, make the outer-level insn
1583 chain current, so the code is placed at the start of the
1584 function. If internal_arg_pointer is a non-virtual pseudo,
1585 it needs to be placed after the function that initializes
1586 that pseudo. */
1591 else
1595 }
1596 }
1598 /* Perform an untyped call and save the state required to perform an
1599 untyped return of whatever value was returned by the given function. */
1601 static rtx
1603 {
1605 fixed_size_mode mode;
1614 /* Create a block where the return registers can be saved. */
1617 /* Fetch the arg pointer from the ARGUMENTS block. */
1624 /* Push a new argument block and copy the arguments. Do not allow
1625 the (potential) memcpy call below to interfere with our stack
1626 manipulations. */
1628 NO_DEFER_POP;
1630 /* Save the stack with nonlocal if available. */
1633 else
1636 /* Allocate a block of memory onto the stack and copy the memory
1637 arguments to the outgoing arguments address. We can pass TRUE
1638 as the 4th argument because we just saved the stack pointer
1639 and will restore it right after the call. */
1642 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1643 may have already set current_function_calls_alloca to true.
1644 current_function_calls_alloca won't be set if argsize is zero,
1645 so we have to guarantee need_drap is true here. */
1651 {
1654 else
1656 }
1663 /* Refer to the argument block. */
1668 /* Walk past the arg-pointer and structure value address. */
1673 /* Restore each of the registers previously saved. Make USE insns
1674 for each of these registers for use in making the call. */
1677 {
1685 }
1687 /* Restore the structure value address unless this is passed as an
1688 "invisible" first argument. */
1691 {
1698 }
1700 /* All arguments and registers used for the call are set up by now! */
1703 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1704 and we don't want to load it into a register as an optimization,
1705 because prepare_call_address already did it if it should be done. */
1709 /* Generate the actual call instruction and save the return value. */
1711 {
1715 }
1717 {
1720 /* Locate the unique return register. It is not possible to
1721 express a call that sets more than one return register using
1722 call_value; use untyped_call for that. In fact, untyped_call
1723 only needs to save the return registers in the given block. */
1726 {
1730 }
1737 }
1738 else
1741 /* Find the CALL insn we just emitted, and attach the register usage
1742 information. */
1746 /* Restore the stack. */
1749 else
1753 OK_DEFER_POP;
1755 /* Return the address of the result block. */
1758 }
1760 /* Perform an untyped return. */
1762 static void
1764 {
1766 fixed_size_mode mode;
1767 rtx reg;
1776 {
1781 }
1783 /* Restore the return value and note that each value is used. */
1787 {
1799 }
1801 /* Put the USE insns before the return. */
1804 /* Return whatever values was restored by jumping directly to the end
1805 of the function. */
1807 }
1809 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1811 static enum type_class
1813 {
1815 {
1834 }
1835 }
1837 /* Expand a call EXP to __builtin_classify_type. */
1839 static rtx
1841 {
1845 }
1847 /* This helper macro, meant to be used in mathfn_built_in below, determines
1848 which among a set of builtin math functions is appropriate for a given type
1849 mode. The `F' (float) and `L' (long double) are automatically generated
1850 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1851 types, there are additional types that are considered with 'F32', 'F64',
1852 'F128', etc. suffixes. */
1853 #define CASE_MATHFN(MATHFN) \
1854 CASE_CFN_##MATHFN: \
1855 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1856 fcodel = BUILT_IN_##MATHFN##L ; break;
1857 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1858 types. */
1859 #define CASE_MATHFN_FLOATN(MATHFN) \
1860 CASE_CFN_##MATHFN: \
1861 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1862 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1863 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1864 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1865 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1866 break;
1867 /* Similar to above, but appends _R after any F/L suffix. */
1868 #define CASE_MATHFN_REENT(MATHFN) \
1869 case CFN_BUILT_IN_##MATHFN##_R: \
1870 case CFN_BUILT_IN_##MATHFN##F_R: \
1871 case CFN_BUILT_IN_##MATHFN##L_R: \
1872 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1873 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1875 /* Return a function equivalent to FN but operating on floating-point
1876 values of type TYPE, or END_BUILTINS if no such function exists.
1877 This is purely an operation on function codes; it does not guarantee
1878 that the target actually has an implementation of the function. */
1880 static built_in_function
1882 {
1883 tree mtype;
1894 {
1985 }
2008 else
2010 }
2012 /* Return mathematic function equivalent to FN but operating directly on TYPE,
2013 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2014 otherwise use the explicit declaration. If we can't do the conversion,
2015 return null. */
2017 static tree
2019 {
2028 }
2030 /* Like mathfn_built_in_1, but always use the implicit array. */
2032 tree
2034 {
2036 }
2038 /* Like mathfn_built_in_1, but take a built_in_function and
2039 always use the implicit array. */
2041 tree
2043 {
2045 }
2047 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2048 return its code, otherwise return IFN_LAST. Note that this function
2049 only tests whether the function is defined in internals.def, not whether
2050 it is actually available on the target. */
2052 internal_fn
2054 {
2058 {
2059 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2060 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2061 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2062 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2063 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2064 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2065 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2082 }
2083 }
2085 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2086 on the current target by a call to an internal function, return the
2087 code of that internal function, otherwise return IFN_LAST. The caller
2088 is responsible for ensuring that any side-effects of the built-in
2089 call are dealt with correctly. E.g. if CALL sets errno, the caller
2090 must decide that the errno result isn't needed or make it available
2091 in some other way. */
2093 internal_fn
2095 {
2097 {
2100 {
2105 }
2106 }
2108 }
2110 /* Expand a call to the builtin trinary math functions (fma).
2111 Return NULL_RTX if a normal call should be emitted rather than expanding the
2112 function in-line. EXP is the expression that is a call to the builtin
2113 function; if convenient, the result should be placed in TARGET.
2114 SUBTARGET may be used as the target for computing one of EXP's
2115 operands. */
2117 static rtx
2119 {
2120 optab builtin_optab;
2125 machine_mode mode;
2135 {
2141 }
2143 /* Make a suitable register to place result in. */
2146 /* Before working hard, check whether the instruction is available. */
2152 /* Always stabilize the argument list. */
2163 /* Compute into RESULT.
2164 Set RESULT to wherever the result comes back. */
2168 /* If we were unable to expand via the builtin, stop the sequence
2169 (without outputting the insns) and call to the library function
2170 with the stabilized argument list. */
2172 {
2175 }
2177 /* Output the entire sequence. */
2183 }
2185 /* Expand a call to the builtin sin and cos math functions.
2186 Return NULL_RTX if a normal call should be emitted rather than expanding the
2187 function in-line. EXP is the expression that is a call to the builtin
2188 function; if convenient, the result should be placed in TARGET.
2189 SUBTARGET may be used as the target for computing one of EXP's
2190 operands. */
2192 static rtx
2194 {
2195 optab builtin_optab;
2196 rtx op0;
2199 machine_mode mode;
2200 tree arg;
2208 {
2214 }
2216 /* Make a suitable register to place result in. */
2219 /* Check if sincos insn is available, otherwise fallback
2220 to sin or cos insn. */
2223 {
2230 }
2232 /* Before working hard, check whether the instruction is available. */
2234 {
2237 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2238 need to expand the argument again. This way, we will not perform
2239 side-effects more the once. */
2246 /* Compute into RESULT.
2247 Set RESULT to wherever the result comes back. */
2249 {
2253 {
2262 }
2264 }
2265 else
2269 {
2270 /* Output the entire sequence. */
2275 }
2277 /* If we were unable to expand via the builtin, stop the sequence
2278 (without outputting the insns) and call to the library function
2279 with the stabilized argument list. */
2281 }
2284 }
2286 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2287 return an RTL instruction code that implements the functionality.
2288 If that isn't possible or available return CODE_FOR_nothing. */
2290 static enum insn_code
2292 {
2295 machine_mode mode;
2298 {
2312 /* These builtins have no optabs (yet). */
2316 }
2318 /* There's no easy way to detect the case we need to set EDOM. */
2322 /* Optab mode depends on the mode of the input argument. */
2328 }
2330 /* Expand a call to one of the builtin math functions that operate on
2331 floating point argument and output an integer result (ilogb, isinf,
2332 isnan, etc).
2333 Return 0 if a normal call should be emitted rather than expanding the
2334 function in-line. EXP is the expression that is a call to the builtin
2335 function; if convenient, the result should be placed in TARGET. */
2337 static rtx
2339 {
2341 rtx op0;
2343 machine_mode mode;
2344 tree arg;
2354 {
2359 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2360 need to expand the argument again. This way, we will not perform
2361 side-effects more the once. */
2376 }
2379 }
2381 /* Expand a call to the builtin sincos math function.
2382 Return NULL_RTX if a normal call should be emitted rather than expanding the
2383 function in-line. EXP is the expression that is a call to the builtin
2384 function. */
2386 static rtx
2388 {
2390 machine_mode mode;
2404 /* Make a suitable register to place result in. */
2407 /* Check if sincos insn is available, otherwise emit the call. */
2422 /* Compute into target1 and target2.
2423 Set TARGET to wherever the result comes back. */
2427 /* Move target1 and target2 to the memory locations indicated
2428 by op1 and op2. */
2433 }
2435 /* Expand a call to the internal cexpi builtin to the sincos math function.
2436 EXP is the expression that is a call to the builtin function; if convenient,
2437 the result should be placed in TARGET. */
2439 static rtx
2441 {
2444 machine_mode mode;
2455 /* Try expanding via a sincos optab, fall back to emitting a libcall
2456 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2457 is only generated from sincos, cexp or if we have either of them. */
2459 {
2465 /* Compute into op1 and op2. */
2467 }
2469 {
2480 else
2490 /* Make sure not to fold the sincos call again. */
2494 }
2495 else
2496 {
2506 else
2509 /* If we don't have a decl for cexp create one. This is the
2510 friendliest fallback if the user calls __builtin_cexpi
2511 without full target C99 function support. */
2513 {
2514 tree fntype;
2526 }
2531 /* Make sure not to fold the cexp call again. */
2535 }
2537 /* Now build the proper return type. */
2542 }
2544 /* Conveniently construct a function call expression. FNDECL names the
2545 function to be called, N is the number of arguments, and the "..."
2546 parameters are the argument expressions. Unlike build_call_exr
2547 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2549 static tree
2551 {
2561 }
2563 /* Expand a call to one of the builtin rounding functions gcc defines
2564 as an extension (lfloor and lceil). As these are gcc extensions we
2565 do not need to worry about setting errno to EDOM.
2566 If expanding via optab fails, lower expression to (int)(floor(x)).
2567 EXP is the expression that is a call to the builtin function;
2568 if convenient, the result should be placed in TARGET. */
2570 static rtx
2572 {
2573 convert_optab builtin_optab;
2578 tree fallback_fndecl;
2579 machine_mode mode;
2580 tree arg;
2588 {
2605 }
2607 /* Make a suitable register to place result in. */
2612 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2613 need to expand the argument again. This way, we will not perform
2614 side-effects more the once. */
2621 /* Compute into TARGET. */
2623 {
2624 /* Output the entire sequence. */
2629 }
2631 /* If we were unable to expand via the builtin, stop the sequence
2632 (without outputting the insns). */
2635 /* Fall back to floating point rounding optab. */
2638 /* For non-C99 targets we may end up without a fallback fndecl here
2639 if the user called __builtin_lfloor directly. In this case emit
2640 a call to the floor/ceil variants nevertheless. This should result
2641 in the best user experience for not full C99 targets. */
2643 {
2644 tree fntype;
2648 {
2681 }
2686 }
2693 /* Truncate the result of floating point optab to integer
2694 via expand_fix (). */
2699 }
2701 /* Expand a call to one of the builtin math functions doing integer
2702 conversion (lrint).
2703 Return 0 if a normal call should be emitted rather than expanding the
2704 function in-line. EXP is the expression that is a call to the builtin
2705 function; if convenient, the result should be placed in TARGET. */
2707 static rtx
2709 {
2710 convert_optab builtin_optab;
2711 rtx op0;
2714 tree arg;
2715 machine_mode mode;
2724 {
2743 }
2745 /* There's no easy way to detect the case we need to set EDOM. */
2749 /* Make a suitable register to place result in. */
2752 /* There's no easy way to detect the case we need to set EDOM. */
2754 {
2757 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2758 need to expand the argument again. This way, we will not perform
2759 side-effects more the once. */
2767 {
2768 /* Output the entire sequence. */
2773 }
2775 /* If we were unable to expand via the builtin, stop the sequence
2776 (without outputting the insns) and call to the library function
2777 with the stabilized argument list. */
2779 }
2782 {
2783 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2784 targets, (int) round (x) should never be transformed into
2785 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2786 a call to lround in the hope that the target provides at least some
2787 C99 functions. This should result in the best user experience for
2788 not full C99 targets. */
2789 tree fallback_fndecl = mathfn_built_in_1
2798 }
2801 }
2803 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2804 a normal call should be emitted rather than expanding the function
2805 in-line. EXP is the expression that is a call to the builtin
2806 function; if convenient, the result should be placed in TARGET. */
2808 static rtx
2810 {
2813 machine_mode mode;
2814 machine_mode mode2;
2823 /* Emit a libcall to libgcc. */
2825 /* Mode of the 2nd argument must match that of an int. */
2843 }
2845 /* Expand expression EXP which is a call to the strlen builtin. Return
2846 NULL_RTX if we failed and the caller should emit a normal call, otherwise
2847 try to get the result in TARGET, if convenient. */
2849 static rtx
2851 machine_mode target_mode)
2852 {
2857 rtx pat;
2858 tree len;
2860 rtx src_reg;
2862 machine_mode insn_mode;
2866 /* If the length can be computed at compile-time, return it. */
2871 /* If the length can be computed at compile-time and is constant
2872 integer, but there are side-effects in src, evaluate
2873 src for side-effects, then return len.
2874 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2875 can be optimized into: i++; x = 3; */
2878 {
2881 }
2885 /* If SRC is not a pointer type, don't do this operation inline. */
2889 /* Bail out if we can't compute strlen in the right mode. */
2891 {
2895 }
2899 /* Make a place to hold the source address. We will not expand
2900 the actual source until we are sure that the expansion will
2901 not fail -- there are trees that cannot be expanded twice. */
2904 /* Mark the beginning of the strlen sequence so we can emit the
2905 source operand later. */
2915 /* Check to see if the argument was declared attribute nonstring
2916 and if so, issue a warning since at this point it's not known
2917 to be nul-terminated. */
2920 /* Now that we are assured of success, expand the source. */
2924 {
2925 #ifdef POINTERS_EXTEND_UNSIGNED
2928 POINTERS_EXTEND_UNSIGNED);
2929 #endif
2931 }
2937 else
2940 /* Return the value in the proper mode for this function. */
2945 else
2949 }
2951 /* Expand call EXP to the strnlen built-in, returning the result
2952 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
2954 static rtx
2956 {
2976 {
2980 "%K%qD specified bound %E "
2991 }
3004 "%K%qD specified bound [%wu, %wu] "
3017 }
3019 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3020 bytes from constant string DATA + OFFSET and return it as target
3021 constant. */
3023 static rtx
3025 scalar_int_mode mode)
3026 {
3034 }
3036 /* LEN specify length of the block of memcpy/memset operation.
3037 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3038 In some cases we can make very likely guess on max size, then we
3039 set it into PROBABLE_MAX_SIZE. */
3041 static void
3046 {
3048 {
3051 }
3052 else
3053 {
3057 /* Determine bounds from the type. */
3060 else
3065 else
3071 {
3076 }
3078 {
3079 /* Anti range 0...N lets us to determine minimal size to N+1. */
3081 {
3084 }
3085 /* Code like
3087 int n;
3088 if (n < 100)
3089 memcpy (a, b, n)
3091 Produce anti range allowing negative values of N. We still
3092 can use the information and make a guess that N is not negative.
3093 */
3096 }
3097 }
3101 }
3103 /* Try to verify that the sizes and lengths of the arguments to a string
3104 manipulation function given by EXP are within valid bounds and that
3105 the operation does not lead to buffer overflow or read past the end.
3106 Arguments other than EXP may be null. When non-null, the arguments
3107 have the following meaning:
3108 DST is the destination of a copy call or NULL otherwise.
3109 SRC is the source of a copy call or NULL otherwise.
3110 DSTWRITE is the number of bytes written into the destination obtained
3111 from the user-supplied size argument to the function (such as in
3112 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3113 MAXREAD is the user-supplied bound on the length of the source sequence
3114 (such as in strncat(d, s, N). It specifies the upper limit on the number
3115 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3116 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3117 expression EXP is a string function call (as opposed to a memory call
3118 like memcpy). As an exception, SRCSTR can also be an integer denoting
3119 the precomputed size of the source string or object (for functions like
3120 memcpy).
3121 DSTSIZE is the size of the destination object specified by the last
3122 argument to the _chk builtins, typically resulting from the expansion
3123 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3124 DSTSIZE).
3126 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3127 SIZE_MAX.
3129 If the call is successfully verified as safe return true, otherwise
3130 return false. */
3132 static bool
3135 {
3138 /* The size of the largest object is half the address space, or
3139 PTRDIFF_MAX. (This is way too permissive.) */
3142 /* Either the length of the source string for string functions or
3143 the size of the source object for raw memory functions. */
3148 /* Set to true when the exact number of bytes written by a string
3149 function like strcpy is not known and the only thing that is
3150 known is that it must be at least one (for the terminating nul). */
3153 {
3154 /* SRCSTR is normally a pointer to string but as a special case
3155 it can be an integer denoting the length of a string. */
3157 {
3158 /* Try to determine the range of lengths the source string
3159 refers to. If it can be determined and is less than
3160 the upper bound given by MAXREAD add one to it for
3161 the terminating nul. Otherwise, set it to one for
3162 the same reason, or to MAXREAD as appropriate. */
3165 {
3168 else
3179 }
3180 else
3181 {
3184 }
3185 }
3186 else
3188 }
3191 {
3192 /* When the only available piece of data is the object size
3193 there is nothing to do. */
3197 /* Otherwise, when the length of the source sequence is known
3198 (as with strlen), set DSTWRITE to it. */
3201 }
3211 /* First check the number of bytes to be written against the maximum
3212 object size. */
3216 {
3226 "%K%qD specified size %E "
3229 else
3231 "%K%qD specified size between %E and %E "
3239 }
3241 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3242 constant, and in range of unsigned HOST_WIDE_INT. */
3245 /* Next check the number of bytes to be written against the destination
3246 object size. */
3248 {
3253 || (dstwrite
3256 {
3264 {
3265 /* This is a call to strcpy with a destination of 0 size
3266 and a source of unknown length. The call will write
3267 at least one byte past the end of the destination. */
3269 "%K%qD writing %E or more bytes into a region "
3272 }
3275 "%K%qD writing %E byte into a region "
3277 "%K%qD writing %E bytes into a region "
3281 {
3282 /* Avoid printing the upper bound if it's invalid. */
3284 "%K%qD writing %E or more bytes into a region "
3287 }
3288 else
3290 "%K%qD writing between %E and %E bytes into "
3293 dstsize);
3295 /* Return error when an overflow has been detected. */
3297 }
3298 }
3300 /* Check the maximum length of the source sequence against the size
3301 of the destination object if known, or against the maximum size
3302 of an object. */
3304 {
3307 /* Use the lower end for MAXREAD from now on. */
3312 {
3317 {
3321 /* Warn about crazy big sizes first since that's more
3322 likely to be meaningful than saying that the bound
3323 is greater than the object size if both are big. */
3326 "%K%qD specified bound %E "
3330 else
3332 "%K%qD specified bound between %E and %E "
3338 }
3341 {
3347 "%K%qD specified bound %E "
3351 else
3353 "%K%qD specified bound between %E and %E "
3358 }
3359 }
3360 }
3362 /* Check for reading past the end of SRC. */
3367 {
3379 {
3380 /* Avoid printing the upper bound if it's invalid. */
3382 "%K%qD reading %E or more bytes from a region "
3385 }
3386 else
3388 "%K%qD reading between %E and %E bytes from a region "
3392 }
3395 }
3397 /* Helper to compute the size of the object referenced by the DEST
3398 expression which must have pointer type, using Object Size type
3399 OSTYPE (only the least significant 2 bits are used). Return
3400 an estimate of the size of the object if successful or NULL when
3401 the size cannot be determined. When the referenced object involves
3402 a non-constant offset in some range the returned value represents
3403 the largest size given the smallest non-negative offset in the
3404 range. The function is intended for diagnostics and should not
3405 be used to influence code generation or optimization. */
3407 tree
3409 {
3412 /* Only the two least significant bits are meaningful. */
3419 {
3428 {
3429 /* compute_builtin_object_size fails for addresses with
3430 non-constant offsets. Try to determine the range of
3431 such an offset here and use it to adjust the constant
3432 size. */
3435 {
3437 {
3441 /* Ignore negative offsets for now. For others,
3442 use the lower bound as the most optimistic
3443 estimate of the (remaining) size. */
3445 ;
3449 else
3451 }
3452 }
3455 {
3460 {
3462 {
3465 /* Ignore negative offsets for now. For others,
3466 use the lower bound as the most optimistic
3467 estimate of the (remaining)size. */
3469 ;
3473 else
3475 }
3476 }
3477 }
3478 }
3481 }
3483 /* Unless computing the largest size (for memcpy and other raw memory
3484 functions), try to determine the size of the object from its type. */
3499 {
3500 /* Return the constant size unless it's zero (that's a zero-length
3501 array likely at the end of a struct). */
3506 }
3509 }
3511 /* Helper to determine and check the sizes of the source and the destination
3512 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3513 call expression, DEST is the destination argument, SRC is the source
3514 argument or null, and LEN is the number of bytes. Use Object Size type-0
3515 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3516 (no overflow or invalid sizes), false otherwise. */
3518 static bool
3520 {
3521 /* For functions like memset and memcpy that operate on raw memory
3522 try to determine the size of the largest source and destination
3523 object using type-0 Object Size regardless of the object size
3524 type specified by the option. */
3530 }
3532 /* Validate memchr arguments without performing any expansion.
3533 Return NULL_RTX. */
3535 static rtx
3537 {
3545 /* Diagnose calls where the specified length exceeds the size
3546 of the object. */
3548 {
3552 }
3555 }
3557 /* Expand a call EXP to the memcpy builtin.
3558 Return NULL_RTX if we failed, the caller should emit a normal call,
3559 otherwise try to get the result in TARGET, if convenient (and in
3560 mode MODE if that's convenient). */
3562 static rtx
3564 {
3577 }
3579 /* Check a call EXP to the memmove built-in for validity.
3580 Return NULL_RTX on both success and failure. */
3582 static rtx
3584 {
3596 }
3598 /* Expand a call EXP to the mempcpy builtin.
3599 Return NULL_RTX if we failed; the caller should emit a normal call,
3600 otherwise try to get the result in TARGET, if convenient (and in
3601 mode MODE if that's convenient). If ENDP is 0 return the
3602 destination pointer, if ENDP is 1 return the end pointer ala
3603 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3604 stpcpy. */
3606 static rtx
3608 {
3617 /* Policy does not generally allow using compute_objsize (which
3618 is used internally by check_memop_size) to change code generation
3619 or drive optimization decisions.
3621 In this instance it is safe because the code we generate has
3622 the same semantics regardless of the return value of
3623 check_memop_sizes. Exactly the same amount of data is copied
3624 and the return value is exactly the same in both cases.
3626 Furthermore, check_memop_size always uses mode 0 for the call to
3627 compute_objsize, so the imprecise nature of compute_objsize is
3628 avoided. */
3630 /* Avoid expanding mempcpy into memcpy when the call is determined
3631 to overflow the buffer. This also prevents the same overflow
3632 from being diagnosed again when expanding memcpy. */
3638 }
3640 /* Helper function to do the actual work for expand of memory copy family
3641 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3642 of memory from SRC to DEST and assign to TARGET if convenient.
3643 If ENDP is 0 return the
3644 destination pointer, if ENDP is 1 return the end pointer ala
3645 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3646 stpcpy. */
3648 static rtx
3651 {
3662 /* If DEST is not a pointer type, call the normal function. */
3666 /* If either SRC is not a pointer type, don't do this
3667 operation in-line. */
3684 /* If SRC is a string constant and block move would be done
3685 by pieces, we can avoid loading the string from memory
3686 and only stored the computed constants. */
3693 {
3695 builtin_memcpy_read_str,
3701 }
3706 /* Copy word part most expediently. */
3719 {
3722 }
3725 {
3727 /* stpcpy pointer to last byte. */
3730 }
3733 }
3735 static rtx
3738 {
3740 endp);
3741 }
3743 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3744 we failed, the caller should emit a normal call, otherwise try to
3745 get the result in TARGET, if convenient. If ENDP is 0 return the
3746 destination pointer, if ENDP is 1 return the end pointer ala
3747 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3748 stpcpy. */
3750 static rtx
3752 {
3754 rtx dest_mem;
3755 rtx src_mem;
3763 {
3766 }
3775 {
3777 /* movstr is supposed to set end to the address of the NUL
3778 terminator. If the caller requested a mempcpy-like return value,
3779 adjust it. */
3781 {
3785 }
3786 }
3788 }
3790 /* Do some very basic size validation of a call to the strcpy builtin
3791 given by EXP. Return NULL_RTX to have the built-in expand to a call
3792 to the library function. */
3794 static rtx
3796 {
3804 /* There is no way here to determine the length of the string in
3805 the destination to which the SRC string is being appended so
3806 just diagnose cases when the souce string is longer than
3807 the destination object. */
3812 destsize);
3815 }
3817 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3818 NULL_RTX if we failed the caller should emit a normal call, otherwise
3819 try to get the result in TARGET, if convenient (and in mode MODE if that's
3820 convenient). */
3822 static rtx
3824 {
3832 {
3836 }
3839 {
3840 /* Check to see if the argument was declared attribute nonstring
3841 and if so, issue a warning since at this point it's not known
3842 to be nul-terminated. */
3846 }
3849 }
3851 /* Helper function to do the actual work for expand_builtin_strcpy. The
3852 arguments to the builtin_strcpy call DEST and SRC are broken out
3853 so that this can also be called without constructing an actual CALL_EXPR.
3854 The other arguments and return value are the same as for
3855 expand_builtin_strcpy. */
3857 static rtx
3859 {
3861 }
3863 /* Expand a call EXP to the stpcpy builtin.
3864 Return NULL_RTX if we failed the caller should emit a normal call,
3865 otherwise try to get the result in TARGET, if convenient (and in
3866 mode MODE if that's convenient). */
3868 static rtx
3870 {
3881 {
3885 }
3887 /* If return value is ignored, transform stpcpy into strcpy. */
3889 {
3893 }
3894 else
3895 {
3897 rtx ret;
3899 /* Ensure we get an actual string whose length can be evaluated at
3900 compile-time, not an expression containing a string. This is
3901 because the latter will potentially produce pessimized code
3902 when used to produce the return value. */
3914 {
3918 {
3922 {
3924 {
3927 else
3929 }
3938 }
3939 }
3940 }
3943 }
3944 }
3946 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
3947 arguments while being careful to avoid duplicate warnings (which could
3948 be issued if the expander were to expand the call, resulting in it
3949 being emitted in expand_call(). */
3951 static rtx
3953 {
3955 {
3956 /* The call has been successfully expanded. Check for nonstring
3957 arguments and issue warnings as appropriate. */
3960 }
3963 }
3965 /* Check a call EXP to the stpncpy built-in for validity.
3966 Return NULL_RTX on both success and failure. */
3968 static rtx
3970 {
3976 /* The source and destination of the call. */
3980 /* The exact number of bytes to write (not the maximum). */
3983 /* The size of the destination object. */
3989 }
3991 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3992 bytes from constant string DATA + OFFSET and return it as target
3993 constant. */
3995 rtx
3997 scalar_int_mode mode)
3998 {
4005 }
4007 /* Helper to check the sizes of sequences and the destination of calls
4008 to __builtin_strncat and __builtin___strncat_chk. Returns true on
4009 success (no overflow or invalid sizes), false otherwise. */
4011 static bool
4013 {
4018 /* Try to determine the range of lengths that the source expression
4019 refers to. */
4023 /* Try to verify that the destination is big enough for the shortest
4024 string. */
4027 {
4028 /* If it hasn't been provided by __strncat_chk, try to determine
4029 the size of the destination object into which the source is
4030 being copied. */
4032 }
4034 /* Add one for the terminating nul. */
4037 size_one_node)
4040 /* The strncat function copies at most MAXREAD bytes and always appends
4041 the terminating nul so the specified upper bound should never be equal
4042 to (or greater than) the size of the destination. */
4045 {
4054 }
4062 /* The number of bytes to write is LEN but check_access will also
4063 check SRCLEN if LEN's value isn't known. */
4065 objsize);
4066 }
4068 /* Similar to expand_builtin_strcat, do some very basic size validation
4069 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4070 the built-in expand to a call to the library function. */
4072 static rtx
4074 {
4082 /* The upper bound on the number of bytes to write. */
4084 /* The length of the source sequence. */
4087 /* Try to determine the range of lengths that the source expression
4088 refers to. */
4092 else
4095 /* Try to verify that the destination is big enough for the shortest
4096 string. First try to determine the size of the destination object
4097 into which the source is being copied. */
4100 /* Add one for the terminating nul. */
4103 size_one_node)
4106 /* The strncat function copies at most MAXREAD bytes and always appends
4107 the terminating nul so the specified upper bound should never be equal
4108 to (or greater than) the size of the destination. */
4111 {
4120 }
4128 /* The number of bytes to write is SRCLEN. */
4132 }
4134 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4135 NULL_RTX if we failed the caller should emit a normal call. */
4137 static rtx
4139 {
4144 {
4147 /* The number of bytes to write (not the maximum). */
4149 /* The length of the source sequence. */
4153 {
4157 /* The number of bytes to write is LEN but check_access will also
4158 check SLEN if LEN's value isn't known. */
4160 destsize);
4161 }
4163 /* We must be passed a constant len and src parameter. */
4169 /* We're required to pad with trailing zeros if the requested
4170 len is greater than strlen(s2)+1. In that case try to
4171 use store_by_pieces, if it fails, punt. */
4173 {
4176 rtx dest_mem;
4180 builtin_strncpy_read_str,
4187 builtin_strncpy_read_str,
4192 }
4193 }
4195 }
4197 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4198 bytes from constant string DATA + OFFSET and return it as target
4199 constant. */
4201 rtx
4203 scalar_int_mode mode)
4204 {
4211 }
4213 /* Callback routine for store_by_pieces. Return the RTL of a register
4214 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4215 char value given in the RTL register data. For example, if mode is
4216 4 bytes wide, return the RTL for 0x01010101*data. */
4218 static rtx
4220 scalar_int_mode mode)
4221 {
4237 }
4239 /* Expand expression EXP, which is a call to the memset builtin. Return
4240 NULL_RTX if we failed the caller should emit a normal call, otherwise
4241 try to get the result in TARGET, if convenient (and in mode MODE if that's
4242 convenient). */
4244 static rtx
4246 {
4258 }
4260 /* Helper function to do the actual work for expand_builtin_memset. The
4261 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4262 so that this can also be called without constructing an actual CALL_EXPR.
4263 The other arguments and return value are the same as for
4264 expand_builtin_memset. */
4266 static rtx
4269 {
4272 machine_mode val_mode;
4284 /* If DEST is not a pointer type, don't do this operation in-line. */
4295 /* If the LEN parameter is zero, return DEST. */
4297 {
4298 /* Evaluate and ignore VAL in case it has side-effects. */
4301 }
4303 /* Stabilize the arguments in case we fail. */
4315 {
4316 rtx val_rtx;
4321 /* Assume that we can memset by pieces if we can store
4322 * the coefficients by pieces (in the required modes).
4323 * We can't pass builtin_memset_gen_str as that emits RTL. */
4329 {
4334 }
4338 probable_max_size))
4344 }
4350 {
4361 probable_max_size))
4367 }
4375 probable_max_size);
4378 {
4381 }
4385 do_libcall:
4394 else
4399 }
4401 /* Expand expression EXP, which is a call to the bzero builtin. Return
4402 NULL_RTX if we failed the caller should emit a normal call. */
4404 static rtx
4406 {
4415 /* New argument list transforming bzero(ptr x, int y) to
4416 memset(ptr x, int 0, size_t y). This is done this way
4417 so that if it isn't expanded inline, we fallback to
4418 calling bzero instead of memset. */
4426 }
4428 /* Try to expand cmpstr operation ICODE with the given operands.
4429 Return the result rtx on success, otherwise return null. */
4431 static rtx
4433 HOST_WIDE_INT align)
4434 {
4448 }
4450 /* Expand expression EXP, which is a call to the memcmp built-in function.
4451 Return NULL_RTX if we failed and the caller should emit a normal call,
4452 otherwise try to get the result in TARGET, if convenient.
4453 RESULT_EQ is true if we can relax the returned value to be either zero
4454 or nonzero, without caring about the sign. */
4456 static rtx
4458 {
4469 /* Diagnose calls where the specified length exceeds the size of either
4470 object. */
4476 {
4481 }
4483 /* Due to the performance benefit, always inline the calls first
4484 when result_eq is false. */
4488 {
4492 }
4500 /* If we don't have POINTER_TYPE, call the function. */
4508 /* Set MEM_SIZE as appropriate. */
4510 {
4513 }
4519 {
4523 }
4525 /* If SRC is a string constant and block move would be done
4526 by pieces, we can avoid loading the string from memory
4527 and only stored the computed constants. */
4539 {
4540 /* Return the value in the proper mode for this function. */
4545 {
4548 }
4551 }
4554 }
4556 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4557 if we failed the caller should emit a normal call, otherwise try to get
4558 the result in TARGET, if convenient. */
4560 static rtx
4562 {
4566 /* Due to the performance benefit, always inline the calls first. */
4583 /* If we don't have POINTER_TYPE, call the function. */
4587 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4594 /* Try to call cmpstrsi. */
4599 /* Try to determine at least one length and call cmpstrnsi. */
4601 {
4602 tree len;
4603 rtx arg3_rtx;
4613 /* If we don't have a constant length for the first, use the length
4614 of the second, if we know it. We don't require a constant for
4615 this case; some cost analysis could be done if both are available
4616 but neither is constant. For now, assume they're equally cheap,
4617 unless one has side effects. If both strings have constant lengths,
4618 use the smaller. */
4634 else
4637 /* If both arguments have side effects, we cannot optimize. */
4639 {
4641 result = expand_cmpstrn_or_cmpmem
4644 }
4645 }
4649 {
4650 /* Check to see if the argument was declared attribute nonstring
4651 and if so, issue a warning since at this point it's not known
4652 to be nul-terminated. */
4655 /* Return the value in the proper mode for this function. */
4663 }
4665 /* Expand the library call ourselves using a stabilized argument
4666 list to avoid re-evaluating the function's arguments twice. */
4671 }
4673 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4674 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4675 the result in TARGET, if convenient. */
4677 static rtx
4679 ATTRIBUTE_UNUSED machine_mode mode)
4680 {
4685 /* Due to the performance benefit, always inline the calls first. */
4691 /* If c_strlen can determine an expression for one of the string
4692 lengths, and it doesn't have side effects, then emit cmpstrnsi
4693 using length MIN(strlen(string)+1, arg3). */
4698 tree len;
4719 /* If we don't have a constant length for the first, use the length
4720 of the second, if we know it. If neither string is constant length,
4721 use the given length argument. We don't require a constant for
4722 this case; some cost analysis could be done if both are available
4723 but neither is constant. For now, assume they're equally cheap,
4724 unless one has side effects. If both strings have constant lengths,
4725 use the smaller. */
4743 else
4746 /* If we are not using the given length, we must incorporate it here.
4747 The actual new length parameter will be MIN(len,arg3) in this case. */
4759 {
4760 /* Check to see if the argument was declared attribute nonstring
4761 and if so, issue a warning since at this point it's not known
4762 to be nul-terminated. */
4765 /* Return the value in the proper mode for this function. */
4773 }
4775 /* Expand the library call ourselves using a stabilized argument
4776 list to avoid re-evaluating the function's arguments twice. */
4781 }
4783 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4784 if that's convenient. */
4786 rtx
4788 {
4789 rtx val;
4792 /* Don't do __builtin_saveregs more than once in a function.
4793 Save the result of the first call and reuse it. */
4797 /* When this function is called, it means that registers must be
4798 saved on entry to this function. So we migrate the call to the
4799 first insn of this function. */
4803 /* Do whatever the machine needs done in this case. */
4811 /* Put the insns after the NOTE that starts the function. If this
4812 is inside a start_sequence, make the outer-level insn chain current, so
4813 the code is placed at the start of the function. */
4819 }
4821 /* Expand a call to __builtin_next_arg. */
4823 static rtx
4825 {
4826 /* Checking arguments is already done in fold_builtin_next_arg
4827 that must be called before this function. */
4832 }
4834 /* Make it easier for the backends by protecting the valist argument
4835 from multiple evaluations. */
4837 static tree
4839 {
4842 /* The current way of determining the type of valist is completely
4843 bogus. We should have the information on the va builtin instead. */
4848 {
4852 /* For this case, the backends will be expecting a pointer to
4853 vatype, but it's possible we've actually been given an array
4854 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4855 So fix it. */
4857 {
4860 }
4861 }
4862 else
4863 {
4867 {
4873 }
4879 }
4882 }
4884 /* The "standard" definition of va_list is void*. */
4886 tree
4888 {
4890 }
4892 /* The "standard" abi va_list is va_list_type_node. */
4894 tree
4896 {
4898 }
4900 /* The "standard" type of va_list is va_list_type_node. */
4902 tree
4904 {
4911 {
4912 /* If va_list is an array type, the argument may have decayed
4913 to a pointer type, e.g. by being passed to another function.
4914 In that case, unwrap both types so that we can compare the
4915 underlying records. */
4918 {
4921 }
4922 }
4927 }
4929 /* The "standard" implementation of va_start: just assign `nextarg' to
4930 the variable. */
4932 void
4934 {
4937 }
4939 /* Expand EXP, a call to __builtin_va_start. */
4941 static rtx
4943 {
4944 rtx nextarg;
4945 tree valist;
4949 {
4952 }
4962 else
4966 }
4968 /* Expand EXP, a call to __builtin_va_end. */
4970 static rtx
4972 {
4975 /* Evaluate for side effects, if needed. I hate macros that don't
4976 do that. */
4981 }
4983 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4984 builtin rather than just as an assignment in stdarg.h because of the
4985 nastiness of array-type va_list types. */
4987 static rtx
4989 {
5002 {
5006 }
5007 else
5008 {
5011 /* Evaluate to pointers. */
5020 /* "Dereference" to BLKmode memories. */
5028 /* Copy. */
5030 }
5033 }
5035 /* Expand a call to one of the builtin functions __builtin_frame_address or
5036 __builtin_return_address. */
5038 static rtx
5040 {
5041 /* The argument must be a nonnegative integer constant.
5042 It counts the number of frames to scan up the stack.
5043 The value is either the frame pointer value or the return
5044 address saved in that frame. */
5046 /* Warning about missing arg was already issued. */
5049 {
5052 }
5053 else
5054 {
5055 /* Number of frames to scan up the stack. */
5060 /* Some ports cannot access arbitrary stack frames. */
5062 {
5065 }
5068 {
5069 /* Warn since no effort is made to ensure that any frame
5070 beyond the current one exists or can be safely reached. */
5073 }
5075 /* For __builtin_frame_address, return what we've got. */
5083 }
5084 }
5086 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5087 failed and the caller should emit a normal call. */
5089 static rtx
5091 {
5092 rtx op0;
5093 rtx result;
5096 HOST_WIDE_INT max_size;
5099 bool valid_arglist
5102 VOID_TYPE)
5113 || (!alloca_for_var
5116 ))
5117 {
5118 /* -Walloca-larger-than and -Wvla-larger-than settings of
5119 less than HOST_WIDE_INT_MAX override the more general
5120 -Walloc-size-larger-than so unless either of the former
5121 options is smaller than the last one (wchich would imply
5122 that the call was already checked), check the alloca
5123 arguments for overflow. */
5127 }
5129 /* Compute the argument. */
5132 /* Compute the alignment. */
5134 ? BIGGEST_ALIGNMENT
5137 /* Compute the maximum size. */
5142 /* Allocate the desired space. If the allocation stems from the declaration
5143 of a variable-sized object, it cannot accumulate. */
5144 result
5149 }
5151 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5152 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5153 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5154 handle_builtin_stack_restore function. */
5156 static rtx
5158 {
5165 OPTAB_LIB_WIDEN);
5168 OPTAB_LIB_WIDEN);
5173 }
5175 /* Expand a call to bswap builtin in EXP.
5176 Return NULL_RTX if a normal call should be emitted rather than expanding the
5177 function in-line. If convenient, the result should be placed in TARGET.
5178 SUBTARGET may be used as the target for computing one of EXP's operands. */
5180 static rtx
5182 rtx subtarget)
5183 {
5184 tree arg;
5185 rtx op0;
5203 }
5205 /* Expand a call to a unary builtin in EXP.
5206 Return NULL_RTX if a normal call should be emitted rather than expanding the
5207 function in-line. If convenient, the result should be placed in TARGET.
5208 SUBTARGET may be used as the target for computing one of EXP's operands. */
5210 static rtx
5213 {
5214 rtx op0;
5219 /* Compute the argument. */
5221 (subtarget
5225 /* Compute op, into TARGET if possible.
5226 Set TARGET to wherever the result comes back. */
5232 }
5234 /* Expand a call to __builtin_expect. We just return our argument
5235 as the builtin_expect semantic should've been already executed by
5236 tree branch prediction pass. */
5238 static rtx
5240 {
5241 tree arg;
5248 /* When guessing was done, the hints should be already stripped away. */
5252 }
5254 /* Expand a call to __builtin_assume_aligned. We just return our first
5255 argument as the builtin_assume_aligned semantic should've been already
5256 executed by CCP. */
5258 static rtx
5260 {
5264 EXPAND_NORMAL);
5269 }
5271 void
5273 {
5275 {
5277 /* For trap insns when not accumulating outgoing args force
5278 REG_ARGS_SIZE note to prevent crossjumping of calls with
5279 different args sizes. */
5282 }
5283 else
5284 {
5288 }
5291 }
5293 /* Expand a call to __builtin_unreachable. We do nothing except emit
5294 a barrier saying that control flow will not pass here.
5296 It is the responsibility of the program being compiled to ensure
5297 that control flow does never reach __builtin_unreachable. */
5298 static void
5300 {
5302 }
5304 /* Expand EXP, a call to fabs, fabsf or fabsl.
5305 Return NULL_RTX if a normal call should be emitted rather than expanding
5306 the function inline. If convenient, the result should be placed
5307 in TARGET. SUBTARGET may be used as the target for computing
5308 the operand. */
5310 static rtx
5312 {
5313 machine_mode mode;
5314 tree arg;
5315 rtx op0;
5325 }
5327 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5328 Return NULL is a normal call should be emitted rather than expanding the
5329 function inline. If convenient, the result should be placed in TARGET.
5330 SUBTARGET may be used as the target for computing the operand. */
5332 static rtx
5334 {
5336 tree arg;
5348 }
5350 /* Expand a call to __builtin___clear_cache. */
5352 static rtx
5354 {
5356 {
5357 #ifdef CLEAR_INSN_CACHE
5358 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5359 does something. Just do the default expansion to a call to
5360 __clear_cache(). */
5362 #else
5363 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5364 does nothing. There is no need to call it. Do nothing. */
5367 }
5369 /* We have a "clear_cache" insn, and it will handle everything. */
5373 /* We must not expand to a library call. If we did, any
5374 fallback library function in libgcc that might contain a call to
5375 __builtin___clear_cache() would recurse infinitely. */
5377 {
5380 }
5383 {
5396 }
5398 }
5400 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5402 static rtx
5404 {
5407 /* If we don't need too much alignment, we'll have been guaranteed
5408 proper alignment by get_trampoline_type. */
5412 /* Round address up to desired boundary. */
5423 }
5425 static rtx
5427 {
5443 /* If ONSTACK, the TRAMP argument should be the address of a field
5444 within the local function's FRAME decl. Either way, let's see if
5445 we can fill in the MEM_ATTRs for this memory. */
5449 /* Creator of a heap trampoline is responsible for making sure the
5450 address is aligned to at least STACK_BOUNDARY. Normally malloc
5451 will ensure this anyhow. */
5454 {
5458 }
5460 /* The FUNC argument should be the address of the nested function.
5461 Extract the actual function decl to pass to the hook. */
5468 /* Generate insns to initialize the trampoline. */
5472 {
5478 }
5481 }
5483 static rtx
5485 {
5486 rtx tramp;
5497 }
5499 /* Expand a call to the builtin descriptor initialization routine.
5500 A descriptor is made up of a couple of pointers to the static
5501 chain and the code entry in this order. */
5503 static rtx
5505 {
5510 VOID_TYPE))
5524 /* Generate insns to initialize the descriptor. */
5530 }
5532 /* Expand a call to the builtin descriptor adjustment routine. */
5534 static rtx
5536 {
5537 rtx tramp;
5544 /* Unalign the descriptor to allow runtime identification. */
5549 }
5551 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5552 function. The function first checks whether the back end provides
5553 an insn to implement signbit for the respective mode. If not, it
5554 checks whether the floating point format of the value is such that
5555 the sign bit can be extracted. If that is not the case, error out.
5556 EXP is the expression that is a call to the builtin function; if
5557 convenient, the result should be placed in TARGET. */
5558 static rtx
5560 {
5562 scalar_float_mode fmode;
5564 tree arg;
5567 rtx temp;
5580 /* Expand the argument yielding a RTX expression. */
5583 /* Check if the back end provides an insn that handles signbit for the
5584 argument's mode. */
5587 {
5593 }
5595 /* For floating point formats without a sign bit, implement signbit
5596 as "ARG < 0.0". */
5599 {
5600 /* But we can't do this if the format supports signed zero. */
5606 }
5609 {
5612 }
5613 else
5614 {
5616 /* Handle targets with different FP word orders. */
5619 else
5623 }
5625 /* Force the intermediate word_mode (or narrower) result into a
5626 register. This avoids attempting to create paradoxical SUBREGs
5627 of floating point modes below. */
5630 /* If the bitpos is within the "result mode" lowpart, the operation
5631 can be implement with a single bitwise AND. Otherwise, we need
5632 a right shift and an AND. */
5635 {
5643 }
5644 else
5645 {
5646 /* Perform a logical right shift to place the signbit in the least
5647 significant bit, then truncate the result to the desired mode
5648 and mask just this bit. */
5653 }
5656 }
5658 /* Expand fork or exec calls. TARGET is the desired target of the
5659 call. EXP is the call. FN is the
5660 identificator of the actual function. IGNORE is nonzero if the
5661 value is to be ignored. */
5663 static rtx
5665 {
5667 tree call;
5669 /* If we are not profiling, just call the function. */
5673 /* Otherwise call the wrapper. This should be equivalent for the rest of
5674 compiler, so the code does not diverge, and the wrapper may run the
5675 code necessary for keeping the profiling sane. */
5678 {
5709 }
5721 }
5724 \f
5725 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5726 the pointer in these functions is void*, the tree optimizers may remove
5727 casts. The mode computed in expand_builtin isn't reliable either, due
5728 to __sync_bool_compare_and_swap.
5730 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5731 group of builtins. This gives us log2 of the mode size. */
5735 {
5736 /* The size is not negotiable, so ask not to get BLKmode in return
5737 if the target indicates that a smaller size would be better. */
5739 }
5741 /* Expand the memory expression LOC and return the appropriate memory operand
5742 for the builtin_sync operations. */
5744 static rtx
5746 {
5752 /* Note that we explicitly do not want any alias information for this
5753 memory, so that we kill all other live memories. Otherwise we don't
5754 satisfy the full barrier semantics of the intrinsic. */
5757 /* The alignment needs to be at least according to that of the mode. */
5764 }
5766 /* Make sure an argument is in the right mode.
5767 EXP is the tree argument.
5768 MODE is the mode it should be in. */
5770 static rtx
5772 {
5773 rtx val;
5774 machine_mode old_mode;
5777 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5778 of CONST_INTs, where we know the old_mode only from the call argument. */
5785 }
5788 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5789 EXP is the CALL_EXPR. CODE is the rtx code
5790 that corresponds to the arithmetic or logical operation from the name;
5791 an exception here is that NOT actually means NAND. TARGET is an optional
5792 place for us to store the results; AFTER is true if this is the
5793 fetch_and_xxx form. */
5795 static rtx
5798 rtx target)
5799 {
5804 {
5811 {
5840 }
5841 }
5843 /* Expand the operands. */
5848 after);
5849 }
5851 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5852 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5853 true if this is the boolean form. TARGET is a place for us to store the
5854 results; this is NOT optional if IS_BOOL is true. */
5856 static rtx
5859 {
5863 /* Expand the operands. */
5870 {
5873 else
5875 }
5878 MEMMODEL_SYNC_SEQ_CST))
5882 }
5884 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5885 general form is actually an atomic exchange, and some targets only
5886 support a reduced form with the second argument being a constant 1.
5887 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5888 the results. */
5890 static rtx
5892 rtx target)
5893 {
5896 /* Expand the operands. */
5901 }
5903 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5905 static void
5907 {
5908 rtx mem;
5910 /* Expand the operands. */
5914 }
5916 /* Given an integer representing an ``enum memmodel'', verify its
5917 correctness and return the memory model enum. */
5919 static enum memmodel
5921 {
5922 rtx op;
5924 source_location loc
5927 /* If the parameter is not a constant, it's a run time value so we'll just
5928 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5938 {
5942 }
5944 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5946 {
5950 }
5952 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5953 be conservative and promote consume to acquire. */
5958 }
5960 /* Expand the __atomic_exchange intrinsic:
5961 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5962 EXP is the CALL_EXPR.
5963 TARGET is an optional place for us to store the results. */
5965 static rtx
5967 {
5976 /* Expand the operands. */
5981 }
5983 /* Expand the __atomic_compare_exchange intrinsic:
5984 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5985 TYPE desired, BOOL weak,
5986 enum memmodel success,
5987 enum memmodel failure)
5988 EXP is the CALL_EXPR.
5989 TARGET is an optional place for us to store the results. */
5991 static rtx
5993 rtx target)
5994 {
5998 tree weak;
6000 source_location loc
6007 {
6009 "failure memory model cannot be stronger than success "
6012 }
6015 {
6017 "invalid failure memory model for "
6021 }
6027 /* Expand the operands. */
6043 /* Lest the rtl backend create a race condition with an imporoper store
6044 to memory, always create a new pseudo for OLDVAL. */
6051 /* Conditionally store back to EXPECT, lest we create a race condition
6052 with an improper store to memory. */
6053 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6054 the normal case where EXPECT is totally private, i.e. a register. At
6055 which point the store can be unconditional. */
6063 }
6065 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6066 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6067 call. The weak parameter must be dropped to match the expected parameter
6068 list and the expected argument changed from value to pointer to memory
6069 slot. */
6071 static void
6073 {
6089 /* Skip the boolean weak parameter. */
6092 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6095 built_in_function fncode
6100 fndecl);
6105 {
6112 }
6113 }
6115 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6117 void
6119 {
6125 tree lhs;
6127 source_location loc
6134 {
6136 "failure memory model cannot be stronger than success "
6139 }
6142 {
6144 "invalid failure memory model for "
6148 }
6151 {
6154 }
6156 /* Expand the operands. */
6169 {
6172 }
6176 {
6182 }
6183 }
6185 /* Expand the __atomic_load intrinsic:
6186 TYPE __atomic_load (TYPE *object, enum memmodel)
6187 EXP is the CALL_EXPR.
6188 TARGET is an optional place for us to store the results. */
6190 static rtx
6192 {
6193 rtx mem;
6198 {
6199 source_location loc
6204 }
6209 /* Expand the operand. */
6213 }
6216 /* Expand the __atomic_store intrinsic:
6217 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6218 EXP is the CALL_EXPR.
6219 TARGET is an optional place for us to store the results. */
6221 static rtx
6223 {
6230 {
6231 source_location loc
6236 }
6241 /* Expand the operands. */
6246 }
6248 /* Expand the __atomic_fetch_XXX intrinsic:
6249 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6250 EXP is the CALL_EXPR.
6251 TARGET is an optional place for us to store the results.
6252 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6253 FETCH_AFTER is true if returning the result of the operation.
6254 FETCH_AFTER is false if returning the value before the operation.
6255 IGNORE is true if the result is not used.
6256 EXT_CALL is the correct builtin for an external call if this cannot be
6257 resolved to an instruction sequence. */
6259 static rtx
6263 {
6266 tree fndecl;
6267 tree addr;
6271 /* Expand the operands. */
6275 /* Only try generating instructions if inlining is turned on. */
6277 {
6281 }
6283 /* Return if a different routine isn't needed for the library call. */
6287 /* Change the call to the specified function. */
6295 /* If we will emit code after the call, the call can not be a tail call.
6296 If it is emitted as a tail call, a barrier is emitted after it, and
6297 then all trailing code is removed. */
6301 /* Expand the call here so we can emit trailing code. */
6304 /* Replace the original function just in case it matters. */
6307 /* Then issue the arithmetic correction to return the right result. */
6309 {
6311 {
6313 OPTAB_LIB_WIDEN);
6315 }
6316 else
6318 OPTAB_LIB_WIDEN);
6319 }
6321 }
6323 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6325 void
6327 {
6335 optab optab;
6347 {
6362 }
6365 {
6372 }
6394 {
6399 }
6400 else
6402 OPTAB_DIRECT);
6405 }
6407 /* Expand an atomic clear operation.
6408 void _atomic_clear (BOOL *obj, enum memmodel)
6409 EXP is the call expression. */
6411 static rtx
6413 {
6414 machine_mode mode;
6423 {
6424 source_location loc
6429 }
6431 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6432 Failing that, a store is issued by __atomic_store. The only way this can
6433 fail is if the bool type is larger than a word size. Unlikely, but
6434 handle it anyway for completeness. Assume a single threaded model since
6435 there is no atomic support in this case, and no barriers are required. */
6440 }
6442 /* Expand an atomic test_and_set operation.
6443 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6444 EXP is the call expression. */
6446 static rtx
6448 {
6449 rtx mem;
6451 machine_mode mode;
6458 }
6461 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6462 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6464 static tree
6466 {
6468 machine_mode mode;
6474 /* We need a corresponding integer mode for the access to be lock-free. */
6482 {
6485 /* Either this argument is null, or it's a fake pointer encoding
6486 the alignment of the object. */
6492 else
6494 }
6495 else
6496 {
6499 /* This function is usually invoked and folded immediately by the front
6500 end before anything else has a chance to look at it. The pointer
6501 parameter at this point is usually cast to a void *, so check for that
6502 and look past the cast. */
6512 /* Get the underlying type of the object. */
6515 }
6517 /* If the object has smaller alignment, the lock free routines cannot
6518 be used. */
6522 /* Check if a compare_and_swap pattern exists for the mode which represents
6523 the required size. The pattern is not allowed to fail, so the existence
6524 of the pattern indicates support is present. Also require that an
6525 atomic load exists for the required size. */
6528 else
6530 }
6532 /* Return true if the parameters to call EXP represent an object which will
6533 always generate lock free instructions. The first argument represents the
6534 size of the object, and the second parameter is a pointer to the object
6535 itself. If NULL is passed for the object, then the result is based on
6536 typical alignment for an object of the specified size. Otherwise return
6537 false. */
6539 static rtx
6541 {
6542 tree size;
6547 {
6550 }
6556 }
6558 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6559 is lock free on this architecture. */
6561 static tree
6563 {
6567 /* If it isn't always lock free, don't generate a result. */
6572 }
6574 /* Return true if the parameters to call EXP represent an object which will
6575 always generate lock free instructions. The first argument represents the
6576 size of the object, and the second parameter is a pointer to the object
6577 itself. If NULL is passed for the object, then the result is based on
6578 typical alignment for an object of the specified size. Otherwise return
6579 NULL*/
6581 static rtx
6583 {
6584 tree size;
6589 {
6592 }
6597 /* If the value is known at compile time, return the RTX for it. */
6603 }
6605 /* Expand the __atomic_thread_fence intrinsic:
6606 void __atomic_thread_fence (enum memmodel)
6607 EXP is the CALL_EXPR. */
6609 static void
6611 {
6614 }
6616 /* Expand the __atomic_signal_fence intrinsic:
6617 void __atomic_signal_fence (enum memmodel)
6618 EXP is the CALL_EXPR. */
6620 static void
6622 {
6625 }
6627 /* Expand the __sync_synchronize intrinsic. */
6629 static void
6631 {
6633 }
6635 static rtx
6637 {
6643 {
6645 /* If the target is not sutitable then create a new target. */
6653 }
6656 }
6658 static void
6660 {
6666 {
6673 }
6675 }
6677 \f
6678 /* Emit code to restore the current value of stack. */
6680 static void
6682 {
6694 }
6696 /* Emit code to save the current value of stack. */
6698 static rtx
6700 {
6705 }
6707 /* Emit code to get the openacc gang, worker or vector id or size. */
6709 static rtx
6711 {
6713 rtx fallback_retval;
6716 {
6729 }
6732 {
6735 }
6739 {
6742 }
6746 {
6754 }
6763 {
6766 }
6774 }
6776 /* Expand a string compare operation using a sequence of char comparison
6777 to get rid of the calling overhead, with result going to TARGET if
6778 that's convenient.
6780 VAR_STR is the variable string source;
6781 CONST_STR is the constant string source;
6782 LENGTH is the number of chars to compare;
6783 CONST_STR_N indicates which source string is the constant string;
6784 IS_MEMCMP indicates whether it's a memcmp or strcmp.
6786 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
6788 target = (int) (unsigned char) var_str[0]
6789 - (int) (unsigned char) const_str[0];
6790 if (target != 0)
6791 goto ne_label;
6792 ...
6793 target = (int) (unsigned char) var_str[length - 2]
6794 - (int) (unsigned char) const_str[length - 2];
6795 if (target != 0)
6796 goto ne_label;
6797 target = (int) (unsigned char) var_str[length - 1]
6798 - (int) (unsigned char) const_str[length - 1];
6799 ne_label:
6800 */
6802 static rtx
6806 {
6808 rtx var_rtx_array
6815 scalar_int_mode unit_mode
6821 {
6822 var_rtx
6836 }
6844 }
6846 /* Inline expansion a call to str(n)cmp, with result going to
6847 TARGET if that's convenient.
6848 If the call is not been inlined, return NULL_RTX. */
6849 static rtx
6851 {
6857 /* Do NOT apply this inlining expansion when optimizing for size or
6858 optimization level below 2. */
6866 /* On a target where the type of the call (int) has same or narrower presicion
6867 than unsigned char, give up the inlining expansion. */
6883 /* If neither strings is constant string, the call is not qualify. */
6887 /* For strncmp, if the length is not a const, not qualify. */
6898 else
6907 /* If the length of the comparision is larger than the threshold,
6908 do nothing. */
6915 /* Now, start inline expansion the call. */
6919 }
6921 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
6922 represents the size of the first argument to that call, or VOIDmode
6923 if the argument is a pointer. IGNORE will be true if the result
6924 isn't used. */
6925 static rtx
6928 {
6935 {
6938 }
6942 /* An optional second argument can be used as a failsafe value on
6943 some machines. If it isn't present, then the failsafe value is
6944 assumed to be 0. */
6946 {
6949 }
6950 else
6953 /* If the result isn't used, the behavior is undefined. It would be
6954 nice to emit a warning here, but path splitting means this might
6955 happen with legitimate code. So simply drop the builtin
6956 expansion in that case; we've handled any side-effects above. */
6960 /* If we don't have a suitable target, create one to hold the result. */
6968 }
6970 /* Expand an expression EXP that calls a built-in function,
6971 with result going to TARGET if that's convenient
6972 (and in mode MODE if that's convenient).
6973 SUBTARGET may be used as the target for computing one of EXP's operands.
6974 IGNORE is nonzero if the value is to be ignored. */
6976 rtx
6979 {
6988 /* When ASan is enabled, we don't want to expand some memory/string
6989 builtins and rely on libsanitizer's hooks. This allows us to avoid
6990 redundant checks and be sure, that possible overflow will be detected
6991 by ASan. */
6996 /* When not optimizing, generate calls to library functions for a certain
6997 set of builtins. */
7011 /* The built-in function expanders test for target == const0_rtx
7012 to determine whether the function's result will be ignored. */
7016 /* If the result of a pure or const built-in function is ignored, and
7017 none of its arguments are volatile, we can avoid expanding the
7018 built-in call and just evaluate the arguments for side-effects. */
7022 {
7024 tree arg;
7025 call_expr_arg_iterator iter;
7029 {
7032 }
7035 {
7039 }
7040 }
7043 {
7061 /* Just do a normal library call if we were unable to fold
7062 the values. */
7139 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7140 FUNCTION with a copy of the parameters described by
7141 ARGUMENTS, and ARGSIZE. It returns a block of memory
7142 allocated on the stack into which is stored all the registers
7143 that might possibly be used for returning the result of a
7144 function. ARGUMENTS is the value returned by
7145 __builtin_apply_args. ARGSIZE is the number of bytes of
7146 arguments that must be copied. ??? How should this value be
7147 computed? We'll also need a safe worst case value for varargs
7148 functions. */
7155 else
7156 {
7164 }
7166 /* __builtin_return (RESULT) causes the function to return the
7167 value described by RESULT. RESULT is address of the block of
7168 memory returned by __builtin_apply. */
7178 /* All valid uses of __builtin_va_arg_pack () are removed during
7179 inlining. */
7184 /* All valid uses of __builtin_va_arg_pack_len () are removed during
7185 inlining. */
7189 /* Return the address of the first anonymous stack arg. */
7211 /* Returns the address of the area where the structure is returned.
7212 0 otherwise. */
7218 else
7221 CASE_BUILT_IN_ALLOCA:
7371 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7372 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7373 when changing it to a strcmp call. */
7379 /* Change this call back to a BUILT_IN_STRCMP. */
7383 /* Delete the last parameter. */
7390 /* FALLTHROUGH */
7398 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7399 back to a BUILT_IN_STRNCMP. */
7405 /* Change it back to a BUILT_IN_STRNCMP. */
7408 /* FALLTHROUGH */
7423 {
7426 }
7430 /* This should have been lowered to the builtins below. */
7434 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7435 and the receiver label. */
7437 {
7443 /* This is copied from the handling of non-local gotos. */
7445 nonlocal_goto_handler_labels
7447 nonlocal_goto_handler_labels);
7448 /* ??? Do not let expand_label treat us as such since we would
7449 not want to be both on the list of non-local labels and on
7450 the list of forced labels. */
7453 }
7457 /* __builtin_setjmp_receiver is passed the receiver label. */
7459 {
7465 }
7468 /* __builtin_longjmp is passed a pointer to an array of five words.
7469 It's similar to the C library longjmp function but works with
7470 __builtin_setjmp above. */
7473 {
7479 {
7482 }
7486 }
7495 /* This updates the setjmp buffer that is its argument with the value
7496 of the current stack pointer. */
7499 {
7500 rtx buf_addr
7505 }
7525 /* Various hooks for the DWARF 2 __throw routine. */
7531 #ifdef DWARF2_UNWIND_INFO
7537 #endif
7737 mode = get_builtin_sync_mode
7749 mode = get_builtin_sync_mode
7796 {
7800 mode =
7806 /* If this is turned into an external library call, the weak parameter
7807 must be dropped to match the expected parameter list. */
7812 /* Skip the boolean weak parameter. */
7817 }
7846 {
7856 }
7862 {
7872 }
7878 {
7888 }
7894 {
7904 }
7910 {
7920 }
7926 {
7936 }
8073 /* Do library call, if we failed to expand the builtin when
8074 folding. */
8094 }
8096 /* The switch statement above can drop through to cause the function
8097 to be called normally. */
8099 }
8101 /* Determine whether a tree node represents a call to a built-in
8102 function. If the tree T is a call to a built-in function with
8103 the right number of arguments of the appropriate types, return
8104 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8105 Otherwise the return value is END_BUILTINS. */
8107 enum built_in_function
8109 {
8112 const_call_expr_arg_iterator iter;
8127 {
8128 /* If a function doesn't take a variable number of arguments,
8129 the last element in the list will have type `void'. */
8132 {
8136 }
8145 {
8148 }
8150 {
8153 }
8155 {
8158 }
8160 {
8163 }
8164 else
8166 }
8168 /* Variable-length argument list. */
8170 }
8172 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
8173 evaluate to a constant. */
8175 static tree
8177 {
8178 /* We return 1 for a numeric type that's known to be a constant
8179 value at compile-time or for an aggregate type that's a
8180 literal constant. */
8183 /* If we know this is a constant, emit the constant of one. */
8189 {
8196 }
8198 /* If this expression has side effects, show we don't know it to be a
8199 constant. Likewise if it's a pointer or aggregate type since in
8200 those case we only want literals, since those are only optimized
8201 when generating RTL, not later.
8202 And finally, if we are compiling an initializer, not code, we
8203 need to return a definite result now; there's not going to be any
8204 more optimization done. */
8209 || folding_initializer
8214 }
8216 /* Create builtin_expect with PRED and EXPECTED as its arguments and
8217 return it as a truthvalue. */
8219 static tree
8221 tree predictor)
8222 {
8234 predictor);
8238 }
8240 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
8241 NULL_TREE if no simplification is possible. */
8243 tree
8245 {
8249 /* Distribute the expected value over short-circuiting operators.
8250 See through the cast from truthvalue_type_node to long. */
8257 /* If this is a builtin_expect within a builtin_expect keep the
8258 inner one. See through a comparison against a constant. It
8259 might have been added to create a thruthvalue. */
8275 {
8285 }
8287 /* If the argument isn't invariant then there's nothing else we can do. */
8291 /* If we expect that a comparison against the argument will fold to
8292 a constant return the constant. In practice, this means a true
8293 constant or the address of a non-weak symbol. */
8297 {
8298 do
8299 {
8301 }
8306 }
8308 /* Otherwise, ARG0 already has the proper type for the return value. */
8310 }
8312 /* Fold a call to __builtin_classify_type with argument ARG. */
8314 static tree
8316 {
8321 }
8323 /* Fold a call to __builtin_strlen with argument ARG. */
8325 static tree
8327 {
8330 else
8331 {
8338 }
8339 }
8341 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8343 static tree
8345 {
8346 REAL_VALUE_TYPE real;
8348 /* __builtin_inff is intended to be usable to define INFINITY on all
8349 targets. If an infinity is not available, INFINITY expands "to a
8350 positive constant of type float that overflows at translation
8351 time", footnote "In this case, using INFINITY will violate the
8352 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8353 Thus we pedwarn to ensure this constraint violation is
8354 diagnosed. */
8360 }
8362 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8363 NULL_TREE if no simplification can be made. */
8365 static tree
8368 {
8369 tree type;
8379 /* Calculate the result when the argument is a constant. */
8384 /* Canonicalize sincos to cexpi. */
8386 {
8389 }
8391 {
8398 }
8410 }
8412 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8413 Return NULL_TREE if no simplification can be made. */
8415 static tree
8417 {
8423 /* If the LEN parameter is zero, return zero. */
8428 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8432 /* If len parameter is one, return an expression corresponding to
8433 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8435 {
8437 tree cst_uchar_ptr_node
8440 tree ind1
8444 cst_uchar_ptr_node,
8445 arg1)));
8446 tree ind2
8450 cst_uchar_ptr_node,
8451 arg2)));
8453 }
8456 }
8458 /* Fold a call to builtin isascii with argument ARG. */
8460 static tree
8462 {
8465 else
8466 {
8467 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8473 }
8474 }
8476 /* Fold a call to builtin toascii with argument ARG. */
8478 static tree
8480 {
8484 /* Transform toascii(c) -> (c & 0x7f). */
8487 }
8489 /* Fold a call to builtin isdigit with argument ARG. */
8491 static tree
8493 {
8496 else
8497 {
8498 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8499 /* According to the C standard, isdigit is unaffected by locale.
8500 However, it definitely is affected by the target character set. */
8501 unsigned HOST_WIDE_INT target_digit0
8512 }
8513 }
8515 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8517 static tree
8519 {
8525 }
8527 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8529 static tree
8531 {
8537 }
8539 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8541 static tree
8543 {
8546 {
8550 {
8555 }
8556 }
8559 }
8561 /* Fold a call to builtin frexp, we can assume the base is 2. */
8563 static tree
8565 {
8576 /* Proceed if a valid pointer type was passed in. */
8578 {
8583 {
8585 /* For +-0, return (*exp = 0, +-0). */
8591 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8594 {
8595 /* Since the frexp function always expects base 2, and in
8596 GCC normalized significands are already in the range
8597 [0.5, 1.0), we have exactly what frexp wants. */
8602 }
8606 }
8608 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8612 }
8615 }
8617 /* Fold a call to builtin modf. */
8619 static tree
8621 {
8632 /* Proceed if a valid pointer type was passed in. */
8634 {
8639 {
8642 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8646 /* For +-Inf, return (*arg1 = arg0, +-0). */
8652 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8655 /* If the original number was negative and already
8656 integral, then the fractional part is -0.0. */
8660 }
8662 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8668 }
8671 }
8673 /* Given a location LOC, an interclass builtin function decl FNDECL
8674 and its single argument ARG, return an folded expression computing
8675 the same, or NULL_TREE if we either couldn't or didn't want to fold
8676 (the latter happen if there's an RTL instruction available). */
8678 static tree
8680 {
8681 machine_mode mode;
8693 /* If there is no optab, try generic code. */
8695 {
8696 tree result;
8699 {
8700 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8703 REAL_VALUE_TYPE r;
8707 {
8708 /* NaN and Inf are encoded in the high-order double value
8709 only. The low-order value is not significant. */
8713 }
8720 }
8723 {
8724 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8727 REAL_VALUE_TYPE r;
8731 {
8732 /* NaN and Inf are encoded in the high-order double value
8733 only. The low-order value is not significant. */
8737 }
8743 /*result = fold_build2_loc (loc, UNGT_EXPR,
8744 TREE_TYPE (TREE_TYPE (fndecl)),
8745 fold_build1_loc (loc, ABS_EXPR, type, arg),
8746 build_real (type, r));
8747 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8748 TREE_TYPE (TREE_TYPE (fndecl)),
8749 result);*/
8751 }
8753 {
8754 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8755 islessequal(fabs(x),DBL_MAX). */
8765 {
8766 /* Use double to test the normal range of IBM extended
8767 precision. Emin for IBM extended precision is
8768 different to emin for IEEE double, being 53 higher
8769 since the low double exponent is at least 53 lower
8770 than the high double exponent. */
8774 }
8786 {
8787 /* Testing the high end of the range is done just using
8788 the high double, using the same test as isfinite().
8789 For the subnormal end of the range we first test the
8790 high double, then if its magnitude is equal to the
8791 limit of 0x1p-969, we test whether the low double is
8792 non-zero and opposite sign to the high double. */
8808 integer_type_node,
8814 }
8815 else
8816 {
8817 tree const isge_fn
8820 }
8824 }
8827 }
8830 }
8832 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8833 ARG is the argument for the call. */
8835 static tree
8837 {
8844 {
8852 {
8853 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8854 /* In a boolean context, GCC will fold the inner COND_EXPR to
8855 1. So e.g. "if (isinf_sign(x))" would be folded to just
8856 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8864 {
8877 integer_zero_node);
8878 }
8881 }
8894 {
8897 {
8898 /* NaN and Inf are encoded in the high-order double value
8899 only. The low-order value is not significant. */
8901 }
8902 }
8908 }
8909 }
8911 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8912 This builtin will generate code to return the appropriate floating
8913 point classification depending on the value of the floating point
8914 number passed in. The possible return values must be supplied as
8915 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8916 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8917 one floating point argument which is "type generic". */
8919 static tree
8921 {
8924 machine_mode mode;
8925 REAL_VALUE_TYPE r;
8928 /* Verify the required arguments in the original call. */
8948 /* fpclassify(x) ->
8949 isnan(x) ? FP_NAN :
8950 (fabs(x) == Inf ? FP_INFINITE :
8951 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8952 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8966 {
8972 }
8975 {
8978 }
8981 }
8983 /* Fold a call to an unordered comparison function such as
8984 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8985 being called and ARG0 and ARG1 are the arguments for the call.
8986 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8987 the opposite of the desired result. UNORDERED_CODE is used
8988 for modes that can hold NaNs and ORDERED_CODE is used for
8989 the rest. */
8991 static tree
8995 {
9009 /* Choose the wider of two real types. */
9021 {
9025 }
9030 }
9032 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9033 arithmetics if it can never overflow, or into internal functions that
9034 return both result of arithmetics and overflowed boolean flag in
9035 a complex integer result, or some other check for overflow.
9036 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9037 checking part of that. */
9039 static tree
9042 {
9044 /* The code of the expression corresponding to the type-generic
9045 built-in, or ERROR_MARK for the type-specific ones. */
9050 {
9053 /* FALLTHRU */
9056 /* FALLTHRU */
9067 /* FALLTHRU */
9070 /* FALLTHRU */
9081 /* FALLTHRU */
9084 /* FALLTHRU */
9095 }
9097 /* For the "generic" overloads, the first two arguments can have different
9098 types and the last argument determines the target type to use to check
9099 for overflow. The arguments of the other overloads all have the same
9100 type. */
9103 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
9104 arguments are constant, attempt to fold the built-in call into a constant
9105 expression indicating whether or not it detected an overflow. */
9109 /* Perform the computation in the target type and check for overflow. */
9113 arg2);
9127 tree store
9130 }
9132 /* Fold a call to __builtin_FILE to a constant string. */
9136 {
9138 {
9139 /* The documentation says this builtin is equivalent to the preprocessor
9140 __FILE__ macro so it appears appropriate to use the same file prefix
9141 mappings. */
9144 }
9147 }
9149 /* Fold a call to __builtin_FUNCTION to a constant string. */
9153 {
9160 }
9162 /* Fold a call to __builtin_LINE to an integer constant. */
9166 {
9168 }
9170 /* Fold a call to built-in function FNDECL with 0 arguments.
9171 This function returns NULL_TREE if no simplification was possible. */
9173 static tree
9175 {
9179 {
9205 }
9207 }
9209 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9210 This function returns NULL_TREE if no simplification was possible. */
9212 static tree
9214 {
9225 {
9227 {
9230 /* Gimplification will pull the CALL_EXPR for the builtin out of
9231 an if condition. When not optimizing, we'll not CSE it back.
9232 To avoid link error types of regressions, return false now. */
9237 }
9293 {
9298 }
9304 {
9309 }
9330 }
9334 }
9336 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9337 This function returns NULL_TREE if no simplification was possible. */
9339 static tree
9341 {
9353 {
9397 NOP_EXPR);
9399 /* We do the folding for va_start in the expander. */
9414 }
9416 }
9418 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9419 and ARG2.
9420 This function returns NULL_TREE if no simplification was possible. */
9422 static tree
9425 {
9439 {
9485 }
9487 }
9489 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9490 arguments. IGNORE is true if the result of the
9491 function call is ignored. This function returns NULL_TREE if no
9492 simplification was possible. */
9494 tree
9496 {
9500 {
9516 }
9518 {
9522 }
9524 }
9526 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9527 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9528 of arguments in ARGS to be omitted. OLDNARGS is the number of
9529 elements in ARGS. */
9531 static tree
9534 {
9539 {
9547 }
9548 else
9552 }
9554 /* Return true if FNDECL shouldn't be folded right now.
9555 If a built-in function has an inline attribute always_inline
9556 wrapper, defer folding it after always_inline functions have
9557 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9558 might not be performed. */
9560 bool
9562 {
9565 && cfun
9568 }
9570 /* A wrapper function for builtin folding that prevents warnings for
9571 "statement without effect" and the like, caused by removing the
9572 call node earlier than the warning is generated. */
9574 tree
9576 {
9582 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9583 yet. Defer folding until we see all the arguments
9584 (after inlining). */
9586 {
9589 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9590 instead last argument is __builtin_va_arg_pack (). Defer folding
9591 even in that case, until arguments are finalized. */
9593 {
9600 }
9608 else
9609 {
9614 }
9615 }
9617 }
9619 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9620 N arguments are passed in the array ARGARRAY. Return a folded
9621 expression or NULL_TREE if no simplification was possible. */
9623 tree
9625 tree fn,
9628 {
9635 {
9636 /* If last argument is __builtin_va_arg_pack (), arguments to this
9637 function are not finalized yet. Defer folding until they are. */
9639 {
9646 }
9651 else
9653 }
9656 }
9658 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9659 along with N new arguments specified as the "..." parameters. SKIP
9660 is the number of arguments in EXP to be omitted. This function is used
9661 to do varargs-to-varargs transformations. */
9663 static tree
9665 {
9667 tree t;
9675 }
9677 /* Validate a single argument ARG against a tree code CODE representing
9678 a type. Return true when argument is valid. */
9680 static bool
9682 {
9690 }
9692 /* This function validates the types of a function call argument list
9693 against a specified list of tree_codes. If the last specifier is a 0,
9694 that represents an ellipses, otherwise the last specifier must be a
9695 VOID_TYPE.
9697 This is the GIMPLE version of validate_arglist. Eventually we want to
9698 completely convert builtins.c to work from GIMPLEs and the tree based
9699 validate_arglist will then be removed. */
9701 bool
9703 {
9707 const_tree arg;
9713 do
9714 {
9717 {
9719 /* This signifies an ellipses, any further arguments are all ok. */
9723 /* This signifies an endlink, if no arguments remain, return
9724 true, otherwise return false. */
9728 /* If no parameters remain or the parameter's code does not
9729 match the specified code, return false. Otherwise continue
9730 checking any remaining arguments. */
9735 }
9736 }
9739 /* We need gotos here since we can only have one VA_CLOSE in a
9740 function. */
9741 end: ;
9745 }
9747 /* Default target-specific builtin expander that does nothing. */
9749 rtx
9751 rtx target ATTRIBUTE_UNUSED,
9752 rtx subtarget ATTRIBUTE_UNUSED,
9753 machine_mode mode ATTRIBUTE_UNUSED,
9755 {
9757 }
9759 /* Returns true is EXP represents data that would potentially reside
9760 in a readonly section. */
9762 bool
9764 {
9774 /* Make sure we call decl_readonly_section only for trees it
9775 can handle (since it returns true for everything it doesn't
9776 understand). */
9781 else
9783 }
9785 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9786 to the call, and TYPE is its return type.
9788 Return NULL_TREE if no simplification was possible, otherwise return the
9789 simplified form of the call as a tree.
9791 The simplified form may be a constant or other expression which
9792 computes the same value, but in a more efficient manner (including
9793 calls to other builtin functions).
9795 The call may contain arguments which need to be evaluated, but
9796 which are not useful to determine the result of the call. In
9797 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9798 COMPOUND_EXPR will be an argument which must be evaluated.
9799 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9800 COMPOUND_EXPR in the chain will contain the tree for the simplified
9801 form of the builtin function call. */
9803 static tree
9805 {
9809 else
9810 {
9811 tree fn;
9820 {
9822 tree tem;
9827 /* Return an offset into the constant string argument. */
9830 }
9833 /* strpbrk(x, "") == NULL.
9834 Evaluate and ignore s1 in case it had side-effects. */
9844 /* New argument list transforming strpbrk(s1, s2) to
9845 strchr(s1, s2[0]). */
9848 }
9849 }
9851 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9852 to the call.
9854 Return NULL_TREE if no simplification was possible, otherwise return the
9855 simplified form of the call as a tree.
9857 The simplified form may be a constant or other expression which
9858 computes the same value, but in a more efficient manner (including
9859 calls to other builtin functions).
9861 The call may contain arguments which need to be evaluated, but
9862 which are not useful to determine the result of the call. In
9863 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9864 COMPOUND_EXPR will be an argument which must be evaluated.
9865 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9866 COMPOUND_EXPR in the chain will contain the tree for the simplified
9867 form of the builtin function call. */
9869 static tree
9871 {
9875 else
9876 {
9879 /* If either argument is "", return NULL_TREE. */
9881 /* Evaluate and ignore both arguments in case either one has
9882 side-effects. */
9886 }
9887 }
9889 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9890 to the call.
9892 Return NULL_TREE if no simplification was possible, otherwise return the
9893 simplified form of the call as a tree.
9895 The simplified form may be a constant or other expression which
9896 computes the same value, but in a more efficient manner (including
9897 calls to other builtin functions).
9899 The call may contain arguments which need to be evaluated, but
9900 which are not useful to determine the result of the call. In
9901 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9902 COMPOUND_EXPR will be an argument which must be evaluated.
9903 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9904 COMPOUND_EXPR in the chain will contain the tree for the simplified
9905 form of the builtin function call. */
9907 static tree
9909 {
9913 else
9914 {
9915 /* If the first argument is "", return NULL_TREE. */
9918 {
9919 /* Evaluate and ignore argument s2 in case it has
9920 side-effects. */
9923 }
9925 /* If the second argument is "", return __builtin_strlen(s1). */
9928 {
9931 /* If the replacement _DECL isn't initialized, don't do the
9932 transformation. */
9937 }
9939 }
9940 }
9942 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9943 produced. False otherwise. This is done so that we don't output the error
9944 or warning twice or three times. */
9946 bool
9948 {
9951 tree arg;
9952 /* There is good chance the current input_location points inside the
9953 definition of the va_start macro (perhaps on the token for
9954 builtin) in a system header, so warnings will not be emitted.
9955 Use the location in real source code. */
9956 source_location current_location =
9958 NULL);
9961 {
9964 }
9967 {
9969 {
9972 }
9974 }
9975 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9976 when we checked the arguments and if needed issued a warning. */
9977 else
9978 {
9980 {
9981 /* Evidently an out of date version of <stdarg.h>; can't validate
9982 va_start's second argument, but can still work as intended. */
9984 OPT_Wvarargs,
9987 }
9989 {
9992 }
9994 }
9999 /* We destructively modify the call to be __builtin_va_start (ap, 0)
10000 or __builtin_next_arg (0) the first time we see it, after checking
10001 the arguments and if needed issuing a warning. */
10003 {
10006 /* Strip off all nops for the sake of the comparison. This
10007 is not quite the same as STRIP_NOPS. It does more.
10008 We must also strip off INDIRECT_EXPR for C++ reference
10009 parameters. */
10014 {
10015 /* FIXME: Sometimes with the tree optimizers we can get the
10016 not the last argument even though the user used the last
10017 argument. We just warn and set the arg to be the last
10018 argument so that we will get wrong-code because of
10019 it. */
10021 OPT_Wvarargs,
10023 }
10025 /* Undefined by C99 7.15.1.4p4 (va_start):
10026 "If the parameter parmN is declared with the register storage
10027 class, with a function or array type, or with a type that is
10028 not compatible with the type that results after application of
10029 the default argument promotions, the behavior is undefined."
10030 */
10032 {
10034 OPT_Wvarargs,
10035 "undefined behavior when second parameter of "
10037 }
10039 /* We want to verify the second parameter just once before the tree
10040 optimizers are run and then avoid keeping it in the tree,
10041 as otherwise we could warn even for correct code like:
10042 void foo (int i, ...)
10043 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
10046 else
10048 }
10050 }
10053 /* Expand a call EXP to __builtin_object_size. */
10055 static rtx
10057 {
10058 tree ost;
10063 {
10068 }
10076 {
10081 }
10086 }
10088 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10089 FCODE is the BUILT_IN_* to use.
10090 Return NULL_RTX if we failed; the caller should emit a normal call,
10091 otherwise try to get the result in TARGET, if convenient (and in
10092 mode MODE if that's convenient). */
10094 static rtx
10097 {
10099 POINTER_TYPE,
10100 fcode == BUILT_IN_MEMSET_CHK
10117 {
10118 /* Avoid transforming the checking call to an ordinary one when
10119 an overflow has been detected or when the call couldn't be
10120 validated because the size is not constant. */
10125 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10126 mem{cpy,pcpy,move,set} is available. */
10128 {
10143 }
10152 }
10155 else
10156 {
10159 /* If DEST is not a pointer type, call the normal function. */
10163 /* If SRC and DEST are the same (and not volatile), do nothing. */
10165 {
10166 tree expr;
10169 {
10170 /* Evaluate and ignore LEN in case it has side-effects. */
10173 }
10177 }
10179 /* __memmove_chk special case. */
10181 {
10187 /* If src is categorized for a readonly section we can use
10188 normal __memcpy_chk. */
10190 {
10199 }
10200 }
10202 }
10203 }
10205 /* Emit warning if a buffer overflow is detected at compile time. */
10207 static void
10209 {
10210 /* The source string. */
10212 /* The size of the destination object. */
10214 /* The string that is being concatenated with (as in __strcat_chk)
10215 or null if it isn't. */
10217 /* The maximum length of the source sequence in a bounded operation
10218 (such as __strncat_chk) or null if the operation isn't bounded
10219 (such as __strcat_chk). */
10221 /* The exact size of the access (such as in __strncpy_chk). */
10225 {
10233 /* For __strcat_chk the warning will be emitted only if overflowing
10234 by at least strlen (dest) + 1 bytes. */
10261 }
10264 {
10265 /* Check __strncat_chk. There is no way to determine the length
10266 of the string to which the source string is being appended so
10267 just warn when the length of the source string is not known. */
10270 }
10272 /* The destination argument is the first one for all built-ins above. */
10276 }
10278 /* Emit warning if a buffer overflow is detected at compile time
10279 in __sprintf_chk/__vsprintf_chk calls. */
10281 static void
10283 {
10288 /* Verify the required arguments in the original call. */
10298 /* Check whether the format is a literal string constant. */
10306 /* If the format doesn't contain % args or %%, we know its size. */
10309 /* If the format is "%s" and first ... argument is a string literal,
10310 we know it too. */
10313 {
10314 tree arg;
10325 }
10326 else
10329 /* Add one for the terminating nul. */
10334 }
10336 /* Emit warning if a free is called with address of a variable. */
10338 static void
10340 {
10354 else
10357 }
10359 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10360 if possible. */
10362 static tree
10364 {
10381 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10382 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10383 and (size_t) 0 for types 2 and 3. */
10388 {
10392 }
10394 {
10395 /* If object size is not known yet, delay folding until
10396 later. Maybe subsequent passes will help determining
10397 it. */
10401 }
10404 }
10406 /* Builtins with folding operations that operate on "..." arguments
10407 need special handling; we need to store the arguments in a convenient
10408 data structure before attempting any folding. Fortunately there are
10409 only a few builtins that fall into this category. FNDECL is the
10410 function, EXP is the CALL_EXPR for the call. */
10412 static tree
10414 {
10419 {
10426 }
10428 {
10433 }
10435 }
10437 /* Initialize format string characters in the target charset. */
10439 bool
10441 {
10444 {
10467 }
10469 }
10471 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10472 and no overflow/underflow occurred. INEXACT is true if M was not
10473 exactly calculated. TYPE is the tree type for the result. This
10474 function assumes that you cleared the MPFR flags and then
10475 calculated M to see if anything subsequently set a flag prior to
10476 entering this function. Return NULL_TREE if any checks fail. */
10478 static tree
10480 {
10481 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10482 overflow/underflow occurred. If -frounding-math, proceed iff the
10483 result of calling FUNC was exact. */
10486 {
10487 REAL_VALUE_TYPE rr;
10490 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10491 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10492 but the mpft_t is not, then we underflowed in the
10493 conversion. */
10496 {
10497 REAL_VALUE_TYPE rmode;
10500 /* Proceed iff the specified mode can hold the value. */
10503 }
10504 }
10506 }
10508 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10509 number and no overflow/underflow occurred. INEXACT is true if M
10510 was not exactly calculated. TYPE is the tree type for the result.
10511 This function assumes that you cleared the MPFR flags and then
10512 calculated M to see if anything subsequently set a flag prior to
10513 entering this function. Return NULL_TREE if any checks fail, if
10514 FORCE_CONVERT is true, then bypass the checks. */
10516 static tree
10518 {
10519 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10520 overflow/underflow occurred. If -frounding-math, proceed iff the
10521 result of calling FUNC was exact. */
10526 {
10531 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10532 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10533 but the mpft_t is not, then we underflowed in the
10534 conversion. */
10539 {
10544 /* Proceed iff the specified mode can hold the value. */
10550 }
10551 }
10553 }
10555 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10556 the pointer *(ARG_QUO) and return the result. The type is taken
10557 from the type of ARG0 and is used for setting the precision of the
10558 calculation and results. */
10560 static tree
10562 {
10569 /* To proceed, MPFR must exactly represent the target floating point
10570 format, which only happens when the target base equals two. */
10574 {
10579 {
10583 tree result_rem;
10592 /* Remquo is independent of the rounding mode, so pass
10593 inexact=0 to do_mpfr_ckconv(). */
10597 {
10598 /* MPFR calculates quo in the host's long so it may
10599 return more bits in quo than the target int can hold
10600 if sizeof(host long) > sizeof(target int). This can
10601 happen even for native compilers in LP64 mode. In
10602 these cases, modulo the quo value with the largest
10603 number that the target int can hold while leaving one
10604 bit for the sign. */
10608 /* Dereference the quo pointer argument. */
10610 /* Proceed iff a valid pointer type was passed in. */
10612 {
10613 /* Set the value. */
10614 tree result_quo
10617 integer_quo));
10619 /* Combine the quo assignment with the rem. */
10622 }
10623 }
10624 }
10625 }
10627 }
10629 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10630 resulting value as a tree with type TYPE. The mpfr precision is
10631 set to the precision of TYPE. We assume that this mpfr function
10632 returns zero if the result could be calculated exactly within the
10633 requested precision. In addition, the integer pointer represented
10634 by ARG_SG will be dereferenced and set to the appropriate signgam
10635 (-1,1) value. */
10637 static tree
10639 {
10644 /* To proceed, MPFR must exactly represent the target floating point
10645 format, which only happens when the target base equals two. Also
10646 verify ARG is a constant and that ARG_SG is an int pointer. */
10651 {
10654 /* In addition to NaN and Inf, the argument cannot be zero or a
10655 negative integer. */
10659 {
10664 mpfr_t m;
10665 tree result_lg;
10674 {
10675 tree result_sg;
10677 /* Dereference the arg_sg pointer argument. */
10679 /* Assign the signgam value into *arg_sg. */
10684 /* Combine the signgam assignment with the lgamma result. */
10687 }
10688 }
10689 }
10692 }
10694 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10695 mpc function FUNC on it and return the resulting value as a tree
10696 with type TYPE. The mpfr precision is set to the precision of
10697 TYPE. We assume that function FUNC returns zero if the result
10698 could be calculated exactly within the requested precision. If
10699 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10700 in the arguments and/or results. */
10702 tree
10705 {
10711 /* To proceed, MPFR must exactly represent the target floating point
10712 format, which only happens when the target base equals two. */
10718 {
10727 {
10747 }
10748 }
10751 }
10753 /* A wrapper function for builtin folding that prevents warnings for
10754 "statement without effect" and the like, caused by removing the
10755 call node earlier than the warning is generated. */
10757 tree
10759 {
10767 {
10776 {
10778 }
10779 else
10780 {
10783 {
10784 /* Propagate location information from original call to
10785 expansion of builtin. Otherwise things like
10786 maybe_emit_chk_warning, that operate on the expansion
10787 of a builtin, will use the wrong location information. */
10789 {
10797 }
10799 }
10800 }
10801 }
10803 }
10805 /* Look up the function in builtin_decl that corresponds to DECL
10806 and set ASMSPEC as its user assembler name. DECL must be a
10807 function decl that declares a builtin. */
10809 void
10811 {
10821 {
10825 }
10826 }
10828 /* Return true if DECL is a builtin that expands to a constant or similarly
10829 simple code. */
10830 bool
10832 {
10835 {
10836 /* Builtins that expand to constants. */
10841 /* Simple register moves or loads from stack. */
10852 /* Exception state returns or moves registers around. */
10860 }
10863 }
10865 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10866 most probably expanded inline into reasonably simple code. This is a
10867 superset of is_simple_builtin. */
10868 bool
10870 {
10877 {
10879 CASE_BUILT_IN_ALLOCA:
10945 }
10948 }
10950 /* Return true if T is a constant and the value cast to a target char
10951 can be represented by a host char.
10952 Store the casted char constant in *P if so. */
10954 bool
10956 {
10962 }
10964 /* Return the maximum object size. */
10966 tree
10968 {
10969 /* To do: Make this a configurable parameter. */
10971 }