| blob | 683c6ec6e5b814ee2650f8a5bf538d4f394c7ae6 |
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 }
3183 {
3184 /* Avoid printing the upper bound if it's invalid. */
3186 "%K%qD writing %E or more bytes into a region "
3189 }
3190 else
3192 "%K%qD writing between %E and %E bytes into "
3195 dstsize);
3197 /* Return error when an overflow has been detected. */
3199 }
3200 }
3202 /* Check the maximum length of the source sequence against the size
3203 of the destination object if known, or against the maximum size
3204 of an object. */
3206 {
3209 /* Use the lower end for MAXREAD from now on. */
3214 {
3219 {
3223 /* Warn about crazy big sizes first since that's more
3224 likely to be meaningful than saying that the bound
3225 is greater than the object size if both are big. */
3228 "%K%qD specified bound %E "
3232 else
3234 "%K%qD specified bound between %E and %E "
3240 }
3243 {
3249 "%K%qD specified bound %E "
3253 else
3255 "%K%qD specified bound between %E and %E "
3260 }
3261 }
3262 }
3264 /* Check for reading past the end of SRC. */
3269 {
3282 {
3283 /* Avoid printing the upper bound if it's invalid. */
3285 "%K%qD reading %E or more bytes from a region "
3288 }
3289 else
3291 "%K%qD reading between %E and %E bytes from a region "
3295 }
3298 }
3300 /* Helper to compute the size of the object referenced by the DEST
3301 expression which must have pointer type, using Object Size type
3302 OSTYPE (only the least significant 2 bits are used). Return
3303 an estimate of the size of the object if successful or NULL when
3304 the size cannot be determined. When the referenced object involves
3305 a non-constant offset in some range the returned value represents
3306 the largest size given the smallest non-negative offset in the
3307 range. The function is intended for diagnostics and should not
3308 be used to influence code generation or optimization. */
3310 tree
3312 {
3315 /* Only the two least significant bits are meaningful. */
3322 {
3331 {
3332 /* compute_builtin_object_size fails for addresses with
3333 non-constant offsets. Try to determine the range of
3334 such an offset here and use it to adjus the constant
3335 size. */
3339 {
3344 {
3346 {
3349 /* Ignore negative offsets for now. For others,
3350 use the lower bound as the most optimistic
3351 estimate of the (remaining)size. */
3353 ;
3357 else
3359 }
3360 }
3361 }
3362 }
3365 }
3367 /* Unless computing the largest size (for memcpy and other raw memory
3368 functions), try to determine the size of the object from its type. */
3383 {
3384 /* Return the constant size unless it's zero (that's a zero-length
3385 array likely at the end of a struct). */
3390 }
3393 }
3395 /* Helper to determine and check the sizes of the source and the destination
3396 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3397 call expression, DEST is the destination argument, SRC is the source
3398 argument or null, and LEN is the number of bytes. Use Object Size type-0
3399 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3400 (no overflow or invalid sizes), false otherwise. */
3402 static bool
3404 {
3405 /* For functions like memset and memcpy that operate on raw memory
3406 try to determine the size of the largest source and destination
3407 object using type-0 Object Size regardless of the object size
3408 type specified by the option. */
3414 }
3416 /* Validate memchr arguments without performing any expansion.
3417 Return NULL_RTX. */
3419 static rtx
3421 {
3429 /* Diagnose calls where the specified length exceeds the size
3430 of the object. */
3432 {
3436 }
3439 }
3441 /* Expand a call EXP to the memcpy builtin.
3442 Return NULL_RTX if we failed, the caller should emit a normal call,
3443 otherwise try to get the result in TARGET, if convenient (and in
3444 mode MODE if that's convenient). */
3446 static rtx
3448 {
3461 }
3463 /* Check a call EXP to the memmove built-in for validity.
3464 Return NULL_RTX on both success and failure. */
3466 static rtx
3468 {
3480 }
3482 /* Expand an instrumented call EXP to the memcpy builtin.
3483 Return NULL_RTX if we failed, the caller should emit a normal call,
3484 otherwise try to get the result in TARGET, if convenient (and in
3485 mode MODE if that's convenient). */
3487 static rtx
3489 {
3495 else
3496 {
3503 /* Return src bounds with the result. */
3505 {
3509 }
3511 }
3512 }
3514 /* Expand a call EXP to the mempcpy builtin.
3515 Return NULL_RTX if we failed; the caller should emit a normal call,
3516 otherwise try to get the result in TARGET, if convenient (and in
3517 mode MODE if that's convenient). If ENDP is 0 return the
3518 destination pointer, if ENDP is 1 return the end pointer ala
3519 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3520 stpcpy. */
3522 static rtx
3524 {
3533 /* Policy does not generally allow using compute_objsize (which
3534 is used internally by check_memop_size) to change code generation
3535 or drive optimization decisions.
3537 In this instance it is safe because the code we generate has
3538 the same semantics regardless of the return value of
3539 check_memop_sizes. Exactly the same amount of data is copied
3540 and the return value is exactly the same in both cases.
3542 Furthermore, check_memop_size always uses mode 0 for the call to
3543 compute_objsize, so the imprecise nature of compute_objsize is
3544 avoided. */
3546 /* Avoid expanding mempcpy into memcpy when the call is determined
3547 to overflow the buffer. This also prevents the same overflow
3548 from being diagnosed again when expanding memcpy. */
3554 }
3556 /* Expand an instrumented call EXP to the mempcpy builtin.
3557 Return NULL_RTX if we failed, the caller should emit a normal call,
3558 otherwise try to get the result in TARGET, if convenient (and in
3559 mode MODE if that's convenient). */
3561 static rtx
3563 {
3569 else
3570 {
3577 /* Return src bounds with the result. */
3579 {
3583 }
3585 }
3586 }
3588 /* Helper function to do the actual work for expand of memory copy family
3589 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3590 of memory from SRC to DEST and assign to TARGET if convenient.
3591 If ENDP is 0 return the
3592 destination pointer, if ENDP is 1 return the end pointer ala
3593 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3594 stpcpy. */
3596 static rtx
3599 {
3610 /* If DEST is not a pointer type, call the normal function. */
3614 /* If either SRC is not a pointer type, don't do this
3615 operation in-line. */
3632 /* If SRC is a string constant and block move would be done
3633 by pieces, we can avoid loading the string from memory
3634 and only stored the computed constants. */
3641 {
3643 builtin_memcpy_read_str,
3649 }
3654 /* Copy word part most expediently. */
3663 {
3666 }
3669 {
3671 /* stpcpy pointer to last byte. */
3674 }
3677 }
3679 static rtx
3682 {
3684 endp);
3685 }
3687 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3688 we failed, the caller should emit a normal call, otherwise try to
3689 get the result in TARGET, if convenient. If ENDP is 0 return the
3690 destination pointer, if ENDP is 1 return the end pointer ala
3691 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3692 stpcpy. */
3694 static rtx
3696 {
3698 rtx dest_mem;
3699 rtx src_mem;
3707 {
3710 }
3719 {
3721 /* movstr is supposed to set end to the address of the NUL
3722 terminator. If the caller requested a mempcpy-like return value,
3723 adjust it. */
3725 {
3729 }
3730 }
3732 }
3734 /* Do some very basic size validation of a call to the strcpy builtin
3735 given by EXP. Return NULL_RTX to have the built-in expand to a call
3736 to the library function. */
3738 static rtx
3740 {
3748 /* There is no way here to determine the length of the string in
3749 the destination to which the SRC string is being appended so
3750 just diagnose cases when the souce string is longer than
3751 the destination object. */
3756 destsize);
3759 }
3761 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3762 NULL_RTX if we failed the caller should emit a normal call, otherwise
3763 try to get the result in TARGET, if convenient (and in mode MODE if that's
3764 convenient). */
3766 static rtx
3768 {
3776 {
3780 }
3783 }
3785 /* Helper function to do the actual work for expand_builtin_strcpy. The
3786 arguments to the builtin_strcpy call DEST and SRC are broken out
3787 so that this can also be called without constructing an actual CALL_EXPR.
3788 The other arguments and return value are the same as for
3789 expand_builtin_strcpy. */
3791 static rtx
3793 {
3795 }
3797 /* Expand a call EXP to the stpcpy builtin.
3798 Return NULL_RTX if we failed the caller should emit a normal call,
3799 otherwise try to get the result in TARGET, if convenient (and in
3800 mode MODE if that's convenient). */
3802 static rtx
3804 {
3815 {
3819 }
3821 /* If return value is ignored, transform stpcpy into strcpy. */
3823 {
3827 }
3828 else
3829 {
3831 rtx ret;
3833 /* Ensure we get an actual string whose length can be evaluated at
3834 compile-time, not an expression containing a string. This is
3835 because the latter will potentially produce pessimized code
3836 when used to produce the return value. */
3848 {
3852 {
3856 {
3858 {
3861 else
3863 }
3872 }
3873 }
3874 }
3877 }
3878 }
3880 /* Check a call EXP to the stpncpy built-in for validity.
3881 Return NULL_RTX on both success and failure. */
3883 static rtx
3885 {
3891 /* The source and destination of the call. */
3895 /* The exact number of bytes to write (not the maximum). */
3898 /* The size of the destination object. */
3904 }
3906 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3907 bytes from constant string DATA + OFFSET and return it as target
3908 constant. */
3910 rtx
3912 scalar_int_mode mode)
3913 {
3920 }
3922 /* Helper to check the sizes of sequences and the destination of calls
3923 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3924 success (no overflow or invalid sizes), false otherwise. */
3926 static bool
3928 {
3933 /* Try to determine the range of lengths that the source expression
3934 refers to. */
3938 /* Try to verify that the destination is big enough for the shortest
3939 string. */
3942 {
3943 /* If it hasn't been provided by __strncat_chk, try to determine
3944 the size of the destination object into which the source is
3945 being copied. */
3947 }
3949 /* Add one for the terminating nul. */
3952 size_one_node)
3955 /* The strncat function copies at most MAXREAD bytes and always appends
3956 the terminating nul so the specified upper bound should never be equal
3957 to (or greater than) the size of the destination. */
3960 {
3969 }
3977 /* The number of bytes to write is LEN but check_access will also
3978 check SRCLEN if LEN's value isn't known. */
3980 objsize);
3981 }
3983 /* Similar to expand_builtin_strcat, do some very basic size validation
3984 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3985 the built-in expand to a call to the library function. */
3987 static rtx
3989 {
3997 /* The upper bound on the number of bytes to write. */
3999 /* The length of the source sequence. */
4002 /* Try to determine the range of lengths that the source expression
4003 refers to. */
4007 else
4010 /* Try to verify that the destination is big enough for the shortest
4011 string. First try to determine the size of the destination object
4012 into which the source is being copied. */
4015 /* Add one for the terminating nul. */
4018 size_one_node)
4021 /* The strncat function copies at most MAXREAD bytes and always appends
4022 the terminating nul so the specified upper bound should never be equal
4023 to (or greater than) the size of the destination. */
4026 {
4035 }
4043 /* The number of bytes to write is SRCLEN. */
4047 }
4049 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4050 NULL_RTX if we failed the caller should emit a normal call. */
4052 static rtx
4054 {
4059 {
4062 /* The number of bytes to write (not the maximum). */
4064 /* The length of the source sequence. */
4068 {
4072 /* The number of bytes to write is LEN but check_access will also
4073 check SLEN if LEN's value isn't known. */
4075 destsize);
4076 }
4078 /* We must be passed a constant len and src parameter. */
4084 /* We're required to pad with trailing zeros if the requested
4085 len is greater than strlen(s2)+1. In that case try to
4086 use store_by_pieces, if it fails, punt. */
4088 {
4091 rtx dest_mem;
4095 builtin_strncpy_read_str,
4102 builtin_strncpy_read_str,
4107 }
4108 }
4110 }
4112 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4113 bytes from constant string DATA + OFFSET and return it as target
4114 constant. */
4116 rtx
4118 scalar_int_mode mode)
4119 {
4126 }
4128 /* Callback routine for store_by_pieces. Return the RTL of a register
4129 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4130 char value given in the RTL register data. For example, if mode is
4131 4 bytes wide, return the RTL for 0x01010101*data. */
4133 static rtx
4135 scalar_int_mode mode)
4136 {
4152 }
4154 /* Expand expression EXP, which is a call to the memset builtin. Return
4155 NULL_RTX if we failed the caller should emit a normal call, otherwise
4156 try to get the result in TARGET, if convenient (and in mode MODE if that's
4157 convenient). */
4159 static rtx
4161 {
4173 }
4175 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4176 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4177 try to get the result in TARGET, if convenient (and in mode MODE if that's
4178 convenient). */
4180 static rtx
4182 {
4187 else
4188 {
4194 /* Return src bounds with the result. */
4196 {
4200 }
4202 }
4203 }
4205 /* Helper function to do the actual work for expand_builtin_memset. The
4206 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4207 so that this can also be called without constructing an actual CALL_EXPR.
4208 The other arguments and return value are the same as for
4209 expand_builtin_memset. */
4211 static rtx
4214 {
4217 machine_mode val_mode;
4229 /* If DEST is not a pointer type, don't do this operation in-line. */
4240 /* If the LEN parameter is zero, return DEST. */
4242 {
4243 /* Evaluate and ignore VAL in case it has side-effects. */
4246 }
4248 /* Stabilize the arguments in case we fail. */
4260 {
4261 rtx val_rtx;
4266 /* Assume that we can memset by pieces if we can store
4267 * the coefficients by pieces (in the required modes).
4268 * We can't pass builtin_memset_gen_str as that emits RTL. */
4274 {
4279 }
4283 probable_max_size))
4289 }
4295 {
4306 probable_max_size))
4312 }
4320 probable_max_size);
4323 {
4326 }
4330 do_libcall:
4340 else
4345 }
4347 /* Expand expression EXP, which is a call to the bzero builtin. Return
4348 NULL_RTX if we failed the caller should emit a normal call. */
4350 static rtx
4352 {
4361 /* New argument list transforming bzero(ptr x, int y) to
4362 memset(ptr x, int 0, size_t y). This is done this way
4363 so that if it isn't expanded inline, we fallback to
4364 calling bzero instead of memset. */
4372 }
4374 /* Try to expand cmpstr operation ICODE with the given operands.
4375 Return the result rtx on success, otherwise return null. */
4377 static rtx
4379 HOST_WIDE_INT align)
4380 {
4394 }
4396 /* Expand expression EXP, which is a call to the memcmp built-in function.
4397 Return NULL_RTX if we failed and the caller should emit a normal call,
4398 otherwise try to get the result in TARGET, if convenient.
4399 RESULT_EQ is true if we can relax the returned value to be either zero
4400 or nonzero, without caring about the sign. */
4402 static rtx
4404 {
4413 /* Diagnose calls where the specified length exceeds the size of either
4414 object. */
4416 {
4420 {
4424 }
4425 }
4433 /* If we don't have POINTER_TYPE, call the function. */
4441 /* Set MEM_SIZE as appropriate. */
4443 {
4446 }
4452 {
4456 }
4458 /* If SRC is a string constant and block move would be done
4459 by pieces, we can avoid loading the string from memory
4460 and only stored the computed constants. */
4472 {
4473 /* Return the value in the proper mode for this function. */
4478 {
4481 }
4484 }
4487 }
4489 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4490 if we failed the caller should emit a normal call, otherwise try to get
4491 the result in TARGET, if convenient. */
4493 static rtx
4495 {
4510 /* If we don't have POINTER_TYPE, call the function. */
4514 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4522 /* Try to call cmpstrsi. */
4527 /* Try to determine at least one length and call cmpstrnsi. */
4529 {
4530 tree len;
4531 rtx arg3_rtx;
4541 /* If we don't have a constant length for the first, use the length
4542 of the second, if we know it. We don't require a constant for
4543 this case; some cost analysis could be done if both are available
4544 but neither is constant. For now, assume they're equally cheap,
4545 unless one has side effects. If both strings have constant lengths,
4546 use the smaller. */
4562 else
4565 /* If both arguments have side effects, we cannot optimize. */
4567 {
4569 result = expand_cmpstrn_or_cmpmem
4572 }
4573 }
4575 /* Check to see if the argument was declared attribute nonstring
4576 and if so, issue a warning since at this point it's not known
4577 to be nul-terminated. */
4582 {
4583 /* Return the value in the proper mode for this function. */
4591 }
4593 /* Expand the library call ourselves using a stabilized argument
4594 list to avoid re-evaluating the function's arguments twice. */
4599 }
4601 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4602 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4603 the result in TARGET, if convenient. */
4605 static rtx
4607 ATTRIBUTE_UNUSED machine_mode mode)
4608 {
4613 /* If c_strlen can determine an expression for one of the string
4614 lengths, and it doesn't have side effects, then emit cmpstrnsi
4615 using length MIN(strlen(string)+1, arg3). */
4620 tree len;
4641 /* If we don't have a constant length for the first, use the length
4642 of the second, if we know it. If neither string is constant length,
4643 use the given length argument. We don't require a constant for
4644 this case; some cost analysis could be done if both are available
4645 but neither is constant. For now, assume they're equally cheap,
4646 unless one has side effects. If both strings have constant lengths,
4647 use the smaller. */
4665 else
4668 /* If we are not using the given length, we must incorporate it here.
4669 The actual new length parameter will be MIN(len,arg3) in this case. */
4679 /* Check to see if the argument was declared attribute nonstring
4680 and if so, issue a warning since at this point it's not known
4681 to be nul-terminated. */
4686 {
4687 /* Return the value in the proper mode for this function. */
4695 }
4697 /* Expand the library call ourselves using a stabilized argument
4698 list to avoid re-evaluating the function's arguments twice. */
4703 }
4705 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4706 if that's convenient. */
4708 rtx
4710 {
4711 rtx val;
4714 /* Don't do __builtin_saveregs more than once in a function.
4715 Save the result of the first call and reuse it. */
4719 /* When this function is called, it means that registers must be
4720 saved on entry to this function. So we migrate the call to the
4721 first insn of this function. */
4725 /* Do whatever the machine needs done in this case. */
4733 /* Put the insns after the NOTE that starts the function. If this
4734 is inside a start_sequence, make the outer-level insn chain current, so
4735 the code is placed at the start of the function. */
4741 }
4743 /* Expand a call to __builtin_next_arg. */
4745 static rtx
4747 {
4748 /* Checking arguments is already done in fold_builtin_next_arg
4749 that must be called before this function. */
4754 }
4756 /* Make it easier for the backends by protecting the valist argument
4757 from multiple evaluations. */
4759 static tree
4761 {
4764 /* The current way of determining the type of valist is completely
4765 bogus. We should have the information on the va builtin instead. */
4770 {
4774 /* For this case, the backends will be expecting a pointer to
4775 vatype, but it's possible we've actually been given an array
4776 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4777 So fix it. */
4779 {
4782 }
4783 }
4784 else
4785 {
4789 {
4795 }
4801 }
4804 }
4806 /* The "standard" definition of va_list is void*. */
4808 tree
4810 {
4812 }
4814 /* The "standard" abi va_list is va_list_type_node. */
4816 tree
4818 {
4820 }
4822 /* The "standard" type of va_list is va_list_type_node. */
4824 tree
4826 {
4833 {
4834 /* If va_list is an array type, the argument may have decayed
4835 to a pointer type, e.g. by being passed to another function.
4836 In that case, unwrap both types so that we can compare the
4837 underlying records. */
4840 {
4843 }
4844 }
4849 }
4851 /* The "standard" implementation of va_start: just assign `nextarg' to
4852 the variable. */
4854 void
4856 {
4860 /* We do not have any valid bounds for the pointer, so
4861 just store zero bounds for it. */
4865 nextarg));
4866 }
4868 /* Expand EXP, a call to __builtin_va_start. */
4870 static rtx
4872 {
4873 rtx nextarg;
4874 tree valist;
4878 {
4881 }
4891 else
4895 }
4897 /* Expand EXP, a call to __builtin_va_end. */
4899 static rtx
4901 {
4904 /* Evaluate for side effects, if needed. I hate macros that don't
4905 do that. */
4910 }
4912 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4913 builtin rather than just as an assignment in stdarg.h because of the
4914 nastiness of array-type va_list types. */
4916 static rtx
4918 {
4931 {
4935 }
4936 else
4937 {
4940 /* Evaluate to pointers. */
4949 /* "Dereference" to BLKmode memories. */
4957 /* Copy. */
4959 }
4962 }
4964 /* Expand a call to one of the builtin functions __builtin_frame_address or
4965 __builtin_return_address. */
4967 static rtx
4969 {
4970 /* The argument must be a nonnegative integer constant.
4971 It counts the number of frames to scan up the stack.
4972 The value is either the frame pointer value or the return
4973 address saved in that frame. */
4975 /* Warning about missing arg was already issued. */
4978 {
4981 }
4982 else
4983 {
4984 /* Number of frames to scan up the stack. */
4989 /* Some ports cannot access arbitrary stack frames. */
4991 {
4994 }
4997 {
4998 /* Warn since no effort is made to ensure that any frame
4999 beyond the current one exists or can be safely reached. */
5002 }
5004 /* For __builtin_frame_address, return what we've got. */
5012 }
5013 }
5015 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5016 failed and the caller should emit a normal call. */
5018 static rtx
5020 {
5021 rtx op0;
5022 rtx result;
5025 HOST_WIDE_INT max_size;
5028 bool valid_arglist
5031 VOID_TYPE)
5041 {
5042 /* -Walloca-larger-than and -Wvla-larger-than settings override
5043 the more general -Walloc-size-larger-than so unless either of
5044 the former options is specified check the alloca arguments for
5045 overflow. */
5049 }
5051 /* Compute the argument. */
5054 /* Compute the alignment. */
5056 ? BIGGEST_ALIGNMENT
5059 /* Compute the maximum size. */
5064 /* Allocate the desired space. If the allocation stems from the declaration
5065 of a variable-sized object, it cannot accumulate. */
5066 result
5071 }
5073 /* Emit a call to __asan_allocas_unpoison call in EXP. Replace second argument
5074 of the call with virtual_stack_dynamic_rtx because in asan pass we emit a
5075 dummy value into second parameter relying on this function to perform the
5076 change. See motivation for this in comment to handle_builtin_stack_restore
5077 function. */
5079 static rtx
5081 {
5089 }
5091 /* Expand a call to bswap builtin in EXP.
5092 Return NULL_RTX if a normal call should be emitted rather than expanding the
5093 function in-line. If convenient, the result should be placed in TARGET.
5094 SUBTARGET may be used as the target for computing one of EXP's operands. */
5096 static rtx
5098 rtx subtarget)
5099 {
5100 tree arg;
5101 rtx op0;
5119 }
5121 /* Expand a call to a unary builtin in EXP.
5122 Return NULL_RTX if a normal call should be emitted rather than expanding the
5123 function in-line. If convenient, the result should be placed in TARGET.
5124 SUBTARGET may be used as the target for computing one of EXP's operands. */
5126 static rtx
5129 {
5130 rtx op0;
5135 /* Compute the argument. */
5137 (subtarget
5141 /* Compute op, into TARGET if possible.
5142 Set TARGET to wherever the result comes back. */
5148 }
5150 /* Expand a call to __builtin_expect. We just return our argument
5151 as the builtin_expect semantic should've been already executed by
5152 tree branch prediction pass. */
5154 static rtx
5156 {
5157 tree arg;
5164 /* When guessing was done, the hints should be already stripped away. */
5168 }
5170 /* Expand a call to __builtin_assume_aligned. We just return our first
5171 argument as the builtin_assume_aligned semantic should've been already
5172 executed by CCP. */
5174 static rtx
5176 {
5180 EXPAND_NORMAL);
5185 }
5187 void
5189 {
5191 {
5193 /* For trap insns when not accumulating outgoing args force
5194 REG_ARGS_SIZE note to prevent crossjumping of calls with
5195 different args sizes. */
5198 }
5199 else
5200 {
5204 }
5207 }
5209 /* Expand a call to __builtin_unreachable. We do nothing except emit
5210 a barrier saying that control flow will not pass here.
5212 It is the responsibility of the program being compiled to ensure
5213 that control flow does never reach __builtin_unreachable. */
5214 static void
5216 {
5218 }
5220 /* Expand EXP, a call to fabs, fabsf or fabsl.
5221 Return NULL_RTX if a normal call should be emitted rather than expanding
5222 the function inline. If convenient, the result should be placed
5223 in TARGET. SUBTARGET may be used as the target for computing
5224 the operand. */
5226 static rtx
5228 {
5229 machine_mode mode;
5230 tree arg;
5231 rtx op0;
5241 }
5243 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5244 Return NULL is a normal call should be emitted rather than expanding the
5245 function inline. If convenient, the result should be placed in TARGET.
5246 SUBTARGET may be used as the target for computing the operand. */
5248 static rtx
5250 {
5252 tree arg;
5264 }
5266 /* Expand a call to __builtin___clear_cache. */
5268 static rtx
5270 {
5272 {
5273 #ifdef CLEAR_INSN_CACHE
5274 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5275 does something. Just do the default expansion to a call to
5276 __clear_cache(). */
5278 #else
5279 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5280 does nothing. There is no need to call it. Do nothing. */
5283 }
5285 /* We have a "clear_cache" insn, and it will handle everything. */
5289 /* We must not expand to a library call. If we did, any
5290 fallback library function in libgcc that might contain a call to
5291 __builtin___clear_cache() would recurse infinitely. */
5293 {
5296 }
5299 {
5312 }
5314 }
5316 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5318 static rtx
5320 {
5323 /* If we don't need too much alignment, we'll have been guaranteed
5324 proper alignment by get_trampoline_type. */
5328 /* Round address up to desired boundary. */
5339 }
5341 static rtx
5343 {
5359 /* If ONSTACK, the TRAMP argument should be the address of a field
5360 within the local function's FRAME decl. Either way, let's see if
5361 we can fill in the MEM_ATTRs for this memory. */
5365 /* Creator of a heap trampoline is responsible for making sure the
5366 address is aligned to at least STACK_BOUNDARY. Normally malloc
5367 will ensure this anyhow. */
5370 {
5374 }
5376 /* The FUNC argument should be the address of the nested function.
5377 Extract the actual function decl to pass to the hook. */
5384 /* Generate insns to initialize the trampoline. */
5388 {
5394 }
5397 }
5399 static rtx
5401 {
5402 rtx tramp;
5413 }
5415 /* Expand a call to the builtin descriptor initialization routine.
5416 A descriptor is made up of a couple of pointers to the static
5417 chain and the code entry in this order. */
5419 static rtx
5421 {
5426 VOID_TYPE))
5440 /* Generate insns to initialize the descriptor. */
5446 }
5448 /* Expand a call to the builtin descriptor adjustment routine. */
5450 static rtx
5452 {
5453 rtx tramp;
5460 /* Unalign the descriptor to allow runtime identification. */
5465 }
5467 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5468 function. The function first checks whether the back end provides
5469 an insn to implement signbit for the respective mode. If not, it
5470 checks whether the floating point format of the value is such that
5471 the sign bit can be extracted. If that is not the case, error out.
5472 EXP is the expression that is a call to the builtin function; if
5473 convenient, the result should be placed in TARGET. */
5474 static rtx
5476 {
5478 scalar_float_mode fmode;
5480 tree arg;
5483 rtx temp;
5496 /* Expand the argument yielding a RTX expression. */
5499 /* Check if the back end provides an insn that handles signbit for the
5500 argument's mode. */
5503 {
5509 }
5511 /* For floating point formats without a sign bit, implement signbit
5512 as "ARG < 0.0". */
5515 {
5516 /* But we can't do this if the format supports signed zero. */
5522 }
5525 {
5528 }
5529 else
5530 {
5532 /* Handle targets with different FP word orders. */
5535 else
5539 }
5541 /* Force the intermediate word_mode (or narrower) result into a
5542 register. This avoids attempting to create paradoxical SUBREGs
5543 of floating point modes below. */
5546 /* If the bitpos is within the "result mode" lowpart, the operation
5547 can be implement with a single bitwise AND. Otherwise, we need
5548 a right shift and an AND. */
5551 {
5559 }
5560 else
5561 {
5562 /* Perform a logical right shift to place the signbit in the least
5563 significant bit, then truncate the result to the desired mode
5564 and mask just this bit. */
5569 }
5572 }
5574 /* Expand fork or exec calls. TARGET is the desired target of the
5575 call. EXP is the call. FN is the
5576 identificator of the actual function. IGNORE is nonzero if the
5577 value is to be ignored. */
5579 static rtx
5581 {
5583 tree call;
5585 /* If we are not profiling, just call the function. */
5589 /* Otherwise call the wrapper. This should be equivalent for the rest of
5590 compiler, so the code does not diverge, and the wrapper may run the
5591 code necessary for keeping the profiling sane. */
5594 {
5625 }
5637 }
5640 \f
5641 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5642 the pointer in these functions is void*, the tree optimizers may remove
5643 casts. The mode computed in expand_builtin isn't reliable either, due
5644 to __sync_bool_compare_and_swap.
5646 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5647 group of builtins. This gives us log2 of the mode size. */
5651 {
5652 /* The size is not negotiable, so ask not to get BLKmode in return
5653 if the target indicates that a smaller size would be better. */
5655 }
5657 /* Expand the memory expression LOC and return the appropriate memory operand
5658 for the builtin_sync operations. */
5660 static rtx
5662 {
5668 /* Note that we explicitly do not want any alias information for this
5669 memory, so that we kill all other live memories. Otherwise we don't
5670 satisfy the full barrier semantics of the intrinsic. */
5673 /* The alignment needs to be at least according to that of the mode. */
5680 }
5682 /* Make sure an argument is in the right mode.
5683 EXP is the tree argument.
5684 MODE is the mode it should be in. */
5686 static rtx
5688 {
5689 rtx val;
5690 machine_mode old_mode;
5693 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5694 of CONST_INTs, where we know the old_mode only from the call argument. */
5701 }
5704 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5705 EXP is the CALL_EXPR. CODE is the rtx code
5706 that corresponds to the arithmetic or logical operation from the name;
5707 an exception here is that NOT actually means NAND. TARGET is an optional
5708 place for us to store the results; AFTER is true if this is the
5709 fetch_and_xxx form. */
5711 static rtx
5714 rtx target)
5715 {
5720 {
5727 {
5756 }
5757 }
5759 /* Expand the operands. */
5764 after);
5765 }
5767 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5768 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5769 true if this is the boolean form. TARGET is a place for us to store the
5770 results; this is NOT optional if IS_BOOL is true. */
5772 static rtx
5775 {
5779 /* Expand the operands. */
5786 {
5789 else
5791 }
5794 MEMMODEL_SYNC_SEQ_CST))
5798 }
5800 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5801 general form is actually an atomic exchange, and some targets only
5802 support a reduced form with the second argument being a constant 1.
5803 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5804 the results. */
5806 static rtx
5808 rtx target)
5809 {
5812 /* Expand the operands. */
5817 }
5819 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5821 static void
5823 {
5824 rtx mem;
5826 /* Expand the operands. */
5830 }
5832 /* Given an integer representing an ``enum memmodel'', verify its
5833 correctness and return the memory model enum. */
5835 static enum memmodel
5837 {
5838 rtx op;
5840 source_location loc
5843 /* If the parameter is not a constant, it's a run time value so we'll just
5844 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5854 {
5858 }
5860 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5862 {
5866 }
5868 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5869 be conservative and promote consume to acquire. */
5874 }
5876 /* Expand the __atomic_exchange intrinsic:
5877 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5878 EXP is the CALL_EXPR.
5879 TARGET is an optional place for us to store the results. */
5881 static rtx
5883 {
5892 /* Expand the operands. */
5897 }
5899 /* Expand the __atomic_compare_exchange intrinsic:
5900 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5901 TYPE desired, BOOL weak,
5902 enum memmodel success,
5903 enum memmodel failure)
5904 EXP is the CALL_EXPR.
5905 TARGET is an optional place for us to store the results. */
5907 static rtx
5909 rtx target)
5910 {
5914 tree weak;
5916 source_location loc
5923 {
5925 "failure memory model cannot be stronger than success "
5928 }
5931 {
5933 "invalid failure memory model for "
5937 }
5943 /* Expand the operands. */
5959 /* Lest the rtl backend create a race condition with an imporoper store
5960 to memory, always create a new pseudo for OLDVAL. */
5967 /* Conditionally store back to EXPECT, lest we create a race condition
5968 with an improper store to memory. */
5969 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5970 the normal case where EXPECT is totally private, i.e. a register. At
5971 which point the store can be unconditional. */
5979 }
5981 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5982 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5983 call. The weak parameter must be dropped to match the expected parameter
5984 list and the expected argument changed from value to pointer to memory
5985 slot. */
5987 static void
5989 {
6005 /* Skip the boolean weak parameter. */
6008 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6011 built_in_function fncode
6016 fndecl);
6021 {
6028 }
6029 }
6031 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6033 void
6035 {
6041 tree lhs;
6043 source_location loc
6050 {
6052 "failure memory model cannot be stronger than success "
6055 }
6058 {
6060 "invalid failure memory model for "
6064 }
6067 {
6070 }
6072 /* Expand the operands. */
6085 {
6088 }
6092 {
6098 }
6099 }
6101 /* Expand the __atomic_load intrinsic:
6102 TYPE __atomic_load (TYPE *object, enum memmodel)
6103 EXP is the CALL_EXPR.
6104 TARGET is an optional place for us to store the results. */
6106 static rtx
6108 {
6109 rtx mem;
6114 {
6115 source_location loc
6120 }
6125 /* Expand the operand. */
6129 }
6132 /* Expand the __atomic_store intrinsic:
6133 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6134 EXP is the CALL_EXPR.
6135 TARGET is an optional place for us to store the results. */
6137 static rtx
6139 {
6146 {
6147 source_location loc
6152 }
6157 /* Expand the operands. */
6162 }
6164 /* Expand the __atomic_fetch_XXX intrinsic:
6165 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6166 EXP is the CALL_EXPR.
6167 TARGET is an optional place for us to store the results.
6168 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6169 FETCH_AFTER is true if returning the result of the operation.
6170 FETCH_AFTER is false if returning the value before the operation.
6171 IGNORE is true if the result is not used.
6172 EXT_CALL is the correct builtin for an external call if this cannot be
6173 resolved to an instruction sequence. */
6175 static rtx
6179 {
6182 tree fndecl;
6183 tree addr;
6187 /* Expand the operands. */
6191 /* Only try generating instructions if inlining is turned on. */
6193 {
6197 }
6199 /* Return if a different routine isn't needed for the library call. */
6203 /* Change the call to the specified function. */
6211 /* If we will emit code after the call, the call can not be a tail call.
6212 If it is emitted as a tail call, a barrier is emitted after it, and
6213 then all trailing code is removed. */
6217 /* Expand the call here so we can emit trailing code. */
6220 /* Replace the original function just in case it matters. */
6223 /* Then issue the arithmetic correction to return the right result. */
6225 {
6227 {
6229 OPTAB_LIB_WIDEN);
6231 }
6232 else
6234 OPTAB_LIB_WIDEN);
6235 }
6237 }
6239 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6241 void
6243 {
6251 optab optab;
6263 {
6278 }
6281 {
6288 }
6310 {
6315 }
6316 else
6318 OPTAB_DIRECT);
6321 }
6323 /* Expand an atomic clear operation.
6324 void _atomic_clear (BOOL *obj, enum memmodel)
6325 EXP is the call expression. */
6327 static rtx
6329 {
6330 machine_mode mode;
6339 {
6340 source_location loc
6345 }
6347 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6348 Failing that, a store is issued by __atomic_store. The only way this can
6349 fail is if the bool type is larger than a word size. Unlikely, but
6350 handle it anyway for completeness. Assume a single threaded model since
6351 there is no atomic support in this case, and no barriers are required. */
6356 }
6358 /* Expand an atomic test_and_set operation.
6359 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6360 EXP is the call expression. */
6362 static rtx
6364 {
6365 rtx mem;
6367 machine_mode mode;
6374 }
6377 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6378 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6380 static tree
6382 {
6384 machine_mode mode;
6390 /* We need a corresponding integer mode for the access to be lock-free. */
6398 {
6401 /* Either this argument is null, or it's a fake pointer encoding
6402 the alignment of the object. */
6408 else
6410 }
6411 else
6412 {
6415 /* This function is usually invoked and folded immediately by the front
6416 end before anything else has a chance to look at it. The pointer
6417 parameter at this point is usually cast to a void *, so check for that
6418 and look past the cast. */
6428 /* Get the underlying type of the object. */
6431 }
6433 /* If the object has smaller alignment, the lock free routines cannot
6434 be used. */
6438 /* Check if a compare_and_swap pattern exists for the mode which represents
6439 the required size. The pattern is not allowed to fail, so the existence
6440 of the pattern indicates support is present. Also require that an
6441 atomic load exists for the required size. */
6444 else
6446 }
6448 /* Return true if the parameters to call EXP represent an object which will
6449 always generate lock free instructions. The first argument represents the
6450 size of the object, and the second parameter is a pointer to the object
6451 itself. If NULL is passed for the object, then the result is based on
6452 typical alignment for an object of the specified size. Otherwise return
6453 false. */
6455 static rtx
6457 {
6458 tree size;
6463 {
6466 }
6472 }
6474 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6475 is lock free on this architecture. */
6477 static tree
6479 {
6483 /* If it isn't always lock free, don't generate a result. */
6488 }
6490 /* Return true if the parameters to call EXP represent an object which will
6491 always generate lock free instructions. The first argument represents the
6492 size of the object, and the second parameter is a pointer to the object
6493 itself. If NULL is passed for the object, then the result is based on
6494 typical alignment for an object of the specified size. Otherwise return
6495 NULL*/
6497 static rtx
6499 {
6500 tree size;
6505 {
6508 }
6513 /* If the value is known at compile time, return the RTX for it. */
6519 }
6521 /* Expand the __atomic_thread_fence intrinsic:
6522 void __atomic_thread_fence (enum memmodel)
6523 EXP is the CALL_EXPR. */
6525 static void
6527 {
6530 }
6532 /* Expand the __atomic_signal_fence intrinsic:
6533 void __atomic_signal_fence (enum memmodel)
6534 EXP is the CALL_EXPR. */
6536 static void
6538 {
6541 }
6543 /* Expand the __sync_synchronize intrinsic. */
6545 static void
6547 {
6549 }
6551 static rtx
6553 {
6559 {
6561 /* If the target is not sutitable then create a new target. */
6569 }
6572 }
6574 static void
6576 {
6582 {
6589 }
6591 }
6593 \f
6594 /* Emit code to restore the current value of stack. */
6596 static void
6598 {
6610 }
6612 /* Emit code to save the current value of stack. */
6614 static rtx
6616 {
6621 }
6624 /* Expand an expression EXP that calls a built-in function,
6625 with result going to TARGET if that's convenient
6626 (and in mode MODE if that's convenient).
6627 SUBTARGET may be used as the target for computing one of EXP's operands.
6628 IGNORE is nonzero if the value is to be ignored. */
6630 rtx
6633 {
6642 /* When ASan is enabled, we don't want to expand some memory/string
6643 builtins and rely on libsanitizer's hooks. This allows us to avoid
6644 redundant checks and be sure, that possible overflow will be detected
6645 by ASan. */
6650 /* When not optimizing, generate calls to library functions for a certain
6651 set of builtins. */
6677 /* The built-in function expanders test for target == const0_rtx
6678 to determine whether the function's result will be ignored. */
6682 /* If the result of a pure or const built-in function is ignored, and
6683 none of its arguments are volatile, we can avoid expanding the
6684 built-in call and just evaluate the arguments for side-effects. */
6688 {
6690 tree arg;
6691 call_expr_arg_iterator iter;
6695 {
6698 }
6701 {
6705 }
6706 }
6708 /* expand_builtin_with_bounds is supposed to be used for
6709 instrumented builtin calls. */
6713 {
6731 /* Just do a normal library call if we were unable to fold
6732 the values. */
6809 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6810 FUNCTION with a copy of the parameters described by
6811 ARGUMENTS, and ARGSIZE. It returns a block of memory
6812 allocated on the stack into which is stored all the registers
6813 that might possibly be used for returning the result of a
6814 function. ARGUMENTS is the value returned by
6815 __builtin_apply_args. ARGSIZE is the number of bytes of
6816 arguments that must be copied. ??? How should this value be
6817 computed? We'll also need a safe worst case value for varargs
6818 functions. */
6825 else
6826 {
6834 }
6836 /* __builtin_return (RESULT) causes the function to return the
6837 value described by RESULT. RESULT is address of the block of
6838 memory returned by __builtin_apply. */
6848 /* All valid uses of __builtin_va_arg_pack () are removed during
6849 inlining. */
6854 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6855 inlining. */
6859 /* Return the address of the first anonymous stack arg. */
6881 /* Returns the address of the area where the structure is returned.
6882 0 otherwise. */
6888 else
6891 CASE_BUILT_IN_ALLOCA:
7054 {
7057 }
7061 /* This should have been lowered to the builtins below. */
7065 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7066 and the receiver label. */
7068 {
7074 /* This is copied from the handling of non-local gotos. */
7076 nonlocal_goto_handler_labels
7078 nonlocal_goto_handler_labels);
7079 /* ??? Do not let expand_label treat us as such since we would
7080 not want to be both on the list of non-local labels and on
7081 the list of forced labels. */
7084 }
7088 /* __builtin_setjmp_receiver is passed the receiver label. */
7090 {
7096 }
7099 /* __builtin_longjmp is passed a pointer to an array of five words.
7100 It's similar to the C library longjmp function but works with
7101 __builtin_setjmp above. */
7104 {
7110 {
7113 }
7117 }
7126 /* This updates the setjmp buffer that is its argument with the value
7127 of the current stack pointer. */
7130 {
7131 rtx buf_addr
7136 }
7156 /* Various hooks for the DWARF 2 __throw routine. */
7162 #ifdef DWARF2_UNWIND_INFO
7168 #endif
7368 mode = get_builtin_sync_mode
7380 mode = get_builtin_sync_mode
7427 {
7431 mode =
7437 /* If this is turned into an external library call, the weak parameter
7438 must be dropped to match the expected parameter list. */
7443 /* Skip the boolean weak parameter. */
7448 }
7477 {
7487 }
7493 {
7503 }
7509 {
7519 }
7525 {
7535 }
7541 {
7551 }
7557 {
7567 }
7714 /* We allow user CHKP builtins if Pointer Bounds
7715 Checker is off. */
7717 {
7728 else
7730 }
7731 /* FALLTHROUGH */
7743 /* Software implementation of Pointer Bounds Checker is NYI.
7744 Target support is required. */
7749 /* Do library call, if we failed to expand the builtin when
7750 folding. */
7755 }
7757 /* The switch statement above can drop through to cause the function
7758 to be called normally. */
7760 }
7762 /* Similar to expand_builtin but is used for instrumented calls. */
7764 rtx
7766 rtx subtarget ATTRIBUTE_UNUSED,
7768 {
7781 {
7804 {
7805 /* memcpy_chkp (void *dst, size_t dstbnd,
7806 const void *src, size_t srcbnd, size_t n)
7807 and others take a pointer bound argument just after each
7808 pointer argument. */
7815 }
7819 }
7821 /* The switch statement above can drop through to cause the function
7822 to be called normally. */
7824 }
7826 /* Determine whether a tree node represents a call to a built-in
7827 function. If the tree T is a call to a built-in function with
7828 the right number of arguments of the appropriate types, return
7829 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7830 Otherwise the return value is END_BUILTINS. */
7832 enum built_in_function
7834 {
7837 const_call_expr_arg_iterator iter;
7853 {
7854 /* If a function doesn't take a variable number of arguments,
7855 the last element in the list will have type `void'. */
7858 {
7862 }
7871 {
7874 }
7876 {
7879 }
7881 {
7884 }
7886 {
7889 }
7890 else
7892 }
7894 /* Variable-length argument list. */
7896 }
7898 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7899 evaluate to a constant. */
7901 static tree
7903 {
7904 /* We return 1 for a numeric type that's known to be a constant
7905 value at compile-time or for an aggregate type that's a
7906 literal constant. */
7909 /* If we know this is a constant, emit the constant of one. */
7915 {
7922 }
7924 /* If this expression has side effects, show we don't know it to be a
7925 constant. Likewise if it's a pointer or aggregate type since in
7926 those case we only want literals, since those are only optimized
7927 when generating RTL, not later.
7928 And finally, if we are compiling an initializer, not code, we
7929 need to return a definite result now; there's not going to be any
7930 more optimization done. */
7935 || folding_initializer
7940 }
7942 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7943 return it as a truthvalue. */
7945 static tree
7947 tree predictor)
7948 {
7960 predictor);
7964 }
7966 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7967 NULL_TREE if no simplification is possible. */
7969 tree
7971 {
7975 /* Distribute the expected value over short-circuiting operators.
7976 See through the cast from truthvalue_type_node to long. */
7983 /* If this is a builtin_expect within a builtin_expect keep the
7984 inner one. See through a comparison against a constant. It
7985 might have been added to create a thruthvalue. */
8001 {
8010 }
8012 /* If the argument isn't invariant then there's nothing else we can do. */
8016 /* If we expect that a comparison against the argument will fold to
8017 a constant return the constant. In practice, this means a true
8018 constant or the address of a non-weak symbol. */
8022 {
8023 do
8024 {
8026 }
8031 }
8033 /* Otherwise, ARG0 already has the proper type for the return value. */
8035 }
8037 /* Fold a call to __builtin_classify_type with argument ARG. */
8039 static tree
8041 {
8046 }
8048 /* Fold a call to __builtin_strlen with argument ARG. */
8050 static tree
8052 {
8055 else
8056 {
8063 }
8064 }
8066 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8068 static tree
8070 {
8071 REAL_VALUE_TYPE real;
8073 /* __builtin_inff is intended to be usable to define INFINITY on all
8074 targets. If an infinity is not available, INFINITY expands "to a
8075 positive constant of type float that overflows at translation
8076 time", footnote "In this case, using INFINITY will violate the
8077 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8078 Thus we pedwarn to ensure this constraint violation is
8079 diagnosed. */
8085 }
8087 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8088 NULL_TREE if no simplification can be made. */
8090 static tree
8093 {
8094 tree type;
8104 /* Calculate the result when the argument is a constant. */
8109 /* Canonicalize sincos to cexpi. */
8111 {
8114 }
8116 {
8123 }
8132 }
8134 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8135 Return NULL_TREE if no simplification can be made. */
8137 static tree
8139 {
8145 /* If the LEN parameter is zero, return zero. */
8150 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8154 /* If len parameter is one, return an expression corresponding to
8155 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8157 {
8159 tree cst_uchar_ptr_node
8162 tree ind1
8166 cst_uchar_ptr_node,
8167 arg1)));
8168 tree ind2
8172 cst_uchar_ptr_node,
8173 arg2)));
8175 }
8178 }
8180 /* Fold a call to builtin isascii with argument ARG. */
8182 static tree
8184 {
8187 else
8188 {
8189 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8195 }
8196 }
8198 /* Fold a call to builtin toascii with argument ARG. */
8200 static tree
8202 {
8206 /* Transform toascii(c) -> (c & 0x7f). */
8209 }
8211 /* Fold a call to builtin isdigit with argument ARG. */
8213 static tree
8215 {
8218 else
8219 {
8220 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8221 /* According to the C standard, isdigit is unaffected by locale.
8222 However, it definitely is affected by the target character set. */
8223 unsigned HOST_WIDE_INT target_digit0
8234 }
8235 }
8237 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8239 static tree
8241 {
8247 }
8249 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8251 static tree
8253 {
8259 }
8261 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
8263 static tree
8265 {
8266 /* ??? Only expand to FMA_EXPR if it's directly supported. */
8274 }
8276 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8278 static tree
8280 {
8283 {
8287 {
8292 }
8293 }
8296 }
8298 /* Fold a call to builtin frexp, we can assume the base is 2. */
8300 static tree
8302 {
8313 /* Proceed if a valid pointer type was passed in. */
8315 {
8320 {
8322 /* For +-0, return (*exp = 0, +-0). */
8328 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8331 {
8332 /* Since the frexp function always expects base 2, and in
8333 GCC normalized significands are already in the range
8334 [0.5, 1.0), we have exactly what frexp wants. */
8339 }
8343 }
8345 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8349 }
8352 }
8354 /* Fold a call to builtin modf. */
8356 static tree
8358 {
8369 /* Proceed if a valid pointer type was passed in. */
8371 {
8376 {
8379 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8383 /* For +-Inf, return (*arg1 = arg0, +-0). */
8389 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8392 /* If the original number was negative and already
8393 integral, then the fractional part is -0.0. */
8397 }
8399 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8405 }
8408 }
8410 /* Given a location LOC, an interclass builtin function decl FNDECL
8411 and its single argument ARG, return an folded expression computing
8412 the same, or NULL_TREE if we either couldn't or didn't want to fold
8413 (the latter happen if there's an RTL instruction available). */
8415 static tree
8417 {
8418 machine_mode mode;
8430 /* If there is no optab, try generic code. */
8432 {
8433 tree result;
8436 {
8437 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8440 REAL_VALUE_TYPE r;
8444 {
8445 /* NaN and Inf are encoded in the high-order double value
8446 only. The low-order value is not significant. */
8450 }
8457 }
8460 {
8461 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8464 REAL_VALUE_TYPE r;
8468 {
8469 /* NaN and Inf are encoded in the high-order double value
8470 only. The low-order value is not significant. */
8474 }
8480 /*result = fold_build2_loc (loc, UNGT_EXPR,
8481 TREE_TYPE (TREE_TYPE (fndecl)),
8482 fold_build1_loc (loc, ABS_EXPR, type, arg),
8483 build_real (type, r));
8484 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8485 TREE_TYPE (TREE_TYPE (fndecl)),
8486 result);*/
8488 }
8490 {
8491 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8492 islessequal(fabs(x),DBL_MAX). */
8502 {
8503 /* Use double to test the normal range of IBM extended
8504 precision. Emin for IBM extended precision is
8505 different to emin for IEEE double, being 53 higher
8506 since the low double exponent is at least 53 lower
8507 than the high double exponent. */
8511 }
8523 {
8524 /* Testing the high end of the range is done just using
8525 the high double, using the same test as isfinite().
8526 For the subnormal end of the range we first test the
8527 high double, then if its magnitude is equal to the
8528 limit of 0x1p-969, we test whether the low double is
8529 non-zero and opposite sign to the high double. */
8545 integer_type_node,
8551 }
8552 else
8553 {
8554 tree const isge_fn
8557 }
8561 }
8564 }
8567 }
8569 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8570 ARG is the argument for the call. */
8572 static tree
8574 {
8581 {
8589 {
8590 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8591 /* In a boolean context, GCC will fold the inner COND_EXPR to
8592 1. So e.g. "if (isinf_sign(x))" would be folded to just
8593 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8601 {
8614 integer_zero_node);
8615 }
8618 }
8631 {
8634 {
8635 /* NaN and Inf are encoded in the high-order double value
8636 only. The low-order value is not significant. */
8638 }
8639 }
8645 }
8646 }
8648 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8649 This builtin will generate code to return the appropriate floating
8650 point classification depending on the value of the floating point
8651 number passed in. The possible return values must be supplied as
8652 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8653 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8654 one floating point argument which is "type generic". */
8656 static tree
8658 {
8661 machine_mode mode;
8662 REAL_VALUE_TYPE r;
8665 /* Verify the required arguments in the original call. */
8685 /* fpclassify(x) ->
8686 isnan(x) ? FP_NAN :
8687 (fabs(x) == Inf ? FP_INFINITE :
8688 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8689 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8703 {
8709 }
8712 {
8715 }
8718 }
8720 /* Fold a call to an unordered comparison function such as
8721 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8722 being called and ARG0 and ARG1 are the arguments for the call.
8723 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8724 the opposite of the desired result. UNORDERED_CODE is used
8725 for modes that can hold NaNs and ORDERED_CODE is used for
8726 the rest. */
8728 static tree
8732 {
8746 /* Choose the wider of two real types. */
8758 {
8762 }
8767 }
8769 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8770 arithmetics if it can never overflow, or into internal functions that
8771 return both result of arithmetics and overflowed boolean flag in
8772 a complex integer result, or some other check for overflow.
8773 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8774 checking part of that. */
8776 static tree
8779 {
8781 /* The code of the expression corresponding to the type-generic
8782 built-in, or ERROR_MARK for the type-specific ones. */
8787 {
8790 /* FALLTHRU */
8793 /* FALLTHRU */
8804 /* FALLTHRU */
8807 /* FALLTHRU */
8818 /* FALLTHRU */
8821 /* FALLTHRU */
8832 }
8834 /* For the "generic" overloads, the first two arguments can have different
8835 types and the last argument determines the target type to use to check
8836 for overflow. The arguments of the other overloads all have the same
8837 type. */
8840 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8841 arguments are constant, attempt to fold the built-in call into a constant
8842 expression indicating whether or not it detected an overflow. */
8846 /* Perform the computation in the target type and check for overflow. */
8850 arg2);
8864 tree store
8867 }
8869 /* Fold a call to __builtin_FILE to a constant string. */
8873 {
8875 {
8876 /* The documentation says this builtin is equivalent to the preprocessor
8877 __FILE__ macro so it appears appropriate to use the same file prefix
8878 mappings. */
8881 }
8884 }
8886 /* Fold a call to __builtin_FUNCTION to a constant string. */
8890 {
8897 }
8899 /* Fold a call to __builtin_LINE to an integer constant. */
8903 {
8905 }
8907 /* Fold a call to built-in function FNDECL with 0 arguments.
8908 This function returns NULL_TREE if no simplification was possible. */
8910 static tree
8912 {
8916 {
8942 }
8944 }
8946 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8947 This function returns NULL_TREE if no simplification was possible. */
8949 static tree
8951 {
8962 {
8964 {
8967 /* Gimplification will pull the CALL_EXPR for the builtin out of
8968 an if condition. When not optimizing, we'll not CSE it back.
8969 To avoid link error types of regressions, return false now. */
8974 }
9030 {
9035 }
9041 {
9046 }
9067 }
9071 }
9073 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9074 This function returns NULL_TREE if no simplification was possible. */
9076 static tree
9078 {
9090 {
9134 NOP_EXPR);
9136 /* We do the folding for va_start in the expander. */
9151 }
9153 }
9155 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9156 and ARG2.
9157 This function returns NULL_TREE if no simplification was possible. */
9159 static tree
9162 {
9176 {
9226 }
9228 }
9230 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9231 arguments. IGNORE is true if the result of the
9232 function call is ignored. This function returns NULL_TREE if no
9233 simplification was possible. */
9235 tree
9237 {
9241 {
9257 }
9259 {
9264 }
9266 }
9268 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9269 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9270 of arguments in ARGS to be omitted. OLDNARGS is the number of
9271 elements in ARGS. */
9273 static tree
9276 {
9281 {
9289 }
9290 else
9294 }
9296 /* Return true if FNDECL shouldn't be folded right now.
9297 If a built-in function has an inline attribute always_inline
9298 wrapper, defer folding it after always_inline functions have
9299 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9300 might not be performed. */
9302 bool
9304 {
9307 && cfun
9310 }
9312 /* A wrapper function for builtin folding that prevents warnings for
9313 "statement without effect" and the like, caused by removing the
9314 call node earlier than the warning is generated. */
9316 tree
9318 {
9324 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9325 yet. Defer folding until we see all the arguments
9326 (after inlining). */
9328 {
9331 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9332 instead last argument is __builtin_va_arg_pack (). Defer folding
9333 even in that case, until arguments are finalized. */
9335 {
9342 }
9350 else
9351 {
9356 }
9357 }
9359 }
9361 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9362 N arguments are passed in the array ARGARRAY. Return a folded
9363 expression or NULL_TREE if no simplification was possible. */
9365 tree
9367 tree fn,
9370 {
9377 {
9378 /* If last argument is __builtin_va_arg_pack (), arguments to this
9379 function are not finalized yet. Defer folding until they are. */
9381 {
9388 }
9393 else
9395 }
9398 }
9400 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9401 along with N new arguments specified as the "..." parameters. SKIP
9402 is the number of arguments in EXP to be omitted. This function is used
9403 to do varargs-to-varargs transformations. */
9405 static tree
9407 {
9409 tree t;
9417 }
9419 /* Validate a single argument ARG against a tree code CODE representing
9420 a type. Return true when argument is valid. */
9422 static bool
9424 {
9432 }
9434 /* This function validates the types of a function call argument list
9435 against a specified list of tree_codes. If the last specifier is a 0,
9436 that represents an ellipses, otherwise the last specifier must be a
9437 VOID_TYPE.
9439 This is the GIMPLE version of validate_arglist. Eventually we want to
9440 completely convert builtins.c to work from GIMPLEs and the tree based
9441 validate_arglist will then be removed. */
9443 bool
9445 {
9449 const_tree arg;
9455 do
9456 {
9459 {
9461 /* This signifies an ellipses, any further arguments are all ok. */
9465 /* This signifies an endlink, if no arguments remain, return
9466 true, otherwise return false. */
9470 /* If no parameters remain or the parameter's code does not
9471 match the specified code, return false. Otherwise continue
9472 checking any remaining arguments. */
9477 }
9478 }
9481 /* We need gotos here since we can only have one VA_CLOSE in a
9482 function. */
9483 end: ;
9487 }
9489 /* Default target-specific builtin expander that does nothing. */
9491 rtx
9493 rtx target ATTRIBUTE_UNUSED,
9494 rtx subtarget ATTRIBUTE_UNUSED,
9495 machine_mode mode ATTRIBUTE_UNUSED,
9497 {
9499 }
9501 /* Returns true is EXP represents data that would potentially reside
9502 in a readonly section. */
9504 bool
9506 {
9516 /* Make sure we call decl_readonly_section only for trees it
9517 can handle (since it returns true for everything it doesn't
9518 understand). */
9523 else
9525 }
9527 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9528 to the call, and TYPE is its return type.
9530 Return NULL_TREE if no simplification was possible, otherwise return the
9531 simplified form of the call as a tree.
9533 The simplified form may be a constant or other expression which
9534 computes the same value, but in a more efficient manner (including
9535 calls to other builtin functions).
9537 The call may contain arguments which need to be evaluated, but
9538 which are not useful to determine the result of the call. In
9539 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9540 COMPOUND_EXPR will be an argument which must be evaluated.
9541 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9542 COMPOUND_EXPR in the chain will contain the tree for the simplified
9543 form of the builtin function call. */
9545 static tree
9547 {
9551 else
9552 {
9553 tree fn;
9562 {
9564 tree tem;
9569 /* Return an offset into the constant string argument. */
9572 }
9575 /* strpbrk(x, "") == NULL.
9576 Evaluate and ignore s1 in case it had side-effects. */
9586 /* New argument list transforming strpbrk(s1, s2) to
9587 strchr(s1, s2[0]). */
9590 }
9591 }
9593 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9594 to the call.
9596 Return NULL_TREE if no simplification was possible, otherwise return the
9597 simplified form of the call as a tree.
9599 The simplified form may be a constant or other expression which
9600 computes the same value, but in a more efficient manner (including
9601 calls to other builtin functions).
9603 The call may contain arguments which need to be evaluated, but
9604 which are not useful to determine the result of the call. In
9605 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9606 COMPOUND_EXPR will be an argument which must be evaluated.
9607 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9608 COMPOUND_EXPR in the chain will contain the tree for the simplified
9609 form of the builtin function call. */
9611 static tree
9613 {
9617 else
9618 {
9621 /* If either argument is "", return NULL_TREE. */
9623 /* Evaluate and ignore both arguments in case either one has
9624 side-effects. */
9628 }
9629 }
9631 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9632 to the call.
9634 Return NULL_TREE if no simplification was possible, otherwise return the
9635 simplified form of the call as a tree.
9637 The simplified form may be a constant or other expression which
9638 computes the same value, but in a more efficient manner (including
9639 calls to other builtin functions).
9641 The call may contain arguments which need to be evaluated, but
9642 which are not useful to determine the result of the call. In
9643 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9644 COMPOUND_EXPR will be an argument which must be evaluated.
9645 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9646 COMPOUND_EXPR in the chain will contain the tree for the simplified
9647 form of the builtin function call. */
9649 static tree
9651 {
9655 else
9656 {
9657 /* If the first argument is "", return NULL_TREE. */
9660 {
9661 /* Evaluate and ignore argument s2 in case it has
9662 side-effects. */
9665 }
9667 /* If the second argument is "", return __builtin_strlen(s1). */
9670 {
9673 /* If the replacement _DECL isn't initialized, don't do the
9674 transformation. */
9679 }
9681 }
9682 }
9684 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9685 produced. False otherwise. This is done so that we don't output the error
9686 or warning twice or three times. */
9688 bool
9690 {
9693 tree arg;
9694 /* There is good chance the current input_location points inside the
9695 definition of the va_start macro (perhaps on the token for
9696 builtin) in a system header, so warnings will not be emitted.
9697 Use the location in real source code. */
9698 source_location current_location =
9700 NULL);
9703 {
9706 }
9709 {
9711 {
9714 }
9716 }
9717 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9718 when we checked the arguments and if needed issued a warning. */
9719 else
9720 {
9722 {
9723 /* Evidently an out of date version of <stdarg.h>; can't validate
9724 va_start's second argument, but can still work as intended. */
9726 OPT_Wvarargs,
9729 }
9731 {
9734 }
9736 }
9741 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9742 or __builtin_next_arg (0) the first time we see it, after checking
9743 the arguments and if needed issuing a warning. */
9745 {
9748 /* Strip off all nops for the sake of the comparison. This
9749 is not quite the same as STRIP_NOPS. It does more.
9750 We must also strip off INDIRECT_EXPR for C++ reference
9751 parameters. */
9756 {
9757 /* FIXME: Sometimes with the tree optimizers we can get the
9758 not the last argument even though the user used the last
9759 argument. We just warn and set the arg to be the last
9760 argument so that we will get wrong-code because of
9761 it. */
9763 OPT_Wvarargs,
9765 }
9767 /* Undefined by C99 7.15.1.4p4 (va_start):
9768 "If the parameter parmN is declared with the register storage
9769 class, with a function or array type, or with a type that is
9770 not compatible with the type that results after application of
9771 the default argument promotions, the behavior is undefined."
9772 */
9774 {
9776 OPT_Wvarargs,
9777 "undefined behavior when second parameter of "
9779 }
9781 /* We want to verify the second parameter just once before the tree
9782 optimizers are run and then avoid keeping it in the tree,
9783 as otherwise we could warn even for correct code like:
9784 void foo (int i, ...)
9785 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9788 else
9790 }
9792 }
9795 /* Expand a call EXP to __builtin_object_size. */
9797 static rtx
9799 {
9800 tree ost;
9805 {
9810 }
9818 {
9823 }
9828 }
9830 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9831 FCODE is the BUILT_IN_* to use.
9832 Return NULL_RTX if we failed; the caller should emit a normal call,
9833 otherwise try to get the result in TARGET, if convenient (and in
9834 mode MODE if that's convenient). */
9836 static rtx
9839 {
9841 POINTER_TYPE,
9842 fcode == BUILT_IN_MEMSET_CHK
9859 {
9860 /* Avoid transforming the checking call to an ordinary one when
9861 an overflow has been detected or when the call couldn't be
9862 validated because the size is not constant. */
9867 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9868 mem{cpy,pcpy,move,set} is available. */
9870 {
9885 }
9894 }
9897 else
9898 {
9901 /* If DEST is not a pointer type, call the normal function. */
9905 /* If SRC and DEST are the same (and not volatile), do nothing. */
9907 {
9908 tree expr;
9911 {
9912 /* Evaluate and ignore LEN in case it has side-effects. */
9915 }
9919 }
9921 /* __memmove_chk special case. */
9923 {
9929 /* If src is categorized for a readonly section we can use
9930 normal __memcpy_chk. */
9932 {
9941 }
9942 }
9944 }
9945 }
9947 /* Emit warning if a buffer overflow is detected at compile time. */
9949 static void
9951 {
9952 /* The source string. */
9954 /* The size of the destination object. */
9956 /* The string that is being concatenated with (as in __strcat_chk)
9957 or null if it isn't. */
9959 /* The maximum length of the source sequence in a bounded operation
9960 (such as __strncat_chk) or null if the operation isn't bounded
9961 (such as __strcat_chk). */
9963 /* The exact size of the access (such as in __strncpy_chk). */
9967 {
9975 /* For __strcat_chk the warning will be emitted only if overflowing
9976 by at least strlen (dest) + 1 bytes. */
10003 }
10006 {
10007 /* Check __strncat_chk. There is no way to determine the length
10008 of the string to which the source string is being appended so
10009 just warn when the length of the source string is not known. */
10012 }
10014 /* The destination argument is the first one for all built-ins above. */
10018 }
10020 /* Emit warning if a buffer overflow is detected at compile time
10021 in __sprintf_chk/__vsprintf_chk calls. */
10023 static void
10025 {
10030 /* Verify the required arguments in the original call. */
10040 /* Check whether the format is a literal string constant. */
10048 /* If the format doesn't contain % args or %%, we know its size. */
10051 /* If the format is "%s" and first ... argument is a string literal,
10052 we know it too. */
10055 {
10056 tree arg;
10067 }
10068 else
10071 /* Add one for the terminating nul. */
10076 }
10078 /* Emit warning if a free is called with address of a variable. */
10080 static void
10082 {
10096 else
10099 }
10101 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10102 if possible. */
10104 static tree
10106 {
10123 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10124 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10125 and (size_t) 0 for types 2 and 3. */
10130 {
10134 }
10136 {
10137 /* If object size is not known yet, delay folding until
10138 later. Maybe subsequent passes will help determining
10139 it. */
10143 }
10146 }
10148 /* Builtins with folding operations that operate on "..." arguments
10149 need special handling; we need to store the arguments in a convenient
10150 data structure before attempting any folding. Fortunately there are
10151 only a few builtins that fall into this category. FNDECL is the
10152 function, EXP is the CALL_EXPR for the call. */
10154 static tree
10156 {
10161 {
10168 }
10170 {
10175 }
10177 }
10179 /* Initialize format string characters in the target charset. */
10181 bool
10183 {
10186 {
10209 }
10211 }
10213 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10214 and no overflow/underflow occurred. INEXACT is true if M was not
10215 exactly calculated. TYPE is the tree type for the result. This
10216 function assumes that you cleared the MPFR flags and then
10217 calculated M to see if anything subsequently set a flag prior to
10218 entering this function. Return NULL_TREE if any checks fail. */
10220 static tree
10222 {
10223 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10224 overflow/underflow occurred. If -frounding-math, proceed iff the
10225 result of calling FUNC was exact. */
10228 {
10229 REAL_VALUE_TYPE rr;
10232 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10233 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10234 but the mpft_t is not, then we underflowed in the
10235 conversion. */
10238 {
10239 REAL_VALUE_TYPE rmode;
10242 /* Proceed iff the specified mode can hold the value. */
10245 }
10246 }
10248 }
10250 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10251 number and no overflow/underflow occurred. INEXACT is true if M
10252 was not exactly calculated. TYPE is the tree type for the result.
10253 This function assumes that you cleared the MPFR flags and then
10254 calculated M to see if anything subsequently set a flag prior to
10255 entering this function. Return NULL_TREE if any checks fail, if
10256 FORCE_CONVERT is true, then bypass the checks. */
10258 static tree
10260 {
10261 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10262 overflow/underflow occurred. If -frounding-math, proceed iff the
10263 result of calling FUNC was exact. */
10268 {
10273 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10274 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10275 but the mpft_t is not, then we underflowed in the
10276 conversion. */
10281 {
10286 /* Proceed iff the specified mode can hold the value. */
10292 }
10293 }
10295 }
10297 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10298 the pointer *(ARG_QUO) and return the result. The type is taken
10299 from the type of ARG0 and is used for setting the precision of the
10300 calculation and results. */
10302 static tree
10304 {
10311 /* To proceed, MPFR must exactly represent the target floating point
10312 format, which only happens when the target base equals two. */
10316 {
10321 {
10325 tree result_rem;
10334 /* Remquo is independent of the rounding mode, so pass
10335 inexact=0 to do_mpfr_ckconv(). */
10339 {
10340 /* MPFR calculates quo in the host's long so it may
10341 return more bits in quo than the target int can hold
10342 if sizeof(host long) > sizeof(target int). This can
10343 happen even for native compilers in LP64 mode. In
10344 these cases, modulo the quo value with the largest
10345 number that the target int can hold while leaving one
10346 bit for the sign. */
10350 /* Dereference the quo pointer argument. */
10352 /* Proceed iff a valid pointer type was passed in. */
10354 {
10355 /* Set the value. */
10356 tree result_quo
10359 integer_quo));
10361 /* Combine the quo assignment with the rem. */
10364 }
10365 }
10366 }
10367 }
10369 }
10371 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10372 resulting value as a tree with type TYPE. The mpfr precision is
10373 set to the precision of TYPE. We assume that this mpfr function
10374 returns zero if the result could be calculated exactly within the
10375 requested precision. In addition, the integer pointer represented
10376 by ARG_SG will be dereferenced and set to the appropriate signgam
10377 (-1,1) value. */
10379 static tree
10381 {
10386 /* To proceed, MPFR must exactly represent the target floating point
10387 format, which only happens when the target base equals two. Also
10388 verify ARG is a constant and that ARG_SG is an int pointer. */
10393 {
10396 /* In addition to NaN and Inf, the argument cannot be zero or a
10397 negative integer. */
10401 {
10406 mpfr_t m;
10407 tree result_lg;
10416 {
10417 tree result_sg;
10419 /* Dereference the arg_sg pointer argument. */
10421 /* Assign the signgam value into *arg_sg. */
10426 /* Combine the signgam assignment with the lgamma result. */
10429 }
10430 }
10431 }
10434 }
10436 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10437 mpc function FUNC on it and return the resulting value as a tree
10438 with type TYPE. The mpfr precision is set to the precision of
10439 TYPE. We assume that function FUNC returns zero if the result
10440 could be calculated exactly within the requested precision. If
10441 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10442 in the arguments and/or results. */
10444 tree
10447 {
10453 /* To proceed, MPFR must exactly represent the target floating point
10454 format, which only happens when the target base equals two. */
10460 {
10469 {
10489 }
10490 }
10493 }
10495 /* A wrapper function for builtin folding that prevents warnings for
10496 "statement without effect" and the like, caused by removing the
10497 call node earlier than the warning is generated. */
10499 tree
10501 {
10509 {
10518 {
10520 }
10521 else
10522 {
10525 {
10526 /* Propagate location information from original call to
10527 expansion of builtin. Otherwise things like
10528 maybe_emit_chk_warning, that operate on the expansion
10529 of a builtin, will use the wrong location information. */
10531 {
10539 }
10541 }
10542 }
10543 }
10545 }
10547 /* Look up the function in builtin_decl that corresponds to DECL
10548 and set ASMSPEC as its user assembler name. DECL must be a
10549 function decl that declares a builtin. */
10551 void
10553 {
10563 {
10567 }
10568 }
10570 /* Return true if DECL is a builtin that expands to a constant or similarly
10571 simple code. */
10572 bool
10574 {
10577 {
10578 /* Builtins that expand to constants. */
10583 /* Simple register moves or loads from stack. */
10594 /* Exception state returns or moves registers around. */
10602 }
10605 }
10607 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10608 most probably expanded inline into reasonably simple code. This is a
10609 superset of is_simple_builtin. */
10610 bool
10612 {
10619 {
10621 CASE_BUILT_IN_ALLOCA:
10687 }
10690 }
10692 /* Return true if T is a constant and the value cast to a target char
10693 can be represented by a host char.
10694 Store the casted char constant in *P if so. */
10696 bool
10698 {
10704 }
10706 /* Return the maximum object size. */
10708 tree
10710 {
10711 /* To do: Make this a configurable parameter. */
10713 }