| blob | 820d6c262b09e47092daeb4cb0389c34fd6b5b56 |
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. */
76 #if SWITCHABLE_TARGET
78 #endif
80 /* Define the names of the builtin function types and codes. */
84 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
86 {
88 };
90 /* Setup an array of builtin_info_type, make sure each element decl is
91 initialized to NULL_TREE. */
94 /* Non-zero if __builtin_constant_p should be folded right away. */
194 /* Return true if NAME starts with __builtin_ or __sync_. */
196 static bool
198 {
206 }
209 /* Return true if DECL is a function symbol representing a built-in. */
211 bool
213 {
215 }
217 /* Return true if NODE should be considered for inline expansion regardless
218 of the optimization level. This means whenever a function is invoked with
219 its "internal" name, which normally contains the prefix "__builtin". */
221 bool
223 {
224 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
225 we want the name used to call the function, not the name it
226 will have. */
229 }
231 /* Compute values M and N such that M divides (address of EXP - N) and such
232 that N < M. If these numbers can be determined, store M in alignp and N in
233 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
234 *alignp and any bit-offset to *bitposp.
236 Note that the address (and thus the alignment) computed here is based
237 on the address to which a symbol resolves, whereas DECL_ALIGN is based
238 on the address at which an object is actually located. These two
239 addresses are not always the same. For example, on ARM targets,
240 the address &foo of a Thumb function foo() has the lowest bit set,
241 whereas foo() itself starts on an even address.
243 If ADDR_P is true we are taking the address of the memory reference EXP
244 and thus cannot rely on the access taking place. */
246 static bool
249 {
251 tree offset;
252 machine_mode mode;
257 /* Get the innermost object and the constant (bitpos) and possibly
258 variable (offset) offset of the access. */
262 /* Extract alignment information from the innermost object and
263 possibly adjust bitpos and offset. */
265 {
266 /* Function addresses can encode extra information besides their
267 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
268 allows the low bit to be used as a virtual bit, we know
269 that the address itself must be at least 2-byte aligned. */
272 }
274 ;
276 {
277 /* The alignment of a CONST_DECL is determined by its initializer. */
284 }
286 {
289 }
293 {
299 /* If the address is explicitely aligned, handle that. */
302 {
307 }
309 known_alignment
313 /* Re-apply explicit alignment to the bitpos. */
316 /* The alignment of the pointer operand in a TARGET_MEM_REF
317 has to take the variable offset parts into account. */
319 {
321 {
326 }
330 }
332 /* When EXP is an actual memory reference then we can use
333 TYPE_ALIGN of a pointer indirection to derive alignment.
334 Do so only if get_pointer_alignment_1 did not reveal absolute
335 alignment knowledge and if using that alignment would
336 improve the situation. */
342 else
343 {
344 /* Else adjust bitpos accordingly. */
349 }
350 }
352 {
353 /* STRING_CST are the only constant objects we allow to be not
354 wrapped inside a CONST_DECL. */
360 }
362 /* If there is a non-constant offset part extract the maximum
363 alignment that can prevail. */
365 {
368 {
372 }
373 }
375 /* Account for the alignment of runtime coefficients, so that the constant
376 bitpos is guaranteed to be accurate. */
379 {
382 }
387 }
389 /* For a memory reference expression EXP compute values M and N such that M
390 divides (&EXP - N) and such that N < M. If these numbers can be determined,
391 store M in alignp and N in *BITPOSP and return true. Otherwise return false
392 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
394 bool
397 {
399 }
401 /* Return the alignment in bits of EXP, an object. */
403 unsigned int
405 {
411 /* align and bitpos now specify known low bits of the pointer.
412 ptr & (align - 1) == bitpos. */
417 }
419 /* For a pointer valued expression EXP compute values M and N such that M
420 divides (EXP - N) and such that N < M. If these numbers can be determined,
421 store M in alignp and N in *BITPOSP and return true. Return false if
422 the results are just a conservative approximation.
424 If EXP is not a pointer, false is returned too. */
426 bool
429 {
436 {
443 else
444 {
447 {
451 }
452 }
456 }
459 {
464 {
467 /* Make sure to return a sensible alignment when the multiplication
468 by BITS_PER_UNIT overflowed. */
471 /* We cannot really tell whether this result is an approximation. */
473 }
474 else
475 {
479 }
480 }
482 {
487 }
492 }
494 /* Return the alignment in bits of EXP, a pointer valued expression.
495 The alignment returned is, by default, the alignment of the thing that
496 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
498 Otherwise, look at the expression to see if we can do better, i.e., if the
499 expression is actually pointing at an object whose alignment is tighter. */
501 unsigned int
503 {
509 /* align and bitpos now specify known low bits of the pointer.
510 ptr & (align - 1) == bitpos. */
516 }
518 /* Return the number of non-zero elements in the sequence
519 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
520 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
522 static unsigned
524 {
530 {
531 /* Optimize the common case of plain char. */
533 {
537 }
538 }
539 else
540 {
542 {
546 }
547 }
549 }
551 /* Compute the length of a null-terminated character string or wide
552 character string handling character sizes of 1, 2, and 4 bytes.
553 TREE_STRING_LENGTH is not the right way because it evaluates to
554 the size of the character array in bytes (as opposed to characters)
555 and because it can contain a zero byte in the middle.
557 ONLY_VALUE should be nonzero if the result is not going to be emitted
558 into the instruction stream and zero if it is going to be expanded.
559 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
560 is returned, otherwise NULL, since
561 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
562 evaluate the side-effects.
564 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
565 accesses. Note that this implies the result is not going to be emitted
566 into the instruction stream.
568 The value returned is of type `ssizetype'.
570 Unfortunately, string_constant can't access the values of const char
571 arrays with initializers, so neither can we do so here. */
573 tree
575 {
579 {
586 }
594 /* Offset from the beginning of the string in bytes. */
595 tree byteoff;
600 /* Determine the size of the string element. */
601 unsigned eltsize
604 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
605 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
606 in case the latter is less than the size of the array. */
615 /* PTR can point to the byte representation of any string type, including
616 char* and wchar_t*. */
620 {
621 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
622 compute the offset to the following null if we don't know where to
623 start searching for it. */
625 {
626 /* Return when an embedded null character is found. */
628 }
633 /* We don't know the starting offset, but we do know that the string
634 has no internal zero bytes. We can assume that the offset falls
635 within the bounds of the string; otherwise, the programmer deserves
636 what he gets. Subtract the offset from the length of the string,
637 and return that. This would perhaps not be valid if we were dealing
638 with named arrays in addition to literal string constants. */
640 }
642 /* Offset from the beginning of the string in elements. */
643 HOST_WIDE_INT eltoff;
645 /* We have a known offset into the string. Start searching there for
646 a null character if we can represent it as a single HOST_WIDE_INT. */
651 else
654 /* If the offset is known to be out of bounds, warn, and call strlen at
655 runtime. */
657 {
658 /* Suppress multiple warnings for propagated constant strings. */
661 {
664 eltoff);
666 }
668 }
670 /* Use strlen to search for the first zero byte. Since any strings
671 constructed with build_string will have nulls appended, we win even
672 if we get handed something like (char[4])"abcd".
674 Since ELTOFF is our starting index into the string, no further
675 calculation is needed. */
680 }
682 /* Return a constant integer corresponding to target reading
683 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
685 static rtx
687 {
688 HOST_WIDE_INT ch;
702 {
714 }
718 }
720 /* Cast a target constant CST to target CHAR and if that value fits into
721 host char type, return zero and put that value into variable pointed to by
722 P. */
724 static int
726 {
733 /* Do not care if it fits or not right here. */
748 }
750 /* Similar to save_expr, but assumes that arbitrary code is not executed
751 in between the multiple evaluations. In particular, we assume that a
752 non-addressable local variable will not be modified. */
754 static tree
756 {
764 }
766 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
767 times to get the address of either a higher stack frame, or a return
768 address located within it (depending on FNDECL_CODE). */
770 static rtx
772 {
776 {
777 /* For a zero count with __builtin_return_address, we don't care what
778 frame address we return, because target-specific definitions will
779 override us. Therefore frame pointer elimination is OK, and using
780 the soft frame pointer is OK.
782 For a nonzero count, or a zero count with __builtin_frame_address,
783 we require a stable offset from the current frame pointer to the
784 previous one, so we must use the hard frame pointer, and
785 we must disable frame pointer elimination. */
788 else
789 {
792 /* Tell reload not to eliminate the frame pointer. */
794 }
795 }
800 /* On the SPARC, the return address is not in the frame, it is in a
801 register. There is no way to access it off of the current frame
802 pointer, but it can be accessed off the previous frame pointer by
803 reading the value from the register window save area. */
805 count--;
807 /* Scan back COUNT frames to the specified frame. */
809 {
810 /* Assume the dynamic chain pointer is in the word that the
811 frame address points to, unless otherwise specified. */
816 }
818 /* For __builtin_frame_address, return what we've got. But, on
819 the SPARC for example, we may have to add a bias. */
823 /* For __builtin_return_address, get the return address from that frame. */
824 #ifdef RETURN_ADDR_RTX
826 #else
830 #endif
832 }
834 /* Alias set used for setjmp buffer. */
837 /* Construct the leading half of a __builtin_setjmp call. Control will
838 return to RECEIVER_LABEL. This is also called directly by the SJLJ
839 exception handling code. */
841 void
843 {
845 rtx stack_save;
846 rtx mem;
855 /* We store the frame pointer and the address of receiver_label in
856 the buffer and use the rest of it for the stack save area, which
857 is machine-dependent. */
876 /* If there is further processing to do, do it. */
880 /* We have a nonlocal label. */
882 }
884 /* Construct the trailing part of a __builtin_setjmp call. This is
885 also called directly by the SJLJ exception handling code.
886 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
888 void
890 {
891 rtx chain;
893 /* Mark the FP as used when we get here, so we have to make sure it's
894 marked as used by this function. */
897 /* Mark the static chain as clobbered here so life information
898 doesn't get messed up for it. */
903 /* Now put in the code to restore the frame pointer, and argument
904 pointer, if needed. */
906 {
907 /* First adjust our frame pointer to its actual value. It was
908 previously set to the start of the virtual area corresponding to
909 the stacked variables when we branched here and now needs to be
910 adjusted to the actual hardware fp value.
912 Assignments to virtual registers are converted by
913 instantiate_virtual_regs into the corresponding assignment
914 to the underlying register (fp in this case) that makes
915 the original assignment true.
916 So the following insn will actually be decrementing fp by
917 TARGET_STARTING_FRAME_OFFSET. */
920 /* Restoring the frame pointer also modifies the hard frame pointer.
921 Mark it used (so that the previous assignment remains live once
922 the frame pointer is eliminated) and clobbered (to represent the
923 implicit update from the assignment). */
926 }
929 {
930 /* If the argument pointer can be eliminated in favor of the
931 frame pointer, we don't need to restore it. We assume here
932 that if such an elimination is present, it can always be used.
933 This is the case on all known machines; if we don't make this
934 assumption, we do unnecessary saving on many machines. */
944 {
945 /* Now restore our arg pointer from the address at which it
946 was saved in our stack frame. */
949 }
950 }
956 else
959 /* We must not allow the code we just generated to be reordered by
960 scheduling. Specifically, the update of the frame pointer must
961 happen immediately, not later. */
963 }
965 /* __builtin_longjmp is passed a pointer to an array of five words (not
966 all will be used on all machines). It operates similarly to the C
967 library function of the same name, but is more efficient. Much of
968 the code below is copied from the handling of non-local gotos. */
970 static void
972 {
977 /* DRAP is needed for stack realign if longjmp is expanded to current
978 function */
989 /* We require that the user must pass a second argument of 1, because
990 that is what builtin_setjmp will return. */
996 else
997 {
1008 /* Pick up FP, label, and SP from the block and jump. This code is
1009 from expand_goto in stmt.c; see there for detailed comments. */
1011 /* We have to pass a value to the nonlocal_goto pattern that will
1012 get copied into the static_chain pointer, but it does not matter
1013 what that value is, because builtin_setjmp does not use it. */
1015 else
1016 {
1028 }
1029 }
1031 /* Search backwards and mark the jump insn as a non-local goto.
1032 Note that this precludes the use of __builtin_longjmp to a
1033 __builtin_setjmp target in the same function. However, we've
1034 already cautioned the user that these functions are for
1035 internal exception handling use only. */
1037 {
1041 {
1044 }
1047 }
1048 }
1052 {
1054 }
1056 /* This function validates the types of a function call argument list
1057 against a specified list of tree_codes. If the last specifier is a 0,
1058 that represents an ellipsis, otherwise the last specifier must be a
1059 VOID_TYPE. */
1061 static bool
1063 {
1067 const_call_expr_arg_iterator iter;
1068 const_tree arg;
1073 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1078 {
1082 {
1084 /* This signifies an ellipses, any further arguments are all ok. */
1088 /* This signifies an endlink, if no arguments remain, return
1089 true, otherwise return false. */
1093 /* The actual argument must be nonnull when either the whole
1094 called function has been declared nonnull, or when the formal
1095 argument corresponding to the actual argument has been. */
1098 {
1103 }
1104 /* FALLTHRU */
1106 /* If no parameters remain or the parameter's code does not
1107 match the specified code, return false. Otherwise continue
1108 checking any remaining arguments. */
1113 }
1114 }
1116 /* We need gotos here since we can only have one VA_CLOSE in a
1117 function. */
1118 end: ;
1124 }
1126 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1127 and the address of the save area. */
1129 static rtx
1131 {
1146 /* Copy the address of the save location to a register just in case it was
1147 based on the frame pointer. */
1156 /* ??? We no longer need to pass the static chain value, afaik. */
1159 else
1160 {
1166 /* Restore frame pointer for containing function. */
1170 /* USE of hard_frame_pointer_rtx added for consistency;
1171 not clear if really needed. */
1175 /* If the architecture is using a GP register, we must
1176 conservatively assume that the target function makes use of it.
1177 The prologue of functions with nonlocal gotos must therefore
1178 initialize the GP register to the appropriate value, and we
1179 must then make sure that this value is live at the point
1180 of the jump. (Note that this doesn't necessarily apply
1181 to targets with a nonlocal_goto pattern; they are free
1182 to implement it in their own way. Note also that this is
1183 a no-op if the GP register is a global invariant.) */
1189 }
1191 /* Search backwards to the jump insn and mark it as a
1192 non-local goto. */
1194 {
1196 {
1199 }
1202 }
1205 }
1207 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1208 (not all will be used on all machines) that was passed to __builtin_setjmp.
1209 It updates the stack pointer in that block to the current value. This is
1210 also called directly by the SJLJ exception handling code. */
1212 void
1214 {
1217 rtx stack_save
1219 memory_address
1225 }
1227 /* Expand a call to __builtin_prefetch. For a target that does not support
1228 data prefetch, evaluate the memory address argument in case it has side
1229 effects. */
1231 static void
1233 {
1243 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1244 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1245 locality). */
1249 else
1253 else
1256 /* Argument 0 is an address. */
1259 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1261 {
1264 }
1266 /* Argument 1 must be either zero or one. */
1268 {
1272 }
1274 /* Argument 2 (locality) must be a compile-time constant int. */
1276 {
1279 }
1281 /* Argument 2 must be 0, 1, 2, or 3. */
1283 {
1286 }
1289 {
1297 }
1299 /* Don't do anything with direct references to volatile memory, but
1300 generate code to handle other side effects. */
1303 }
1305 /* Get a MEM rtx for expression EXP which is the address of an operand
1306 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1307 the maximum length of the block of memory that might be accessed or
1308 NULL if unknown. */
1310 static rtx
1312 {
1316 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1317 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1324 /* Get an expression we can use to find the attributes to assign to MEM.
1325 First remove any nops. */
1330 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1331 (as builtin stringops may alias with anything). */
1338 /* If the MEM_REF has no acceptable address, try to get the base object
1339 from the original address we got, and build an all-aliasing
1340 unknown-sized access to that one. */
1346 {
1351 size_zero_node,
1352 NULL)),
1355 }
1358 }
1359 \f
1360 /* Built-in functions to perform an untyped call and return. */
1362 #define apply_args_mode \
1363 (this_target_builtins->x_apply_args_mode)
1364 #define apply_result_mode \
1365 (this_target_builtins->x_apply_result_mode)
1367 /* Return the size required for the block returned by __builtin_apply_args,
1368 and initialize apply_args_mode. */
1370 static int
1372 {
1377 /* The values computed by this function never change. */
1379 {
1380 /* The first value is the incoming arg-pointer. */
1383 /* The second value is the structure value address unless this is
1384 passed as an "invisible" first argument. */
1390 {
1400 }
1401 else
1402 {
1404 }
1405 }
1407 }
1409 /* Return the size required for the block returned by __builtin_apply,
1410 and initialize apply_result_mode. */
1412 static int
1414 {
1418 /* The values computed by this function never change. */
1420 {
1425 {
1435 }
1436 else
1439 /* Allow targets that use untyped_call and untyped_return to override
1440 the size so that machine-specific information can be stored here. */
1441 #ifdef APPLY_RESULT_SIZE
1443 #endif
1444 }
1446 }
1448 /* Create a vector describing the result block RESULT. If SAVEP is true,
1449 the result block is used to save the values; otherwise it is used to
1450 restore the values. */
1452 static rtx
1454 {
1456 fixed_size_mode mode;
1463 {
1473 }
1475 }
1477 /* Save the state required to perform an untyped call with the same
1478 arguments as were passed to the current function. */
1480 static rtx
1482 {
1485 fixed_size_mode mode;
1486 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1488 /* Create a block where the arg-pointer, structure value address,
1489 and argument registers can be saved. */
1492 /* Walk past the arg-pointer and structure value address. */
1497 /* Save each register used in calling a function to the block. */
1500 {
1509 }
1511 /* Save the arg pointer to the block. */
1513 /* We need the pointer as the caller actually passed them to us, not
1514 as we might have pretended they were passed. Make sure it's a valid
1515 operand, as emit_move_insn isn't expected to handle a PLUS. */
1517 tem
1520 NULL_RTX);
1525 /* Save the structure value address unless this is passed as an
1526 "invisible" first argument. */
1528 {
1532 }
1534 /* Return the address of the block. */
1536 }
1538 /* __builtin_apply_args returns block of memory allocated on
1539 the stack into which is stored the arg pointer, structure
1540 value address, static chain, and all the registers that might
1541 possibly be used in performing a function call. The code is
1542 moved to the start of the function so the incoming values are
1543 saved. */
1545 static rtx
1547 {
1548 /* Don't do __builtin_apply_args more than once in a function.
1549 Save the result of the first call and reuse it. */
1552 {
1553 /* When this function is called, it means that registers must be
1554 saved on entry to this function. So we migrate the
1555 call to the first insn of this function. */
1556 rtx temp;
1565 /* Put the insns after the NOTE that starts the function.
1566 If this is inside a start_sequence, make the outer-level insn
1567 chain current, so the code is placed at the start of the
1568 function. If internal_arg_pointer is a non-virtual pseudo,
1569 it needs to be placed after the function that initializes
1570 that pseudo. */
1575 else
1579 }
1580 }
1582 /* Perform an untyped call and save the state required to perform an
1583 untyped return of whatever value was returned by the given function. */
1585 static rtx
1587 {
1589 fixed_size_mode mode;
1598 /* Create a block where the return registers can be saved. */
1601 /* Fetch the arg pointer from the ARGUMENTS block. */
1608 /* Push a new argument block and copy the arguments. Do not allow
1609 the (potential) memcpy call below to interfere with our stack
1610 manipulations. */
1612 NO_DEFER_POP;
1614 /* Save the stack with nonlocal if available. */
1617 else
1620 /* Allocate a block of memory onto the stack and copy the memory
1621 arguments to the outgoing arguments address. We can pass TRUE
1622 as the 4th argument because we just saved the stack pointer
1623 and will restore it right after the call. */
1626 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1627 may have already set current_function_calls_alloca to true.
1628 current_function_calls_alloca won't be set if argsize is zero,
1629 so we have to guarantee need_drap is true here. */
1635 {
1638 else
1640 }
1647 /* Refer to the argument block. */
1652 /* Walk past the arg-pointer and structure value address. */
1657 /* Restore each of the registers previously saved. Make USE insns
1658 for each of these registers for use in making the call. */
1661 {
1669 }
1671 /* Restore the structure value address unless this is passed as an
1672 "invisible" first argument. */
1675 {
1682 }
1684 /* All arguments and registers used for the call are set up by now! */
1687 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1688 and we don't want to load it into a register as an optimization,
1689 because prepare_call_address already did it if it should be done. */
1693 /* Generate the actual call instruction and save the return value. */
1695 {
1699 }
1701 {
1704 /* Locate the unique return register. It is not possible to
1705 express a call that sets more than one return register using
1706 call_value; use untyped_call for that. In fact, untyped_call
1707 only needs to save the return registers in the given block. */
1710 {
1714 }
1721 }
1722 else
1725 /* Find the CALL insn we just emitted, and attach the register usage
1726 information. */
1730 /* Restore the stack. */
1733 else
1737 OK_DEFER_POP;
1739 /* Return the address of the result block. */
1742 }
1744 /* Perform an untyped return. */
1746 static void
1748 {
1750 fixed_size_mode mode;
1751 rtx reg;
1760 {
1765 }
1767 /* Restore the return value and note that each value is used. */
1771 {
1783 }
1785 /* Put the USE insns before the return. */
1788 /* Return whatever values was restored by jumping directly to the end
1789 of the function. */
1791 }
1793 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1795 static enum type_class
1797 {
1799 {
1818 }
1819 }
1821 /* Expand a call EXP to __builtin_classify_type. */
1823 static rtx
1825 {
1829 }
1831 /* This helper macro, meant to be used in mathfn_built_in below, determines
1832 which among a set of builtin math functions is appropriate for a given type
1833 mode. The `F' (float) and `L' (long double) are automatically generated
1834 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1835 types, there are additional types that are considered with 'F32', 'F64',
1836 'F128', etc. suffixes. */
1837 #define CASE_MATHFN(MATHFN) \
1838 CASE_CFN_##MATHFN: \
1839 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1840 fcodel = BUILT_IN_##MATHFN##L ; break;
1841 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1842 types. */
1843 #define CASE_MATHFN_FLOATN(MATHFN) \
1844 CASE_CFN_##MATHFN: \
1845 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1846 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1847 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1848 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1849 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1850 break;
1851 /* Similar to above, but appends _R after any F/L suffix. */
1852 #define CASE_MATHFN_REENT(MATHFN) \
1853 case CFN_BUILT_IN_##MATHFN##_R: \
1854 case CFN_BUILT_IN_##MATHFN##F_R: \
1855 case CFN_BUILT_IN_##MATHFN##L_R: \
1856 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1857 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1859 /* Return a function equivalent to FN but operating on floating-point
1860 values of type TYPE, or END_BUILTINS if no such function exists.
1861 This is purely an operation on function codes; it does not guarantee
1862 that the target actually has an implementation of the function. */
1864 static built_in_function
1866 {
1867 tree mtype;
1878 {
1969 }
1992 else
1994 }
1996 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1997 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1998 otherwise use the explicit declaration. If we can't do the conversion,
1999 return null. */
2001 static tree
2003 {
2012 }
2014 /* Like mathfn_built_in_1, but always use the implicit array. */
2016 tree
2018 {
2020 }
2022 /* Like mathfn_built_in_1, but take a built_in_function and
2023 always use the implicit array. */
2025 tree
2027 {
2029 }
2031 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2032 return its code, otherwise return IFN_LAST. Note that this function
2033 only tests whether the function is defined in internals.def, not whether
2034 it is actually available on the target. */
2036 internal_fn
2038 {
2042 {
2043 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2044 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2045 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2046 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2047 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2048 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2049 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2066 }
2067 }
2069 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2070 on the current target by a call to an internal function, return the
2071 code of that internal function, otherwise return IFN_LAST. The caller
2072 is responsible for ensuring that any side-effects of the built-in
2073 call are dealt with correctly. E.g. if CALL sets errno, the caller
2074 must decide that the errno result isn't needed or make it available
2075 in some other way. */
2077 internal_fn
2079 {
2081 {
2084 {
2089 }
2090 }
2092 }
2094 /* Expand a call to the builtin trinary math functions (fma).
2095 Return NULL_RTX if a normal call should be emitted rather than expanding the
2096 function in-line. EXP is the expression that is a call to the builtin
2097 function; if convenient, the result should be placed in TARGET.
2098 SUBTARGET may be used as the target for computing one of EXP's
2099 operands. */
2101 static rtx
2103 {
2104 optab builtin_optab;
2109 machine_mode mode;
2119 {
2125 }
2127 /* Make a suitable register to place result in. */
2130 /* Before working hard, check whether the instruction is available. */
2136 /* Always stabilize the argument list. */
2147 /* Compute into RESULT.
2148 Set RESULT to wherever the result comes back. */
2152 /* If we were unable to expand via the builtin, stop the sequence
2153 (without outputting the insns) and call to the library function
2154 with the stabilized argument list. */
2156 {
2159 }
2161 /* Output the entire sequence. */
2167 }
2169 /* Expand a call to the builtin sin and cos math functions.
2170 Return NULL_RTX if a normal call should be emitted rather than expanding the
2171 function in-line. EXP is the expression that is a call to the builtin
2172 function; if convenient, the result should be placed in TARGET.
2173 SUBTARGET may be used as the target for computing one of EXP's
2174 operands. */
2176 static rtx
2178 {
2179 optab builtin_optab;
2180 rtx op0;
2183 machine_mode mode;
2184 tree arg;
2192 {
2198 }
2200 /* Make a suitable register to place result in. */
2203 /* Check if sincos insn is available, otherwise fallback
2204 to sin or cos insn. */
2207 {
2214 }
2216 /* Before working hard, check whether the instruction is available. */
2218 {
2221 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2222 need to expand the argument again. This way, we will not perform
2223 side-effects more the once. */
2230 /* Compute into RESULT.
2231 Set RESULT to wherever the result comes back. */
2233 {
2237 {
2246 }
2248 }
2249 else
2253 {
2254 /* Output the entire sequence. */
2259 }
2261 /* If we were unable to expand via the builtin, stop the sequence
2262 (without outputting the insns) and call to the library function
2263 with the stabilized argument list. */
2265 }
2268 }
2270 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2271 return an RTL instruction code that implements the functionality.
2272 If that isn't possible or available return CODE_FOR_nothing. */
2274 static enum insn_code
2276 {
2279 machine_mode mode;
2282 {
2296 /* These builtins have no optabs (yet). */
2300 }
2302 /* There's no easy way to detect the case we need to set EDOM. */
2306 /* Optab mode depends on the mode of the input argument. */
2312 }
2314 /* Expand a call to one of the builtin math functions that operate on
2315 floating point argument and output an integer result (ilogb, isinf,
2316 isnan, etc).
2317 Return 0 if a normal call should be emitted rather than expanding the
2318 function in-line. EXP is the expression that is a call to the builtin
2319 function; if convenient, the result should be placed in TARGET. */
2321 static rtx
2323 {
2325 rtx op0;
2327 machine_mode mode;
2328 tree arg;
2338 {
2343 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2344 need to expand the argument again. This way, we will not perform
2345 side-effects more the once. */
2360 }
2363 }
2365 /* Expand a call to the builtin sincos math function.
2366 Return NULL_RTX if a normal call should be emitted rather than expanding the
2367 function in-line. EXP is the expression that is a call to the builtin
2368 function. */
2370 static rtx
2372 {
2374 machine_mode mode;
2388 /* Make a suitable register to place result in. */
2391 /* Check if sincos insn is available, otherwise emit the call. */
2406 /* Compute into target1 and target2.
2407 Set TARGET to wherever the result comes back. */
2411 /* Move target1 and target2 to the memory locations indicated
2412 by op1 and op2. */
2417 }
2419 /* Expand a call to the internal cexpi builtin to the sincos math function.
2420 EXP is the expression that is a call to the builtin function; if convenient,
2421 the result should be placed in TARGET. */
2423 static rtx
2425 {
2428 machine_mode mode;
2439 /* Try expanding via a sincos optab, fall back to emitting a libcall
2440 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2441 is only generated from sincos, cexp or if we have either of them. */
2443 {
2449 /* Compute into op1 and op2. */
2451 }
2453 {
2464 else
2474 /* Make sure not to fold the sincos call again. */
2478 }
2479 else
2480 {
2490 else
2493 /* If we don't have a decl for cexp create one. This is the
2494 friendliest fallback if the user calls __builtin_cexpi
2495 without full target C99 function support. */
2497 {
2498 tree fntype;
2510 }
2515 /* Make sure not to fold the cexp call again. */
2519 }
2521 /* Now build the proper return type. */
2526 }
2528 /* Conveniently construct a function call expression. FNDECL names the
2529 function to be called, N is the number of arguments, and the "..."
2530 parameters are the argument expressions. Unlike build_call_exr
2531 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2533 static tree
2535 {
2545 }
2547 /* Expand a call to one of the builtin rounding functions gcc defines
2548 as an extension (lfloor and lceil). As these are gcc extensions we
2549 do not need to worry about setting errno to EDOM.
2550 If expanding via optab fails, lower expression to (int)(floor(x)).
2551 EXP is the expression that is a call to the builtin function;
2552 if convenient, the result should be placed in TARGET. */
2554 static rtx
2556 {
2557 convert_optab builtin_optab;
2562 tree fallback_fndecl;
2563 machine_mode mode;
2564 tree arg;
2572 {
2589 }
2591 /* Make a suitable register to place result in. */
2596 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2597 need to expand the argument again. This way, we will not perform
2598 side-effects more the once. */
2605 /* Compute into TARGET. */
2607 {
2608 /* Output the entire sequence. */
2613 }
2615 /* If we were unable to expand via the builtin, stop the sequence
2616 (without outputting the insns). */
2619 /* Fall back to floating point rounding optab. */
2622 /* For non-C99 targets we may end up without a fallback fndecl here
2623 if the user called __builtin_lfloor directly. In this case emit
2624 a call to the floor/ceil variants nevertheless. This should result
2625 in the best user experience for not full C99 targets. */
2627 {
2628 tree fntype;
2632 {
2665 }
2670 }
2677 /* Truncate the result of floating point optab to integer
2678 via expand_fix (). */
2683 }
2685 /* Expand a call to one of the builtin math functions doing integer
2686 conversion (lrint).
2687 Return 0 if a normal call should be emitted rather than expanding the
2688 function in-line. EXP is the expression that is a call to the builtin
2689 function; if convenient, the result should be placed in TARGET. */
2691 static rtx
2693 {
2694 convert_optab builtin_optab;
2695 rtx op0;
2698 tree arg;
2699 machine_mode mode;
2708 {
2727 }
2729 /* There's no easy way to detect the case we need to set EDOM. */
2733 /* Make a suitable register to place result in. */
2736 /* There's no easy way to detect the case we need to set EDOM. */
2738 {
2741 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2742 need to expand the argument again. This way, we will not perform
2743 side-effects more the once. */
2751 {
2752 /* Output the entire sequence. */
2757 }
2759 /* If we were unable to expand via the builtin, stop the sequence
2760 (without outputting the insns) and call to the library function
2761 with the stabilized argument list. */
2763 }
2766 {
2767 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2768 targets, (int) round (x) should never be transformed into
2769 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2770 a call to lround in the hope that the target provides at least some
2771 C99 functions. This should result in the best user experience for
2772 not full C99 targets. */
2773 tree fallback_fndecl = mathfn_built_in_1
2782 }
2785 }
2787 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2788 a normal call should be emitted rather than expanding the function
2789 in-line. EXP is the expression that is a call to the builtin
2790 function; if convenient, the result should be placed in TARGET. */
2792 static rtx
2794 {
2797 machine_mode mode;
2798 machine_mode mode2;
2807 /* Emit a libcall to libgcc. */
2809 /* Mode of the 2nd argument must match that of an int. */
2827 }
2829 /* Expand expression EXP which is a call to the strlen builtin. Return
2830 NULL_RTX if we failed and the caller should emit a normal call, otherwise
2831 try to get the result in TARGET, if convenient. */
2833 static rtx
2835 machine_mode target_mode)
2836 {
2841 rtx pat;
2842 tree len;
2844 rtx src_reg;
2846 machine_mode insn_mode;
2850 /* If the length can be computed at compile-time, return it. */
2855 /* If the length can be computed at compile-time and is constant
2856 integer, but there are side-effects in src, evaluate
2857 src for side-effects, then return len.
2858 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2859 can be optimized into: i++; x = 3; */
2862 {
2865 }
2869 /* If SRC is not a pointer type, don't do this operation inline. */
2873 /* Bail out if we can't compute strlen in the right mode. */
2875 {
2879 }
2883 /* Make a place to hold the source address. We will not expand
2884 the actual source until we are sure that the expansion will
2885 not fail -- there are trees that cannot be expanded twice. */
2888 /* Mark the beginning of the strlen sequence so we can emit the
2889 source operand later. */
2899 /* Check to see if the argument was declared attribute nonstring
2900 and if so, issue a warning since at this point it's not known
2901 to be nul-terminated. */
2904 /* Now that we are assured of success, expand the source. */
2908 {
2909 #ifdef POINTERS_EXTEND_UNSIGNED
2912 POINTERS_EXTEND_UNSIGNED);
2913 #endif
2915 }
2921 else
2924 /* Return the value in the proper mode for this function. */
2929 else
2933 }
2935 /* Expand call EXP to the strnlen built-in, returning the result
2936 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
2938 static rtx
2940 {
2960 {
2964 "%K%qD specified bound %E "
2975 }
2988 "%K%qD specified bound [%wu, %wu] "
3001 }
3003 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3004 bytes from constant string DATA + OFFSET and return it as target
3005 constant. */
3007 static rtx
3009 scalar_int_mode mode)
3010 {
3018 }
3020 /* LEN specify length of the block of memcpy/memset operation.
3021 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3022 In some cases we can make very likely guess on max size, then we
3023 set it into PROBABLE_MAX_SIZE. */
3025 static void
3030 {
3032 {
3035 }
3036 else
3037 {
3041 /* Determine bounds from the type. */
3044 else
3049 else
3055 {
3060 }
3062 {
3063 /* Anti range 0...N lets us to determine minimal size to N+1. */
3065 {
3068 }
3069 /* Code like
3071 int n;
3072 if (n < 100)
3073 memcpy (a, b, n)
3075 Produce anti range allowing negative values of N. We still
3076 can use the information and make a guess that N is not negative.
3077 */
3080 }
3081 }
3085 }
3087 /* Try to verify that the sizes and lengths of the arguments to a string
3088 manipulation function given by EXP are within valid bounds and that
3089 the operation does not lead to buffer overflow or read past the end.
3090 Arguments other than EXP may be null. When non-null, the arguments
3091 have the following meaning:
3092 DST is the destination of a copy call or NULL otherwise.
3093 SRC is the source of a copy call or NULL otherwise.
3094 DSTWRITE is the number of bytes written into the destination obtained
3095 from the user-supplied size argument to the function (such as in
3096 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3097 MAXREAD is the user-supplied bound on the length of the source sequence
3098 (such as in strncat(d, s, N). It specifies the upper limit on the number
3099 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3100 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3101 expression EXP is a string function call (as opposed to a memory call
3102 like memcpy). As an exception, SRCSTR can also be an integer denoting
3103 the precomputed size of the source string or object (for functions like
3104 memcpy).
3105 DSTSIZE is the size of the destination object specified by the last
3106 argument to the _chk builtins, typically resulting from the expansion
3107 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3108 DSTSIZE).
3110 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3111 SIZE_MAX.
3113 If the call is successfully verified as safe return true, otherwise
3114 return false. */
3116 static bool
3119 {
3122 /* The size of the largest object is half the address space, or
3123 PTRDIFF_MAX. (This is way too permissive.) */
3126 /* Either the length of the source string for string functions or
3127 the size of the source object for raw memory functions. */
3132 /* Set to true when the exact number of bytes written by a string
3133 function like strcpy is not known and the only thing that is
3134 known is that it must be at least one (for the terminating nul). */
3137 {
3138 /* SRCSTR is normally a pointer to string but as a special case
3139 it can be an integer denoting the length of a string. */
3141 {
3142 /* Try to determine the range of lengths the source string
3143 refers to. If it can be determined and is less than
3144 the upper bound given by MAXREAD add one to it for
3145 the terminating nul. Otherwise, set it to one for
3146 the same reason, or to MAXREAD as appropriate. */
3149 {
3152 else
3163 }
3164 else
3165 {
3168 }
3169 }
3170 else
3172 }
3175 {
3176 /* When the only available piece of data is the object size
3177 there is nothing to do. */
3181 /* Otherwise, when the length of the source sequence is known
3182 (as with strlen), set DSTWRITE to it. */
3185 }
3195 /* First check the number of bytes to be written against the maximum
3196 object size. */
3198 {
3208 "%K%qD specified size %E "
3211 else
3213 "%K%qD specified size between %E and %E "
3221 }
3223 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3224 constant, and in range of unsigned HOST_WIDE_INT. */
3227 /* Next check the number of bytes to be written against the destination
3228 object size. */
3230 {
3236 {
3244 {
3245 /* This is a call to strcpy with a destination of 0 size
3246 and a source of unknown length. The call will write
3247 at least one byte past the end of the destination. */
3249 "%K%qD writing %E or more bytes into a region "
3252 }
3255 "%K%qD writing %E byte into a region "
3257 "%K%qD writing %E bytes into a region "
3261 {
3262 /* Avoid printing the upper bound if it's invalid. */
3264 "%K%qD writing %E or more bytes into a region "
3267 }
3268 else
3270 "%K%qD writing between %E and %E bytes into "
3273 dstsize);
3275 /* Return error when an overflow has been detected. */
3277 }
3278 }
3280 /* Check the maximum length of the source sequence against the size
3281 of the destination object if known, or against the maximum size
3282 of an object. */
3284 {
3287 /* Use the lower end for MAXREAD from now on. */
3292 {
3297 {
3301 /* Warn about crazy big sizes first since that's more
3302 likely to be meaningful than saying that the bound
3303 is greater than the object size if both are big. */
3306 "%K%qD specified bound %E "
3310 else
3312 "%K%qD specified bound between %E and %E "
3318 }
3321 {
3327 "%K%qD specified bound %E "
3331 else
3333 "%K%qD specified bound between %E and %E "
3338 }
3339 }
3340 }
3342 /* Check for reading past the end of SRC. */
3347 {
3359 {
3360 /* Avoid printing the upper bound if it's invalid. */
3362 "%K%qD reading %E or more bytes from a region "
3365 }
3366 else
3368 "%K%qD reading between %E and %E bytes from a region "
3372 }
3375 }
3377 /* Helper to compute the size of the object referenced by the DEST
3378 expression which must have pointer type, using Object Size type
3379 OSTYPE (only the least significant 2 bits are used). Return
3380 an estimate of the size of the object if successful or NULL when
3381 the size cannot be determined. When the referenced object involves
3382 a non-constant offset in some range the returned value represents
3383 the largest size given the smallest non-negative offset in the
3384 range. The function is intended for diagnostics and should not
3385 be used to influence code generation or optimization. */
3387 tree
3389 {
3392 /* Only the two least significant bits are meaningful. */
3399 {
3408 {
3409 /* compute_builtin_object_size fails for addresses with
3410 non-constant offsets. Try to determine the range of
3411 such an offset here and use it to adjust the constant
3412 size. */
3415 {
3417 {
3421 /* Ignore negative offsets for now. For others,
3422 use the lower bound as the most optimistic
3423 estimate of the (remaining) size. */
3425 ;
3429 else
3431 }
3432 }
3435 {
3440 {
3442 {
3445 /* Ignore negative offsets for now. For others,
3446 use the lower bound as the most optimistic
3447 estimate of the (remaining)size. */
3449 ;
3453 else
3455 }
3456 }
3457 }
3458 }
3461 }
3463 /* Unless computing the largest size (for memcpy and other raw memory
3464 functions), try to determine the size of the object from its type. */
3479 {
3480 /* Return the constant size unless it's zero (that's a zero-length
3481 array likely at the end of a struct). */
3486 }
3489 }
3491 /* Helper to determine and check the sizes of the source and the destination
3492 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3493 call expression, DEST is the destination argument, SRC is the source
3494 argument or null, and LEN is the number of bytes. Use Object Size type-0
3495 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3496 (no overflow or invalid sizes), false otherwise. */
3498 static bool
3500 {
3501 /* For functions like memset and memcpy that operate on raw memory
3502 try to determine the size of the largest source and destination
3503 object using type-0 Object Size regardless of the object size
3504 type specified by the option. */
3510 }
3512 /* Validate memchr arguments without performing any expansion.
3513 Return NULL_RTX. */
3515 static rtx
3517 {
3525 /* Diagnose calls where the specified length exceeds the size
3526 of the object. */
3528 {
3532 }
3535 }
3537 /* Expand a call EXP to the memcpy builtin.
3538 Return NULL_RTX if we failed, the caller should emit a normal call,
3539 otherwise try to get the result in TARGET, if convenient (and in
3540 mode MODE if that's convenient). */
3542 static rtx
3544 {
3557 }
3559 /* Check a call EXP to the memmove built-in for validity.
3560 Return NULL_RTX on both success and failure. */
3562 static rtx
3564 {
3576 }
3578 /* Expand a call EXP to the mempcpy builtin.
3579 Return NULL_RTX if we failed; the caller should emit a normal call,
3580 otherwise try to get the result in TARGET, if convenient (and in
3581 mode MODE if that's convenient). If ENDP is 0 return the
3582 destination pointer, if ENDP is 1 return the end pointer ala
3583 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3584 stpcpy. */
3586 static rtx
3588 {
3597 /* Policy does not generally allow using compute_objsize (which
3598 is used internally by check_memop_size) to change code generation
3599 or drive optimization decisions.
3601 In this instance it is safe because the code we generate has
3602 the same semantics regardless of the return value of
3603 check_memop_sizes. Exactly the same amount of data is copied
3604 and the return value is exactly the same in both cases.
3606 Furthermore, check_memop_size always uses mode 0 for the call to
3607 compute_objsize, so the imprecise nature of compute_objsize is
3608 avoided. */
3610 /* Avoid expanding mempcpy into memcpy when the call is determined
3611 to overflow the buffer. This also prevents the same overflow
3612 from being diagnosed again when expanding memcpy. */
3618 }
3620 /* Helper function to do the actual work for expand of memory copy family
3621 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3622 of memory from SRC to DEST and assign to TARGET if convenient.
3623 If ENDP is 0 return the
3624 destination pointer, if ENDP is 1 return the end pointer ala
3625 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3626 stpcpy. */
3628 static rtx
3631 {
3642 /* If DEST is not a pointer type, call the normal function. */
3646 /* If either SRC is not a pointer type, don't do this
3647 operation in-line. */
3664 /* If SRC is a string constant and block move would be done
3665 by pieces, we can avoid loading the string from memory
3666 and only stored the computed constants. */
3673 {
3675 builtin_memcpy_read_str,
3681 }
3686 /* Copy word part most expediently. */
3699 {
3702 }
3705 {
3707 /* stpcpy pointer to last byte. */
3710 }
3713 }
3715 static rtx
3718 {
3720 endp);
3721 }
3723 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3724 we failed, the caller should emit a normal call, otherwise try to
3725 get the result in TARGET, if convenient. If ENDP is 0 return the
3726 destination pointer, if ENDP is 1 return the end pointer ala
3727 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3728 stpcpy. */
3730 static rtx
3732 {
3734 rtx dest_mem;
3735 rtx src_mem;
3743 {
3746 }
3755 {
3757 /* movstr is supposed to set end to the address of the NUL
3758 terminator. If the caller requested a mempcpy-like return value,
3759 adjust it. */
3761 {
3765 }
3766 }
3768 }
3770 /* Do some very basic size validation of a call to the strcpy builtin
3771 given by EXP. Return NULL_RTX to have the built-in expand to a call
3772 to the library function. */
3774 static rtx
3776 {
3784 /* There is no way here to determine the length of the string in
3785 the destination to which the SRC string is being appended so
3786 just diagnose cases when the souce string is longer than
3787 the destination object. */
3792 destsize);
3795 }
3797 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3798 NULL_RTX if we failed the caller should emit a normal call, otherwise
3799 try to get the result in TARGET, if convenient (and in mode MODE if that's
3800 convenient). */
3802 static rtx
3804 {
3812 {
3816 }
3819 {
3820 /* Check to see if the argument was declared attribute nonstring
3821 and if so, issue a warning since at this point it's not known
3822 to be nul-terminated. */
3826 }
3829 }
3831 /* Helper function to do the actual work for expand_builtin_strcpy. The
3832 arguments to the builtin_strcpy call DEST and SRC are broken out
3833 so that this can also be called without constructing an actual CALL_EXPR.
3834 The other arguments and return value are the same as for
3835 expand_builtin_strcpy. */
3837 static rtx
3839 {
3841 }
3843 /* Expand a call EXP to the stpcpy builtin.
3844 Return NULL_RTX if we failed the caller should emit a normal call,
3845 otherwise try to get the result in TARGET, if convenient (and in
3846 mode MODE if that's convenient). */
3848 static rtx
3850 {
3861 {
3865 }
3867 /* If return value is ignored, transform stpcpy into strcpy. */
3869 {
3873 }
3874 else
3875 {
3877 rtx ret;
3879 /* Ensure we get an actual string whose length can be evaluated at
3880 compile-time, not an expression containing a string. This is
3881 because the latter will potentially produce pessimized code
3882 when used to produce the return value. */
3894 {
3898 {
3902 {
3904 {
3907 else
3909 }
3918 }
3919 }
3920 }
3923 }
3924 }
3926 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
3927 arguments while being careful to avoid duplicate warnings (which could
3928 be issued if the expander were to expand the call, resulting in it
3929 being emitted in expand_call(). */
3931 static rtx
3933 {
3935 {
3936 /* The call has been successfully expanded. Check for nonstring
3937 arguments and issue warnings as appropriate. */
3940 }
3943 }
3945 /* Check a call EXP to the stpncpy built-in for validity.
3946 Return NULL_RTX on both success and failure. */
3948 static rtx
3950 {
3956 /* The source and destination of the call. */
3960 /* The exact number of bytes to write (not the maximum). */
3963 /* The size of the destination object. */
3969 }
3971 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3972 bytes from constant string DATA + OFFSET and return it as target
3973 constant. */
3975 rtx
3977 scalar_int_mode mode)
3978 {
3985 }
3987 /* Helper to check the sizes of sequences and the destination of calls
3988 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3989 success (no overflow or invalid sizes), false otherwise. */
3991 static bool
3993 {
3998 /* Try to determine the range of lengths that the source expression
3999 refers to. */
4003 /* Try to verify that the destination is big enough for the shortest
4004 string. */
4007 {
4008 /* If it hasn't been provided by __strncat_chk, try to determine
4009 the size of the destination object into which the source is
4010 being copied. */
4012 }
4014 /* Add one for the terminating nul. */
4017 size_one_node)
4020 /* The strncat function copies at most MAXREAD bytes and always appends
4021 the terminating nul so the specified upper bound should never be equal
4022 to (or greater than) the size of the destination. */
4025 {
4034 }
4042 /* The number of bytes to write is LEN but check_access will also
4043 check SRCLEN if LEN's value isn't known. */
4045 objsize);
4046 }
4048 /* Similar to expand_builtin_strcat, do some very basic size validation
4049 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4050 the built-in expand to a call to the library function. */
4052 static rtx
4054 {
4062 /* The upper bound on the number of bytes to write. */
4064 /* The length of the source sequence. */
4067 /* Try to determine the range of lengths that the source expression
4068 refers to. */
4072 else
4075 /* Try to verify that the destination is big enough for the shortest
4076 string. First try to determine the size of the destination object
4077 into which the source is being copied. */
4080 /* Add one for the terminating nul. */
4083 size_one_node)
4086 /* The strncat function copies at most MAXREAD bytes and always appends
4087 the terminating nul so the specified upper bound should never be equal
4088 to (or greater than) the size of the destination. */
4091 {
4100 }
4108 /* The number of bytes to write is SRCLEN. */
4112 }
4114 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4115 NULL_RTX if we failed the caller should emit a normal call. */
4117 static rtx
4119 {
4124 {
4127 /* The number of bytes to write (not the maximum). */
4129 /* The length of the source sequence. */
4133 {
4137 /* The number of bytes to write is LEN but check_access will also
4138 check SLEN if LEN's value isn't known. */
4140 destsize);
4141 }
4143 /* We must be passed a constant len and src parameter. */
4149 /* We're required to pad with trailing zeros if the requested
4150 len is greater than strlen(s2)+1. In that case try to
4151 use store_by_pieces, if it fails, punt. */
4153 {
4156 rtx dest_mem;
4160 builtin_strncpy_read_str,
4167 builtin_strncpy_read_str,
4172 }
4173 }
4175 }
4177 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4178 bytes from constant string DATA + OFFSET and return it as target
4179 constant. */
4181 rtx
4183 scalar_int_mode mode)
4184 {
4191 }
4193 /* Callback routine for store_by_pieces. Return the RTL of a register
4194 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4195 char value given in the RTL register data. For example, if mode is
4196 4 bytes wide, return the RTL for 0x01010101*data. */
4198 static rtx
4200 scalar_int_mode mode)
4201 {
4217 }
4219 /* Expand expression EXP, which is a call to the memset builtin. Return
4220 NULL_RTX if we failed the caller should emit a normal call, otherwise
4221 try to get the result in TARGET, if convenient (and in mode MODE if that's
4222 convenient). */
4224 static rtx
4226 {
4238 }
4240 /* Helper function to do the actual work for expand_builtin_memset. The
4241 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4242 so that this can also be called without constructing an actual CALL_EXPR.
4243 The other arguments and return value are the same as for
4244 expand_builtin_memset. */
4246 static rtx
4249 {
4252 machine_mode val_mode;
4264 /* If DEST is not a pointer type, don't do this operation in-line. */
4275 /* If the LEN parameter is zero, return DEST. */
4277 {
4278 /* Evaluate and ignore VAL in case it has side-effects. */
4281 }
4283 /* Stabilize the arguments in case we fail. */
4295 {
4296 rtx val_rtx;
4301 /* Assume that we can memset by pieces if we can store
4302 * the coefficients by pieces (in the required modes).
4303 * We can't pass builtin_memset_gen_str as that emits RTL. */
4309 {
4314 }
4318 probable_max_size))
4324 }
4330 {
4341 probable_max_size))
4347 }
4355 probable_max_size);
4358 {
4361 }
4365 do_libcall:
4374 else
4379 }
4381 /* Expand expression EXP, which is a call to the bzero builtin. Return
4382 NULL_RTX if we failed the caller should emit a normal call. */
4384 static rtx
4386 {
4395 /* New argument list transforming bzero(ptr x, int y) to
4396 memset(ptr x, int 0, size_t y). This is done this way
4397 so that if it isn't expanded inline, we fallback to
4398 calling bzero instead of memset. */
4406 }
4408 /* Try to expand cmpstr operation ICODE with the given operands.
4409 Return the result rtx on success, otherwise return null. */
4411 static rtx
4413 HOST_WIDE_INT align)
4414 {
4428 }
4430 /* Expand expression EXP, which is a call to the memcmp built-in function.
4431 Return NULL_RTX if we failed and the caller should emit a normal call,
4432 otherwise try to get the result in TARGET, if convenient.
4433 RESULT_EQ is true if we can relax the returned value to be either zero
4434 or nonzero, without caring about the sign. */
4436 static rtx
4438 {
4447 /* Diagnose calls where the specified length exceeds the size of either
4448 object. */
4450 {
4454 {
4458 }
4459 }
4467 /* If we don't have POINTER_TYPE, call the function. */
4475 /* Set MEM_SIZE as appropriate. */
4477 {
4480 }
4486 {
4490 }
4492 /* If SRC is a string constant and block move would be done
4493 by pieces, we can avoid loading the string from memory
4494 and only stored the computed constants. */
4506 {
4507 /* Return the value in the proper mode for this function. */
4512 {
4515 }
4518 }
4521 }
4523 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4524 if we failed the caller should emit a normal call, otherwise try to get
4525 the result in TARGET, if convenient. */
4527 static rtx
4529 {
4544 /* If we don't have POINTER_TYPE, call the function. */
4548 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4556 /* Try to call cmpstrsi. */
4561 /* Try to determine at least one length and call cmpstrnsi. */
4563 {
4564 tree len;
4565 rtx arg3_rtx;
4575 /* If we don't have a constant length for the first, use the length
4576 of the second, if we know it. We don't require a constant for
4577 this case; some cost analysis could be done if both are available
4578 but neither is constant. For now, assume they're equally cheap,
4579 unless one has side effects. If both strings have constant lengths,
4580 use the smaller. */
4596 else
4599 /* If both arguments have side effects, we cannot optimize. */
4601 {
4603 result = expand_cmpstrn_or_cmpmem
4606 }
4607 }
4611 {
4612 /* Check to see if the argument was declared attribute nonstring
4613 and if so, issue a warning since at this point it's not known
4614 to be nul-terminated. */
4617 /* Return the value in the proper mode for this function. */
4625 }
4627 /* Expand the library call ourselves using a stabilized argument
4628 list to avoid re-evaluating the function's arguments twice. */
4633 }
4635 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4636 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4637 the result in TARGET, if convenient. */
4639 static rtx
4641 ATTRIBUTE_UNUSED machine_mode mode)
4642 {
4647 /* If c_strlen can determine an expression for one of the string
4648 lengths, and it doesn't have side effects, then emit cmpstrnsi
4649 using length MIN(strlen(string)+1, arg3). */
4654 tree len;
4675 /* If we don't have a constant length for the first, use the length
4676 of the second, if we know it. If neither string is constant length,
4677 use the given length argument. We don't require a constant for
4678 this case; some cost analysis could be done if both are available
4679 but neither is constant. For now, assume they're equally cheap,
4680 unless one has side effects. If both strings have constant lengths,
4681 use the smaller. */
4699 else
4702 /* If we are not using the given length, we must incorporate it here.
4703 The actual new length parameter will be MIN(len,arg3) in this case. */
4715 {
4716 /* Check to see if the argument was declared attribute nonstring
4717 and if so, issue a warning since at this point it's not known
4718 to be nul-terminated. */
4721 /* Return the value in the proper mode for this function. */
4729 }
4731 /* Expand the library call ourselves using a stabilized argument
4732 list to avoid re-evaluating the function's arguments twice. */
4737 }
4739 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4740 if that's convenient. */
4742 rtx
4744 {
4745 rtx val;
4748 /* Don't do __builtin_saveregs more than once in a function.
4749 Save the result of the first call and reuse it. */
4753 /* When this function is called, it means that registers must be
4754 saved on entry to this function. So we migrate the call to the
4755 first insn of this function. */
4759 /* Do whatever the machine needs done in this case. */
4767 /* Put the insns after the NOTE that starts the function. If this
4768 is inside a start_sequence, make the outer-level insn chain current, so
4769 the code is placed at the start of the function. */
4775 }
4777 /* Expand a call to __builtin_next_arg. */
4779 static rtx
4781 {
4782 /* Checking arguments is already done in fold_builtin_next_arg
4783 that must be called before this function. */
4788 }
4790 /* Make it easier for the backends by protecting the valist argument
4791 from multiple evaluations. */
4793 static tree
4795 {
4798 /* The current way of determining the type of valist is completely
4799 bogus. We should have the information on the va builtin instead. */
4804 {
4808 /* For this case, the backends will be expecting a pointer to
4809 vatype, but it's possible we've actually been given an array
4810 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4811 So fix it. */
4813 {
4816 }
4817 }
4818 else
4819 {
4823 {
4829 }
4835 }
4838 }
4840 /* The "standard" definition of va_list is void*. */
4842 tree
4844 {
4846 }
4848 /* The "standard" abi va_list is va_list_type_node. */
4850 tree
4852 {
4854 }
4856 /* The "standard" type of va_list is va_list_type_node. */
4858 tree
4860 {
4867 {
4868 /* If va_list is an array type, the argument may have decayed
4869 to a pointer type, e.g. by being passed to another function.
4870 In that case, unwrap both types so that we can compare the
4871 underlying records. */
4874 {
4877 }
4878 }
4883 }
4885 /* The "standard" implementation of va_start: just assign `nextarg' to
4886 the variable. */
4888 void
4890 {
4893 }
4895 /* Expand EXP, a call to __builtin_va_start. */
4897 static rtx
4899 {
4900 rtx nextarg;
4901 tree valist;
4905 {
4908 }
4918 else
4922 }
4924 /* Expand EXP, a call to __builtin_va_end. */
4926 static rtx
4928 {
4931 /* Evaluate for side effects, if needed. I hate macros that don't
4932 do that. */
4937 }
4939 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4940 builtin rather than just as an assignment in stdarg.h because of the
4941 nastiness of array-type va_list types. */
4943 static rtx
4945 {
4958 {
4962 }
4963 else
4964 {
4967 /* Evaluate to pointers. */
4976 /* "Dereference" to BLKmode memories. */
4984 /* Copy. */
4986 }
4989 }
4991 /* Expand a call to one of the builtin functions __builtin_frame_address or
4992 __builtin_return_address. */
4994 static rtx
4996 {
4997 /* The argument must be a nonnegative integer constant.
4998 It counts the number of frames to scan up the stack.
4999 The value is either the frame pointer value or the return
5000 address saved in that frame. */
5002 /* Warning about missing arg was already issued. */
5005 {
5008 }
5009 else
5010 {
5011 /* Number of frames to scan up the stack. */
5016 /* Some ports cannot access arbitrary stack frames. */
5018 {
5021 }
5024 {
5025 /* Warn since no effort is made to ensure that any frame
5026 beyond the current one exists or can be safely reached. */
5029 }
5031 /* For __builtin_frame_address, return what we've got. */
5039 }
5040 }
5042 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5043 failed and the caller should emit a normal call. */
5045 static rtx
5047 {
5048 rtx op0;
5049 rtx result;
5052 HOST_WIDE_INT max_size;
5055 bool valid_arglist
5058 VOID_TYPE)
5068 {
5069 /* -Walloca-larger-than and -Wvla-larger-than settings override
5070 the more general -Walloc-size-larger-than so unless either of
5071 the former options is specified check the alloca arguments for
5072 overflow. */
5076 }
5078 /* Compute the argument. */
5081 /* Compute the alignment. */
5083 ? BIGGEST_ALIGNMENT
5086 /* Compute the maximum size. */
5091 /* Allocate the desired space. If the allocation stems from the declaration
5092 of a variable-sized object, it cannot accumulate. */
5093 result
5098 }
5100 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5101 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5102 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5103 handle_builtin_stack_restore function. */
5105 static rtx
5107 {
5114 OPTAB_LIB_WIDEN);
5117 OPTAB_LIB_WIDEN);
5122 }
5124 /* Expand a call to bswap builtin in EXP.
5125 Return NULL_RTX if a normal call should be emitted rather than expanding the
5126 function in-line. If convenient, the result should be placed in TARGET.
5127 SUBTARGET may be used as the target for computing one of EXP's operands. */
5129 static rtx
5131 rtx subtarget)
5132 {
5133 tree arg;
5134 rtx op0;
5152 }
5154 /* Expand a call to a unary builtin in EXP.
5155 Return NULL_RTX if a normal call should be emitted rather than expanding the
5156 function in-line. If convenient, the result should be placed in TARGET.
5157 SUBTARGET may be used as the target for computing one of EXP's operands. */
5159 static rtx
5162 {
5163 rtx op0;
5168 /* Compute the argument. */
5170 (subtarget
5174 /* Compute op, into TARGET if possible.
5175 Set TARGET to wherever the result comes back. */
5181 }
5183 /* Expand a call to __builtin_expect. We just return our argument
5184 as the builtin_expect semantic should've been already executed by
5185 tree branch prediction pass. */
5187 static rtx
5189 {
5190 tree arg;
5197 /* When guessing was done, the hints should be already stripped away. */
5201 }
5203 /* Expand a call to __builtin_assume_aligned. We just return our first
5204 argument as the builtin_assume_aligned semantic should've been already
5205 executed by CCP. */
5207 static rtx
5209 {
5213 EXPAND_NORMAL);
5218 }
5220 void
5222 {
5224 {
5226 /* For trap insns when not accumulating outgoing args force
5227 REG_ARGS_SIZE note to prevent crossjumping of calls with
5228 different args sizes. */
5231 }
5232 else
5233 {
5237 }
5240 }
5242 /* Expand a call to __builtin_unreachable. We do nothing except emit
5243 a barrier saying that control flow will not pass here.
5245 It is the responsibility of the program being compiled to ensure
5246 that control flow does never reach __builtin_unreachable. */
5247 static void
5249 {
5251 }
5253 /* Expand EXP, a call to fabs, fabsf or fabsl.
5254 Return NULL_RTX if a normal call should be emitted rather than expanding
5255 the function inline. If convenient, the result should be placed
5256 in TARGET. SUBTARGET may be used as the target for computing
5257 the operand. */
5259 static rtx
5261 {
5262 machine_mode mode;
5263 tree arg;
5264 rtx op0;
5274 }
5276 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5277 Return NULL is a normal call should be emitted rather than expanding the
5278 function inline. If convenient, the result should be placed in TARGET.
5279 SUBTARGET may be used as the target for computing the operand. */
5281 static rtx
5283 {
5285 tree arg;
5297 }
5299 /* Expand a call to __builtin___clear_cache. */
5301 static rtx
5303 {
5305 {
5306 #ifdef CLEAR_INSN_CACHE
5307 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5308 does something. Just do the default expansion to a call to
5309 __clear_cache(). */
5311 #else
5312 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5313 does nothing. There is no need to call it. Do nothing. */
5316 }
5318 /* We have a "clear_cache" insn, and it will handle everything. */
5322 /* We must not expand to a library call. If we did, any
5323 fallback library function in libgcc that might contain a call to
5324 __builtin___clear_cache() would recurse infinitely. */
5326 {
5329 }
5332 {
5345 }
5347 }
5349 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5351 static rtx
5353 {
5356 /* If we don't need too much alignment, we'll have been guaranteed
5357 proper alignment by get_trampoline_type. */
5361 /* Round address up to desired boundary. */
5372 }
5374 static rtx
5376 {
5392 /* If ONSTACK, the TRAMP argument should be the address of a field
5393 within the local function's FRAME decl. Either way, let's see if
5394 we can fill in the MEM_ATTRs for this memory. */
5398 /* Creator of a heap trampoline is responsible for making sure the
5399 address is aligned to at least STACK_BOUNDARY. Normally malloc
5400 will ensure this anyhow. */
5403 {
5407 }
5409 /* The FUNC argument should be the address of the nested function.
5410 Extract the actual function decl to pass to the hook. */
5417 /* Generate insns to initialize the trampoline. */
5421 {
5427 }
5430 }
5432 static rtx
5434 {
5435 rtx tramp;
5446 }
5448 /* Expand a call to the builtin descriptor initialization routine.
5449 A descriptor is made up of a couple of pointers to the static
5450 chain and the code entry in this order. */
5452 static rtx
5454 {
5459 VOID_TYPE))
5473 /* Generate insns to initialize the descriptor. */
5479 }
5481 /* Expand a call to the builtin descriptor adjustment routine. */
5483 static rtx
5485 {
5486 rtx tramp;
5493 /* Unalign the descriptor to allow runtime identification. */
5498 }
5500 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5501 function. The function first checks whether the back end provides
5502 an insn to implement signbit for the respective mode. If not, it
5503 checks whether the floating point format of the value is such that
5504 the sign bit can be extracted. If that is not the case, error out.
5505 EXP is the expression that is a call to the builtin function; if
5506 convenient, the result should be placed in TARGET. */
5507 static rtx
5509 {
5511 scalar_float_mode fmode;
5513 tree arg;
5516 rtx temp;
5529 /* Expand the argument yielding a RTX expression. */
5532 /* Check if the back end provides an insn that handles signbit for the
5533 argument's mode. */
5536 {
5542 }
5544 /* For floating point formats without a sign bit, implement signbit
5545 as "ARG < 0.0". */
5548 {
5549 /* But we can't do this if the format supports signed zero. */
5555 }
5558 {
5561 }
5562 else
5563 {
5565 /* Handle targets with different FP word orders. */
5568 else
5572 }
5574 /* Force the intermediate word_mode (or narrower) result into a
5575 register. This avoids attempting to create paradoxical SUBREGs
5576 of floating point modes below. */
5579 /* If the bitpos is within the "result mode" lowpart, the operation
5580 can be implement with a single bitwise AND. Otherwise, we need
5581 a right shift and an AND. */
5584 {
5592 }
5593 else
5594 {
5595 /* Perform a logical right shift to place the signbit in the least
5596 significant bit, then truncate the result to the desired mode
5597 and mask just this bit. */
5602 }
5605 }
5607 /* Expand fork or exec calls. TARGET is the desired target of the
5608 call. EXP is the call. FN is the
5609 identificator of the actual function. IGNORE is nonzero if the
5610 value is to be ignored. */
5612 static rtx
5614 {
5616 tree call;
5618 /* If we are not profiling, just call the function. */
5622 /* Otherwise call the wrapper. This should be equivalent for the rest of
5623 compiler, so the code does not diverge, and the wrapper may run the
5624 code necessary for keeping the profiling sane. */
5627 {
5658 }
5670 }
5673 \f
5674 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5675 the pointer in these functions is void*, the tree optimizers may remove
5676 casts. The mode computed in expand_builtin isn't reliable either, due
5677 to __sync_bool_compare_and_swap.
5679 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5680 group of builtins. This gives us log2 of the mode size. */
5684 {
5685 /* The size is not negotiable, so ask not to get BLKmode in return
5686 if the target indicates that a smaller size would be better. */
5688 }
5690 /* Expand the memory expression LOC and return the appropriate memory operand
5691 for the builtin_sync operations. */
5693 static rtx
5695 {
5701 /* Note that we explicitly do not want any alias information for this
5702 memory, so that we kill all other live memories. Otherwise we don't
5703 satisfy the full barrier semantics of the intrinsic. */
5706 /* The alignment needs to be at least according to that of the mode. */
5713 }
5715 /* Make sure an argument is in the right mode.
5716 EXP is the tree argument.
5717 MODE is the mode it should be in. */
5719 static rtx
5721 {
5722 rtx val;
5723 machine_mode old_mode;
5726 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5727 of CONST_INTs, where we know the old_mode only from the call argument. */
5734 }
5737 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5738 EXP is the CALL_EXPR. CODE is the rtx code
5739 that corresponds to the arithmetic or logical operation from the name;
5740 an exception here is that NOT actually means NAND. TARGET is an optional
5741 place for us to store the results; AFTER is true if this is the
5742 fetch_and_xxx form. */
5744 static rtx
5747 rtx target)
5748 {
5753 {
5760 {
5789 }
5790 }
5792 /* Expand the operands. */
5797 after);
5798 }
5800 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5801 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5802 true if this is the boolean form. TARGET is a place for us to store the
5803 results; this is NOT optional if IS_BOOL is true. */
5805 static rtx
5808 {
5812 /* Expand the operands. */
5819 {
5822 else
5824 }
5827 MEMMODEL_SYNC_SEQ_CST))
5831 }
5833 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5834 general form is actually an atomic exchange, and some targets only
5835 support a reduced form with the second argument being a constant 1.
5836 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5837 the results. */
5839 static rtx
5841 rtx target)
5842 {
5845 /* Expand the operands. */
5850 }
5852 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5854 static void
5856 {
5857 rtx mem;
5859 /* Expand the operands. */
5863 }
5865 /* Given an integer representing an ``enum memmodel'', verify its
5866 correctness and return the memory model enum. */
5868 static enum memmodel
5870 {
5871 rtx op;
5873 source_location loc
5876 /* If the parameter is not a constant, it's a run time value so we'll just
5877 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5887 {
5891 }
5893 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5895 {
5899 }
5901 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5902 be conservative and promote consume to acquire. */
5907 }
5909 /* Expand the __atomic_exchange intrinsic:
5910 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5911 EXP is the CALL_EXPR.
5912 TARGET is an optional place for us to store the results. */
5914 static rtx
5916 {
5925 /* Expand the operands. */
5930 }
5932 /* Expand the __atomic_compare_exchange intrinsic:
5933 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5934 TYPE desired, BOOL weak,
5935 enum memmodel success,
5936 enum memmodel failure)
5937 EXP is the CALL_EXPR.
5938 TARGET is an optional place for us to store the results. */
5940 static rtx
5942 rtx target)
5943 {
5947 tree weak;
5949 source_location loc
5956 {
5958 "failure memory model cannot be stronger than success "
5961 }
5964 {
5966 "invalid failure memory model for "
5970 }
5976 /* Expand the operands. */
5992 /* Lest the rtl backend create a race condition with an imporoper store
5993 to memory, always create a new pseudo for OLDVAL. */
6000 /* Conditionally store back to EXPECT, lest we create a race condition
6001 with an improper store to memory. */
6002 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6003 the normal case where EXPECT is totally private, i.e. a register. At
6004 which point the store can be unconditional. */
6012 }
6014 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6015 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6016 call. The weak parameter must be dropped to match the expected parameter
6017 list and the expected argument changed from value to pointer to memory
6018 slot. */
6020 static void
6022 {
6038 /* Skip the boolean weak parameter. */
6041 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6044 built_in_function fncode
6049 fndecl);
6054 {
6061 }
6062 }
6064 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6066 void
6068 {
6074 tree lhs;
6076 source_location loc
6083 {
6085 "failure memory model cannot be stronger than success "
6088 }
6091 {
6093 "invalid failure memory model for "
6097 }
6100 {
6103 }
6105 /* Expand the operands. */
6118 {
6121 }
6125 {
6131 }
6132 }
6134 /* Expand the __atomic_load intrinsic:
6135 TYPE __atomic_load (TYPE *object, enum memmodel)
6136 EXP is the CALL_EXPR.
6137 TARGET is an optional place for us to store the results. */
6139 static rtx
6141 {
6142 rtx mem;
6147 {
6148 source_location loc
6153 }
6158 /* Expand the operand. */
6162 }
6165 /* Expand the __atomic_store intrinsic:
6166 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6167 EXP is the CALL_EXPR.
6168 TARGET is an optional place for us to store the results. */
6170 static rtx
6172 {
6179 {
6180 source_location loc
6185 }
6190 /* Expand the operands. */
6195 }
6197 /* Expand the __atomic_fetch_XXX intrinsic:
6198 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6199 EXP is the CALL_EXPR.
6200 TARGET is an optional place for us to store the results.
6201 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6202 FETCH_AFTER is true if returning the result of the operation.
6203 FETCH_AFTER is false if returning the value before the operation.
6204 IGNORE is true if the result is not used.
6205 EXT_CALL is the correct builtin for an external call if this cannot be
6206 resolved to an instruction sequence. */
6208 static rtx
6212 {
6215 tree fndecl;
6216 tree addr;
6220 /* Expand the operands. */
6224 /* Only try generating instructions if inlining is turned on. */
6226 {
6230 }
6232 /* Return if a different routine isn't needed for the library call. */
6236 /* Change the call to the specified function. */
6244 /* If we will emit code after the call, the call can not be a tail call.
6245 If it is emitted as a tail call, a barrier is emitted after it, and
6246 then all trailing code is removed. */
6250 /* Expand the call here so we can emit trailing code. */
6253 /* Replace the original function just in case it matters. */
6256 /* Then issue the arithmetic correction to return the right result. */
6258 {
6260 {
6262 OPTAB_LIB_WIDEN);
6264 }
6265 else
6267 OPTAB_LIB_WIDEN);
6268 }
6270 }
6272 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6274 void
6276 {
6284 optab optab;
6296 {
6311 }
6314 {
6321 }
6343 {
6348 }
6349 else
6351 OPTAB_DIRECT);
6354 }
6356 /* Expand an atomic clear operation.
6357 void _atomic_clear (BOOL *obj, enum memmodel)
6358 EXP is the call expression. */
6360 static rtx
6362 {
6363 machine_mode mode;
6372 {
6373 source_location loc
6378 }
6380 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6381 Failing that, a store is issued by __atomic_store. The only way this can
6382 fail is if the bool type is larger than a word size. Unlikely, but
6383 handle it anyway for completeness. Assume a single threaded model since
6384 there is no atomic support in this case, and no barriers are required. */
6389 }
6391 /* Expand an atomic test_and_set operation.
6392 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6393 EXP is the call expression. */
6395 static rtx
6397 {
6398 rtx mem;
6400 machine_mode mode;
6407 }
6410 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6411 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6413 static tree
6415 {
6417 machine_mode mode;
6423 /* We need a corresponding integer mode for the access to be lock-free. */
6431 {
6434 /* Either this argument is null, or it's a fake pointer encoding
6435 the alignment of the object. */
6441 else
6443 }
6444 else
6445 {
6448 /* This function is usually invoked and folded immediately by the front
6449 end before anything else has a chance to look at it. The pointer
6450 parameter at this point is usually cast to a void *, so check for that
6451 and look past the cast. */
6461 /* Get the underlying type of the object. */
6464 }
6466 /* If the object has smaller alignment, the lock free routines cannot
6467 be used. */
6471 /* Check if a compare_and_swap pattern exists for the mode which represents
6472 the required size. The pattern is not allowed to fail, so the existence
6473 of the pattern indicates support is present. Also require that an
6474 atomic load exists for the required size. */
6477 else
6479 }
6481 /* Return true if the parameters to call EXP represent an object which will
6482 always generate lock free instructions. The first argument represents the
6483 size of the object, and the second parameter is a pointer to the object
6484 itself. If NULL is passed for the object, then the result is based on
6485 typical alignment for an object of the specified size. Otherwise return
6486 false. */
6488 static rtx
6490 {
6491 tree size;
6496 {
6499 }
6505 }
6507 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6508 is lock free on this architecture. */
6510 static tree
6512 {
6516 /* If it isn't always lock free, don't generate a result. */
6521 }
6523 /* Return true if the parameters to call EXP represent an object which will
6524 always generate lock free instructions. The first argument represents the
6525 size of the object, and the second parameter is a pointer to the object
6526 itself. If NULL is passed for the object, then the result is based on
6527 typical alignment for an object of the specified size. Otherwise return
6528 NULL*/
6530 static rtx
6532 {
6533 tree size;
6538 {
6541 }
6546 /* If the value is known at compile time, return the RTX for it. */
6552 }
6554 /* Expand the __atomic_thread_fence intrinsic:
6555 void __atomic_thread_fence (enum memmodel)
6556 EXP is the CALL_EXPR. */
6558 static void
6560 {
6563 }
6565 /* Expand the __atomic_signal_fence intrinsic:
6566 void __atomic_signal_fence (enum memmodel)
6567 EXP is the CALL_EXPR. */
6569 static void
6571 {
6574 }
6576 /* Expand the __sync_synchronize intrinsic. */
6578 static void
6580 {
6582 }
6584 static rtx
6586 {
6592 {
6594 /* If the target is not sutitable then create a new target. */
6602 }
6605 }
6607 static void
6609 {
6615 {
6622 }
6624 }
6626 \f
6627 /* Emit code to restore the current value of stack. */
6629 static void
6631 {
6643 }
6645 /* Emit code to save the current value of stack. */
6647 static rtx
6649 {
6654 }
6656 /* Emit code to get the openacc gang, worker or vector id or size. */
6658 static rtx
6660 {
6662 rtx fallback_retval;
6665 {
6678 }
6681 {
6684 }
6688 {
6691 }
6695 {
6703 }
6712 {
6715 }
6723 }
6725 /* Expand an expression EXP that calls a built-in function,
6726 with result going to TARGET if that's convenient
6727 (and in mode MODE if that's convenient).
6728 SUBTARGET may be used as the target for computing one of EXP's operands.
6729 IGNORE is nonzero if the value is to be ignored. */
6731 rtx
6734 {
6743 /* When ASan is enabled, we don't want to expand some memory/string
6744 builtins and rely on libsanitizer's hooks. This allows us to avoid
6745 redundant checks and be sure, that possible overflow will be detected
6746 by ASan. */
6751 /* When not optimizing, generate calls to library functions for a certain
6752 set of builtins. */
6766 /* The built-in function expanders test for target == const0_rtx
6767 to determine whether the function's result will be ignored. */
6771 /* If the result of a pure or const built-in function is ignored, and
6772 none of its arguments are volatile, we can avoid expanding the
6773 built-in call and just evaluate the arguments for side-effects. */
6777 {
6779 tree arg;
6780 call_expr_arg_iterator iter;
6784 {
6787 }
6790 {
6794 }
6795 }
6798 {
6816 /* Just do a normal library call if we were unable to fold
6817 the values. */
6894 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6895 FUNCTION with a copy of the parameters described by
6896 ARGUMENTS, and ARGSIZE. It returns a block of memory
6897 allocated on the stack into which is stored all the registers
6898 that might possibly be used for returning the result of a
6899 function. ARGUMENTS is the value returned by
6900 __builtin_apply_args. ARGSIZE is the number of bytes of
6901 arguments that must be copied. ??? How should this value be
6902 computed? We'll also need a safe worst case value for varargs
6903 functions. */
6910 else
6911 {
6919 }
6921 /* __builtin_return (RESULT) causes the function to return the
6922 value described by RESULT. RESULT is address of the block of
6923 memory returned by __builtin_apply. */
6933 /* All valid uses of __builtin_va_arg_pack () are removed during
6934 inlining. */
6939 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6940 inlining. */
6944 /* Return the address of the first anonymous stack arg. */
6966 /* Returns the address of the area where the structure is returned.
6967 0 otherwise. */
6973 else
6976 CASE_BUILT_IN_ALLOCA:
7126 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7127 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7128 when changing it to a strcmp call. */
7134 /* Change this call back to a BUILT_IN_STRCMP. */
7138 /* Delete the last parameter. */
7145 /* FALLTHROUGH */
7153 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7154 back to a BUILT_IN_STRNCMP. */
7160 /* Change it back to a BUILT_IN_STRNCMP. */
7163 /* FALLTHROUGH */
7178 {
7181 }
7185 /* This should have been lowered to the builtins below. */
7189 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7190 and the receiver label. */
7192 {
7198 /* This is copied from the handling of non-local gotos. */
7200 nonlocal_goto_handler_labels
7202 nonlocal_goto_handler_labels);
7203 /* ??? Do not let expand_label treat us as such since we would
7204 not want to be both on the list of non-local labels and on
7205 the list of forced labels. */
7208 }
7212 /* __builtin_setjmp_receiver is passed the receiver label. */
7214 {
7220 }
7223 /* __builtin_longjmp is passed a pointer to an array of five words.
7224 It's similar to the C library longjmp function but works with
7225 __builtin_setjmp above. */
7228 {
7234 {
7237 }
7241 }
7250 /* This updates the setjmp buffer that is its argument with the value
7251 of the current stack pointer. */
7254 {
7255 rtx buf_addr
7260 }
7280 /* Various hooks for the DWARF 2 __throw routine. */
7286 #ifdef DWARF2_UNWIND_INFO
7292 #endif
7492 mode = get_builtin_sync_mode
7504 mode = get_builtin_sync_mode
7551 {
7555 mode =
7561 /* If this is turned into an external library call, the weak parameter
7562 must be dropped to match the expected parameter list. */
7567 /* Skip the boolean weak parameter. */
7572 }
7601 {
7611 }
7617 {
7627 }
7633 {
7643 }
7649 {
7659 }
7665 {
7675 }
7681 {
7691 }
7828 /* Do library call, if we failed to expand the builtin when
7829 folding. */
7838 }
7840 /* The switch statement above can drop through to cause the function
7841 to be called normally. */
7843 }
7845 /* Determine whether a tree node represents a call to a built-in
7846 function. If the tree T is a call to a built-in function with
7847 the right number of arguments of the appropriate types, return
7848 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7849 Otherwise the return value is END_BUILTINS. */
7851 enum built_in_function
7853 {
7856 const_call_expr_arg_iterator iter;
7871 {
7872 /* If a function doesn't take a variable number of arguments,
7873 the last element in the list will have type `void'. */
7876 {
7880 }
7889 {
7892 }
7894 {
7897 }
7899 {
7902 }
7904 {
7907 }
7908 else
7910 }
7912 /* Variable-length argument list. */
7914 }
7916 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7917 evaluate to a constant. */
7919 static tree
7921 {
7922 /* We return 1 for a numeric type that's known to be a constant
7923 value at compile-time or for an aggregate type that's a
7924 literal constant. */
7927 /* If we know this is a constant, emit the constant of one. */
7933 {
7940 }
7942 /* If this expression has side effects, show we don't know it to be a
7943 constant. Likewise if it's a pointer or aggregate type since in
7944 those case we only want literals, since those are only optimized
7945 when generating RTL, not later.
7946 And finally, if we are compiling an initializer, not code, we
7947 need to return a definite result now; there's not going to be any
7948 more optimization done. */
7953 || folding_initializer
7958 }
7960 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7961 return it as a truthvalue. */
7963 static tree
7965 tree predictor)
7966 {
7978 predictor);
7982 }
7984 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7985 NULL_TREE if no simplification is possible. */
7987 tree
7989 {
7993 /* Distribute the expected value over short-circuiting operators.
7994 See through the cast from truthvalue_type_node to long. */
8001 /* If this is a builtin_expect within a builtin_expect keep the
8002 inner one. See through a comparison against a constant. It
8003 might have been added to create a thruthvalue. */
8019 {
8029 }
8031 /* If the argument isn't invariant then there's nothing else we can do. */
8035 /* If we expect that a comparison against the argument will fold to
8036 a constant return the constant. In practice, this means a true
8037 constant or the address of a non-weak symbol. */
8041 {
8042 do
8043 {
8045 }
8050 }
8052 /* Otherwise, ARG0 already has the proper type for the return value. */
8054 }
8056 /* Fold a call to __builtin_classify_type with argument ARG. */
8058 static tree
8060 {
8065 }
8067 /* Fold a call to __builtin_strlen with argument ARG. */
8069 static tree
8071 {
8074 else
8075 {
8082 }
8083 }
8085 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8087 static tree
8089 {
8090 REAL_VALUE_TYPE real;
8092 /* __builtin_inff is intended to be usable to define INFINITY on all
8093 targets. If an infinity is not available, INFINITY expands "to a
8094 positive constant of type float that overflows at translation
8095 time", footnote "In this case, using INFINITY will violate the
8096 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8097 Thus we pedwarn to ensure this constraint violation is
8098 diagnosed. */
8104 }
8106 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8107 NULL_TREE if no simplification can be made. */
8109 static tree
8112 {
8113 tree type;
8123 /* Calculate the result when the argument is a constant. */
8128 /* Canonicalize sincos to cexpi. */
8130 {
8133 }
8135 {
8142 }
8154 }
8156 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8157 Return NULL_TREE if no simplification can be made. */
8159 static tree
8161 {
8167 /* If the LEN parameter is zero, return zero. */
8172 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8176 /* If len parameter is one, return an expression corresponding to
8177 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8179 {
8181 tree cst_uchar_ptr_node
8184 tree ind1
8188 cst_uchar_ptr_node,
8189 arg1)));
8190 tree ind2
8194 cst_uchar_ptr_node,
8195 arg2)));
8197 }
8200 }
8202 /* Fold a call to builtin isascii with argument ARG. */
8204 static tree
8206 {
8209 else
8210 {
8211 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8217 }
8218 }
8220 /* Fold a call to builtin toascii with argument ARG. */
8222 static tree
8224 {
8228 /* Transform toascii(c) -> (c & 0x7f). */
8231 }
8233 /* Fold a call to builtin isdigit with argument ARG. */
8235 static tree
8237 {
8240 else
8241 {
8242 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8243 /* According to the C standard, isdigit is unaffected by locale.
8244 However, it definitely is affected by the target character set. */
8245 unsigned HOST_WIDE_INT target_digit0
8256 }
8257 }
8259 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8261 static tree
8263 {
8269 }
8271 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8273 static tree
8275 {
8281 }
8283 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8285 static tree
8287 {
8290 {
8294 {
8299 }
8300 }
8303 }
8305 /* Fold a call to builtin frexp, we can assume the base is 2. */
8307 static tree
8309 {
8320 /* Proceed if a valid pointer type was passed in. */
8322 {
8327 {
8329 /* For +-0, return (*exp = 0, +-0). */
8335 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8338 {
8339 /* Since the frexp function always expects base 2, and in
8340 GCC normalized significands are already in the range
8341 [0.5, 1.0), we have exactly what frexp wants. */
8346 }
8350 }
8352 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8356 }
8359 }
8361 /* Fold a call to builtin modf. */
8363 static tree
8365 {
8376 /* Proceed if a valid pointer type was passed in. */
8378 {
8383 {
8386 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8390 /* For +-Inf, return (*arg1 = arg0, +-0). */
8396 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8399 /* If the original number was negative and already
8400 integral, then the fractional part is -0.0. */
8404 }
8406 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8412 }
8415 }
8417 /* Given a location LOC, an interclass builtin function decl FNDECL
8418 and its single argument ARG, return an folded expression computing
8419 the same, or NULL_TREE if we either couldn't or didn't want to fold
8420 (the latter happen if there's an RTL instruction available). */
8422 static tree
8424 {
8425 machine_mode mode;
8437 /* If there is no optab, try generic code. */
8439 {
8440 tree result;
8443 {
8444 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8447 REAL_VALUE_TYPE r;
8451 {
8452 /* NaN and Inf are encoded in the high-order double value
8453 only. The low-order value is not significant. */
8457 }
8464 }
8467 {
8468 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8471 REAL_VALUE_TYPE r;
8475 {
8476 /* NaN and Inf are encoded in the high-order double value
8477 only. The low-order value is not significant. */
8481 }
8487 /*result = fold_build2_loc (loc, UNGT_EXPR,
8488 TREE_TYPE (TREE_TYPE (fndecl)),
8489 fold_build1_loc (loc, ABS_EXPR, type, arg),
8490 build_real (type, r));
8491 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8492 TREE_TYPE (TREE_TYPE (fndecl)),
8493 result);*/
8495 }
8497 {
8498 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8499 islessequal(fabs(x),DBL_MAX). */
8509 {
8510 /* Use double to test the normal range of IBM extended
8511 precision. Emin for IBM extended precision is
8512 different to emin for IEEE double, being 53 higher
8513 since the low double exponent is at least 53 lower
8514 than the high double exponent. */
8518 }
8530 {
8531 /* Testing the high end of the range is done just using
8532 the high double, using the same test as isfinite().
8533 For the subnormal end of the range we first test the
8534 high double, then if its magnitude is equal to the
8535 limit of 0x1p-969, we test whether the low double is
8536 non-zero and opposite sign to the high double. */
8552 integer_type_node,
8558 }
8559 else
8560 {
8561 tree const isge_fn
8564 }
8568 }
8571 }
8574 }
8576 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8577 ARG is the argument for the call. */
8579 static tree
8581 {
8588 {
8596 {
8597 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8598 /* In a boolean context, GCC will fold the inner COND_EXPR to
8599 1. So e.g. "if (isinf_sign(x))" would be folded to just
8600 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8608 {
8621 integer_zero_node);
8622 }
8625 }
8638 {
8641 {
8642 /* NaN and Inf are encoded in the high-order double value
8643 only. The low-order value is not significant. */
8645 }
8646 }
8652 }
8653 }
8655 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8656 This builtin will generate code to return the appropriate floating
8657 point classification depending on the value of the floating point
8658 number passed in. The possible return values must be supplied as
8659 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8660 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8661 one floating point argument which is "type generic". */
8663 static tree
8665 {
8668 machine_mode mode;
8669 REAL_VALUE_TYPE r;
8672 /* Verify the required arguments in the original call. */
8692 /* fpclassify(x) ->
8693 isnan(x) ? FP_NAN :
8694 (fabs(x) == Inf ? FP_INFINITE :
8695 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8696 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8710 {
8716 }
8719 {
8722 }
8725 }
8727 /* Fold a call to an unordered comparison function such as
8728 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8729 being called and ARG0 and ARG1 are the arguments for the call.
8730 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8731 the opposite of the desired result. UNORDERED_CODE is used
8732 for modes that can hold NaNs and ORDERED_CODE is used for
8733 the rest. */
8735 static tree
8739 {
8753 /* Choose the wider of two real types. */
8765 {
8769 }
8774 }
8776 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8777 arithmetics if it can never overflow, or into internal functions that
8778 return both result of arithmetics and overflowed boolean flag in
8779 a complex integer result, or some other check for overflow.
8780 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8781 checking part of that. */
8783 static tree
8786 {
8788 /* The code of the expression corresponding to the type-generic
8789 built-in, or ERROR_MARK for the type-specific ones. */
8794 {
8797 /* FALLTHRU */
8800 /* FALLTHRU */
8811 /* FALLTHRU */
8814 /* FALLTHRU */
8825 /* FALLTHRU */
8828 /* FALLTHRU */
8839 }
8841 /* For the "generic" overloads, the first two arguments can have different
8842 types and the last argument determines the target type to use to check
8843 for overflow. The arguments of the other overloads all have the same
8844 type. */
8847 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8848 arguments are constant, attempt to fold the built-in call into a constant
8849 expression indicating whether or not it detected an overflow. */
8853 /* Perform the computation in the target type and check for overflow. */
8857 arg2);
8871 tree store
8874 }
8876 /* Fold a call to __builtin_FILE to a constant string. */
8880 {
8882 {
8883 /* The documentation says this builtin is equivalent to the preprocessor
8884 __FILE__ macro so it appears appropriate to use the same file prefix
8885 mappings. */
8888 }
8891 }
8893 /* Fold a call to __builtin_FUNCTION to a constant string. */
8897 {
8904 }
8906 /* Fold a call to __builtin_LINE to an integer constant. */
8910 {
8912 }
8914 /* Fold a call to built-in function FNDECL with 0 arguments.
8915 This function returns NULL_TREE if no simplification was possible. */
8917 static tree
8919 {
8923 {
8949 }
8951 }
8953 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8954 This function returns NULL_TREE if no simplification was possible. */
8956 static tree
8958 {
8969 {
8971 {
8974 /* Gimplification will pull the CALL_EXPR for the builtin out of
8975 an if condition. When not optimizing, we'll not CSE it back.
8976 To avoid link error types of regressions, return false now. */
8981 }
9037 {
9042 }
9048 {
9053 }
9074 }
9078 }
9080 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9081 This function returns NULL_TREE if no simplification was possible. */
9083 static tree
9085 {
9097 {
9141 NOP_EXPR);
9143 /* We do the folding for va_start in the expander. */
9158 }
9160 }
9162 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9163 and ARG2.
9164 This function returns NULL_TREE if no simplification was possible. */
9166 static tree
9169 {
9183 {
9229 }
9231 }
9233 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9234 arguments. IGNORE is true if the result of the
9235 function call is ignored. This function returns NULL_TREE if no
9236 simplification was possible. */
9238 tree
9240 {
9244 {
9260 }
9262 {
9266 }
9268 }
9270 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9271 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9272 of arguments in ARGS to be omitted. OLDNARGS is the number of
9273 elements in ARGS. */
9275 static tree
9278 {
9283 {
9291 }
9292 else
9296 }
9298 /* Return true if FNDECL shouldn't be folded right now.
9299 If a built-in function has an inline attribute always_inline
9300 wrapper, defer folding it after always_inline functions have
9301 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9302 might not be performed. */
9304 bool
9306 {
9309 && cfun
9312 }
9314 /* A wrapper function for builtin folding that prevents warnings for
9315 "statement without effect" and the like, caused by removing the
9316 call node earlier than the warning is generated. */
9318 tree
9320 {
9326 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9327 yet. Defer folding until we see all the arguments
9328 (after inlining). */
9330 {
9333 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9334 instead last argument is __builtin_va_arg_pack (). Defer folding
9335 even in that case, until arguments are finalized. */
9337 {
9344 }
9352 else
9353 {
9358 }
9359 }
9361 }
9363 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9364 N arguments are passed in the array ARGARRAY. Return a folded
9365 expression or NULL_TREE if no simplification was possible. */
9367 tree
9369 tree fn,
9372 {
9379 {
9380 /* If last argument is __builtin_va_arg_pack (), arguments to this
9381 function are not finalized yet. Defer folding until they are. */
9383 {
9390 }
9395 else
9397 }
9400 }
9402 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9403 along with N new arguments specified as the "..." parameters. SKIP
9404 is the number of arguments in EXP to be omitted. This function is used
9405 to do varargs-to-varargs transformations. */
9407 static tree
9409 {
9411 tree t;
9419 }
9421 /* Validate a single argument ARG against a tree code CODE representing
9422 a type. Return true when argument is valid. */
9424 static bool
9426 {
9434 }
9436 /* This function validates the types of a function call argument list
9437 against a specified list of tree_codes. If the last specifier is a 0,
9438 that represents an ellipses, otherwise the last specifier must be a
9439 VOID_TYPE.
9441 This is the GIMPLE version of validate_arglist. Eventually we want to
9442 completely convert builtins.c to work from GIMPLEs and the tree based
9443 validate_arglist will then be removed. */
9445 bool
9447 {
9451 const_tree arg;
9457 do
9458 {
9461 {
9463 /* This signifies an ellipses, any further arguments are all ok. */
9467 /* This signifies an endlink, if no arguments remain, return
9468 true, otherwise return false. */
9472 /* If no parameters remain or the parameter's code does not
9473 match the specified code, return false. Otherwise continue
9474 checking any remaining arguments. */
9479 }
9480 }
9483 /* We need gotos here since we can only have one VA_CLOSE in a
9484 function. */
9485 end: ;
9489 }
9491 /* Default target-specific builtin expander that does nothing. */
9493 rtx
9495 rtx target ATTRIBUTE_UNUSED,
9496 rtx subtarget ATTRIBUTE_UNUSED,
9497 machine_mode mode ATTRIBUTE_UNUSED,
9499 {
9501 }
9503 /* Returns true is EXP represents data that would potentially reside
9504 in a readonly section. */
9506 bool
9508 {
9518 /* Make sure we call decl_readonly_section only for trees it
9519 can handle (since it returns true for everything it doesn't
9520 understand). */
9525 else
9527 }
9529 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9530 to the call, and TYPE is its return type.
9532 Return NULL_TREE if no simplification was possible, otherwise return the
9533 simplified form of the call as a tree.
9535 The simplified form may be a constant or other expression which
9536 computes the same value, but in a more efficient manner (including
9537 calls to other builtin functions).
9539 The call may contain arguments which need to be evaluated, but
9540 which are not useful to determine the result of the call. In
9541 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9542 COMPOUND_EXPR will be an argument which must be evaluated.
9543 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9544 COMPOUND_EXPR in the chain will contain the tree for the simplified
9545 form of the builtin function call. */
9547 static tree
9549 {
9553 else
9554 {
9555 tree fn;
9564 {
9566 tree tem;
9571 /* Return an offset into the constant string argument. */
9574 }
9577 /* strpbrk(x, "") == NULL.
9578 Evaluate and ignore s1 in case it had side-effects. */
9588 /* New argument list transforming strpbrk(s1, s2) to
9589 strchr(s1, s2[0]). */
9592 }
9593 }
9595 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9596 to the call.
9598 Return NULL_TREE if no simplification was possible, otherwise return the
9599 simplified form of the call as a tree.
9601 The simplified form may be a constant or other expression which
9602 computes the same value, but in a more efficient manner (including
9603 calls to other builtin functions).
9605 The call may contain arguments which need to be evaluated, but
9606 which are not useful to determine the result of the call. In
9607 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9608 COMPOUND_EXPR will be an argument which must be evaluated.
9609 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9610 COMPOUND_EXPR in the chain will contain the tree for the simplified
9611 form of the builtin function call. */
9613 static tree
9615 {
9619 else
9620 {
9623 /* If either argument is "", return NULL_TREE. */
9625 /* Evaluate and ignore both arguments in case either one has
9626 side-effects. */
9630 }
9631 }
9633 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9634 to the call.
9636 Return NULL_TREE if no simplification was possible, otherwise return the
9637 simplified form of the call as a tree.
9639 The simplified form may be a constant or other expression which
9640 computes the same value, but in a more efficient manner (including
9641 calls to other builtin functions).
9643 The call may contain arguments which need to be evaluated, but
9644 which are not useful to determine the result of the call. In
9645 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9646 COMPOUND_EXPR will be an argument which must be evaluated.
9647 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9648 COMPOUND_EXPR in the chain will contain the tree for the simplified
9649 form of the builtin function call. */
9651 static tree
9653 {
9657 else
9658 {
9659 /* If the first argument is "", return NULL_TREE. */
9662 {
9663 /* Evaluate and ignore argument s2 in case it has
9664 side-effects. */
9667 }
9669 /* If the second argument is "", return __builtin_strlen(s1). */
9672 {
9675 /* If the replacement _DECL isn't initialized, don't do the
9676 transformation. */
9681 }
9683 }
9684 }
9686 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9687 produced. False otherwise. This is done so that we don't output the error
9688 or warning twice or three times. */
9690 bool
9692 {
9695 tree arg;
9696 /* There is good chance the current input_location points inside the
9697 definition of the va_start macro (perhaps on the token for
9698 builtin) in a system header, so warnings will not be emitted.
9699 Use the location in real source code. */
9700 source_location current_location =
9702 NULL);
9705 {
9708 }
9711 {
9713 {
9716 }
9718 }
9719 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9720 when we checked the arguments and if needed issued a warning. */
9721 else
9722 {
9724 {
9725 /* Evidently an out of date version of <stdarg.h>; can't validate
9726 va_start's second argument, but can still work as intended. */
9728 OPT_Wvarargs,
9731 }
9733 {
9736 }
9738 }
9743 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9744 or __builtin_next_arg (0) the first time we see it, after checking
9745 the arguments and if needed issuing a warning. */
9747 {
9750 /* Strip off all nops for the sake of the comparison. This
9751 is not quite the same as STRIP_NOPS. It does more.
9752 We must also strip off INDIRECT_EXPR for C++ reference
9753 parameters. */
9758 {
9759 /* FIXME: Sometimes with the tree optimizers we can get the
9760 not the last argument even though the user used the last
9761 argument. We just warn and set the arg to be the last
9762 argument so that we will get wrong-code because of
9763 it. */
9765 OPT_Wvarargs,
9767 }
9769 /* Undefined by C99 7.15.1.4p4 (va_start):
9770 "If the parameter parmN is declared with the register storage
9771 class, with a function or array type, or with a type that is
9772 not compatible with the type that results after application of
9773 the default argument promotions, the behavior is undefined."
9774 */
9776 {
9778 OPT_Wvarargs,
9779 "undefined behavior when second parameter of "
9781 }
9783 /* We want to verify the second parameter just once before the tree
9784 optimizers are run and then avoid keeping it in the tree,
9785 as otherwise we could warn even for correct code like:
9786 void foo (int i, ...)
9787 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9790 else
9792 }
9794 }
9797 /* Expand a call EXP to __builtin_object_size. */
9799 static rtx
9801 {
9802 tree ost;
9807 {
9812 }
9820 {
9825 }
9830 }
9832 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9833 FCODE is the BUILT_IN_* to use.
9834 Return NULL_RTX if we failed; the caller should emit a normal call,
9835 otherwise try to get the result in TARGET, if convenient (and in
9836 mode MODE if that's convenient). */
9838 static rtx
9841 {
9843 POINTER_TYPE,
9844 fcode == BUILT_IN_MEMSET_CHK
9861 {
9862 /* Avoid transforming the checking call to an ordinary one when
9863 an overflow has been detected or when the call couldn't be
9864 validated because the size is not constant. */
9869 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9870 mem{cpy,pcpy,move,set} is available. */
9872 {
9887 }
9896 }
9899 else
9900 {
9903 /* If DEST is not a pointer type, call the normal function. */
9907 /* If SRC and DEST are the same (and not volatile), do nothing. */
9909 {
9910 tree expr;
9913 {
9914 /* Evaluate and ignore LEN in case it has side-effects. */
9917 }
9921 }
9923 /* __memmove_chk special case. */
9925 {
9931 /* If src is categorized for a readonly section we can use
9932 normal __memcpy_chk. */
9934 {
9943 }
9944 }
9946 }
9947 }
9949 /* Emit warning if a buffer overflow is detected at compile time. */
9951 static void
9953 {
9954 /* The source string. */
9956 /* The size of the destination object. */
9958 /* The string that is being concatenated with (as in __strcat_chk)
9959 or null if it isn't. */
9961 /* The maximum length of the source sequence in a bounded operation
9962 (such as __strncat_chk) or null if the operation isn't bounded
9963 (such as __strcat_chk). */
9965 /* The exact size of the access (such as in __strncpy_chk). */
9969 {
9977 /* For __strcat_chk the warning will be emitted only if overflowing
9978 by at least strlen (dest) + 1 bytes. */
10005 }
10008 {
10009 /* Check __strncat_chk. There is no way to determine the length
10010 of the string to which the source string is being appended so
10011 just warn when the length of the source string is not known. */
10014 }
10016 /* The destination argument is the first one for all built-ins above. */
10020 }
10022 /* Emit warning if a buffer overflow is detected at compile time
10023 in __sprintf_chk/__vsprintf_chk calls. */
10025 static void
10027 {
10032 /* Verify the required arguments in the original call. */
10042 /* Check whether the format is a literal string constant. */
10050 /* If the format doesn't contain % args or %%, we know its size. */
10053 /* If the format is "%s" and first ... argument is a string literal,
10054 we know it too. */
10057 {
10058 tree arg;
10069 }
10070 else
10073 /* Add one for the terminating nul. */
10078 }
10080 /* Emit warning if a free is called with address of a variable. */
10082 static void
10084 {
10098 else
10101 }
10103 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10104 if possible. */
10106 static tree
10108 {
10125 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10126 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10127 and (size_t) 0 for types 2 and 3. */
10132 {
10136 }
10138 {
10139 /* If object size is not known yet, delay folding until
10140 later. Maybe subsequent passes will help determining
10141 it. */
10145 }
10148 }
10150 /* Builtins with folding operations that operate on "..." arguments
10151 need special handling; we need to store the arguments in a convenient
10152 data structure before attempting any folding. Fortunately there are
10153 only a few builtins that fall into this category. FNDECL is the
10154 function, EXP is the CALL_EXPR for the call. */
10156 static tree
10158 {
10163 {
10170 }
10172 {
10177 }
10179 }
10181 /* Initialize format string characters in the target charset. */
10183 bool
10185 {
10188 {
10211 }
10213 }
10215 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10216 and no overflow/underflow occurred. INEXACT is true if M was not
10217 exactly calculated. TYPE is the tree type for the result. This
10218 function assumes that you cleared the MPFR flags and then
10219 calculated M to see if anything subsequently set a flag prior to
10220 entering this function. Return NULL_TREE if any checks fail. */
10222 static tree
10224 {
10225 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10226 overflow/underflow occurred. If -frounding-math, proceed iff the
10227 result of calling FUNC was exact. */
10230 {
10231 REAL_VALUE_TYPE rr;
10234 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10235 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10236 but the mpft_t is not, then we underflowed in the
10237 conversion. */
10240 {
10241 REAL_VALUE_TYPE rmode;
10244 /* Proceed iff the specified mode can hold the value. */
10247 }
10248 }
10250 }
10252 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10253 number and no overflow/underflow occurred. INEXACT is true if M
10254 was not exactly calculated. TYPE is the tree type for the result.
10255 This function assumes that you cleared the MPFR flags and then
10256 calculated M to see if anything subsequently set a flag prior to
10257 entering this function. Return NULL_TREE if any checks fail, if
10258 FORCE_CONVERT is true, then bypass the checks. */
10260 static tree
10262 {
10263 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10264 overflow/underflow occurred. If -frounding-math, proceed iff the
10265 result of calling FUNC was exact. */
10270 {
10275 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10276 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10277 but the mpft_t is not, then we underflowed in the
10278 conversion. */
10283 {
10288 /* Proceed iff the specified mode can hold the value. */
10294 }
10295 }
10297 }
10299 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10300 the pointer *(ARG_QUO) and return the result. The type is taken
10301 from the type of ARG0 and is used for setting the precision of the
10302 calculation and results. */
10304 static tree
10306 {
10313 /* To proceed, MPFR must exactly represent the target floating point
10314 format, which only happens when the target base equals two. */
10318 {
10323 {
10327 tree result_rem;
10336 /* Remquo is independent of the rounding mode, so pass
10337 inexact=0 to do_mpfr_ckconv(). */
10341 {
10342 /* MPFR calculates quo in the host's long so it may
10343 return more bits in quo than the target int can hold
10344 if sizeof(host long) > sizeof(target int). This can
10345 happen even for native compilers in LP64 mode. In
10346 these cases, modulo the quo value with the largest
10347 number that the target int can hold while leaving one
10348 bit for the sign. */
10352 /* Dereference the quo pointer argument. */
10354 /* Proceed iff a valid pointer type was passed in. */
10356 {
10357 /* Set the value. */
10358 tree result_quo
10361 integer_quo));
10363 /* Combine the quo assignment with the rem. */
10366 }
10367 }
10368 }
10369 }
10371 }
10373 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10374 resulting value as a tree with type TYPE. The mpfr precision is
10375 set to the precision of TYPE. We assume that this mpfr function
10376 returns zero if the result could be calculated exactly within the
10377 requested precision. In addition, the integer pointer represented
10378 by ARG_SG will be dereferenced and set to the appropriate signgam
10379 (-1,1) value. */
10381 static tree
10383 {
10388 /* To proceed, MPFR must exactly represent the target floating point
10389 format, which only happens when the target base equals two. Also
10390 verify ARG is a constant and that ARG_SG is an int pointer. */
10395 {
10398 /* In addition to NaN and Inf, the argument cannot be zero or a
10399 negative integer. */
10403 {
10408 mpfr_t m;
10409 tree result_lg;
10418 {
10419 tree result_sg;
10421 /* Dereference the arg_sg pointer argument. */
10423 /* Assign the signgam value into *arg_sg. */
10428 /* Combine the signgam assignment with the lgamma result. */
10431 }
10432 }
10433 }
10436 }
10438 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10439 mpc function FUNC on it and return the resulting value as a tree
10440 with type TYPE. The mpfr precision is set to the precision of
10441 TYPE. We assume that function FUNC returns zero if the result
10442 could be calculated exactly within the requested precision. If
10443 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10444 in the arguments and/or results. */
10446 tree
10449 {
10455 /* To proceed, MPFR must exactly represent the target floating point
10456 format, which only happens when the target base equals two. */
10462 {
10471 {
10491 }
10492 }
10495 }
10497 /* A wrapper function for builtin folding that prevents warnings for
10498 "statement without effect" and the like, caused by removing the
10499 call node earlier than the warning is generated. */
10501 tree
10503 {
10511 {
10520 {
10522 }
10523 else
10524 {
10527 {
10528 /* Propagate location information from original call to
10529 expansion of builtin. Otherwise things like
10530 maybe_emit_chk_warning, that operate on the expansion
10531 of a builtin, will use the wrong location information. */
10533 {
10541 }
10543 }
10544 }
10545 }
10547 }
10549 /* Look up the function in builtin_decl that corresponds to DECL
10550 and set ASMSPEC as its user assembler name. DECL must be a
10551 function decl that declares a builtin. */
10553 void
10555 {
10565 {
10569 }
10570 }
10572 /* Return true if DECL is a builtin that expands to a constant or similarly
10573 simple code. */
10574 bool
10576 {
10579 {
10580 /* Builtins that expand to constants. */
10585 /* Simple register moves or loads from stack. */
10596 /* Exception state returns or moves registers around. */
10604 }
10607 }
10609 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10610 most probably expanded inline into reasonably simple code. This is a
10611 superset of is_simple_builtin. */
10612 bool
10614 {
10621 {
10623 CASE_BUILT_IN_ALLOCA:
10689 }
10692 }
10694 /* Return true if T is a constant and the value cast to a target char
10695 can be represented by a host char.
10696 Store the casted char constant in *P if so. */
10698 bool
10700 {
10706 }
10708 /* Return the maximum object size. */
10710 tree
10712 {
10713 /* To do: Make this a configurable parameter. */
10715 }