| blob | 93c617e81ff6f26c500e3e85531892e4ca649167 |
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. */
196 /* Return true if NAME starts with __builtin_ or __sync_. */
198 static bool
200 {
208 }
211 /* Return true if DECL is a function symbol representing a built-in. */
213 bool
215 {
217 }
219 /* Return true if NODE should be considered for inline expansion regardless
220 of the optimization level. This means whenever a function is invoked with
221 its "internal" name, which normally contains the prefix "__builtin". */
223 bool
225 {
226 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
227 we want the name used to call the function, not the name it
228 will have. */
231 }
233 /* Compute values M and N such that M divides (address of EXP - N) and such
234 that N < M. If these numbers can be determined, store M in alignp and N in
235 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
236 *alignp and any bit-offset to *bitposp.
238 Note that the address (and thus the alignment) computed here is based
239 on the address to which a symbol resolves, whereas DECL_ALIGN is based
240 on the address at which an object is actually located. These two
241 addresses are not always the same. For example, on ARM targets,
242 the address &foo of a Thumb function foo() has the lowest bit set,
243 whereas foo() itself starts on an even address.
245 If ADDR_P is true we are taking the address of the memory reference EXP
246 and thus cannot rely on the access taking place. */
248 static bool
251 {
253 tree offset;
254 machine_mode mode;
259 /* Get the innermost object and the constant (bitpos) and possibly
260 variable (offset) offset of the access. */
264 /* Extract alignment information from the innermost object and
265 possibly adjust bitpos and offset. */
267 {
268 /* Function addresses can encode extra information besides their
269 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
270 allows the low bit to be used as a virtual bit, we know
271 that the address itself must be at least 2-byte aligned. */
274 }
276 ;
278 {
279 /* The alignment of a CONST_DECL is determined by its initializer. */
286 }
288 {
291 }
295 {
301 /* If the address is explicitely aligned, handle that. */
304 {
309 }
311 known_alignment
315 /* Re-apply explicit alignment to the bitpos. */
318 /* The alignment of the pointer operand in a TARGET_MEM_REF
319 has to take the variable offset parts into account. */
321 {
323 {
328 }
332 }
334 /* When EXP is an actual memory reference then we can use
335 TYPE_ALIGN of a pointer indirection to derive alignment.
336 Do so only if get_pointer_alignment_1 did not reveal absolute
337 alignment knowledge and if using that alignment would
338 improve the situation. */
344 else
345 {
346 /* Else adjust bitpos accordingly. */
351 }
352 }
354 {
355 /* STRING_CST are the only constant objects we allow to be not
356 wrapped inside a CONST_DECL. */
362 }
364 /* If there is a non-constant offset part extract the maximum
365 alignment that can prevail. */
367 {
370 {
374 }
375 }
377 /* Account for the alignment of runtime coefficients, so that the constant
378 bitpos is guaranteed to be accurate. */
381 {
384 }
389 }
391 /* For a memory reference expression EXP compute values M and N such that M
392 divides (&EXP - N) and such that N < M. If these numbers can be determined,
393 store M in alignp and N in *BITPOSP and return true. Otherwise return false
394 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
396 bool
399 {
401 }
403 /* Return the alignment in bits of EXP, an object. */
405 unsigned int
407 {
413 /* align and bitpos now specify known low bits of the pointer.
414 ptr & (align - 1) == bitpos. */
419 }
421 /* For a pointer valued expression EXP compute values M and N such that M
422 divides (EXP - N) and such that N < M. If these numbers can be determined,
423 store M in alignp and N in *BITPOSP and return true. Return false if
424 the results are just a conservative approximation.
426 If EXP is not a pointer, false is returned too. */
428 bool
431 {
438 {
445 else
446 {
449 {
453 }
454 }
458 }
461 {
466 {
469 /* Make sure to return a sensible alignment when the multiplication
470 by BITS_PER_UNIT overflowed. */
473 /* We cannot really tell whether this result is an approximation. */
475 }
476 else
477 {
481 }
482 }
484 {
489 }
494 }
496 /* Return the alignment in bits of EXP, a pointer valued expression.
497 The alignment returned is, by default, the alignment of the thing that
498 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
500 Otherwise, look at the expression to see if we can do better, i.e., if the
501 expression is actually pointing at an object whose alignment is tighter. */
503 unsigned int
505 {
511 /* align and bitpos now specify known low bits of the pointer.
512 ptr & (align - 1) == bitpos. */
518 }
520 /* Return the number of non-zero elements in the sequence
521 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
522 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
524 static unsigned
526 {
532 {
533 /* Optimize the common case of plain char. */
535 {
539 }
540 }
541 else
542 {
544 {
548 }
549 }
551 }
553 /* Compute the length of a null-terminated character string or wide
554 character string handling character sizes of 1, 2, and 4 bytes.
555 TREE_STRING_LENGTH is not the right way because it evaluates to
556 the size of the character array in bytes (as opposed to characters)
557 and because it can contain a zero byte in the middle.
559 ONLY_VALUE should be nonzero if the result is not going to be emitted
560 into the instruction stream and zero if it is going to be expanded.
561 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
562 is returned, otherwise NULL, since
563 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
564 evaluate the side-effects.
566 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
567 accesses. Note that this implies the result is not going to be emitted
568 into the instruction stream.
570 The value returned is of type `ssizetype'.
572 Unfortunately, string_constant can't access the values of const char
573 arrays with initializers, so neither can we do so here. */
575 tree
577 {
581 {
588 }
596 /* Offset from the beginning of the string in bytes. */
597 tree byteoff;
602 /* Determine the size of the string element. */
603 unsigned eltsize
606 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
607 length of SRC. */
610 /* PTR can point to the byte representation of any string type, including
611 char* and wchar_t*. */
615 {
616 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
617 compute the offset to the following null if we don't know where to
618 start searching for it. */
620 {
621 /* Return when an embedded null character is found. */
623 }
628 /* We don't know the starting offset, but we do know that the string
629 has no internal zero bytes. We can assume that the offset falls
630 within the bounds of the string; otherwise, the programmer deserves
631 what he gets. Subtract the offset from the length of the string,
632 and return that. This would perhaps not be valid if we were dealing
633 with named arrays in addition to literal string constants. */
636 }
638 /* Offset from the beginning of the string in elements. */
639 HOST_WIDE_INT eltoff;
641 /* We have a known offset into the string. Start searching there for
642 a null character if we can represent it as a single HOST_WIDE_INT. */
647 else
650 /* If the offset is known to be out of bounds, warn, and call strlen at
651 runtime. */
653 {
654 /* Suppress multiple warnings for propagated constant strings. */
657 {
660 eltoff);
662 }
664 }
666 /* Use strlen to search for the first zero byte. Since any strings
667 constructed with build_string will have nulls appended, we win even
668 if we get handed something like (char[4])"abcd".
670 Since ELTOFF is our starting index into the string, no further
671 calculation is needed. */
676 }
678 /* Return a constant integer corresponding to target reading
679 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
681 static rtx
683 {
684 HOST_WIDE_INT ch;
698 {
710 }
714 }
716 /* Cast a target constant CST to target CHAR and if that value fits into
717 host char type, return zero and put that value into variable pointed to by
718 P. */
720 static int
722 {
729 /* Do not care if it fits or not right here. */
744 }
746 /* Similar to save_expr, but assumes that arbitrary code is not executed
747 in between the multiple evaluations. In particular, we assume that a
748 non-addressable local variable will not be modified. */
750 static tree
752 {
760 }
762 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
763 times to get the address of either a higher stack frame, or a return
764 address located within it (depending on FNDECL_CODE). */
766 static rtx
768 {
772 {
773 /* For a zero count with __builtin_return_address, we don't care what
774 frame address we return, because target-specific definitions will
775 override us. Therefore frame pointer elimination is OK, and using
776 the soft frame pointer is OK.
778 For a nonzero count, or a zero count with __builtin_frame_address,
779 we require a stable offset from the current frame pointer to the
780 previous one, so we must use the hard frame pointer, and
781 we must disable frame pointer elimination. */
784 else
785 {
788 /* Tell reload not to eliminate the frame pointer. */
790 }
791 }
796 /* On the SPARC, the return address is not in the frame, it is in a
797 register. There is no way to access it off of the current frame
798 pointer, but it can be accessed off the previous frame pointer by
799 reading the value from the register window save area. */
801 count--;
803 /* Scan back COUNT frames to the specified frame. */
805 {
806 /* Assume the dynamic chain pointer is in the word that the
807 frame address points to, unless otherwise specified. */
812 }
814 /* For __builtin_frame_address, return what we've got. But, on
815 the SPARC for example, we may have to add a bias. */
819 /* For __builtin_return_address, get the return address from that frame. */
820 #ifdef RETURN_ADDR_RTX
822 #else
826 #endif
828 }
830 /* Alias set used for setjmp buffer. */
833 /* Construct the leading half of a __builtin_setjmp call. Control will
834 return to RECEIVER_LABEL. This is also called directly by the SJLJ
835 exception handling code. */
837 void
839 {
841 rtx stack_save;
842 rtx mem;
851 /* We store the frame pointer and the address of receiver_label in
852 the buffer and use the rest of it for the stack save area, which
853 is machine-dependent. */
872 /* If there is further processing to do, do it. */
876 /* We have a nonlocal label. */
878 }
880 /* Construct the trailing part of a __builtin_setjmp call. This is
881 also called directly by the SJLJ exception handling code.
882 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
884 void
886 {
887 rtx chain;
889 /* Mark the FP as used when we get here, so we have to make sure it's
890 marked as used by this function. */
893 /* Mark the static chain as clobbered here so life information
894 doesn't get messed up for it. */
899 /* Now put in the code to restore the frame pointer, and argument
900 pointer, if needed. */
902 {
903 /* First adjust our frame pointer to its actual value. It was
904 previously set to the start of the virtual area corresponding to
905 the stacked variables when we branched here and now needs to be
906 adjusted to the actual hardware fp value.
908 Assignments to virtual registers are converted by
909 instantiate_virtual_regs into the corresponding assignment
910 to the underlying register (fp in this case) that makes
911 the original assignment true.
912 So the following insn will actually be decrementing fp by
913 TARGET_STARTING_FRAME_OFFSET. */
916 /* Restoring the frame pointer also modifies the hard frame pointer.
917 Mark it used (so that the previous assignment remains live once
918 the frame pointer is eliminated) and clobbered (to represent the
919 implicit update from the assignment). */
922 }
925 {
926 /* If the argument pointer can be eliminated in favor of the
927 frame pointer, we don't need to restore it. We assume here
928 that if such an elimination is present, it can always be used.
929 This is the case on all known machines; if we don't make this
930 assumption, we do unnecessary saving on many machines. */
940 {
941 /* Now restore our arg pointer from the address at which it
942 was saved in our stack frame. */
945 }
946 }
952 else
955 /* We must not allow the code we just generated to be reordered by
956 scheduling. Specifically, the update of the frame pointer must
957 happen immediately, not later. */
959 }
961 /* __builtin_longjmp is passed a pointer to an array of five words (not
962 all will be used on all machines). It operates similarly to the C
963 library function of the same name, but is more efficient. Much of
964 the code below is copied from the handling of non-local gotos. */
966 static void
968 {
973 /* DRAP is needed for stack realign if longjmp is expanded to current
974 function */
985 /* We require that the user must pass a second argument of 1, because
986 that is what builtin_setjmp will return. */
992 else
993 {
1004 /* Pick up FP, label, and SP from the block and jump. This code is
1005 from expand_goto in stmt.c; see there for detailed comments. */
1007 /* We have to pass a value to the nonlocal_goto pattern that will
1008 get copied into the static_chain pointer, but it does not matter
1009 what that value is, because builtin_setjmp does not use it. */
1011 else
1012 {
1024 }
1025 }
1027 /* Search backwards and mark the jump insn as a non-local goto.
1028 Note that this precludes the use of __builtin_longjmp to a
1029 __builtin_setjmp target in the same function. However, we've
1030 already cautioned the user that these functions are for
1031 internal exception handling use only. */
1033 {
1037 {
1040 }
1043 }
1044 }
1048 {
1050 }
1052 /* This function validates the types of a function call argument list
1053 against a specified list of tree_codes. If the last specifier is a 0,
1054 that represents an ellipsis, otherwise the last specifier must be a
1055 VOID_TYPE. */
1057 static bool
1059 {
1063 const_call_expr_arg_iterator iter;
1064 const_tree arg;
1069 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1074 {
1078 {
1080 /* This signifies an ellipses, any further arguments are all ok. */
1084 /* This signifies an endlink, if no arguments remain, return
1085 true, otherwise return false. */
1089 /* The actual argument must be nonnull when either the whole
1090 called function has been declared nonnull, or when the formal
1091 argument corresponding to the actual argument has been. */
1094 {
1099 }
1100 /* FALLTHRU */
1102 /* If no parameters remain or the parameter's code does not
1103 match the specified code, return false. Otherwise continue
1104 checking any remaining arguments. */
1109 }
1110 }
1112 /* We need gotos here since we can only have one VA_CLOSE in a
1113 function. */
1114 end: ;
1120 }
1122 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1123 and the address of the save area. */
1125 static rtx
1127 {
1142 /* Copy the address of the save location to a register just in case it was
1143 based on the frame pointer. */
1152 /* ??? We no longer need to pass the static chain value, afaik. */
1155 else
1156 {
1162 /* Restore frame pointer for containing function. */
1166 /* USE of hard_frame_pointer_rtx added for consistency;
1167 not clear if really needed. */
1171 /* If the architecture is using a GP register, we must
1172 conservatively assume that the target function makes use of it.
1173 The prologue of functions with nonlocal gotos must therefore
1174 initialize the GP register to the appropriate value, and we
1175 must then make sure that this value is live at the point
1176 of the jump. (Note that this doesn't necessarily apply
1177 to targets with a nonlocal_goto pattern; they are free
1178 to implement it in their own way. Note also that this is
1179 a no-op if the GP register is a global invariant.) */
1185 }
1187 /* Search backwards to the jump insn and mark it as a
1188 non-local goto. */
1190 {
1192 {
1195 }
1198 }
1201 }
1203 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1204 (not all will be used on all machines) that was passed to __builtin_setjmp.
1205 It updates the stack pointer in that block to the current value. This is
1206 also called directly by the SJLJ exception handling code. */
1208 void
1210 {
1213 rtx stack_save
1215 memory_address
1221 }
1223 /* Expand a call to __builtin_prefetch. For a target that does not support
1224 data prefetch, evaluate the memory address argument in case it has side
1225 effects. */
1227 static void
1229 {
1239 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1240 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1241 locality). */
1245 else
1249 else
1252 /* Argument 0 is an address. */
1255 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1257 {
1260 }
1262 /* Argument 1 must be either zero or one. */
1264 {
1268 }
1270 /* Argument 2 (locality) must be a compile-time constant int. */
1272 {
1275 }
1277 /* Argument 2 must be 0, 1, 2, or 3. */
1279 {
1282 }
1285 {
1293 }
1295 /* Don't do anything with direct references to volatile memory, but
1296 generate code to handle other side effects. */
1299 }
1301 /* Get a MEM rtx for expression EXP which is the address of an operand
1302 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1303 the maximum length of the block of memory that might be accessed or
1304 NULL if unknown. */
1306 static rtx
1308 {
1312 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1313 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1320 /* Get an expression we can use to find the attributes to assign to MEM.
1321 First remove any nops. */
1326 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1327 (as builtin stringops may alias with anything). */
1334 /* If the MEM_REF has no acceptable address, try to get the base object
1335 from the original address we got, and build an all-aliasing
1336 unknown-sized access to that one. */
1342 {
1347 size_zero_node,
1348 NULL)),
1351 }
1354 }
1355 \f
1356 /* Built-in functions to perform an untyped call and return. */
1358 #define apply_args_mode \
1359 (this_target_builtins->x_apply_args_mode)
1360 #define apply_result_mode \
1361 (this_target_builtins->x_apply_result_mode)
1363 /* Return the size required for the block returned by __builtin_apply_args,
1364 and initialize apply_args_mode. */
1366 static int
1368 {
1373 /* The values computed by this function never change. */
1375 {
1376 /* The first value is the incoming arg-pointer. */
1379 /* The second value is the structure value address unless this is
1380 passed as an "invisible" first argument. */
1386 {
1396 }
1397 else
1398 {
1400 }
1401 }
1403 }
1405 /* Return the size required for the block returned by __builtin_apply,
1406 and initialize apply_result_mode. */
1408 static int
1410 {
1414 /* The values computed by this function never change. */
1416 {
1421 {
1431 }
1432 else
1435 /* Allow targets that use untyped_call and untyped_return to override
1436 the size so that machine-specific information can be stored here. */
1437 #ifdef APPLY_RESULT_SIZE
1439 #endif
1440 }
1442 }
1444 /* Create a vector describing the result block RESULT. If SAVEP is true,
1445 the result block is used to save the values; otherwise it is used to
1446 restore the values. */
1448 static rtx
1450 {
1452 fixed_size_mode mode;
1459 {
1469 }
1471 }
1473 /* Save the state required to perform an untyped call with the same
1474 arguments as were passed to the current function. */
1476 static rtx
1478 {
1481 fixed_size_mode mode;
1482 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1484 /* Create a block where the arg-pointer, structure value address,
1485 and argument registers can be saved. */
1488 /* Walk past the arg-pointer and structure value address. */
1493 /* Save each register used in calling a function to the block. */
1496 {
1505 }
1507 /* Save the arg pointer to the block. */
1509 /* We need the pointer as the caller actually passed them to us, not
1510 as we might have pretended they were passed. Make sure it's a valid
1511 operand, as emit_move_insn isn't expected to handle a PLUS. */
1513 tem
1516 NULL_RTX);
1521 /* Save the structure value address unless this is passed as an
1522 "invisible" first argument. */
1524 {
1528 }
1530 /* Return the address of the block. */
1532 }
1534 /* __builtin_apply_args returns block of memory allocated on
1535 the stack into which is stored the arg pointer, structure
1536 value address, static chain, and all the registers that might
1537 possibly be used in performing a function call. The code is
1538 moved to the start of the function so the incoming values are
1539 saved. */
1541 static rtx
1543 {
1544 /* Don't do __builtin_apply_args more than once in a function.
1545 Save the result of the first call and reuse it. */
1548 {
1549 /* When this function is called, it means that registers must be
1550 saved on entry to this function. So we migrate the
1551 call to the first insn of this function. */
1552 rtx temp;
1561 /* Put the insns after the NOTE that starts the function.
1562 If this is inside a start_sequence, make the outer-level insn
1563 chain current, so the code is placed at the start of the
1564 function. If internal_arg_pointer is a non-virtual pseudo,
1565 it needs to be placed after the function that initializes
1566 that pseudo. */
1571 else
1575 }
1576 }
1578 /* Perform an untyped call and save the state required to perform an
1579 untyped return of whatever value was returned by the given function. */
1581 static rtx
1583 {
1585 fixed_size_mode mode;
1594 /* Create a block where the return registers can be saved. */
1597 /* Fetch the arg pointer from the ARGUMENTS block. */
1604 /* Push a new argument block and copy the arguments. Do not allow
1605 the (potential) memcpy call below to interfere with our stack
1606 manipulations. */
1608 NO_DEFER_POP;
1610 /* Save the stack with nonlocal if available. */
1613 else
1616 /* Allocate a block of memory onto the stack and copy the memory
1617 arguments to the outgoing arguments address. We can pass TRUE
1618 as the 4th argument because we just saved the stack pointer
1619 and will restore it right after the call. */
1622 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1623 may have already set current_function_calls_alloca to true.
1624 current_function_calls_alloca won't be set if argsize is zero,
1625 so we have to guarantee need_drap is true here. */
1631 {
1634 else
1636 }
1643 /* Refer to the argument block. */
1648 /* Walk past the arg-pointer and structure value address. */
1653 /* Restore each of the registers previously saved. Make USE insns
1654 for each of these registers for use in making the call. */
1657 {
1665 }
1667 /* Restore the structure value address unless this is passed as an
1668 "invisible" first argument. */
1671 {
1678 }
1680 /* All arguments and registers used for the call are set up by now! */
1683 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1684 and we don't want to load it into a register as an optimization,
1685 because prepare_call_address already did it if it should be done. */
1689 /* Generate the actual call instruction and save the return value. */
1691 {
1695 }
1697 {
1700 /* Locate the unique return register. It is not possible to
1701 express a call that sets more than one return register using
1702 call_value; use untyped_call for that. In fact, untyped_call
1703 only needs to save the return registers in the given block. */
1706 {
1710 }
1717 }
1718 else
1721 /* Find the CALL insn we just emitted, and attach the register usage
1722 information. */
1726 /* Restore the stack. */
1729 else
1733 OK_DEFER_POP;
1735 /* Return the address of the result block. */
1738 }
1740 /* Perform an untyped return. */
1742 static void
1744 {
1746 fixed_size_mode mode;
1747 rtx reg;
1756 {
1761 }
1763 /* Restore the return value and note that each value is used. */
1767 {
1779 }
1781 /* Put the USE insns before the return. */
1784 /* Return whatever values was restored by jumping directly to the end
1785 of the function. */
1787 }
1789 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1791 static enum type_class
1793 {
1795 {
1814 }
1815 }
1817 /* Expand a call EXP to __builtin_classify_type. */
1819 static rtx
1821 {
1825 }
1827 /* This helper macro, meant to be used in mathfn_built_in below, determines
1828 which among a set of builtin math functions is appropriate for a given type
1829 mode. The `F' (float) and `L' (long double) are automatically generated
1830 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1831 types, there are additional types that are considered with 'F32', 'F64',
1832 'F128', etc. suffixes. */
1833 #define CASE_MATHFN(MATHFN) \
1834 CASE_CFN_##MATHFN: \
1835 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1836 fcodel = BUILT_IN_##MATHFN##L ; break;
1837 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1838 types. */
1839 #define CASE_MATHFN_FLOATN(MATHFN) \
1840 CASE_CFN_##MATHFN: \
1841 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1842 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1843 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1844 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1845 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1846 break;
1847 /* Similar to above, but appends _R after any F/L suffix. */
1848 #define CASE_MATHFN_REENT(MATHFN) \
1849 case CFN_BUILT_IN_##MATHFN##_R: \
1850 case CFN_BUILT_IN_##MATHFN##F_R: \
1851 case CFN_BUILT_IN_##MATHFN##L_R: \
1852 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1853 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1855 /* Return a function equivalent to FN but operating on floating-point
1856 values of type TYPE, or END_BUILTINS if no such function exists.
1857 This is purely an operation on function codes; it does not guarantee
1858 that the target actually has an implementation of the function. */
1860 static built_in_function
1862 {
1863 tree mtype;
1874 {
1965 }
1988 else
1990 }
1992 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1993 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1994 otherwise use the explicit declaration. If we can't do the conversion,
1995 return null. */
1997 static tree
1999 {
2008 }
2010 /* Like mathfn_built_in_1, but always use the implicit array. */
2012 tree
2014 {
2016 }
2018 /* Like mathfn_built_in_1, but take a built_in_function and
2019 always use the implicit array. */
2021 tree
2023 {
2025 }
2027 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2028 return its code, otherwise return IFN_LAST. Note that this function
2029 only tests whether the function is defined in internals.def, not whether
2030 it is actually available on the target. */
2032 internal_fn
2034 {
2038 {
2039 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2040 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2041 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2042 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2043 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2044 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2045 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2062 }
2063 }
2065 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2066 on the current target by a call to an internal function, return the
2067 code of that internal function, otherwise return IFN_LAST. The caller
2068 is responsible for ensuring that any side-effects of the built-in
2069 call are dealt with correctly. E.g. if CALL sets errno, the caller
2070 must decide that the errno result isn't needed or make it available
2071 in some other way. */
2073 internal_fn
2075 {
2077 {
2080 {
2085 }
2086 }
2088 }
2090 /* Expand a call to the builtin trinary math functions (fma).
2091 Return NULL_RTX if a normal call should be emitted rather than expanding the
2092 function in-line. EXP is the expression that is a call to the builtin
2093 function; if convenient, the result should be placed in TARGET.
2094 SUBTARGET may be used as the target for computing one of EXP's
2095 operands. */
2097 static rtx
2099 {
2100 optab builtin_optab;
2105 machine_mode mode;
2115 {
2121 }
2123 /* Make a suitable register to place result in. */
2126 /* Before working hard, check whether the instruction is available. */
2132 /* Always stabilize the argument list. */
2143 /* Compute into RESULT.
2144 Set RESULT to wherever the result comes back. */
2148 /* If we were unable to expand via the builtin, stop the sequence
2149 (without outputting the insns) and call to the library function
2150 with the stabilized argument list. */
2152 {
2155 }
2157 /* Output the entire sequence. */
2163 }
2165 /* Expand a call to the builtin sin and cos math functions.
2166 Return NULL_RTX if a normal call should be emitted rather than expanding the
2167 function in-line. EXP is the expression that is a call to the builtin
2168 function; if convenient, the result should be placed in TARGET.
2169 SUBTARGET may be used as the target for computing one of EXP's
2170 operands. */
2172 static rtx
2174 {
2175 optab builtin_optab;
2176 rtx op0;
2179 machine_mode mode;
2180 tree arg;
2188 {
2194 }
2196 /* Make a suitable register to place result in. */
2199 /* Check if sincos insn is available, otherwise fallback
2200 to sin or cos insn. */
2203 {
2210 }
2212 /* Before working hard, check whether the instruction is available. */
2214 {
2217 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2218 need to expand the argument again. This way, we will not perform
2219 side-effects more the once. */
2226 /* Compute into RESULT.
2227 Set RESULT to wherever the result comes back. */
2229 {
2233 {
2242 }
2244 }
2245 else
2249 {
2250 /* Output the entire sequence. */
2255 }
2257 /* If we were unable to expand via the builtin, stop the sequence
2258 (without outputting the insns) and call to the library function
2259 with the stabilized argument list. */
2261 }
2264 }
2266 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2267 return an RTL instruction code that implements the functionality.
2268 If that isn't possible or available return CODE_FOR_nothing. */
2270 static enum insn_code
2272 {
2275 machine_mode mode;
2278 {
2292 /* These builtins have no optabs (yet). */
2296 }
2298 /* There's no easy way to detect the case we need to set EDOM. */
2302 /* Optab mode depends on the mode of the input argument. */
2308 }
2310 /* Expand a call to one of the builtin math functions that operate on
2311 floating point argument and output an integer result (ilogb, isinf,
2312 isnan, etc).
2313 Return 0 if a normal call should be emitted rather than expanding the
2314 function in-line. EXP is the expression that is a call to the builtin
2315 function; if convenient, the result should be placed in TARGET. */
2317 static rtx
2319 {
2321 rtx op0;
2323 machine_mode mode;
2324 tree arg;
2334 {
2339 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2340 need to expand the argument again. This way, we will not perform
2341 side-effects more the once. */
2356 }
2359 }
2361 /* Expand a call to the builtin sincos math function.
2362 Return NULL_RTX if a normal call should be emitted rather than expanding the
2363 function in-line. EXP is the expression that is a call to the builtin
2364 function. */
2366 static rtx
2368 {
2370 machine_mode mode;
2384 /* Make a suitable register to place result in. */
2387 /* Check if sincos insn is available, otherwise emit the call. */
2402 /* Compute into target1 and target2.
2403 Set TARGET to wherever the result comes back. */
2407 /* Move target1 and target2 to the memory locations indicated
2408 by op1 and op2. */
2413 }
2415 /* Expand a call to the internal cexpi builtin to the sincos math function.
2416 EXP is the expression that is a call to the builtin function; if convenient,
2417 the result should be placed in TARGET. */
2419 static rtx
2421 {
2424 machine_mode mode;
2435 /* Try expanding via a sincos optab, fall back to emitting a libcall
2436 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2437 is only generated from sincos, cexp or if we have either of them. */
2439 {
2445 /* Compute into op1 and op2. */
2447 }
2449 {
2460 else
2470 /* Make sure not to fold the sincos call again. */
2474 }
2475 else
2476 {
2486 else
2489 /* If we don't have a decl for cexp create one. This is the
2490 friendliest fallback if the user calls __builtin_cexpi
2491 without full target C99 function support. */
2493 {
2494 tree fntype;
2506 }
2511 /* Make sure not to fold the cexp call again. */
2515 }
2517 /* Now build the proper return type. */
2522 }
2524 /* Conveniently construct a function call expression. FNDECL names the
2525 function to be called, N is the number of arguments, and the "..."
2526 parameters are the argument expressions. Unlike build_call_exr
2527 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2529 static tree
2531 {
2541 }
2543 /* Expand a call to one of the builtin rounding functions gcc defines
2544 as an extension (lfloor and lceil). As these are gcc extensions we
2545 do not need to worry about setting errno to EDOM.
2546 If expanding via optab fails, lower expression to (int)(floor(x)).
2547 EXP is the expression that is a call to the builtin function;
2548 if convenient, the result should be placed in TARGET. */
2550 static rtx
2552 {
2553 convert_optab builtin_optab;
2558 tree fallback_fndecl;
2559 machine_mode mode;
2560 tree arg;
2568 {
2585 }
2587 /* Make a suitable register to place result in. */
2592 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2593 need to expand the argument again. This way, we will not perform
2594 side-effects more the once. */
2601 /* Compute into TARGET. */
2603 {
2604 /* Output the entire sequence. */
2609 }
2611 /* If we were unable to expand via the builtin, stop the sequence
2612 (without outputting the insns). */
2615 /* Fall back to floating point rounding optab. */
2618 /* For non-C99 targets we may end up without a fallback fndecl here
2619 if the user called __builtin_lfloor directly. In this case emit
2620 a call to the floor/ceil variants nevertheless. This should result
2621 in the best user experience for not full C99 targets. */
2623 {
2624 tree fntype;
2628 {
2661 }
2666 }
2673 /* Truncate the result of floating point optab to integer
2674 via expand_fix (). */
2679 }
2681 /* Expand a call to one of the builtin math functions doing integer
2682 conversion (lrint).
2683 Return 0 if a normal call should be emitted rather than expanding the
2684 function in-line. EXP is the expression that is a call to the builtin
2685 function; if convenient, the result should be placed in TARGET. */
2687 static rtx
2689 {
2690 convert_optab builtin_optab;
2691 rtx op0;
2694 tree arg;
2695 machine_mode mode;
2704 {
2723 }
2725 /* There's no easy way to detect the case we need to set EDOM. */
2729 /* Make a suitable register to place result in. */
2732 /* There's no easy way to detect the case we need to set EDOM. */
2734 {
2737 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2738 need to expand the argument again. This way, we will not perform
2739 side-effects more the once. */
2747 {
2748 /* Output the entire sequence. */
2753 }
2755 /* If we were unable to expand via the builtin, stop the sequence
2756 (without outputting the insns) and call to the library function
2757 with the stabilized argument list. */
2759 }
2762 {
2763 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2764 targets, (int) round (x) should never be transformed into
2765 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2766 a call to lround in the hope that the target provides at least some
2767 C99 functions. This should result in the best user experience for
2768 not full C99 targets. */
2769 tree fallback_fndecl = mathfn_built_in_1
2778 }
2781 }
2783 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2784 a normal call should be emitted rather than expanding the function
2785 in-line. EXP is the expression that is a call to the builtin
2786 function; if convenient, the result should be placed in TARGET. */
2788 static rtx
2790 {
2793 machine_mode mode;
2794 machine_mode mode2;
2803 /* Emit a libcall to libgcc. */
2805 /* Mode of the 2nd argument must match that of an int. */
2823 }
2825 /* Expand expression EXP which is a call to the strlen builtin. Return
2826 NULL_RTX if we failed the caller should emit a normal call, otherwise
2827 try to get the result in TARGET, if convenient. */
2829 static rtx
2831 machine_mode target_mode)
2832 {
2837 rtx pat;
2838 tree len;
2840 rtx src_reg;
2842 machine_mode insn_mode;
2846 /* If the length can be computed at compile-time, return it. */
2851 /* If the length can be computed at compile-time and is constant
2852 integer, but there are side-effects in src, evaluate
2853 src for side-effects, then return len.
2854 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2855 can be optimized into: i++; x = 3; */
2858 {
2861 }
2865 /* If SRC is not a pointer type, don't do this operation inline. */
2869 /* Bail out if we can't compute strlen in the right mode. */
2871 {
2875 }
2879 /* Make a place to hold the source address. We will not expand
2880 the actual source until we are sure that the expansion will
2881 not fail -- there are trees that cannot be expanded twice. */
2884 /* Mark the beginning of the strlen sequence so we can emit the
2885 source operand later. */
2895 /* Check to see if the argument was declared attribute nonstring
2896 and if so, issue a warning since at this point it's not known
2897 to be nul-terminated. */
2900 /* Now that we are assured of success, expand the source. */
2904 {
2905 #ifdef POINTERS_EXTEND_UNSIGNED
2908 POINTERS_EXTEND_UNSIGNED);
2909 #endif
2911 }
2917 else
2920 /* Return the value in the proper mode for this function. */
2925 else
2929 }
2931 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2932 bytes from constant string DATA + OFFSET and return it as target
2933 constant. */
2935 static rtx
2937 scalar_int_mode mode)
2938 {
2946 }
2948 /* LEN specify length of the block of memcpy/memset operation.
2949 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2950 In some cases we can make very likely guess on max size, then we
2951 set it into PROBABLE_MAX_SIZE. */
2953 static void
2958 {
2960 {
2963 }
2964 else
2965 {
2969 /* Determine bounds from the type. */
2972 else
2977 else
2983 {
2988 }
2990 {
2991 /* Anti range 0...N lets us to determine minimal size to N+1. */
2993 {
2996 }
2997 /* Code like
2999 int n;
3000 if (n < 100)
3001 memcpy (a, b, n)
3003 Produce anti range allowing negative values of N. We still
3004 can use the information and make a guess that N is not negative.
3005 */
3008 }
3009 }
3013 }
3015 /* Try to verify that the sizes and lengths of the arguments to a string
3016 manipulation function given by EXP are within valid bounds and that
3017 the operation does not lead to buffer overflow or read past the end.
3018 Arguments other than EXP may be null. When non-null, the arguments
3019 have the following meaning:
3020 DST is the destination of a copy call or NULL otherwise.
3021 SRC is the source of a copy call or NULL otherwise.
3022 DSTWRITE is the number of bytes written into the destination obtained
3023 from the user-supplied size argument to the function (such as in
3024 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3025 MAXREAD is the user-supplied bound on the length of the source sequence
3026 (such as in strncat(d, s, N). It specifies the upper limit on the number
3027 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3028 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3029 expression EXP is a string function call (as opposed to a memory call
3030 like memcpy). As an exception, SRCSTR can also be an integer denoting
3031 the precomputed size of the source string or object (for functions like
3032 memcpy).
3033 DSTSIZE is the size of the destination object specified by the last
3034 argument to the _chk builtins, typically resulting from the expansion
3035 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3036 DSTSIZE).
3038 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3039 SIZE_MAX.
3041 If the call is successfully verified as safe return true, otherwise
3042 return false. */
3044 static bool
3047 {
3050 /* The size of the largest object is half the address space, or
3051 PTRDIFF_MAX. (This is way too permissive.) */
3054 /* Either the length of the source string for string functions or
3055 the size of the source object for raw memory functions. */
3060 /* Set to true when the exact number of bytes written by a string
3061 function like strcpy is not known and the only thing that is
3062 known is that it must be at least one (for the terminating nul). */
3065 {
3066 /* SRCSTR is normally a pointer to string but as a special case
3067 it can be an integer denoting the length of a string. */
3069 {
3070 /* Try to determine the range of lengths the source string
3071 refers to. If it can be determined and is less than
3072 the upper bound given by MAXREAD add one to it for
3073 the terminating nul. Otherwise, set it to one for
3074 the same reason, or to MAXREAD as appropriate. */
3077 {
3080 else
3091 }
3092 else
3093 {
3096 }
3097 }
3098 else
3100 }
3103 {
3104 /* When the only available piece of data is the object size
3105 there is nothing to do. */
3109 /* Otherwise, when the length of the source sequence is known
3110 (as with strlen), set DSTWRITE to it. */
3113 }
3123 /* First check the number of bytes to be written against the maximum
3124 object size. */
3126 {
3132 "%K%qD specified size %E "
3135 else
3137 "%K%qD specified size between %E and %E "
3142 }
3144 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3145 constant, and in range of unsigned HOST_WIDE_INT. */
3148 /* Next check the number of bytes to be written against the destination
3149 object size. */
3151 {
3157 {
3165 {
3166 /* This is a call to strcpy with a destination of 0 size
3167 and a source of unknown length. The call will write
3168 at least one byte past the end of the destination. */
3170 "%K%qD writing %E or more bytes into a region "
3173 }
3176 "%K%qD writing %E byte into a region "
3178 "%K%qD writing %E bytes into a region "
3182 {
3183 /* Avoid printing the upper bound if it's invalid. */
3185 "%K%qD writing %E or more bytes into a region "
3188 }
3189 else
3191 "%K%qD writing between %E and %E bytes into "
3194 dstsize);
3196 /* Return error when an overflow has been detected. */
3198 }
3199 }
3201 /* Check the maximum length of the source sequence against the size
3202 of the destination object if known, or against the maximum size
3203 of an object. */
3205 {
3208 /* Use the lower end for MAXREAD from now on. */
3213 {
3218 {
3222 /* Warn about crazy big sizes first since that's more
3223 likely to be meaningful than saying that the bound
3224 is greater than the object size if both are big. */
3227 "%K%qD specified bound %E "
3231 else
3233 "%K%qD specified bound between %E and %E "
3239 }
3242 {
3248 "%K%qD specified bound %E "
3252 else
3254 "%K%qD specified bound between %E and %E "
3259 }
3260 }
3261 }
3263 /* Check for reading past the end of SRC. */
3268 {
3280 {
3281 /* Avoid printing the upper bound if it's invalid. */
3283 "%K%qD reading %E or more bytes from a region "
3286 }
3287 else
3289 "%K%qD reading between %E and %E bytes from a region "
3293 }
3296 }
3298 /* Helper to compute the size of the object referenced by the DEST
3299 expression which must have pointer type, using Object Size type
3300 OSTYPE (only the least significant 2 bits are used). Return
3301 an estimate of the size of the object if successful or NULL when
3302 the size cannot be determined. When the referenced object involves
3303 a non-constant offset in some range the returned value represents
3304 the largest size given the smallest non-negative offset in the
3305 range. The function is intended for diagnostics and should not
3306 be used to influence code generation or optimization. */
3308 tree
3310 {
3313 /* Only the two least significant bits are meaningful. */
3320 {
3329 {
3330 /* compute_builtin_object_size fails for addresses with
3331 non-constant offsets. Try to determine the range of
3332 such an offset here and use it to adjus the constant
3333 size. */
3337 {
3342 {
3344 {
3347 /* Ignore negative offsets for now. For others,
3348 use the lower bound as the most optimistic
3349 estimate of the (remaining)size. */
3351 ;
3355 else
3357 }
3358 }
3359 }
3360 }
3363 }
3365 /* Unless computing the largest size (for memcpy and other raw memory
3366 functions), try to determine the size of the object from its type. */
3381 {
3382 /* Return the constant size unless it's zero (that's a zero-length
3383 array likely at the end of a struct). */
3388 }
3391 }
3393 /* Helper to determine and check the sizes of the source and the destination
3394 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3395 call expression, DEST is the destination argument, SRC is the source
3396 argument or null, and LEN is the number of bytes. Use Object Size type-0
3397 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3398 (no overflow or invalid sizes), false otherwise. */
3400 static bool
3402 {
3403 /* For functions like memset and memcpy that operate on raw memory
3404 try to determine the size of the largest source and destination
3405 object using type-0 Object Size regardless of the object size
3406 type specified by the option. */
3412 }
3414 /* Validate memchr arguments without performing any expansion.
3415 Return NULL_RTX. */
3417 static rtx
3419 {
3427 /* Diagnose calls where the specified length exceeds the size
3428 of the object. */
3430 {
3434 }
3437 }
3439 /* Expand a call EXP to the memcpy builtin.
3440 Return NULL_RTX if we failed, the caller should emit a normal call,
3441 otherwise try to get the result in TARGET, if convenient (and in
3442 mode MODE if that's convenient). */
3444 static rtx
3446 {
3459 }
3461 /* Check a call EXP to the memmove built-in for validity.
3462 Return NULL_RTX on both success and failure. */
3464 static rtx
3466 {
3478 }
3480 /* Expand an instrumented call EXP to the memcpy builtin.
3481 Return NULL_RTX if we failed, the caller should emit a normal call,
3482 otherwise try to get the result in TARGET, if convenient (and in
3483 mode MODE if that's convenient). */
3485 static rtx
3487 {
3493 else
3494 {
3501 /* Return src bounds with the result. */
3503 {
3507 }
3509 }
3510 }
3512 /* Expand a call EXP to the mempcpy builtin.
3513 Return NULL_RTX if we failed; the caller should emit a normal call,
3514 otherwise try to get the result in TARGET, if convenient (and in
3515 mode MODE if that's convenient). If ENDP is 0 return the
3516 destination pointer, if ENDP is 1 return the end pointer ala
3517 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3518 stpcpy. */
3520 static rtx
3522 {
3531 /* Policy does not generally allow using compute_objsize (which
3532 is used internally by check_memop_size) to change code generation
3533 or drive optimization decisions.
3535 In this instance it is safe because the code we generate has
3536 the same semantics regardless of the return value of
3537 check_memop_sizes. Exactly the same amount of data is copied
3538 and the return value is exactly the same in both cases.
3540 Furthermore, check_memop_size always uses mode 0 for the call to
3541 compute_objsize, so the imprecise nature of compute_objsize is
3542 avoided. */
3544 /* Avoid expanding mempcpy into memcpy when the call is determined
3545 to overflow the buffer. This also prevents the same overflow
3546 from being diagnosed again when expanding memcpy. */
3552 }
3554 /* Expand an instrumented call EXP to the mempcpy builtin.
3555 Return NULL_RTX if we failed, the caller should emit a normal call,
3556 otherwise try to get the result in TARGET, if convenient (and in
3557 mode MODE if that's convenient). */
3559 static rtx
3561 {
3567 else
3568 {
3575 /* Return src bounds with the result. */
3577 {
3581 }
3583 }
3584 }
3586 /* Helper function to do the actual work for expand of memory copy family
3587 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3588 of memory from SRC to DEST and assign to TARGET if convenient.
3589 If ENDP is 0 return the
3590 destination pointer, if ENDP is 1 return the end pointer ala
3591 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3592 stpcpy. */
3594 static rtx
3597 {
3608 /* If DEST is not a pointer type, call the normal function. */
3612 /* If either SRC is not a pointer type, don't do this
3613 operation in-line. */
3630 /* If SRC is a string constant and block move would be done
3631 by pieces, we can avoid loading the string from memory
3632 and only stored the computed constants. */
3639 {
3641 builtin_memcpy_read_str,
3647 }
3652 /* Copy word part most expediently. */
3665 {
3668 }
3671 {
3673 /* stpcpy pointer to last byte. */
3676 }
3679 }
3681 static rtx
3684 {
3686 endp);
3687 }
3689 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3690 we failed, the caller should emit a normal call, otherwise try to
3691 get the result in TARGET, if convenient. If ENDP is 0 return the
3692 destination pointer, if ENDP is 1 return the end pointer ala
3693 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3694 stpcpy. */
3696 static rtx
3698 {
3700 rtx dest_mem;
3701 rtx src_mem;
3709 {
3712 }
3721 {
3723 /* movstr is supposed to set end to the address of the NUL
3724 terminator. If the caller requested a mempcpy-like return value,
3725 adjust it. */
3727 {
3731 }
3732 }
3734 }
3736 /* Do some very basic size validation of a call to the strcpy builtin
3737 given by EXP. Return NULL_RTX to have the built-in expand to a call
3738 to the library function. */
3740 static rtx
3742 {
3750 /* There is no way here to determine the length of the string in
3751 the destination to which the SRC string is being appended so
3752 just diagnose cases when the souce string is longer than
3753 the destination object. */
3758 destsize);
3761 }
3763 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3764 NULL_RTX if we failed the caller should emit a normal call, otherwise
3765 try to get the result in TARGET, if convenient (and in mode MODE if that's
3766 convenient). */
3768 static rtx
3770 {
3778 {
3782 }
3785 }
3787 /* Helper function to do the actual work for expand_builtin_strcpy. The
3788 arguments to the builtin_strcpy call DEST and SRC are broken out
3789 so that this can also be called without constructing an actual CALL_EXPR.
3790 The other arguments and return value are the same as for
3791 expand_builtin_strcpy. */
3793 static rtx
3795 {
3797 }
3799 /* Expand a call EXP to the stpcpy builtin.
3800 Return NULL_RTX if we failed the caller should emit a normal call,
3801 otherwise try to get the result in TARGET, if convenient (and in
3802 mode MODE if that's convenient). */
3804 static rtx
3806 {
3817 {
3821 }
3823 /* If return value is ignored, transform stpcpy into strcpy. */
3825 {
3829 }
3830 else
3831 {
3833 rtx ret;
3835 /* Ensure we get an actual string whose length can be evaluated at
3836 compile-time, not an expression containing a string. This is
3837 because the latter will potentially produce pessimized code
3838 when used to produce the return value. */
3850 {
3854 {
3858 {
3860 {
3863 else
3865 }
3874 }
3875 }
3876 }
3879 }
3880 }
3882 /* Check a call EXP to the stpncpy built-in for validity.
3883 Return NULL_RTX on both success and failure. */
3885 static rtx
3887 {
3893 /* The source and destination of the call. */
3897 /* The exact number of bytes to write (not the maximum). */
3900 /* The size of the destination object. */
3906 }
3908 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3909 bytes from constant string DATA + OFFSET and return it as target
3910 constant. */
3912 rtx
3914 scalar_int_mode mode)
3915 {
3922 }
3924 /* Helper to check the sizes of sequences and the destination of calls
3925 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3926 success (no overflow or invalid sizes), false otherwise. */
3928 static bool
3930 {
3935 /* Try to determine the range of lengths that the source expression
3936 refers to. */
3940 /* Try to verify that the destination is big enough for the shortest
3941 string. */
3944 {
3945 /* If it hasn't been provided by __strncat_chk, try to determine
3946 the size of the destination object into which the source is
3947 being copied. */
3949 }
3951 /* Add one for the terminating nul. */
3954 size_one_node)
3957 /* The strncat function copies at most MAXREAD bytes and always appends
3958 the terminating nul so the specified upper bound should never be equal
3959 to (or greater than) the size of the destination. */
3962 {
3971 }
3979 /* The number of bytes to write is LEN but check_access will also
3980 check SRCLEN if LEN's value isn't known. */
3982 objsize);
3983 }
3985 /* Similar to expand_builtin_strcat, do some very basic size validation
3986 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3987 the built-in expand to a call to the library function. */
3989 static rtx
3991 {
3999 /* The upper bound on the number of bytes to write. */
4001 /* The length of the source sequence. */
4004 /* Try to determine the range of lengths that the source expression
4005 refers to. */
4009 else
4012 /* Try to verify that the destination is big enough for the shortest
4013 string. First try to determine the size of the destination object
4014 into which the source is being copied. */
4017 /* Add one for the terminating nul. */
4020 size_one_node)
4023 /* The strncat function copies at most MAXREAD bytes and always appends
4024 the terminating nul so the specified upper bound should never be equal
4025 to (or greater than) the size of the destination. */
4028 {
4037 }
4045 /* The number of bytes to write is SRCLEN. */
4049 }
4051 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4052 NULL_RTX if we failed the caller should emit a normal call. */
4054 static rtx
4056 {
4061 {
4064 /* The number of bytes to write (not the maximum). */
4066 /* The length of the source sequence. */
4070 {
4074 /* The number of bytes to write is LEN but check_access will also
4075 check SLEN if LEN's value isn't known. */
4077 destsize);
4078 }
4080 /* We must be passed a constant len and src parameter. */
4086 /* We're required to pad with trailing zeros if the requested
4087 len is greater than strlen(s2)+1. In that case try to
4088 use store_by_pieces, if it fails, punt. */
4090 {
4093 rtx dest_mem;
4097 builtin_strncpy_read_str,
4104 builtin_strncpy_read_str,
4109 }
4110 }
4112 }
4114 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4115 bytes from constant string DATA + OFFSET and return it as target
4116 constant. */
4118 rtx
4120 scalar_int_mode mode)
4121 {
4128 }
4130 /* Callback routine for store_by_pieces. Return the RTL of a register
4131 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4132 char value given in the RTL register data. For example, if mode is
4133 4 bytes wide, return the RTL for 0x01010101*data. */
4135 static rtx
4137 scalar_int_mode mode)
4138 {
4154 }
4156 /* Expand expression EXP, which is a call to the memset builtin. Return
4157 NULL_RTX if we failed the caller should emit a normal call, otherwise
4158 try to get the result in TARGET, if convenient (and in mode MODE if that's
4159 convenient). */
4161 static rtx
4163 {
4175 }
4177 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4178 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4179 try to get the result in TARGET, if convenient (and in mode MODE if that's
4180 convenient). */
4182 static rtx
4184 {
4189 else
4190 {
4196 /* Return src bounds with the result. */
4198 {
4202 }
4204 }
4205 }
4207 /* Helper function to do the actual work for expand_builtin_memset. The
4208 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4209 so that this can also be called without constructing an actual CALL_EXPR.
4210 The other arguments and return value are the same as for
4211 expand_builtin_memset. */
4213 static rtx
4216 {
4219 machine_mode val_mode;
4231 /* If DEST is not a pointer type, don't do this operation in-line. */
4242 /* If the LEN parameter is zero, return DEST. */
4244 {
4245 /* Evaluate and ignore VAL in case it has side-effects. */
4248 }
4250 /* Stabilize the arguments in case we fail. */
4262 {
4263 rtx val_rtx;
4268 /* Assume that we can memset by pieces if we can store
4269 * the coefficients by pieces (in the required modes).
4270 * We can't pass builtin_memset_gen_str as that emits RTL. */
4276 {
4281 }
4285 probable_max_size))
4291 }
4297 {
4308 probable_max_size))
4314 }
4322 probable_max_size);
4325 {
4328 }
4332 do_libcall:
4342 else
4347 }
4349 /* Expand expression EXP, which is a call to the bzero builtin. Return
4350 NULL_RTX if we failed the caller should emit a normal call. */
4352 static rtx
4354 {
4363 /* New argument list transforming bzero(ptr x, int y) to
4364 memset(ptr x, int 0, size_t y). This is done this way
4365 so that if it isn't expanded inline, we fallback to
4366 calling bzero instead of memset. */
4374 }
4376 /* Try to expand cmpstr operation ICODE with the given operands.
4377 Return the result rtx on success, otherwise return null. */
4379 static rtx
4381 HOST_WIDE_INT align)
4382 {
4396 }
4398 /* Expand expression EXP, which is a call to the memcmp built-in function.
4399 Return NULL_RTX if we failed and the caller should emit a normal call,
4400 otherwise try to get the result in TARGET, if convenient.
4401 RESULT_EQ is true if we can relax the returned value to be either zero
4402 or nonzero, without caring about the sign. */
4404 static rtx
4406 {
4415 /* Diagnose calls where the specified length exceeds the size of either
4416 object. */
4418 {
4422 {
4426 }
4427 }
4435 /* If we don't have POINTER_TYPE, call the function. */
4443 /* Set MEM_SIZE as appropriate. */
4445 {
4448 }
4454 {
4458 }
4460 /* If SRC is a string constant and block move would be done
4461 by pieces, we can avoid loading the string from memory
4462 and only stored the computed constants. */
4474 {
4475 /* Return the value in the proper mode for this function. */
4480 {
4483 }
4486 }
4489 }
4491 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4492 if we failed the caller should emit a normal call, otherwise try to get
4493 the result in TARGET, if convenient. */
4495 static rtx
4497 {
4512 /* If we don't have POINTER_TYPE, call the function. */
4516 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4524 /* Try to call cmpstrsi. */
4529 /* Try to determine at least one length and call cmpstrnsi. */
4531 {
4532 tree len;
4533 rtx arg3_rtx;
4543 /* If we don't have a constant length for the first, use the length
4544 of the second, if we know it. We don't require a constant for
4545 this case; some cost analysis could be done if both are available
4546 but neither is constant. For now, assume they're equally cheap,
4547 unless one has side effects. If both strings have constant lengths,
4548 use the smaller. */
4564 else
4567 /* If both arguments have side effects, we cannot optimize. */
4569 {
4571 result = expand_cmpstrn_or_cmpmem
4574 }
4575 }
4577 /* Check to see if the argument was declared attribute nonstring
4578 and if so, issue a warning since at this point it's not known
4579 to be nul-terminated. */
4584 {
4585 /* Return the value in the proper mode for this function. */
4593 }
4595 /* Expand the library call ourselves using a stabilized argument
4596 list to avoid re-evaluating the function's arguments twice. */
4601 }
4603 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4604 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4605 the result in TARGET, if convenient. */
4607 static rtx
4609 ATTRIBUTE_UNUSED machine_mode mode)
4610 {
4615 /* If c_strlen can determine an expression for one of the string
4616 lengths, and it doesn't have side effects, then emit cmpstrnsi
4617 using length MIN(strlen(string)+1, arg3). */
4622 tree len;
4643 /* If we don't have a constant length for the first, use the length
4644 of the second, if we know it. If neither string is constant length,
4645 use the given length argument. We don't require a constant for
4646 this case; some cost analysis could be done if both are available
4647 but neither is constant. For now, assume they're equally cheap,
4648 unless one has side effects. If both strings have constant lengths,
4649 use the smaller. */
4667 else
4670 /* If we are not using the given length, we must incorporate it here.
4671 The actual new length parameter will be MIN(len,arg3) in this case. */
4681 /* Check to see if the argument was declared attribute nonstring
4682 and if so, issue a warning since at this point it's not known
4683 to be nul-terminated. */
4688 {
4689 /* Return the value in the proper mode for this function. */
4697 }
4699 /* Expand the library call ourselves using a stabilized argument
4700 list to avoid re-evaluating the function's arguments twice. */
4705 }
4707 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4708 if that's convenient. */
4710 rtx
4712 {
4713 rtx val;
4716 /* Don't do __builtin_saveregs more than once in a function.
4717 Save the result of the first call and reuse it. */
4721 /* When this function is called, it means that registers must be
4722 saved on entry to this function. So we migrate the call to the
4723 first insn of this function. */
4727 /* Do whatever the machine needs done in this case. */
4735 /* Put the insns after the NOTE that starts the function. If this
4736 is inside a start_sequence, make the outer-level insn chain current, so
4737 the code is placed at the start of the function. */
4743 }
4745 /* Expand a call to __builtin_next_arg. */
4747 static rtx
4749 {
4750 /* Checking arguments is already done in fold_builtin_next_arg
4751 that must be called before this function. */
4756 }
4758 /* Make it easier for the backends by protecting the valist argument
4759 from multiple evaluations. */
4761 static tree
4763 {
4766 /* The current way of determining the type of valist is completely
4767 bogus. We should have the information on the va builtin instead. */
4772 {
4776 /* For this case, the backends will be expecting a pointer to
4777 vatype, but it's possible we've actually been given an array
4778 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4779 So fix it. */
4781 {
4784 }
4785 }
4786 else
4787 {
4791 {
4797 }
4803 }
4806 }
4808 /* The "standard" definition of va_list is void*. */
4810 tree
4812 {
4814 }
4816 /* The "standard" abi va_list is va_list_type_node. */
4818 tree
4820 {
4822 }
4824 /* The "standard" type of va_list is va_list_type_node. */
4826 tree
4828 {
4835 {
4836 /* If va_list is an array type, the argument may have decayed
4837 to a pointer type, e.g. by being passed to another function.
4838 In that case, unwrap both types so that we can compare the
4839 underlying records. */
4842 {
4845 }
4846 }
4851 }
4853 /* The "standard" implementation of va_start: just assign `nextarg' to
4854 the variable. */
4856 void
4858 {
4862 /* We do not have any valid bounds for the pointer, so
4863 just store zero bounds for it. */
4867 nextarg));
4868 }
4870 /* Expand EXP, a call to __builtin_va_start. */
4872 static rtx
4874 {
4875 rtx nextarg;
4876 tree valist;
4880 {
4883 }
4893 else
4897 }
4899 /* Expand EXP, a call to __builtin_va_end. */
4901 static rtx
4903 {
4906 /* Evaluate for side effects, if needed. I hate macros that don't
4907 do that. */
4912 }
4914 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4915 builtin rather than just as an assignment in stdarg.h because of the
4916 nastiness of array-type va_list types. */
4918 static rtx
4920 {
4933 {
4937 }
4938 else
4939 {
4942 /* Evaluate to pointers. */
4951 /* "Dereference" to BLKmode memories. */
4959 /* Copy. */
4961 }
4964 }
4966 /* Expand a call to one of the builtin functions __builtin_frame_address or
4967 __builtin_return_address. */
4969 static rtx
4971 {
4972 /* The argument must be a nonnegative integer constant.
4973 It counts the number of frames to scan up the stack.
4974 The value is either the frame pointer value or the return
4975 address saved in that frame. */
4977 /* Warning about missing arg was already issued. */
4980 {
4983 }
4984 else
4985 {
4986 /* Number of frames to scan up the stack. */
4991 /* Some ports cannot access arbitrary stack frames. */
4993 {
4996 }
4999 {
5000 /* Warn since no effort is made to ensure that any frame
5001 beyond the current one exists or can be safely reached. */
5004 }
5006 /* For __builtin_frame_address, return what we've got. */
5014 }
5015 }
5017 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5018 failed and the caller should emit a normal call. */
5020 static rtx
5022 {
5023 rtx op0;
5024 rtx result;
5027 HOST_WIDE_INT max_size;
5030 bool valid_arglist
5033 VOID_TYPE)
5043 {
5044 /* -Walloca-larger-than and -Wvla-larger-than settings override
5045 the more general -Walloc-size-larger-than so unless either of
5046 the former options is specified check the alloca arguments for
5047 overflow. */
5051 }
5053 /* Compute the argument. */
5056 /* Compute the alignment. */
5058 ? BIGGEST_ALIGNMENT
5061 /* Compute the maximum size. */
5066 /* Allocate the desired space. If the allocation stems from the declaration
5067 of a variable-sized object, it cannot accumulate. */
5068 result
5073 }
5075 /* Emit a call to __asan_allocas_unpoison call in EXP. Replace second argument
5076 of the call with virtual_stack_dynamic_rtx because in asan pass we emit a
5077 dummy value into second parameter relying on this function to perform the
5078 change. See motivation for this in comment to handle_builtin_stack_restore
5079 function. */
5081 static rtx
5083 {
5091 }
5093 /* Expand a call to bswap builtin in EXP.
5094 Return NULL_RTX if a normal call should be emitted rather than expanding the
5095 function in-line. If convenient, the result should be placed in TARGET.
5096 SUBTARGET may be used as the target for computing one of EXP's operands. */
5098 static rtx
5100 rtx subtarget)
5101 {
5102 tree arg;
5103 rtx op0;
5121 }
5123 /* Expand a call to a unary builtin in EXP.
5124 Return NULL_RTX if a normal call should be emitted rather than expanding the
5125 function in-line. If convenient, the result should be placed in TARGET.
5126 SUBTARGET may be used as the target for computing one of EXP's operands. */
5128 static rtx
5131 {
5132 rtx op0;
5137 /* Compute the argument. */
5139 (subtarget
5143 /* Compute op, into TARGET if possible.
5144 Set TARGET to wherever the result comes back. */
5150 }
5152 /* Expand a call to __builtin_expect. We just return our argument
5153 as the builtin_expect semantic should've been already executed by
5154 tree branch prediction pass. */
5156 static rtx
5158 {
5159 tree arg;
5166 /* When guessing was done, the hints should be already stripped away. */
5170 }
5172 /* Expand a call to __builtin_assume_aligned. We just return our first
5173 argument as the builtin_assume_aligned semantic should've been already
5174 executed by CCP. */
5176 static rtx
5178 {
5182 EXPAND_NORMAL);
5187 }
5189 void
5191 {
5193 {
5195 /* For trap insns when not accumulating outgoing args force
5196 REG_ARGS_SIZE note to prevent crossjumping of calls with
5197 different args sizes. */
5200 }
5201 else
5202 {
5206 }
5209 }
5211 /* Expand a call to __builtin_unreachable. We do nothing except emit
5212 a barrier saying that control flow will not pass here.
5214 It is the responsibility of the program being compiled to ensure
5215 that control flow does never reach __builtin_unreachable. */
5216 static void
5218 {
5220 }
5222 /* Expand EXP, a call to fabs, fabsf or fabsl.
5223 Return NULL_RTX if a normal call should be emitted rather than expanding
5224 the function inline. If convenient, the result should be placed
5225 in TARGET. SUBTARGET may be used as the target for computing
5226 the operand. */
5228 static rtx
5230 {
5231 machine_mode mode;
5232 tree arg;
5233 rtx op0;
5243 }
5245 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5246 Return NULL is a normal call should be emitted rather than expanding the
5247 function inline. If convenient, the result should be placed in TARGET.
5248 SUBTARGET may be used as the target for computing the operand. */
5250 static rtx
5252 {
5254 tree arg;
5266 }
5268 /* Expand a call to __builtin___clear_cache. */
5270 static rtx
5272 {
5274 {
5275 #ifdef CLEAR_INSN_CACHE
5276 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5277 does something. Just do the default expansion to a call to
5278 __clear_cache(). */
5280 #else
5281 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5282 does nothing. There is no need to call it. Do nothing. */
5285 }
5287 /* We have a "clear_cache" insn, and it will handle everything. */
5291 /* We must not expand to a library call. If we did, any
5292 fallback library function in libgcc that might contain a call to
5293 __builtin___clear_cache() would recurse infinitely. */
5295 {
5298 }
5301 {
5314 }
5316 }
5318 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5320 static rtx
5322 {
5325 /* If we don't need too much alignment, we'll have been guaranteed
5326 proper alignment by get_trampoline_type. */
5330 /* Round address up to desired boundary. */
5341 }
5343 static rtx
5345 {
5361 /* If ONSTACK, the TRAMP argument should be the address of a field
5362 within the local function's FRAME decl. Either way, let's see if
5363 we can fill in the MEM_ATTRs for this memory. */
5367 /* Creator of a heap trampoline is responsible for making sure the
5368 address is aligned to at least STACK_BOUNDARY. Normally malloc
5369 will ensure this anyhow. */
5372 {
5376 }
5378 /* The FUNC argument should be the address of the nested function.
5379 Extract the actual function decl to pass to the hook. */
5386 /* Generate insns to initialize the trampoline. */
5390 {
5396 }
5399 }
5401 static rtx
5403 {
5404 rtx tramp;
5415 }
5417 /* Expand a call to the builtin descriptor initialization routine.
5418 A descriptor is made up of a couple of pointers to the static
5419 chain and the code entry in this order. */
5421 static rtx
5423 {
5428 VOID_TYPE))
5442 /* Generate insns to initialize the descriptor. */
5448 }
5450 /* Expand a call to the builtin descriptor adjustment routine. */
5452 static rtx
5454 {
5455 rtx tramp;
5462 /* Unalign the descriptor to allow runtime identification. */
5467 }
5469 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5470 function. The function first checks whether the back end provides
5471 an insn to implement signbit for the respective mode. If not, it
5472 checks whether the floating point format of the value is such that
5473 the sign bit can be extracted. If that is not the case, error out.
5474 EXP is the expression that is a call to the builtin function; if
5475 convenient, the result should be placed in TARGET. */
5476 static rtx
5478 {
5480 scalar_float_mode fmode;
5482 tree arg;
5485 rtx temp;
5498 /* Expand the argument yielding a RTX expression. */
5501 /* Check if the back end provides an insn that handles signbit for the
5502 argument's mode. */
5505 {
5511 }
5513 /* For floating point formats without a sign bit, implement signbit
5514 as "ARG < 0.0". */
5517 {
5518 /* But we can't do this if the format supports signed zero. */
5524 }
5527 {
5530 }
5531 else
5532 {
5534 /* Handle targets with different FP word orders. */
5537 else
5541 }
5543 /* Force the intermediate word_mode (or narrower) result into a
5544 register. This avoids attempting to create paradoxical SUBREGs
5545 of floating point modes below. */
5548 /* If the bitpos is within the "result mode" lowpart, the operation
5549 can be implement with a single bitwise AND. Otherwise, we need
5550 a right shift and an AND. */
5553 {
5561 }
5562 else
5563 {
5564 /* Perform a logical right shift to place the signbit in the least
5565 significant bit, then truncate the result to the desired mode
5566 and mask just this bit. */
5571 }
5574 }
5576 /* Expand fork or exec calls. TARGET is the desired target of the
5577 call. EXP is the call. FN is the
5578 identificator of the actual function. IGNORE is nonzero if the
5579 value is to be ignored. */
5581 static rtx
5583 {
5585 tree call;
5587 /* If we are not profiling, just call the function. */
5591 /* Otherwise call the wrapper. This should be equivalent for the rest of
5592 compiler, so the code does not diverge, and the wrapper may run the
5593 code necessary for keeping the profiling sane. */
5596 {
5627 }
5639 }
5642 \f
5643 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5644 the pointer in these functions is void*, the tree optimizers may remove
5645 casts. The mode computed in expand_builtin isn't reliable either, due
5646 to __sync_bool_compare_and_swap.
5648 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5649 group of builtins. This gives us log2 of the mode size. */
5653 {
5654 /* The size is not negotiable, so ask not to get BLKmode in return
5655 if the target indicates that a smaller size would be better. */
5657 }
5659 /* Expand the memory expression LOC and return the appropriate memory operand
5660 for the builtin_sync operations. */
5662 static rtx
5664 {
5670 /* Note that we explicitly do not want any alias information for this
5671 memory, so that we kill all other live memories. Otherwise we don't
5672 satisfy the full barrier semantics of the intrinsic. */
5675 /* The alignment needs to be at least according to that of the mode. */
5682 }
5684 /* Make sure an argument is in the right mode.
5685 EXP is the tree argument.
5686 MODE is the mode it should be in. */
5688 static rtx
5690 {
5691 rtx val;
5692 machine_mode old_mode;
5695 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5696 of CONST_INTs, where we know the old_mode only from the call argument. */
5703 }
5706 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5707 EXP is the CALL_EXPR. CODE is the rtx code
5708 that corresponds to the arithmetic or logical operation from the name;
5709 an exception here is that NOT actually means NAND. TARGET is an optional
5710 place for us to store the results; AFTER is true if this is the
5711 fetch_and_xxx form. */
5713 static rtx
5716 rtx target)
5717 {
5722 {
5729 {
5758 }
5759 }
5761 /* Expand the operands. */
5766 after);
5767 }
5769 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5770 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5771 true if this is the boolean form. TARGET is a place for us to store the
5772 results; this is NOT optional if IS_BOOL is true. */
5774 static rtx
5777 {
5781 /* Expand the operands. */
5788 {
5791 else
5793 }
5796 MEMMODEL_SYNC_SEQ_CST))
5800 }
5802 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5803 general form is actually an atomic exchange, and some targets only
5804 support a reduced form with the second argument being a constant 1.
5805 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5806 the results. */
5808 static rtx
5810 rtx target)
5811 {
5814 /* Expand the operands. */
5819 }
5821 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5823 static void
5825 {
5826 rtx mem;
5828 /* Expand the operands. */
5832 }
5834 /* Given an integer representing an ``enum memmodel'', verify its
5835 correctness and return the memory model enum. */
5837 static enum memmodel
5839 {
5840 rtx op;
5842 source_location loc
5845 /* If the parameter is not a constant, it's a run time value so we'll just
5846 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5856 {
5860 }
5862 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5864 {
5868 }
5870 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5871 be conservative and promote consume to acquire. */
5876 }
5878 /* Expand the __atomic_exchange intrinsic:
5879 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5880 EXP is the CALL_EXPR.
5881 TARGET is an optional place for us to store the results. */
5883 static rtx
5885 {
5894 /* Expand the operands. */
5899 }
5901 /* Expand the __atomic_compare_exchange intrinsic:
5902 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5903 TYPE desired, BOOL weak,
5904 enum memmodel success,
5905 enum memmodel failure)
5906 EXP is the CALL_EXPR.
5907 TARGET is an optional place for us to store the results. */
5909 static rtx
5911 rtx target)
5912 {
5916 tree weak;
5918 source_location loc
5925 {
5927 "failure memory model cannot be stronger than success "
5930 }
5933 {
5935 "invalid failure memory model for "
5939 }
5945 /* Expand the operands. */
5961 /* Lest the rtl backend create a race condition with an imporoper store
5962 to memory, always create a new pseudo for OLDVAL. */
5969 /* Conditionally store back to EXPECT, lest we create a race condition
5970 with an improper store to memory. */
5971 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5972 the normal case where EXPECT is totally private, i.e. a register. At
5973 which point the store can be unconditional. */
5981 }
5983 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5984 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5985 call. The weak parameter must be dropped to match the expected parameter
5986 list and the expected argument changed from value to pointer to memory
5987 slot. */
5989 static void
5991 {
6007 /* Skip the boolean weak parameter. */
6010 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6013 built_in_function fncode
6018 fndecl);
6023 {
6030 }
6031 }
6033 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6035 void
6037 {
6043 tree lhs;
6045 source_location loc
6052 {
6054 "failure memory model cannot be stronger than success "
6057 }
6060 {
6062 "invalid failure memory model for "
6066 }
6069 {
6072 }
6074 /* Expand the operands. */
6087 {
6090 }
6094 {
6100 }
6101 }
6103 /* Expand the __atomic_load intrinsic:
6104 TYPE __atomic_load (TYPE *object, enum memmodel)
6105 EXP is the CALL_EXPR.
6106 TARGET is an optional place for us to store the results. */
6108 static rtx
6110 {
6111 rtx mem;
6116 {
6117 source_location loc
6122 }
6127 /* Expand the operand. */
6131 }
6134 /* Expand the __atomic_store intrinsic:
6135 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6136 EXP is the CALL_EXPR.
6137 TARGET is an optional place for us to store the results. */
6139 static rtx
6141 {
6148 {
6149 source_location loc
6154 }
6159 /* Expand the operands. */
6164 }
6166 /* Expand the __atomic_fetch_XXX intrinsic:
6167 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6168 EXP is the CALL_EXPR.
6169 TARGET is an optional place for us to store the results.
6170 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6171 FETCH_AFTER is true if returning the result of the operation.
6172 FETCH_AFTER is false if returning the value before the operation.
6173 IGNORE is true if the result is not used.
6174 EXT_CALL is the correct builtin for an external call if this cannot be
6175 resolved to an instruction sequence. */
6177 static rtx
6181 {
6184 tree fndecl;
6185 tree addr;
6189 /* Expand the operands. */
6193 /* Only try generating instructions if inlining is turned on. */
6195 {
6199 }
6201 /* Return if a different routine isn't needed for the library call. */
6205 /* Change the call to the specified function. */
6213 /* If we will emit code after the call, the call can not be a tail call.
6214 If it is emitted as a tail call, a barrier is emitted after it, and
6215 then all trailing code is removed. */
6219 /* Expand the call here so we can emit trailing code. */
6222 /* Replace the original function just in case it matters. */
6225 /* Then issue the arithmetic correction to return the right result. */
6227 {
6229 {
6231 OPTAB_LIB_WIDEN);
6233 }
6234 else
6236 OPTAB_LIB_WIDEN);
6237 }
6239 }
6241 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6243 void
6245 {
6253 optab optab;
6265 {
6280 }
6283 {
6290 }
6312 {
6317 }
6318 else
6320 OPTAB_DIRECT);
6323 }
6325 /* Expand an atomic clear operation.
6326 void _atomic_clear (BOOL *obj, enum memmodel)
6327 EXP is the call expression. */
6329 static rtx
6331 {
6332 machine_mode mode;
6341 {
6342 source_location loc
6347 }
6349 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6350 Failing that, a store is issued by __atomic_store. The only way this can
6351 fail is if the bool type is larger than a word size. Unlikely, but
6352 handle it anyway for completeness. Assume a single threaded model since
6353 there is no atomic support in this case, and no barriers are required. */
6358 }
6360 /* Expand an atomic test_and_set operation.
6361 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6362 EXP is the call expression. */
6364 static rtx
6366 {
6367 rtx mem;
6369 machine_mode mode;
6376 }
6379 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6380 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6382 static tree
6384 {
6386 machine_mode mode;
6392 /* We need a corresponding integer mode for the access to be lock-free. */
6400 {
6403 /* Either this argument is null, or it's a fake pointer encoding
6404 the alignment of the object. */
6410 else
6412 }
6413 else
6414 {
6417 /* This function is usually invoked and folded immediately by the front
6418 end before anything else has a chance to look at it. The pointer
6419 parameter at this point is usually cast to a void *, so check for that
6420 and look past the cast. */
6430 /* Get the underlying type of the object. */
6433 }
6435 /* If the object has smaller alignment, the lock free routines cannot
6436 be used. */
6440 /* Check if a compare_and_swap pattern exists for the mode which represents
6441 the required size. The pattern is not allowed to fail, so the existence
6442 of the pattern indicates support is present. Also require that an
6443 atomic load exists for the required size. */
6446 else
6448 }
6450 /* Return true if the parameters to call EXP represent an object which will
6451 always generate lock free instructions. The first argument represents the
6452 size of the object, and the second parameter is a pointer to the object
6453 itself. If NULL is passed for the object, then the result is based on
6454 typical alignment for an object of the specified size. Otherwise return
6455 false. */
6457 static rtx
6459 {
6460 tree size;
6465 {
6468 }
6474 }
6476 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6477 is lock free on this architecture. */
6479 static tree
6481 {
6485 /* If it isn't always lock free, don't generate a result. */
6490 }
6492 /* Return true if the parameters to call EXP represent an object which will
6493 always generate lock free instructions. The first argument represents the
6494 size of the object, and the second parameter is a pointer to the object
6495 itself. If NULL is passed for the object, then the result is based on
6496 typical alignment for an object of the specified size. Otherwise return
6497 NULL*/
6499 static rtx
6501 {
6502 tree size;
6507 {
6510 }
6515 /* If the value is known at compile time, return the RTX for it. */
6521 }
6523 /* Expand the __atomic_thread_fence intrinsic:
6524 void __atomic_thread_fence (enum memmodel)
6525 EXP is the CALL_EXPR. */
6527 static void
6529 {
6532 }
6534 /* Expand the __atomic_signal_fence intrinsic:
6535 void __atomic_signal_fence (enum memmodel)
6536 EXP is the CALL_EXPR. */
6538 static void
6540 {
6543 }
6545 /* Expand the __sync_synchronize intrinsic. */
6547 static void
6549 {
6551 }
6553 static rtx
6555 {
6561 {
6563 /* If the target is not sutitable then create a new target. */
6571 }
6574 }
6576 static void
6578 {
6584 {
6591 }
6593 }
6595 \f
6596 /* Emit code to restore the current value of stack. */
6598 static void
6600 {
6612 }
6614 /* Emit code to save the current value of stack. */
6616 static rtx
6618 {
6623 }
6626 /* Expand an expression EXP that calls a built-in function,
6627 with result going to TARGET if that's convenient
6628 (and in mode MODE if that's convenient).
6629 SUBTARGET may be used as the target for computing one of EXP's operands.
6630 IGNORE is nonzero if the value is to be ignored. */
6632 rtx
6635 {
6644 /* When ASan is enabled, we don't want to expand some memory/string
6645 builtins and rely on libsanitizer's hooks. This allows us to avoid
6646 redundant checks and be sure, that possible overflow will be detected
6647 by ASan. */
6652 /* When not optimizing, generate calls to library functions for a certain
6653 set of builtins. */
6679 /* The built-in function expanders test for target == const0_rtx
6680 to determine whether the function's result will be ignored. */
6684 /* If the result of a pure or const built-in function is ignored, and
6685 none of its arguments are volatile, we can avoid expanding the
6686 built-in call and just evaluate the arguments for side-effects. */
6690 {
6692 tree arg;
6693 call_expr_arg_iterator iter;
6697 {
6700 }
6703 {
6707 }
6708 }
6710 /* expand_builtin_with_bounds is supposed to be used for
6711 instrumented builtin calls. */
6715 {
6733 /* Just do a normal library call if we were unable to fold
6734 the values. */
6811 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6812 FUNCTION with a copy of the parameters described by
6813 ARGUMENTS, and ARGSIZE. It returns a block of memory
6814 allocated on the stack into which is stored all the registers
6815 that might possibly be used for returning the result of a
6816 function. ARGUMENTS is the value returned by
6817 __builtin_apply_args. ARGSIZE is the number of bytes of
6818 arguments that must be copied. ??? How should this value be
6819 computed? We'll also need a safe worst case value for varargs
6820 functions. */
6827 else
6828 {
6836 }
6838 /* __builtin_return (RESULT) causes the function to return the
6839 value described by RESULT. RESULT is address of the block of
6840 memory returned by __builtin_apply. */
6850 /* All valid uses of __builtin_va_arg_pack () are removed during
6851 inlining. */
6856 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6857 inlining. */
6861 /* Return the address of the first anonymous stack arg. */
6883 /* Returns the address of the area where the structure is returned.
6884 0 otherwise. */
6890 else
6893 CASE_BUILT_IN_ALLOCA:
7056 {
7059 }
7063 /* This should have been lowered to the builtins below. */
7067 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7068 and the receiver label. */
7070 {
7076 /* This is copied from the handling of non-local gotos. */
7078 nonlocal_goto_handler_labels
7080 nonlocal_goto_handler_labels);
7081 /* ??? Do not let expand_label treat us as such since we would
7082 not want to be both on the list of non-local labels and on
7083 the list of forced labels. */
7086 }
7090 /* __builtin_setjmp_receiver is passed the receiver label. */
7092 {
7098 }
7101 /* __builtin_longjmp is passed a pointer to an array of five words.
7102 It's similar to the C library longjmp function but works with
7103 __builtin_setjmp above. */
7106 {
7112 {
7115 }
7119 }
7128 /* This updates the setjmp buffer that is its argument with the value
7129 of the current stack pointer. */
7132 {
7133 rtx buf_addr
7138 }
7158 /* Various hooks for the DWARF 2 __throw routine. */
7164 #ifdef DWARF2_UNWIND_INFO
7170 #endif
7370 mode = get_builtin_sync_mode
7382 mode = get_builtin_sync_mode
7429 {
7433 mode =
7439 /* If this is turned into an external library call, the weak parameter
7440 must be dropped to match the expected parameter list. */
7445 /* Skip the boolean weak parameter. */
7450 }
7479 {
7489 }
7495 {
7505 }
7511 {
7521 }
7527 {
7537 }
7543 {
7553 }
7559 {
7569 }
7716 /* We allow user CHKP builtins if Pointer Bounds
7717 Checker is off. */
7719 {
7730 else
7732 }
7733 /* FALLTHROUGH */
7745 /* Software implementation of Pointer Bounds Checker is NYI.
7746 Target support is required. */
7751 /* Do library call, if we failed to expand the builtin when
7752 folding. */
7757 }
7759 /* The switch statement above can drop through to cause the function
7760 to be called normally. */
7762 }
7764 /* Similar to expand_builtin but is used for instrumented calls. */
7766 rtx
7768 rtx subtarget ATTRIBUTE_UNUSED,
7770 {
7783 {
7806 {
7807 /* memcpy_chkp (void *dst, size_t dstbnd,
7808 const void *src, size_t srcbnd, size_t n)
7809 and others take a pointer bound argument just after each
7810 pointer argument. */
7817 }
7821 }
7823 /* The switch statement above can drop through to cause the function
7824 to be called normally. */
7826 }
7828 /* Determine whether a tree node represents a call to a built-in
7829 function. If the tree T is a call to a built-in function with
7830 the right number of arguments of the appropriate types, return
7831 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7832 Otherwise the return value is END_BUILTINS. */
7834 enum built_in_function
7836 {
7839 const_call_expr_arg_iterator iter;
7854 {
7855 /* If a function doesn't take a variable number of arguments,
7856 the last element in the list will have type `void'. */
7859 {
7863 }
7872 {
7875 }
7877 {
7880 }
7882 {
7885 }
7887 {
7890 }
7891 else
7893 }
7895 /* Variable-length argument list. */
7897 }
7899 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7900 evaluate to a constant. */
7902 static tree
7904 {
7905 /* We return 1 for a numeric type that's known to be a constant
7906 value at compile-time or for an aggregate type that's a
7907 literal constant. */
7910 /* If we know this is a constant, emit the constant of one. */
7916 {
7923 }
7925 /* If this expression has side effects, show we don't know it to be a
7926 constant. Likewise if it's a pointer or aggregate type since in
7927 those case we only want literals, since those are only optimized
7928 when generating RTL, not later.
7929 And finally, if we are compiling an initializer, not code, we
7930 need to return a definite result now; there's not going to be any
7931 more optimization done. */
7936 || folding_initializer
7941 }
7943 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7944 return it as a truthvalue. */
7946 static tree
7948 tree predictor)
7949 {
7961 predictor);
7965 }
7967 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7968 NULL_TREE if no simplification is possible. */
7970 tree
7972 {
7976 /* Distribute the expected value over short-circuiting operators.
7977 See through the cast from truthvalue_type_node to long. */
7984 /* If this is a builtin_expect within a builtin_expect keep the
7985 inner one. See through a comparison against a constant. It
7986 might have been added to create a thruthvalue. */
8002 {
8012 }
8014 /* If the argument isn't invariant then there's nothing else we can do. */
8018 /* If we expect that a comparison against the argument will fold to
8019 a constant return the constant. In practice, this means a true
8020 constant or the address of a non-weak symbol. */
8024 {
8025 do
8026 {
8028 }
8033 }
8035 /* Otherwise, ARG0 already has the proper type for the return value. */
8037 }
8039 /* Fold a call to __builtin_classify_type with argument ARG. */
8041 static tree
8043 {
8048 }
8050 /* Fold a call to __builtin_strlen with argument ARG. */
8052 static tree
8054 {
8057 else
8058 {
8065 }
8066 }
8068 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8070 static tree
8072 {
8073 REAL_VALUE_TYPE real;
8075 /* __builtin_inff is intended to be usable to define INFINITY on all
8076 targets. If an infinity is not available, INFINITY expands "to a
8077 positive constant of type float that overflows at translation
8078 time", footnote "In this case, using INFINITY will violate the
8079 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8080 Thus we pedwarn to ensure this constraint violation is
8081 diagnosed. */
8087 }
8089 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8090 NULL_TREE if no simplification can be made. */
8092 static tree
8095 {
8096 tree type;
8106 /* Calculate the result when the argument is a constant. */
8111 /* Canonicalize sincos to cexpi. */
8113 {
8116 }
8118 {
8125 }
8134 }
8136 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8137 Return NULL_TREE if no simplification can be made. */
8139 static tree
8141 {
8147 /* If the LEN parameter is zero, return zero. */
8152 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8156 /* If len parameter is one, return an expression corresponding to
8157 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8159 {
8161 tree cst_uchar_ptr_node
8164 tree ind1
8168 cst_uchar_ptr_node,
8169 arg1)));
8170 tree ind2
8174 cst_uchar_ptr_node,
8175 arg2)));
8177 }
8180 }
8182 /* Fold a call to builtin isascii with argument ARG. */
8184 static tree
8186 {
8189 else
8190 {
8191 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8197 }
8198 }
8200 /* Fold a call to builtin toascii with argument ARG. */
8202 static tree
8204 {
8208 /* Transform toascii(c) -> (c & 0x7f). */
8211 }
8213 /* Fold a call to builtin isdigit with argument ARG. */
8215 static tree
8217 {
8220 else
8221 {
8222 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8223 /* According to the C standard, isdigit is unaffected by locale.
8224 However, it definitely is affected by the target character set. */
8225 unsigned HOST_WIDE_INT target_digit0
8236 }
8237 }
8239 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8241 static tree
8243 {
8249 }
8251 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8253 static tree
8255 {
8261 }
8263 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
8265 static tree
8267 {
8268 /* ??? Only expand to FMA_EXPR if it's directly supported. */
8276 }
8278 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8280 static tree
8282 {
8285 {
8289 {
8294 }
8295 }
8298 }
8300 /* Fold a call to builtin frexp, we can assume the base is 2. */
8302 static tree
8304 {
8315 /* Proceed if a valid pointer type was passed in. */
8317 {
8322 {
8324 /* For +-0, return (*exp = 0, +-0). */
8330 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8333 {
8334 /* Since the frexp function always expects base 2, and in
8335 GCC normalized significands are already in the range
8336 [0.5, 1.0), we have exactly what frexp wants. */
8341 }
8345 }
8347 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8351 }
8354 }
8356 /* Fold a call to builtin modf. */
8358 static tree
8360 {
8371 /* Proceed if a valid pointer type was passed in. */
8373 {
8378 {
8381 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8385 /* For +-Inf, return (*arg1 = arg0, +-0). */
8391 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8394 /* If the original number was negative and already
8395 integral, then the fractional part is -0.0. */
8399 }
8401 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8407 }
8410 }
8412 /* Given a location LOC, an interclass builtin function decl FNDECL
8413 and its single argument ARG, return an folded expression computing
8414 the same, or NULL_TREE if we either couldn't or didn't want to fold
8415 (the latter happen if there's an RTL instruction available). */
8417 static tree
8419 {
8420 machine_mode mode;
8432 /* If there is no optab, try generic code. */
8434 {
8435 tree result;
8438 {
8439 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8442 REAL_VALUE_TYPE r;
8446 {
8447 /* NaN and Inf are encoded in the high-order double value
8448 only. The low-order value is not significant. */
8452 }
8459 }
8462 {
8463 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8466 REAL_VALUE_TYPE r;
8470 {
8471 /* NaN and Inf are encoded in the high-order double value
8472 only. The low-order value is not significant. */
8476 }
8482 /*result = fold_build2_loc (loc, UNGT_EXPR,
8483 TREE_TYPE (TREE_TYPE (fndecl)),
8484 fold_build1_loc (loc, ABS_EXPR, type, arg),
8485 build_real (type, r));
8486 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8487 TREE_TYPE (TREE_TYPE (fndecl)),
8488 result);*/
8490 }
8492 {
8493 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8494 islessequal(fabs(x),DBL_MAX). */
8504 {
8505 /* Use double to test the normal range of IBM extended
8506 precision. Emin for IBM extended precision is
8507 different to emin for IEEE double, being 53 higher
8508 since the low double exponent is at least 53 lower
8509 than the high double exponent. */
8513 }
8525 {
8526 /* Testing the high end of the range is done just using
8527 the high double, using the same test as isfinite().
8528 For the subnormal end of the range we first test the
8529 high double, then if its magnitude is equal to the
8530 limit of 0x1p-969, we test whether the low double is
8531 non-zero and opposite sign to the high double. */
8547 integer_type_node,
8553 }
8554 else
8555 {
8556 tree const isge_fn
8559 }
8563 }
8566 }
8569 }
8571 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8572 ARG is the argument for the call. */
8574 static tree
8576 {
8583 {
8591 {
8592 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8593 /* In a boolean context, GCC will fold the inner COND_EXPR to
8594 1. So e.g. "if (isinf_sign(x))" would be folded to just
8595 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8603 {
8616 integer_zero_node);
8617 }
8620 }
8633 {
8636 {
8637 /* NaN and Inf are encoded in the high-order double value
8638 only. The low-order value is not significant. */
8640 }
8641 }
8647 }
8648 }
8650 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8651 This builtin will generate code to return the appropriate floating
8652 point classification depending on the value of the floating point
8653 number passed in. The possible return values must be supplied as
8654 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8655 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8656 one floating point argument which is "type generic". */
8658 static tree
8660 {
8663 machine_mode mode;
8664 REAL_VALUE_TYPE r;
8667 /* Verify the required arguments in the original call. */
8687 /* fpclassify(x) ->
8688 isnan(x) ? FP_NAN :
8689 (fabs(x) == Inf ? FP_INFINITE :
8690 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8691 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8705 {
8711 }
8714 {
8717 }
8720 }
8722 /* Fold a call to an unordered comparison function such as
8723 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8724 being called and ARG0 and ARG1 are the arguments for the call.
8725 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8726 the opposite of the desired result. UNORDERED_CODE is used
8727 for modes that can hold NaNs and ORDERED_CODE is used for
8728 the rest. */
8730 static tree
8734 {
8748 /* Choose the wider of two real types. */
8760 {
8764 }
8769 }
8771 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8772 arithmetics if it can never overflow, or into internal functions that
8773 return both result of arithmetics and overflowed boolean flag in
8774 a complex integer result, or some other check for overflow.
8775 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8776 checking part of that. */
8778 static tree
8781 {
8783 /* The code of the expression corresponding to the type-generic
8784 built-in, or ERROR_MARK for the type-specific ones. */
8789 {
8792 /* FALLTHRU */
8795 /* FALLTHRU */
8806 /* FALLTHRU */
8809 /* FALLTHRU */
8820 /* FALLTHRU */
8823 /* FALLTHRU */
8834 }
8836 /* For the "generic" overloads, the first two arguments can have different
8837 types and the last argument determines the target type to use to check
8838 for overflow. The arguments of the other overloads all have the same
8839 type. */
8842 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8843 arguments are constant, attempt to fold the built-in call into a constant
8844 expression indicating whether or not it detected an overflow. */
8848 /* Perform the computation in the target type and check for overflow. */
8852 arg2);
8866 tree store
8869 }
8871 /* Fold a call to __builtin_FILE to a constant string. */
8875 {
8877 {
8878 /* The documentation says this builtin is equivalent to the preprocessor
8879 __FILE__ macro so it appears appropriate to use the same file prefix
8880 mappings. */
8883 }
8886 }
8888 /* Fold a call to __builtin_FUNCTION to a constant string. */
8892 {
8899 }
8901 /* Fold a call to __builtin_LINE to an integer constant. */
8905 {
8907 }
8909 /* Fold a call to built-in function FNDECL with 0 arguments.
8910 This function returns NULL_TREE if no simplification was possible. */
8912 static tree
8914 {
8918 {
8944 }
8946 }
8948 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8949 This function returns NULL_TREE if no simplification was possible. */
8951 static tree
8953 {
8964 {
8966 {
8969 /* Gimplification will pull the CALL_EXPR for the builtin out of
8970 an if condition. When not optimizing, we'll not CSE it back.
8971 To avoid link error types of regressions, return false now. */
8976 }
9032 {
9037 }
9043 {
9048 }
9069 }
9073 }
9075 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9076 This function returns NULL_TREE if no simplification was possible. */
9078 static tree
9080 {
9092 {
9136 NOP_EXPR);
9138 /* We do the folding for va_start in the expander. */
9153 }
9155 }
9157 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9158 and ARG2.
9159 This function returns NULL_TREE if no simplification was possible. */
9161 static tree
9164 {
9178 {
9228 }
9230 }
9232 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9233 arguments. IGNORE is true if the result of the
9234 function call is ignored. This function returns NULL_TREE if no
9235 simplification was possible. */
9237 tree
9239 {
9243 {
9259 }
9261 {
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 }