| blob | 58ea7475ef7bb2a8abad2463b896efaa8fd79650 |
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 }
211 /* Return true if NODE should be considered for inline expansion regardless
212 of the optimization level. This means whenever a function is invoked with
213 its "internal" name, which normally contains the prefix "__builtin". */
215 bool
217 {
218 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
219 we want the name used to call the function, not the name it
220 will have. */
223 }
225 /* Compute values M and N such that M divides (address of EXP - N) and such
226 that N < M. If these numbers can be determined, store M in alignp and N in
227 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
228 *alignp and any bit-offset to *bitposp.
230 Note that the address (and thus the alignment) computed here is based
231 on the address to which a symbol resolves, whereas DECL_ALIGN is based
232 on the address at which an object is actually located. These two
233 addresses are not always the same. For example, on ARM targets,
234 the address &foo of a Thumb function foo() has the lowest bit set,
235 whereas foo() itself starts on an even address.
237 If ADDR_P is true we are taking the address of the memory reference EXP
238 and thus cannot rely on the access taking place. */
240 static bool
243 {
245 tree offset;
246 machine_mode mode;
251 /* Get the innermost object and the constant (bitpos) and possibly
252 variable (offset) offset of the access. */
256 /* Extract alignment information from the innermost object and
257 possibly adjust bitpos and offset. */
259 {
260 /* Function addresses can encode extra information besides their
261 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
262 allows the low bit to be used as a virtual bit, we know
263 that the address itself must be at least 2-byte aligned. */
266 }
268 ;
270 {
271 /* The alignment of a CONST_DECL is determined by its initializer. */
278 }
280 {
283 }
287 {
293 /* If the address is explicitely aligned, handle that. */
296 {
301 }
303 known_alignment
307 /* Re-apply explicit alignment to the bitpos. */
310 /* The alignment of the pointer operand in a TARGET_MEM_REF
311 has to take the variable offset parts into account. */
313 {
315 {
320 }
324 }
326 /* When EXP is an actual memory reference then we can use
327 TYPE_ALIGN of a pointer indirection to derive alignment.
328 Do so only if get_pointer_alignment_1 did not reveal absolute
329 alignment knowledge and if using that alignment would
330 improve the situation. */
336 else
337 {
338 /* Else adjust bitpos accordingly. */
343 }
344 }
346 {
347 /* STRING_CST are the only constant objects we allow to be not
348 wrapped inside a CONST_DECL. */
354 }
356 /* If there is a non-constant offset part extract the maximum
357 alignment that can prevail. */
359 {
362 {
366 }
367 }
369 /* Account for the alignment of runtime coefficients, so that the constant
370 bitpos is guaranteed to be accurate. */
373 {
376 }
381 }
383 /* For a memory reference expression EXP compute values M and N such that M
384 divides (&EXP - N) and such that N < M. If these numbers can be determined,
385 store M in alignp and N in *BITPOSP and return true. Otherwise return false
386 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
388 bool
391 {
393 }
395 /* Return the alignment in bits of EXP, an object. */
397 unsigned int
399 {
405 /* align and bitpos now specify known low bits of the pointer.
406 ptr & (align - 1) == bitpos. */
411 }
413 /* For a pointer valued expression EXP compute values M and N such that M
414 divides (EXP - N) and such that N < M. If these numbers can be determined,
415 store M in alignp and N in *BITPOSP and return true. Return false if
416 the results are just a conservative approximation.
418 If EXP is not a pointer, false is returned too. */
420 bool
423 {
430 {
437 else
438 {
441 {
445 }
446 }
450 }
453 {
458 {
461 /* Make sure to return a sensible alignment when the multiplication
462 by BITS_PER_UNIT overflowed. */
465 /* We cannot really tell whether this result is an approximation. */
467 }
468 else
469 {
473 }
474 }
476 {
481 }
486 }
488 /* Return the alignment in bits of EXP, a pointer valued expression.
489 The alignment returned is, by default, the alignment of the thing that
490 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
492 Otherwise, look at the expression to see if we can do better, i.e., if the
493 expression is actually pointing at an object whose alignment is tighter. */
495 unsigned int
497 {
503 /* align and bitpos now specify known low bits of the pointer.
504 ptr & (align - 1) == bitpos. */
510 }
512 /* Return the number of leading non-zero elements in the sequence
513 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
514 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
516 unsigned
518 {
524 {
525 /* Optimize the common case of plain char. */
527 {
531 }
532 }
533 else
534 {
536 {
540 }
541 }
543 }
545 /* Compute the length of a null-terminated character string or wide
546 character string handling character sizes of 1, 2, and 4 bytes.
547 TREE_STRING_LENGTH is not the right way because it evaluates to
548 the size of the character array in bytes (as opposed to characters)
549 and because it can contain a zero byte in the middle.
551 ONLY_VALUE should be nonzero if the result is not going to be emitted
552 into the instruction stream and zero if it is going to be expanded.
553 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
554 is returned, otherwise NULL, since
555 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
556 evaluate the side-effects.
558 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
559 accesses. Note that this implies the result is not going to be emitted
560 into the instruction stream.
562 ELTSIZE is 1 for normal single byte character strings, and 2 or
563 4 for wide characer strings. ELTSIZE is by default 1.
565 The value returned is of type `ssizetype'. */
567 tree
569 {
574 {
581 }
589 /* Offset from the beginning of the string in bytes. */
590 tree byteoff;
591 tree memsize;
596 /* Determine the size of the string element. */
600 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
601 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
602 in case the latter is less than the size of the array, such as when
603 SRC refers to a short string literal used to initialize a large array.
604 In that case, the elements of the array after the terminating NUL are
605 all NUL. */
614 /* PTR can point to the byte representation of any string type, including
615 char* and wchar_t*. */
619 {
620 /* For empty strings the result should be zero. */
624 /* The code below works only for single byte character types. */
628 /* If the string has an internal NUL character followed by any
629 non-NUL characters (e.g., "foo\0bar"), we can't compute
630 the offset to the following NUL if we don't know where to
631 start searching for it. */
634 /* Return when an embedded null character is found or none at all. */
638 /* We don't know the starting offset, but we do know that the string
639 has no internal zero bytes. If the offset falls within the bounds
640 of the string subtract the offset from the length of the string,
641 and return that. Otherwise the length is zero. Take care to
642 use SAVE_EXPR in case the OFFSET has side-effects. */
650 }
652 /* Offset from the beginning of the string in elements. */
653 HOST_WIDE_INT eltoff;
655 /* We have a known offset into the string. Start searching there for
656 a null character if we can represent it as a single HOST_WIDE_INT. */
661 else
664 /* If the offset is known to be out of bounds, warn, and call strlen at
665 runtime. */
667 {
668 /* Suppress multiple warnings for propagated constant strings. */
671 {
674 eltoff);
676 }
678 }
680 /* If eltoff is larger than strelts but less than maxelts the
681 string length is zero, since the excess memory will be zero. */
685 /* Use strlen to search for the first zero byte. Since any strings
686 constructed with build_string will have nulls appended, we win even
687 if we get handed something like (char[4])"abcd".
689 Since ELTOFF is our starting index into the string, no further
690 calculation is needed. */
694 /* Don't know what to return if there was no zero termination.
695 Ideally this would turn into a gcc_checking_assert over time. */
700 }
702 /* Return a constant integer corresponding to target reading
703 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
705 static rtx
707 {
708 HOST_WIDE_INT ch;
722 {
734 }
738 }
740 /* Cast a target constant CST to target CHAR and if that value fits into
741 host char type, return zero and put that value into variable pointed to by
742 P. */
744 static int
746 {
753 /* Do not care if it fits or not right here. */
768 }
770 /* Similar to save_expr, but assumes that arbitrary code is not executed
771 in between the multiple evaluations. In particular, we assume that a
772 non-addressable local variable will not be modified. */
774 static tree
776 {
784 }
786 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
787 times to get the address of either a higher stack frame, or a return
788 address located within it (depending on FNDECL_CODE). */
790 static rtx
792 {
796 {
797 /* For a zero count with __builtin_return_address, we don't care what
798 frame address we return, because target-specific definitions will
799 override us. Therefore frame pointer elimination is OK, and using
800 the soft frame pointer is OK.
802 For a nonzero count, or a zero count with __builtin_frame_address,
803 we require a stable offset from the current frame pointer to the
804 previous one, so we must use the hard frame pointer, and
805 we must disable frame pointer elimination. */
808 else
809 {
812 /* Tell reload not to eliminate the frame pointer. */
814 }
815 }
820 /* On the SPARC, the return address is not in the frame, it is in a
821 register. There is no way to access it off of the current frame
822 pointer, but it can be accessed off the previous frame pointer by
823 reading the value from the register window save area. */
825 count--;
827 /* Scan back COUNT frames to the specified frame. */
829 {
830 /* Assume the dynamic chain pointer is in the word that the
831 frame address points to, unless otherwise specified. */
836 }
838 /* For __builtin_frame_address, return what we've got. But, on
839 the SPARC for example, we may have to add a bias. */
843 /* For __builtin_return_address, get the return address from that frame. */
844 #ifdef RETURN_ADDR_RTX
846 #else
850 #endif
852 }
854 /* Alias set used for setjmp buffer. */
857 /* Construct the leading half of a __builtin_setjmp call. Control will
858 return to RECEIVER_LABEL. This is also called directly by the SJLJ
859 exception handling code. */
861 void
863 {
865 rtx stack_save;
866 rtx mem;
875 /* We store the frame pointer and the address of receiver_label in
876 the buffer and use the rest of it for the stack save area, which
877 is machine-dependent. */
896 /* If there is further processing to do, do it. */
900 /* We have a nonlocal label. */
902 }
904 /* Construct the trailing part of a __builtin_setjmp call. This is
905 also called directly by the SJLJ exception handling code.
906 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
908 void
910 {
911 rtx chain;
913 /* Mark the FP as used when we get here, so we have to make sure it's
914 marked as used by this function. */
917 /* Mark the static chain as clobbered here so life information
918 doesn't get messed up for it. */
923 /* Now put in the code to restore the frame pointer, and argument
924 pointer, if needed. */
926 {
927 /* First adjust our frame pointer to its actual value. It was
928 previously set to the start of the virtual area corresponding to
929 the stacked variables when we branched here and now needs to be
930 adjusted to the actual hardware fp value.
932 Assignments to virtual registers are converted by
933 instantiate_virtual_regs into the corresponding assignment
934 to the underlying register (fp in this case) that makes
935 the original assignment true.
936 So the following insn will actually be decrementing fp by
937 TARGET_STARTING_FRAME_OFFSET. */
940 /* Restoring the frame pointer also modifies the hard frame pointer.
941 Mark it used (so that the previous assignment remains live once
942 the frame pointer is eliminated) and clobbered (to represent the
943 implicit update from the assignment). */
946 }
949 {
950 /* If the argument pointer can be eliminated in favor of the
951 frame pointer, we don't need to restore it. We assume here
952 that if such an elimination is present, it can always be used.
953 This is the case on all known machines; if we don't make this
954 assumption, we do unnecessary saving on many machines. */
964 {
965 /* Now restore our arg pointer from the address at which it
966 was saved in our stack frame. */
969 }
970 }
976 else
979 /* We must not allow the code we just generated to be reordered by
980 scheduling. Specifically, the update of the frame pointer must
981 happen immediately, not later. */
983 }
985 /* __builtin_longjmp is passed a pointer to an array of five words (not
986 all will be used on all machines). It operates similarly to the C
987 library function of the same name, but is more efficient. Much of
988 the code below is copied from the handling of non-local gotos. */
990 static void
992 {
997 /* DRAP is needed for stack realign if longjmp is expanded to current
998 function */
1009 /* We require that the user must pass a second argument of 1, because
1010 that is what builtin_setjmp will return. */
1016 else
1017 {
1028 /* Pick up FP, label, and SP from the block and jump. This code is
1029 from expand_goto in stmt.c; see there for detailed comments. */
1031 /* We have to pass a value to the nonlocal_goto pattern that will
1032 get copied into the static_chain pointer, but it does not matter
1033 what that value is, because builtin_setjmp does not use it. */
1035 else
1036 {
1048 }
1049 }
1051 /* Search backwards and mark the jump insn as a non-local goto.
1052 Note that this precludes the use of __builtin_longjmp to a
1053 __builtin_setjmp target in the same function. However, we've
1054 already cautioned the user that these functions are for
1055 internal exception handling use only. */
1057 {
1061 {
1064 }
1067 }
1068 }
1072 {
1074 }
1076 /* This function validates the types of a function call argument list
1077 against a specified list of tree_codes. If the last specifier is a 0,
1078 that represents an ellipsis, otherwise the last specifier must be a
1079 VOID_TYPE. */
1081 static bool
1083 {
1087 const_call_expr_arg_iterator iter;
1088 const_tree arg;
1093 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1098 {
1102 {
1104 /* This signifies an ellipses, any further arguments are all ok. */
1108 /* This signifies an endlink, if no arguments remain, return
1109 true, otherwise return false. */
1113 /* The actual argument must be nonnull when either the whole
1114 called function has been declared nonnull, or when the formal
1115 argument corresponding to the actual argument has been. */
1118 {
1123 }
1124 /* FALLTHRU */
1126 /* If no parameters remain or the parameter's code does not
1127 match the specified code, return false. Otherwise continue
1128 checking any remaining arguments. */
1133 }
1134 }
1136 /* We need gotos here since we can only have one VA_CLOSE in a
1137 function. */
1138 end: ;
1144 }
1146 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1147 and the address of the save area. */
1149 static rtx
1151 {
1166 /* Copy the address of the save location to a register just in case it was
1167 based on the frame pointer. */
1176 /* ??? We no longer need to pass the static chain value, afaik. */
1179 else
1180 {
1186 /* Restore frame pointer for containing function. */
1190 /* USE of hard_frame_pointer_rtx added for consistency;
1191 not clear if really needed. */
1195 /* If the architecture is using a GP register, we must
1196 conservatively assume that the target function makes use of it.
1197 The prologue of functions with nonlocal gotos must therefore
1198 initialize the GP register to the appropriate value, and we
1199 must then make sure that this value is live at the point
1200 of the jump. (Note that this doesn't necessarily apply
1201 to targets with a nonlocal_goto pattern; they are free
1202 to implement it in their own way. Note also that this is
1203 a no-op if the GP register is a global invariant.) */
1209 }
1211 /* Search backwards to the jump insn and mark it as a
1212 non-local goto. */
1214 {
1216 {
1219 }
1222 }
1225 }
1227 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1228 (not all will be used on all machines) that was passed to __builtin_setjmp.
1229 It updates the stack pointer in that block to the current value. This is
1230 also called directly by the SJLJ exception handling code. */
1232 void
1234 {
1237 rtx stack_save
1239 memory_address
1245 }
1247 /* Expand a call to __builtin_prefetch. For a target that does not support
1248 data prefetch, evaluate the memory address argument in case it has side
1249 effects. */
1251 static void
1253 {
1263 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1264 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1265 locality). */
1269 else
1273 else
1276 /* Argument 0 is an address. */
1279 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1281 {
1284 }
1286 /* Argument 1 must be either zero or one. */
1288 {
1292 }
1294 /* Argument 2 (locality) must be a compile-time constant int. */
1296 {
1299 }
1301 /* Argument 2 must be 0, 1, 2, or 3. */
1303 {
1306 }
1309 {
1317 }
1319 /* Don't do anything with direct references to volatile memory, but
1320 generate code to handle other side effects. */
1323 }
1325 /* Get a MEM rtx for expression EXP which is the address of an operand
1326 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1327 the maximum length of the block of memory that might be accessed or
1328 NULL if unknown. */
1330 static rtx
1332 {
1336 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1337 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1344 /* Get an expression we can use to find the attributes to assign to MEM.
1345 First remove any nops. */
1350 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1351 (as builtin stringops may alias with anything). */
1358 /* If the MEM_REF has no acceptable address, try to get the base object
1359 from the original address we got, and build an all-aliasing
1360 unknown-sized access to that one. */
1366 {
1371 size_zero_node,
1372 NULL)),
1375 }
1378 }
1379 \f
1380 /* Built-in functions to perform an untyped call and return. */
1382 #define apply_args_mode \
1383 (this_target_builtins->x_apply_args_mode)
1384 #define apply_result_mode \
1385 (this_target_builtins->x_apply_result_mode)
1387 /* Return the size required for the block returned by __builtin_apply_args,
1388 and initialize apply_args_mode. */
1390 static int
1392 {
1397 /* The values computed by this function never change. */
1399 {
1400 /* The first value is the incoming arg-pointer. */
1403 /* The second value is the structure value address unless this is
1404 passed as an "invisible" first argument. */
1410 {
1420 }
1421 else
1422 {
1424 }
1425 }
1427 }
1429 /* Return the size required for the block returned by __builtin_apply,
1430 and initialize apply_result_mode. */
1432 static int
1434 {
1438 /* The values computed by this function never change. */
1440 {
1445 {
1455 }
1456 else
1459 /* Allow targets that use untyped_call and untyped_return to override
1460 the size so that machine-specific information can be stored here. */
1461 #ifdef APPLY_RESULT_SIZE
1463 #endif
1464 }
1466 }
1468 /* Create a vector describing the result block RESULT. If SAVEP is true,
1469 the result block is used to save the values; otherwise it is used to
1470 restore the values. */
1472 static rtx
1474 {
1476 fixed_size_mode mode;
1483 {
1493 }
1495 }
1497 /* Save the state required to perform an untyped call with the same
1498 arguments as were passed to the current function. */
1500 static rtx
1502 {
1505 fixed_size_mode mode;
1506 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1508 /* Create a block where the arg-pointer, structure value address,
1509 and argument registers can be saved. */
1512 /* Walk past the arg-pointer and structure value address. */
1517 /* Save each register used in calling a function to the block. */
1520 {
1529 }
1531 /* Save the arg pointer to the block. */
1533 /* We need the pointer as the caller actually passed them to us, not
1534 as we might have pretended they were passed. Make sure it's a valid
1535 operand, as emit_move_insn isn't expected to handle a PLUS. */
1537 tem
1540 NULL_RTX);
1545 /* Save the structure value address unless this is passed as an
1546 "invisible" first argument. */
1548 {
1552 }
1554 /* Return the address of the block. */
1556 }
1558 /* __builtin_apply_args returns block of memory allocated on
1559 the stack into which is stored the arg pointer, structure
1560 value address, static chain, and all the registers that might
1561 possibly be used in performing a function call. The code is
1562 moved to the start of the function so the incoming values are
1563 saved. */
1565 static rtx
1567 {
1568 /* Don't do __builtin_apply_args more than once in a function.
1569 Save the result of the first call and reuse it. */
1572 {
1573 /* When this function is called, it means that registers must be
1574 saved on entry to this function. So we migrate the
1575 call to the first insn of this function. */
1576 rtx temp;
1585 /* Put the insns after the NOTE that starts the function.
1586 If this is inside a start_sequence, make the outer-level insn
1587 chain current, so the code is placed at the start of the
1588 function. If internal_arg_pointer is a non-virtual pseudo,
1589 it needs to be placed after the function that initializes
1590 that pseudo. */
1595 else
1599 }
1600 }
1602 /* Perform an untyped call and save the state required to perform an
1603 untyped return of whatever value was returned by the given function. */
1605 static rtx
1607 {
1609 fixed_size_mode mode;
1618 /* Create a block where the return registers can be saved. */
1621 /* Fetch the arg pointer from the ARGUMENTS block. */
1628 /* Push a new argument block and copy the arguments. Do not allow
1629 the (potential) memcpy call below to interfere with our stack
1630 manipulations. */
1632 NO_DEFER_POP;
1634 /* Save the stack with nonlocal if available. */
1637 else
1640 /* Allocate a block of memory onto the stack and copy the memory
1641 arguments to the outgoing arguments address. We can pass TRUE
1642 as the 4th argument because we just saved the stack pointer
1643 and will restore it right after the call. */
1646 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1647 may have already set current_function_calls_alloca to true.
1648 current_function_calls_alloca won't be set if argsize is zero,
1649 so we have to guarantee need_drap is true here. */
1655 {
1658 else
1660 }
1667 /* Refer to the argument block. */
1672 /* Walk past the arg-pointer and structure value address. */
1677 /* Restore each of the registers previously saved. Make USE insns
1678 for each of these registers for use in making the call. */
1681 {
1689 }
1691 /* Restore the structure value address unless this is passed as an
1692 "invisible" first argument. */
1695 {
1702 }
1704 /* All arguments and registers used for the call are set up by now! */
1707 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1708 and we don't want to load it into a register as an optimization,
1709 because prepare_call_address already did it if it should be done. */
1713 /* Generate the actual call instruction and save the return value. */
1715 {
1719 }
1721 {
1724 /* Locate the unique return register. It is not possible to
1725 express a call that sets more than one return register using
1726 call_value; use untyped_call for that. In fact, untyped_call
1727 only needs to save the return registers in the given block. */
1730 {
1734 }
1741 }
1742 else
1745 /* Find the CALL insn we just emitted, and attach the register usage
1746 information. */
1750 /* Restore the stack. */
1753 else
1757 OK_DEFER_POP;
1759 /* Return the address of the result block. */
1762 }
1764 /* Perform an untyped return. */
1766 static void
1768 {
1770 fixed_size_mode mode;
1771 rtx reg;
1780 {
1785 }
1787 /* Restore the return value and note that each value is used. */
1791 {
1803 }
1805 /* Put the USE insns before the return. */
1808 /* Return whatever values was restored by jumping directly to the end
1809 of the function. */
1811 }
1813 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1815 static enum type_class
1817 {
1819 {
1838 }
1839 }
1841 /* Expand a call EXP to __builtin_classify_type. */
1843 static rtx
1845 {
1849 }
1851 /* This helper macro, meant to be used in mathfn_built_in below, determines
1852 which among a set of builtin math functions is appropriate for a given type
1853 mode. The `F' (float) and `L' (long double) are automatically generated
1854 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1855 types, there are additional types that are considered with 'F32', 'F64',
1856 'F128', etc. suffixes. */
1857 #define CASE_MATHFN(MATHFN) \
1858 CASE_CFN_##MATHFN: \
1859 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1860 fcodel = BUILT_IN_##MATHFN##L ; break;
1861 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1862 types. */
1863 #define CASE_MATHFN_FLOATN(MATHFN) \
1864 CASE_CFN_##MATHFN: \
1865 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1866 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1867 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1868 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1869 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1870 break;
1871 /* Similar to above, but appends _R after any F/L suffix. */
1872 #define CASE_MATHFN_REENT(MATHFN) \
1873 case CFN_BUILT_IN_##MATHFN##_R: \
1874 case CFN_BUILT_IN_##MATHFN##F_R: \
1875 case CFN_BUILT_IN_##MATHFN##L_R: \
1876 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1877 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1879 /* Return a function equivalent to FN but operating on floating-point
1880 values of type TYPE, or END_BUILTINS if no such function exists.
1881 This is purely an operation on function codes; it does not guarantee
1882 that the target actually has an implementation of the function. */
1884 static built_in_function
1886 {
1887 tree mtype;
1898 {
1989 }
2012 else
2014 }
2016 /* Return mathematic function equivalent to FN but operating directly on TYPE,
2017 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2018 otherwise use the explicit declaration. If we can't do the conversion,
2019 return null. */
2021 static tree
2023 {
2032 }
2034 /* Like mathfn_built_in_1, but always use the implicit array. */
2036 tree
2038 {
2040 }
2042 /* Like mathfn_built_in_1, but take a built_in_function and
2043 always use the implicit array. */
2045 tree
2047 {
2049 }
2051 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2052 return its code, otherwise return IFN_LAST. Note that this function
2053 only tests whether the function is defined in internals.def, not whether
2054 it is actually available on the target. */
2056 internal_fn
2058 {
2062 {
2063 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2064 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2065 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2066 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2067 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2068 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2069 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2086 }
2087 }
2089 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2090 on the current target by a call to an internal function, return the
2091 code of that internal function, otherwise return IFN_LAST. The caller
2092 is responsible for ensuring that any side-effects of the built-in
2093 call are dealt with correctly. E.g. if CALL sets errno, the caller
2094 must decide that the errno result isn't needed or make it available
2095 in some other way. */
2097 internal_fn
2099 {
2101 {
2104 {
2109 }
2110 }
2112 }
2114 /* Expand a call to the builtin trinary math functions (fma).
2115 Return NULL_RTX if a normal call should be emitted rather than expanding the
2116 function in-line. EXP is the expression that is a call to the builtin
2117 function; if convenient, the result should be placed in TARGET.
2118 SUBTARGET may be used as the target for computing one of EXP's
2119 operands. */
2121 static rtx
2123 {
2124 optab builtin_optab;
2129 machine_mode mode;
2139 {
2145 }
2147 /* Make a suitable register to place result in. */
2150 /* Before working hard, check whether the instruction is available. */
2156 /* Always stabilize the argument list. */
2167 /* Compute into RESULT.
2168 Set RESULT to wherever the result comes back. */
2172 /* If we were unable to expand via the builtin, stop the sequence
2173 (without outputting the insns) and call to the library function
2174 with the stabilized argument list. */
2176 {
2179 }
2181 /* Output the entire sequence. */
2187 }
2189 /* Expand a call to the builtin sin and cos math functions.
2190 Return NULL_RTX if a normal call should be emitted rather than expanding the
2191 function in-line. EXP is the expression that is a call to the builtin
2192 function; if convenient, the result should be placed in TARGET.
2193 SUBTARGET may be used as the target for computing one of EXP's
2194 operands. */
2196 static rtx
2198 {
2199 optab builtin_optab;
2200 rtx op0;
2203 machine_mode mode;
2204 tree arg;
2212 {
2218 }
2220 /* Make a suitable register to place result in. */
2223 /* Check if sincos insn is available, otherwise fallback
2224 to sin or cos insn. */
2227 {
2234 }
2236 /* Before working hard, check whether the instruction is available. */
2238 {
2241 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2242 need to expand the argument again. This way, we will not perform
2243 side-effects more the once. */
2250 /* Compute into RESULT.
2251 Set RESULT to wherever the result comes back. */
2253 {
2257 {
2266 }
2268 }
2269 else
2273 {
2274 /* Output the entire sequence. */
2279 }
2281 /* If we were unable to expand via the builtin, stop the sequence
2282 (without outputting the insns) and call to the library function
2283 with the stabilized argument list. */
2285 }
2288 }
2290 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2291 return an RTL instruction code that implements the functionality.
2292 If that isn't possible or available return CODE_FOR_nothing. */
2294 static enum insn_code
2296 {
2299 machine_mode mode;
2302 {
2316 /* These builtins have no optabs (yet). */
2320 }
2322 /* There's no easy way to detect the case we need to set EDOM. */
2326 /* Optab mode depends on the mode of the input argument. */
2332 }
2334 /* Expand a call to one of the builtin math functions that operate on
2335 floating point argument and output an integer result (ilogb, isinf,
2336 isnan, etc).
2337 Return 0 if a normal call should be emitted rather than expanding the
2338 function in-line. EXP is the expression that is a call to the builtin
2339 function; if convenient, the result should be placed in TARGET. */
2341 static rtx
2343 {
2345 rtx op0;
2347 machine_mode mode;
2348 tree arg;
2358 {
2363 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2364 need to expand the argument again. This way, we will not perform
2365 side-effects more the once. */
2380 }
2383 }
2385 /* Expand a call to the builtin sincos math function.
2386 Return NULL_RTX if a normal call should be emitted rather than expanding the
2387 function in-line. EXP is the expression that is a call to the builtin
2388 function. */
2390 static rtx
2392 {
2394 machine_mode mode;
2408 /* Make a suitable register to place result in. */
2411 /* Check if sincos insn is available, otherwise emit the call. */
2426 /* Compute into target1 and target2.
2427 Set TARGET to wherever the result comes back. */
2431 /* Move target1 and target2 to the memory locations indicated
2432 by op1 and op2. */
2437 }
2439 /* Expand a call to the internal cexpi builtin to the sincos math function.
2440 EXP is the expression that is a call to the builtin function; if convenient,
2441 the result should be placed in TARGET. */
2443 static rtx
2445 {
2448 machine_mode mode;
2459 /* Try expanding via a sincos optab, fall back to emitting a libcall
2460 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2461 is only generated from sincos, cexp or if we have either of them. */
2463 {
2469 /* Compute into op1 and op2. */
2471 }
2473 {
2484 else
2494 /* Make sure not to fold the sincos call again. */
2498 }
2499 else
2500 {
2510 else
2513 /* If we don't have a decl for cexp create one. This is the
2514 friendliest fallback if the user calls __builtin_cexpi
2515 without full target C99 function support. */
2517 {
2518 tree fntype;
2530 }
2535 /* Make sure not to fold the cexp call again. */
2539 }
2541 /* Now build the proper return type. */
2546 }
2548 /* Conveniently construct a function call expression. FNDECL names the
2549 function to be called, N is the number of arguments, and the "..."
2550 parameters are the argument expressions. Unlike build_call_exr
2551 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2553 static tree
2555 {
2565 }
2567 /* Expand a call to one of the builtin rounding functions gcc defines
2568 as an extension (lfloor and lceil). As these are gcc extensions we
2569 do not need to worry about setting errno to EDOM.
2570 If expanding via optab fails, lower expression to (int)(floor(x)).
2571 EXP is the expression that is a call to the builtin function;
2572 if convenient, the result should be placed in TARGET. */
2574 static rtx
2576 {
2577 convert_optab builtin_optab;
2582 tree fallback_fndecl;
2583 machine_mode mode;
2584 tree arg;
2592 {
2609 }
2611 /* Make a suitable register to place result in. */
2616 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2617 need to expand the argument again. This way, we will not perform
2618 side-effects more the once. */
2625 /* Compute into TARGET. */
2627 {
2628 /* Output the entire sequence. */
2633 }
2635 /* If we were unable to expand via the builtin, stop the sequence
2636 (without outputting the insns). */
2639 /* Fall back to floating point rounding optab. */
2642 /* For non-C99 targets we may end up without a fallback fndecl here
2643 if the user called __builtin_lfloor directly. In this case emit
2644 a call to the floor/ceil variants nevertheless. This should result
2645 in the best user experience for not full C99 targets. */
2647 {
2648 tree fntype;
2652 {
2685 }
2690 }
2697 /* Truncate the result of floating point optab to integer
2698 via expand_fix (). */
2703 }
2705 /* Expand a call to one of the builtin math functions doing integer
2706 conversion (lrint).
2707 Return 0 if a normal call should be emitted rather than expanding the
2708 function in-line. EXP is the expression that is a call to the builtin
2709 function; if convenient, the result should be placed in TARGET. */
2711 static rtx
2713 {
2714 convert_optab builtin_optab;
2715 rtx op0;
2718 tree arg;
2719 machine_mode mode;
2728 {
2747 }
2749 /* There's no easy way to detect the case we need to set EDOM. */
2753 /* Make a suitable register to place result in. */
2756 /* There's no easy way to detect the case we need to set EDOM. */
2758 {
2761 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2762 need to expand the argument again. This way, we will not perform
2763 side-effects more the once. */
2771 {
2772 /* Output the entire sequence. */
2777 }
2779 /* If we were unable to expand via the builtin, stop the sequence
2780 (without outputting the insns) and call to the library function
2781 with the stabilized argument list. */
2783 }
2786 {
2787 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2788 targets, (int) round (x) should never be transformed into
2789 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2790 a call to lround in the hope that the target provides at least some
2791 C99 functions. This should result in the best user experience for
2792 not full C99 targets. */
2793 tree fallback_fndecl = mathfn_built_in_1
2802 }
2805 }
2807 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2808 a normal call should be emitted rather than expanding the function
2809 in-line. EXP is the expression that is a call to the builtin
2810 function; if convenient, the result should be placed in TARGET. */
2812 static rtx
2814 {
2817 machine_mode mode;
2818 machine_mode mode2;
2827 /* Emit a libcall to libgcc. */
2829 /* Mode of the 2nd argument must match that of an int. */
2847 }
2849 /* Expand expression EXP which is a call to the strlen builtin. Return
2850 NULL_RTX if we failed and the caller should emit a normal call, otherwise
2851 try to get the result in TARGET, if convenient. */
2853 static rtx
2855 machine_mode target_mode)
2856 {
2861 rtx pat;
2862 tree len;
2864 rtx src_reg;
2866 machine_mode insn_mode;
2870 /* If the length can be computed at compile-time, return it. */
2875 /* If the length can be computed at compile-time and is constant
2876 integer, but there are side-effects in src, evaluate
2877 src for side-effects, then return len.
2878 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2879 can be optimized into: i++; x = 3; */
2882 {
2885 }
2889 /* If SRC is not a pointer type, don't do this operation inline. */
2893 /* Bail out if we can't compute strlen in the right mode. */
2895 {
2899 }
2903 /* Make a place to hold the source address. We will not expand
2904 the actual source until we are sure that the expansion will
2905 not fail -- there are trees that cannot be expanded twice. */
2908 /* Mark the beginning of the strlen sequence so we can emit the
2909 source operand later. */
2919 /* Check to see if the argument was declared attribute nonstring
2920 and if so, issue a warning since at this point it's not known
2921 to be nul-terminated. */
2924 /* Now that we are assured of success, expand the source. */
2928 {
2929 #ifdef POINTERS_EXTEND_UNSIGNED
2932 POINTERS_EXTEND_UNSIGNED);
2933 #endif
2935 }
2941 else
2944 /* Return the value in the proper mode for this function. */
2949 else
2953 }
2955 /* Expand call EXP to the strnlen built-in, returning the result
2956 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
2958 static rtx
2960 {
2978 /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
2979 so these conversions aren't necessary. */
2984 {
2988 "%K%qD specified bound %E "
2998 }
3011 "%K%qD specified bound [%wu, %wu] "
3024 }
3026 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3027 bytes from constant string DATA + OFFSET and return it as target
3028 constant. */
3030 static rtx
3032 scalar_int_mode mode)
3033 {
3041 }
3043 /* LEN specify length of the block of memcpy/memset operation.
3044 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3045 In some cases we can make very likely guess on max size, then we
3046 set it into PROBABLE_MAX_SIZE. */
3048 static void
3053 {
3055 {
3058 }
3059 else
3060 {
3064 /* Determine bounds from the type. */
3067 else
3072 else
3078 {
3083 }
3085 {
3086 /* Anti range 0...N lets us to determine minimal size to N+1. */
3088 {
3091 }
3092 /* Code like
3094 int n;
3095 if (n < 100)
3096 memcpy (a, b, n)
3098 Produce anti range allowing negative values of N. We still
3099 can use the information and make a guess that N is not negative.
3100 */
3103 }
3104 }
3108 }
3110 /* Try to verify that the sizes and lengths of the arguments to a string
3111 manipulation function given by EXP are within valid bounds and that
3112 the operation does not lead to buffer overflow or read past the end.
3113 Arguments other than EXP may be null. When non-null, the arguments
3114 have the following meaning:
3115 DST is the destination of a copy call or NULL otherwise.
3116 SRC is the source of a copy call or NULL otherwise.
3117 DSTWRITE is the number of bytes written into the destination obtained
3118 from the user-supplied size argument to the function (such as in
3119 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3120 MAXREAD is the user-supplied bound on the length of the source sequence
3121 (such as in strncat(d, s, N). It specifies the upper limit on the number
3122 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3123 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3124 expression EXP is a string function call (as opposed to a memory call
3125 like memcpy). As an exception, SRCSTR can also be an integer denoting
3126 the precomputed size of the source string or object (for functions like
3127 memcpy).
3128 DSTSIZE is the size of the destination object specified by the last
3129 argument to the _chk builtins, typically resulting from the expansion
3130 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3131 DSTSIZE).
3133 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3134 SIZE_MAX.
3136 If the call is successfully verified as safe return true, otherwise
3137 return false. */
3139 static bool
3142 {
3145 /* The size of the largest object is half the address space, or
3146 PTRDIFF_MAX. (This is way too permissive.) */
3149 /* Either the length of the source string for string functions or
3150 the size of the source object for raw memory functions. */
3155 /* Set to true when the exact number of bytes written by a string
3156 function like strcpy is not known and the only thing that is
3157 known is that it must be at least one (for the terminating nul). */
3160 {
3161 /* SRCSTR is normally a pointer to string but as a special case
3162 it can be an integer denoting the length of a string. */
3164 {
3165 /* Try to determine the range of lengths the source string
3166 refers to. If it can be determined and is less than
3167 the upper bound given by MAXREAD add one to it for
3168 the terminating nul. Otherwise, set it to one for
3169 the same reason, or to MAXREAD as appropriate. */
3172 {
3175 else
3186 }
3187 else
3188 {
3191 }
3192 }
3193 else
3195 }
3198 {
3199 /* When the only available piece of data is the object size
3200 there is nothing to do. */
3204 /* Otherwise, when the length of the source sequence is known
3205 (as with strlen), set DSTWRITE to it. */
3208 }
3218 /* First check the number of bytes to be written against the maximum
3219 object size. */
3223 {
3233 "%K%qD specified size %E "
3236 else
3238 "%K%qD specified size between %E and %E "
3246 }
3248 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3249 constant, and in range of unsigned HOST_WIDE_INT. */
3252 /* Next check the number of bytes to be written against the destination
3253 object size. */
3255 {
3260 || (dstwrite
3263 {
3271 {
3272 /* This is a call to strcpy with a destination of 0 size
3273 and a source of unknown length. The call will write
3274 at least one byte past the end of the destination. */
3276 "%K%qD writing %E or more bytes into a region "
3279 }
3282 "%K%qD writing %E byte into a region "
3284 "%K%qD writing %E bytes into a region "
3288 {
3289 /* Avoid printing the upper bound if it's invalid. */
3291 "%K%qD writing %E or more bytes into a region "
3294 }
3295 else
3297 "%K%qD writing between %E and %E bytes into "
3300 dstsize);
3302 /* Return error when an overflow has been detected. */
3304 }
3305 }
3307 /* Check the maximum length of the source sequence against the size
3308 of the destination object if known, or against the maximum size
3309 of an object. */
3311 {
3314 /* Use the lower end for MAXREAD from now on. */
3319 {
3324 {
3328 /* Warn about crazy big sizes first since that's more
3329 likely to be meaningful than saying that the bound
3330 is greater than the object size if both are big. */
3333 "%K%qD specified bound %E "
3337 else
3339 "%K%qD specified bound between %E and %E "
3345 }
3348 {
3354 "%K%qD specified bound %E "
3358 else
3360 "%K%qD specified bound between %E and %E "
3365 }
3366 }
3367 }
3369 /* Check for reading past the end of SRC. */
3374 {
3386 {
3387 /* Avoid printing the upper bound if it's invalid. */
3389 "%K%qD reading %E or more bytes from a region "
3392 }
3393 else
3395 "%K%qD reading between %E and %E bytes from a region "
3399 }
3402 }
3404 /* Helper to compute the size of the object referenced by the DEST
3405 expression which must have pointer type, using Object Size type
3406 OSTYPE (only the least significant 2 bits are used). Return
3407 an estimate of the size of the object if successful or NULL when
3408 the size cannot be determined. When the referenced object involves
3409 a non-constant offset in some range the returned value represents
3410 the largest size given the smallest non-negative offset in the
3411 range. The function is intended for diagnostics and should not
3412 be used to influence code generation or optimization. */
3414 tree
3416 {
3419 /* Only the two least significant bits are meaningful. */
3426 {
3435 {
3436 /* compute_builtin_object_size fails for addresses with
3437 non-constant offsets. Try to determine the range of
3438 such an offset here and use it to adjust the constant
3439 size. */
3442 {
3444 {
3448 /* Ignore negative offsets for now. For others,
3449 use the lower bound as the most optimistic
3450 estimate of the (remaining) size. */
3452 ;
3456 else
3458 }
3459 }
3462 {
3467 {
3469 {
3472 /* Ignore negative offsets for now. For others,
3473 use the lower bound as the most optimistic
3474 estimate of the (remaining)size. */
3476 ;
3480 else
3482 }
3483 }
3484 }
3485 }
3488 }
3490 /* Unless computing the largest size (for memcpy and other raw memory
3491 functions), try to determine the size of the object from its type. */
3506 {
3507 /* Return the constant size unless it's zero (that's a zero-length
3508 array likely at the end of a struct). */
3513 }
3516 }
3518 /* Helper to determine and check the sizes of the source and the destination
3519 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3520 call expression, DEST is the destination argument, SRC is the source
3521 argument or null, and LEN is the number of bytes. Use Object Size type-0
3522 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3523 (no overflow or invalid sizes), false otherwise. */
3525 static bool
3527 {
3528 /* For functions like memset and memcpy that operate on raw memory
3529 try to determine the size of the largest source and destination
3530 object using type-0 Object Size regardless of the object size
3531 type specified by the option. */
3537 }
3539 /* Validate memchr arguments without performing any expansion.
3540 Return NULL_RTX. */
3542 static rtx
3544 {
3552 /* Diagnose calls where the specified length exceeds the size
3553 of the object. */
3555 {
3559 }
3562 }
3564 /* Expand a call EXP to the memcpy builtin.
3565 Return NULL_RTX if we failed, the caller should emit a normal call,
3566 otherwise try to get the result in TARGET, if convenient (and in
3567 mode MODE if that's convenient). */
3569 static rtx
3571 {
3584 }
3586 /* Check a call EXP to the memmove built-in for validity.
3587 Return NULL_RTX on both success and failure. */
3589 static rtx
3591 {
3603 }
3605 /* Expand a call EXP to the mempcpy builtin.
3606 Return NULL_RTX if we failed; the caller should emit a normal call,
3607 otherwise try to get the result in TARGET, if convenient (and in
3608 mode MODE if that's convenient). If ENDP is 0 return the
3609 destination pointer, if ENDP is 1 return the end pointer ala
3610 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3611 stpcpy. */
3613 static rtx
3615 {
3624 /* Policy does not generally allow using compute_objsize (which
3625 is used internally by check_memop_size) to change code generation
3626 or drive optimization decisions.
3628 In this instance it is safe because the code we generate has
3629 the same semantics regardless of the return value of
3630 check_memop_sizes. Exactly the same amount of data is copied
3631 and the return value is exactly the same in both cases.
3633 Furthermore, check_memop_size always uses mode 0 for the call to
3634 compute_objsize, so the imprecise nature of compute_objsize is
3635 avoided. */
3637 /* Avoid expanding mempcpy into memcpy when the call is determined
3638 to overflow the buffer. This also prevents the same overflow
3639 from being diagnosed again when expanding memcpy. */
3645 }
3647 /* Helper function to do the actual work for expand of memory copy family
3648 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3649 of memory from SRC to DEST and assign to TARGET if convenient.
3650 If ENDP is 0 return the
3651 destination pointer, if ENDP is 1 return the end pointer ala
3652 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3653 stpcpy. */
3655 static rtx
3658 {
3669 /* If DEST is not a pointer type, call the normal function. */
3673 /* If either SRC is not a pointer type, don't do this
3674 operation in-line. */
3691 /* If SRC is a string constant and block move would be done
3692 by pieces, we can avoid loading the string from memory
3693 and only stored the computed constants. */
3700 {
3702 builtin_memcpy_read_str,
3708 }
3713 /* Copy word part most expediently. */
3726 {
3729 }
3732 {
3734 /* stpcpy pointer to last byte. */
3737 }
3740 }
3742 static rtx
3745 {
3747 endp);
3748 }
3750 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3751 we failed, the caller should emit a normal call, otherwise try to
3752 get the result in TARGET, if convenient. If ENDP is 0 return the
3753 destination pointer, if ENDP is 1 return the end pointer ala
3754 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3755 stpcpy. */
3757 static rtx
3759 {
3761 rtx dest_mem;
3762 rtx src_mem;
3770 {
3773 }
3782 {
3784 /* movstr is supposed to set end to the address of the NUL
3785 terminator. If the caller requested a mempcpy-like return value,
3786 adjust it. */
3788 {
3792 }
3793 }
3795 }
3797 /* Do some very basic size validation of a call to the strcpy builtin
3798 given by EXP. Return NULL_RTX to have the built-in expand to a call
3799 to the library function. */
3801 static rtx
3803 {
3811 /* There is no way here to determine the length of the string in
3812 the destination to which the SRC string is being appended so
3813 just diagnose cases when the souce string is longer than
3814 the destination object. */
3819 destsize);
3822 }
3824 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3825 NULL_RTX if we failed the caller should emit a normal call, otherwise
3826 try to get the result in TARGET, if convenient (and in mode MODE if that's
3827 convenient). */
3829 static rtx
3831 {
3839 {
3843 }
3846 {
3847 /* Check to see if the argument was declared attribute nonstring
3848 and if so, issue a warning since at this point it's not known
3849 to be nul-terminated. */
3853 }
3856 }
3858 /* Helper function to do the actual work for expand_builtin_strcpy. The
3859 arguments to the builtin_strcpy call DEST and SRC are broken out
3860 so that this can also be called without constructing an actual CALL_EXPR.
3861 The other arguments and return value are the same as for
3862 expand_builtin_strcpy. */
3864 static rtx
3866 {
3868 }
3870 /* Expand a call EXP to the stpcpy builtin.
3871 Return NULL_RTX if we failed the caller should emit a normal call,
3872 otherwise try to get the result in TARGET, if convenient (and in
3873 mode MODE if that's convenient). */
3875 static rtx
3877 {
3888 {
3892 }
3894 /* If return value is ignored, transform stpcpy into strcpy. */
3896 {
3900 }
3901 else
3902 {
3904 rtx ret;
3906 /* Ensure we get an actual string whose length can be evaluated at
3907 compile-time, not an expression containing a string. This is
3908 because the latter will potentially produce pessimized code
3909 when used to produce the return value. */
3921 {
3925 {
3929 {
3931 {
3934 else
3936 }
3945 }
3946 }
3947 }
3950 }
3951 }
3953 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
3954 arguments while being careful to avoid duplicate warnings (which could
3955 be issued if the expander were to expand the call, resulting in it
3956 being emitted in expand_call(). */
3958 static rtx
3960 {
3962 {
3963 /* The call has been successfully expanded. Check for nonstring
3964 arguments and issue warnings as appropriate. */
3967 }
3970 }
3972 /* Check a call EXP to the stpncpy built-in for validity.
3973 Return NULL_RTX on both success and failure. */
3975 static rtx
3977 {
3983 /* The source and destination of the call. */
3987 /* The exact number of bytes to write (not the maximum). */
3990 /* The size of the destination object. */
3996 }
3998 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3999 bytes from constant string DATA + OFFSET and return it as target
4000 constant. */
4002 rtx
4004 scalar_int_mode mode)
4005 {
4012 }
4014 /* Helper to check the sizes of sequences and the destination of calls
4015 to __builtin_strncat and __builtin___strncat_chk. Returns true on
4016 success (no overflow or invalid sizes), false otherwise. */
4018 static bool
4020 {
4025 /* Try to determine the range of lengths that the source expression
4026 refers to. */
4030 /* Try to verify that the destination is big enough for the shortest
4031 string. */
4034 {
4035 /* If it hasn't been provided by __strncat_chk, try to determine
4036 the size of the destination object into which the source is
4037 being copied. */
4039 }
4041 /* Add one for the terminating nul. */
4044 size_one_node)
4047 /* The strncat function copies at most MAXREAD bytes and always appends
4048 the terminating nul so the specified upper bound should never be equal
4049 to (or greater than) the size of the destination. */
4052 {
4061 }
4069 /* The number of bytes to write is LEN but check_access will also
4070 check SRCLEN if LEN's value isn't known. */
4072 objsize);
4073 }
4075 /* Similar to expand_builtin_strcat, do some very basic size validation
4076 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4077 the built-in expand to a call to the library function. */
4079 static rtx
4081 {
4089 /* The upper bound on the number of bytes to write. */
4091 /* The length of the source sequence. */
4094 /* Try to determine the range of lengths that the source expression
4095 refers to. */
4099 else
4102 /* Try to verify that the destination is big enough for the shortest
4103 string. First try to determine the size of the destination object
4104 into which the source is being copied. */
4107 /* Add one for the terminating nul. */
4110 size_one_node)
4113 /* The strncat function copies at most MAXREAD bytes and always appends
4114 the terminating nul so the specified upper bound should never be equal
4115 to (or greater than) the size of the destination. */
4118 {
4127 }
4135 /* The number of bytes to write is SRCLEN. */
4139 }
4141 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4142 NULL_RTX if we failed the caller should emit a normal call. */
4144 static rtx
4146 {
4151 {
4154 /* The number of bytes to write (not the maximum). */
4156 /* The length of the source sequence. */
4160 {
4164 /* The number of bytes to write is LEN but check_access will also
4165 check SLEN if LEN's value isn't known. */
4167 destsize);
4168 }
4170 /* We must be passed a constant len and src parameter. */
4176 /* We're required to pad with trailing zeros if the requested
4177 len is greater than strlen(s2)+1. In that case try to
4178 use store_by_pieces, if it fails, punt. */
4180 {
4183 rtx dest_mem;
4187 builtin_strncpy_read_str,
4194 builtin_strncpy_read_str,
4199 }
4200 }
4202 }
4204 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4205 bytes from constant string DATA + OFFSET and return it as target
4206 constant. */
4208 rtx
4210 scalar_int_mode mode)
4211 {
4218 }
4220 /* Callback routine for store_by_pieces. Return the RTL of a register
4221 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4222 char value given in the RTL register data. For example, if mode is
4223 4 bytes wide, return the RTL for 0x01010101*data. */
4225 static rtx
4227 scalar_int_mode mode)
4228 {
4244 }
4246 /* Expand expression EXP, which is a call to the memset builtin. Return
4247 NULL_RTX if we failed the caller should emit a normal call, otherwise
4248 try to get the result in TARGET, if convenient (and in mode MODE if that's
4249 convenient). */
4251 static rtx
4253 {
4265 }
4267 /* Helper function to do the actual work for expand_builtin_memset. The
4268 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4269 so that this can also be called without constructing an actual CALL_EXPR.
4270 The other arguments and return value are the same as for
4271 expand_builtin_memset. */
4273 static rtx
4276 {
4279 machine_mode val_mode;
4291 /* If DEST is not a pointer type, don't do this operation in-line. */
4302 /* If the LEN parameter is zero, return DEST. */
4304 {
4305 /* Evaluate and ignore VAL in case it has side-effects. */
4308 }
4310 /* Stabilize the arguments in case we fail. */
4322 {
4323 rtx val_rtx;
4328 /* Assume that we can memset by pieces if we can store
4329 * the coefficients by pieces (in the required modes).
4330 * We can't pass builtin_memset_gen_str as that emits RTL. */
4336 {
4341 }
4345 probable_max_size))
4351 }
4357 {
4368 probable_max_size))
4374 }
4382 probable_max_size);
4385 {
4388 }
4392 do_libcall:
4401 else
4406 }
4408 /* Expand expression EXP, which is a call to the bzero builtin. Return
4409 NULL_RTX if we failed the caller should emit a normal call. */
4411 static rtx
4413 {
4422 /* New argument list transforming bzero(ptr x, int y) to
4423 memset(ptr x, int 0, size_t y). This is done this way
4424 so that if it isn't expanded inline, we fallback to
4425 calling bzero instead of memset. */
4433 }
4435 /* Try to expand cmpstr operation ICODE with the given operands.
4436 Return the result rtx on success, otherwise return null. */
4438 static rtx
4440 HOST_WIDE_INT align)
4441 {
4455 }
4457 /* Expand expression EXP, which is a call to the memcmp built-in function.
4458 Return NULL_RTX if we failed and the caller should emit a normal call,
4459 otherwise try to get the result in TARGET, if convenient.
4460 RESULT_EQ is true if we can relax the returned value to be either zero
4461 or nonzero, without caring about the sign. */
4463 static rtx
4465 {
4476 /* Diagnose calls where the specified length exceeds the size of either
4477 object. */
4483 {
4488 }
4490 /* If the specified length exceeds the size of either object,
4491 call the function. */
4495 /* Due to the performance benefit, always inline the calls first
4496 when result_eq is false. */
4500 {
4504 }
4512 /* If we don't have POINTER_TYPE, call the function. */
4520 /* Set MEM_SIZE as appropriate. */
4522 {
4525 }
4531 {
4535 }
4537 /* If SRC is a string constant and block move would be done
4538 by pieces, we can avoid loading the string from memory
4539 and only stored the computed constants. */
4551 {
4552 /* Return the value in the proper mode for this function. */
4557 {
4560 }
4563 }
4566 }
4568 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4569 if we failed the caller should emit a normal call, otherwise try to get
4570 the result in TARGET, if convenient. */
4572 static rtx
4574 {
4578 /* Due to the performance benefit, always inline the calls first. */
4595 /* If we don't have POINTER_TYPE, call the function. */
4599 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4606 /* Try to call cmpstrsi. */
4611 /* Try to determine at least one length and call cmpstrnsi. */
4613 {
4614 tree len;
4615 rtx arg3_rtx;
4625 /* If we don't have a constant length for the first, use the length
4626 of the second, if we know it. We don't require a constant for
4627 this case; some cost analysis could be done if both are available
4628 but neither is constant. For now, assume they're equally cheap,
4629 unless one has side effects. If both strings have constant lengths,
4630 use the smaller. */
4646 else
4649 /* If both arguments have side effects, we cannot optimize. */
4651 {
4653 result = expand_cmpstrn_or_cmpmem
4656 }
4657 }
4661 {
4662 /* Check to see if the argument was declared attribute nonstring
4663 and if so, issue a warning since at this point it's not known
4664 to be nul-terminated. */
4667 /* Return the value in the proper mode for this function. */
4675 }
4677 /* Expand the library call ourselves using a stabilized argument
4678 list to avoid re-evaluating the function's arguments twice. */
4683 }
4685 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4686 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4687 the result in TARGET, if convenient. */
4689 static rtx
4691 ATTRIBUTE_UNUSED machine_mode mode)
4692 {
4697 /* Due to the performance benefit, always inline the calls first. */
4703 /* If c_strlen can determine an expression for one of the string
4704 lengths, and it doesn't have side effects, then emit cmpstrnsi
4705 using length MIN(strlen(string)+1, arg3). */
4710 tree len;
4731 /* If we don't have a constant length for the first, use the length
4732 of the second, if we know it. If neither string is constant length,
4733 use the given length argument. We don't require a constant for
4734 this case; some cost analysis could be done if both are available
4735 but neither is constant. For now, assume they're equally cheap,
4736 unless one has side effects. If both strings have constant lengths,
4737 use the smaller. */
4755 else
4758 /* If we are not using the given length, we must incorporate it here.
4759 The actual new length parameter will be MIN(len,arg3) in this case. */
4761 {
4764 }
4774 {
4775 /* Check to see if the argument was declared attribute nonstring
4776 and if so, issue a warning since at this point it's not known
4777 to be nul-terminated. */
4780 /* Return the value in the proper mode for this function. */
4788 }
4790 /* Expand the library call ourselves using a stabilized argument
4791 list to avoid re-evaluating the function's arguments twice. */
4796 }
4798 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4799 if that's convenient. */
4801 rtx
4803 {
4804 rtx val;
4807 /* Don't do __builtin_saveregs more than once in a function.
4808 Save the result of the first call and reuse it. */
4812 /* When this function is called, it means that registers must be
4813 saved on entry to this function. So we migrate the call to the
4814 first insn of this function. */
4818 /* Do whatever the machine needs done in this case. */
4826 /* Put the insns after the NOTE that starts the function. If this
4827 is inside a start_sequence, make the outer-level insn chain current, so
4828 the code is placed at the start of the function. */
4834 }
4836 /* Expand a call to __builtin_next_arg. */
4838 static rtx
4840 {
4841 /* Checking arguments is already done in fold_builtin_next_arg
4842 that must be called before this function. */
4847 }
4849 /* Make it easier for the backends by protecting the valist argument
4850 from multiple evaluations. */
4852 static tree
4854 {
4857 /* The current way of determining the type of valist is completely
4858 bogus. We should have the information on the va builtin instead. */
4863 {
4867 /* For this case, the backends will be expecting a pointer to
4868 vatype, but it's possible we've actually been given an array
4869 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4870 So fix it. */
4872 {
4875 }
4876 }
4877 else
4878 {
4882 {
4888 }
4894 }
4897 }
4899 /* The "standard" definition of va_list is void*. */
4901 tree
4903 {
4905 }
4907 /* The "standard" abi va_list is va_list_type_node. */
4909 tree
4911 {
4913 }
4915 /* The "standard" type of va_list is va_list_type_node. */
4917 tree
4919 {
4926 {
4927 /* If va_list is an array type, the argument may have decayed
4928 to a pointer type, e.g. by being passed to another function.
4929 In that case, unwrap both types so that we can compare the
4930 underlying records. */
4933 {
4936 }
4937 }
4942 }
4944 /* The "standard" implementation of va_start: just assign `nextarg' to
4945 the variable. */
4947 void
4949 {
4952 }
4954 /* Expand EXP, a call to __builtin_va_start. */
4956 static rtx
4958 {
4959 rtx nextarg;
4960 tree valist;
4964 {
4967 }
4977 else
4981 }
4983 /* Expand EXP, a call to __builtin_va_end. */
4985 static rtx
4987 {
4990 /* Evaluate for side effects, if needed. I hate macros that don't
4991 do that. */
4996 }
4998 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4999 builtin rather than just as an assignment in stdarg.h because of the
5000 nastiness of array-type va_list types. */
5002 static rtx
5004 {
5017 {
5021 }
5022 else
5023 {
5026 /* Evaluate to pointers. */
5035 /* "Dereference" to BLKmode memories. */
5043 /* Copy. */
5045 }
5048 }
5050 /* Expand a call to one of the builtin functions __builtin_frame_address or
5051 __builtin_return_address. */
5053 static rtx
5055 {
5056 /* The argument must be a nonnegative integer constant.
5057 It counts the number of frames to scan up the stack.
5058 The value is either the frame pointer value or the return
5059 address saved in that frame. */
5061 /* Warning about missing arg was already issued. */
5064 {
5067 }
5068 else
5069 {
5070 /* Number of frames to scan up the stack. */
5075 /* Some ports cannot access arbitrary stack frames. */
5077 {
5080 }
5083 {
5084 /* Warn since no effort is made to ensure that any frame
5085 beyond the current one exists or can be safely reached. */
5088 }
5090 /* For __builtin_frame_address, return what we've got. */
5098 }
5099 }
5101 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5102 failed and the caller should emit a normal call. */
5104 static rtx
5106 {
5107 rtx op0;
5108 rtx result;
5111 HOST_WIDE_INT max_size;
5114 bool valid_arglist
5117 VOID_TYPE)
5128 || (!alloca_for_var
5131 ))
5132 {
5133 /* -Walloca-larger-than and -Wvla-larger-than settings of
5134 less than HOST_WIDE_INT_MAX override the more general
5135 -Walloc-size-larger-than so unless either of the former
5136 options is smaller than the last one (wchich would imply
5137 that the call was already checked), check the alloca
5138 arguments for overflow. */
5142 }
5144 /* Compute the argument. */
5147 /* Compute the alignment. */
5149 ? BIGGEST_ALIGNMENT
5152 /* Compute the maximum size. */
5157 /* Allocate the desired space. If the allocation stems from the declaration
5158 of a variable-sized object, it cannot accumulate. */
5159 result
5164 }
5166 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5167 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5168 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5169 handle_builtin_stack_restore function. */
5171 static rtx
5173 {
5180 OPTAB_LIB_WIDEN);
5183 OPTAB_LIB_WIDEN);
5188 }
5190 /* Expand a call to bswap builtin in EXP.
5191 Return NULL_RTX if a normal call should be emitted rather than expanding the
5192 function in-line. If convenient, the result should be placed in TARGET.
5193 SUBTARGET may be used as the target for computing one of EXP's operands. */
5195 static rtx
5197 rtx subtarget)
5198 {
5199 tree arg;
5200 rtx op0;
5218 }
5220 /* Expand a call to a unary builtin in EXP.
5221 Return NULL_RTX if a normal call should be emitted rather than expanding the
5222 function in-line. If convenient, the result should be placed in TARGET.
5223 SUBTARGET may be used as the target for computing one of EXP's operands. */
5225 static rtx
5228 {
5229 rtx op0;
5234 /* Compute the argument. */
5236 (subtarget
5240 /* Compute op, into TARGET if possible.
5241 Set TARGET to wherever the result comes back. */
5247 }
5249 /* Expand a call to __builtin_expect. We just return our argument
5250 as the builtin_expect semantic should've been already executed by
5251 tree branch prediction pass. */
5253 static rtx
5255 {
5256 tree arg;
5263 /* When guessing was done, the hints should be already stripped away. */
5267 }
5269 /* Expand a call to __builtin_expect_with_probability. We just return our
5270 argument as the builtin_expect semantic should've been already executed by
5271 tree branch prediction pass. */
5273 static rtx
5275 {
5276 tree arg;
5283 /* When guessing was done, the hints should be already stripped away. */
5287 }
5290 /* Expand a call to __builtin_assume_aligned. We just return our first
5291 argument as the builtin_assume_aligned semantic should've been already
5292 executed by CCP. */
5294 static rtx
5296 {
5300 EXPAND_NORMAL);
5305 }
5307 void
5309 {
5311 {
5313 /* For trap insns when not accumulating outgoing args force
5314 REG_ARGS_SIZE note to prevent crossjumping of calls with
5315 different args sizes. */
5318 }
5319 else
5320 {
5324 }
5327 }
5329 /* Expand a call to __builtin_unreachable. We do nothing except emit
5330 a barrier saying that control flow will not pass here.
5332 It is the responsibility of the program being compiled to ensure
5333 that control flow does never reach __builtin_unreachable. */
5334 static void
5336 {
5338 }
5340 /* Expand EXP, a call to fabs, fabsf or fabsl.
5341 Return NULL_RTX if a normal call should be emitted rather than expanding
5342 the function inline. If convenient, the result should be placed
5343 in TARGET. SUBTARGET may be used as the target for computing
5344 the operand. */
5346 static rtx
5348 {
5349 machine_mode mode;
5350 tree arg;
5351 rtx op0;
5361 }
5363 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5364 Return NULL is a normal call should be emitted rather than expanding the
5365 function inline. If convenient, the result should be placed in TARGET.
5366 SUBTARGET may be used as the target for computing the operand. */
5368 static rtx
5370 {
5372 tree arg;
5384 }
5386 /* Expand a call to __builtin___clear_cache. */
5388 static rtx
5390 {
5392 {
5393 #ifdef CLEAR_INSN_CACHE
5394 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5395 does something. Just do the default expansion to a call to
5396 __clear_cache(). */
5398 #else
5399 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5400 does nothing. There is no need to call it. Do nothing. */
5403 }
5405 /* We have a "clear_cache" insn, and it will handle everything. */
5409 /* We must not expand to a library call. If we did, any
5410 fallback library function in libgcc that might contain a call to
5411 __builtin___clear_cache() would recurse infinitely. */
5413 {
5416 }
5419 {
5432 }
5434 }
5436 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5438 static rtx
5440 {
5443 /* If we don't need too much alignment, we'll have been guaranteed
5444 proper alignment by get_trampoline_type. */
5448 /* Round address up to desired boundary. */
5459 }
5461 static rtx
5463 {
5479 /* If ONSTACK, the TRAMP argument should be the address of a field
5480 within the local function's FRAME decl. Either way, let's see if
5481 we can fill in the MEM_ATTRs for this memory. */
5485 /* Creator of a heap trampoline is responsible for making sure the
5486 address is aligned to at least STACK_BOUNDARY. Normally malloc
5487 will ensure this anyhow. */
5490 {
5494 }
5496 /* The FUNC argument should be the address of the nested function.
5497 Extract the actual function decl to pass to the hook. */
5504 /* Generate insns to initialize the trampoline. */
5508 {
5514 }
5517 }
5519 static rtx
5521 {
5522 rtx tramp;
5533 }
5535 /* Expand a call to the builtin descriptor initialization routine.
5536 A descriptor is made up of a couple of pointers to the static
5537 chain and the code entry in this order. */
5539 static rtx
5541 {
5546 VOID_TYPE))
5560 /* Generate insns to initialize the descriptor. */
5566 }
5568 /* Expand a call to the builtin descriptor adjustment routine. */
5570 static rtx
5572 {
5573 rtx tramp;
5580 /* Unalign the descriptor to allow runtime identification. */
5585 }
5587 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5588 function. The function first checks whether the back end provides
5589 an insn to implement signbit for the respective mode. If not, it
5590 checks whether the floating point format of the value is such that
5591 the sign bit can be extracted. If that is not the case, error out.
5592 EXP is the expression that is a call to the builtin function; if
5593 convenient, the result should be placed in TARGET. */
5594 static rtx
5596 {
5598 scalar_float_mode fmode;
5600 tree arg;
5603 rtx temp;
5616 /* Expand the argument yielding a RTX expression. */
5619 /* Check if the back end provides an insn that handles signbit for the
5620 argument's mode. */
5623 {
5629 }
5631 /* For floating point formats without a sign bit, implement signbit
5632 as "ARG < 0.0". */
5635 {
5636 /* But we can't do this if the format supports signed zero. */
5642 }
5645 {
5648 }
5649 else
5650 {
5652 /* Handle targets with different FP word orders. */
5655 else
5659 }
5661 /* Force the intermediate word_mode (or narrower) result into a
5662 register. This avoids attempting to create paradoxical SUBREGs
5663 of floating point modes below. */
5666 /* If the bitpos is within the "result mode" lowpart, the operation
5667 can be implement with a single bitwise AND. Otherwise, we need
5668 a right shift and an AND. */
5671 {
5679 }
5680 else
5681 {
5682 /* Perform a logical right shift to place the signbit in the least
5683 significant bit, then truncate the result to the desired mode
5684 and mask just this bit. */
5689 }
5692 }
5694 /* Expand fork or exec calls. TARGET is the desired target of the
5695 call. EXP is the call. FN is the
5696 identificator of the actual function. IGNORE is nonzero if the
5697 value is to be ignored. */
5699 static rtx
5701 {
5703 tree call;
5705 /* If we are not profiling, just call the function. */
5709 /* Otherwise call the wrapper. This should be equivalent for the rest of
5710 compiler, so the code does not diverge, and the wrapper may run the
5711 code necessary for keeping the profiling sane. */
5714 {
5745 }
5757 }
5760 \f
5761 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5762 the pointer in these functions is void*, the tree optimizers may remove
5763 casts. The mode computed in expand_builtin isn't reliable either, due
5764 to __sync_bool_compare_and_swap.
5766 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5767 group of builtins. This gives us log2 of the mode size. */
5771 {
5772 /* The size is not negotiable, so ask not to get BLKmode in return
5773 if the target indicates that a smaller size would be better. */
5775 }
5777 /* Expand the memory expression LOC and return the appropriate memory operand
5778 for the builtin_sync operations. */
5780 static rtx
5782 {
5788 /* Note that we explicitly do not want any alias information for this
5789 memory, so that we kill all other live memories. Otherwise we don't
5790 satisfy the full barrier semantics of the intrinsic. */
5793 /* The alignment needs to be at least according to that of the mode. */
5800 }
5802 /* Make sure an argument is in the right mode.
5803 EXP is the tree argument.
5804 MODE is the mode it should be in. */
5806 static rtx
5808 {
5809 rtx val;
5810 machine_mode old_mode;
5813 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5814 of CONST_INTs, where we know the old_mode only from the call argument. */
5821 }
5824 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5825 EXP is the CALL_EXPR. CODE is the rtx code
5826 that corresponds to the arithmetic or logical operation from the name;
5827 an exception here is that NOT actually means NAND. TARGET is an optional
5828 place for us to store the results; AFTER is true if this is the
5829 fetch_and_xxx form. */
5831 static rtx
5834 rtx target)
5835 {
5840 {
5847 {
5876 }
5877 }
5879 /* Expand the operands. */
5884 after);
5885 }
5887 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5888 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5889 true if this is the boolean form. TARGET is a place for us to store the
5890 results; this is NOT optional if IS_BOOL is true. */
5892 static rtx
5895 {
5899 /* Expand the operands. */
5906 {
5909 else
5911 }
5914 MEMMODEL_SYNC_SEQ_CST))
5918 }
5920 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5921 general form is actually an atomic exchange, and some targets only
5922 support a reduced form with the second argument being a constant 1.
5923 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5924 the results. */
5926 static rtx
5928 rtx target)
5929 {
5932 /* Expand the operands. */
5937 }
5939 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5941 static void
5943 {
5944 rtx mem;
5946 /* Expand the operands. */
5950 }
5952 /* Given an integer representing an ``enum memmodel'', verify its
5953 correctness and return the memory model enum. */
5955 static enum memmodel
5957 {
5958 rtx op;
5960 source_location loc
5963 /* If the parameter is not a constant, it's a run time value so we'll just
5964 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5974 {
5978 }
5980 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5982 {
5986 }
5988 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5989 be conservative and promote consume to acquire. */
5994 }
5996 /* Expand the __atomic_exchange intrinsic:
5997 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5998 EXP is the CALL_EXPR.
5999 TARGET is an optional place for us to store the results. */
6001 static rtx
6003 {
6012 /* Expand the operands. */
6017 }
6019 /* Expand the __atomic_compare_exchange intrinsic:
6020 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
6021 TYPE desired, BOOL weak,
6022 enum memmodel success,
6023 enum memmodel failure)
6024 EXP is the CALL_EXPR.
6025 TARGET is an optional place for us to store the results. */
6027 static rtx
6029 rtx target)
6030 {
6034 tree weak;
6036 source_location loc
6043 {
6045 "failure memory model cannot be stronger than success "
6048 }
6051 {
6053 "invalid failure memory model for "
6057 }
6063 /* Expand the operands. */
6079 /* Lest the rtl backend create a race condition with an imporoper store
6080 to memory, always create a new pseudo for OLDVAL. */
6087 /* Conditionally store back to EXPECT, lest we create a race condition
6088 with an improper store to memory. */
6089 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6090 the normal case where EXPECT is totally private, i.e. a register. At
6091 which point the store can be unconditional. */
6099 }
6101 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6102 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6103 call. The weak parameter must be dropped to match the expected parameter
6104 list and the expected argument changed from value to pointer to memory
6105 slot. */
6107 static void
6109 {
6125 /* Skip the boolean weak parameter. */
6128 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6131 built_in_function fncode
6136 fndecl);
6141 {
6148 }
6149 }
6151 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6153 void
6155 {
6161 tree lhs;
6163 source_location loc
6170 {
6172 "failure memory model cannot be stronger than success "
6175 }
6178 {
6180 "invalid failure memory model for "
6184 }
6187 {
6190 }
6192 /* Expand the operands. */
6205 {
6208 }
6212 {
6218 }
6219 }
6221 /* Expand the __atomic_load intrinsic:
6222 TYPE __atomic_load (TYPE *object, enum memmodel)
6223 EXP is the CALL_EXPR.
6224 TARGET is an optional place for us to store the results. */
6226 static rtx
6228 {
6229 rtx mem;
6234 {
6235 source_location loc
6240 }
6245 /* Expand the operand. */
6249 }
6252 /* Expand the __atomic_store intrinsic:
6253 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6254 EXP is the CALL_EXPR.
6255 TARGET is an optional place for us to store the results. */
6257 static rtx
6259 {
6266 {
6267 source_location loc
6272 }
6277 /* Expand the operands. */
6282 }
6284 /* Expand the __atomic_fetch_XXX intrinsic:
6285 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6286 EXP is the CALL_EXPR.
6287 TARGET is an optional place for us to store the results.
6288 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6289 FETCH_AFTER is true if returning the result of the operation.
6290 FETCH_AFTER is false if returning the value before the operation.
6291 IGNORE is true if the result is not used.
6292 EXT_CALL is the correct builtin for an external call if this cannot be
6293 resolved to an instruction sequence. */
6295 static rtx
6299 {
6302 tree fndecl;
6303 tree addr;
6307 /* Expand the operands. */
6311 /* Only try generating instructions if inlining is turned on. */
6313 {
6317 }
6319 /* Return if a different routine isn't needed for the library call. */
6323 /* Change the call to the specified function. */
6331 /* If we will emit code after the call, the call can not be a tail call.
6332 If it is emitted as a tail call, a barrier is emitted after it, and
6333 then all trailing code is removed. */
6337 /* Expand the call here so we can emit trailing code. */
6340 /* Replace the original function just in case it matters. */
6343 /* Then issue the arithmetic correction to return the right result. */
6345 {
6347 {
6349 OPTAB_LIB_WIDEN);
6351 }
6352 else
6354 OPTAB_LIB_WIDEN);
6355 }
6357 }
6359 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6361 void
6363 {
6371 optab optab;
6383 {
6398 }
6401 {
6408 }
6430 {
6435 }
6436 else
6438 OPTAB_DIRECT);
6441 }
6443 /* Expand an atomic clear operation.
6444 void _atomic_clear (BOOL *obj, enum memmodel)
6445 EXP is the call expression. */
6447 static rtx
6449 {
6450 machine_mode mode;
6459 {
6460 source_location loc
6465 }
6467 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6468 Failing that, a store is issued by __atomic_store. The only way this can
6469 fail is if the bool type is larger than a word size. Unlikely, but
6470 handle it anyway for completeness. Assume a single threaded model since
6471 there is no atomic support in this case, and no barriers are required. */
6476 }
6478 /* Expand an atomic test_and_set operation.
6479 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6480 EXP is the call expression. */
6482 static rtx
6484 {
6485 rtx mem;
6487 machine_mode mode;
6494 }
6497 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6498 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6500 static tree
6502 {
6504 machine_mode mode;
6510 /* We need a corresponding integer mode for the access to be lock-free. */
6518 {
6521 /* Either this argument is null, or it's a fake pointer encoding
6522 the alignment of the object. */
6528 else
6530 }
6531 else
6532 {
6535 /* This function is usually invoked and folded immediately by the front
6536 end before anything else has a chance to look at it. The pointer
6537 parameter at this point is usually cast to a void *, so check for that
6538 and look past the cast. */
6548 /* Get the underlying type of the object. */
6551 }
6553 /* If the object has smaller alignment, the lock free routines cannot
6554 be used. */
6558 /* Check if a compare_and_swap pattern exists for the mode which represents
6559 the required size. The pattern is not allowed to fail, so the existence
6560 of the pattern indicates support is present. Also require that an
6561 atomic load exists for the required size. */
6564 else
6566 }
6568 /* Return true if the parameters to call EXP represent an object which will
6569 always generate lock free instructions. The first argument represents the
6570 size of the object, and the second parameter is a pointer to the object
6571 itself. If NULL is passed for the object, then the result is based on
6572 typical alignment for an object of the specified size. Otherwise return
6573 false. */
6575 static rtx
6577 {
6578 tree size;
6583 {
6586 }
6592 }
6594 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6595 is lock free on this architecture. */
6597 static tree
6599 {
6603 /* If it isn't always lock free, don't generate a result. */
6608 }
6610 /* Return true if the parameters to call EXP represent an object which will
6611 always generate lock free instructions. The first argument represents the
6612 size of the object, and the second parameter is a pointer to the object
6613 itself. If NULL is passed for the object, then the result is based on
6614 typical alignment for an object of the specified size. Otherwise return
6615 NULL*/
6617 static rtx
6619 {
6620 tree size;
6625 {
6628 }
6633 /* If the value is known at compile time, return the RTX for it. */
6639 }
6641 /* Expand the __atomic_thread_fence intrinsic:
6642 void __atomic_thread_fence (enum memmodel)
6643 EXP is the CALL_EXPR. */
6645 static void
6647 {
6650 }
6652 /* Expand the __atomic_signal_fence intrinsic:
6653 void __atomic_signal_fence (enum memmodel)
6654 EXP is the CALL_EXPR. */
6656 static void
6658 {
6661 }
6663 /* Expand the __sync_synchronize intrinsic. */
6665 static void
6667 {
6669 }
6671 static rtx
6673 {
6679 {
6681 /* If the target is not sutitable then create a new target. */
6689 }
6692 }
6694 static void
6696 {
6702 {
6709 }
6711 }
6713 \f
6714 /* Emit code to restore the current value of stack. */
6716 static void
6718 {
6730 }
6732 /* Emit code to save the current value of stack. */
6734 static rtx
6736 {
6741 }
6743 /* Emit code to get the openacc gang, worker or vector id or size. */
6745 static rtx
6747 {
6749 rtx fallback_retval;
6752 {
6765 }
6768 {
6771 }
6775 {
6778 }
6782 {
6790 }
6799 {
6802 }
6810 }
6812 /* Expand a string compare operation using a sequence of char comparison
6813 to get rid of the calling overhead, with result going to TARGET if
6814 that's convenient.
6816 VAR_STR is the variable string source;
6817 CONST_STR is the constant string source;
6818 LENGTH is the number of chars to compare;
6819 CONST_STR_N indicates which source string is the constant string;
6820 IS_MEMCMP indicates whether it's a memcmp or strcmp.
6822 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
6824 target = (int) (unsigned char) var_str[0]
6825 - (int) (unsigned char) const_str[0];
6826 if (target != 0)
6827 goto ne_label;
6828 ...
6829 target = (int) (unsigned char) var_str[length - 2]
6830 - (int) (unsigned char) const_str[length - 2];
6831 if (target != 0)
6832 goto ne_label;
6833 target = (int) (unsigned char) var_str[length - 1]
6834 - (int) (unsigned char) const_str[length - 1];
6835 ne_label:
6836 */
6838 static rtx
6842 {
6844 rtx var_rtx_array
6851 scalar_int_mode unit_mode
6857 {
6858 var_rtx
6872 }
6880 }
6882 /* Inline expansion a call to str(n)cmp, with result going to
6883 TARGET if that's convenient.
6884 If the call is not been inlined, return NULL_RTX. */
6885 static rtx
6887 {
6893 /* Do NOT apply this inlining expansion when optimizing for size or
6894 optimization level below 2. */
6902 /* On a target where the type of the call (int) has same or narrower presicion
6903 than unsigned char, give up the inlining expansion. */
6919 /* If neither strings is constant string, the call is not qualify. */
6923 /* For strncmp, if the length is not a const, not qualify. */
6934 else
6943 /* If the length of the comparision is larger than the threshold,
6944 do nothing. */
6951 /* Now, start inline expansion the call. */
6955 }
6957 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
6958 represents the size of the first argument to that call, or VOIDmode
6959 if the argument is a pointer. IGNORE will be true if the result
6960 isn't used. */
6961 static rtx
6964 {
6971 {
6974 }
6978 /* An optional second argument can be used as a failsafe value on
6979 some machines. If it isn't present, then the failsafe value is
6980 assumed to be 0. */
6982 {
6985 }
6986 else
6989 /* If the result isn't used, the behavior is undefined. It would be
6990 nice to emit a warning here, but path splitting means this might
6991 happen with legitimate code. So simply drop the builtin
6992 expansion in that case; we've handled any side-effects above. */
6996 /* If we don't have a suitable target, create one to hold the result. */
7004 }
7006 /* Expand an expression EXP that calls a built-in function,
7007 with result going to TARGET if that's convenient
7008 (and in mode MODE if that's convenient).
7009 SUBTARGET may be used as the target for computing one of EXP's operands.
7010 IGNORE is nonzero if the value is to be ignored. */
7012 rtx
7015 {
7024 /* When ASan is enabled, we don't want to expand some memory/string
7025 builtins and rely on libsanitizer's hooks. This allows us to avoid
7026 redundant checks and be sure, that possible overflow will be detected
7027 by ASan. */
7032 /* When not optimizing, generate calls to library functions for a certain
7033 set of builtins. */
7047 /* The built-in function expanders test for target == const0_rtx
7048 to determine whether the function's result will be ignored. */
7052 /* If the result of a pure or const built-in function is ignored, and
7053 none of its arguments are volatile, we can avoid expanding the
7054 built-in call and just evaluate the arguments for side-effects. */
7058 {
7060 tree arg;
7061 call_expr_arg_iterator iter;
7065 {
7068 }
7071 {
7075 }
7076 }
7079 {
7097 /* Just do a normal library call if we were unable to fold
7098 the values. */
7175 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7176 FUNCTION with a copy of the parameters described by
7177 ARGUMENTS, and ARGSIZE. It returns a block of memory
7178 allocated on the stack into which is stored all the registers
7179 that might possibly be used for returning the result of a
7180 function. ARGUMENTS is the value returned by
7181 __builtin_apply_args. ARGSIZE is the number of bytes of
7182 arguments that must be copied. ??? How should this value be
7183 computed? We'll also need a safe worst case value for varargs
7184 functions. */
7191 else
7192 {
7200 }
7202 /* __builtin_return (RESULT) causes the function to return the
7203 value described by RESULT. RESULT is address of the block of
7204 memory returned by __builtin_apply. */
7214 /* All valid uses of __builtin_va_arg_pack () are removed during
7215 inlining. */
7220 /* All valid uses of __builtin_va_arg_pack_len () are removed during
7221 inlining. */
7225 /* Return the address of the first anonymous stack arg. */
7247 /* Returns the address of the area where the structure is returned.
7248 0 otherwise. */
7254 else
7257 CASE_BUILT_IN_ALLOCA:
7407 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7408 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7409 when changing it to a strcmp call. */
7415 /* Change this call back to a BUILT_IN_STRCMP. */
7419 /* Delete the last parameter. */
7426 /* FALLTHROUGH */
7434 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7435 back to a BUILT_IN_STRNCMP. */
7441 /* Change it back to a BUILT_IN_STRNCMP. */
7444 /* FALLTHROUGH */
7459 {
7462 }
7466 /* This should have been lowered to the builtins below. */
7470 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7471 and the receiver label. */
7473 {
7479 /* This is copied from the handling of non-local gotos. */
7481 nonlocal_goto_handler_labels
7483 nonlocal_goto_handler_labels);
7484 /* ??? Do not let expand_label treat us as such since we would
7485 not want to be both on the list of non-local labels and on
7486 the list of forced labels. */
7489 }
7493 /* __builtin_setjmp_receiver is passed the receiver label. */
7495 {
7501 }
7504 /* __builtin_longjmp is passed a pointer to an array of five words.
7505 It's similar to the C library longjmp function but works with
7506 __builtin_setjmp above. */
7509 {
7515 {
7518 }
7522 }
7531 /* This updates the setjmp buffer that is its argument with the value
7532 of the current stack pointer. */
7535 {
7536 rtx buf_addr
7541 }
7561 /* Various hooks for the DWARF 2 __throw routine. */
7567 #ifdef DWARF2_UNWIND_INFO
7573 #endif
7775 mode = get_builtin_sync_mode
7787 mode = get_builtin_sync_mode
7834 {
7838 mode =
7844 /* If this is turned into an external library call, the weak parameter
7845 must be dropped to match the expected parameter list. */
7850 /* Skip the boolean weak parameter. */
7855 }
7884 {
7894 }
7900 {
7910 }
7916 {
7926 }
7932 {
7942 }
7948 {
7958 }
7964 {
7974 }
8111 /* Do library call, if we failed to expand the builtin when
8112 folding. */
8132 }
8134 /* The switch statement above can drop through to cause the function
8135 to be called normally. */
8137 }
8139 /* Determine whether a tree node represents a call to a built-in
8140 function. If the tree T is a call to a built-in function with
8141 the right number of arguments of the appropriate types, return
8142 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8143 Otherwise the return value is END_BUILTINS. */
8145 enum built_in_function
8147 {
8150 const_call_expr_arg_iterator iter;
8162 {
8163 /* If a function doesn't take a variable number of arguments,
8164 the last element in the list will have type `void'. */
8167 {
8171 }
8180 {
8183 }
8185 {
8188 }
8190 {
8193 }
8195 {
8198 }
8199 else
8201 }
8203 /* Variable-length argument list. */
8205 }
8207 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
8208 evaluate to a constant. */
8210 static tree
8212 {
8213 /* We return 1 for a numeric type that's known to be a constant
8214 value at compile-time or for an aggregate type that's a
8215 literal constant. */
8218 /* If we know this is a constant, emit the constant of one. */
8224 {
8231 }
8233 /* If this expression has side effects, show we don't know it to be a
8234 constant. Likewise if it's a pointer or aggregate type since in
8235 those case we only want literals, since those are only optimized
8236 when generating RTL, not later.
8237 And finally, if we are compiling an initializer, not code, we
8238 need to return a definite result now; there's not going to be any
8239 more optimization done. */
8244 || folding_initializer
8249 }
8251 /* Create builtin_expect or builtin_expect_with_probability
8252 with PRED and EXPECTED as its arguments and return it as a truthvalue.
8253 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
8254 builtin_expect_with_probability instead uses third argument as PROBABILITY
8255 value. */
8257 static tree
8260 {
8275 else
8277 predictor);
8281 }
8283 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
8284 NULL_TREE if no simplification is possible. */
8286 tree
8288 tree arg3)
8289 {
8293 /* Distribute the expected value over short-circuiting operators.
8294 See through the cast from truthvalue_type_node to long. */
8301 /* If this is a builtin_expect within a builtin_expect keep the
8302 inner one. See through a comparison against a constant. It
8303 might have been added to create a thruthvalue. */
8319 {
8329 }
8331 /* If the argument isn't invariant then there's nothing else we can do. */
8335 /* If we expect that a comparison against the argument will fold to
8336 a constant return the constant. In practice, this means a true
8337 constant or the address of a non-weak symbol. */
8341 {
8342 do
8343 {
8345 }
8350 }
8352 /* Otherwise, ARG0 already has the proper type for the return value. */
8354 }
8356 /* Fold a call to __builtin_classify_type with argument ARG. */
8358 static tree
8360 {
8365 }
8367 /* Fold a call to __builtin_strlen with argument ARG. */
8369 static tree
8371 {
8374 else
8375 {
8382 }
8383 }
8385 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8387 static tree
8389 {
8390 REAL_VALUE_TYPE real;
8392 /* __builtin_inff is intended to be usable to define INFINITY on all
8393 targets. If an infinity is not available, INFINITY expands "to a
8394 positive constant of type float that overflows at translation
8395 time", footnote "In this case, using INFINITY will violate the
8396 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8397 Thus we pedwarn to ensure this constraint violation is
8398 diagnosed. */
8404 }
8406 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8407 NULL_TREE if no simplification can be made. */
8409 static tree
8412 {
8413 tree type;
8423 /* Calculate the result when the argument is a constant. */
8428 /* Canonicalize sincos to cexpi. */
8430 {
8433 }
8435 {
8442 }
8454 }
8456 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8457 Return NULL_TREE if no simplification can be made. */
8459 static tree
8461 {
8467 /* If the LEN parameter is zero, return zero. */
8472 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8476 /* If len parameter is one, return an expression corresponding to
8477 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8479 {
8481 tree cst_uchar_ptr_node
8484 tree ind1
8488 cst_uchar_ptr_node,
8489 arg1)));
8490 tree ind2
8494 cst_uchar_ptr_node,
8495 arg2)));
8497 }
8500 }
8502 /* Fold a call to builtin isascii with argument ARG. */
8504 static tree
8506 {
8509 else
8510 {
8511 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8517 }
8518 }
8520 /* Fold a call to builtin toascii with argument ARG. */
8522 static tree
8524 {
8528 /* Transform toascii(c) -> (c & 0x7f). */
8531 }
8533 /* Fold a call to builtin isdigit with argument ARG. */
8535 static tree
8537 {
8540 else
8541 {
8542 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8543 /* According to the C standard, isdigit is unaffected by locale.
8544 However, it definitely is affected by the target character set. */
8545 unsigned HOST_WIDE_INT target_digit0
8556 }
8557 }
8559 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8561 static tree
8563 {
8569 }
8571 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8573 static tree
8575 {
8581 }
8583 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8585 static tree
8587 {
8590 {
8594 {
8599 }
8600 }
8603 }
8605 /* Fold a call to builtin frexp, we can assume the base is 2. */
8607 static tree
8609 {
8620 /* Proceed if a valid pointer type was passed in. */
8622 {
8627 {
8629 /* For +-0, return (*exp = 0, +-0). */
8635 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8638 {
8639 /* Since the frexp function always expects base 2, and in
8640 GCC normalized significands are already in the range
8641 [0.5, 1.0), we have exactly what frexp wants. */
8646 }
8650 }
8652 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8656 }
8659 }
8661 /* Fold a call to builtin modf. */
8663 static tree
8665 {
8676 /* Proceed if a valid pointer type was passed in. */
8678 {
8683 {
8686 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8690 /* For +-Inf, return (*arg1 = arg0, +-0). */
8696 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8699 /* If the original number was negative and already
8700 integral, then the fractional part is -0.0. */
8704 }
8706 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8712 }
8715 }
8717 /* Given a location LOC, an interclass builtin function decl FNDECL
8718 and its single argument ARG, return an folded expression computing
8719 the same, or NULL_TREE if we either couldn't or didn't want to fold
8720 (the latter happen if there's an RTL instruction available). */
8722 static tree
8724 {
8725 machine_mode mode;
8737 /* If there is no optab, try generic code. */
8739 {
8740 tree result;
8743 {
8744 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8747 REAL_VALUE_TYPE r;
8751 {
8752 /* NaN and Inf are encoded in the high-order double value
8753 only. The low-order value is not significant. */
8757 }
8764 }
8767 {
8768 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8771 REAL_VALUE_TYPE r;
8775 {
8776 /* NaN and Inf are encoded in the high-order double value
8777 only. The low-order value is not significant. */
8781 }
8787 /*result = fold_build2_loc (loc, UNGT_EXPR,
8788 TREE_TYPE (TREE_TYPE (fndecl)),
8789 fold_build1_loc (loc, ABS_EXPR, type, arg),
8790 build_real (type, r));
8791 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8792 TREE_TYPE (TREE_TYPE (fndecl)),
8793 result);*/
8795 }
8797 {
8798 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8799 islessequal(fabs(x),DBL_MAX). */
8809 {
8810 /* Use double to test the normal range of IBM extended
8811 precision. Emin for IBM extended precision is
8812 different to emin for IEEE double, being 53 higher
8813 since the low double exponent is at least 53 lower
8814 than the high double exponent. */
8818 }
8830 {
8831 /* Testing the high end of the range is done just using
8832 the high double, using the same test as isfinite().
8833 For the subnormal end of the range we first test the
8834 high double, then if its magnitude is equal to the
8835 limit of 0x1p-969, we test whether the low double is
8836 non-zero and opposite sign to the high double. */
8852 integer_type_node,
8858 }
8859 else
8860 {
8861 tree const isge_fn
8864 }
8868 }
8871 }
8874 }
8876 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8877 ARG is the argument for the call. */
8879 static tree
8881 {
8888 {
8896 {
8897 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8898 /* In a boolean context, GCC will fold the inner COND_EXPR to
8899 1. So e.g. "if (isinf_sign(x))" would be folded to just
8900 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8908 {
8921 integer_zero_node);
8922 }
8925 }
8938 {
8941 {
8942 /* NaN and Inf are encoded in the high-order double value
8943 only. The low-order value is not significant. */
8945 }
8946 }
8952 }
8953 }
8955 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8956 This builtin will generate code to return the appropriate floating
8957 point classification depending on the value of the floating point
8958 number passed in. The possible return values must be supplied as
8959 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8960 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8961 one floating point argument which is "type generic". */
8963 static tree
8965 {
8968 machine_mode mode;
8969 REAL_VALUE_TYPE r;
8972 /* Verify the required arguments in the original call. */
8992 /* fpclassify(x) ->
8993 isnan(x) ? FP_NAN :
8994 (fabs(x) == Inf ? FP_INFINITE :
8995 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8996 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9010 {
9016 }
9019 {
9022 }
9025 }
9027 /* Fold a call to an unordered comparison function such as
9028 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9029 being called and ARG0 and ARG1 are the arguments for the call.
9030 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9031 the opposite of the desired result. UNORDERED_CODE is used
9032 for modes that can hold NaNs and ORDERED_CODE is used for
9033 the rest. */
9035 static tree
9039 {
9053 /* Choose the wider of two real types. */
9065 {
9069 }
9074 }
9076 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9077 arithmetics if it can never overflow, or into internal functions that
9078 return both result of arithmetics and overflowed boolean flag in
9079 a complex integer result, or some other check for overflow.
9080 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9081 checking part of that. */
9083 static tree
9086 {
9088 /* The code of the expression corresponding to the type-generic
9089 built-in, or ERROR_MARK for the type-specific ones. */
9094 {
9097 /* FALLTHRU */
9100 /* FALLTHRU */
9111 /* FALLTHRU */
9114 /* FALLTHRU */
9125 /* FALLTHRU */
9128 /* FALLTHRU */
9139 }
9141 /* For the "generic" overloads, the first two arguments can have different
9142 types and the last argument determines the target type to use to check
9143 for overflow. The arguments of the other overloads all have the same
9144 type. */
9147 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
9148 arguments are constant, attempt to fold the built-in call into a constant
9149 expression indicating whether or not it detected an overflow. */
9153 /* Perform the computation in the target type and check for overflow. */
9157 arg2);
9171 tree store
9174 }
9176 /* Fold a call to __builtin_FILE to a constant string. */
9180 {
9182 {
9183 /* The documentation says this builtin is equivalent to the preprocessor
9184 __FILE__ macro so it appears appropriate to use the same file prefix
9185 mappings. */
9188 }
9191 }
9193 /* Fold a call to __builtin_FUNCTION to a constant string. */
9197 {
9204 }
9206 /* Fold a call to __builtin_LINE to an integer constant. */
9210 {
9212 }
9214 /* Fold a call to built-in function FNDECL with 0 arguments.
9215 This function returns NULL_TREE if no simplification was possible. */
9217 static tree
9219 {
9223 {
9249 }
9251 }
9253 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9254 This function returns NULL_TREE if no simplification was possible. */
9256 static tree
9258 {
9269 {
9271 {
9274 /* Gimplification will pull the CALL_EXPR for the builtin out of
9275 an if condition. When not optimizing, we'll not CSE it back.
9276 To avoid link error types of regressions, return false now. */
9281 }
9337 {
9342 }
9348 {
9353 }
9374 }
9378 }
9380 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9381 This function returns NULL_TREE if no simplification was possible. */
9383 static tree
9385 {
9397 {
9441 NOP_EXPR);
9443 /* We do the folding for va_start in the expander. */
9458 }
9460 }
9462 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9463 and ARG2.
9464 This function returns NULL_TREE if no simplification was possible. */
9466 static tree
9469 {
9483 {
9532 }
9534 }
9536 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9537 arguments. IGNORE is true if the result of the
9538 function call is ignored. This function returns NULL_TREE if no
9539 simplification was possible. */
9541 tree
9543 {
9547 {
9563 }
9565 {
9569 }
9571 }
9573 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9574 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9575 of arguments in ARGS to be omitted. OLDNARGS is the number of
9576 elements in ARGS. */
9578 static tree
9581 {
9586 {
9594 }
9595 else
9599 }
9601 /* Return true if FNDECL shouldn't be folded right now.
9602 If a built-in function has an inline attribute always_inline
9603 wrapper, defer folding it after always_inline functions have
9604 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9605 might not be performed. */
9607 bool
9609 {
9612 && cfun
9615 }
9617 /* A wrapper function for builtin folding that prevents warnings for
9618 "statement without effect" and the like, caused by removing the
9619 call node earlier than the warning is generated. */
9621 tree
9623 {
9627 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9628 yet. Defer folding until we see all the arguments
9629 (after inlining). */
9631 {
9634 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9635 instead last argument is __builtin_va_arg_pack (). Defer folding
9636 even in that case, until arguments are finalized. */
9638 {
9642 }
9650 else
9651 {
9656 }
9657 }
9659 }
9661 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9662 N arguments are passed in the array ARGARRAY. Return a folded
9663 expression or NULL_TREE if no simplification was possible. */
9665 tree
9667 tree fn,
9670 {
9677 {
9678 /* If last argument is __builtin_va_arg_pack (), arguments to this
9679 function are not finalized yet. Defer folding until they are. */
9681 {
9685 }
9690 else
9692 }
9695 }
9697 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9698 along with N new arguments specified as the "..." parameters. SKIP
9699 is the number of arguments in EXP to be omitted. This function is used
9700 to do varargs-to-varargs transformations. */
9702 static tree
9704 {
9706 tree t;
9714 }
9716 /* Validate a single argument ARG against a tree code CODE representing
9717 a type. Return true when argument is valid. */
9719 static bool
9721 {
9729 }
9731 /* This function validates the types of a function call argument list
9732 against a specified list of tree_codes. If the last specifier is a 0,
9733 that represents an ellipses, otherwise the last specifier must be a
9734 VOID_TYPE.
9736 This is the GIMPLE version of validate_arglist. Eventually we want to
9737 completely convert builtins.c to work from GIMPLEs and the tree based
9738 validate_arglist will then be removed. */
9740 bool
9742 {
9746 const_tree arg;
9752 do
9753 {
9756 {
9758 /* This signifies an ellipses, any further arguments are all ok. */
9762 /* This signifies an endlink, if no arguments remain, return
9763 true, otherwise return false. */
9767 /* If no parameters remain or the parameter's code does not
9768 match the specified code, return false. Otherwise continue
9769 checking any remaining arguments. */
9774 }
9775 }
9778 /* We need gotos here since we can only have one VA_CLOSE in a
9779 function. */
9780 end: ;
9784 }
9786 /* Default target-specific builtin expander that does nothing. */
9788 rtx
9790 rtx target ATTRIBUTE_UNUSED,
9791 rtx subtarget ATTRIBUTE_UNUSED,
9792 machine_mode mode ATTRIBUTE_UNUSED,
9794 {
9796 }
9798 /* Returns true is EXP represents data that would potentially reside
9799 in a readonly section. */
9801 bool
9803 {
9813 /* Make sure we call decl_readonly_section only for trees it
9814 can handle (since it returns true for everything it doesn't
9815 understand). */
9820 else
9822 }
9824 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9825 to the call, and TYPE is its return type.
9827 Return NULL_TREE if no simplification was possible, otherwise return the
9828 simplified form of the call as a tree.
9830 The simplified form may be a constant or other expression which
9831 computes the same value, but in a more efficient manner (including
9832 calls to other builtin functions).
9834 The call may contain arguments which need to be evaluated, but
9835 which are not useful to determine the result of the call. In
9836 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9837 COMPOUND_EXPR will be an argument which must be evaluated.
9838 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9839 COMPOUND_EXPR in the chain will contain the tree for the simplified
9840 form of the builtin function call. */
9842 static tree
9844 {
9848 else
9849 {
9850 tree fn;
9859 {
9861 tree tem;
9866 /* Return an offset into the constant string argument. */
9869 }
9872 /* strpbrk(x, "") == NULL.
9873 Evaluate and ignore s1 in case it had side-effects. */
9883 /* New argument list transforming strpbrk(s1, s2) to
9884 strchr(s1, s2[0]). */
9887 }
9888 }
9890 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9891 to the call.
9893 Return NULL_TREE if no simplification was possible, otherwise return the
9894 simplified form of the call as a tree.
9896 The simplified form may be a constant or other expression which
9897 computes the same value, but in a more efficient manner (including
9898 calls to other builtin functions).
9900 The call may contain arguments which need to be evaluated, but
9901 which are not useful to determine the result of the call. In
9902 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9903 COMPOUND_EXPR will be an argument which must be evaluated.
9904 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9905 COMPOUND_EXPR in the chain will contain the tree for the simplified
9906 form of the builtin function call. */
9908 static tree
9910 {
9914 else
9915 {
9918 /* If either argument is "", return NULL_TREE. */
9920 /* Evaluate and ignore both arguments in case either one has
9921 side-effects. */
9925 }
9926 }
9928 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9929 to the call.
9931 Return NULL_TREE if no simplification was possible, otherwise return the
9932 simplified form of the call as a tree.
9934 The simplified form may be a constant or other expression which
9935 computes the same value, but in a more efficient manner (including
9936 calls to other builtin functions).
9938 The call may contain arguments which need to be evaluated, but
9939 which are not useful to determine the result of the call. In
9940 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9941 COMPOUND_EXPR will be an argument which must be evaluated.
9942 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9943 COMPOUND_EXPR in the chain will contain the tree for the simplified
9944 form of the builtin function call. */
9946 static tree
9948 {
9952 else
9953 {
9954 /* If the first argument is "", return NULL_TREE. */
9957 {
9958 /* Evaluate and ignore argument s2 in case it has
9959 side-effects. */
9962 }
9964 /* If the second argument is "", return __builtin_strlen(s1). */
9967 {
9970 /* If the replacement _DECL isn't initialized, don't do the
9971 transformation. */
9976 }
9978 }
9979 }
9981 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9982 produced. False otherwise. This is done so that we don't output the error
9983 or warning twice or three times. */
9985 bool
9987 {
9990 tree arg;
9991 /* There is good chance the current input_location points inside the
9992 definition of the va_start macro (perhaps on the token for
9993 builtin) in a system header, so warnings will not be emitted.
9994 Use the location in real source code. */
9995 source_location current_location =
9997 NULL);
10000 {
10003 }
10006 {
10008 {
10011 }
10013 }
10014 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
10015 when we checked the arguments and if needed issued a warning. */
10016 else
10017 {
10019 {
10020 /* Evidently an out of date version of <stdarg.h>; can't validate
10021 va_start's second argument, but can still work as intended. */
10023 OPT_Wvarargs,
10026 }
10028 {
10031 }
10033 }
10038 /* We destructively modify the call to be __builtin_va_start (ap, 0)
10039 or __builtin_next_arg (0) the first time we see it, after checking
10040 the arguments and if needed issuing a warning. */
10042 {
10045 /* Strip off all nops for the sake of the comparison. This
10046 is not quite the same as STRIP_NOPS. It does more.
10047 We must also strip off INDIRECT_EXPR for C++ reference
10048 parameters. */
10053 {
10054 /* FIXME: Sometimes with the tree optimizers we can get the
10055 not the last argument even though the user used the last
10056 argument. We just warn and set the arg to be the last
10057 argument so that we will get wrong-code because of
10058 it. */
10060 OPT_Wvarargs,
10062 }
10064 /* Undefined by C99 7.15.1.4p4 (va_start):
10065 "If the parameter parmN is declared with the register storage
10066 class, with a function or array type, or with a type that is
10067 not compatible with the type that results after application of
10068 the default argument promotions, the behavior is undefined."
10069 */
10071 {
10073 OPT_Wvarargs,
10074 "undefined behavior when second parameter of "
10076 }
10078 /* We want to verify the second parameter just once before the tree
10079 optimizers are run and then avoid keeping it in the tree,
10080 as otherwise we could warn even for correct code like:
10081 void foo (int i, ...)
10082 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
10085 else
10087 }
10089 }
10092 /* Expand a call EXP to __builtin_object_size. */
10094 static rtx
10096 {
10097 tree ost;
10102 {
10107 }
10115 {
10120 }
10125 }
10127 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10128 FCODE is the BUILT_IN_* to use.
10129 Return NULL_RTX if we failed; the caller should emit a normal call,
10130 otherwise try to get the result in TARGET, if convenient (and in
10131 mode MODE if that's convenient). */
10133 static rtx
10136 {
10138 POINTER_TYPE,
10139 fcode == BUILT_IN_MEMSET_CHK
10156 {
10157 /* Avoid transforming the checking call to an ordinary one when
10158 an overflow has been detected or when the call couldn't be
10159 validated because the size is not constant. */
10164 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10165 mem{cpy,pcpy,move,set} is available. */
10167 {
10182 }
10191 }
10194 else
10195 {
10198 /* If DEST is not a pointer type, call the normal function. */
10202 /* If SRC and DEST are the same (and not volatile), do nothing. */
10204 {
10205 tree expr;
10208 {
10209 /* Evaluate and ignore LEN in case it has side-effects. */
10212 }
10216 }
10218 /* __memmove_chk special case. */
10220 {
10226 /* If src is categorized for a readonly section we can use
10227 normal __memcpy_chk. */
10229 {
10238 }
10239 }
10241 }
10242 }
10244 /* Emit warning if a buffer overflow is detected at compile time. */
10246 static void
10248 {
10249 /* The source string. */
10251 /* The size of the destination object. */
10253 /* The string that is being concatenated with (as in __strcat_chk)
10254 or null if it isn't. */
10256 /* The maximum length of the source sequence in a bounded operation
10257 (such as __strncat_chk) or null if the operation isn't bounded
10258 (such as __strcat_chk). */
10260 /* The exact size of the access (such as in __strncpy_chk). */
10264 {
10272 /* For __strcat_chk the warning will be emitted only if overflowing
10273 by at least strlen (dest) + 1 bytes. */
10300 }
10303 {
10304 /* Check __strncat_chk. There is no way to determine the length
10305 of the string to which the source string is being appended so
10306 just warn when the length of the source string is not known. */
10309 }
10311 /* The destination argument is the first one for all built-ins above. */
10315 }
10317 /* Emit warning if a buffer overflow is detected at compile time
10318 in __sprintf_chk/__vsprintf_chk calls. */
10320 static void
10322 {
10327 /* Verify the required arguments in the original call. */
10337 /* Check whether the format is a literal string constant. */
10345 /* If the format doesn't contain % args or %%, we know its size. */
10348 /* If the format is "%s" and first ... argument is a string literal,
10349 we know it too. */
10352 {
10353 tree arg;
10364 }
10365 else
10368 /* Add one for the terminating nul. */
10373 }
10375 /* Emit warning if a free is called with address of a variable. */
10377 static void
10379 {
10393 else
10396 }
10398 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10399 if possible. */
10401 static tree
10403 {
10420 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10421 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10422 and (size_t) 0 for types 2 and 3. */
10427 {
10431 }
10433 {
10434 /* If object size is not known yet, delay folding until
10435 later. Maybe subsequent passes will help determining
10436 it. */
10440 }
10443 }
10445 /* Builtins with folding operations that operate on "..." arguments
10446 need special handling; we need to store the arguments in a convenient
10447 data structure before attempting any folding. Fortunately there are
10448 only a few builtins that fall into this category. FNDECL is the
10449 function, EXP is the CALL_EXPR for the call. */
10451 static tree
10453 {
10458 {
10465 }
10467 {
10472 }
10474 }
10476 /* Initialize format string characters in the target charset. */
10478 bool
10480 {
10483 {
10506 }
10508 }
10510 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10511 and no overflow/underflow occurred. INEXACT is true if M was not
10512 exactly calculated. TYPE is the tree type for the result. This
10513 function assumes that you cleared the MPFR flags and then
10514 calculated M to see if anything subsequently set a flag prior to
10515 entering this function. Return NULL_TREE if any checks fail. */
10517 static tree
10519 {
10520 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10521 overflow/underflow occurred. If -frounding-math, proceed iff the
10522 result of calling FUNC was exact. */
10525 {
10526 REAL_VALUE_TYPE rr;
10529 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10530 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10531 but the mpft_t is not, then we underflowed in the
10532 conversion. */
10535 {
10536 REAL_VALUE_TYPE rmode;
10539 /* Proceed iff the specified mode can hold the value. */
10542 }
10543 }
10545 }
10547 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10548 number and no overflow/underflow occurred. INEXACT is true if M
10549 was not exactly calculated. TYPE is the tree type for the result.
10550 This function assumes that you cleared the MPFR flags and then
10551 calculated M to see if anything subsequently set a flag prior to
10552 entering this function. Return NULL_TREE if any checks fail, if
10553 FORCE_CONVERT is true, then bypass the checks. */
10555 static tree
10557 {
10558 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10559 overflow/underflow occurred. If -frounding-math, proceed iff the
10560 result of calling FUNC was exact. */
10565 {
10570 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10571 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10572 but the mpft_t is not, then we underflowed in the
10573 conversion. */
10578 {
10583 /* Proceed iff the specified mode can hold the value. */
10589 }
10590 }
10592 }
10594 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10595 the pointer *(ARG_QUO) and return the result. The type is taken
10596 from the type of ARG0 and is used for setting the precision of the
10597 calculation and results. */
10599 static tree
10601 {
10608 /* To proceed, MPFR must exactly represent the target floating point
10609 format, which only happens when the target base equals two. */
10613 {
10618 {
10622 tree result_rem;
10631 /* Remquo is independent of the rounding mode, so pass
10632 inexact=0 to do_mpfr_ckconv(). */
10636 {
10637 /* MPFR calculates quo in the host's long so it may
10638 return more bits in quo than the target int can hold
10639 if sizeof(host long) > sizeof(target int). This can
10640 happen even for native compilers in LP64 mode. In
10641 these cases, modulo the quo value with the largest
10642 number that the target int can hold while leaving one
10643 bit for the sign. */
10647 /* Dereference the quo pointer argument. */
10649 /* Proceed iff a valid pointer type was passed in. */
10651 {
10652 /* Set the value. */
10653 tree result_quo
10656 integer_quo));
10658 /* Combine the quo assignment with the rem. */
10661 }
10662 }
10663 }
10664 }
10666 }
10668 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10669 resulting value as a tree with type TYPE. The mpfr precision is
10670 set to the precision of TYPE. We assume that this mpfr function
10671 returns zero if the result could be calculated exactly within the
10672 requested precision. In addition, the integer pointer represented
10673 by ARG_SG will be dereferenced and set to the appropriate signgam
10674 (-1,1) value. */
10676 static tree
10678 {
10683 /* To proceed, MPFR must exactly represent the target floating point
10684 format, which only happens when the target base equals two. Also
10685 verify ARG is a constant and that ARG_SG is an int pointer. */
10690 {
10693 /* In addition to NaN and Inf, the argument cannot be zero or a
10694 negative integer. */
10698 {
10703 mpfr_t m;
10704 tree result_lg;
10713 {
10714 tree result_sg;
10716 /* Dereference the arg_sg pointer argument. */
10718 /* Assign the signgam value into *arg_sg. */
10723 /* Combine the signgam assignment with the lgamma result. */
10726 }
10727 }
10728 }
10731 }
10733 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10734 mpc function FUNC on it and return the resulting value as a tree
10735 with type TYPE. The mpfr precision is set to the precision of
10736 TYPE. We assume that function FUNC returns zero if the result
10737 could be calculated exactly within the requested precision. If
10738 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10739 in the arguments and/or results. */
10741 tree
10744 {
10750 /* To proceed, MPFR must exactly represent the target floating point
10751 format, which only happens when the target base equals two. */
10757 {
10766 {
10786 }
10787 }
10790 }
10792 /* A wrapper function for builtin folding that prevents warnings for
10793 "statement without effect" and the like, caused by removing the
10794 call node earlier than the warning is generated. */
10796 tree
10798 {
10804 {
10813 {
10815 }
10816 else
10817 {
10820 {
10821 /* Propagate location information from original call to
10822 expansion of builtin. Otherwise things like
10823 maybe_emit_chk_warning, that operate on the expansion
10824 of a builtin, will use the wrong location information. */
10826 {
10834 }
10836 }
10837 }
10838 }
10840 }
10842 /* Look up the function in builtin_decl that corresponds to DECL
10843 and set ASMSPEC as its user assembler name. DECL must be a
10844 function decl that declares a builtin. */
10846 void
10848 {
10857 {
10861 }
10862 }
10864 /* Return true if DECL is a builtin that expands to a constant or similarly
10865 simple code. */
10866 bool
10868 {
10871 {
10872 /* Builtins that expand to constants. */
10877 /* Simple register moves or loads from stack. */
10888 /* Exception state returns or moves registers around. */
10896 }
10899 }
10901 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10902 most probably expanded inline into reasonably simple code. This is a
10903 superset of is_simple_builtin. */
10904 bool
10906 {
10913 {
10915 CASE_BUILT_IN_ALLOCA:
10981 }
10984 }
10986 /* Return true if T is a constant and the value cast to a target char
10987 can be represented by a host char.
10988 Store the casted char constant in *P if so. */
10990 bool
10992 {
10998 }
11000 /* Return the maximum object size. */
11002 tree
11004 {
11005 /* To do: Make this a configurable parameter. */
11007 }