| blob | 6a992bd939b87dcc5f576fc06a4a3d26df035319 |
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. */
197 /* Return true if NAME starts with __builtin_ or __sync_. */
199 static bool
201 {
209 }
212 /* Return true if DECL is a function symbol representing a built-in. */
214 bool
216 {
218 }
220 /* Return true if NODE should be considered for inline expansion regardless
221 of the optimization level. This means whenever a function is invoked with
222 its "internal" name, which normally contains the prefix "__builtin". */
224 bool
226 {
227 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
228 we want the name used to call the function, not the name it
229 will have. */
232 }
234 /* Compute values M and N such that M divides (address of EXP - N) and such
235 that N < M. If these numbers can be determined, store M in alignp and N in
236 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
237 *alignp and any bit-offset to *bitposp.
239 Note that the address (and thus the alignment) computed here is based
240 on the address to which a symbol resolves, whereas DECL_ALIGN is based
241 on the address at which an object is actually located. These two
242 addresses are not always the same. For example, on ARM targets,
243 the address &foo of a Thumb function foo() has the lowest bit set,
244 whereas foo() itself starts on an even address.
246 If ADDR_P is true we are taking the address of the memory reference EXP
247 and thus cannot rely on the access taking place. */
249 static bool
252 {
254 tree offset;
255 machine_mode mode;
260 /* Get the innermost object and the constant (bitpos) and possibly
261 variable (offset) offset of the access. */
265 /* Extract alignment information from the innermost object and
266 possibly adjust bitpos and offset. */
268 {
269 /* Function addresses can encode extra information besides their
270 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
271 allows the low bit to be used as a virtual bit, we know
272 that the address itself must be at least 2-byte aligned. */
275 }
277 ;
279 {
280 /* The alignment of a CONST_DECL is determined by its initializer. */
287 }
289 {
292 }
296 {
302 /* If the address is explicitely aligned, handle that. */
305 {
310 }
312 known_alignment
316 /* Re-apply explicit alignment to the bitpos. */
319 /* The alignment of the pointer operand in a TARGET_MEM_REF
320 has to take the variable offset parts into account. */
322 {
324 {
329 }
333 }
335 /* When EXP is an actual memory reference then we can use
336 TYPE_ALIGN of a pointer indirection to derive alignment.
337 Do so only if get_pointer_alignment_1 did not reveal absolute
338 alignment knowledge and if using that alignment would
339 improve the situation. */
345 else
346 {
347 /* Else adjust bitpos accordingly. */
352 }
353 }
355 {
356 /* STRING_CST are the only constant objects we allow to be not
357 wrapped inside a CONST_DECL. */
363 }
365 /* If there is a non-constant offset part extract the maximum
366 alignment that can prevail. */
368 {
371 {
375 }
376 }
378 /* Account for the alignment of runtime coefficients, so that the constant
379 bitpos is guaranteed to be accurate. */
382 {
385 }
390 }
392 /* For a memory reference expression EXP compute values M and N such that M
393 divides (&EXP - N) and such that N < M. If these numbers can be determined,
394 store M in alignp and N in *BITPOSP and return true. Otherwise return false
395 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
397 bool
400 {
402 }
404 /* Return the alignment in bits of EXP, an object. */
406 unsigned int
408 {
414 /* align and bitpos now specify known low bits of the pointer.
415 ptr & (align - 1) == bitpos. */
420 }
422 /* For a pointer valued expression EXP compute values M and N such that M
423 divides (EXP - N) and such that N < M. If these numbers can be determined,
424 store M in alignp and N in *BITPOSP and return true. Return false if
425 the results are just a conservative approximation.
427 If EXP is not a pointer, false is returned too. */
429 bool
432 {
439 {
446 else
447 {
450 {
454 }
455 }
459 }
462 {
467 {
470 /* Make sure to return a sensible alignment when the multiplication
471 by BITS_PER_UNIT overflowed. */
474 /* We cannot really tell whether this result is an approximation. */
476 }
477 else
478 {
482 }
483 }
485 {
490 }
495 }
497 /* Return the alignment in bits of EXP, a pointer valued expression.
498 The alignment returned is, by default, the alignment of the thing that
499 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
501 Otherwise, look at the expression to see if we can do better, i.e., if the
502 expression is actually pointing at an object whose alignment is tighter. */
504 unsigned int
506 {
512 /* align and bitpos now specify known low bits of the pointer.
513 ptr & (align - 1) == bitpos. */
519 }
521 /* Return the number of leading non-zero elements in the sequence
522 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
523 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
525 unsigned
527 {
533 {
534 /* Optimize the common case of plain char. */
536 {
540 }
541 }
542 else
543 {
545 {
549 }
550 }
552 }
554 /* Compute the length of a null-terminated character string or wide
555 character string handling character sizes of 1, 2, and 4 bytes.
556 TREE_STRING_LENGTH is not the right way because it evaluates to
557 the size of the character array in bytes (as opposed to characters)
558 and because it can contain a zero byte in the middle.
560 ONLY_VALUE should be nonzero if the result is not going to be emitted
561 into the instruction stream and zero if it is going to be expanded.
562 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
563 is returned, otherwise NULL, since
564 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
565 evaluate the side-effects.
567 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
568 accesses. Note that this implies the result is not going to be emitted
569 into the instruction stream.
571 ELTSIZE is 1 for normal single byte character strings, and 2 or
572 4 for wide characer strings. ELTSIZE is by default 1.
574 The value returned is of type `ssizetype'. */
576 tree
578 {
583 {
590 }
598 /* Offset from the beginning of the string in bytes. */
599 tree byteoff;
600 tree memsize;
605 /* Determine the size of the string element. */
609 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
610 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
611 in case the latter is less than the size of the array, such as when
612 SRC refers to a short string literal used to initialize a large array.
613 In that case, the elements of the array after the terminating NUL are
614 all NUL. */
623 /* PTR can point to the byte representation of any string type, including
624 char* and wchar_t*. */
628 {
629 /* For empty strings the result should be zero. */
633 /* The code below works only for single byte character types. */
637 /* If the string has an internal NUL character followed by any
638 non-NUL characters (e.g., "foo\0bar"), we can't compute
639 the offset to the following NUL if we don't know where to
640 start searching for it. */
643 /* Return when an embedded null character is found or none at all. */
647 /* We don't know the starting offset, but we do know that the string
648 has no internal zero bytes. If the offset falls within the bounds
649 of the string subtract the offset from the length of the string,
650 and return that. Otherwise the length is zero. Take care to
651 use SAVE_EXPR in case the OFFSET has side-effects. */
659 }
661 /* Offset from the beginning of the string in elements. */
662 HOST_WIDE_INT eltoff;
664 /* We have a known offset into the string. Start searching there for
665 a null character if we can represent it as a single HOST_WIDE_INT. */
670 else
673 /* If the offset is known to be out of bounds, warn, and call strlen at
674 runtime. */
676 {
677 /* Suppress multiple warnings for propagated constant strings. */
680 {
683 eltoff);
685 }
687 }
689 /* If eltoff is larger than strelts but less than maxelts the
690 string length is zero, since the excess memory will be zero. */
694 /* Use strlen to search for the first zero byte. Since any strings
695 constructed with build_string will have nulls appended, we win even
696 if we get handed something like (char[4])"abcd".
698 Since ELTOFF is our starting index into the string, no further
699 calculation is needed. */
704 }
706 /* Return a constant integer corresponding to target reading
707 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
709 static rtx
711 {
712 HOST_WIDE_INT ch;
726 {
738 }
742 }
744 /* Cast a target constant CST to target CHAR and if that value fits into
745 host char type, return zero and put that value into variable pointed to by
746 P. */
748 static int
750 {
757 /* Do not care if it fits or not right here. */
772 }
774 /* Similar to save_expr, but assumes that arbitrary code is not executed
775 in between the multiple evaluations. In particular, we assume that a
776 non-addressable local variable will not be modified. */
778 static tree
780 {
788 }
790 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
791 times to get the address of either a higher stack frame, or a return
792 address located within it (depending on FNDECL_CODE). */
794 static rtx
796 {
800 {
801 /* For a zero count with __builtin_return_address, we don't care what
802 frame address we return, because target-specific definitions will
803 override us. Therefore frame pointer elimination is OK, and using
804 the soft frame pointer is OK.
806 For a nonzero count, or a zero count with __builtin_frame_address,
807 we require a stable offset from the current frame pointer to the
808 previous one, so we must use the hard frame pointer, and
809 we must disable frame pointer elimination. */
812 else
813 {
816 /* Tell reload not to eliminate the frame pointer. */
818 }
819 }
824 /* On the SPARC, the return address is not in the frame, it is in a
825 register. There is no way to access it off of the current frame
826 pointer, but it can be accessed off the previous frame pointer by
827 reading the value from the register window save area. */
829 count--;
831 /* Scan back COUNT frames to the specified frame. */
833 {
834 /* Assume the dynamic chain pointer is in the word that the
835 frame address points to, unless otherwise specified. */
840 }
842 /* For __builtin_frame_address, return what we've got. But, on
843 the SPARC for example, we may have to add a bias. */
847 /* For __builtin_return_address, get the return address from that frame. */
848 #ifdef RETURN_ADDR_RTX
850 #else
854 #endif
856 }
858 /* Alias set used for setjmp buffer. */
861 /* Construct the leading half of a __builtin_setjmp call. Control will
862 return to RECEIVER_LABEL. This is also called directly by the SJLJ
863 exception handling code. */
865 void
867 {
869 rtx stack_save;
870 rtx mem;
879 /* We store the frame pointer and the address of receiver_label in
880 the buffer and use the rest of it for the stack save area, which
881 is machine-dependent. */
900 /* If there is further processing to do, do it. */
904 /* We have a nonlocal label. */
906 }
908 /* Construct the trailing part of a __builtin_setjmp call. This is
909 also called directly by the SJLJ exception handling code.
910 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
912 void
914 {
915 rtx chain;
917 /* Mark the FP as used when we get here, so we have to make sure it's
918 marked as used by this function. */
921 /* Mark the static chain as clobbered here so life information
922 doesn't get messed up for it. */
927 /* Now put in the code to restore the frame pointer, and argument
928 pointer, if needed. */
930 {
931 /* First adjust our frame pointer to its actual value. It was
932 previously set to the start of the virtual area corresponding to
933 the stacked variables when we branched here and now needs to be
934 adjusted to the actual hardware fp value.
936 Assignments to virtual registers are converted by
937 instantiate_virtual_regs into the corresponding assignment
938 to the underlying register (fp in this case) that makes
939 the original assignment true.
940 So the following insn will actually be decrementing fp by
941 TARGET_STARTING_FRAME_OFFSET. */
944 /* Restoring the frame pointer also modifies the hard frame pointer.
945 Mark it used (so that the previous assignment remains live once
946 the frame pointer is eliminated) and clobbered (to represent the
947 implicit update from the assignment). */
950 }
953 {
954 /* If the argument pointer can be eliminated in favor of the
955 frame pointer, we don't need to restore it. We assume here
956 that if such an elimination is present, it can always be used.
957 This is the case on all known machines; if we don't make this
958 assumption, we do unnecessary saving on many machines. */
968 {
969 /* Now restore our arg pointer from the address at which it
970 was saved in our stack frame. */
973 }
974 }
980 else
983 /* We must not allow the code we just generated to be reordered by
984 scheduling. Specifically, the update of the frame pointer must
985 happen immediately, not later. */
987 }
989 /* __builtin_longjmp is passed a pointer to an array of five words (not
990 all will be used on all machines). It operates similarly to the C
991 library function of the same name, but is more efficient. Much of
992 the code below is copied from the handling of non-local gotos. */
994 static void
996 {
1001 /* DRAP is needed for stack realign if longjmp is expanded to current
1002 function */
1013 /* We require that the user must pass a second argument of 1, because
1014 that is what builtin_setjmp will return. */
1020 else
1021 {
1032 /* Pick up FP, label, and SP from the block and jump. This code is
1033 from expand_goto in stmt.c; see there for detailed comments. */
1035 /* We have to pass a value to the nonlocal_goto pattern that will
1036 get copied into the static_chain pointer, but it does not matter
1037 what that value is, because builtin_setjmp does not use it. */
1039 else
1040 {
1052 }
1053 }
1055 /* Search backwards and mark the jump insn as a non-local goto.
1056 Note that this precludes the use of __builtin_longjmp to a
1057 __builtin_setjmp target in the same function. However, we've
1058 already cautioned the user that these functions are for
1059 internal exception handling use only. */
1061 {
1065 {
1068 }
1071 }
1072 }
1076 {
1078 }
1080 /* This function validates the types of a function call argument list
1081 against a specified list of tree_codes. If the last specifier is a 0,
1082 that represents an ellipsis, otherwise the last specifier must be a
1083 VOID_TYPE. */
1085 static bool
1087 {
1091 const_call_expr_arg_iterator iter;
1092 const_tree arg;
1097 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1102 {
1106 {
1108 /* This signifies an ellipses, any further arguments are all ok. */
1112 /* This signifies an endlink, if no arguments remain, return
1113 true, otherwise return false. */
1117 /* The actual argument must be nonnull when either the whole
1118 called function has been declared nonnull, or when the formal
1119 argument corresponding to the actual argument has been. */
1122 {
1127 }
1128 /* FALLTHRU */
1130 /* If no parameters remain or the parameter's code does not
1131 match the specified code, return false. Otherwise continue
1132 checking any remaining arguments. */
1137 }
1138 }
1140 /* We need gotos here since we can only have one VA_CLOSE in a
1141 function. */
1142 end: ;
1148 }
1150 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1151 and the address of the save area. */
1153 static rtx
1155 {
1170 /* Copy the address of the save location to a register just in case it was
1171 based on the frame pointer. */
1180 /* ??? We no longer need to pass the static chain value, afaik. */
1183 else
1184 {
1190 /* Restore frame pointer for containing function. */
1194 /* USE of hard_frame_pointer_rtx added for consistency;
1195 not clear if really needed. */
1199 /* If the architecture is using a GP register, we must
1200 conservatively assume that the target function makes use of it.
1201 The prologue of functions with nonlocal gotos must therefore
1202 initialize the GP register to the appropriate value, and we
1203 must then make sure that this value is live at the point
1204 of the jump. (Note that this doesn't necessarily apply
1205 to targets with a nonlocal_goto pattern; they are free
1206 to implement it in their own way. Note also that this is
1207 a no-op if the GP register is a global invariant.) */
1213 }
1215 /* Search backwards to the jump insn and mark it as a
1216 non-local goto. */
1218 {
1220 {
1223 }
1226 }
1229 }
1231 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1232 (not all will be used on all machines) that was passed to __builtin_setjmp.
1233 It updates the stack pointer in that block to the current value. This is
1234 also called directly by the SJLJ exception handling code. */
1236 void
1238 {
1241 rtx stack_save
1243 memory_address
1249 }
1251 /* Expand a call to __builtin_prefetch. For a target that does not support
1252 data prefetch, evaluate the memory address argument in case it has side
1253 effects. */
1255 static void
1257 {
1267 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1268 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1269 locality). */
1273 else
1277 else
1280 /* Argument 0 is an address. */
1283 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1285 {
1288 }
1290 /* Argument 1 must be either zero or one. */
1292 {
1296 }
1298 /* Argument 2 (locality) must be a compile-time constant int. */
1300 {
1303 }
1305 /* Argument 2 must be 0, 1, 2, or 3. */
1307 {
1310 }
1313 {
1321 }
1323 /* Don't do anything with direct references to volatile memory, but
1324 generate code to handle other side effects. */
1327 }
1329 /* Get a MEM rtx for expression EXP which is the address of an operand
1330 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1331 the maximum length of the block of memory that might be accessed or
1332 NULL if unknown. */
1334 static rtx
1336 {
1340 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1341 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1348 /* Get an expression we can use to find the attributes to assign to MEM.
1349 First remove any nops. */
1354 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1355 (as builtin stringops may alias with anything). */
1362 /* If the MEM_REF has no acceptable address, try to get the base object
1363 from the original address we got, and build an all-aliasing
1364 unknown-sized access to that one. */
1370 {
1375 size_zero_node,
1376 NULL)),
1379 }
1382 }
1383 \f
1384 /* Built-in functions to perform an untyped call and return. */
1386 #define apply_args_mode \
1387 (this_target_builtins->x_apply_args_mode)
1388 #define apply_result_mode \
1389 (this_target_builtins->x_apply_result_mode)
1391 /* Return the size required for the block returned by __builtin_apply_args,
1392 and initialize apply_args_mode. */
1394 static int
1396 {
1401 /* The values computed by this function never change. */
1403 {
1404 /* The first value is the incoming arg-pointer. */
1407 /* The second value is the structure value address unless this is
1408 passed as an "invisible" first argument. */
1414 {
1424 }
1425 else
1426 {
1428 }
1429 }
1431 }
1433 /* Return the size required for the block returned by __builtin_apply,
1434 and initialize apply_result_mode. */
1436 static int
1438 {
1442 /* The values computed by this function never change. */
1444 {
1449 {
1459 }
1460 else
1463 /* Allow targets that use untyped_call and untyped_return to override
1464 the size so that machine-specific information can be stored here. */
1465 #ifdef APPLY_RESULT_SIZE
1467 #endif
1468 }
1470 }
1472 /* Create a vector describing the result block RESULT. If SAVEP is true,
1473 the result block is used to save the values; otherwise it is used to
1474 restore the values. */
1476 static rtx
1478 {
1480 fixed_size_mode mode;
1487 {
1497 }
1499 }
1501 /* Save the state required to perform an untyped call with the same
1502 arguments as were passed to the current function. */
1504 static rtx
1506 {
1509 fixed_size_mode mode;
1510 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1512 /* Create a block where the arg-pointer, structure value address,
1513 and argument registers can be saved. */
1516 /* Walk past the arg-pointer and structure value address. */
1521 /* Save each register used in calling a function to the block. */
1524 {
1533 }
1535 /* Save the arg pointer to the block. */
1537 /* We need the pointer as the caller actually passed them to us, not
1538 as we might have pretended they were passed. Make sure it's a valid
1539 operand, as emit_move_insn isn't expected to handle a PLUS. */
1541 tem
1544 NULL_RTX);
1549 /* Save the structure value address unless this is passed as an
1550 "invisible" first argument. */
1552 {
1556 }
1558 /* Return the address of the block. */
1560 }
1562 /* __builtin_apply_args returns block of memory allocated on
1563 the stack into which is stored the arg pointer, structure
1564 value address, static chain, and all the registers that might
1565 possibly be used in performing a function call. The code is
1566 moved to the start of the function so the incoming values are
1567 saved. */
1569 static rtx
1571 {
1572 /* Don't do __builtin_apply_args more than once in a function.
1573 Save the result of the first call and reuse it. */
1576 {
1577 /* When this function is called, it means that registers must be
1578 saved on entry to this function. So we migrate the
1579 call to the first insn of this function. */
1580 rtx temp;
1589 /* Put the insns after the NOTE that starts the function.
1590 If this is inside a start_sequence, make the outer-level insn
1591 chain current, so the code is placed at the start of the
1592 function. If internal_arg_pointer is a non-virtual pseudo,
1593 it needs to be placed after the function that initializes
1594 that pseudo. */
1599 else
1603 }
1604 }
1606 /* Perform an untyped call and save the state required to perform an
1607 untyped return of whatever value was returned by the given function. */
1609 static rtx
1611 {
1613 fixed_size_mode mode;
1622 /* Create a block where the return registers can be saved. */
1625 /* Fetch the arg pointer from the ARGUMENTS block. */
1632 /* Push a new argument block and copy the arguments. Do not allow
1633 the (potential) memcpy call below to interfere with our stack
1634 manipulations. */
1636 NO_DEFER_POP;
1638 /* Save the stack with nonlocal if available. */
1641 else
1644 /* Allocate a block of memory onto the stack and copy the memory
1645 arguments to the outgoing arguments address. We can pass TRUE
1646 as the 4th argument because we just saved the stack pointer
1647 and will restore it right after the call. */
1650 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1651 may have already set current_function_calls_alloca to true.
1652 current_function_calls_alloca won't be set if argsize is zero,
1653 so we have to guarantee need_drap is true here. */
1659 {
1662 else
1664 }
1671 /* Refer to the argument block. */
1676 /* Walk past the arg-pointer and structure value address. */
1681 /* Restore each of the registers previously saved. Make USE insns
1682 for each of these registers for use in making the call. */
1685 {
1693 }
1695 /* Restore the structure value address unless this is passed as an
1696 "invisible" first argument. */
1699 {
1706 }
1708 /* All arguments and registers used for the call are set up by now! */
1711 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1712 and we don't want to load it into a register as an optimization,
1713 because prepare_call_address already did it if it should be done. */
1717 /* Generate the actual call instruction and save the return value. */
1719 {
1723 }
1725 {
1728 /* Locate the unique return register. It is not possible to
1729 express a call that sets more than one return register using
1730 call_value; use untyped_call for that. In fact, untyped_call
1731 only needs to save the return registers in the given block. */
1734 {
1738 }
1745 }
1746 else
1749 /* Find the CALL insn we just emitted, and attach the register usage
1750 information. */
1754 /* Restore the stack. */
1757 else
1761 OK_DEFER_POP;
1763 /* Return the address of the result block. */
1766 }
1768 /* Perform an untyped return. */
1770 static void
1772 {
1774 fixed_size_mode mode;
1775 rtx reg;
1784 {
1789 }
1791 /* Restore the return value and note that each value is used. */
1795 {
1807 }
1809 /* Put the USE insns before the return. */
1812 /* Return whatever values was restored by jumping directly to the end
1813 of the function. */
1815 }
1817 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1819 static enum type_class
1821 {
1823 {
1842 }
1843 }
1845 /* Expand a call EXP to __builtin_classify_type. */
1847 static rtx
1849 {
1853 }
1855 /* This helper macro, meant to be used in mathfn_built_in below, determines
1856 which among a set of builtin math functions is appropriate for a given type
1857 mode. The `F' (float) and `L' (long double) are automatically generated
1858 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1859 types, there are additional types that are considered with 'F32', 'F64',
1860 'F128', etc. suffixes. */
1861 #define CASE_MATHFN(MATHFN) \
1862 CASE_CFN_##MATHFN: \
1863 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1864 fcodel = BUILT_IN_##MATHFN##L ; break;
1865 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1866 types. */
1867 #define CASE_MATHFN_FLOATN(MATHFN) \
1868 CASE_CFN_##MATHFN: \
1869 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1870 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1871 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1872 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1873 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1874 break;
1875 /* Similar to above, but appends _R after any F/L suffix. */
1876 #define CASE_MATHFN_REENT(MATHFN) \
1877 case CFN_BUILT_IN_##MATHFN##_R: \
1878 case CFN_BUILT_IN_##MATHFN##F_R: \
1879 case CFN_BUILT_IN_##MATHFN##L_R: \
1880 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1881 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1883 /* Return a function equivalent to FN but operating on floating-point
1884 values of type TYPE, or END_BUILTINS if no such function exists.
1885 This is purely an operation on function codes; it does not guarantee
1886 that the target actually has an implementation of the function. */
1888 static built_in_function
1890 {
1891 tree mtype;
1902 {
1993 }
2016 else
2018 }
2020 /* Return mathematic function equivalent to FN but operating directly on TYPE,
2021 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2022 otherwise use the explicit declaration. If we can't do the conversion,
2023 return null. */
2025 static tree
2027 {
2036 }
2038 /* Like mathfn_built_in_1, but always use the implicit array. */
2040 tree
2042 {
2044 }
2046 /* Like mathfn_built_in_1, but take a built_in_function and
2047 always use the implicit array. */
2049 tree
2051 {
2053 }
2055 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2056 return its code, otherwise return IFN_LAST. Note that this function
2057 only tests whether the function is defined in internals.def, not whether
2058 it is actually available on the target. */
2060 internal_fn
2062 {
2066 {
2067 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2068 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2069 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2070 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2071 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2072 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2073 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2090 }
2091 }
2093 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2094 on the current target by a call to an internal function, return the
2095 code of that internal function, otherwise return IFN_LAST. The caller
2096 is responsible for ensuring that any side-effects of the built-in
2097 call are dealt with correctly. E.g. if CALL sets errno, the caller
2098 must decide that the errno result isn't needed or make it available
2099 in some other way. */
2101 internal_fn
2103 {
2105 {
2108 {
2113 }
2114 }
2116 }
2118 /* Expand a call to the builtin trinary math functions (fma).
2119 Return NULL_RTX if a normal call should be emitted rather than expanding the
2120 function in-line. EXP is the expression that is a call to the builtin
2121 function; if convenient, the result should be placed in TARGET.
2122 SUBTARGET may be used as the target for computing one of EXP's
2123 operands. */
2125 static rtx
2127 {
2128 optab builtin_optab;
2133 machine_mode mode;
2143 {
2149 }
2151 /* Make a suitable register to place result in. */
2154 /* Before working hard, check whether the instruction is available. */
2160 /* Always stabilize the argument list. */
2171 /* Compute into RESULT.
2172 Set RESULT to wherever the result comes back. */
2176 /* If we were unable to expand via the builtin, stop the sequence
2177 (without outputting the insns) and call to the library function
2178 with the stabilized argument list. */
2180 {
2183 }
2185 /* Output the entire sequence. */
2191 }
2193 /* Expand a call to the builtin sin and cos math functions.
2194 Return NULL_RTX if a normal call should be emitted rather than expanding the
2195 function in-line. EXP is the expression that is a call to the builtin
2196 function; if convenient, the result should be placed in TARGET.
2197 SUBTARGET may be used as the target for computing one of EXP's
2198 operands. */
2200 static rtx
2202 {
2203 optab builtin_optab;
2204 rtx op0;
2207 machine_mode mode;
2208 tree arg;
2216 {
2222 }
2224 /* Make a suitable register to place result in. */
2227 /* Check if sincos insn is available, otherwise fallback
2228 to sin or cos insn. */
2231 {
2238 }
2240 /* Before working hard, check whether the instruction is available. */
2242 {
2245 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2246 need to expand the argument again. This way, we will not perform
2247 side-effects more the once. */
2254 /* Compute into RESULT.
2255 Set RESULT to wherever the result comes back. */
2257 {
2261 {
2270 }
2272 }
2273 else
2277 {
2278 /* Output the entire sequence. */
2283 }
2285 /* If we were unable to expand via the builtin, stop the sequence
2286 (without outputting the insns) and call to the library function
2287 with the stabilized argument list. */
2289 }
2292 }
2294 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2295 return an RTL instruction code that implements the functionality.
2296 If that isn't possible or available return CODE_FOR_nothing. */
2298 static enum insn_code
2300 {
2303 machine_mode mode;
2306 {
2320 /* These builtins have no optabs (yet). */
2324 }
2326 /* There's no easy way to detect the case we need to set EDOM. */
2330 /* Optab mode depends on the mode of the input argument. */
2336 }
2338 /* Expand a call to one of the builtin math functions that operate on
2339 floating point argument and output an integer result (ilogb, isinf,
2340 isnan, etc).
2341 Return 0 if a normal call should be emitted rather than expanding the
2342 function in-line. EXP is the expression that is a call to the builtin
2343 function; if convenient, the result should be placed in TARGET. */
2345 static rtx
2347 {
2349 rtx op0;
2351 machine_mode mode;
2352 tree arg;
2362 {
2367 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2368 need to expand the argument again. This way, we will not perform
2369 side-effects more the once. */
2384 }
2387 }
2389 /* Expand a call to the builtin sincos math function.
2390 Return NULL_RTX if a normal call should be emitted rather than expanding the
2391 function in-line. EXP is the expression that is a call to the builtin
2392 function. */
2394 static rtx
2396 {
2398 machine_mode mode;
2412 /* Make a suitable register to place result in. */
2415 /* Check if sincos insn is available, otherwise emit the call. */
2430 /* Compute into target1 and target2.
2431 Set TARGET to wherever the result comes back. */
2435 /* Move target1 and target2 to the memory locations indicated
2436 by op1 and op2. */
2441 }
2443 /* Expand a call to the internal cexpi builtin to the sincos math function.
2444 EXP is the expression that is a call to the builtin function; if convenient,
2445 the result should be placed in TARGET. */
2447 static rtx
2449 {
2452 machine_mode mode;
2463 /* Try expanding via a sincos optab, fall back to emitting a libcall
2464 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2465 is only generated from sincos, cexp or if we have either of them. */
2467 {
2473 /* Compute into op1 and op2. */
2475 }
2477 {
2488 else
2498 /* Make sure not to fold the sincos call again. */
2502 }
2503 else
2504 {
2514 else
2517 /* If we don't have a decl for cexp create one. This is the
2518 friendliest fallback if the user calls __builtin_cexpi
2519 without full target C99 function support. */
2521 {
2522 tree fntype;
2534 }
2539 /* Make sure not to fold the cexp call again. */
2543 }
2545 /* Now build the proper return type. */
2550 }
2552 /* Conveniently construct a function call expression. FNDECL names the
2553 function to be called, N is the number of arguments, and the "..."
2554 parameters are the argument expressions. Unlike build_call_exr
2555 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2557 static tree
2559 {
2569 }
2571 /* Expand a call to one of the builtin rounding functions gcc defines
2572 as an extension (lfloor and lceil). As these are gcc extensions we
2573 do not need to worry about setting errno to EDOM.
2574 If expanding via optab fails, lower expression to (int)(floor(x)).
2575 EXP is the expression that is a call to the builtin function;
2576 if convenient, the result should be placed in TARGET. */
2578 static rtx
2580 {
2581 convert_optab builtin_optab;
2586 tree fallback_fndecl;
2587 machine_mode mode;
2588 tree arg;
2596 {
2613 }
2615 /* Make a suitable register to place result in. */
2620 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2621 need to expand the argument again. This way, we will not perform
2622 side-effects more the once. */
2629 /* Compute into TARGET. */
2631 {
2632 /* Output the entire sequence. */
2637 }
2639 /* If we were unable to expand via the builtin, stop the sequence
2640 (without outputting the insns). */
2643 /* Fall back to floating point rounding optab. */
2646 /* For non-C99 targets we may end up without a fallback fndecl here
2647 if the user called __builtin_lfloor directly. In this case emit
2648 a call to the floor/ceil variants nevertheless. This should result
2649 in the best user experience for not full C99 targets. */
2651 {
2652 tree fntype;
2656 {
2689 }
2694 }
2701 /* Truncate the result of floating point optab to integer
2702 via expand_fix (). */
2707 }
2709 /* Expand a call to one of the builtin math functions doing integer
2710 conversion (lrint).
2711 Return 0 if a normal call should be emitted rather than expanding the
2712 function in-line. EXP is the expression that is a call to the builtin
2713 function; if convenient, the result should be placed in TARGET. */
2715 static rtx
2717 {
2718 convert_optab builtin_optab;
2719 rtx op0;
2722 tree arg;
2723 machine_mode mode;
2732 {
2751 }
2753 /* There's no easy way to detect the case we need to set EDOM. */
2757 /* Make a suitable register to place result in. */
2760 /* There's no easy way to detect the case we need to set EDOM. */
2762 {
2765 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2766 need to expand the argument again. This way, we will not perform
2767 side-effects more the once. */
2775 {
2776 /* Output the entire sequence. */
2781 }
2783 /* If we were unable to expand via the builtin, stop the sequence
2784 (without outputting the insns) and call to the library function
2785 with the stabilized argument list. */
2787 }
2790 {
2791 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2792 targets, (int) round (x) should never be transformed into
2793 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2794 a call to lround in the hope that the target provides at least some
2795 C99 functions. This should result in the best user experience for
2796 not full C99 targets. */
2797 tree fallback_fndecl = mathfn_built_in_1
2806 }
2809 }
2811 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2812 a normal call should be emitted rather than expanding the function
2813 in-line. EXP is the expression that is a call to the builtin
2814 function; if convenient, the result should be placed in TARGET. */
2816 static rtx
2818 {
2821 machine_mode mode;
2822 machine_mode mode2;
2831 /* Emit a libcall to libgcc. */
2833 /* Mode of the 2nd argument must match that of an int. */
2851 }
2853 /* Expand expression EXP which is a call to the strlen builtin. Return
2854 NULL_RTX if we failed and the caller should emit a normal call, otherwise
2855 try to get the result in TARGET, if convenient. */
2857 static rtx
2859 machine_mode target_mode)
2860 {
2865 rtx pat;
2866 tree len;
2868 rtx src_reg;
2870 machine_mode insn_mode;
2874 /* If the length can be computed at compile-time, return it. */
2879 /* If the length can be computed at compile-time and is constant
2880 integer, but there are side-effects in src, evaluate
2881 src for side-effects, then return len.
2882 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2883 can be optimized into: i++; x = 3; */
2886 {
2889 }
2893 /* If SRC is not a pointer type, don't do this operation inline. */
2897 /* Bail out if we can't compute strlen in the right mode. */
2899 {
2903 }
2907 /* Make a place to hold the source address. We will not expand
2908 the actual source until we are sure that the expansion will
2909 not fail -- there are trees that cannot be expanded twice. */
2912 /* Mark the beginning of the strlen sequence so we can emit the
2913 source operand later. */
2923 /* Check to see if the argument was declared attribute nonstring
2924 and if so, issue a warning since at this point it's not known
2925 to be nul-terminated. */
2928 /* Now that we are assured of success, expand the source. */
2932 {
2933 #ifdef POINTERS_EXTEND_UNSIGNED
2936 POINTERS_EXTEND_UNSIGNED);
2937 #endif
2939 }
2945 else
2948 /* Return the value in the proper mode for this function. */
2953 else
2957 }
2959 /* Expand call EXP to the strnlen built-in, returning the result
2960 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
2962 static rtx
2964 {
2984 {
2988 "%K%qD specified bound %E "
2999 }
3012 "%K%qD specified bound [%wu, %wu] "
3025 }
3027 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3028 bytes from constant string DATA + OFFSET and return it as target
3029 constant. */
3031 static rtx
3033 scalar_int_mode mode)
3034 {
3042 }
3044 /* LEN specify length of the block of memcpy/memset operation.
3045 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3046 In some cases we can make very likely guess on max size, then we
3047 set it into PROBABLE_MAX_SIZE. */
3049 static void
3054 {
3056 {
3059 }
3060 else
3061 {
3065 /* Determine bounds from the type. */
3068 else
3073 else
3079 {
3084 }
3086 {
3087 /* Anti range 0...N lets us to determine minimal size to N+1. */
3089 {
3092 }
3093 /* Code like
3095 int n;
3096 if (n < 100)
3097 memcpy (a, b, n)
3099 Produce anti range allowing negative values of N. We still
3100 can use the information and make a guess that N is not negative.
3101 */
3104 }
3105 }
3109 }
3111 /* Try to verify that the sizes and lengths of the arguments to a string
3112 manipulation function given by EXP are within valid bounds and that
3113 the operation does not lead to buffer overflow or read past the end.
3114 Arguments other than EXP may be null. When non-null, the arguments
3115 have the following meaning:
3116 DST is the destination of a copy call or NULL otherwise.
3117 SRC is the source of a copy call or NULL otherwise.
3118 DSTWRITE is the number of bytes written into the destination obtained
3119 from the user-supplied size argument to the function (such as in
3120 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3121 MAXREAD is the user-supplied bound on the length of the source sequence
3122 (such as in strncat(d, s, N). It specifies the upper limit on the number
3123 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3124 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3125 expression EXP is a string function call (as opposed to a memory call
3126 like memcpy). As an exception, SRCSTR can also be an integer denoting
3127 the precomputed size of the source string or object (for functions like
3128 memcpy).
3129 DSTSIZE is the size of the destination object specified by the last
3130 argument to the _chk builtins, typically resulting from the expansion
3131 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3132 DSTSIZE).
3134 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3135 SIZE_MAX.
3137 If the call is successfully verified as safe return true, otherwise
3138 return false. */
3140 static bool
3143 {
3146 /* The size of the largest object is half the address space, or
3147 PTRDIFF_MAX. (This is way too permissive.) */
3150 /* Either the length of the source string for string functions or
3151 the size of the source object for raw memory functions. */
3156 /* Set to true when the exact number of bytes written by a string
3157 function like strcpy is not known and the only thing that is
3158 known is that it must be at least one (for the terminating nul). */
3161 {
3162 /* SRCSTR is normally a pointer to string but as a special case
3163 it can be an integer denoting the length of a string. */
3165 {
3166 /* Try to determine the range of lengths the source string
3167 refers to. If it can be determined and is less than
3168 the upper bound given by MAXREAD add one to it for
3169 the terminating nul. Otherwise, set it to one for
3170 the same reason, or to MAXREAD as appropriate. */
3173 {
3176 else
3187 }
3188 else
3189 {
3192 }
3193 }
3194 else
3196 }
3199 {
3200 /* When the only available piece of data is the object size
3201 there is nothing to do. */
3205 /* Otherwise, when the length of the source sequence is known
3206 (as with strlen), set DSTWRITE to it. */
3209 }
3219 /* First check the number of bytes to be written against the maximum
3220 object size. */
3224 {
3234 "%K%qD specified size %E "
3237 else
3239 "%K%qD specified size between %E and %E "
3247 }
3249 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3250 constant, and in range of unsigned HOST_WIDE_INT. */
3253 /* Next check the number of bytes to be written against the destination
3254 object size. */
3256 {
3261 || (dstwrite
3264 {
3272 {
3273 /* This is a call to strcpy with a destination of 0 size
3274 and a source of unknown length. The call will write
3275 at least one byte past the end of the destination. */
3277 "%K%qD writing %E or more bytes into a region "
3280 }
3283 "%K%qD writing %E byte into a region "
3285 "%K%qD writing %E bytes into a region "
3289 {
3290 /* Avoid printing the upper bound if it's invalid. */
3292 "%K%qD writing %E or more bytes into a region "
3295 }
3296 else
3298 "%K%qD writing between %E and %E bytes into "
3301 dstsize);
3303 /* Return error when an overflow has been detected. */
3305 }
3306 }
3308 /* Check the maximum length of the source sequence against the size
3309 of the destination object if known, or against the maximum size
3310 of an object. */
3312 {
3315 /* Use the lower end for MAXREAD from now on. */
3320 {
3325 {
3329 /* Warn about crazy big sizes first since that's more
3330 likely to be meaningful than saying that the bound
3331 is greater than the object size if both are big. */
3334 "%K%qD specified bound %E "
3338 else
3340 "%K%qD specified bound between %E and %E "
3346 }
3349 {
3355 "%K%qD specified bound %E "
3359 else
3361 "%K%qD specified bound between %E and %E "
3366 }
3367 }
3368 }
3370 /* Check for reading past the end of SRC. */
3375 {
3387 {
3388 /* Avoid printing the upper bound if it's invalid. */
3390 "%K%qD reading %E or more bytes from a region "
3393 }
3394 else
3396 "%K%qD reading between %E and %E bytes from a region "
3400 }
3403 }
3405 /* Helper to compute the size of the object referenced by the DEST
3406 expression which must have pointer type, using Object Size type
3407 OSTYPE (only the least significant 2 bits are used). Return
3408 an estimate of the size of the object if successful or NULL when
3409 the size cannot be determined. When the referenced object involves
3410 a non-constant offset in some range the returned value represents
3411 the largest size given the smallest non-negative offset in the
3412 range. The function is intended for diagnostics and should not
3413 be used to influence code generation or optimization. */
3415 tree
3417 {
3420 /* Only the two least significant bits are meaningful. */
3427 {
3436 {
3437 /* compute_builtin_object_size fails for addresses with
3438 non-constant offsets. Try to determine the range of
3439 such an offset here and use it to adjust the constant
3440 size. */
3443 {
3445 {
3449 /* Ignore negative offsets for now. For others,
3450 use the lower bound as the most optimistic
3451 estimate of the (remaining) size. */
3453 ;
3457 else
3459 }
3460 }
3463 {
3468 {
3470 {
3473 /* Ignore negative offsets for now. For others,
3474 use the lower bound as the most optimistic
3475 estimate of the (remaining)size. */
3477 ;
3481 else
3483 }
3484 }
3485 }
3486 }
3489 }
3491 /* Unless computing the largest size (for memcpy and other raw memory
3492 functions), try to determine the size of the object from its type. */
3507 {
3508 /* Return the constant size unless it's zero (that's a zero-length
3509 array likely at the end of a struct). */
3514 }
3517 }
3519 /* Helper to determine and check the sizes of the source and the destination
3520 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3521 call expression, DEST is the destination argument, SRC is the source
3522 argument or null, and LEN is the number of bytes. Use Object Size type-0
3523 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3524 (no overflow or invalid sizes), false otherwise. */
3526 static bool
3528 {
3529 /* For functions like memset and memcpy that operate on raw memory
3530 try to determine the size of the largest source and destination
3531 object using type-0 Object Size regardless of the object size
3532 type specified by the option. */
3538 }
3540 /* Validate memchr arguments without performing any expansion.
3541 Return NULL_RTX. */
3543 static rtx
3545 {
3553 /* Diagnose calls where the specified length exceeds the size
3554 of the object. */
3556 {
3560 }
3563 }
3565 /* Expand a call EXP to the memcpy builtin.
3566 Return NULL_RTX if we failed, the caller should emit a normal call,
3567 otherwise try to get the result in TARGET, if convenient (and in
3568 mode MODE if that's convenient). */
3570 static rtx
3572 {
3585 }
3587 /* Check a call EXP to the memmove built-in for validity.
3588 Return NULL_RTX on both success and failure. */
3590 static rtx
3592 {
3604 }
3606 /* Expand a call EXP to the mempcpy builtin.
3607 Return NULL_RTX if we failed; the caller should emit a normal call,
3608 otherwise try to get the result in TARGET, if convenient (and in
3609 mode MODE if that's convenient). If ENDP is 0 return the
3610 destination pointer, if ENDP is 1 return the end pointer ala
3611 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3612 stpcpy. */
3614 static rtx
3616 {
3625 /* Policy does not generally allow using compute_objsize (which
3626 is used internally by check_memop_size) to change code generation
3627 or drive optimization decisions.
3629 In this instance it is safe because the code we generate has
3630 the same semantics regardless of the return value of
3631 check_memop_sizes. Exactly the same amount of data is copied
3632 and the return value is exactly the same in both cases.
3634 Furthermore, check_memop_size always uses mode 0 for the call to
3635 compute_objsize, so the imprecise nature of compute_objsize is
3636 avoided. */
3638 /* Avoid expanding mempcpy into memcpy when the call is determined
3639 to overflow the buffer. This also prevents the same overflow
3640 from being diagnosed again when expanding memcpy. */
3646 }
3648 /* Helper function to do the actual work for expand of memory copy family
3649 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3650 of memory from SRC to DEST and assign to TARGET if convenient.
3651 If ENDP is 0 return the
3652 destination pointer, if ENDP is 1 return the end pointer ala
3653 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3654 stpcpy. */
3656 static rtx
3659 {
3670 /* If DEST is not a pointer type, call the normal function. */
3674 /* If either SRC is not a pointer type, don't do this
3675 operation in-line. */
3692 /* If SRC is a string constant and block move would be done
3693 by pieces, we can avoid loading the string from memory
3694 and only stored the computed constants. */
3701 {
3703 builtin_memcpy_read_str,
3709 }
3714 /* Copy word part most expediently. */
3727 {
3730 }
3733 {
3735 /* stpcpy pointer to last byte. */
3738 }
3741 }
3743 static rtx
3746 {
3748 endp);
3749 }
3751 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3752 we failed, the caller should emit a normal call, otherwise try to
3753 get the result in TARGET, if convenient. If ENDP is 0 return the
3754 destination pointer, if ENDP is 1 return the end pointer ala
3755 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3756 stpcpy. */
3758 static rtx
3760 {
3762 rtx dest_mem;
3763 rtx src_mem;
3771 {
3774 }
3783 {
3785 /* movstr is supposed to set end to the address of the NUL
3786 terminator. If the caller requested a mempcpy-like return value,
3787 adjust it. */
3789 {
3793 }
3794 }
3796 }
3798 /* Do some very basic size validation of a call to the strcpy builtin
3799 given by EXP. Return NULL_RTX to have the built-in expand to a call
3800 to the library function. */
3802 static rtx
3804 {
3812 /* There is no way here to determine the length of the string in
3813 the destination to which the SRC string is being appended so
3814 just diagnose cases when the souce string is longer than
3815 the destination object. */
3820 destsize);
3823 }
3825 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3826 NULL_RTX if we failed the caller should emit a normal call, otherwise
3827 try to get the result in TARGET, if convenient (and in mode MODE if that's
3828 convenient). */
3830 static rtx
3832 {
3840 {
3844 }
3847 {
3848 /* Check to see if the argument was declared attribute nonstring
3849 and if so, issue a warning since at this point it's not known
3850 to be nul-terminated. */
3854 }
3857 }
3859 /* Helper function to do the actual work for expand_builtin_strcpy. The
3860 arguments to the builtin_strcpy call DEST and SRC are broken out
3861 so that this can also be called without constructing an actual CALL_EXPR.
3862 The other arguments and return value are the same as for
3863 expand_builtin_strcpy. */
3865 static rtx
3867 {
3869 }
3871 /* Expand a call EXP to the stpcpy builtin.
3872 Return NULL_RTX if we failed the caller should emit a normal call,
3873 otherwise try to get the result in TARGET, if convenient (and in
3874 mode MODE if that's convenient). */
3876 static rtx
3878 {
3889 {
3893 }
3895 /* If return value is ignored, transform stpcpy into strcpy. */
3897 {
3901 }
3902 else
3903 {
3905 rtx ret;
3907 /* Ensure we get an actual string whose length can be evaluated at
3908 compile-time, not an expression containing a string. This is
3909 because the latter will potentially produce pessimized code
3910 when used to produce the return value. */
3922 {
3926 {
3930 {
3932 {
3935 else
3937 }
3946 }
3947 }
3948 }
3951 }
3952 }
3954 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
3955 arguments while being careful to avoid duplicate warnings (which could
3956 be issued if the expander were to expand the call, resulting in it
3957 being emitted in expand_call(). */
3959 static rtx
3961 {
3963 {
3964 /* The call has been successfully expanded. Check for nonstring
3965 arguments and issue warnings as appropriate. */
3968 }
3971 }
3973 /* Check a call EXP to the stpncpy built-in for validity.
3974 Return NULL_RTX on both success and failure. */
3976 static rtx
3978 {
3984 /* The source and destination of the call. */
3988 /* The exact number of bytes to write (not the maximum). */
3991 /* The size of the destination object. */
3997 }
3999 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4000 bytes from constant string DATA + OFFSET and return it as target
4001 constant. */
4003 rtx
4005 scalar_int_mode mode)
4006 {
4013 }
4015 /* Helper to check the sizes of sequences and the destination of calls
4016 to __builtin_strncat and __builtin___strncat_chk. Returns true on
4017 success (no overflow or invalid sizes), false otherwise. */
4019 static bool
4021 {
4026 /* Try to determine the range of lengths that the source expression
4027 refers to. */
4031 /* Try to verify that the destination is big enough for the shortest
4032 string. */
4035 {
4036 /* If it hasn't been provided by __strncat_chk, try to determine
4037 the size of the destination object into which the source is
4038 being copied. */
4040 }
4042 /* Add one for the terminating nul. */
4045 size_one_node)
4048 /* The strncat function copies at most MAXREAD bytes and always appends
4049 the terminating nul so the specified upper bound should never be equal
4050 to (or greater than) the size of the destination. */
4053 {
4062 }
4070 /* The number of bytes to write is LEN but check_access will also
4071 check SRCLEN if LEN's value isn't known. */
4073 objsize);
4074 }
4076 /* Similar to expand_builtin_strcat, do some very basic size validation
4077 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4078 the built-in expand to a call to the library function. */
4080 static rtx
4082 {
4090 /* The upper bound on the number of bytes to write. */
4092 /* The length of the source sequence. */
4095 /* Try to determine the range of lengths that the source expression
4096 refers to. */
4100 else
4103 /* Try to verify that the destination is big enough for the shortest
4104 string. First try to determine the size of the destination object
4105 into which the source is being copied. */
4108 /* Add one for the terminating nul. */
4111 size_one_node)
4114 /* The strncat function copies at most MAXREAD bytes and always appends
4115 the terminating nul so the specified upper bound should never be equal
4116 to (or greater than) the size of the destination. */
4119 {
4128 }
4136 /* The number of bytes to write is SRCLEN. */
4140 }
4142 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4143 NULL_RTX if we failed the caller should emit a normal call. */
4145 static rtx
4147 {
4152 {
4155 /* The number of bytes to write (not the maximum). */
4157 /* The length of the source sequence. */
4161 {
4165 /* The number of bytes to write is LEN but check_access will also
4166 check SLEN if LEN's value isn't known. */
4168 destsize);
4169 }
4171 /* We must be passed a constant len and src parameter. */
4177 /* We're required to pad with trailing zeros if the requested
4178 len is greater than strlen(s2)+1. In that case try to
4179 use store_by_pieces, if it fails, punt. */
4181 {
4184 rtx dest_mem;
4188 builtin_strncpy_read_str,
4195 builtin_strncpy_read_str,
4200 }
4201 }
4203 }
4205 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4206 bytes from constant string DATA + OFFSET and return it as target
4207 constant. */
4209 rtx
4211 scalar_int_mode mode)
4212 {
4219 }
4221 /* Callback routine for store_by_pieces. Return the RTL of a register
4222 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4223 char value given in the RTL register data. For example, if mode is
4224 4 bytes wide, return the RTL for 0x01010101*data. */
4226 static rtx
4228 scalar_int_mode mode)
4229 {
4245 }
4247 /* Expand expression EXP, which is a call to the memset builtin. Return
4248 NULL_RTX if we failed the caller should emit a normal call, otherwise
4249 try to get the result in TARGET, if convenient (and in mode MODE if that's
4250 convenient). */
4252 static rtx
4254 {
4266 }
4268 /* Helper function to do the actual work for expand_builtin_memset. The
4269 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4270 so that this can also be called without constructing an actual CALL_EXPR.
4271 The other arguments and return value are the same as for
4272 expand_builtin_memset. */
4274 static rtx
4277 {
4280 machine_mode val_mode;
4292 /* If DEST is not a pointer type, don't do this operation in-line. */
4303 /* If the LEN parameter is zero, return DEST. */
4305 {
4306 /* Evaluate and ignore VAL in case it has side-effects. */
4309 }
4311 /* Stabilize the arguments in case we fail. */
4323 {
4324 rtx val_rtx;
4329 /* Assume that we can memset by pieces if we can store
4330 * the coefficients by pieces (in the required modes).
4331 * We can't pass builtin_memset_gen_str as that emits RTL. */
4337 {
4342 }
4346 probable_max_size))
4352 }
4358 {
4369 probable_max_size))
4375 }
4383 probable_max_size);
4386 {
4389 }
4393 do_libcall:
4402 else
4407 }
4409 /* Expand expression EXP, which is a call to the bzero builtin. Return
4410 NULL_RTX if we failed the caller should emit a normal call. */
4412 static rtx
4414 {
4423 /* New argument list transforming bzero(ptr x, int y) to
4424 memset(ptr x, int 0, size_t y). This is done this way
4425 so that if it isn't expanded inline, we fallback to
4426 calling bzero instead of memset. */
4434 }
4436 /* Try to expand cmpstr operation ICODE with the given operands.
4437 Return the result rtx on success, otherwise return null. */
4439 static rtx
4441 HOST_WIDE_INT align)
4442 {
4456 }
4458 /* Expand expression EXP, which is a call to the memcmp built-in function.
4459 Return NULL_RTX if we failed and the caller should emit a normal call,
4460 otherwise try to get the result in TARGET, if convenient.
4461 RESULT_EQ is true if we can relax the returned value to be either zero
4462 or nonzero, without caring about the sign. */
4464 static rtx
4466 {
4477 /* Diagnose calls where the specified length exceeds the size of either
4478 object. */
4484 {
4489 }
4491 /* If the specified length exceeds the size of either object,
4492 call the function. */
4496 /* Due to the performance benefit, always inline the calls first
4497 when result_eq is false. */
4501 {
4505 }
4513 /* If we don't have POINTER_TYPE, call the function. */
4521 /* Set MEM_SIZE as appropriate. */
4523 {
4526 }
4532 {
4536 }
4538 /* If SRC is a string constant and block move would be done
4539 by pieces, we can avoid loading the string from memory
4540 and only stored the computed constants. */
4552 {
4553 /* Return the value in the proper mode for this function. */
4558 {
4561 }
4564 }
4567 }
4569 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4570 if we failed the caller should emit a normal call, otherwise try to get
4571 the result in TARGET, if convenient. */
4573 static rtx
4575 {
4579 /* Due to the performance benefit, always inline the calls first. */
4596 /* If we don't have POINTER_TYPE, call the function. */
4600 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4607 /* Try to call cmpstrsi. */
4612 /* Try to determine at least one length and call cmpstrnsi. */
4614 {
4615 tree len;
4616 rtx arg3_rtx;
4626 /* If we don't have a constant length for the first, use the length
4627 of the second, if we know it. We don't require a constant for
4628 this case; some cost analysis could be done if both are available
4629 but neither is constant. For now, assume they're equally cheap,
4630 unless one has side effects. If both strings have constant lengths,
4631 use the smaller. */
4647 else
4650 /* If both arguments have side effects, we cannot optimize. */
4652 {
4654 result = expand_cmpstrn_or_cmpmem
4657 }
4658 }
4662 {
4663 /* Check to see if the argument was declared attribute nonstring
4664 and if so, issue a warning since at this point it's not known
4665 to be nul-terminated. */
4668 /* Return the value in the proper mode for this function. */
4676 }
4678 /* Expand the library call ourselves using a stabilized argument
4679 list to avoid re-evaluating the function's arguments twice. */
4684 }
4686 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4687 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4688 the result in TARGET, if convenient. */
4690 static rtx
4692 ATTRIBUTE_UNUSED machine_mode mode)
4693 {
4698 /* Due to the performance benefit, always inline the calls first. */
4704 /* If c_strlen can determine an expression for one of the string
4705 lengths, and it doesn't have side effects, then emit cmpstrnsi
4706 using length MIN(strlen(string)+1, arg3). */
4711 tree len;
4732 /* If we don't have a constant length for the first, use the length
4733 of the second, if we know it. If neither string is constant length,
4734 use the given length argument. We don't require a constant for
4735 this case; some cost analysis could be done if both are available
4736 but neither is constant. For now, assume they're equally cheap,
4737 unless one has side effects. If both strings have constant lengths,
4738 use the smaller. */
4756 else
4759 /* If we are not using the given length, we must incorporate it here.
4760 The actual new length parameter will be MIN(len,arg3) in this case. */
4762 {
4765 }
4775 {
4776 /* Check to see if the argument was declared attribute nonstring
4777 and if so, issue a warning since at this point it's not known
4778 to be nul-terminated. */
4781 /* Return the value in the proper mode for this function. */
4789 }
4791 /* Expand the library call ourselves using a stabilized argument
4792 list to avoid re-evaluating the function's arguments twice. */
4797 }
4799 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4800 if that's convenient. */
4802 rtx
4804 {
4805 rtx val;
4808 /* Don't do __builtin_saveregs more than once in a function.
4809 Save the result of the first call and reuse it. */
4813 /* When this function is called, it means that registers must be
4814 saved on entry to this function. So we migrate the call to the
4815 first insn of this function. */
4819 /* Do whatever the machine needs done in this case. */
4827 /* Put the insns after the NOTE that starts the function. If this
4828 is inside a start_sequence, make the outer-level insn chain current, so
4829 the code is placed at the start of the function. */
4835 }
4837 /* Expand a call to __builtin_next_arg. */
4839 static rtx
4841 {
4842 /* Checking arguments is already done in fold_builtin_next_arg
4843 that must be called before this function. */
4848 }
4850 /* Make it easier for the backends by protecting the valist argument
4851 from multiple evaluations. */
4853 static tree
4855 {
4858 /* The current way of determining the type of valist is completely
4859 bogus. We should have the information on the va builtin instead. */
4864 {
4868 /* For this case, the backends will be expecting a pointer to
4869 vatype, but it's possible we've actually been given an array
4870 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4871 So fix it. */
4873 {
4876 }
4877 }
4878 else
4879 {
4883 {
4889 }
4895 }
4898 }
4900 /* The "standard" definition of va_list is void*. */
4902 tree
4904 {
4906 }
4908 /* The "standard" abi va_list is va_list_type_node. */
4910 tree
4912 {
4914 }
4916 /* The "standard" type of va_list is va_list_type_node. */
4918 tree
4920 {
4927 {
4928 /* If va_list is an array type, the argument may have decayed
4929 to a pointer type, e.g. by being passed to another function.
4930 In that case, unwrap both types so that we can compare the
4931 underlying records. */
4934 {
4937 }
4938 }
4943 }
4945 /* The "standard" implementation of va_start: just assign `nextarg' to
4946 the variable. */
4948 void
4950 {
4953 }
4955 /* Expand EXP, a call to __builtin_va_start. */
4957 static rtx
4959 {
4960 rtx nextarg;
4961 tree valist;
4965 {
4968 }
4978 else
4982 }
4984 /* Expand EXP, a call to __builtin_va_end. */
4986 static rtx
4988 {
4991 /* Evaluate for side effects, if needed. I hate macros that don't
4992 do that. */
4997 }
4999 /* Expand EXP, a call to __builtin_va_copy. We do this as a
5000 builtin rather than just as an assignment in stdarg.h because of the
5001 nastiness of array-type va_list types. */
5003 static rtx
5005 {
5018 {
5022 }
5023 else
5024 {
5027 /* Evaluate to pointers. */
5036 /* "Dereference" to BLKmode memories. */
5044 /* Copy. */
5046 }
5049 }
5051 /* Expand a call to one of the builtin functions __builtin_frame_address or
5052 __builtin_return_address. */
5054 static rtx
5056 {
5057 /* The argument must be a nonnegative integer constant.
5058 It counts the number of frames to scan up the stack.
5059 The value is either the frame pointer value or the return
5060 address saved in that frame. */
5062 /* Warning about missing arg was already issued. */
5065 {
5068 }
5069 else
5070 {
5071 /* Number of frames to scan up the stack. */
5076 /* Some ports cannot access arbitrary stack frames. */
5078 {
5081 }
5084 {
5085 /* Warn since no effort is made to ensure that any frame
5086 beyond the current one exists or can be safely reached. */
5089 }
5091 /* For __builtin_frame_address, return what we've got. */
5099 }
5100 }
5102 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5103 failed and the caller should emit a normal call. */
5105 static rtx
5107 {
5108 rtx op0;
5109 rtx result;
5112 HOST_WIDE_INT max_size;
5115 bool valid_arglist
5118 VOID_TYPE)
5129 || (!alloca_for_var
5132 ))
5133 {
5134 /* -Walloca-larger-than and -Wvla-larger-than settings of
5135 less than HOST_WIDE_INT_MAX override the more general
5136 -Walloc-size-larger-than so unless either of the former
5137 options is smaller than the last one (wchich would imply
5138 that the call was already checked), check the alloca
5139 arguments for overflow. */
5143 }
5145 /* Compute the argument. */
5148 /* Compute the alignment. */
5150 ? BIGGEST_ALIGNMENT
5153 /* Compute the maximum size. */
5158 /* Allocate the desired space. If the allocation stems from the declaration
5159 of a variable-sized object, it cannot accumulate. */
5160 result
5165 }
5167 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5168 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5169 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5170 handle_builtin_stack_restore function. */
5172 static rtx
5174 {
5181 OPTAB_LIB_WIDEN);
5184 OPTAB_LIB_WIDEN);
5189 }
5191 /* Expand a call to bswap builtin in EXP.
5192 Return NULL_RTX if a normal call should be emitted rather than expanding the
5193 function in-line. If convenient, the result should be placed in TARGET.
5194 SUBTARGET may be used as the target for computing one of EXP's operands. */
5196 static rtx
5198 rtx subtarget)
5199 {
5200 tree arg;
5201 rtx op0;
5219 }
5221 /* Expand a call to a unary builtin in EXP.
5222 Return NULL_RTX if a normal call should be emitted rather than expanding the
5223 function in-line. If convenient, the result should be placed in TARGET.
5224 SUBTARGET may be used as the target for computing one of EXP's operands. */
5226 static rtx
5229 {
5230 rtx op0;
5235 /* Compute the argument. */
5237 (subtarget
5241 /* Compute op, into TARGET if possible.
5242 Set TARGET to wherever the result comes back. */
5248 }
5250 /* Expand a call to __builtin_expect. We just return our argument
5251 as the builtin_expect semantic should've been already executed by
5252 tree branch prediction pass. */
5254 static rtx
5256 {
5257 tree arg;
5264 /* When guessing was done, the hints should be already stripped away. */
5268 }
5270 /* Expand a call to __builtin_expect_with_probability. We just return our
5271 argument as the builtin_expect semantic should've been already executed by
5272 tree branch prediction pass. */
5274 static rtx
5276 {
5277 tree arg;
5284 /* When guessing was done, the hints should be already stripped away. */
5288 }
5291 /* Expand a call to __builtin_assume_aligned. We just return our first
5292 argument as the builtin_assume_aligned semantic should've been already
5293 executed by CCP. */
5295 static rtx
5297 {
5301 EXPAND_NORMAL);
5306 }
5308 void
5310 {
5312 {
5314 /* For trap insns when not accumulating outgoing args force
5315 REG_ARGS_SIZE note to prevent crossjumping of calls with
5316 different args sizes. */
5319 }
5320 else
5321 {
5325 }
5328 }
5330 /* Expand a call to __builtin_unreachable. We do nothing except emit
5331 a barrier saying that control flow will not pass here.
5333 It is the responsibility of the program being compiled to ensure
5334 that control flow does never reach __builtin_unreachable. */
5335 static void
5337 {
5339 }
5341 /* Expand EXP, a call to fabs, fabsf or fabsl.
5342 Return NULL_RTX if a normal call should be emitted rather than expanding
5343 the function inline. If convenient, the result should be placed
5344 in TARGET. SUBTARGET may be used as the target for computing
5345 the operand. */
5347 static rtx
5349 {
5350 machine_mode mode;
5351 tree arg;
5352 rtx op0;
5362 }
5364 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5365 Return NULL is a normal call should be emitted rather than expanding the
5366 function inline. If convenient, the result should be placed in TARGET.
5367 SUBTARGET may be used as the target for computing the operand. */
5369 static rtx
5371 {
5373 tree arg;
5385 }
5387 /* Expand a call to __builtin___clear_cache. */
5389 static rtx
5391 {
5393 {
5394 #ifdef CLEAR_INSN_CACHE
5395 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5396 does something. Just do the default expansion to a call to
5397 __clear_cache(). */
5399 #else
5400 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5401 does nothing. There is no need to call it. Do nothing. */
5404 }
5406 /* We have a "clear_cache" insn, and it will handle everything. */
5410 /* We must not expand to a library call. If we did, any
5411 fallback library function in libgcc that might contain a call to
5412 __builtin___clear_cache() would recurse infinitely. */
5414 {
5417 }
5420 {
5433 }
5435 }
5437 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5439 static rtx
5441 {
5444 /* If we don't need too much alignment, we'll have been guaranteed
5445 proper alignment by get_trampoline_type. */
5449 /* Round address up to desired boundary. */
5460 }
5462 static rtx
5464 {
5480 /* If ONSTACK, the TRAMP argument should be the address of a field
5481 within the local function's FRAME decl. Either way, let's see if
5482 we can fill in the MEM_ATTRs for this memory. */
5486 /* Creator of a heap trampoline is responsible for making sure the
5487 address is aligned to at least STACK_BOUNDARY. Normally malloc
5488 will ensure this anyhow. */
5491 {
5495 }
5497 /* The FUNC argument should be the address of the nested function.
5498 Extract the actual function decl to pass to the hook. */
5505 /* Generate insns to initialize the trampoline. */
5509 {
5515 }
5518 }
5520 static rtx
5522 {
5523 rtx tramp;
5534 }
5536 /* Expand a call to the builtin descriptor initialization routine.
5537 A descriptor is made up of a couple of pointers to the static
5538 chain and the code entry in this order. */
5540 static rtx
5542 {
5547 VOID_TYPE))
5561 /* Generate insns to initialize the descriptor. */
5567 }
5569 /* Expand a call to the builtin descriptor adjustment routine. */
5571 static rtx
5573 {
5574 rtx tramp;
5581 /* Unalign the descriptor to allow runtime identification. */
5586 }
5588 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5589 function. The function first checks whether the back end provides
5590 an insn to implement signbit for the respective mode. If not, it
5591 checks whether the floating point format of the value is such that
5592 the sign bit can be extracted. If that is not the case, error out.
5593 EXP is the expression that is a call to the builtin function; if
5594 convenient, the result should be placed in TARGET. */
5595 static rtx
5597 {
5599 scalar_float_mode fmode;
5601 tree arg;
5604 rtx temp;
5617 /* Expand the argument yielding a RTX expression. */
5620 /* Check if the back end provides an insn that handles signbit for the
5621 argument's mode. */
5624 {
5630 }
5632 /* For floating point formats without a sign bit, implement signbit
5633 as "ARG < 0.0". */
5636 {
5637 /* But we can't do this if the format supports signed zero. */
5643 }
5646 {
5649 }
5650 else
5651 {
5653 /* Handle targets with different FP word orders. */
5656 else
5660 }
5662 /* Force the intermediate word_mode (or narrower) result into a
5663 register. This avoids attempting to create paradoxical SUBREGs
5664 of floating point modes below. */
5667 /* If the bitpos is within the "result mode" lowpart, the operation
5668 can be implement with a single bitwise AND. Otherwise, we need
5669 a right shift and an AND. */
5672 {
5680 }
5681 else
5682 {
5683 /* Perform a logical right shift to place the signbit in the least
5684 significant bit, then truncate the result to the desired mode
5685 and mask just this bit. */
5690 }
5693 }
5695 /* Expand fork or exec calls. TARGET is the desired target of the
5696 call. EXP is the call. FN is the
5697 identificator of the actual function. IGNORE is nonzero if the
5698 value is to be ignored. */
5700 static rtx
5702 {
5704 tree call;
5706 /* If we are not profiling, just call the function. */
5710 /* Otherwise call the wrapper. This should be equivalent for the rest of
5711 compiler, so the code does not diverge, and the wrapper may run the
5712 code necessary for keeping the profiling sane. */
5715 {
5746 }
5758 }
5761 \f
5762 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5763 the pointer in these functions is void*, the tree optimizers may remove
5764 casts. The mode computed in expand_builtin isn't reliable either, due
5765 to __sync_bool_compare_and_swap.
5767 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5768 group of builtins. This gives us log2 of the mode size. */
5772 {
5773 /* The size is not negotiable, so ask not to get BLKmode in return
5774 if the target indicates that a smaller size would be better. */
5776 }
5778 /* Expand the memory expression LOC and return the appropriate memory operand
5779 for the builtin_sync operations. */
5781 static rtx
5783 {
5789 /* Note that we explicitly do not want any alias information for this
5790 memory, so that we kill all other live memories. Otherwise we don't
5791 satisfy the full barrier semantics of the intrinsic. */
5794 /* The alignment needs to be at least according to that of the mode. */
5801 }
5803 /* Make sure an argument is in the right mode.
5804 EXP is the tree argument.
5805 MODE is the mode it should be in. */
5807 static rtx
5809 {
5810 rtx val;
5811 machine_mode old_mode;
5814 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5815 of CONST_INTs, where we know the old_mode only from the call argument. */
5822 }
5825 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5826 EXP is the CALL_EXPR. CODE is the rtx code
5827 that corresponds to the arithmetic or logical operation from the name;
5828 an exception here is that NOT actually means NAND. TARGET is an optional
5829 place for us to store the results; AFTER is true if this is the
5830 fetch_and_xxx form. */
5832 static rtx
5835 rtx target)
5836 {
5841 {
5848 {
5877 }
5878 }
5880 /* Expand the operands. */
5885 after);
5886 }
5888 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5889 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5890 true if this is the boolean form. TARGET is a place for us to store the
5891 results; this is NOT optional if IS_BOOL is true. */
5893 static rtx
5896 {
5900 /* Expand the operands. */
5907 {
5910 else
5912 }
5915 MEMMODEL_SYNC_SEQ_CST))
5919 }
5921 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5922 general form is actually an atomic exchange, and some targets only
5923 support a reduced form with the second argument being a constant 1.
5924 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5925 the results. */
5927 static rtx
5929 rtx target)
5930 {
5933 /* Expand the operands. */
5938 }
5940 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5942 static void
5944 {
5945 rtx mem;
5947 /* Expand the operands. */
5951 }
5953 /* Given an integer representing an ``enum memmodel'', verify its
5954 correctness and return the memory model enum. */
5956 static enum memmodel
5958 {
5959 rtx op;
5961 source_location loc
5964 /* If the parameter is not a constant, it's a run time value so we'll just
5965 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5975 {
5979 }
5981 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5983 {
5987 }
5989 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5990 be conservative and promote consume to acquire. */
5995 }
5997 /* Expand the __atomic_exchange intrinsic:
5998 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5999 EXP is the CALL_EXPR.
6000 TARGET is an optional place for us to store the results. */
6002 static rtx
6004 {
6013 /* Expand the operands. */
6018 }
6020 /* Expand the __atomic_compare_exchange intrinsic:
6021 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
6022 TYPE desired, BOOL weak,
6023 enum memmodel success,
6024 enum memmodel failure)
6025 EXP is the CALL_EXPR.
6026 TARGET is an optional place for us to store the results. */
6028 static rtx
6030 rtx target)
6031 {
6035 tree weak;
6037 source_location loc
6044 {
6046 "failure memory model cannot be stronger than success "
6049 }
6052 {
6054 "invalid failure memory model for "
6058 }
6064 /* Expand the operands. */
6080 /* Lest the rtl backend create a race condition with an imporoper store
6081 to memory, always create a new pseudo for OLDVAL. */
6088 /* Conditionally store back to EXPECT, lest we create a race condition
6089 with an improper store to memory. */
6090 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6091 the normal case where EXPECT is totally private, i.e. a register. At
6092 which point the store can be unconditional. */
6100 }
6102 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6103 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6104 call. The weak parameter must be dropped to match the expected parameter
6105 list and the expected argument changed from value to pointer to memory
6106 slot. */
6108 static void
6110 {
6126 /* Skip the boolean weak parameter. */
6129 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6132 built_in_function fncode
6137 fndecl);
6142 {
6149 }
6150 }
6152 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6154 void
6156 {
6162 tree lhs;
6164 source_location loc
6171 {
6173 "failure memory model cannot be stronger than success "
6176 }
6179 {
6181 "invalid failure memory model for "
6185 }
6188 {
6191 }
6193 /* Expand the operands. */
6206 {
6209 }
6213 {
6219 }
6220 }
6222 /* Expand the __atomic_load intrinsic:
6223 TYPE __atomic_load (TYPE *object, enum memmodel)
6224 EXP is the CALL_EXPR.
6225 TARGET is an optional place for us to store the results. */
6227 static rtx
6229 {
6230 rtx mem;
6235 {
6236 source_location loc
6241 }
6246 /* Expand the operand. */
6250 }
6253 /* Expand the __atomic_store intrinsic:
6254 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6255 EXP is the CALL_EXPR.
6256 TARGET is an optional place for us to store the results. */
6258 static rtx
6260 {
6267 {
6268 source_location loc
6273 }
6278 /* Expand the operands. */
6283 }
6285 /* Expand the __atomic_fetch_XXX intrinsic:
6286 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6287 EXP is the CALL_EXPR.
6288 TARGET is an optional place for us to store the results.
6289 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6290 FETCH_AFTER is true if returning the result of the operation.
6291 FETCH_AFTER is false if returning the value before the operation.
6292 IGNORE is true if the result is not used.
6293 EXT_CALL is the correct builtin for an external call if this cannot be
6294 resolved to an instruction sequence. */
6296 static rtx
6300 {
6303 tree fndecl;
6304 tree addr;
6308 /* Expand the operands. */
6312 /* Only try generating instructions if inlining is turned on. */
6314 {
6318 }
6320 /* Return if a different routine isn't needed for the library call. */
6324 /* Change the call to the specified function. */
6332 /* If we will emit code after the call, the call can not be a tail call.
6333 If it is emitted as a tail call, a barrier is emitted after it, and
6334 then all trailing code is removed. */
6338 /* Expand the call here so we can emit trailing code. */
6341 /* Replace the original function just in case it matters. */
6344 /* Then issue the arithmetic correction to return the right result. */
6346 {
6348 {
6350 OPTAB_LIB_WIDEN);
6352 }
6353 else
6355 OPTAB_LIB_WIDEN);
6356 }
6358 }
6360 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6362 void
6364 {
6372 optab optab;
6384 {
6399 }
6402 {
6409 }
6431 {
6436 }
6437 else
6439 OPTAB_DIRECT);
6442 }
6444 /* Expand an atomic clear operation.
6445 void _atomic_clear (BOOL *obj, enum memmodel)
6446 EXP is the call expression. */
6448 static rtx
6450 {
6451 machine_mode mode;
6460 {
6461 source_location loc
6466 }
6468 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6469 Failing that, a store is issued by __atomic_store. The only way this can
6470 fail is if the bool type is larger than a word size. Unlikely, but
6471 handle it anyway for completeness. Assume a single threaded model since
6472 there is no atomic support in this case, and no barriers are required. */
6477 }
6479 /* Expand an atomic test_and_set operation.
6480 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6481 EXP is the call expression. */
6483 static rtx
6485 {
6486 rtx mem;
6488 machine_mode mode;
6495 }
6498 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6499 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6501 static tree
6503 {
6505 machine_mode mode;
6511 /* We need a corresponding integer mode for the access to be lock-free. */
6519 {
6522 /* Either this argument is null, or it's a fake pointer encoding
6523 the alignment of the object. */
6529 else
6531 }
6532 else
6533 {
6536 /* This function is usually invoked and folded immediately by the front
6537 end before anything else has a chance to look at it. The pointer
6538 parameter at this point is usually cast to a void *, so check for that
6539 and look past the cast. */
6549 /* Get the underlying type of the object. */
6552 }
6554 /* If the object has smaller alignment, the lock free routines cannot
6555 be used. */
6559 /* Check if a compare_and_swap pattern exists for the mode which represents
6560 the required size. The pattern is not allowed to fail, so the existence
6561 of the pattern indicates support is present. Also require that an
6562 atomic load exists for the required size. */
6565 else
6567 }
6569 /* Return true if the parameters to call EXP represent an object which will
6570 always generate lock free instructions. The first argument represents the
6571 size of the object, and the second parameter is a pointer to the object
6572 itself. If NULL is passed for the object, then the result is based on
6573 typical alignment for an object of the specified size. Otherwise return
6574 false. */
6576 static rtx
6578 {
6579 tree size;
6584 {
6587 }
6593 }
6595 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6596 is lock free on this architecture. */
6598 static tree
6600 {
6604 /* If it isn't always lock free, don't generate a result. */
6609 }
6611 /* Return true if the parameters to call EXP represent an object which will
6612 always generate lock free instructions. The first argument represents the
6613 size of the object, and the second parameter is a pointer to the object
6614 itself. If NULL is passed for the object, then the result is based on
6615 typical alignment for an object of the specified size. Otherwise return
6616 NULL*/
6618 static rtx
6620 {
6621 tree size;
6626 {
6629 }
6634 /* If the value is known at compile time, return the RTX for it. */
6640 }
6642 /* Expand the __atomic_thread_fence intrinsic:
6643 void __atomic_thread_fence (enum memmodel)
6644 EXP is the CALL_EXPR. */
6646 static void
6648 {
6651 }
6653 /* Expand the __atomic_signal_fence intrinsic:
6654 void __atomic_signal_fence (enum memmodel)
6655 EXP is the CALL_EXPR. */
6657 static void
6659 {
6662 }
6664 /* Expand the __sync_synchronize intrinsic. */
6666 static void
6668 {
6670 }
6672 static rtx
6674 {
6680 {
6682 /* If the target is not sutitable then create a new target. */
6690 }
6693 }
6695 static void
6697 {
6703 {
6710 }
6712 }
6714 \f
6715 /* Emit code to restore the current value of stack. */
6717 static void
6719 {
6731 }
6733 /* Emit code to save the current value of stack. */
6735 static rtx
6737 {
6742 }
6744 /* Emit code to get the openacc gang, worker or vector id or size. */
6746 static rtx
6748 {
6750 rtx fallback_retval;
6753 {
6766 }
6769 {
6772 }
6776 {
6779 }
6783 {
6791 }
6800 {
6803 }
6811 }
6813 /* Expand a string compare operation using a sequence of char comparison
6814 to get rid of the calling overhead, with result going to TARGET if
6815 that's convenient.
6817 VAR_STR is the variable string source;
6818 CONST_STR is the constant string source;
6819 LENGTH is the number of chars to compare;
6820 CONST_STR_N indicates which source string is the constant string;
6821 IS_MEMCMP indicates whether it's a memcmp or strcmp.
6823 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
6825 target = (int) (unsigned char) var_str[0]
6826 - (int) (unsigned char) const_str[0];
6827 if (target != 0)
6828 goto ne_label;
6829 ...
6830 target = (int) (unsigned char) var_str[length - 2]
6831 - (int) (unsigned char) const_str[length - 2];
6832 if (target != 0)
6833 goto ne_label;
6834 target = (int) (unsigned char) var_str[length - 1]
6835 - (int) (unsigned char) const_str[length - 1];
6836 ne_label:
6837 */
6839 static rtx
6843 {
6845 rtx var_rtx_array
6852 scalar_int_mode unit_mode
6858 {
6859 var_rtx
6873 }
6881 }
6883 /* Inline expansion a call to str(n)cmp, with result going to
6884 TARGET if that's convenient.
6885 If the call is not been inlined, return NULL_RTX. */
6886 static rtx
6888 {
6894 /* Do NOT apply this inlining expansion when optimizing for size or
6895 optimization level below 2. */
6903 /* On a target where the type of the call (int) has same or narrower presicion
6904 than unsigned char, give up the inlining expansion. */
6920 /* If neither strings is constant string, the call is not qualify. */
6924 /* For strncmp, if the length is not a const, not qualify. */
6935 else
6944 /* If the length of the comparision is larger than the threshold,
6945 do nothing. */
6952 /* Now, start inline expansion the call. */
6956 }
6958 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
6959 represents the size of the first argument to that call, or VOIDmode
6960 if the argument is a pointer. IGNORE will be true if the result
6961 isn't used. */
6962 static rtx
6965 {
6972 {
6975 }
6979 /* An optional second argument can be used as a failsafe value on
6980 some machines. If it isn't present, then the failsafe value is
6981 assumed to be 0. */
6983 {
6986 }
6987 else
6990 /* If the result isn't used, the behavior is undefined. It would be
6991 nice to emit a warning here, but path splitting means this might
6992 happen with legitimate code. So simply drop the builtin
6993 expansion in that case; we've handled any side-effects above. */
6997 /* If we don't have a suitable target, create one to hold the result. */
7005 }
7007 /* Expand an expression EXP that calls a built-in function,
7008 with result going to TARGET if that's convenient
7009 (and in mode MODE if that's convenient).
7010 SUBTARGET may be used as the target for computing one of EXP's operands.
7011 IGNORE is nonzero if the value is to be ignored. */
7013 rtx
7016 {
7025 /* When ASan is enabled, we don't want to expand some memory/string
7026 builtins and rely on libsanitizer's hooks. This allows us to avoid
7027 redundant checks and be sure, that possible overflow will be detected
7028 by ASan. */
7033 /* When not optimizing, generate calls to library functions for a certain
7034 set of builtins. */
7048 /* The built-in function expanders test for target == const0_rtx
7049 to determine whether the function's result will be ignored. */
7053 /* If the result of a pure or const built-in function is ignored, and
7054 none of its arguments are volatile, we can avoid expanding the
7055 built-in call and just evaluate the arguments for side-effects. */
7059 {
7061 tree arg;
7062 call_expr_arg_iterator iter;
7066 {
7069 }
7072 {
7076 }
7077 }
7080 {
7098 /* Just do a normal library call if we were unable to fold
7099 the values. */
7176 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7177 FUNCTION with a copy of the parameters described by
7178 ARGUMENTS, and ARGSIZE. It returns a block of memory
7179 allocated on the stack into which is stored all the registers
7180 that might possibly be used for returning the result of a
7181 function. ARGUMENTS is the value returned by
7182 __builtin_apply_args. ARGSIZE is the number of bytes of
7183 arguments that must be copied. ??? How should this value be
7184 computed? We'll also need a safe worst case value for varargs
7185 functions. */
7192 else
7193 {
7201 }
7203 /* __builtin_return (RESULT) causes the function to return the
7204 value described by RESULT. RESULT is address of the block of
7205 memory returned by __builtin_apply. */
7215 /* All valid uses of __builtin_va_arg_pack () are removed during
7216 inlining. */
7221 /* All valid uses of __builtin_va_arg_pack_len () are removed during
7222 inlining. */
7226 /* Return the address of the first anonymous stack arg. */
7248 /* Returns the address of the area where the structure is returned.
7249 0 otherwise. */
7255 else
7258 CASE_BUILT_IN_ALLOCA:
7408 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7409 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7410 when changing it to a strcmp call. */
7416 /* Change this call back to a BUILT_IN_STRCMP. */
7420 /* Delete the last parameter. */
7427 /* FALLTHROUGH */
7435 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7436 back to a BUILT_IN_STRNCMP. */
7442 /* Change it back to a BUILT_IN_STRNCMP. */
7445 /* FALLTHROUGH */
7460 {
7463 }
7467 /* This should have been lowered to the builtins below. */
7471 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7472 and the receiver label. */
7474 {
7480 /* This is copied from the handling of non-local gotos. */
7482 nonlocal_goto_handler_labels
7484 nonlocal_goto_handler_labels);
7485 /* ??? Do not let expand_label treat us as such since we would
7486 not want to be both on the list of non-local labels and on
7487 the list of forced labels. */
7490 }
7494 /* __builtin_setjmp_receiver is passed the receiver label. */
7496 {
7502 }
7505 /* __builtin_longjmp is passed a pointer to an array of five words.
7506 It's similar to the C library longjmp function but works with
7507 __builtin_setjmp above. */
7510 {
7516 {
7519 }
7523 }
7532 /* This updates the setjmp buffer that is its argument with the value
7533 of the current stack pointer. */
7536 {
7537 rtx buf_addr
7542 }
7562 /* Various hooks for the DWARF 2 __throw routine. */
7568 #ifdef DWARF2_UNWIND_INFO
7574 #endif
7776 mode = get_builtin_sync_mode
7788 mode = get_builtin_sync_mode
7835 {
7839 mode =
7845 /* If this is turned into an external library call, the weak parameter
7846 must be dropped to match the expected parameter list. */
7851 /* Skip the boolean weak parameter. */
7856 }
7885 {
7895 }
7901 {
7911 }
7917 {
7927 }
7933 {
7943 }
7949 {
7959 }
7965 {
7975 }
8112 /* Do library call, if we failed to expand the builtin when
8113 folding. */
8133 }
8135 /* The switch statement above can drop through to cause the function
8136 to be called normally. */
8138 }
8140 /* Determine whether a tree node represents a call to a built-in
8141 function. If the tree T is a call to a built-in function with
8142 the right number of arguments of the appropriate types, return
8143 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8144 Otherwise the return value is END_BUILTINS. */
8146 enum built_in_function
8148 {
8151 const_call_expr_arg_iterator iter;
8166 {
8167 /* If a function doesn't take a variable number of arguments,
8168 the last element in the list will have type `void'. */
8171 {
8175 }
8184 {
8187 }
8189 {
8192 }
8194 {
8197 }
8199 {
8202 }
8203 else
8205 }
8207 /* Variable-length argument list. */
8209 }
8211 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
8212 evaluate to a constant. */
8214 static tree
8216 {
8217 /* We return 1 for a numeric type that's known to be a constant
8218 value at compile-time or for an aggregate type that's a
8219 literal constant. */
8222 /* If we know this is a constant, emit the constant of one. */
8228 {
8235 }
8237 /* If this expression has side effects, show we don't know it to be a
8238 constant. Likewise if it's a pointer or aggregate type since in
8239 those case we only want literals, since those are only optimized
8240 when generating RTL, not later.
8241 And finally, if we are compiling an initializer, not code, we
8242 need to return a definite result now; there's not going to be any
8243 more optimization done. */
8248 || folding_initializer
8253 }
8255 /* Create builtin_expect or builtin_expect_with_probability
8256 with PRED and EXPECTED as its arguments and return it as a truthvalue.
8257 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
8258 builtin_expect_with_probability instead uses third argument as PROBABILITY
8259 value. */
8261 static tree
8264 {
8279 else
8281 predictor);
8285 }
8287 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
8288 NULL_TREE if no simplification is possible. */
8290 tree
8292 tree arg3)
8293 {
8297 /* Distribute the expected value over short-circuiting operators.
8298 See through the cast from truthvalue_type_node to long. */
8305 /* If this is a builtin_expect within a builtin_expect keep the
8306 inner one. See through a comparison against a constant. It
8307 might have been added to create a thruthvalue. */
8318 BUILT_IN_EXPECT_WITH_PROBABILITY)))
8324 {
8334 }
8336 /* If the argument isn't invariant then there's nothing else we can do. */
8340 /* If we expect that a comparison against the argument will fold to
8341 a constant return the constant. In practice, this means a true
8342 constant or the address of a non-weak symbol. */
8346 {
8347 do
8348 {
8350 }
8355 }
8357 /* Otherwise, ARG0 already has the proper type for the return value. */
8359 }
8361 /* Fold a call to __builtin_classify_type with argument ARG. */
8363 static tree
8365 {
8370 }
8372 /* Fold a call to __builtin_strlen with argument ARG. */
8374 static tree
8376 {
8379 else
8380 {
8387 }
8388 }
8390 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8392 static tree
8394 {
8395 REAL_VALUE_TYPE real;
8397 /* __builtin_inff is intended to be usable to define INFINITY on all
8398 targets. If an infinity is not available, INFINITY expands "to a
8399 positive constant of type float that overflows at translation
8400 time", footnote "In this case, using INFINITY will violate the
8401 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8402 Thus we pedwarn to ensure this constraint violation is
8403 diagnosed. */
8409 }
8411 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8412 NULL_TREE if no simplification can be made. */
8414 static tree
8417 {
8418 tree type;
8428 /* Calculate the result when the argument is a constant. */
8433 /* Canonicalize sincos to cexpi. */
8435 {
8438 }
8440 {
8447 }
8459 }
8461 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8462 Return NULL_TREE if no simplification can be made. */
8464 static tree
8466 {
8472 /* If the LEN parameter is zero, return zero. */
8477 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8481 /* If len parameter is one, return an expression corresponding to
8482 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8484 {
8486 tree cst_uchar_ptr_node
8489 tree ind1
8493 cst_uchar_ptr_node,
8494 arg1)));
8495 tree ind2
8499 cst_uchar_ptr_node,
8500 arg2)));
8502 }
8505 }
8507 /* Fold a call to builtin isascii with argument ARG. */
8509 static tree
8511 {
8514 else
8515 {
8516 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8522 }
8523 }
8525 /* Fold a call to builtin toascii with argument ARG. */
8527 static tree
8529 {
8533 /* Transform toascii(c) -> (c & 0x7f). */
8536 }
8538 /* Fold a call to builtin isdigit with argument ARG. */
8540 static tree
8542 {
8545 else
8546 {
8547 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8548 /* According to the C standard, isdigit is unaffected by locale.
8549 However, it definitely is affected by the target character set. */
8550 unsigned HOST_WIDE_INT target_digit0
8561 }
8562 }
8564 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8566 static tree
8568 {
8574 }
8576 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8578 static tree
8580 {
8586 }
8588 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8590 static tree
8592 {
8595 {
8599 {
8604 }
8605 }
8608 }
8610 /* Fold a call to builtin frexp, we can assume the base is 2. */
8612 static tree
8614 {
8625 /* Proceed if a valid pointer type was passed in. */
8627 {
8632 {
8634 /* For +-0, return (*exp = 0, +-0). */
8640 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8643 {
8644 /* Since the frexp function always expects base 2, and in
8645 GCC normalized significands are already in the range
8646 [0.5, 1.0), we have exactly what frexp wants. */
8651 }
8655 }
8657 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8661 }
8664 }
8666 /* Fold a call to builtin modf. */
8668 static tree
8670 {
8681 /* Proceed if a valid pointer type was passed in. */
8683 {
8688 {
8691 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8695 /* For +-Inf, return (*arg1 = arg0, +-0). */
8701 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8704 /* If the original number was negative and already
8705 integral, then the fractional part is -0.0. */
8709 }
8711 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8717 }
8720 }
8722 /* Given a location LOC, an interclass builtin function decl FNDECL
8723 and its single argument ARG, return an folded expression computing
8724 the same, or NULL_TREE if we either couldn't or didn't want to fold
8725 (the latter happen if there's an RTL instruction available). */
8727 static tree
8729 {
8730 machine_mode mode;
8742 /* If there is no optab, try generic code. */
8744 {
8745 tree result;
8748 {
8749 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8752 REAL_VALUE_TYPE r;
8756 {
8757 /* NaN and Inf are encoded in the high-order double value
8758 only. The low-order value is not significant. */
8762 }
8769 }
8772 {
8773 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8776 REAL_VALUE_TYPE r;
8780 {
8781 /* NaN and Inf are encoded in the high-order double value
8782 only. The low-order value is not significant. */
8786 }
8792 /*result = fold_build2_loc (loc, UNGT_EXPR,
8793 TREE_TYPE (TREE_TYPE (fndecl)),
8794 fold_build1_loc (loc, ABS_EXPR, type, arg),
8795 build_real (type, r));
8796 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8797 TREE_TYPE (TREE_TYPE (fndecl)),
8798 result);*/
8800 }
8802 {
8803 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8804 islessequal(fabs(x),DBL_MAX). */
8814 {
8815 /* Use double to test the normal range of IBM extended
8816 precision. Emin for IBM extended precision is
8817 different to emin for IEEE double, being 53 higher
8818 since the low double exponent is at least 53 lower
8819 than the high double exponent. */
8823 }
8835 {
8836 /* Testing the high end of the range is done just using
8837 the high double, using the same test as isfinite().
8838 For the subnormal end of the range we first test the
8839 high double, then if its magnitude is equal to the
8840 limit of 0x1p-969, we test whether the low double is
8841 non-zero and opposite sign to the high double. */
8857 integer_type_node,
8863 }
8864 else
8865 {
8866 tree const isge_fn
8869 }
8873 }
8876 }
8879 }
8881 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8882 ARG is the argument for the call. */
8884 static tree
8886 {
8893 {
8901 {
8902 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8903 /* In a boolean context, GCC will fold the inner COND_EXPR to
8904 1. So e.g. "if (isinf_sign(x))" would be folded to just
8905 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8913 {
8926 integer_zero_node);
8927 }
8930 }
8943 {
8946 {
8947 /* NaN and Inf are encoded in the high-order double value
8948 only. The low-order value is not significant. */
8950 }
8951 }
8957 }
8958 }
8960 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8961 This builtin will generate code to return the appropriate floating
8962 point classification depending on the value of the floating point
8963 number passed in. The possible return values must be supplied as
8964 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8965 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8966 one floating point argument which is "type generic". */
8968 static tree
8970 {
8973 machine_mode mode;
8974 REAL_VALUE_TYPE r;
8977 /* Verify the required arguments in the original call. */
8997 /* fpclassify(x) ->
8998 isnan(x) ? FP_NAN :
8999 (fabs(x) == Inf ? FP_INFINITE :
9000 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9001 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9015 {
9021 }
9024 {
9027 }
9030 }
9032 /* Fold a call to an unordered comparison function such as
9033 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9034 being called and ARG0 and ARG1 are the arguments for the call.
9035 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9036 the opposite of the desired result. UNORDERED_CODE is used
9037 for modes that can hold NaNs and ORDERED_CODE is used for
9038 the rest. */
9040 static tree
9044 {
9058 /* Choose the wider of two real types. */
9070 {
9074 }
9079 }
9081 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9082 arithmetics if it can never overflow, or into internal functions that
9083 return both result of arithmetics and overflowed boolean flag in
9084 a complex integer result, or some other check for overflow.
9085 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9086 checking part of that. */
9088 static tree
9091 {
9093 /* The code of the expression corresponding to the type-generic
9094 built-in, or ERROR_MARK for the type-specific ones. */
9099 {
9102 /* FALLTHRU */
9105 /* FALLTHRU */
9116 /* FALLTHRU */
9119 /* FALLTHRU */
9130 /* FALLTHRU */
9133 /* FALLTHRU */
9144 }
9146 /* For the "generic" overloads, the first two arguments can have different
9147 types and the last argument determines the target type to use to check
9148 for overflow. The arguments of the other overloads all have the same
9149 type. */
9152 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
9153 arguments are constant, attempt to fold the built-in call into a constant
9154 expression indicating whether or not it detected an overflow. */
9158 /* Perform the computation in the target type and check for overflow. */
9162 arg2);
9176 tree store
9179 }
9181 /* Fold a call to __builtin_FILE to a constant string. */
9185 {
9187 {
9188 /* The documentation says this builtin is equivalent to the preprocessor
9189 __FILE__ macro so it appears appropriate to use the same file prefix
9190 mappings. */
9193 }
9196 }
9198 /* Fold a call to __builtin_FUNCTION to a constant string. */
9202 {
9209 }
9211 /* Fold a call to __builtin_LINE to an integer constant. */
9215 {
9217 }
9219 /* Fold a call to built-in function FNDECL with 0 arguments.
9220 This function returns NULL_TREE if no simplification was possible. */
9222 static tree
9224 {
9228 {
9254 }
9256 }
9258 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9259 This function returns NULL_TREE if no simplification was possible. */
9261 static tree
9263 {
9274 {
9276 {
9279 /* Gimplification will pull the CALL_EXPR for the builtin out of
9280 an if condition. When not optimizing, we'll not CSE it back.
9281 To avoid link error types of regressions, return false now. */
9286 }
9342 {
9347 }
9353 {
9358 }
9379 }
9383 }
9385 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9386 This function returns NULL_TREE if no simplification was possible. */
9388 static tree
9390 {
9402 {
9446 NOP_EXPR);
9448 /* We do the folding for va_start in the expander. */
9463 }
9465 }
9467 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9468 and ARG2.
9469 This function returns NULL_TREE if no simplification was possible. */
9471 static tree
9474 {
9488 {
9537 }
9539 }
9541 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9542 arguments. IGNORE is true if the result of the
9543 function call is ignored. This function returns NULL_TREE if no
9544 simplification was possible. */
9546 tree
9548 {
9552 {
9568 }
9570 {
9574 }
9576 }
9578 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9579 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9580 of arguments in ARGS to be omitted. OLDNARGS is the number of
9581 elements in ARGS. */
9583 static tree
9586 {
9591 {
9599 }
9600 else
9604 }
9606 /* Return true if FNDECL shouldn't be folded right now.
9607 If a built-in function has an inline attribute always_inline
9608 wrapper, defer folding it after always_inline functions have
9609 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9610 might not be performed. */
9612 bool
9614 {
9617 && cfun
9620 }
9622 /* A wrapper function for builtin folding that prevents warnings for
9623 "statement without effect" and the like, caused by removing the
9624 call node earlier than the warning is generated. */
9626 tree
9628 {
9634 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9635 yet. Defer folding until we see all the arguments
9636 (after inlining). */
9638 {
9641 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9642 instead last argument is __builtin_va_arg_pack (). Defer folding
9643 even in that case, until arguments are finalized. */
9645 {
9652 }
9660 else
9661 {
9666 }
9667 }
9669 }
9671 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9672 N arguments are passed in the array ARGARRAY. Return a folded
9673 expression or NULL_TREE if no simplification was possible. */
9675 tree
9677 tree fn,
9680 {
9687 {
9688 /* If last argument is __builtin_va_arg_pack (), arguments to this
9689 function are not finalized yet. Defer folding until they are. */
9691 {
9698 }
9703 else
9705 }
9708 }
9710 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9711 along with N new arguments specified as the "..." parameters. SKIP
9712 is the number of arguments in EXP to be omitted. This function is used
9713 to do varargs-to-varargs transformations. */
9715 static tree
9717 {
9719 tree t;
9727 }
9729 /* Validate a single argument ARG against a tree code CODE representing
9730 a type. Return true when argument is valid. */
9732 static bool
9734 {
9742 }
9744 /* This function validates the types of a function call argument list
9745 against a specified list of tree_codes. If the last specifier is a 0,
9746 that represents an ellipses, otherwise the last specifier must be a
9747 VOID_TYPE.
9749 This is the GIMPLE version of validate_arglist. Eventually we want to
9750 completely convert builtins.c to work from GIMPLEs and the tree based
9751 validate_arglist will then be removed. */
9753 bool
9755 {
9759 const_tree arg;
9765 do
9766 {
9769 {
9771 /* This signifies an ellipses, any further arguments are all ok. */
9775 /* This signifies an endlink, if no arguments remain, return
9776 true, otherwise return false. */
9780 /* If no parameters remain or the parameter's code does not
9781 match the specified code, return false. Otherwise continue
9782 checking any remaining arguments. */
9787 }
9788 }
9791 /* We need gotos here since we can only have one VA_CLOSE in a
9792 function. */
9793 end: ;
9797 }
9799 /* Default target-specific builtin expander that does nothing. */
9801 rtx
9803 rtx target ATTRIBUTE_UNUSED,
9804 rtx subtarget ATTRIBUTE_UNUSED,
9805 machine_mode mode ATTRIBUTE_UNUSED,
9807 {
9809 }
9811 /* Returns true is EXP represents data that would potentially reside
9812 in a readonly section. */
9814 bool
9816 {
9826 /* Make sure we call decl_readonly_section only for trees it
9827 can handle (since it returns true for everything it doesn't
9828 understand). */
9833 else
9835 }
9837 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9838 to the call, and TYPE is its return type.
9840 Return NULL_TREE if no simplification was possible, otherwise return the
9841 simplified form of the call as a tree.
9843 The simplified form may be a constant or other expression which
9844 computes the same value, but in a more efficient manner (including
9845 calls to other builtin functions).
9847 The call may contain arguments which need to be evaluated, but
9848 which are not useful to determine the result of the call. In
9849 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9850 COMPOUND_EXPR will be an argument which must be evaluated.
9851 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9852 COMPOUND_EXPR in the chain will contain the tree for the simplified
9853 form of the builtin function call. */
9855 static tree
9857 {
9861 else
9862 {
9863 tree fn;
9872 {
9874 tree tem;
9879 /* Return an offset into the constant string argument. */
9882 }
9885 /* strpbrk(x, "") == NULL.
9886 Evaluate and ignore s1 in case it had side-effects. */
9896 /* New argument list transforming strpbrk(s1, s2) to
9897 strchr(s1, s2[0]). */
9900 }
9901 }
9903 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9904 to the call.
9906 Return NULL_TREE if no simplification was possible, otherwise return the
9907 simplified form of the call as a tree.
9909 The simplified form may be a constant or other expression which
9910 computes the same value, but in a more efficient manner (including
9911 calls to other builtin functions).
9913 The call may contain arguments which need to be evaluated, but
9914 which are not useful to determine the result of the call. In
9915 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9916 COMPOUND_EXPR will be an argument which must be evaluated.
9917 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9918 COMPOUND_EXPR in the chain will contain the tree for the simplified
9919 form of the builtin function call. */
9921 static tree
9923 {
9927 else
9928 {
9931 /* If either argument is "", return NULL_TREE. */
9933 /* Evaluate and ignore both arguments in case either one has
9934 side-effects. */
9938 }
9939 }
9941 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9942 to the call.
9944 Return NULL_TREE if no simplification was possible, otherwise return the
9945 simplified form of the call as a tree.
9947 The simplified form may be a constant or other expression which
9948 computes the same value, but in a more efficient manner (including
9949 calls to other builtin functions).
9951 The call may contain arguments which need to be evaluated, but
9952 which are not useful to determine the result of the call. In
9953 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9954 COMPOUND_EXPR will be an argument which must be evaluated.
9955 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9956 COMPOUND_EXPR in the chain will contain the tree for the simplified
9957 form of the builtin function call. */
9959 static tree
9961 {
9965 else
9966 {
9967 /* If the first argument is "", return NULL_TREE. */
9970 {
9971 /* Evaluate and ignore argument s2 in case it has
9972 side-effects. */
9975 }
9977 /* If the second argument is "", return __builtin_strlen(s1). */
9980 {
9983 /* If the replacement _DECL isn't initialized, don't do the
9984 transformation. */
9989 }
9991 }
9992 }
9994 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9995 produced. False otherwise. This is done so that we don't output the error
9996 or warning twice or three times. */
9998 bool
10000 {
10003 tree arg;
10004 /* There is good chance the current input_location points inside the
10005 definition of the va_start macro (perhaps on the token for
10006 builtin) in a system header, so warnings will not be emitted.
10007 Use the location in real source code. */
10008 source_location current_location =
10010 NULL);
10013 {
10016 }
10019 {
10021 {
10024 }
10026 }
10027 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
10028 when we checked the arguments and if needed issued a warning. */
10029 else
10030 {
10032 {
10033 /* Evidently an out of date version of <stdarg.h>; can't validate
10034 va_start's second argument, but can still work as intended. */
10036 OPT_Wvarargs,
10039 }
10041 {
10044 }
10046 }
10051 /* We destructively modify the call to be __builtin_va_start (ap, 0)
10052 or __builtin_next_arg (0) the first time we see it, after checking
10053 the arguments and if needed issuing a warning. */
10055 {
10058 /* Strip off all nops for the sake of the comparison. This
10059 is not quite the same as STRIP_NOPS. It does more.
10060 We must also strip off INDIRECT_EXPR for C++ reference
10061 parameters. */
10066 {
10067 /* FIXME: Sometimes with the tree optimizers we can get the
10068 not the last argument even though the user used the last
10069 argument. We just warn and set the arg to be the last
10070 argument so that we will get wrong-code because of
10071 it. */
10073 OPT_Wvarargs,
10075 }
10077 /* Undefined by C99 7.15.1.4p4 (va_start):
10078 "If the parameter parmN is declared with the register storage
10079 class, with a function or array type, or with a type that is
10080 not compatible with the type that results after application of
10081 the default argument promotions, the behavior is undefined."
10082 */
10084 {
10086 OPT_Wvarargs,
10087 "undefined behavior when second parameter of "
10089 }
10091 /* We want to verify the second parameter just once before the tree
10092 optimizers are run and then avoid keeping it in the tree,
10093 as otherwise we could warn even for correct code like:
10094 void foo (int i, ...)
10095 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
10098 else
10100 }
10102 }
10105 /* Expand a call EXP to __builtin_object_size. */
10107 static rtx
10109 {
10110 tree ost;
10115 {
10120 }
10128 {
10133 }
10138 }
10140 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10141 FCODE is the BUILT_IN_* to use.
10142 Return NULL_RTX if we failed; the caller should emit a normal call,
10143 otherwise try to get the result in TARGET, if convenient (and in
10144 mode MODE if that's convenient). */
10146 static rtx
10149 {
10151 POINTER_TYPE,
10152 fcode == BUILT_IN_MEMSET_CHK
10169 {
10170 /* Avoid transforming the checking call to an ordinary one when
10171 an overflow has been detected or when the call couldn't be
10172 validated because the size is not constant. */
10177 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10178 mem{cpy,pcpy,move,set} is available. */
10180 {
10195 }
10204 }
10207 else
10208 {
10211 /* If DEST is not a pointer type, call the normal function. */
10215 /* If SRC and DEST are the same (and not volatile), do nothing. */
10217 {
10218 tree expr;
10221 {
10222 /* Evaluate and ignore LEN in case it has side-effects. */
10225 }
10229 }
10231 /* __memmove_chk special case. */
10233 {
10239 /* If src is categorized for a readonly section we can use
10240 normal __memcpy_chk. */
10242 {
10251 }
10252 }
10254 }
10255 }
10257 /* Emit warning if a buffer overflow is detected at compile time. */
10259 static void
10261 {
10262 /* The source string. */
10264 /* The size of the destination object. */
10266 /* The string that is being concatenated with (as in __strcat_chk)
10267 or null if it isn't. */
10269 /* The maximum length of the source sequence in a bounded operation
10270 (such as __strncat_chk) or null if the operation isn't bounded
10271 (such as __strcat_chk). */
10273 /* The exact size of the access (such as in __strncpy_chk). */
10277 {
10285 /* For __strcat_chk the warning will be emitted only if overflowing
10286 by at least strlen (dest) + 1 bytes. */
10313 }
10316 {
10317 /* Check __strncat_chk. There is no way to determine the length
10318 of the string to which the source string is being appended so
10319 just warn when the length of the source string is not known. */
10322 }
10324 /* The destination argument is the first one for all built-ins above. */
10328 }
10330 /* Emit warning if a buffer overflow is detected at compile time
10331 in __sprintf_chk/__vsprintf_chk calls. */
10333 static void
10335 {
10340 /* Verify the required arguments in the original call. */
10350 /* Check whether the format is a literal string constant. */
10358 /* If the format doesn't contain % args or %%, we know its size. */
10361 /* If the format is "%s" and first ... argument is a string literal,
10362 we know it too. */
10365 {
10366 tree arg;
10377 }
10378 else
10381 /* Add one for the terminating nul. */
10386 }
10388 /* Emit warning if a free is called with address of a variable. */
10390 static void
10392 {
10406 else
10409 }
10411 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10412 if possible. */
10414 static tree
10416 {
10433 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10434 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10435 and (size_t) 0 for types 2 and 3. */
10440 {
10444 }
10446 {
10447 /* If object size is not known yet, delay folding until
10448 later. Maybe subsequent passes will help determining
10449 it. */
10453 }
10456 }
10458 /* Builtins with folding operations that operate on "..." arguments
10459 need special handling; we need to store the arguments in a convenient
10460 data structure before attempting any folding. Fortunately there are
10461 only a few builtins that fall into this category. FNDECL is the
10462 function, EXP is the CALL_EXPR for the call. */
10464 static tree
10466 {
10471 {
10478 }
10480 {
10485 }
10487 }
10489 /* Initialize format string characters in the target charset. */
10491 bool
10493 {
10496 {
10519 }
10521 }
10523 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10524 and no overflow/underflow occurred. INEXACT is true if M was not
10525 exactly calculated. TYPE is the tree type for the result. This
10526 function assumes that you cleared the MPFR flags and then
10527 calculated M to see if anything subsequently set a flag prior to
10528 entering this function. Return NULL_TREE if any checks fail. */
10530 static tree
10532 {
10533 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10534 overflow/underflow occurred. If -frounding-math, proceed iff the
10535 result of calling FUNC was exact. */
10538 {
10539 REAL_VALUE_TYPE rr;
10542 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10543 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10544 but the mpft_t is not, then we underflowed in the
10545 conversion. */
10548 {
10549 REAL_VALUE_TYPE rmode;
10552 /* Proceed iff the specified mode can hold the value. */
10555 }
10556 }
10558 }
10560 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10561 number and no overflow/underflow occurred. INEXACT is true if M
10562 was not exactly calculated. TYPE is the tree type for the result.
10563 This function assumes that you cleared the MPFR flags and then
10564 calculated M to see if anything subsequently set a flag prior to
10565 entering this function. Return NULL_TREE if any checks fail, if
10566 FORCE_CONVERT is true, then bypass the checks. */
10568 static tree
10570 {
10571 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10572 overflow/underflow occurred. If -frounding-math, proceed iff the
10573 result of calling FUNC was exact. */
10578 {
10583 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10584 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10585 but the mpft_t is not, then we underflowed in the
10586 conversion. */
10591 {
10596 /* Proceed iff the specified mode can hold the value. */
10602 }
10603 }
10605 }
10607 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10608 the pointer *(ARG_QUO) and return the result. The type is taken
10609 from the type of ARG0 and is used for setting the precision of the
10610 calculation and results. */
10612 static tree
10614 {
10621 /* To proceed, MPFR must exactly represent the target floating point
10622 format, which only happens when the target base equals two. */
10626 {
10631 {
10635 tree result_rem;
10644 /* Remquo is independent of the rounding mode, so pass
10645 inexact=0 to do_mpfr_ckconv(). */
10649 {
10650 /* MPFR calculates quo in the host's long so it may
10651 return more bits in quo than the target int can hold
10652 if sizeof(host long) > sizeof(target int). This can
10653 happen even for native compilers in LP64 mode. In
10654 these cases, modulo the quo value with the largest
10655 number that the target int can hold while leaving one
10656 bit for the sign. */
10660 /* Dereference the quo pointer argument. */
10662 /* Proceed iff a valid pointer type was passed in. */
10664 {
10665 /* Set the value. */
10666 tree result_quo
10669 integer_quo));
10671 /* Combine the quo assignment with the rem. */
10674 }
10675 }
10676 }
10677 }
10679 }
10681 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10682 resulting value as a tree with type TYPE. The mpfr precision is
10683 set to the precision of TYPE. We assume that this mpfr function
10684 returns zero if the result could be calculated exactly within the
10685 requested precision. In addition, the integer pointer represented
10686 by ARG_SG will be dereferenced and set to the appropriate signgam
10687 (-1,1) value. */
10689 static tree
10691 {
10696 /* To proceed, MPFR must exactly represent the target floating point
10697 format, which only happens when the target base equals two. Also
10698 verify ARG is a constant and that ARG_SG is an int pointer. */
10703 {
10706 /* In addition to NaN and Inf, the argument cannot be zero or a
10707 negative integer. */
10711 {
10716 mpfr_t m;
10717 tree result_lg;
10726 {
10727 tree result_sg;
10729 /* Dereference the arg_sg pointer argument. */
10731 /* Assign the signgam value into *arg_sg. */
10736 /* Combine the signgam assignment with the lgamma result. */
10739 }
10740 }
10741 }
10744 }
10746 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10747 mpc function FUNC on it and return the resulting value as a tree
10748 with type TYPE. The mpfr precision is set to the precision of
10749 TYPE. We assume that function FUNC returns zero if the result
10750 could be calculated exactly within the requested precision. If
10751 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10752 in the arguments and/or results. */
10754 tree
10757 {
10763 /* To proceed, MPFR must exactly represent the target floating point
10764 format, which only happens when the target base equals two. */
10770 {
10779 {
10799 }
10800 }
10803 }
10805 /* A wrapper function for builtin folding that prevents warnings for
10806 "statement without effect" and the like, caused by removing the
10807 call node earlier than the warning is generated. */
10809 tree
10811 {
10819 {
10828 {
10830 }
10831 else
10832 {
10835 {
10836 /* Propagate location information from original call to
10837 expansion of builtin. Otherwise things like
10838 maybe_emit_chk_warning, that operate on the expansion
10839 of a builtin, will use the wrong location information. */
10841 {
10849 }
10851 }
10852 }
10853 }
10855 }
10857 /* Look up the function in builtin_decl that corresponds to DECL
10858 and set ASMSPEC as its user assembler name. DECL must be a
10859 function decl that declares a builtin. */
10861 void
10863 {
10873 {
10877 }
10878 }
10880 /* Return true if DECL is a builtin that expands to a constant or similarly
10881 simple code. */
10882 bool
10884 {
10887 {
10888 /* Builtins that expand to constants. */
10893 /* Simple register moves or loads from stack. */
10904 /* Exception state returns or moves registers around. */
10912 }
10915 }
10917 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10918 most probably expanded inline into reasonably simple code. This is a
10919 superset of is_simple_builtin. */
10920 bool
10922 {
10929 {
10931 CASE_BUILT_IN_ALLOCA:
10997 }
11000 }
11002 /* Return true if T is a constant and the value cast to a target char
11003 can be represented by a host char.
11004 Store the casted char constant in *P if so. */
11006 bool
11008 {
11014 }
11016 /* Return the maximum object size. */
11018 tree
11020 {
11021 /* To do: Make this a configurable parameter. */
11023 }