| blob | 1d6e69d30ce6a2d0506c42a9c9b2933a114502ab |
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. */
75 #if SWITCHABLE_TARGET
77 #endif
79 /* Define the names of the builtin function types and codes. */
83 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
85 {
87 };
89 /* Setup an array of builtin_info_type, make sure each element decl is
90 initialized to NULL_TREE. */
93 /* Non-zero if __builtin_constant_p should be folded right away. */
195 /* Return true if NAME starts with __builtin_ or __sync_. */
197 static bool
199 {
207 }
210 /* Return true if DECL is a function symbol representing a built-in. */
212 bool
214 {
216 }
218 /* Return true if NODE should be considered for inline expansion regardless
219 of the optimization level. This means whenever a function is invoked with
220 its "internal" name, which normally contains the prefix "__builtin". */
222 bool
224 {
225 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
226 we want the name used to call the function, not the name it
227 will have. */
230 }
232 /* Compute values M and N such that M divides (address of EXP - N) and such
233 that N < M. If these numbers can be determined, store M in alignp and N in
234 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
235 *alignp and any bit-offset to *bitposp.
237 Note that the address (and thus the alignment) computed here is based
238 on the address to which a symbol resolves, whereas DECL_ALIGN is based
239 on the address at which an object is actually located. These two
240 addresses are not always the same. For example, on ARM targets,
241 the address &foo of a Thumb function foo() has the lowest bit set,
242 whereas foo() itself starts on an even address.
244 If ADDR_P is true we are taking the address of the memory reference EXP
245 and thus cannot rely on the access taking place. */
247 static bool
250 {
252 tree offset;
253 machine_mode mode;
258 /* Get the innermost object and the constant (bitpos) and possibly
259 variable (offset) offset of the access. */
263 /* Extract alignment information from the innermost object and
264 possibly adjust bitpos and offset. */
266 {
267 /* Function addresses can encode extra information besides their
268 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
269 allows the low bit to be used as a virtual bit, we know
270 that the address itself must be at least 2-byte aligned. */
273 }
275 ;
277 {
278 /* The alignment of a CONST_DECL is determined by its initializer. */
285 }
287 {
290 }
294 {
300 /* If the address is explicitely aligned, handle that. */
303 {
308 }
310 known_alignment
314 /* Re-apply explicit alignment to the bitpos. */
317 /* The alignment of the pointer operand in a TARGET_MEM_REF
318 has to take the variable offset parts into account. */
320 {
322 {
327 }
331 }
333 /* When EXP is an actual memory reference then we can use
334 TYPE_ALIGN of a pointer indirection to derive alignment.
335 Do so only if get_pointer_alignment_1 did not reveal absolute
336 alignment knowledge and if using that alignment would
337 improve the situation. */
343 else
344 {
345 /* Else adjust bitpos accordingly. */
350 }
351 }
353 {
354 /* STRING_CST are the only constant objects we allow to be not
355 wrapped inside a CONST_DECL. */
361 }
363 /* If there is a non-constant offset part extract the maximum
364 alignment that can prevail. */
366 {
369 {
373 }
374 }
376 /* Account for the alignment of runtime coefficients, so that the constant
377 bitpos is guaranteed to be accurate. */
380 {
383 }
388 }
390 /* For a memory reference expression EXP compute values M and N such that M
391 divides (&EXP - N) and such that N < M. If these numbers can be determined,
392 store M in alignp and N in *BITPOSP and return true. Otherwise return false
393 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
395 bool
398 {
400 }
402 /* Return the alignment in bits of EXP, an object. */
404 unsigned int
406 {
412 /* align and bitpos now specify known low bits of the pointer.
413 ptr & (align - 1) == bitpos. */
418 }
420 /* For a pointer valued expression EXP compute values M and N such that M
421 divides (EXP - N) and such that N < M. If these numbers can be determined,
422 store M in alignp and N in *BITPOSP and return true. Return false if
423 the results are just a conservative approximation.
425 If EXP is not a pointer, false is returned too. */
427 bool
430 {
437 {
444 else
445 {
448 {
452 }
453 }
457 }
460 {
465 {
468 /* Make sure to return a sensible alignment when the multiplication
469 by BITS_PER_UNIT overflowed. */
472 /* We cannot really tell whether this result is an approximation. */
474 }
475 else
476 {
480 }
481 }
483 {
488 }
493 }
495 /* Return the alignment in bits of EXP, a pointer valued expression.
496 The alignment returned is, by default, the alignment of the thing that
497 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
499 Otherwise, look at the expression to see if we can do better, i.e., if the
500 expression is actually pointing at an object whose alignment is tighter. */
502 unsigned int
504 {
510 /* align and bitpos now specify known low bits of the pointer.
511 ptr & (align - 1) == bitpos. */
517 }
519 /* Return the number of non-zero elements in the sequence
520 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
521 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
523 static unsigned
525 {
531 {
532 /* Optimize the common case of plain char. */
534 {
538 }
539 }
540 else
541 {
543 {
547 }
548 }
550 }
552 /* Compute the length of a null-terminated character string or wide
553 character string handling character sizes of 1, 2, and 4 bytes.
554 TREE_STRING_LENGTH is not the right way because it evaluates to
555 the size of the character array in bytes (as opposed to characters)
556 and because it can contain a zero byte in the middle.
558 ONLY_VALUE should be nonzero if the result is not going to be emitted
559 into the instruction stream and zero if it is going to be expanded.
560 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
561 is returned, otherwise NULL, since
562 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
563 evaluate the side-effects.
565 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
566 accesses. Note that this implies the result is not going to be emitted
567 into the instruction stream.
569 The value returned is of type `ssizetype'.
571 Unfortunately, string_constant can't access the values of const char
572 arrays with initializers, so neither can we do so here. */
574 tree
576 {
580 {
587 }
595 /* Offset from the beginning of the string in bytes. */
596 tree byteoff;
601 /* Determine the size of the string element. */
602 unsigned eltsize
605 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
606 length of SRC. */
609 /* PTR can point to the byte representation of any string type, including
610 char* and wchar_t*. */
614 {
615 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
616 compute the offset to the following null if we don't know where to
617 start searching for it. */
619 {
620 /* Return when an embedded null character is found. */
622 }
624 /* We don't know the starting offset, but we do know that the string
625 has no internal zero bytes. We can assume that the offset falls
626 within the bounds of the string; otherwise, the programmer deserves
627 what he gets. Subtract the offset from the length of the string,
628 and return that. This would perhaps not be valid if we were dealing
629 with named arrays in addition to literal string constants. */
632 }
634 /* Offset from the beginning of the string in elements. */
635 HOST_WIDE_INT eltoff;
637 /* We have a known offset into the string. Start searching there for
638 a null character if we can represent it as a single HOST_WIDE_INT. */
643 else
646 /* If the offset is known to be out of bounds, warn, and call strlen at
647 runtime. */
649 {
650 /* Suppress multiple warnings for propagated constant strings. */
653 {
655 eltoff);
657 }
659 }
661 /* Use strlen to search for the first zero byte. Since any strings
662 constructed with build_string will have nulls appended, we win even
663 if we get handed something like (char[4])"abcd".
665 Since ELTOFF is our starting index into the string, no further
666 calculation is needed. */
671 }
673 /* Return a constant integer corresponding to target reading
674 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
676 static rtx
678 {
679 HOST_WIDE_INT ch;
693 {
705 }
709 }
711 /* Cast a target constant CST to target CHAR and if that value fits into
712 host char type, return zero and put that value into variable pointed to by
713 P. */
715 static int
717 {
724 /* Do not care if it fits or not right here. */
739 }
741 /* Similar to save_expr, but assumes that arbitrary code is not executed
742 in between the multiple evaluations. In particular, we assume that a
743 non-addressable local variable will not be modified. */
745 static tree
747 {
755 }
757 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
758 times to get the address of either a higher stack frame, or a return
759 address located within it (depending on FNDECL_CODE). */
761 static rtx
763 {
767 {
768 /* For a zero count with __builtin_return_address, we don't care what
769 frame address we return, because target-specific definitions will
770 override us. Therefore frame pointer elimination is OK, and using
771 the soft frame pointer is OK.
773 For a nonzero count, or a zero count with __builtin_frame_address,
774 we require a stable offset from the current frame pointer to the
775 previous one, so we must use the hard frame pointer, and
776 we must disable frame pointer elimination. */
779 else
780 {
783 /* Tell reload not to eliminate the frame pointer. */
785 }
786 }
791 /* On the SPARC, the return address is not in the frame, it is in a
792 register. There is no way to access it off of the current frame
793 pointer, but it can be accessed off the previous frame pointer by
794 reading the value from the register window save area. */
796 count--;
798 /* Scan back COUNT frames to the specified frame. */
800 {
801 /* Assume the dynamic chain pointer is in the word that the
802 frame address points to, unless otherwise specified. */
807 }
809 /* For __builtin_frame_address, return what we've got. But, on
810 the SPARC for example, we may have to add a bias. */
814 /* For __builtin_return_address, get the return address from that frame. */
815 #ifdef RETURN_ADDR_RTX
817 #else
821 #endif
823 }
825 /* Alias set used for setjmp buffer. */
828 /* Construct the leading half of a __builtin_setjmp call. Control will
829 return to RECEIVER_LABEL. This is also called directly by the SJLJ
830 exception handling code. */
832 void
834 {
836 rtx stack_save;
837 rtx mem;
846 /* We store the frame pointer and the address of receiver_label in
847 the buffer and use the rest of it for the stack save area, which
848 is machine-dependent. */
867 /* If there is further processing to do, do it. */
871 /* We have a nonlocal label. */
873 }
875 /* Construct the trailing part of a __builtin_setjmp call. This is
876 also called directly by the SJLJ exception handling code.
877 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
879 void
881 {
882 rtx chain;
884 /* Mark the FP as used when we get here, so we have to make sure it's
885 marked as used by this function. */
888 /* Mark the static chain as clobbered here so life information
889 doesn't get messed up for it. */
894 /* Now put in the code to restore the frame pointer, and argument
895 pointer, if needed. */
897 {
898 /* First adjust our frame pointer to its actual value. It was
899 previously set to the start of the virtual area corresponding to
900 the stacked variables when we branched here and now needs to be
901 adjusted to the actual hardware fp value.
903 Assignments to virtual registers are converted by
904 instantiate_virtual_regs into the corresponding assignment
905 to the underlying register (fp in this case) that makes
906 the original assignment true.
907 So the following insn will actually be decrementing fp by
908 TARGET_STARTING_FRAME_OFFSET. */
911 /* Restoring the frame pointer also modifies the hard frame pointer.
912 Mark it used (so that the previous assignment remains live once
913 the frame pointer is eliminated) and clobbered (to represent the
914 implicit update from the assignment). */
917 }
920 {
921 /* If the argument pointer can be eliminated in favor of the
922 frame pointer, we don't need to restore it. We assume here
923 that if such an elimination is present, it can always be used.
924 This is the case on all known machines; if we don't make this
925 assumption, we do unnecessary saving on many machines. */
935 {
936 /* Now restore our arg pointer from the address at which it
937 was saved in our stack frame. */
940 }
941 }
947 else
950 /* We must not allow the code we just generated to be reordered by
951 scheduling. Specifically, the update of the frame pointer must
952 happen immediately, not later. */
954 }
956 /* __builtin_longjmp is passed a pointer to an array of five words (not
957 all will be used on all machines). It operates similarly to the C
958 library function of the same name, but is more efficient. Much of
959 the code below is copied from the handling of non-local gotos. */
961 static void
963 {
968 /* DRAP is needed for stack realign if longjmp is expanded to current
969 function */
980 /* We require that the user must pass a second argument of 1, because
981 that is what builtin_setjmp will return. */
987 else
988 {
999 /* Pick up FP, label, and SP from the block and jump. This code is
1000 from expand_goto in stmt.c; see there for detailed comments. */
1002 /* We have to pass a value to the nonlocal_goto pattern that will
1003 get copied into the static_chain pointer, but it does not matter
1004 what that value is, because builtin_setjmp does not use it. */
1006 else
1007 {
1019 }
1020 }
1022 /* Search backwards and mark the jump insn as a non-local goto.
1023 Note that this precludes the use of __builtin_longjmp to a
1024 __builtin_setjmp target in the same function. However, we've
1025 already cautioned the user that these functions are for
1026 internal exception handling use only. */
1028 {
1032 {
1035 }
1038 }
1039 }
1043 {
1045 }
1047 /* This function validates the types of a function call argument list
1048 against a specified list of tree_codes. If the last specifier is a 0,
1049 that represents an ellipsis, otherwise the last specifier must be a
1050 VOID_TYPE. */
1052 static bool
1054 {
1058 const_call_expr_arg_iterator iter;
1059 const_tree arg;
1064 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1069 {
1073 {
1075 /* This signifies an ellipses, any further arguments are all ok. */
1079 /* This signifies an endlink, if no arguments remain, return
1080 true, otherwise return false. */
1084 /* The actual argument must be nonnull when either the whole
1085 called function has been declared nonnull, or when the formal
1086 argument corresponding to the actual argument has been. */
1089 {
1094 }
1095 /* FALLTHRU */
1097 /* If no parameters remain or the parameter's code does not
1098 match the specified code, return false. Otherwise continue
1099 checking any remaining arguments. */
1104 }
1105 }
1107 /* We need gotos here since we can only have one VA_CLOSE in a
1108 function. */
1109 end: ;
1115 }
1117 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1118 and the address of the save area. */
1120 static rtx
1122 {
1137 /* Copy the address of the save location to a register just in case it was
1138 based on the frame pointer. */
1147 /* ??? We no longer need to pass the static chain value, afaik. */
1150 else
1151 {
1157 /* Restore frame pointer for containing function. */
1161 /* USE of hard_frame_pointer_rtx added for consistency;
1162 not clear if really needed. */
1166 /* If the architecture is using a GP register, we must
1167 conservatively assume that the target function makes use of it.
1168 The prologue of functions with nonlocal gotos must therefore
1169 initialize the GP register to the appropriate value, and we
1170 must then make sure that this value is live at the point
1171 of the jump. (Note that this doesn't necessarily apply
1172 to targets with a nonlocal_goto pattern; they are free
1173 to implement it in their own way. Note also that this is
1174 a no-op if the GP register is a global invariant.) */
1180 }
1182 /* Search backwards to the jump insn and mark it as a
1183 non-local goto. */
1185 {
1187 {
1190 }
1193 }
1196 }
1198 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1199 (not all will be used on all machines) that was passed to __builtin_setjmp.
1200 It updates the stack pointer in that block to the current value. This is
1201 also called directly by the SJLJ exception handling code. */
1203 void
1205 {
1208 rtx stack_save
1210 memory_address
1216 }
1218 /* Expand a call to __builtin_prefetch. For a target that does not support
1219 data prefetch, evaluate the memory address argument in case it has side
1220 effects. */
1222 static void
1224 {
1234 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1235 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1236 locality). */
1240 else
1244 else
1247 /* Argument 0 is an address. */
1250 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1252 {
1255 }
1257 /* Argument 1 must be either zero or one. */
1259 {
1263 }
1265 /* Argument 2 (locality) must be a compile-time constant int. */
1267 {
1270 }
1272 /* Argument 2 must be 0, 1, 2, or 3. */
1274 {
1277 }
1280 {
1288 }
1290 /* Don't do anything with direct references to volatile memory, but
1291 generate code to handle other side effects. */
1294 }
1296 /* Get a MEM rtx for expression EXP which is the address of an operand
1297 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1298 the maximum length of the block of memory that might be accessed or
1299 NULL if unknown. */
1301 static rtx
1303 {
1307 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1308 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1315 /* Get an expression we can use to find the attributes to assign to MEM.
1316 First remove any nops. */
1321 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1322 (as builtin stringops may alias with anything). */
1329 /* If the MEM_REF has no acceptable address, try to get the base object
1330 from the original address we got, and build an all-aliasing
1331 unknown-sized access to that one. */
1337 {
1342 size_zero_node,
1343 NULL)),
1346 }
1349 }
1350 \f
1351 /* Built-in functions to perform an untyped call and return. */
1353 #define apply_args_mode \
1354 (this_target_builtins->x_apply_args_mode)
1355 #define apply_result_mode \
1356 (this_target_builtins->x_apply_result_mode)
1358 /* Return the size required for the block returned by __builtin_apply_args,
1359 and initialize apply_args_mode. */
1361 static int
1363 {
1368 /* The values computed by this function never change. */
1370 {
1371 /* The first value is the incoming arg-pointer. */
1374 /* The second value is the structure value address unless this is
1375 passed as an "invisible" first argument. */
1381 {
1391 }
1392 else
1393 {
1395 }
1396 }
1398 }
1400 /* Return the size required for the block returned by __builtin_apply,
1401 and initialize apply_result_mode. */
1403 static int
1405 {
1409 /* The values computed by this function never change. */
1411 {
1416 {
1426 }
1427 else
1430 /* Allow targets that use untyped_call and untyped_return to override
1431 the size so that machine-specific information can be stored here. */
1432 #ifdef APPLY_RESULT_SIZE
1434 #endif
1435 }
1437 }
1439 /* Create a vector describing the result block RESULT. If SAVEP is true,
1440 the result block is used to save the values; otherwise it is used to
1441 restore the values. */
1443 static rtx
1445 {
1447 fixed_size_mode mode;
1454 {
1464 }
1466 }
1468 /* Save the state required to perform an untyped call with the same
1469 arguments as were passed to the current function. */
1471 static rtx
1473 {
1476 fixed_size_mode mode;
1477 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1479 /* Create a block where the arg-pointer, structure value address,
1480 and argument registers can be saved. */
1483 /* Walk past the arg-pointer and structure value address. */
1488 /* Save each register used in calling a function to the block. */
1491 {
1500 }
1502 /* Save the arg pointer to the block. */
1504 /* We need the pointer as the caller actually passed them to us, not
1505 as we might have pretended they were passed. Make sure it's a valid
1506 operand, as emit_move_insn isn't expected to handle a PLUS. */
1508 tem
1511 NULL_RTX);
1516 /* Save the structure value address unless this is passed as an
1517 "invisible" first argument. */
1519 {
1523 }
1525 /* Return the address of the block. */
1527 }
1529 /* __builtin_apply_args returns block of memory allocated on
1530 the stack into which is stored the arg pointer, structure
1531 value address, static chain, and all the registers that might
1532 possibly be used in performing a function call. The code is
1533 moved to the start of the function so the incoming values are
1534 saved. */
1536 static rtx
1538 {
1539 /* Don't do __builtin_apply_args more than once in a function.
1540 Save the result of the first call and reuse it. */
1543 {
1544 /* When this function is called, it means that registers must be
1545 saved on entry to this function. So we migrate the
1546 call to the first insn of this function. */
1547 rtx temp;
1556 /* Put the insns after the NOTE that starts the function.
1557 If this is inside a start_sequence, make the outer-level insn
1558 chain current, so the code is placed at the start of the
1559 function. If internal_arg_pointer is a non-virtual pseudo,
1560 it needs to be placed after the function that initializes
1561 that pseudo. */
1566 else
1570 }
1571 }
1573 /* Perform an untyped call and save the state required to perform an
1574 untyped return of whatever value was returned by the given function. */
1576 static rtx
1578 {
1580 fixed_size_mode mode;
1589 /* Create a block where the return registers can be saved. */
1592 /* Fetch the arg pointer from the ARGUMENTS block. */
1599 /* Push a new argument block and copy the arguments. Do not allow
1600 the (potential) memcpy call below to interfere with our stack
1601 manipulations. */
1603 NO_DEFER_POP;
1605 /* Save the stack with nonlocal if available. */
1608 else
1611 /* Allocate a block of memory onto the stack and copy the memory
1612 arguments to the outgoing arguments address. We can pass TRUE
1613 as the 4th argument because we just saved the stack pointer
1614 and will restore it right after the call. */
1617 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1618 may have already set current_function_calls_alloca to true.
1619 current_function_calls_alloca won't be set if argsize is zero,
1620 so we have to guarantee need_drap is true here. */
1626 {
1629 else
1631 }
1638 /* Refer to the argument block. */
1643 /* Walk past the arg-pointer and structure value address. */
1648 /* Restore each of the registers previously saved. Make USE insns
1649 for each of these registers for use in making the call. */
1652 {
1660 }
1662 /* Restore the structure value address unless this is passed as an
1663 "invisible" first argument. */
1666 {
1673 }
1675 /* All arguments and registers used for the call are set up by now! */
1678 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1679 and we don't want to load it into a register as an optimization,
1680 because prepare_call_address already did it if it should be done. */
1684 /* Generate the actual call instruction and save the return value. */
1686 {
1690 }
1692 {
1695 /* Locate the unique return register. It is not possible to
1696 express a call that sets more than one return register using
1697 call_value; use untyped_call for that. In fact, untyped_call
1698 only needs to save the return registers in the given block. */
1701 {
1705 }
1712 }
1713 else
1716 /* Find the CALL insn we just emitted, and attach the register usage
1717 information. */
1721 /* Restore the stack. */
1724 else
1728 OK_DEFER_POP;
1730 /* Return the address of the result block. */
1733 }
1735 /* Perform an untyped return. */
1737 static void
1739 {
1741 fixed_size_mode mode;
1742 rtx reg;
1751 {
1756 }
1758 /* Restore the return value and note that each value is used. */
1762 {
1774 }
1776 /* Put the USE insns before the return. */
1779 /* Return whatever values was restored by jumping directly to the end
1780 of the function. */
1782 }
1784 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1786 static enum type_class
1788 {
1790 {
1809 }
1810 }
1812 /* Expand a call EXP to __builtin_classify_type. */
1814 static rtx
1816 {
1820 }
1822 /* This helper macro, meant to be used in mathfn_built_in below, determines
1823 which among a set of builtin math functions is appropriate for a given type
1824 mode. The `F' (float) and `L' (long double) are automatically generated
1825 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1826 types, there are additional types that are considered with 'F32', 'F64',
1827 'F128', etc. suffixes. */
1828 #define CASE_MATHFN(MATHFN) \
1829 CASE_CFN_##MATHFN: \
1830 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1831 fcodel = BUILT_IN_##MATHFN##L ; break;
1832 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1833 types. */
1834 #define CASE_MATHFN_FLOATN(MATHFN) \
1835 CASE_CFN_##MATHFN: \
1836 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1837 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1838 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1839 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1840 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1841 break;
1842 /* Similar to above, but appends _R after any F/L suffix. */
1843 #define CASE_MATHFN_REENT(MATHFN) \
1844 case CFN_BUILT_IN_##MATHFN##_R: \
1845 case CFN_BUILT_IN_##MATHFN##F_R: \
1846 case CFN_BUILT_IN_##MATHFN##L_R: \
1847 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1848 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1850 /* Return a function equivalent to FN but operating on floating-point
1851 values of type TYPE, or END_BUILTINS if no such function exists.
1852 This is purely an operation on function codes; it does not guarantee
1853 that the target actually has an implementation of the function. */
1855 static built_in_function
1857 {
1858 tree mtype;
1869 {
1960 }
1983 else
1985 }
1987 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1988 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1989 otherwise use the explicit declaration. If we can't do the conversion,
1990 return null. */
1992 static tree
1994 {
2003 }
2005 /* Like mathfn_built_in_1, but always use the implicit array. */
2007 tree
2009 {
2011 }
2013 /* Like mathfn_built_in_1, but take a built_in_function and
2014 always use the implicit array. */
2016 tree
2018 {
2020 }
2022 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2023 return its code, otherwise return IFN_LAST. Note that this function
2024 only tests whether the function is defined in internals.def, not whether
2025 it is actually available on the target. */
2027 internal_fn
2029 {
2033 {
2034 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2035 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2036 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2037 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2038 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2039 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2040 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2057 }
2058 }
2060 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2061 on the current target by a call to an internal function, return the
2062 code of that internal function, otherwise return IFN_LAST. The caller
2063 is responsible for ensuring that any side-effects of the built-in
2064 call are dealt with correctly. E.g. if CALL sets errno, the caller
2065 must decide that the errno result isn't needed or make it available
2066 in some other way. */
2068 internal_fn
2070 {
2072 {
2075 {
2080 }
2081 }
2083 }
2085 /* Expand a call to the builtin trinary math functions (fma).
2086 Return NULL_RTX if a normal call should be emitted rather than expanding the
2087 function in-line. EXP is the expression that is a call to the builtin
2088 function; if convenient, the result should be placed in TARGET.
2089 SUBTARGET may be used as the target for computing one of EXP's
2090 operands. */
2092 static rtx
2094 {
2095 optab builtin_optab;
2100 machine_mode mode;
2110 {
2116 }
2118 /* Make a suitable register to place result in. */
2121 /* Before working hard, check whether the instruction is available. */
2127 /* Always stabilize the argument list. */
2138 /* Compute into RESULT.
2139 Set RESULT to wherever the result comes back. */
2143 /* If we were unable to expand via the builtin, stop the sequence
2144 (without outputting the insns) and call to the library function
2145 with the stabilized argument list. */
2147 {
2150 }
2152 /* Output the entire sequence. */
2158 }
2160 /* Expand a call to the builtin sin and cos math functions.
2161 Return NULL_RTX if a normal call should be emitted rather than expanding the
2162 function in-line. EXP is the expression that is a call to the builtin
2163 function; if convenient, the result should be placed in TARGET.
2164 SUBTARGET may be used as the target for computing one of EXP's
2165 operands. */
2167 static rtx
2169 {
2170 optab builtin_optab;
2171 rtx op0;
2174 machine_mode mode;
2175 tree arg;
2183 {
2189 }
2191 /* Make a suitable register to place result in. */
2194 /* Check if sincos insn is available, otherwise fallback
2195 to sin or cos insn. */
2198 {
2205 }
2207 /* Before working hard, check whether the instruction is available. */
2209 {
2212 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2213 need to expand the argument again. This way, we will not perform
2214 side-effects more the once. */
2221 /* Compute into RESULT.
2222 Set RESULT to wherever the result comes back. */
2224 {
2228 {
2237 }
2239 }
2240 else
2244 {
2245 /* Output the entire sequence. */
2250 }
2252 /* If we were unable to expand via the builtin, stop the sequence
2253 (without outputting the insns) and call to the library function
2254 with the stabilized argument list. */
2256 }
2259 }
2261 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2262 return an RTL instruction code that implements the functionality.
2263 If that isn't possible or available return CODE_FOR_nothing. */
2265 static enum insn_code
2267 {
2270 machine_mode mode;
2273 {
2287 /* These builtins have no optabs (yet). */
2291 }
2293 /* There's no easy way to detect the case we need to set EDOM. */
2297 /* Optab mode depends on the mode of the input argument. */
2303 }
2305 /* Expand a call to one of the builtin math functions that operate on
2306 floating point argument and output an integer result (ilogb, isinf,
2307 isnan, etc).
2308 Return 0 if a normal call should be emitted rather than expanding the
2309 function in-line. EXP is the expression that is a call to the builtin
2310 function; if convenient, the result should be placed in TARGET. */
2312 static rtx
2314 {
2316 rtx op0;
2318 machine_mode mode;
2319 tree arg;
2329 {
2334 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2335 need to expand the argument again. This way, we will not perform
2336 side-effects more the once. */
2351 }
2354 }
2356 /* Expand a call to the builtin sincos math function.
2357 Return NULL_RTX if a normal call should be emitted rather than expanding the
2358 function in-line. EXP is the expression that is a call to the builtin
2359 function. */
2361 static rtx
2363 {
2365 machine_mode mode;
2379 /* Make a suitable register to place result in. */
2382 /* Check if sincos insn is available, otherwise emit the call. */
2397 /* Compute into target1 and target2.
2398 Set TARGET to wherever the result comes back. */
2402 /* Move target1 and target2 to the memory locations indicated
2403 by op1 and op2. */
2408 }
2410 /* Expand a call to the internal cexpi builtin to the sincos math function.
2411 EXP is the expression that is a call to the builtin function; if convenient,
2412 the result should be placed in TARGET. */
2414 static rtx
2416 {
2419 machine_mode mode;
2430 /* Try expanding via a sincos optab, fall back to emitting a libcall
2431 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2432 is only generated from sincos, cexp or if we have either of them. */
2434 {
2440 /* Compute into op1 and op2. */
2442 }
2444 {
2455 else
2465 /* Make sure not to fold the sincos call again. */
2469 }
2470 else
2471 {
2481 else
2484 /* If we don't have a decl for cexp create one. This is the
2485 friendliest fallback if the user calls __builtin_cexpi
2486 without full target C99 function support. */
2488 {
2489 tree fntype;
2501 }
2506 /* Make sure not to fold the cexp call again. */
2510 }
2512 /* Now build the proper return type. */
2517 }
2519 /* Conveniently construct a function call expression. FNDECL names the
2520 function to be called, N is the number of arguments, and the "..."
2521 parameters are the argument expressions. Unlike build_call_exr
2522 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2524 static tree
2526 {
2536 }
2538 /* Expand a call to one of the builtin rounding functions gcc defines
2539 as an extension (lfloor and lceil). As these are gcc extensions we
2540 do not need to worry about setting errno to EDOM.
2541 If expanding via optab fails, lower expression to (int)(floor(x)).
2542 EXP is the expression that is a call to the builtin function;
2543 if convenient, the result should be placed in TARGET. */
2545 static rtx
2547 {
2548 convert_optab builtin_optab;
2553 tree fallback_fndecl;
2554 machine_mode mode;
2555 tree arg;
2563 {
2580 }
2582 /* Make a suitable register to place result in. */
2587 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2588 need to expand the argument again. This way, we will not perform
2589 side-effects more the once. */
2596 /* Compute into TARGET. */
2598 {
2599 /* Output the entire sequence. */
2604 }
2606 /* If we were unable to expand via the builtin, stop the sequence
2607 (without outputting the insns). */
2610 /* Fall back to floating point rounding optab. */
2613 /* For non-C99 targets we may end up without a fallback fndecl here
2614 if the user called __builtin_lfloor directly. In this case emit
2615 a call to the floor/ceil variants nevertheless. This should result
2616 in the best user experience for not full C99 targets. */
2618 {
2619 tree fntype;
2623 {
2656 }
2661 }
2668 /* Truncate the result of floating point optab to integer
2669 via expand_fix (). */
2674 }
2676 /* Expand a call to one of the builtin math functions doing integer
2677 conversion (lrint).
2678 Return 0 if a normal call should be emitted rather than expanding the
2679 function in-line. EXP is the expression that is a call to the builtin
2680 function; if convenient, the result should be placed in TARGET. */
2682 static rtx
2684 {
2685 convert_optab builtin_optab;
2686 rtx op0;
2689 tree arg;
2690 machine_mode mode;
2699 {
2718 }
2720 /* There's no easy way to detect the case we need to set EDOM. */
2724 /* Make a suitable register to place result in. */
2727 /* There's no easy way to detect the case we need to set EDOM. */
2729 {
2732 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2733 need to expand the argument again. This way, we will not perform
2734 side-effects more the once. */
2742 {
2743 /* Output the entire sequence. */
2748 }
2750 /* If we were unable to expand via the builtin, stop the sequence
2751 (without outputting the insns) and call to the library function
2752 with the stabilized argument list. */
2754 }
2757 {
2758 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2759 targets, (int) round (x) should never be transformed into
2760 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2761 a call to lround in the hope that the target provides at least some
2762 C99 functions. This should result in the best user experience for
2763 not full C99 targets. */
2764 tree fallback_fndecl = mathfn_built_in_1
2773 }
2776 }
2778 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2779 a normal call should be emitted rather than expanding the function
2780 in-line. EXP is the expression that is a call to the builtin
2781 function; if convenient, the result should be placed in TARGET. */
2783 static rtx
2785 {
2788 machine_mode mode;
2789 machine_mode mode2;
2798 /* Emit a libcall to libgcc. */
2800 /* Mode of the 2nd argument must match that of an int. */
2818 }
2820 /* Expand expression EXP which is a call to the strlen builtin. Return
2821 NULL_RTX if we failed the caller should emit a normal call, otherwise
2822 try to get the result in TARGET, if convenient. */
2824 static rtx
2826 machine_mode target_mode)
2827 {
2832 rtx pat;
2833 tree len;
2835 rtx src_reg;
2837 machine_mode insn_mode;
2841 /* If the length can be computed at compile-time, return it. */
2846 /* If the length can be computed at compile-time and is constant
2847 integer, but there are side-effects in src, evaluate
2848 src for side-effects, then return len.
2849 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2850 can be optimized into: i++; x = 3; */
2853 {
2856 }
2860 /* If SRC is not a pointer type, don't do this operation inline. */
2864 /* Bail out if we can't compute strlen in the right mode. */
2866 {
2870 }
2874 /* Make a place to hold the source address. We will not expand
2875 the actual source until we are sure that the expansion will
2876 not fail -- there are trees that cannot be expanded twice. */
2879 /* Mark the beginning of the strlen sequence so we can emit the
2880 source operand later. */
2890 /* Check to see if the argument was declared attribute nonstring
2891 and if so, issue a warning since at this point it's not known
2892 to be nul-terminated. */
2895 /* Now that we are assured of success, expand the source. */
2899 {
2900 #ifdef POINTERS_EXTEND_UNSIGNED
2903 POINTERS_EXTEND_UNSIGNED);
2904 #endif
2906 }
2912 else
2915 /* Return the value in the proper mode for this function. */
2920 else
2924 }
2926 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2927 bytes from constant string DATA + OFFSET and return it as target
2928 constant. */
2930 static rtx
2932 scalar_int_mode mode)
2933 {
2941 }
2943 /* LEN specify length of the block of memcpy/memset operation.
2944 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2945 In some cases we can make very likely guess on max size, then we
2946 set it into PROBABLE_MAX_SIZE. */
2948 static void
2953 {
2955 {
2958 }
2959 else
2960 {
2964 /* Determine bounds from the type. */
2967 else
2972 else
2978 {
2983 }
2985 {
2986 /* Anti range 0...N lets us to determine minimal size to N+1. */
2988 {
2991 }
2992 /* Code like
2994 int n;
2995 if (n < 100)
2996 memcpy (a, b, n)
2998 Produce anti range allowing negative values of N. We still
2999 can use the information and make a guess that N is not negative.
3000 */
3003 }
3004 }
3008 }
3010 /* Try to verify that the sizes and lengths of the arguments to a string
3011 manipulation function given by EXP are within valid bounds and that
3012 the operation does not lead to buffer overflow or read past the end.
3013 Arguments other than EXP may be null. When non-null, the arguments
3014 have the following meaning:
3015 DST is the destination of a copy call or NULL otherwise.
3016 SRC is the source of a copy call or NULL otherwise.
3017 DSTWRITE is the number of bytes written into the destination obtained
3018 from the user-supplied size argument to the function (such as in
3019 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3020 MAXREAD is the user-supplied bound on the length of the source sequence
3021 (such as in strncat(d, s, N). It specifies the upper limit on the number
3022 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3023 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3024 expression EXP is a string function call (as opposed to a memory call
3025 like memcpy). As an exception, SRCSTR can also be an integer denoting
3026 the precomputed size of the source string or object (for functions like
3027 memcpy).
3028 DSTSIZE is the size of the destination object specified by the last
3029 argument to the _chk builtins, typically resulting from the expansion
3030 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3031 DSTSIZE).
3033 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3034 SIZE_MAX.
3036 If the call is successfully verified as safe return true, otherwise
3037 return false. */
3039 static bool
3042 {
3045 /* The size of the largest object is half the address space, or
3046 PTRDIFF_MAX. (This is way too permissive.) */
3049 /* Either the length of the source string for string functions or
3050 the size of the source object for raw memory functions. */
3055 /* Set to true when the exact number of bytes written by a string
3056 function like strcpy is not known and the only thing that is
3057 known is that it must be at least one (for the terminating nul). */
3060 {
3061 /* SRCSTR is normally a pointer to string but as a special case
3062 it can be an integer denoting the length of a string. */
3064 {
3065 /* Try to determine the range of lengths the source string
3066 refers to. If it can be determined and is less than
3067 the upper bound given by MAXREAD add one to it for
3068 the terminating nul. Otherwise, set it to one for
3069 the same reason, or to MAXREAD as appropriate. */
3072 {
3075 else
3086 }
3087 else
3088 {
3091 }
3092 }
3093 else
3095 }
3098 {
3099 /* When the only available piece of data is the object size
3100 there is nothing to do. */
3104 /* Otherwise, when the length of the source sequence is known
3105 (as with strlen), set DSTWRITE to it. */
3108 }
3118 /* First check the number of bytes to be written against the maximum
3119 object size. */
3121 {
3127 "%K%qD specified size %E "
3130 else
3132 "%K%qD specified size between %E and %E "
3137 }
3139 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3140 constant, and in range of unsigned HOST_WIDE_INT. */
3143 /* Next check the number of bytes to be written against the destination
3144 object size. */
3146 {
3152 {
3157 {
3158 /* This is a call to strcpy with a destination of 0 size
3159 and a source of unknown length. The call will write
3160 at least one byte past the end of the destination. */
3162 "%K%qD writing %E or more bytes into a region "
3165 }
3175 {
3176 /* Avoid printing the upper bound if it's invalid. */
3178 "%K%qD writing %E or more bytes into a region "
3181 }
3182 else
3184 "%K%qD writing between %E and %E bytes into "
3187 dstsize);
3189 /* Return error when an overflow has been detected. */
3191 }
3192 }
3194 /* Check the maximum length of the source sequence against the size
3195 of the destination object if known, or against the maximum size
3196 of an object. */
3198 {
3201 /* Use the lower end for MAXREAD from now on. */
3206 {
3211 {
3212 /* Warn about crazy big sizes first since that's more
3213 likely to be meaningful than saying that the bound
3214 is greater than the object size if both are big. */
3217 "%K%qD specified bound %E "
3221 else
3223 "%K%qD specified bound between %E and %E "
3229 }
3232 {
3235 "%K%qD specified bound %E "
3239 else
3241 "%K%qD specified bound between %E and %E "
3246 }
3247 }
3248 }
3250 /* Check for reading past the end of SRC. */
3255 {
3265 {
3266 /* Avoid printing the upper bound if it's invalid. */
3268 "%K%qD reading %E or more bytes from a region "
3271 }
3272 else
3274 "%K%qD reading between %E and %E bytes from a region "
3278 }
3281 }
3283 /* Helper to compute the size of the object referenced by the DEST
3284 expression which must have pointer type, using Object Size type
3285 OSTYPE (only the least significant 2 bits are used). Return
3286 an estimate of the size of the object if successful or NULL when
3287 the size cannot be determined. When the referenced object involves
3288 a non-constant offset in some range the returned value represents
3289 the largest size given the smallest non-negative offset in the
3290 range. The function is intended for diagnostics and should not
3291 be used to influence code generation or optimization. */
3293 tree
3295 {
3298 /* Only the two least significant bits are meaningful. */
3305 {
3314 {
3315 /* compute_builtin_object_size fails for addresses with
3316 non-constant offsets. Try to determine the range of
3317 such an offset here and use it to adjus the constant
3318 size. */
3322 {
3327 {
3329 {
3332 /* Ignore negative offsets for now. For others,
3333 use the lower bound as the most optimistic
3334 estimate of the (remaining)size. */
3336 ;
3340 else
3342 }
3343 }
3344 }
3345 }
3348 }
3350 /* Unless computing the largest size (for memcpy and other raw memory
3351 functions), try to determine the size of the object from its type. */
3366 {
3367 /* Return the constant size unless it's zero (that's a zero-length
3368 array likely at the end of a struct). */
3373 }
3376 }
3378 /* Helper to determine and check the sizes of the source and the destination
3379 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3380 call expression, DEST is the destination argument, SRC is the source
3381 argument or null, and LEN is the number of bytes. Use Object Size type-0
3382 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3383 (no overflow or invalid sizes), false otherwise. */
3385 static bool
3387 {
3388 /* For functions like memset and memcpy that operate on raw memory
3389 try to determine the size of the largest source and destination
3390 object using type-0 Object Size regardless of the object size
3391 type specified by the option. */
3397 }
3399 /* Validate memchr arguments without performing any expansion.
3400 Return NULL_RTX. */
3402 static rtx
3404 {
3412 /* Diagnose calls where the specified length exceeds the size
3413 of the object. */
3415 {
3419 }
3422 }
3424 /* Expand a call EXP to the memcpy builtin.
3425 Return NULL_RTX if we failed, the caller should emit a normal call,
3426 otherwise try to get the result in TARGET, if convenient (and in
3427 mode MODE if that's convenient). */
3429 static rtx
3431 {
3444 }
3446 /* Check a call EXP to the memmove built-in for validity.
3447 Return NULL_RTX on both success and failure. */
3449 static rtx
3451 {
3463 }
3465 /* Expand an instrumented call EXP to the memcpy builtin.
3466 Return NULL_RTX if we failed, the caller should emit a normal call,
3467 otherwise try to get the result in TARGET, if convenient (and in
3468 mode MODE if that's convenient). */
3470 static rtx
3472 {
3478 else
3479 {
3486 /* Return src bounds with the result. */
3488 {
3492 }
3494 }
3495 }
3497 /* Expand a call EXP to the mempcpy builtin.
3498 Return NULL_RTX if we failed; the caller should emit a normal call,
3499 otherwise try to get the result in TARGET, if convenient (and in
3500 mode MODE if that's convenient). If ENDP is 0 return the
3501 destination pointer, if ENDP is 1 return the end pointer ala
3502 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3503 stpcpy. */
3505 static rtx
3507 {
3516 /* Policy does not generally allow using compute_objsize (which
3517 is used internally by check_memop_size) to change code generation
3518 or drive optimization decisions.
3520 In this instance it is safe because the code we generate has
3521 the same semantics regardless of the return value of
3522 check_memop_sizes. Exactly the same amount of data is copied
3523 and the return value is exactly the same in both cases.
3525 Furthermore, check_memop_size always uses mode 0 for the call to
3526 compute_objsize, so the imprecise nature of compute_objsize is
3527 avoided. */
3529 /* Avoid expanding mempcpy into memcpy when the call is determined
3530 to overflow the buffer. This also prevents the same overflow
3531 from being diagnosed again when expanding memcpy. */
3537 }
3539 /* Expand an instrumented call EXP to the mempcpy builtin.
3540 Return NULL_RTX if we failed, the caller should emit a normal call,
3541 otherwise try to get the result in TARGET, if convenient (and in
3542 mode MODE if that's convenient). */
3544 static rtx
3546 {
3552 else
3553 {
3560 /* Return src bounds with the result. */
3562 {
3566 }
3568 }
3569 }
3571 /* Helper function to do the actual work for expand of memory copy family
3572 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3573 of memory from SRC to DEST and assign to TARGET if convenient.
3574 If ENDP is 0 return the
3575 destination pointer, if ENDP is 1 return the end pointer ala
3576 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3577 stpcpy. */
3579 static rtx
3582 {
3593 /* If DEST is not a pointer type, call the normal function. */
3597 /* If either SRC is not a pointer type, don't do this
3598 operation in-line. */
3615 /* If SRC is a string constant and block move would be done
3616 by pieces, we can avoid loading the string from memory
3617 and only stored the computed constants. */
3624 {
3626 builtin_memcpy_read_str,
3632 }
3637 /* Copy word part most expediently. */
3646 {
3649 }
3652 {
3654 /* stpcpy pointer to last byte. */
3657 }
3660 }
3662 static rtx
3665 {
3667 endp);
3668 }
3670 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3671 we failed, the caller should emit a normal call, otherwise try to
3672 get the result in TARGET, if convenient. If ENDP is 0 return the
3673 destination pointer, if ENDP is 1 return the end pointer ala
3674 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3675 stpcpy. */
3677 static rtx
3679 {
3681 rtx dest_mem;
3682 rtx src_mem;
3690 {
3693 }
3702 {
3704 /* movstr is supposed to set end to the address of the NUL
3705 terminator. If the caller requested a mempcpy-like return value,
3706 adjust it. */
3708 {
3712 }
3713 }
3715 }
3717 /* Do some very basic size validation of a call to the strcpy builtin
3718 given by EXP. Return NULL_RTX to have the built-in expand to a call
3719 to the library function. */
3721 static rtx
3723 {
3731 /* There is no way here to determine the length of the string in
3732 the destination to which the SRC string is being appended so
3733 just diagnose cases when the souce string is longer than
3734 the destination object. */
3739 destsize);
3742 }
3744 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3745 NULL_RTX if we failed the caller should emit a normal call, otherwise
3746 try to get the result in TARGET, if convenient (and in mode MODE if that's
3747 convenient). */
3749 static rtx
3751 {
3759 {
3763 }
3766 }
3768 /* Helper function to do the actual work for expand_builtin_strcpy. The
3769 arguments to the builtin_strcpy call DEST and SRC are broken out
3770 so that this can also be called without constructing an actual CALL_EXPR.
3771 The other arguments and return value are the same as for
3772 expand_builtin_strcpy. */
3774 static rtx
3776 {
3778 }
3780 /* Expand a call EXP to the stpcpy builtin.
3781 Return NULL_RTX if we failed the caller should emit a normal call,
3782 otherwise try to get the result in TARGET, if convenient (and in
3783 mode MODE if that's convenient). */
3785 static rtx
3787 {
3798 {
3802 }
3804 /* If return value is ignored, transform stpcpy into strcpy. */
3806 {
3810 }
3811 else
3812 {
3814 rtx ret;
3816 /* Ensure we get an actual string whose length can be evaluated at
3817 compile-time, not an expression containing a string. This is
3818 because the latter will potentially produce pessimized code
3819 when used to produce the return value. */
3831 {
3835 {
3839 {
3841 {
3844 else
3846 }
3855 }
3856 }
3857 }
3860 }
3861 }
3863 /* Check a call EXP to the stpncpy built-in for validity.
3864 Return NULL_RTX on both success and failure. */
3866 static rtx
3868 {
3874 /* The source and destination of the call. */
3878 /* The exact number of bytes to write (not the maximum). */
3881 /* The size of the destination object. */
3887 }
3889 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3890 bytes from constant string DATA + OFFSET and return it as target
3891 constant. */
3893 rtx
3895 scalar_int_mode mode)
3896 {
3903 }
3905 /* Helper to check the sizes of sequences and the destination of calls
3906 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3907 success (no overflow or invalid sizes), false otherwise. */
3909 static bool
3911 {
3916 /* Try to determine the range of lengths that the source expression
3917 refers to. */
3921 /* Try to verify that the destination is big enough for the shortest
3922 string. */
3925 {
3926 /* If it hasn't been provided by __strncat_chk, try to determine
3927 the size of the destination object into which the source is
3928 being copied. */
3930 }
3932 /* Add one for the terminating nul. */
3935 size_one_node)
3938 /* The strncat function copies at most MAXREAD bytes and always appends
3939 the terminating nul so the specified upper bound should never be equal
3940 to (or greater than) the size of the destination. */
3943 {
3952 }
3960 /* The number of bytes to write is LEN but check_access will also
3961 check SRCLEN if LEN's value isn't known. */
3963 objsize);
3964 }
3966 /* Similar to expand_builtin_strcat, do some very basic size validation
3967 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3968 the built-in expand to a call to the library function. */
3970 static rtx
3972 {
3980 /* The upper bound on the number of bytes to write. */
3982 /* The length of the source sequence. */
3985 /* Try to determine the range of lengths that the source expression
3986 refers to. */
3990 else
3993 /* Try to verify that the destination is big enough for the shortest
3994 string. First try to determine the size of the destination object
3995 into which the source is being copied. */
3998 /* Add one for the terminating nul. */
4001 size_one_node)
4004 /* The strncat function copies at most MAXREAD bytes and always appends
4005 the terminating nul so the specified upper bound should never be equal
4006 to (or greater than) the size of the destination. */
4009 {
4018 }
4026 /* The number of bytes to write is SRCLEN. */
4030 }
4032 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4033 NULL_RTX if we failed the caller should emit a normal call. */
4035 static rtx
4037 {
4042 {
4045 /* The number of bytes to write (not the maximum). */
4047 /* The length of the source sequence. */
4051 {
4055 /* The number of bytes to write is LEN but check_access will also
4056 check SLEN if LEN's value isn't known. */
4058 destsize);
4059 }
4061 /* We must be passed a constant len and src parameter. */
4067 /* We're required to pad with trailing zeros if the requested
4068 len is greater than strlen(s2)+1. In that case try to
4069 use store_by_pieces, if it fails, punt. */
4071 {
4074 rtx dest_mem;
4078 builtin_strncpy_read_str,
4085 builtin_strncpy_read_str,
4090 }
4091 }
4093 }
4095 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4096 bytes from constant string DATA + OFFSET and return it as target
4097 constant. */
4099 rtx
4101 scalar_int_mode mode)
4102 {
4109 }
4111 /* Callback routine for store_by_pieces. Return the RTL of a register
4112 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4113 char value given in the RTL register data. For example, if mode is
4114 4 bytes wide, return the RTL for 0x01010101*data. */
4116 static rtx
4118 scalar_int_mode mode)
4119 {
4135 }
4137 /* Expand expression EXP, which is a call to the memset builtin. Return
4138 NULL_RTX if we failed the caller should emit a normal call, otherwise
4139 try to get the result in TARGET, if convenient (and in mode MODE if that's
4140 convenient). */
4142 static rtx
4144 {
4156 }
4158 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4159 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4160 try to get the result in TARGET, if convenient (and in mode MODE if that's
4161 convenient). */
4163 static rtx
4165 {
4170 else
4171 {
4177 /* Return src bounds with the result. */
4179 {
4183 }
4185 }
4186 }
4188 /* Helper function to do the actual work for expand_builtin_memset. The
4189 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4190 so that this can also be called without constructing an actual CALL_EXPR.
4191 The other arguments and return value are the same as for
4192 expand_builtin_memset. */
4194 static rtx
4197 {
4200 machine_mode val_mode;
4212 /* If DEST is not a pointer type, don't do this operation in-line. */
4223 /* If the LEN parameter is zero, return DEST. */
4225 {
4226 /* Evaluate and ignore VAL in case it has side-effects. */
4229 }
4231 /* Stabilize the arguments in case we fail. */
4243 {
4244 rtx val_rtx;
4249 /* Assume that we can memset by pieces if we can store
4250 * the coefficients by pieces (in the required modes).
4251 * We can't pass builtin_memset_gen_str as that emits RTL. */
4257 {
4262 }
4266 probable_max_size))
4272 }
4278 {
4289 probable_max_size))
4295 }
4303 probable_max_size);
4306 {
4309 }
4313 do_libcall:
4323 else
4328 }
4330 /* Expand expression EXP, which is a call to the bzero builtin. Return
4331 NULL_RTX if we failed the caller should emit a normal call. */
4333 static rtx
4335 {
4344 /* New argument list transforming bzero(ptr x, int y) to
4345 memset(ptr x, int 0, size_t y). This is done this way
4346 so that if it isn't expanded inline, we fallback to
4347 calling bzero instead of memset. */
4355 }
4357 /* Try to expand cmpstr operation ICODE with the given operands.
4358 Return the result rtx on success, otherwise return null. */
4360 static rtx
4362 HOST_WIDE_INT align)
4363 {
4377 }
4379 /* Expand expression EXP, which is a call to the memcmp built-in function.
4380 Return NULL_RTX if we failed and the caller should emit a normal call,
4381 otherwise try to get the result in TARGET, if convenient.
4382 RESULT_EQ is true if we can relax the returned value to be either zero
4383 or nonzero, without caring about the sign. */
4385 static rtx
4387 {
4396 /* Diagnose calls where the specified length exceeds the size of either
4397 object. */
4399 {
4403 {
4407 }
4408 }
4416 /* If we don't have POINTER_TYPE, call the function. */
4424 /* Set MEM_SIZE as appropriate. */
4426 {
4429 }
4435 {
4439 }
4441 /* If SRC is a string constant and block move would be done
4442 by pieces, we can avoid loading the string from memory
4443 and only stored the computed constants. */
4455 {
4456 /* Return the value in the proper mode for this function. */
4461 {
4464 }
4467 }
4470 }
4472 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4473 if we failed the caller should emit a normal call, otherwise try to get
4474 the result in TARGET, if convenient. */
4476 static rtx
4478 {
4493 /* If we don't have POINTER_TYPE, call the function. */
4497 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4505 /* Try to call cmpstrsi. */
4510 /* Try to determine at least one length and call cmpstrnsi. */
4512 {
4513 tree len;
4514 rtx arg3_rtx;
4524 /* If we don't have a constant length for the first, use the length
4525 of the second, if we know it. We don't require a constant for
4526 this case; some cost analysis could be done if both are available
4527 but neither is constant. For now, assume they're equally cheap,
4528 unless one has side effects. If both strings have constant lengths,
4529 use the smaller. */
4545 else
4548 /* If both arguments have side effects, we cannot optimize. */
4550 {
4552 result = expand_cmpstrn_or_cmpmem
4555 }
4556 }
4558 /* Check to see if the argument was declared attribute nonstring
4559 and if so, issue a warning since at this point it's not known
4560 to be nul-terminated. */
4565 {
4566 /* Return the value in the proper mode for this function. */
4574 }
4576 /* Expand the library call ourselves using a stabilized argument
4577 list to avoid re-evaluating the function's arguments twice. */
4582 }
4584 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4585 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4586 the result in TARGET, if convenient. */
4588 static rtx
4590 ATTRIBUTE_UNUSED machine_mode mode)
4591 {
4596 /* If c_strlen can determine an expression for one of the string
4597 lengths, and it doesn't have side effects, then emit cmpstrnsi
4598 using length MIN(strlen(string)+1, arg3). */
4603 tree len;
4624 /* If we don't have a constant length for the first, use the length
4625 of the second, if we know it. If neither string is constant length,
4626 use the given length argument. We don't require a constant for
4627 this case; some cost analysis could be done if both are available
4628 but neither is constant. For now, assume they're equally cheap,
4629 unless one has side effects. If both strings have constant lengths,
4630 use the smaller. */
4648 else
4651 /* If we are not using the given length, we must incorporate it here.
4652 The actual new length parameter will be MIN(len,arg3) in this case. */
4662 /* Check to see if the argument was declared attribute nonstring
4663 and if so, issue a warning since at this point it's not known
4664 to be nul-terminated. */
4669 {
4670 /* Return the value in the proper mode for this function. */
4678 }
4680 /* Expand the library call ourselves using a stabilized argument
4681 list to avoid re-evaluating the function's arguments twice. */
4686 }
4688 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4689 if that's convenient. */
4691 rtx
4693 {
4694 rtx val;
4697 /* Don't do __builtin_saveregs more than once in a function.
4698 Save the result of the first call and reuse it. */
4702 /* When this function is called, it means that registers must be
4703 saved on entry to this function. So we migrate the call to the
4704 first insn of this function. */
4708 /* Do whatever the machine needs done in this case. */
4716 /* Put the insns after the NOTE that starts the function. If this
4717 is inside a start_sequence, make the outer-level insn chain current, so
4718 the code is placed at the start of the function. */
4724 }
4726 /* Expand a call to __builtin_next_arg. */
4728 static rtx
4730 {
4731 /* Checking arguments is already done in fold_builtin_next_arg
4732 that must be called before this function. */
4737 }
4739 /* Make it easier for the backends by protecting the valist argument
4740 from multiple evaluations. */
4742 static tree
4744 {
4747 /* The current way of determining the type of valist is completely
4748 bogus. We should have the information on the va builtin instead. */
4753 {
4757 /* For this case, the backends will be expecting a pointer to
4758 vatype, but it's possible we've actually been given an array
4759 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4760 So fix it. */
4762 {
4765 }
4766 }
4767 else
4768 {
4772 {
4778 }
4784 }
4787 }
4789 /* The "standard" definition of va_list is void*. */
4791 tree
4793 {
4795 }
4797 /* The "standard" abi va_list is va_list_type_node. */
4799 tree
4801 {
4803 }
4805 /* The "standard" type of va_list is va_list_type_node. */
4807 tree
4809 {
4816 {
4817 /* If va_list is an array type, the argument may have decayed
4818 to a pointer type, e.g. by being passed to another function.
4819 In that case, unwrap both types so that we can compare the
4820 underlying records. */
4823 {
4826 }
4827 }
4832 }
4834 /* The "standard" implementation of va_start: just assign `nextarg' to
4835 the variable. */
4837 void
4839 {
4843 /* We do not have any valid bounds for the pointer, so
4844 just store zero bounds for it. */
4848 nextarg));
4849 }
4851 /* Expand EXP, a call to __builtin_va_start. */
4853 static rtx
4855 {
4856 rtx nextarg;
4857 tree valist;
4861 {
4864 }
4874 else
4878 }
4880 /* Expand EXP, a call to __builtin_va_end. */
4882 static rtx
4884 {
4887 /* Evaluate for side effects, if needed. I hate macros that don't
4888 do that. */
4893 }
4895 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4896 builtin rather than just as an assignment in stdarg.h because of the
4897 nastiness of array-type va_list types. */
4899 static rtx
4901 {
4914 {
4918 }
4919 else
4920 {
4923 /* Evaluate to pointers. */
4932 /* "Dereference" to BLKmode memories. */
4940 /* Copy. */
4942 }
4945 }
4947 /* Expand a call to one of the builtin functions __builtin_frame_address or
4948 __builtin_return_address. */
4950 static rtx
4952 {
4953 /* The argument must be a nonnegative integer constant.
4954 It counts the number of frames to scan up the stack.
4955 The value is either the frame pointer value or the return
4956 address saved in that frame. */
4958 /* Warning about missing arg was already issued. */
4961 {
4964 }
4965 else
4966 {
4967 /* Number of frames to scan up the stack. */
4972 /* Some ports cannot access arbitrary stack frames. */
4974 {
4977 }
4980 {
4981 /* Warn since no effort is made to ensure that any frame
4982 beyond the current one exists or can be safely reached. */
4985 }
4987 /* For __builtin_frame_address, return what we've got. */
4995 }
4996 }
4998 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
4999 failed and the caller should emit a normal call. */
5001 static rtx
5003 {
5004 rtx op0;
5005 rtx result;
5008 HOST_WIDE_INT max_size;
5011 bool valid_arglist
5014 VOID_TYPE)
5024 {
5025 /* -Walloca-larger-than and -Wvla-larger-than settings override
5026 the more general -Walloc-size-larger-than so unless either of
5027 the former options is specified check the alloca arguments for
5028 overflow. */
5032 }
5034 /* Compute the argument. */
5037 /* Compute the alignment. */
5039 ? BIGGEST_ALIGNMENT
5042 /* Compute the maximum size. */
5047 /* Allocate the desired space. If the allocation stems from the declaration
5048 of a variable-sized object, it cannot accumulate. */
5049 result
5054 }
5056 /* Emit a call to __asan_allocas_unpoison call in EXP. Replace second argument
5057 of the call with virtual_stack_dynamic_rtx because in asan pass we emit a
5058 dummy value into second parameter relying on this function to perform the
5059 change. See motivation for this in comment to handle_builtin_stack_restore
5060 function. */
5062 static rtx
5064 {
5072 }
5074 /* Expand a call to bswap builtin in EXP.
5075 Return NULL_RTX if a normal call should be emitted rather than expanding the
5076 function in-line. If convenient, the result should be placed in TARGET.
5077 SUBTARGET may be used as the target for computing one of EXP's operands. */
5079 static rtx
5081 rtx subtarget)
5082 {
5083 tree arg;
5084 rtx op0;
5102 }
5104 /* Expand a call to a unary builtin in EXP.
5105 Return NULL_RTX if a normal call should be emitted rather than expanding the
5106 function in-line. If convenient, the result should be placed in TARGET.
5107 SUBTARGET may be used as the target for computing one of EXP's operands. */
5109 static rtx
5112 {
5113 rtx op0;
5118 /* Compute the argument. */
5120 (subtarget
5124 /* Compute op, into TARGET if possible.
5125 Set TARGET to wherever the result comes back. */
5131 }
5133 /* Expand a call to __builtin_expect. We just return our argument
5134 as the builtin_expect semantic should've been already executed by
5135 tree branch prediction pass. */
5137 static rtx
5139 {
5140 tree arg;
5147 /* When guessing was done, the hints should be already stripped away. */
5151 }
5153 /* Expand a call to __builtin_assume_aligned. We just return our first
5154 argument as the builtin_assume_aligned semantic should've been already
5155 executed by CCP. */
5157 static rtx
5159 {
5163 EXPAND_NORMAL);
5168 }
5170 void
5172 {
5174 {
5176 /* For trap insns when not accumulating outgoing args force
5177 REG_ARGS_SIZE note to prevent crossjumping of calls with
5178 different args sizes. */
5181 }
5182 else
5183 {
5187 }
5190 }
5192 /* Expand a call to __builtin_unreachable. We do nothing except emit
5193 a barrier saying that control flow will not pass here.
5195 It is the responsibility of the program being compiled to ensure
5196 that control flow does never reach __builtin_unreachable. */
5197 static void
5199 {
5201 }
5203 /* Expand EXP, a call to fabs, fabsf or fabsl.
5204 Return NULL_RTX if a normal call should be emitted rather than expanding
5205 the function inline. If convenient, the result should be placed
5206 in TARGET. SUBTARGET may be used as the target for computing
5207 the operand. */
5209 static rtx
5211 {
5212 machine_mode mode;
5213 tree arg;
5214 rtx op0;
5224 }
5226 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5227 Return NULL is a normal call should be emitted rather than expanding the
5228 function inline. If convenient, the result should be placed in TARGET.
5229 SUBTARGET may be used as the target for computing the operand. */
5231 static rtx
5233 {
5235 tree arg;
5247 }
5249 /* Expand a call to __builtin___clear_cache. */
5251 static rtx
5253 {
5255 {
5256 #ifdef CLEAR_INSN_CACHE
5257 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5258 does something. Just do the default expansion to a call to
5259 __clear_cache(). */
5261 #else
5262 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5263 does nothing. There is no need to call it. Do nothing. */
5266 }
5268 /* We have a "clear_cache" insn, and it will handle everything. */
5272 /* We must not expand to a library call. If we did, any
5273 fallback library function in libgcc that might contain a call to
5274 __builtin___clear_cache() would recurse infinitely. */
5276 {
5279 }
5282 {
5295 }
5297 }
5299 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5301 static rtx
5303 {
5306 /* If we don't need too much alignment, we'll have been guaranteed
5307 proper alignment by get_trampoline_type. */
5311 /* Round address up to desired boundary. */
5322 }
5324 static rtx
5326 {
5342 /* If ONSTACK, the TRAMP argument should be the address of a field
5343 within the local function's FRAME decl. Either way, let's see if
5344 we can fill in the MEM_ATTRs for this memory. */
5348 /* Creator of a heap trampoline is responsible for making sure the
5349 address is aligned to at least STACK_BOUNDARY. Normally malloc
5350 will ensure this anyhow. */
5353 {
5357 }
5359 /* The FUNC argument should be the address of the nested function.
5360 Extract the actual function decl to pass to the hook. */
5367 /* Generate insns to initialize the trampoline. */
5371 {
5377 }
5380 }
5382 static rtx
5384 {
5385 rtx tramp;
5396 }
5398 /* Expand a call to the builtin descriptor initialization routine.
5399 A descriptor is made up of a couple of pointers to the static
5400 chain and the code entry in this order. */
5402 static rtx
5404 {
5409 VOID_TYPE))
5423 /* Generate insns to initialize the descriptor. */
5429 }
5431 /* Expand a call to the builtin descriptor adjustment routine. */
5433 static rtx
5435 {
5436 rtx tramp;
5443 /* Unalign the descriptor to allow runtime identification. */
5448 }
5450 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5451 function. The function first checks whether the back end provides
5452 an insn to implement signbit for the respective mode. If not, it
5453 checks whether the floating point format of the value is such that
5454 the sign bit can be extracted. If that is not the case, error out.
5455 EXP is the expression that is a call to the builtin function; if
5456 convenient, the result should be placed in TARGET. */
5457 static rtx
5459 {
5461 scalar_float_mode fmode;
5463 tree arg;
5466 rtx temp;
5479 /* Expand the argument yielding a RTX expression. */
5482 /* Check if the back end provides an insn that handles signbit for the
5483 argument's mode. */
5486 {
5492 }
5494 /* For floating point formats without a sign bit, implement signbit
5495 as "ARG < 0.0". */
5498 {
5499 /* But we can't do this if the format supports signed zero. */
5505 }
5508 {
5511 }
5512 else
5513 {
5515 /* Handle targets with different FP word orders. */
5518 else
5522 }
5524 /* Force the intermediate word_mode (or narrower) result into a
5525 register. This avoids attempting to create paradoxical SUBREGs
5526 of floating point modes below. */
5529 /* If the bitpos is within the "result mode" lowpart, the operation
5530 can be implement with a single bitwise AND. Otherwise, we need
5531 a right shift and an AND. */
5534 {
5542 }
5543 else
5544 {
5545 /* Perform a logical right shift to place the signbit in the least
5546 significant bit, then truncate the result to the desired mode
5547 and mask just this bit. */
5552 }
5555 }
5557 /* Expand fork or exec calls. TARGET is the desired target of the
5558 call. EXP is the call. FN is the
5559 identificator of the actual function. IGNORE is nonzero if the
5560 value is to be ignored. */
5562 static rtx
5564 {
5566 tree call;
5568 /* If we are not profiling, just call the function. */
5572 /* Otherwise call the wrapper. This should be equivalent for the rest of
5573 compiler, so the code does not diverge, and the wrapper may run the
5574 code necessary for keeping the profiling sane. */
5577 {
5608 }
5620 }
5623 \f
5624 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5625 the pointer in these functions is void*, the tree optimizers may remove
5626 casts. The mode computed in expand_builtin isn't reliable either, due
5627 to __sync_bool_compare_and_swap.
5629 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5630 group of builtins. This gives us log2 of the mode size. */
5634 {
5635 /* The size is not negotiable, so ask not to get BLKmode in return
5636 if the target indicates that a smaller size would be better. */
5638 }
5640 /* Expand the memory expression LOC and return the appropriate memory operand
5641 for the builtin_sync operations. */
5643 static rtx
5645 {
5651 /* Note that we explicitly do not want any alias information for this
5652 memory, so that we kill all other live memories. Otherwise we don't
5653 satisfy the full barrier semantics of the intrinsic. */
5656 /* The alignment needs to be at least according to that of the mode. */
5663 }
5665 /* Make sure an argument is in the right mode.
5666 EXP is the tree argument.
5667 MODE is the mode it should be in. */
5669 static rtx
5671 {
5672 rtx val;
5673 machine_mode old_mode;
5676 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5677 of CONST_INTs, where we know the old_mode only from the call argument. */
5684 }
5687 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5688 EXP is the CALL_EXPR. CODE is the rtx code
5689 that corresponds to the arithmetic or logical operation from the name;
5690 an exception here is that NOT actually means NAND. TARGET is an optional
5691 place for us to store the results; AFTER is true if this is the
5692 fetch_and_xxx form. */
5694 static rtx
5697 rtx target)
5698 {
5703 {
5710 {
5739 }
5740 }
5742 /* Expand the operands. */
5747 after);
5748 }
5750 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5751 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5752 true if this is the boolean form. TARGET is a place for us to store the
5753 results; this is NOT optional if IS_BOOL is true. */
5755 static rtx
5758 {
5762 /* Expand the operands. */
5769 {
5772 else
5774 }
5777 MEMMODEL_SYNC_SEQ_CST))
5781 }
5783 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5784 general form is actually an atomic exchange, and some targets only
5785 support a reduced form with the second argument being a constant 1.
5786 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5787 the results. */
5789 static rtx
5791 rtx target)
5792 {
5795 /* Expand the operands. */
5800 }
5802 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5804 static void
5806 {
5807 rtx mem;
5809 /* Expand the operands. */
5813 }
5815 /* Given an integer representing an ``enum memmodel'', verify its
5816 correctness and return the memory model enum. */
5818 static enum memmodel
5820 {
5821 rtx op;
5823 source_location loc
5826 /* If the parameter is not a constant, it's a run time value so we'll just
5827 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5837 {
5841 }
5843 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5845 {
5849 }
5851 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5852 be conservative and promote consume to acquire. */
5857 }
5859 /* Expand the __atomic_exchange intrinsic:
5860 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5861 EXP is the CALL_EXPR.
5862 TARGET is an optional place for us to store the results. */
5864 static rtx
5866 {
5875 /* Expand the operands. */
5880 }
5882 /* Expand the __atomic_compare_exchange intrinsic:
5883 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5884 TYPE desired, BOOL weak,
5885 enum memmodel success,
5886 enum memmodel failure)
5887 EXP is the CALL_EXPR.
5888 TARGET is an optional place for us to store the results. */
5890 static rtx
5892 rtx target)
5893 {
5897 tree weak;
5899 source_location loc
5906 {
5908 "failure memory model cannot be stronger than success "
5911 }
5914 {
5916 "invalid failure memory model for "
5920 }
5926 /* Expand the operands. */
5942 /* Lest the rtl backend create a race condition with an imporoper store
5943 to memory, always create a new pseudo for OLDVAL. */
5950 /* Conditionally store back to EXPECT, lest we create a race condition
5951 with an improper store to memory. */
5952 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5953 the normal case where EXPECT is totally private, i.e. a register. At
5954 which point the store can be unconditional. */
5962 }
5964 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5965 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5966 call. The weak parameter must be dropped to match the expected parameter
5967 list and the expected argument changed from value to pointer to memory
5968 slot. */
5970 static void
5972 {
5988 /* Skip the boolean weak parameter. */
5991 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
5994 built_in_function fncode
5999 fndecl);
6004 {
6011 }
6012 }
6014 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6016 void
6018 {
6024 tree lhs;
6026 source_location loc
6033 {
6035 "failure memory model cannot be stronger than success "
6038 }
6041 {
6043 "invalid failure memory model for "
6047 }
6050 {
6053 }
6055 /* Expand the operands. */
6068 {
6071 }
6075 {
6081 }
6082 }
6084 /* Expand the __atomic_load intrinsic:
6085 TYPE __atomic_load (TYPE *object, enum memmodel)
6086 EXP is the CALL_EXPR.
6087 TARGET is an optional place for us to store the results. */
6089 static rtx
6091 {
6092 rtx mem;
6097 {
6098 source_location loc
6103 }
6108 /* Expand the operand. */
6112 }
6115 /* Expand the __atomic_store intrinsic:
6116 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6117 EXP is the CALL_EXPR.
6118 TARGET is an optional place for us to store the results. */
6120 static rtx
6122 {
6129 {
6130 source_location loc
6135 }
6140 /* Expand the operands. */
6145 }
6147 /* Expand the __atomic_fetch_XXX intrinsic:
6148 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6149 EXP is the CALL_EXPR.
6150 TARGET is an optional place for us to store the results.
6151 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6152 FETCH_AFTER is true if returning the result of the operation.
6153 FETCH_AFTER is false if returning the value before the operation.
6154 IGNORE is true if the result is not used.
6155 EXT_CALL is the correct builtin for an external call if this cannot be
6156 resolved to an instruction sequence. */
6158 static rtx
6162 {
6165 tree fndecl;
6166 tree addr;
6170 /* Expand the operands. */
6174 /* Only try generating instructions if inlining is turned on. */
6176 {
6180 }
6182 /* Return if a different routine isn't needed for the library call. */
6186 /* Change the call to the specified function. */
6194 /* If we will emit code after the call, the call can not be a tail call.
6195 If it is emitted as a tail call, a barrier is emitted after it, and
6196 then all trailing code is removed. */
6200 /* Expand the call here so we can emit trailing code. */
6203 /* Replace the original function just in case it matters. */
6206 /* Then issue the arithmetic correction to return the right result. */
6208 {
6210 {
6212 OPTAB_LIB_WIDEN);
6214 }
6215 else
6217 OPTAB_LIB_WIDEN);
6218 }
6220 }
6222 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6224 void
6226 {
6234 optab optab;
6246 {
6261 }
6264 {
6271 }
6293 {
6298 }
6299 else
6301 OPTAB_DIRECT);
6304 }
6306 /* Expand an atomic clear operation.
6307 void _atomic_clear (BOOL *obj, enum memmodel)
6308 EXP is the call expression. */
6310 static rtx
6312 {
6313 machine_mode mode;
6322 {
6323 source_location loc
6328 }
6330 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6331 Failing that, a store is issued by __atomic_store. The only way this can
6332 fail is if the bool type is larger than a word size. Unlikely, but
6333 handle it anyway for completeness. Assume a single threaded model since
6334 there is no atomic support in this case, and no barriers are required. */
6339 }
6341 /* Expand an atomic test_and_set operation.
6342 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6343 EXP is the call expression. */
6345 static rtx
6347 {
6348 rtx mem;
6350 machine_mode mode;
6357 }
6360 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6361 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6363 static tree
6365 {
6367 machine_mode mode;
6373 /* We need a corresponding integer mode for the access to be lock-free. */
6381 {
6384 /* Either this argument is null, or it's a fake pointer encoding
6385 the alignment of the object. */
6391 else
6393 }
6394 else
6395 {
6398 /* This function is usually invoked and folded immediately by the front
6399 end before anything else has a chance to look at it. The pointer
6400 parameter at this point is usually cast to a void *, so check for that
6401 and look past the cast. */
6411 /* Get the underlying type of the object. */
6414 }
6416 /* If the object has smaller alignment, the lock free routines cannot
6417 be used. */
6421 /* Check if a compare_and_swap pattern exists for the mode which represents
6422 the required size. The pattern is not allowed to fail, so the existence
6423 of the pattern indicates support is present. Also require that an
6424 atomic load exists for the required size. */
6427 else
6429 }
6431 /* Return true if the parameters to call EXP represent an object which will
6432 always generate lock free instructions. The first argument represents the
6433 size of the object, and the second parameter is a pointer to the object
6434 itself. If NULL is passed for the object, then the result is based on
6435 typical alignment for an object of the specified size. Otherwise return
6436 false. */
6438 static rtx
6440 {
6441 tree size;
6446 {
6449 }
6455 }
6457 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6458 is lock free on this architecture. */
6460 static tree
6462 {
6466 /* If it isn't always lock free, don't generate a result. */
6471 }
6473 /* Return true if the parameters to call EXP represent an object which will
6474 always generate lock free instructions. The first argument represents the
6475 size of the object, and the second parameter is a pointer to the object
6476 itself. If NULL is passed for the object, then the result is based on
6477 typical alignment for an object of the specified size. Otherwise return
6478 NULL*/
6480 static rtx
6482 {
6483 tree size;
6488 {
6491 }
6496 /* If the value is known at compile time, return the RTX for it. */
6502 }
6504 /* Expand the __atomic_thread_fence intrinsic:
6505 void __atomic_thread_fence (enum memmodel)
6506 EXP is the CALL_EXPR. */
6508 static void
6510 {
6513 }
6515 /* Expand the __atomic_signal_fence intrinsic:
6516 void __atomic_signal_fence (enum memmodel)
6517 EXP is the CALL_EXPR. */
6519 static void
6521 {
6524 }
6526 /* Expand the __sync_synchronize intrinsic. */
6528 static void
6530 {
6532 }
6534 static rtx
6536 {
6542 {
6544 /* If the target is not sutitable then create a new target. */
6552 }
6555 }
6557 static void
6559 {
6565 {
6572 }
6574 }
6576 \f
6577 /* Emit code to restore the current value of stack. */
6579 static void
6581 {
6593 }
6595 /* Emit code to save the current value of stack. */
6597 static rtx
6599 {
6604 }
6607 /* Expand an expression EXP that calls a built-in function,
6608 with result going to TARGET if that's convenient
6609 (and in mode MODE if that's convenient).
6610 SUBTARGET may be used as the target for computing one of EXP's operands.
6611 IGNORE is nonzero if the value is to be ignored. */
6613 rtx
6616 {
6625 /* When ASan is enabled, we don't want to expand some memory/string
6626 builtins and rely on libsanitizer's hooks. This allows us to avoid
6627 redundant checks and be sure, that possible overflow will be detected
6628 by ASan. */
6633 /* When not optimizing, generate calls to library functions for a certain
6634 set of builtins. */
6660 /* The built-in function expanders test for target == const0_rtx
6661 to determine whether the function's result will be ignored. */
6665 /* If the result of a pure or const built-in function is ignored, and
6666 none of its arguments are volatile, we can avoid expanding the
6667 built-in call and just evaluate the arguments for side-effects. */
6671 {
6673 tree arg;
6674 call_expr_arg_iterator iter;
6678 {
6681 }
6684 {
6688 }
6689 }
6691 /* expand_builtin_with_bounds is supposed to be used for
6692 instrumented builtin calls. */
6696 {
6714 /* Just do a normal library call if we were unable to fold
6715 the values. */
6792 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6793 FUNCTION with a copy of the parameters described by
6794 ARGUMENTS, and ARGSIZE. It returns a block of memory
6795 allocated on the stack into which is stored all the registers
6796 that might possibly be used for returning the result of a
6797 function. ARGUMENTS is the value returned by
6798 __builtin_apply_args. ARGSIZE is the number of bytes of
6799 arguments that must be copied. ??? How should this value be
6800 computed? We'll also need a safe worst case value for varargs
6801 functions. */
6808 else
6809 {
6817 }
6819 /* __builtin_return (RESULT) causes the function to return the
6820 value described by RESULT. RESULT is address of the block of
6821 memory returned by __builtin_apply. */
6831 /* All valid uses of __builtin_va_arg_pack () are removed during
6832 inlining. */
6837 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6838 inlining. */
6842 /* Return the address of the first anonymous stack arg. */
6864 /* Returns the address of the area where the structure is returned.
6865 0 otherwise. */
6871 else
6874 CASE_BUILT_IN_ALLOCA:
7037 {
7040 }
7044 /* This should have been lowered to the builtins below. */
7048 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7049 and the receiver label. */
7051 {
7057 /* This is copied from the handling of non-local gotos. */
7059 nonlocal_goto_handler_labels
7061 nonlocal_goto_handler_labels);
7062 /* ??? Do not let expand_label treat us as such since we would
7063 not want to be both on the list of non-local labels and on
7064 the list of forced labels. */
7067 }
7071 /* __builtin_setjmp_receiver is passed the receiver label. */
7073 {
7079 }
7082 /* __builtin_longjmp is passed a pointer to an array of five words.
7083 It's similar to the C library longjmp function but works with
7084 __builtin_setjmp above. */
7087 {
7093 {
7096 }
7100 }
7109 /* This updates the setjmp buffer that is its argument with the value
7110 of the current stack pointer. */
7113 {
7114 rtx buf_addr
7119 }
7139 /* Various hooks for the DWARF 2 __throw routine. */
7145 #ifdef DWARF2_UNWIND_INFO
7151 #endif
7351 mode = get_builtin_sync_mode
7363 mode = get_builtin_sync_mode
7410 {
7414 mode =
7420 /* If this is turned into an external library call, the weak parameter
7421 must be dropped to match the expected parameter list. */
7426 /* Skip the boolean weak parameter. */
7431 }
7460 {
7470 }
7476 {
7486 }
7492 {
7502 }
7508 {
7518 }
7524 {
7534 }
7540 {
7550 }
7697 /* We allow user CHKP builtins if Pointer Bounds
7698 Checker is off. */
7700 {
7711 else
7713 }
7714 /* FALLTHROUGH */
7726 /* Software implementation of Pointer Bounds Checker is NYI.
7727 Target support is required. */
7732 /* Do library call, if we failed to expand the builtin when
7733 folding. */
7738 }
7740 /* The switch statement above can drop through to cause the function
7741 to be called normally. */
7743 }
7745 /* Similar to expand_builtin but is used for instrumented calls. */
7747 rtx
7749 rtx subtarget ATTRIBUTE_UNUSED,
7751 {
7764 {
7787 {
7788 /* memcpy_chkp (void *dst, size_t dstbnd,
7789 const void *src, size_t srcbnd, size_t n)
7790 and others take a pointer bound argument just after each
7791 pointer argument. */
7798 }
7802 }
7804 /* The switch statement above can drop through to cause the function
7805 to be called normally. */
7807 }
7809 /* Determine whether a tree node represents a call to a built-in
7810 function. If the tree T is a call to a built-in function with
7811 the right number of arguments of the appropriate types, return
7812 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7813 Otherwise the return value is END_BUILTINS. */
7815 enum built_in_function
7817 {
7820 const_call_expr_arg_iterator iter;
7836 {
7837 /* If a function doesn't take a variable number of arguments,
7838 the last element in the list will have type `void'. */
7841 {
7845 }
7854 {
7857 }
7859 {
7862 }
7864 {
7867 }
7869 {
7872 }
7873 else
7875 }
7877 /* Variable-length argument list. */
7879 }
7881 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7882 evaluate to a constant. */
7884 static tree
7886 {
7887 /* We return 1 for a numeric type that's known to be a constant
7888 value at compile-time or for an aggregate type that's a
7889 literal constant. */
7892 /* If we know this is a constant, emit the constant of one. */
7898 {
7905 }
7907 /* If this expression has side effects, show we don't know it to be a
7908 constant. Likewise if it's a pointer or aggregate type since in
7909 those case we only want literals, since those are only optimized
7910 when generating RTL, not later.
7911 And finally, if we are compiling an initializer, not code, we
7912 need to return a definite result now; there's not going to be any
7913 more optimization done. */
7918 || folding_initializer
7923 }
7925 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7926 return it as a truthvalue. */
7928 static tree
7930 tree predictor)
7931 {
7943 predictor);
7947 }
7949 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7950 NULL_TREE if no simplification is possible. */
7952 tree
7954 {
7958 /* Distribute the expected value over short-circuiting operators.
7959 See through the cast from truthvalue_type_node to long. */
7966 /* If this is a builtin_expect within a builtin_expect keep the
7967 inner one. See through a comparison against a constant. It
7968 might have been added to create a thruthvalue. */
7984 {
7993 }
7995 /* If the argument isn't invariant then there's nothing else we can do. */
7999 /* If we expect that a comparison against the argument will fold to
8000 a constant return the constant. In practice, this means a true
8001 constant or the address of a non-weak symbol. */
8005 {
8006 do
8007 {
8009 }
8014 }
8016 /* Otherwise, ARG0 already has the proper type for the return value. */
8018 }
8020 /* Fold a call to __builtin_classify_type with argument ARG. */
8022 static tree
8024 {
8029 }
8031 /* Fold a call to __builtin_strlen with argument ARG. */
8033 static tree
8035 {
8038 else
8039 {
8046 }
8047 }
8049 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8051 static tree
8053 {
8054 REAL_VALUE_TYPE real;
8056 /* __builtin_inff is intended to be usable to define INFINITY on all
8057 targets. If an infinity is not available, INFINITY expands "to a
8058 positive constant of type float that overflows at translation
8059 time", footnote "In this case, using INFINITY will violate the
8060 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8061 Thus we pedwarn to ensure this constraint violation is
8062 diagnosed. */
8068 }
8070 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8071 NULL_TREE if no simplification can be made. */
8073 static tree
8076 {
8077 tree type;
8087 /* Calculate the result when the argument is a constant. */
8092 /* Canonicalize sincos to cexpi. */
8094 {
8097 }
8099 {
8106 }
8115 }
8117 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8118 Return NULL_TREE if no simplification can be made. */
8120 static tree
8122 {
8128 /* If the LEN parameter is zero, return zero. */
8133 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8137 /* If len parameter is one, return an expression corresponding to
8138 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8140 {
8142 tree cst_uchar_ptr_node
8145 tree ind1
8149 cst_uchar_ptr_node,
8150 arg1)));
8151 tree ind2
8155 cst_uchar_ptr_node,
8156 arg2)));
8158 }
8161 }
8163 /* Fold a call to builtin isascii with argument ARG. */
8165 static tree
8167 {
8170 else
8171 {
8172 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8178 }
8179 }
8181 /* Fold a call to builtin toascii with argument ARG. */
8183 static tree
8185 {
8189 /* Transform toascii(c) -> (c & 0x7f). */
8192 }
8194 /* Fold a call to builtin isdigit with argument ARG. */
8196 static tree
8198 {
8201 else
8202 {
8203 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8204 /* According to the C standard, isdigit is unaffected by locale.
8205 However, it definitely is affected by the target character set. */
8206 unsigned HOST_WIDE_INT target_digit0
8217 }
8218 }
8220 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8222 static tree
8224 {
8230 }
8232 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8234 static tree
8236 {
8242 }
8244 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
8246 static tree
8248 {
8249 /* ??? Only expand to FMA_EXPR if it's directly supported. */
8257 }
8259 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8261 static tree
8263 {
8266 {
8270 {
8275 }
8276 }
8279 }
8281 /* Fold a call to builtin frexp, we can assume the base is 2. */
8283 static tree
8285 {
8296 /* Proceed if a valid pointer type was passed in. */
8298 {
8303 {
8305 /* For +-0, return (*exp = 0, +-0). */
8311 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8314 {
8315 /* Since the frexp function always expects base 2, and in
8316 GCC normalized significands are already in the range
8317 [0.5, 1.0), we have exactly what frexp wants. */
8322 }
8326 }
8328 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8332 }
8335 }
8337 /* Fold a call to builtin modf. */
8339 static tree
8341 {
8352 /* Proceed if a valid pointer type was passed in. */
8354 {
8359 {
8362 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8366 /* For +-Inf, return (*arg1 = arg0, +-0). */
8372 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8375 /* If the original number was negative and already
8376 integral, then the fractional part is -0.0. */
8380 }
8382 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8388 }
8391 }
8393 /* Given a location LOC, an interclass builtin function decl FNDECL
8394 and its single argument ARG, return an folded expression computing
8395 the same, or NULL_TREE if we either couldn't or didn't want to fold
8396 (the latter happen if there's an RTL instruction available). */
8398 static tree
8400 {
8401 machine_mode mode;
8413 /* If there is no optab, try generic code. */
8415 {
8416 tree result;
8419 {
8420 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8423 REAL_VALUE_TYPE r;
8427 {
8428 /* NaN and Inf are encoded in the high-order double value
8429 only. The low-order value is not significant. */
8433 }
8440 }
8443 {
8444 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8447 REAL_VALUE_TYPE r;
8451 {
8452 /* NaN and Inf are encoded in the high-order double value
8453 only. The low-order value is not significant. */
8457 }
8463 /*result = fold_build2_loc (loc, UNGT_EXPR,
8464 TREE_TYPE (TREE_TYPE (fndecl)),
8465 fold_build1_loc (loc, ABS_EXPR, type, arg),
8466 build_real (type, r));
8467 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8468 TREE_TYPE (TREE_TYPE (fndecl)),
8469 result);*/
8471 }
8473 {
8474 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8475 islessequal(fabs(x),DBL_MAX). */
8485 {
8486 /* Use double to test the normal range of IBM extended
8487 precision. Emin for IBM extended precision is
8488 different to emin for IEEE double, being 53 higher
8489 since the low double exponent is at least 53 lower
8490 than the high double exponent. */
8494 }
8506 {
8507 /* Testing the high end of the range is done just using
8508 the high double, using the same test as isfinite().
8509 For the subnormal end of the range we first test the
8510 high double, then if its magnitude is equal to the
8511 limit of 0x1p-969, we test whether the low double is
8512 non-zero and opposite sign to the high double. */
8528 integer_type_node,
8534 }
8535 else
8536 {
8537 tree const isge_fn
8540 }
8544 }
8547 }
8550 }
8552 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8553 ARG is the argument for the call. */
8555 static tree
8557 {
8564 {
8572 {
8573 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8574 /* In a boolean context, GCC will fold the inner COND_EXPR to
8575 1. So e.g. "if (isinf_sign(x))" would be folded to just
8576 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8584 {
8597 integer_zero_node);
8598 }
8601 }
8614 {
8617 {
8618 /* NaN and Inf are encoded in the high-order double value
8619 only. The low-order value is not significant. */
8621 }
8622 }
8628 }
8629 }
8631 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8632 This builtin will generate code to return the appropriate floating
8633 point classification depending on the value of the floating point
8634 number passed in. The possible return values must be supplied as
8635 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8636 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8637 one floating point argument which is "type generic". */
8639 static tree
8641 {
8644 machine_mode mode;
8645 REAL_VALUE_TYPE r;
8648 /* Verify the required arguments in the original call. */
8668 /* fpclassify(x) ->
8669 isnan(x) ? FP_NAN :
8670 (fabs(x) == Inf ? FP_INFINITE :
8671 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8672 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8686 {
8692 }
8695 {
8698 }
8701 }
8703 /* Fold a call to an unordered comparison function such as
8704 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8705 being called and ARG0 and ARG1 are the arguments for the call.
8706 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8707 the opposite of the desired result. UNORDERED_CODE is used
8708 for modes that can hold NaNs and ORDERED_CODE is used for
8709 the rest. */
8711 static tree
8715 {
8729 /* Choose the wider of two real types. */
8741 {
8745 }
8750 }
8752 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8753 arithmetics if it can never overflow, or into internal functions that
8754 return both result of arithmetics and overflowed boolean flag in
8755 a complex integer result, or some other check for overflow.
8756 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8757 checking part of that. */
8759 static tree
8762 {
8764 /* The code of the expression corresponding to the type-generic
8765 built-in, or ERROR_MARK for the type-specific ones. */
8770 {
8773 /* FALLTHRU */
8776 /* FALLTHRU */
8787 /* FALLTHRU */
8790 /* FALLTHRU */
8801 /* FALLTHRU */
8804 /* FALLTHRU */
8815 }
8817 /* For the "generic" overloads, the first two arguments can have different
8818 types and the last argument determines the target type to use to check
8819 for overflow. The arguments of the other overloads all have the same
8820 type. */
8823 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8824 arguments are constant, attempt to fold the built-in call into a constant
8825 expression indicating whether or not it detected an overflow. */
8829 /* Perform the computation in the target type and check for overflow. */
8833 arg2);
8847 tree store
8850 }
8852 /* Fold a call to __builtin_FILE to a constant string. */
8856 {
8861 }
8863 /* Fold a call to __builtin_FUNCTION to a constant string. */
8867 {
8874 }
8876 /* Fold a call to __builtin_LINE to an integer constant. */
8880 {
8882 }
8884 /* Fold a call to built-in function FNDECL with 0 arguments.
8885 This function returns NULL_TREE if no simplification was possible. */
8887 static tree
8889 {
8893 {
8919 }
8921 }
8923 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8924 This function returns NULL_TREE if no simplification was possible. */
8926 static tree
8928 {
8939 {
8941 {
8944 /* Gimplification will pull the CALL_EXPR for the builtin out of
8945 an if condition. When not optimizing, we'll not CSE it back.
8946 To avoid link error types of regressions, return false now. */
8951 }
9007 {
9012 }
9018 {
9023 }
9044 }
9048 }
9050 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9051 This function returns NULL_TREE if no simplification was possible. */
9053 static tree
9055 {
9067 {
9111 NOP_EXPR);
9113 /* We do the folding for va_start in the expander. */
9128 }
9130 }
9132 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9133 and ARG2.
9134 This function returns NULL_TREE if no simplification was possible. */
9136 static tree
9139 {
9153 {
9203 }
9205 }
9207 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9208 arguments. IGNORE is true if the result of the
9209 function call is ignored. This function returns NULL_TREE if no
9210 simplification was possible. */
9212 tree
9214 {
9218 {
9234 }
9236 {
9241 }
9243 }
9245 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9246 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9247 of arguments in ARGS to be omitted. OLDNARGS is the number of
9248 elements in ARGS. */
9250 static tree
9253 {
9258 {
9266 }
9267 else
9271 }
9273 /* Return true if FNDECL shouldn't be folded right now.
9274 If a built-in function has an inline attribute always_inline
9275 wrapper, defer folding it after always_inline functions have
9276 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9277 might not be performed. */
9279 bool
9281 {
9284 && cfun
9287 }
9289 /* A wrapper function for builtin folding that prevents warnings for
9290 "statement without effect" and the like, caused by removing the
9291 call node earlier than the warning is generated. */
9293 tree
9295 {
9301 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9302 yet. Defer folding until we see all the arguments
9303 (after inlining). */
9305 {
9308 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9309 instead last argument is __builtin_va_arg_pack (). Defer folding
9310 even in that case, until arguments are finalized. */
9312 {
9319 }
9327 else
9328 {
9333 }
9334 }
9336 }
9338 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9339 N arguments are passed in the array ARGARRAY. Return a folded
9340 expression or NULL_TREE if no simplification was possible. */
9342 tree
9344 tree fn,
9347 {
9354 {
9355 /* If last argument is __builtin_va_arg_pack (), arguments to this
9356 function are not finalized yet. Defer folding until they are. */
9358 {
9365 }
9370 else
9372 }
9375 }
9377 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9378 along with N new arguments specified as the "..." parameters. SKIP
9379 is the number of arguments in EXP to be omitted. This function is used
9380 to do varargs-to-varargs transformations. */
9382 static tree
9384 {
9386 tree t;
9394 }
9396 /* Validate a single argument ARG against a tree code CODE representing
9397 a type. Return true when argument is valid. */
9399 static bool
9401 {
9409 }
9411 /* This function validates the types of a function call argument list
9412 against a specified list of tree_codes. If the last specifier is a 0,
9413 that represents an ellipses, otherwise the last specifier must be a
9414 VOID_TYPE.
9416 This is the GIMPLE version of validate_arglist. Eventually we want to
9417 completely convert builtins.c to work from GIMPLEs and the tree based
9418 validate_arglist will then be removed. */
9420 bool
9422 {
9426 const_tree arg;
9432 do
9433 {
9436 {
9438 /* This signifies an ellipses, any further arguments are all ok. */
9442 /* This signifies an endlink, if no arguments remain, return
9443 true, otherwise return false. */
9447 /* If no parameters remain or the parameter's code does not
9448 match the specified code, return false. Otherwise continue
9449 checking any remaining arguments. */
9454 }
9455 }
9458 /* We need gotos here since we can only have one VA_CLOSE in a
9459 function. */
9460 end: ;
9464 }
9466 /* Default target-specific builtin expander that does nothing. */
9468 rtx
9470 rtx target ATTRIBUTE_UNUSED,
9471 rtx subtarget ATTRIBUTE_UNUSED,
9472 machine_mode mode ATTRIBUTE_UNUSED,
9474 {
9476 }
9478 /* Returns true is EXP represents data that would potentially reside
9479 in a readonly section. */
9481 bool
9483 {
9493 /* Make sure we call decl_readonly_section only for trees it
9494 can handle (since it returns true for everything it doesn't
9495 understand). */
9500 else
9502 }
9504 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9505 to the call, and TYPE is its return type.
9507 Return NULL_TREE if no simplification was possible, otherwise return the
9508 simplified form of the call as a tree.
9510 The simplified form may be a constant or other expression which
9511 computes the same value, but in a more efficient manner (including
9512 calls to other builtin functions).
9514 The call may contain arguments which need to be evaluated, but
9515 which are not useful to determine the result of the call. In
9516 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9517 COMPOUND_EXPR will be an argument which must be evaluated.
9518 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9519 COMPOUND_EXPR in the chain will contain the tree for the simplified
9520 form of the builtin function call. */
9522 static tree
9524 {
9528 else
9529 {
9530 tree fn;
9539 {
9541 tree tem;
9546 /* Return an offset into the constant string argument. */
9549 }
9552 /* strpbrk(x, "") == NULL.
9553 Evaluate and ignore s1 in case it had side-effects. */
9563 /* New argument list transforming strpbrk(s1, s2) to
9564 strchr(s1, s2[0]). */
9567 }
9568 }
9570 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9571 to the call.
9573 Return NULL_TREE if no simplification was possible, otherwise return the
9574 simplified form of the call as a tree.
9576 The simplified form may be a constant or other expression which
9577 computes the same value, but in a more efficient manner (including
9578 calls to other builtin functions).
9580 The call may contain arguments which need to be evaluated, but
9581 which are not useful to determine the result of the call. In
9582 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9583 COMPOUND_EXPR will be an argument which must be evaluated.
9584 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9585 COMPOUND_EXPR in the chain will contain the tree for the simplified
9586 form of the builtin function call. */
9588 static tree
9590 {
9594 else
9595 {
9598 /* If either argument is "", return NULL_TREE. */
9600 /* Evaluate and ignore both arguments in case either one has
9601 side-effects. */
9605 }
9606 }
9608 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9609 to the call.
9611 Return NULL_TREE if no simplification was possible, otherwise return the
9612 simplified form of the call as a tree.
9614 The simplified form may be a constant or other expression which
9615 computes the same value, but in a more efficient manner (including
9616 calls to other builtin functions).
9618 The call may contain arguments which need to be evaluated, but
9619 which are not useful to determine the result of the call. In
9620 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9621 COMPOUND_EXPR will be an argument which must be evaluated.
9622 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9623 COMPOUND_EXPR in the chain will contain the tree for the simplified
9624 form of the builtin function call. */
9626 static tree
9628 {
9632 else
9633 {
9634 /* If the first argument is "", return NULL_TREE. */
9637 {
9638 /* Evaluate and ignore argument s2 in case it has
9639 side-effects. */
9642 }
9644 /* If the second argument is "", return __builtin_strlen(s1). */
9647 {
9650 /* If the replacement _DECL isn't initialized, don't do the
9651 transformation. */
9656 }
9658 }
9659 }
9661 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9662 produced. False otherwise. This is done so that we don't output the error
9663 or warning twice or three times. */
9665 bool
9667 {
9670 tree arg;
9671 /* There is good chance the current input_location points inside the
9672 definition of the va_start macro (perhaps on the token for
9673 builtin) in a system header, so warnings will not be emitted.
9674 Use the location in real source code. */
9675 source_location current_location =
9677 NULL);
9680 {
9683 }
9686 {
9688 {
9691 }
9693 }
9694 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9695 when we checked the arguments and if needed issued a warning. */
9696 else
9697 {
9699 {
9700 /* Evidently an out of date version of <stdarg.h>; can't validate
9701 va_start's second argument, but can still work as intended. */
9703 OPT_Wvarargs,
9706 }
9708 {
9711 }
9713 }
9718 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9719 or __builtin_next_arg (0) the first time we see it, after checking
9720 the arguments and if needed issuing a warning. */
9722 {
9725 /* Strip off all nops for the sake of the comparison. This
9726 is not quite the same as STRIP_NOPS. It does more.
9727 We must also strip off INDIRECT_EXPR for C++ reference
9728 parameters. */
9733 {
9734 /* FIXME: Sometimes with the tree optimizers we can get the
9735 not the last argument even though the user used the last
9736 argument. We just warn and set the arg to be the last
9737 argument so that we will get wrong-code because of
9738 it. */
9740 OPT_Wvarargs,
9742 }
9744 /* Undefined by C99 7.15.1.4p4 (va_start):
9745 "If the parameter parmN is declared with the register storage
9746 class, with a function or array type, or with a type that is
9747 not compatible with the type that results after application of
9748 the default argument promotions, the behavior is undefined."
9749 */
9751 {
9753 OPT_Wvarargs,
9754 "undefined behavior when second parameter of "
9756 }
9758 /* We want to verify the second parameter just once before the tree
9759 optimizers are run and then avoid keeping it in the tree,
9760 as otherwise we could warn even for correct code like:
9761 void foo (int i, ...)
9762 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9765 else
9767 }
9769 }
9772 /* Expand a call EXP to __builtin_object_size. */
9774 static rtx
9776 {
9777 tree ost;
9782 {
9787 }
9795 {
9800 }
9805 }
9807 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9808 FCODE is the BUILT_IN_* to use.
9809 Return NULL_RTX if we failed; the caller should emit a normal call,
9810 otherwise try to get the result in TARGET, if convenient (and in
9811 mode MODE if that's convenient). */
9813 static rtx
9816 {
9818 POINTER_TYPE,
9819 fcode == BUILT_IN_MEMSET_CHK
9836 {
9837 /* Avoid transforming the checking call to an ordinary one when
9838 an overflow has been detected or when the call couldn't be
9839 validated because the size is not constant. */
9844 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9845 mem{cpy,pcpy,move,set} is available. */
9847 {
9862 }
9871 }
9874 else
9875 {
9878 /* If DEST is not a pointer type, call the normal function. */
9882 /* If SRC and DEST are the same (and not volatile), do nothing. */
9884 {
9885 tree expr;
9888 {
9889 /* Evaluate and ignore LEN in case it has side-effects. */
9892 }
9896 }
9898 /* __memmove_chk special case. */
9900 {
9906 /* If src is categorized for a readonly section we can use
9907 normal __memcpy_chk. */
9909 {
9918 }
9919 }
9921 }
9922 }
9924 /* Emit warning if a buffer overflow is detected at compile time. */
9926 static void
9928 {
9929 /* The source string. */
9931 /* The size of the destination object. */
9933 /* The string that is being concatenated with (as in __strcat_chk)
9934 or null if it isn't. */
9936 /* The maximum length of the source sequence in a bounded operation
9937 (such as __strncat_chk) or null if the operation isn't bounded
9938 (such as __strcat_chk). */
9940 /* The exact size of the access (such as in __strncpy_chk). */
9944 {
9952 /* For __strcat_chk the warning will be emitted only if overflowing
9953 by at least strlen (dest) + 1 bytes. */
9980 }
9983 {
9984 /* Check __strncat_chk. There is no way to determine the length
9985 of the string to which the source string is being appended so
9986 just warn when the length of the source string is not known. */
9989 }
9991 /* The destination argument is the first one for all built-ins above. */
9995 }
9997 /* Emit warning if a buffer overflow is detected at compile time
9998 in __sprintf_chk/__vsprintf_chk calls. */
10000 static void
10002 {
10007 /* Verify the required arguments in the original call. */
10017 /* Check whether the format is a literal string constant. */
10025 /* If the format doesn't contain % args or %%, we know its size. */
10028 /* If the format is "%s" and first ... argument is a string literal,
10029 we know it too. */
10032 {
10033 tree arg;
10044 }
10045 else
10048 /* Add one for the terminating nul. */
10053 }
10055 /* Emit warning if a free is called with address of a variable. */
10057 static void
10059 {
10073 else
10076 }
10078 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10079 if possible. */
10081 static tree
10083 {
10100 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10101 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10102 and (size_t) 0 for types 2 and 3. */
10107 {
10111 }
10113 {
10114 /* If object size is not known yet, delay folding until
10115 later. Maybe subsequent passes will help determining
10116 it. */
10120 }
10123 }
10125 /* Builtins with folding operations that operate on "..." arguments
10126 need special handling; we need to store the arguments in a convenient
10127 data structure before attempting any folding. Fortunately there are
10128 only a few builtins that fall into this category. FNDECL is the
10129 function, EXP is the CALL_EXPR for the call. */
10131 static tree
10133 {
10138 {
10145 }
10147 {
10152 }
10154 }
10156 /* Initialize format string characters in the target charset. */
10158 bool
10160 {
10163 {
10186 }
10188 }
10190 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10191 and no overflow/underflow occurred. INEXACT is true if M was not
10192 exactly calculated. TYPE is the tree type for the result. This
10193 function assumes that you cleared the MPFR flags and then
10194 calculated M to see if anything subsequently set a flag prior to
10195 entering this function. Return NULL_TREE if any checks fail. */
10197 static tree
10199 {
10200 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10201 overflow/underflow occurred. If -frounding-math, proceed iff the
10202 result of calling FUNC was exact. */
10205 {
10206 REAL_VALUE_TYPE rr;
10209 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10210 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10211 but the mpft_t is not, then we underflowed in the
10212 conversion. */
10215 {
10216 REAL_VALUE_TYPE rmode;
10219 /* Proceed iff the specified mode can hold the value. */
10222 }
10223 }
10225 }
10227 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10228 number and no overflow/underflow occurred. INEXACT is true if M
10229 was not exactly calculated. TYPE is the tree type for the result.
10230 This function assumes that you cleared the MPFR flags and then
10231 calculated M to see if anything subsequently set a flag prior to
10232 entering this function. Return NULL_TREE if any checks fail, if
10233 FORCE_CONVERT is true, then bypass the checks. */
10235 static tree
10237 {
10238 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10239 overflow/underflow occurred. If -frounding-math, proceed iff the
10240 result of calling FUNC was exact. */
10245 {
10250 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10251 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10252 but the mpft_t is not, then we underflowed in the
10253 conversion. */
10258 {
10263 /* Proceed iff the specified mode can hold the value. */
10269 }
10270 }
10272 }
10274 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10275 the pointer *(ARG_QUO) and return the result. The type is taken
10276 from the type of ARG0 and is used for setting the precision of the
10277 calculation and results. */
10279 static tree
10281 {
10288 /* To proceed, MPFR must exactly represent the target floating point
10289 format, which only happens when the target base equals two. */
10293 {
10298 {
10302 tree result_rem;
10311 /* Remquo is independent of the rounding mode, so pass
10312 inexact=0 to do_mpfr_ckconv(). */
10316 {
10317 /* MPFR calculates quo in the host's long so it may
10318 return more bits in quo than the target int can hold
10319 if sizeof(host long) > sizeof(target int). This can
10320 happen even for native compilers in LP64 mode. In
10321 these cases, modulo the quo value with the largest
10322 number that the target int can hold while leaving one
10323 bit for the sign. */
10327 /* Dereference the quo pointer argument. */
10329 /* Proceed iff a valid pointer type was passed in. */
10331 {
10332 /* Set the value. */
10333 tree result_quo
10336 integer_quo));
10338 /* Combine the quo assignment with the rem. */
10341 }
10342 }
10343 }
10344 }
10346 }
10348 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10349 resulting value as a tree with type TYPE. The mpfr precision is
10350 set to the precision of TYPE. We assume that this mpfr function
10351 returns zero if the result could be calculated exactly within the
10352 requested precision. In addition, the integer pointer represented
10353 by ARG_SG will be dereferenced and set to the appropriate signgam
10354 (-1,1) value. */
10356 static tree
10358 {
10363 /* To proceed, MPFR must exactly represent the target floating point
10364 format, which only happens when the target base equals two. Also
10365 verify ARG is a constant and that ARG_SG is an int pointer. */
10370 {
10373 /* In addition to NaN and Inf, the argument cannot be zero or a
10374 negative integer. */
10378 {
10383 mpfr_t m;
10384 tree result_lg;
10393 {
10394 tree result_sg;
10396 /* Dereference the arg_sg pointer argument. */
10398 /* Assign the signgam value into *arg_sg. */
10403 /* Combine the signgam assignment with the lgamma result. */
10406 }
10407 }
10408 }
10411 }
10413 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10414 mpc function FUNC on it and return the resulting value as a tree
10415 with type TYPE. The mpfr precision is set to the precision of
10416 TYPE. We assume that function FUNC returns zero if the result
10417 could be calculated exactly within the requested precision. If
10418 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10419 in the arguments and/or results. */
10421 tree
10424 {
10430 /* To proceed, MPFR must exactly represent the target floating point
10431 format, which only happens when the target base equals two. */
10437 {
10446 {
10466 }
10467 }
10470 }
10472 /* A wrapper function for builtin folding that prevents warnings for
10473 "statement without effect" and the like, caused by removing the
10474 call node earlier than the warning is generated. */
10476 tree
10478 {
10486 {
10495 {
10497 }
10498 else
10499 {
10502 {
10503 /* Propagate location information from original call to
10504 expansion of builtin. Otherwise things like
10505 maybe_emit_chk_warning, that operate on the expansion
10506 of a builtin, will use the wrong location information. */
10508 {
10516 }
10518 }
10519 }
10520 }
10522 }
10524 /* Look up the function in builtin_decl that corresponds to DECL
10525 and set ASMSPEC as its user assembler name. DECL must be a
10526 function decl that declares a builtin. */
10528 void
10530 {
10540 {
10544 }
10545 }
10547 /* Return true if DECL is a builtin that expands to a constant or similarly
10548 simple code. */
10549 bool
10551 {
10554 {
10555 /* Builtins that expand to constants. */
10560 /* Simple register moves or loads from stack. */
10571 /* Exception state returns or moves registers around. */
10579 }
10582 }
10584 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10585 most probably expanded inline into reasonably simple code. This is a
10586 superset of is_simple_builtin. */
10587 bool
10589 {
10596 {
10598 CASE_BUILT_IN_ALLOCA:
10664 }
10667 }
10669 /* Return true if T is a constant and the value cast to a target char
10670 can be represented by a host char.
10671 Store the casted char constant in *P if so. */
10673 bool
10675 {
10681 }
10683 /* Return the maximum object size. */
10685 tree
10687 {
10688 /* To do: Make this a configurable parameter. */
10690 }