| blob | 753809f2357009a062e5bc7e742d5f2380d9c3d8 |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2017 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 {
1367 machine_mode mode;
1369 /* The values computed by this function never change. */
1371 {
1372 /* The first value is the incoming arg-pointer. */
1375 /* The second value is the structure value address unless this is
1376 passed as an "invisible" first argument. */
1382 {
1392 }
1393 else
1394 {
1396 }
1397 }
1399 }
1401 /* Return the size required for the block returned by __builtin_apply,
1402 and initialize apply_result_mode. */
1404 static int
1406 {
1409 machine_mode mode;
1411 /* The values computed by this function never change. */
1413 {
1418 {
1428 }
1429 else
1432 /* Allow targets that use untyped_call and untyped_return to override
1433 the size so that machine-specific information can be stored here. */
1434 #ifdef APPLY_RESULT_SIZE
1436 #endif
1437 }
1439 }
1441 /* Create a vector describing the result block RESULT. If SAVEP is true,
1442 the result block is used to save the values; otherwise it is used to
1443 restore the values. */
1445 static rtx
1447 {
1449 machine_mode mode;
1456 {
1466 }
1468 }
1470 /* Save the state required to perform an untyped call with the same
1471 arguments as were passed to the current function. */
1473 static rtx
1475 {
1478 machine_mode mode;
1479 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1481 /* Create a block where the arg-pointer, structure value address,
1482 and argument registers can be saved. */
1485 /* Walk past the arg-pointer and structure value address. */
1490 /* Save each register used in calling a function to the block. */
1493 {
1502 }
1504 /* Save the arg pointer to the block. */
1506 /* We need the pointer as the caller actually passed them to us, not
1507 as we might have pretended they were passed. Make sure it's a valid
1508 operand, as emit_move_insn isn't expected to handle a PLUS. */
1510 tem
1513 NULL_RTX);
1518 /* Save the structure value address unless this is passed as an
1519 "invisible" first argument. */
1521 {
1525 }
1527 /* Return the address of the block. */
1529 }
1531 /* __builtin_apply_args returns block of memory allocated on
1532 the stack into which is stored the arg pointer, structure
1533 value address, static chain, and all the registers that might
1534 possibly be used in performing a function call. The code is
1535 moved to the start of the function so the incoming values are
1536 saved. */
1538 static rtx
1540 {
1541 /* Don't do __builtin_apply_args more than once in a function.
1542 Save the result of the first call and reuse it. */
1545 {
1546 /* When this function is called, it means that registers must be
1547 saved on entry to this function. So we migrate the
1548 call to the first insn of this function. */
1549 rtx temp;
1558 /* Put the insns after the NOTE that starts the function.
1559 If this is inside a start_sequence, make the outer-level insn
1560 chain current, so the code is placed at the start of the
1561 function. If internal_arg_pointer is a non-virtual pseudo,
1562 it needs to be placed after the function that initializes
1563 that pseudo. */
1568 else
1572 }
1573 }
1575 /* Perform an untyped call and save the state required to perform an
1576 untyped return of whatever value was returned by the given function. */
1578 static rtx
1580 {
1582 machine_mode mode;
1591 /* Create a block where the return registers can be saved. */
1594 /* Fetch the arg pointer from the ARGUMENTS block. */
1601 /* Push a new argument block and copy the arguments. Do not allow
1602 the (potential) memcpy call below to interfere with our stack
1603 manipulations. */
1605 NO_DEFER_POP;
1607 /* Save the stack with nonlocal if available. */
1610 else
1613 /* Allocate a block of memory onto the stack and copy the memory
1614 arguments to the outgoing arguments address. We can pass TRUE
1615 as the 4th argument because we just saved the stack pointer
1616 and will restore it right after the call. */
1619 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1620 may have already set current_function_calls_alloca to true.
1621 current_function_calls_alloca won't be set if argsize is zero,
1622 so we have to guarantee need_drap is true here. */
1628 {
1631 else
1633 }
1640 /* Refer to the argument block. */
1645 /* Walk past the arg-pointer and structure value address. */
1650 /* Restore each of the registers previously saved. Make USE insns
1651 for each of these registers for use in making the call. */
1654 {
1662 }
1664 /* Restore the structure value address unless this is passed as an
1665 "invisible" first argument. */
1668 {
1675 }
1677 /* All arguments and registers used for the call are set up by now! */
1680 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1681 and we don't want to load it into a register as an optimization,
1682 because prepare_call_address already did it if it should be done. */
1686 /* Generate the actual call instruction and save the return value. */
1688 {
1692 }
1694 {
1697 /* Locate the unique return register. It is not possible to
1698 express a call that sets more than one return register using
1699 call_value; use untyped_call for that. In fact, untyped_call
1700 only needs to save the return registers in the given block. */
1703 {
1707 }
1714 }
1715 else
1718 /* Find the CALL insn we just emitted, and attach the register usage
1719 information. */
1723 /* Restore the stack. */
1726 else
1730 OK_DEFER_POP;
1732 /* Return the address of the result block. */
1735 }
1737 /* Perform an untyped return. */
1739 static void
1741 {
1743 machine_mode mode;
1744 rtx reg;
1753 {
1758 }
1760 /* Restore the return value and note that each value is used. */
1764 {
1776 }
1778 /* Put the USE insns before the return. */
1781 /* Return whatever values was restored by jumping directly to the end
1782 of the function. */
1784 }
1786 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1788 static enum type_class
1790 {
1792 {
1811 }
1812 }
1814 /* Expand a call EXP to __builtin_classify_type. */
1816 static rtx
1818 {
1822 }
1824 /* This helper macro, meant to be used in mathfn_built_in below, determines
1825 which among a set of builtin math functions is appropriate for a given type
1826 mode. The `F' (float) and `L' (long double) are automatically generated
1827 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1828 types, there are additional types that are considered with 'F32', 'F64',
1829 'F128', etc. suffixes. */
1830 #define CASE_MATHFN(MATHFN) \
1831 CASE_CFN_##MATHFN: \
1832 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1833 fcodel = BUILT_IN_##MATHFN##L ; break;
1834 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1835 types. */
1836 #define CASE_MATHFN_FLOATN(MATHFN) \
1837 CASE_CFN_##MATHFN: \
1838 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1839 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1840 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1841 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1842 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1843 break;
1844 /* Similar to above, but appends _R after any F/L suffix. */
1845 #define CASE_MATHFN_REENT(MATHFN) \
1846 case CFN_BUILT_IN_##MATHFN##_R: \
1847 case CFN_BUILT_IN_##MATHFN##F_R: \
1848 case CFN_BUILT_IN_##MATHFN##L_R: \
1849 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1850 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1852 /* Return a function equivalent to FN but operating on floating-point
1853 values of type TYPE, or END_BUILTINS if no such function exists.
1854 This is purely an operation on function codes; it does not guarantee
1855 that the target actually has an implementation of the function. */
1857 static built_in_function
1859 {
1860 tree mtype;
1871 {
1962 }
1985 else
1987 }
1989 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1990 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1991 otherwise use the explicit declaration. If we can't do the conversion,
1992 return null. */
1994 static tree
1996 {
2005 }
2007 /* Like mathfn_built_in_1, but always use the implicit array. */
2009 tree
2011 {
2013 }
2015 /* Like mathfn_built_in_1, but take a built_in_function and
2016 always use the implicit array. */
2018 tree
2020 {
2022 }
2024 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2025 return its code, otherwise return IFN_LAST. Note that this function
2026 only tests whether the function is defined in internals.def, not whether
2027 it is actually available on the target. */
2029 internal_fn
2031 {
2035 {
2036 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2037 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2038 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2039 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2040 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2041 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2042 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2059 }
2060 }
2062 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2063 on the current target by a call to an internal function, return the
2064 code of that internal function, otherwise return IFN_LAST. The caller
2065 is responsible for ensuring that any side-effects of the built-in
2066 call are dealt with correctly. E.g. if CALL sets errno, the caller
2067 must decide that the errno result isn't needed or make it available
2068 in some other way. */
2070 internal_fn
2072 {
2074 {
2077 {
2082 }
2083 }
2085 }
2087 /* Expand a call to the builtin trinary math functions (fma).
2088 Return NULL_RTX if a normal call should be emitted rather than expanding the
2089 function in-line. EXP is the expression that is a call to the builtin
2090 function; if convenient, the result should be placed in TARGET.
2091 SUBTARGET may be used as the target for computing one of EXP's
2092 operands. */
2094 static rtx
2096 {
2097 optab builtin_optab;
2102 machine_mode mode;
2112 {
2118 }
2120 /* Make a suitable register to place result in. */
2123 /* Before working hard, check whether the instruction is available. */
2129 /* Always stabilize the argument list. */
2140 /* Compute into RESULT.
2141 Set RESULT to wherever the result comes back. */
2145 /* If we were unable to expand via the builtin, stop the sequence
2146 (without outputting the insns) and call to the library function
2147 with the stabilized argument list. */
2149 {
2152 }
2154 /* Output the entire sequence. */
2160 }
2162 /* Expand a call to the builtin sin and cos math functions.
2163 Return NULL_RTX if a normal call should be emitted rather than expanding the
2164 function in-line. EXP is the expression that is a call to the builtin
2165 function; if convenient, the result should be placed in TARGET.
2166 SUBTARGET may be used as the target for computing one of EXP's
2167 operands. */
2169 static rtx
2171 {
2172 optab builtin_optab;
2173 rtx op0;
2176 machine_mode mode;
2177 tree arg;
2185 {
2191 }
2193 /* Make a suitable register to place result in. */
2196 /* Check if sincos insn is available, otherwise fallback
2197 to sin or cos insn. */
2200 {
2207 }
2209 /* Before working hard, check whether the instruction is available. */
2211 {
2214 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2215 need to expand the argument again. This way, we will not perform
2216 side-effects more the once. */
2223 /* Compute into RESULT.
2224 Set RESULT to wherever the result comes back. */
2226 {
2230 {
2239 }
2241 }
2242 else
2246 {
2247 /* Output the entire sequence. */
2252 }
2254 /* If we were unable to expand via the builtin, stop the sequence
2255 (without outputting the insns) and call to the library function
2256 with the stabilized argument list. */
2258 }
2261 }
2263 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2264 return an RTL instruction code that implements the functionality.
2265 If that isn't possible or available return CODE_FOR_nothing. */
2267 static enum insn_code
2269 {
2272 machine_mode mode;
2275 {
2289 /* These builtins have no optabs (yet). */
2293 }
2295 /* There's no easy way to detect the case we need to set EDOM. */
2299 /* Optab mode depends on the mode of the input argument. */
2305 }
2307 /* Expand a call to one of the builtin math functions that operate on
2308 floating point argument and output an integer result (ilogb, isinf,
2309 isnan, etc).
2310 Return 0 if a normal call should be emitted rather than expanding the
2311 function in-line. EXP is the expression that is a call to the builtin
2312 function; if convenient, the result should be placed in TARGET. */
2314 static rtx
2316 {
2318 rtx op0;
2320 machine_mode mode;
2321 tree arg;
2331 {
2336 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2337 need to expand the argument again. This way, we will not perform
2338 side-effects more the once. */
2353 }
2356 }
2358 /* Expand a call to the builtin sincos math function.
2359 Return NULL_RTX if a normal call should be emitted rather than expanding the
2360 function in-line. EXP is the expression that is a call to the builtin
2361 function. */
2363 static rtx
2365 {
2367 machine_mode mode;
2381 /* Make a suitable register to place result in. */
2384 /* Check if sincos insn is available, otherwise emit the call. */
2399 /* Compute into target1 and target2.
2400 Set TARGET to wherever the result comes back. */
2404 /* Move target1 and target2 to the memory locations indicated
2405 by op1 and op2. */
2410 }
2412 /* Expand a call to the internal cexpi builtin to the sincos math function.
2413 EXP is the expression that is a call to the builtin function; if convenient,
2414 the result should be placed in TARGET. */
2416 static rtx
2418 {
2421 machine_mode mode;
2432 /* Try expanding via a sincos optab, fall back to emitting a libcall
2433 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2434 is only generated from sincos, cexp or if we have either of them. */
2436 {
2442 /* Compute into op1 and op2. */
2444 }
2446 {
2457 else
2467 /* Make sure not to fold the sincos call again. */
2471 }
2472 else
2473 {
2483 else
2486 /* If we don't have a decl for cexp create one. This is the
2487 friendliest fallback if the user calls __builtin_cexpi
2488 without full target C99 function support. */
2490 {
2491 tree fntype;
2503 }
2508 /* Make sure not to fold the cexp call again. */
2512 }
2514 /* Now build the proper return type. */
2519 }
2521 /* Conveniently construct a function call expression. FNDECL names the
2522 function to be called, N is the number of arguments, and the "..."
2523 parameters are the argument expressions. Unlike build_call_exr
2524 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2526 static tree
2528 {
2538 }
2540 /* Expand a call to one of the builtin rounding functions gcc defines
2541 as an extension (lfloor and lceil). As these are gcc extensions we
2542 do not need to worry about setting errno to EDOM.
2543 If expanding via optab fails, lower expression to (int)(floor(x)).
2544 EXP is the expression that is a call to the builtin function;
2545 if convenient, the result should be placed in TARGET. */
2547 static rtx
2549 {
2550 convert_optab builtin_optab;
2555 tree fallback_fndecl;
2556 machine_mode mode;
2557 tree arg;
2565 {
2582 }
2584 /* Make a suitable register to place result in. */
2589 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2590 need to expand the argument again. This way, we will not perform
2591 side-effects more the once. */
2598 /* Compute into TARGET. */
2600 {
2601 /* Output the entire sequence. */
2606 }
2608 /* If we were unable to expand via the builtin, stop the sequence
2609 (without outputting the insns). */
2612 /* Fall back to floating point rounding optab. */
2615 /* For non-C99 targets we may end up without a fallback fndecl here
2616 if the user called __builtin_lfloor directly. In this case emit
2617 a call to the floor/ceil variants nevertheless. This should result
2618 in the best user experience for not full C99 targets. */
2620 {
2621 tree fntype;
2625 {
2658 }
2663 }
2670 /* Truncate the result of floating point optab to integer
2671 via expand_fix (). */
2676 }
2678 /* Expand a call to one of the builtin math functions doing integer
2679 conversion (lrint).
2680 Return 0 if a normal call should be emitted rather than expanding the
2681 function in-line. EXP is the expression that is a call to the builtin
2682 function; if convenient, the result should be placed in TARGET. */
2684 static rtx
2686 {
2687 convert_optab builtin_optab;
2688 rtx op0;
2691 tree arg;
2692 machine_mode mode;
2701 {
2720 }
2722 /* There's no easy way to detect the case we need to set EDOM. */
2726 /* Make a suitable register to place result in. */
2729 /* There's no easy way to detect the case we need to set EDOM. */
2731 {
2734 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2735 need to expand the argument again. This way, we will not perform
2736 side-effects more the once. */
2744 {
2745 /* Output the entire sequence. */
2750 }
2752 /* If we were unable to expand via the builtin, stop the sequence
2753 (without outputting the insns) and call to the library function
2754 with the stabilized argument list. */
2756 }
2759 {
2760 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2761 targets, (int) round (x) should never be transformed into
2762 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2763 a call to lround in the hope that the target provides at least some
2764 C99 functions. This should result in the best user experience for
2765 not full C99 targets. */
2766 tree fallback_fndecl = mathfn_built_in_1
2775 }
2778 }
2780 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2781 a normal call should be emitted rather than expanding the function
2782 in-line. EXP is the expression that is a call to the builtin
2783 function; if convenient, the result should be placed in TARGET. */
2785 static rtx
2787 {
2790 machine_mode mode;
2791 machine_mode mode2;
2800 /* Emit a libcall to libgcc. */
2802 /* Mode of the 2nd argument must match that of an int. */
2820 }
2822 /* Expand expression EXP which is a call to the strlen builtin. Return
2823 NULL_RTX if we failed the caller should emit a normal call, otherwise
2824 try to get the result in TARGET, if convenient. */
2826 static rtx
2828 machine_mode target_mode)
2829 {
2834 rtx pat;
2835 tree len;
2837 rtx src_reg;
2839 machine_mode insn_mode;
2843 /* If the length can be computed at compile-time, return it. */
2848 /* If the length can be computed at compile-time and is constant
2849 integer, but there are side-effects in src, evaluate
2850 src for side-effects, then return len.
2851 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2852 can be optimized into: i++; x = 3; */
2855 {
2858 }
2862 /* If SRC is not a pointer type, don't do this operation inline. */
2866 /* Bail out if we can't compute strlen in the right mode. */
2868 {
2872 }
2876 /* Make a place to hold the source address. We will not expand
2877 the actual source until we are sure that the expansion will
2878 not fail -- there are trees that cannot be expanded twice. */
2881 /* Mark the beginning of the strlen sequence so we can emit the
2882 source operand later. */
2892 /* Check to see if the argument was declared attribute nonstring
2893 and if so, issue a warning since at this point it's not known
2894 to be nul-terminated. */
2897 /* Now that we are assured of success, expand the source. */
2901 {
2902 #ifdef POINTERS_EXTEND_UNSIGNED
2905 POINTERS_EXTEND_UNSIGNED);
2906 #endif
2908 }
2914 else
2917 /* Return the value in the proper mode for this function. */
2922 else
2926 }
2928 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2929 bytes from constant string DATA + OFFSET and return it as target
2930 constant. */
2932 static rtx
2934 scalar_int_mode mode)
2935 {
2943 }
2945 /* LEN specify length of the block of memcpy/memset operation.
2946 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2947 In some cases we can make very likely guess on max size, then we
2948 set it into PROBABLE_MAX_SIZE. */
2950 static void
2955 {
2957 {
2960 }
2961 else
2962 {
2966 /* Determine bounds from the type. */
2969 else
2974 else
2980 {
2985 }
2987 {
2988 /* Anti range 0...N lets us to determine minimal size to N+1. */
2990 {
2993 }
2994 /* Code like
2996 int n;
2997 if (n < 100)
2998 memcpy (a, b, n)
3000 Produce anti range allowing negative values of N. We still
3001 can use the information and make a guess that N is not negative.
3002 */
3005 }
3006 }
3010 }
3012 /* Try to verify that the sizes and lengths of the arguments to a string
3013 manipulation function given by EXP are within valid bounds and that
3014 the operation does not lead to buffer overflow or read past the end.
3015 Arguments other than EXP may be null. When non-null, the arguments
3016 have the following meaning:
3017 DST is the destination of a copy call or NULL otherwise.
3018 SRC is the source of a copy call or NULL otherwise.
3019 DSTWRITE is the number of bytes written into the destination obtained
3020 from the user-supplied size argument to the function (such as in
3021 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3022 MAXREAD is the user-supplied bound on the length of the source sequence
3023 (such as in strncat(d, s, N). It specifies the upper limit on the number
3024 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3025 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3026 expression EXP is a string function call (as opposed to a memory call
3027 like memcpy). As an exception, SRCSTR can also be an integer denoting
3028 the precomputed size of the source string or object (for functions like
3029 memcpy).
3030 DSTSIZE is the size of the destination object specified by the last
3031 argument to the _chk builtins, typically resulting from the expansion
3032 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3033 DSTSIZE).
3035 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3036 SIZE_MAX.
3038 If the call is successfully verified as safe return true, otherwise
3039 return false. */
3041 static bool
3044 {
3047 /* The size of the largest object is half the address space, or
3048 PTRDIFF_MAX. (This is way too permissive.) */
3051 /* Either the length of the source string for string functions or
3052 the size of the source object for raw memory functions. */
3057 /* Set to true when the exact number of bytes written by a string
3058 function like strcpy is not known and the only thing that is
3059 known is that it must be at least one (for the terminating nul). */
3062 {
3063 /* SRCSTR is normally a pointer to string but as a special case
3064 it can be an integer denoting the length of a string. */
3066 {
3067 /* Try to determine the range of lengths the source string
3068 refers to. If it can be determined and is less than
3069 the upper bound given by MAXREAD add one to it for
3070 the terminating nul. Otherwise, set it to one for
3071 the same reason, or to MAXREAD as appropriate. */
3074 {
3077 else
3088 }
3089 else
3090 {
3093 }
3094 }
3095 else
3097 }
3100 {
3101 /* When the only available piece of data is the object size
3102 there is nothing to do. */
3106 /* Otherwise, when the length of the source sequence is known
3107 (as with strlen), set DSTWRITE to it. */
3110 }
3120 /* First check the number of bytes to be written against the maximum
3121 object size. */
3123 {
3129 "%K%qD specified size %E "
3132 else
3134 "%K%qD specified size between %E and %E "
3139 }
3141 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3142 constant, and in range of unsigned HOST_WIDE_INT. */
3145 /* Next check the number of bytes to be written against the destination
3146 object size. */
3148 {
3154 {
3159 {
3160 /* This is a call to strcpy with a destination of 0 size
3161 and a source of unknown length. The call will write
3162 at least one byte past the end of the destination. */
3164 "%K%qD writing %E or more bytes into a region "
3167 }
3177 {
3178 /* Avoid printing the upper bound if it's invalid. */
3180 "%K%qD writing %E or more bytes into a region "
3183 }
3184 else
3186 "%K%qD writing between %E and %E bytes into "
3189 dstsize);
3191 /* Return error when an overflow has been detected. */
3193 }
3194 }
3196 /* Check the maximum length of the source sequence against the size
3197 of the destination object if known, or against the maximum size
3198 of an object. */
3200 {
3203 /* Use the lower end for MAXREAD from now on. */
3208 {
3213 {
3214 /* Warn about crazy big sizes first since that's more
3215 likely to be meaningful than saying that the bound
3216 is greater than the object size if both are big. */
3219 "%K%qD specified bound %E "
3223 else
3225 "%K%qD specified bound between %E and %E "
3231 }
3234 {
3237 "%K%qD specified bound %E "
3241 else
3243 "%K%qD specified bound between %E and %E "
3248 }
3249 }
3250 }
3252 /* Check for reading past the end of SRC. */
3257 {
3267 {
3268 /* Avoid printing the upper bound if it's invalid. */
3270 "%K%qD reading %E or more bytes from a region "
3273 }
3274 else
3276 "%K%qD reading between %E and %E bytes from a region "
3280 }
3283 }
3285 /* Helper to compute the size of the object referenced by the DEST
3286 expression which must have pointer type, using Object Size type
3287 OSTYPE (only the least significant 2 bits are used). Return
3288 an estimate of the size of the object if successful or NULL when
3289 the size cannot be determined. When the referenced object involves
3290 a non-constant offset in some range the returned value represents
3291 the largest size given the smallest non-negative offset in the
3292 range. The function is intended for diagnostics and should not
3293 be used to influence code generation or optimization. */
3295 tree
3297 {
3300 /* Only the two least significant bits are meaningful. */
3307 {
3316 {
3317 /* compute_builtin_object_size fails for addresses with
3318 non-constant offsets. Try to determine the range of
3319 such an offset here and use it to adjus the constant
3320 size. */
3324 {
3329 {
3331 {
3334 /* Ignore negative offsets for now. For others,
3335 use the lower bound as the most optimistic
3336 estimate of the (remaining)size. */
3338 ;
3342 else
3344 }
3345 }
3346 }
3347 }
3350 }
3352 /* Unless computing the largest size (for memcpy and other raw memory
3353 functions), try to determine the size of the object from its type. */
3368 {
3369 /* Return the constant size unless it's zero (that's a zero-length
3370 array likely at the end of a struct). */
3375 }
3378 }
3380 /* Helper to determine and check the sizes of the source and the destination
3381 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3382 call expression, DEST is the destination argument, SRC is the source
3383 argument or null, and LEN is the number of bytes. Use Object Size type-0
3384 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3385 (no overflow or invalid sizes), false otherwise. */
3387 static bool
3389 {
3390 /* For functions like memset and memcpy that operate on raw memory
3391 try to determine the size of the largest source and destination
3392 object using type-0 Object Size regardless of the object size
3393 type specified by the option. */
3399 }
3401 /* Validate memchr arguments without performing any expansion.
3402 Return NULL_RTX. */
3404 static rtx
3406 {
3414 /* Diagnose calls where the specified length exceeds the size
3415 of the object. */
3417 {
3421 }
3424 }
3426 /* Expand a call EXP to the memcpy builtin.
3427 Return NULL_RTX if we failed, the caller should emit a normal call,
3428 otherwise try to get the result in TARGET, if convenient (and in
3429 mode MODE if that's convenient). */
3431 static rtx
3433 {
3446 }
3448 /* Check a call EXP to the memmove built-in for validity.
3449 Return NULL_RTX on both success and failure. */
3451 static rtx
3453 {
3465 }
3467 /* Expand an instrumented call EXP to the memcpy builtin.
3468 Return NULL_RTX if we failed, the caller should emit a normal call,
3469 otherwise try to get the result in TARGET, if convenient (and in
3470 mode MODE if that's convenient). */
3472 static rtx
3474 {
3480 else
3481 {
3488 /* Return src bounds with the result. */
3490 {
3494 }
3496 }
3497 }
3499 /* Expand a call EXP to the mempcpy builtin.
3500 Return NULL_RTX if we failed; the caller should emit a normal call,
3501 otherwise try to get the result in TARGET, if convenient (and in
3502 mode MODE if that's convenient). If ENDP is 0 return the
3503 destination pointer, if ENDP is 1 return the end pointer ala
3504 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3505 stpcpy. */
3507 static rtx
3509 {
3518 /* Policy does not generally allow using compute_objsize (which
3519 is used internally by check_memop_size) to change code generation
3520 or drive optimization decisions.
3522 In this instance it is safe because the code we generate has
3523 the same semantics regardless of the return value of
3524 check_memop_sizes. Exactly the same amount of data is copied
3525 and the return value is exactly the same in both cases.
3527 Furthermore, check_memop_size always uses mode 0 for the call to
3528 compute_objsize, so the imprecise nature of compute_objsize is
3529 avoided. */
3531 /* Avoid expanding mempcpy into memcpy when the call is determined
3532 to overflow the buffer. This also prevents the same overflow
3533 from being diagnosed again when expanding memcpy. */
3539 }
3541 /* Expand an instrumented call EXP to the mempcpy builtin.
3542 Return NULL_RTX if we failed, the caller should emit a normal call,
3543 otherwise try to get the result in TARGET, if convenient (and in
3544 mode MODE if that's convenient). */
3546 static rtx
3548 {
3554 else
3555 {
3562 /* Return src bounds with the result. */
3564 {
3568 }
3570 }
3571 }
3573 /* Helper function to do the actual work for expand of memory copy family
3574 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3575 of memory from SRC to DEST and assign to TARGET if convenient.
3576 If ENDP is 0 return the
3577 destination pointer, if ENDP is 1 return the end pointer ala
3578 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3579 stpcpy. */
3581 static rtx
3584 {
3595 /* If DEST is not a pointer type, call the normal function. */
3599 /* If either SRC is not a pointer type, don't do this
3600 operation in-line. */
3617 /* If SRC is a string constant and block move would be done
3618 by pieces, we can avoid loading the string from memory
3619 and only stored the computed constants. */
3626 {
3628 builtin_memcpy_read_str,
3634 }
3639 /* Copy word part most expediently. */
3648 {
3651 }
3654 {
3656 /* stpcpy pointer to last byte. */
3659 }
3662 }
3664 static rtx
3667 {
3669 endp);
3670 }
3672 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3673 we failed, the caller should emit a normal call, otherwise try to
3674 get the result in TARGET, if convenient. If ENDP is 0 return the
3675 destination pointer, if ENDP is 1 return the end pointer ala
3676 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3677 stpcpy. */
3679 static rtx
3681 {
3683 rtx dest_mem;
3684 rtx src_mem;
3692 {
3695 }
3704 {
3706 /* movstr is supposed to set end to the address of the NUL
3707 terminator. If the caller requested a mempcpy-like return value,
3708 adjust it. */
3710 {
3714 }
3715 }
3717 }
3719 /* Do some very basic size validation of a call to the strcpy builtin
3720 given by EXP. Return NULL_RTX to have the built-in expand to a call
3721 to the library function. */
3723 static rtx
3725 {
3733 /* There is no way here to determine the length of the string in
3734 the destination to which the SRC string is being appended so
3735 just diagnose cases when the souce string is longer than
3736 the destination object. */
3741 destsize);
3744 }
3746 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3747 NULL_RTX if we failed the caller should emit a normal call, otherwise
3748 try to get the result in TARGET, if convenient (and in mode MODE if that's
3749 convenient). */
3751 static rtx
3753 {
3761 {
3765 }
3768 }
3770 /* Helper function to do the actual work for expand_builtin_strcpy. The
3771 arguments to the builtin_strcpy call DEST and SRC are broken out
3772 so that this can also be called without constructing an actual CALL_EXPR.
3773 The other arguments and return value are the same as for
3774 expand_builtin_strcpy. */
3776 static rtx
3778 {
3780 }
3782 /* Expand a call EXP to the stpcpy builtin.
3783 Return NULL_RTX if we failed the caller should emit a normal call,
3784 otherwise try to get the result in TARGET, if convenient (and in
3785 mode MODE if that's convenient). */
3787 static rtx
3789 {
3800 {
3804 }
3806 /* If return value is ignored, transform stpcpy into strcpy. */
3808 {
3812 }
3813 else
3814 {
3816 rtx ret;
3818 /* Ensure we get an actual string whose length can be evaluated at
3819 compile-time, not an expression containing a string. This is
3820 because the latter will potentially produce pessimized code
3821 when used to produce the return value. */
3833 {
3837 {
3841 {
3843 {
3846 else
3848 }
3857 }
3858 }
3859 }
3862 }
3863 }
3865 /* Check a call EXP to the stpncpy built-in for validity.
3866 Return NULL_RTX on both success and failure. */
3868 static rtx
3870 {
3876 /* The source and destination of the call. */
3880 /* The exact number of bytes to write (not the maximum). */
3883 /* The size of the destination object. */
3889 }
3891 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3892 bytes from constant string DATA + OFFSET and return it as target
3893 constant. */
3895 rtx
3897 scalar_int_mode mode)
3898 {
3905 }
3907 /* Helper to check the sizes of sequences and the destination of calls
3908 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3909 success (no overflow or invalid sizes), false otherwise. */
3911 static bool
3913 {
3918 /* Try to determine the range of lengths that the source expression
3919 refers to. */
3923 /* Try to verify that the destination is big enough for the shortest
3924 string. */
3927 {
3928 /* If it hasn't been provided by __strncat_chk, try to determine
3929 the size of the destination object into which the source is
3930 being copied. */
3932 }
3934 /* Add one for the terminating nul. */
3937 size_one_node)
3940 /* The strncat function copies at most MAXREAD bytes and always appends
3941 the terminating nul so the specified upper bound should never be equal
3942 to (or greater than) the size of the destination. */
3945 {
3954 }
3962 /* The number of bytes to write is LEN but check_access will also
3963 check SRCLEN if LEN's value isn't known. */
3965 objsize);
3966 }
3968 /* Similar to expand_builtin_strcat, do some very basic size validation
3969 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3970 the built-in expand to a call to the library function. */
3972 static rtx
3974 {
3982 /* The upper bound on the number of bytes to write. */
3984 /* The length of the source sequence. */
3987 /* Try to determine the range of lengths that the source expression
3988 refers to. */
3992 else
3995 /* Try to verify that the destination is big enough for the shortest
3996 string. First try to determine the size of the destination object
3997 into which the source is being copied. */
4000 /* Add one for the terminating nul. */
4003 size_one_node)
4006 /* The strncat function copies at most MAXREAD bytes and always appends
4007 the terminating nul so the specified upper bound should never be equal
4008 to (or greater than) the size of the destination. */
4011 {
4020 }
4028 /* The number of bytes to write is SRCLEN. */
4032 }
4034 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4035 NULL_RTX if we failed the caller should emit a normal call. */
4037 static rtx
4039 {
4044 {
4047 /* The number of bytes to write (not the maximum). */
4049 /* The length of the source sequence. */
4053 {
4057 /* The number of bytes to write is LEN but check_access will also
4058 check SLEN if LEN's value isn't known. */
4060 destsize);
4061 }
4063 /* We must be passed a constant len and src parameter. */
4069 /* We're required to pad with trailing zeros if the requested
4070 len is greater than strlen(s2)+1. In that case try to
4071 use store_by_pieces, if it fails, punt. */
4073 {
4076 rtx dest_mem;
4080 builtin_strncpy_read_str,
4087 builtin_strncpy_read_str,
4092 }
4093 }
4095 }
4097 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4098 bytes from constant string DATA + OFFSET and return it as target
4099 constant. */
4101 rtx
4103 scalar_int_mode mode)
4104 {
4111 }
4113 /* Callback routine for store_by_pieces. Return the RTL of a register
4114 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4115 char value given in the RTL register data. For example, if mode is
4116 4 bytes wide, return the RTL for 0x01010101*data. */
4118 static rtx
4120 scalar_int_mode mode)
4121 {
4137 }
4139 /* Expand expression EXP, which is a call to the memset builtin. Return
4140 NULL_RTX if we failed the caller should emit a normal call, otherwise
4141 try to get the result in TARGET, if convenient (and in mode MODE if that's
4142 convenient). */
4144 static rtx
4146 {
4158 }
4160 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4161 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4162 try to get the result in TARGET, if convenient (and in mode MODE if that's
4163 convenient). */
4165 static rtx
4167 {
4172 else
4173 {
4179 /* Return src bounds with the result. */
4181 {
4185 }
4187 }
4188 }
4190 /* Helper function to do the actual work for expand_builtin_memset. The
4191 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4192 so that this can also be called without constructing an actual CALL_EXPR.
4193 The other arguments and return value are the same as for
4194 expand_builtin_memset. */
4196 static rtx
4199 {
4202 machine_mode val_mode;
4214 /* If DEST is not a pointer type, don't do this operation in-line. */
4225 /* If the LEN parameter is zero, return DEST. */
4227 {
4228 /* Evaluate and ignore VAL in case it has side-effects. */
4231 }
4233 /* Stabilize the arguments in case we fail. */
4245 {
4246 rtx val_rtx;
4251 /* Assume that we can memset by pieces if we can store
4252 * the coefficients by pieces (in the required modes).
4253 * We can't pass builtin_memset_gen_str as that emits RTL. */
4259 {
4264 }
4268 probable_max_size))
4274 }
4280 {
4291 probable_max_size))
4297 }
4305 probable_max_size);
4308 {
4311 }
4315 do_libcall:
4325 else
4330 }
4332 /* Expand expression EXP, which is a call to the bzero builtin. Return
4333 NULL_RTX if we failed the caller should emit a normal call. */
4335 static rtx
4337 {
4346 /* New argument list transforming bzero(ptr x, int y) to
4347 memset(ptr x, int 0, size_t y). This is done this way
4348 so that if it isn't expanded inline, we fallback to
4349 calling bzero instead of memset. */
4357 }
4359 /* Try to expand cmpstr operation ICODE with the given operands.
4360 Return the result rtx on success, otherwise return null. */
4362 static rtx
4364 HOST_WIDE_INT align)
4365 {
4379 }
4381 /* Expand expression EXP, which is a call to the memcmp built-in function.
4382 Return NULL_RTX if we failed and the caller should emit a normal call,
4383 otherwise try to get the result in TARGET, if convenient.
4384 RESULT_EQ is true if we can relax the returned value to be either zero
4385 or nonzero, without caring about the sign. */
4387 static rtx
4389 {
4398 /* Diagnose calls where the specified length exceeds the size of either
4399 object. */
4401 {
4405 {
4409 }
4410 }
4418 /* If we don't have POINTER_TYPE, call the function. */
4426 /* Set MEM_SIZE as appropriate. */
4428 {
4431 }
4437 {
4441 }
4443 /* If SRC is a string constant and block move would be done
4444 by pieces, we can avoid loading the string from memory
4445 and only stored the computed constants. */
4457 {
4458 /* Return the value in the proper mode for this function. */
4463 {
4466 }
4469 }
4472 }
4474 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4475 if we failed the caller should emit a normal call, otherwise try to get
4476 the result in TARGET, if convenient. */
4478 static rtx
4480 {
4495 /* If we don't have POINTER_TYPE, call the function. */
4499 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4507 /* Try to call cmpstrsi. */
4512 /* Try to determine at least one length and call cmpstrnsi. */
4514 {
4515 tree len;
4516 rtx arg3_rtx;
4526 /* If we don't have a constant length for the first, use the length
4527 of the second, if we know it. We don't require a constant for
4528 this case; some cost analysis could be done if both are available
4529 but neither is constant. For now, assume they're equally cheap,
4530 unless one has side effects. If both strings have constant lengths,
4531 use the smaller. */
4547 else
4550 /* If both arguments have side effects, we cannot optimize. */
4552 {
4554 result = expand_cmpstrn_or_cmpmem
4557 }
4558 }
4560 /* Check to see if the argument was declared attribute nonstring
4561 and if so, issue a warning since at this point it's not known
4562 to be nul-terminated. */
4567 {
4568 /* Return the value in the proper mode for this function. */
4576 }
4578 /* Expand the library call ourselves using a stabilized argument
4579 list to avoid re-evaluating the function's arguments twice. */
4584 }
4586 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4587 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4588 the result in TARGET, if convenient. */
4590 static rtx
4592 ATTRIBUTE_UNUSED machine_mode mode)
4593 {
4598 /* If c_strlen can determine an expression for one of the string
4599 lengths, and it doesn't have side effects, then emit cmpstrnsi
4600 using length MIN(strlen(string)+1, arg3). */
4605 tree len;
4626 /* If we don't have a constant length for the first, use the length
4627 of the second, if we know it. If neither string is constant length,
4628 use the given length argument. We don't require a constant for
4629 this case; some cost analysis could be done if both are available
4630 but neither is constant. For now, assume they're equally cheap,
4631 unless one has side effects. If both strings have constant lengths,
4632 use the smaller. */
4650 else
4653 /* If we are not using the given length, we must incorporate it here.
4654 The actual new length parameter will be MIN(len,arg3) in this case. */
4664 /* Check to see if the argument was declared attribute nonstring
4665 and if so, issue a warning since at this point it's not known
4666 to be nul-terminated. */
4671 {
4672 /* Return the value in the proper mode for this function. */
4680 }
4682 /* Expand the library call ourselves using a stabilized argument
4683 list to avoid re-evaluating the function's arguments twice. */
4688 }
4690 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4691 if that's convenient. */
4693 rtx
4695 {
4696 rtx val;
4699 /* Don't do __builtin_saveregs more than once in a function.
4700 Save the result of the first call and reuse it. */
4704 /* When this function is called, it means that registers must be
4705 saved on entry to this function. So we migrate the call to the
4706 first insn of this function. */
4710 /* Do whatever the machine needs done in this case. */
4718 /* Put the insns after the NOTE that starts the function. If this
4719 is inside a start_sequence, make the outer-level insn chain current, so
4720 the code is placed at the start of the function. */
4726 }
4728 /* Expand a call to __builtin_next_arg. */
4730 static rtx
4732 {
4733 /* Checking arguments is already done in fold_builtin_next_arg
4734 that must be called before this function. */
4739 }
4741 /* Make it easier for the backends by protecting the valist argument
4742 from multiple evaluations. */
4744 static tree
4746 {
4749 /* The current way of determining the type of valist is completely
4750 bogus. We should have the information on the va builtin instead. */
4755 {
4759 /* For this case, the backends will be expecting a pointer to
4760 vatype, but it's possible we've actually been given an array
4761 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4762 So fix it. */
4764 {
4767 }
4768 }
4769 else
4770 {
4774 {
4780 }
4786 }
4789 }
4791 /* The "standard" definition of va_list is void*. */
4793 tree
4795 {
4797 }
4799 /* The "standard" abi va_list is va_list_type_node. */
4801 tree
4803 {
4805 }
4807 /* The "standard" type of va_list is va_list_type_node. */
4809 tree
4811 {
4818 {
4819 /* If va_list is an array type, the argument may have decayed
4820 to a pointer type, e.g. by being passed to another function.
4821 In that case, unwrap both types so that we can compare the
4822 underlying records. */
4825 {
4828 }
4829 }
4834 }
4836 /* The "standard" implementation of va_start: just assign `nextarg' to
4837 the variable. */
4839 void
4841 {
4845 /* We do not have any valid bounds for the pointer, so
4846 just store zero bounds for it. */
4850 nextarg));
4851 }
4853 /* Expand EXP, a call to __builtin_va_start. */
4855 static rtx
4857 {
4858 rtx nextarg;
4859 tree valist;
4863 {
4866 }
4876 else
4880 }
4882 /* Expand EXP, a call to __builtin_va_end. */
4884 static rtx
4886 {
4889 /* Evaluate for side effects, if needed. I hate macros that don't
4890 do that. */
4895 }
4897 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4898 builtin rather than just as an assignment in stdarg.h because of the
4899 nastiness of array-type va_list types. */
4901 static rtx
4903 {
4916 {
4920 }
4921 else
4922 {
4925 /* Evaluate to pointers. */
4934 /* "Dereference" to BLKmode memories. */
4942 /* Copy. */
4944 }
4947 }
4949 /* Expand a call to one of the builtin functions __builtin_frame_address or
4950 __builtin_return_address. */
4952 static rtx
4954 {
4955 /* The argument must be a nonnegative integer constant.
4956 It counts the number of frames to scan up the stack.
4957 The value is either the frame pointer value or the return
4958 address saved in that frame. */
4960 /* Warning about missing arg was already issued. */
4963 {
4966 }
4967 else
4968 {
4969 /* Number of frames to scan up the stack. */
4974 /* Some ports cannot access arbitrary stack frames. */
4976 {
4979 }
4982 {
4983 /* Warn since no effort is made to ensure that any frame
4984 beyond the current one exists or can be safely reached. */
4987 }
4989 /* For __builtin_frame_address, return what we've got. */
4997 }
4998 }
5000 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5001 failed and the caller should emit a normal call. */
5003 static rtx
5005 {
5006 rtx op0;
5007 rtx result;
5010 HOST_WIDE_INT max_size;
5013 bool valid_arglist
5016 VOID_TYPE)
5026 {
5027 /* -Walloca-larger-than and -Wvla-larger-than settings override
5028 the more general -Walloc-size-larger-than so unless either of
5029 the former options is specified check the alloca arguments for
5030 overflow. */
5034 }
5036 /* Compute the argument. */
5039 /* Compute the alignment. */
5041 ? BIGGEST_ALIGNMENT
5044 /* Compute the maximum size. */
5049 /* Allocate the desired space. If the allocation stems from the declaration
5050 of a variable-sized object, it cannot accumulate. */
5051 result
5056 }
5058 /* Emit a call to __asan_allocas_unpoison call in EXP. Replace second argument
5059 of the call with virtual_stack_dynamic_rtx because in asan pass we emit a
5060 dummy value into second parameter relying on this function to perform the
5061 change. See motivation for this in comment to handle_builtin_stack_restore
5062 function. */
5064 static rtx
5066 {
5074 }
5076 /* Expand a call to bswap builtin in EXP.
5077 Return NULL_RTX if a normal call should be emitted rather than expanding the
5078 function in-line. If convenient, the result should be placed in TARGET.
5079 SUBTARGET may be used as the target for computing one of EXP's operands. */
5081 static rtx
5083 rtx subtarget)
5084 {
5085 tree arg;
5086 rtx op0;
5104 }
5106 /* Expand a call to a unary builtin in EXP.
5107 Return NULL_RTX if a normal call should be emitted rather than expanding the
5108 function in-line. If convenient, the result should be placed in TARGET.
5109 SUBTARGET may be used as the target for computing one of EXP's operands. */
5111 static rtx
5114 {
5115 rtx op0;
5120 /* Compute the argument. */
5122 (subtarget
5126 /* Compute op, into TARGET if possible.
5127 Set TARGET to wherever the result comes back. */
5133 }
5135 /* Expand a call to __builtin_expect. We just return our argument
5136 as the builtin_expect semantic should've been already executed by
5137 tree branch prediction pass. */
5139 static rtx
5141 {
5142 tree arg;
5149 /* When guessing was done, the hints should be already stripped away. */
5153 }
5155 /* Expand a call to __builtin_assume_aligned. We just return our first
5156 argument as the builtin_assume_aligned semantic should've been already
5157 executed by CCP. */
5159 static rtx
5161 {
5165 EXPAND_NORMAL);
5170 }
5172 void
5174 {
5176 {
5178 /* For trap insns when not accumulating outgoing args force
5179 REG_ARGS_SIZE note to prevent crossjumping of calls with
5180 different args sizes. */
5183 }
5184 else
5185 {
5189 }
5192 }
5194 /* Expand a call to __builtin_unreachable. We do nothing except emit
5195 a barrier saying that control flow will not pass here.
5197 It is the responsibility of the program being compiled to ensure
5198 that control flow does never reach __builtin_unreachable. */
5199 static void
5201 {
5203 }
5205 /* Expand EXP, a call to fabs, fabsf or fabsl.
5206 Return NULL_RTX if a normal call should be emitted rather than expanding
5207 the function inline. If convenient, the result should be placed
5208 in TARGET. SUBTARGET may be used as the target for computing
5209 the operand. */
5211 static rtx
5213 {
5214 machine_mode mode;
5215 tree arg;
5216 rtx op0;
5226 }
5228 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5229 Return NULL is a normal call should be emitted rather than expanding the
5230 function inline. If convenient, the result should be placed in TARGET.
5231 SUBTARGET may be used as the target for computing the operand. */
5233 static rtx
5235 {
5237 tree arg;
5249 }
5251 /* Expand a call to __builtin___clear_cache. */
5253 static rtx
5255 {
5257 {
5258 #ifdef CLEAR_INSN_CACHE
5259 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5260 does something. Just do the default expansion to a call to
5261 __clear_cache(). */
5263 #else
5264 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5265 does nothing. There is no need to call it. Do nothing. */
5268 }
5270 /* We have a "clear_cache" insn, and it will handle everything. */
5274 /* We must not expand to a library call. If we did, any
5275 fallback library function in libgcc that might contain a call to
5276 __builtin___clear_cache() would recurse infinitely. */
5278 {
5281 }
5284 {
5297 }
5299 }
5301 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5303 static rtx
5305 {
5308 /* If we don't need too much alignment, we'll have been guaranteed
5309 proper alignment by get_trampoline_type. */
5313 /* Round address up to desired boundary. */
5324 }
5326 static rtx
5328 {
5344 /* If ONSTACK, the TRAMP argument should be the address of a field
5345 within the local function's FRAME decl. Either way, let's see if
5346 we can fill in the MEM_ATTRs for this memory. */
5350 /* Creator of a heap trampoline is responsible for making sure the
5351 address is aligned to at least STACK_BOUNDARY. Normally malloc
5352 will ensure this anyhow. */
5355 {
5359 }
5361 /* The FUNC argument should be the address of the nested function.
5362 Extract the actual function decl to pass to the hook. */
5369 /* Generate insns to initialize the trampoline. */
5373 {
5379 }
5382 }
5384 static rtx
5386 {
5387 rtx tramp;
5398 }
5400 /* Expand a call to the builtin descriptor initialization routine.
5401 A descriptor is made up of a couple of pointers to the static
5402 chain and the code entry in this order. */
5404 static rtx
5406 {
5411 VOID_TYPE))
5425 /* Generate insns to initialize the descriptor. */
5431 }
5433 /* Expand a call to the builtin descriptor adjustment routine. */
5435 static rtx
5437 {
5438 rtx tramp;
5445 /* Unalign the descriptor to allow runtime identification. */
5450 }
5452 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5453 function. The function first checks whether the back end provides
5454 an insn to implement signbit for the respective mode. If not, it
5455 checks whether the floating point format of the value is such that
5456 the sign bit can be extracted. If that is not the case, error out.
5457 EXP is the expression that is a call to the builtin function; if
5458 convenient, the result should be placed in TARGET. */
5459 static rtx
5461 {
5463 scalar_float_mode fmode;
5465 tree arg;
5468 rtx temp;
5481 /* Expand the argument yielding a RTX expression. */
5484 /* Check if the back end provides an insn that handles signbit for the
5485 argument's mode. */
5488 {
5494 }
5496 /* For floating point formats without a sign bit, implement signbit
5497 as "ARG < 0.0". */
5500 {
5501 /* But we can't do this if the format supports signed zero. */
5507 }
5510 {
5513 }
5514 else
5515 {
5517 /* Handle targets with different FP word orders. */
5520 else
5524 }
5526 /* Force the intermediate word_mode (or narrower) result into a
5527 register. This avoids attempting to create paradoxical SUBREGs
5528 of floating point modes below. */
5531 /* If the bitpos is within the "result mode" lowpart, the operation
5532 can be implement with a single bitwise AND. Otherwise, we need
5533 a right shift and an AND. */
5536 {
5544 }
5545 else
5546 {
5547 /* Perform a logical right shift to place the signbit in the least
5548 significant bit, then truncate the result to the desired mode
5549 and mask just this bit. */
5554 }
5557 }
5559 /* Expand fork or exec calls. TARGET is the desired target of the
5560 call. EXP is the call. FN is the
5561 identificator of the actual function. IGNORE is nonzero if the
5562 value is to be ignored. */
5564 static rtx
5566 {
5568 tree call;
5570 /* If we are not profiling, just call the function. */
5574 /* Otherwise call the wrapper. This should be equivalent for the rest of
5575 compiler, so the code does not diverge, and the wrapper may run the
5576 code necessary for keeping the profiling sane. */
5579 {
5610 }
5622 }
5625 \f
5626 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5627 the pointer in these functions is void*, the tree optimizers may remove
5628 casts. The mode computed in expand_builtin isn't reliable either, due
5629 to __sync_bool_compare_and_swap.
5631 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5632 group of builtins. This gives us log2 of the mode size. */
5636 {
5637 /* The size is not negotiable, so ask not to get BLKmode in return
5638 if the target indicates that a smaller size would be better. */
5640 }
5642 /* Expand the memory expression LOC and return the appropriate memory operand
5643 for the builtin_sync operations. */
5645 static rtx
5647 {
5653 /* Note that we explicitly do not want any alias information for this
5654 memory, so that we kill all other live memories. Otherwise we don't
5655 satisfy the full barrier semantics of the intrinsic. */
5658 /* The alignment needs to be at least according to that of the mode. */
5665 }
5667 /* Make sure an argument is in the right mode.
5668 EXP is the tree argument.
5669 MODE is the mode it should be in. */
5671 static rtx
5673 {
5674 rtx val;
5675 machine_mode old_mode;
5678 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5679 of CONST_INTs, where we know the old_mode only from the call argument. */
5686 }
5689 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5690 EXP is the CALL_EXPR. CODE is the rtx code
5691 that corresponds to the arithmetic or logical operation from the name;
5692 an exception here is that NOT actually means NAND. TARGET is an optional
5693 place for us to store the results; AFTER is true if this is the
5694 fetch_and_xxx form. */
5696 static rtx
5699 rtx target)
5700 {
5705 {
5712 {
5741 }
5742 }
5744 /* Expand the operands. */
5749 after);
5750 }
5752 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5753 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5754 true if this is the boolean form. TARGET is a place for us to store the
5755 results; this is NOT optional if IS_BOOL is true. */
5757 static rtx
5760 {
5764 /* Expand the operands. */
5771 {
5774 else
5776 }
5779 MEMMODEL_SYNC_SEQ_CST))
5783 }
5785 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5786 general form is actually an atomic exchange, and some targets only
5787 support a reduced form with the second argument being a constant 1.
5788 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5789 the results. */
5791 static rtx
5793 rtx target)
5794 {
5797 /* Expand the operands. */
5802 }
5804 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5806 static void
5808 {
5809 rtx mem;
5811 /* Expand the operands. */
5815 }
5817 /* Given an integer representing an ``enum memmodel'', verify its
5818 correctness and return the memory model enum. */
5820 static enum memmodel
5822 {
5823 rtx op;
5825 source_location loc
5828 /* If the parameter is not a constant, it's a run time value so we'll just
5829 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5839 {
5843 }
5845 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5847 {
5851 }
5853 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5854 be conservative and promote consume to acquire. */
5859 }
5861 /* Expand the __atomic_exchange intrinsic:
5862 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5863 EXP is the CALL_EXPR.
5864 TARGET is an optional place for us to store the results. */
5866 static rtx
5868 {
5877 /* Expand the operands. */
5882 }
5884 /* Expand the __atomic_compare_exchange intrinsic:
5885 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5886 TYPE desired, BOOL weak,
5887 enum memmodel success,
5888 enum memmodel failure)
5889 EXP is the CALL_EXPR.
5890 TARGET is an optional place for us to store the results. */
5892 static rtx
5894 rtx target)
5895 {
5899 tree weak;
5901 source_location loc
5908 {
5910 "failure memory model cannot be stronger than success "
5913 }
5916 {
5918 "invalid failure memory model for "
5922 }
5928 /* Expand the operands. */
5944 /* Lest the rtl backend create a race condition with an imporoper store
5945 to memory, always create a new pseudo for OLDVAL. */
5952 /* Conditionally store back to EXPECT, lest we create a race condition
5953 with an improper store to memory. */
5954 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5955 the normal case where EXPECT is totally private, i.e. a register. At
5956 which point the store can be unconditional. */
5964 }
5966 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5967 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5968 call. The weak parameter must be dropped to match the expected parameter
5969 list and the expected argument changed from value to pointer to memory
5970 slot. */
5972 static void
5974 {
5990 /* Skip the boolean weak parameter. */
5993 built_in_function fncode
5998 fndecl);
6003 {
6010 }
6011 }
6013 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6015 void
6017 {
6023 tree lhs;
6025 source_location loc
6032 {
6034 "failure memory model cannot be stronger than success "
6037 }
6040 {
6042 "invalid failure memory model for "
6046 }
6049 {
6052 }
6054 /* Expand the operands. */
6067 {
6070 }
6074 {
6080 }
6081 }
6083 /* Expand the __atomic_load intrinsic:
6084 TYPE __atomic_load (TYPE *object, enum memmodel)
6085 EXP is the CALL_EXPR.
6086 TARGET is an optional place for us to store the results. */
6088 static rtx
6090 {
6091 rtx mem;
6096 {
6097 source_location loc
6102 }
6107 /* Expand the operand. */
6111 }
6114 /* Expand the __atomic_store intrinsic:
6115 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6116 EXP is the CALL_EXPR.
6117 TARGET is an optional place for us to store the results. */
6119 static rtx
6121 {
6128 {
6129 source_location loc
6134 }
6139 /* Expand the operands. */
6144 }
6146 /* Expand the __atomic_fetch_XXX intrinsic:
6147 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6148 EXP is the CALL_EXPR.
6149 TARGET is an optional place for us to store the results.
6150 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6151 FETCH_AFTER is true if returning the result of the operation.
6152 FETCH_AFTER is false if returning the value before the operation.
6153 IGNORE is true if the result is not used.
6154 EXT_CALL is the correct builtin for an external call if this cannot be
6155 resolved to an instruction sequence. */
6157 static rtx
6161 {
6164 tree fndecl;
6165 tree addr;
6169 /* Expand the operands. */
6173 /* Only try generating instructions if inlining is turned on. */
6175 {
6179 }
6181 /* Return if a different routine isn't needed for the library call. */
6185 /* Change the call to the specified function. */
6193 /* If we will emit code after the call, the call can not be a tail call.
6194 If it is emitted as a tail call, a barrier is emitted after it, and
6195 then all trailing code is removed. */
6199 /* Expand the call here so we can emit trailing code. */
6202 /* Replace the original function just in case it matters. */
6205 /* Then issue the arithmetic correction to return the right result. */
6207 {
6209 {
6211 OPTAB_LIB_WIDEN);
6213 }
6214 else
6216 OPTAB_LIB_WIDEN);
6217 }
6219 }
6221 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6223 void
6225 {
6233 optab optab;
6245 {
6260 }
6263 {
6270 }
6292 {
6297 }
6298 else
6300 OPTAB_DIRECT);
6303 }
6305 /* Expand an atomic clear operation.
6306 void _atomic_clear (BOOL *obj, enum memmodel)
6307 EXP is the call expression. */
6309 static rtx
6311 {
6312 machine_mode mode;
6321 {
6322 source_location loc
6327 }
6329 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6330 Failing that, a store is issued by __atomic_store. The only way this can
6331 fail is if the bool type is larger than a word size. Unlikely, but
6332 handle it anyway for completeness. Assume a single threaded model since
6333 there is no atomic support in this case, and no barriers are required. */
6338 }
6340 /* Expand an atomic test_and_set operation.
6341 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6342 EXP is the call expression. */
6344 static rtx
6346 {
6347 rtx mem;
6349 machine_mode mode;
6356 }
6359 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6360 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6362 static tree
6364 {
6366 machine_mode mode;
6372 /* We need a corresponding integer mode for the access to be lock-free. */
6380 {
6383 /* Either this argument is null, or it's a fake pointer encoding
6384 the alignment of the object. */
6390 else
6392 }
6393 else
6394 {
6397 /* This function is usually invoked and folded immediately by the front
6398 end before anything else has a chance to look at it. The pointer
6399 parameter at this point is usually cast to a void *, so check for that
6400 and look past the cast. */
6410 /* Get the underlying type of the object. */
6413 }
6415 /* If the object has smaller alignment, the lock free routines cannot
6416 be used. */
6420 /* Check if a compare_and_swap pattern exists for the mode which represents
6421 the required size. The pattern is not allowed to fail, so the existence
6422 of the pattern indicates support is present. Also require that an
6423 atomic load exists for the required size. */
6426 else
6428 }
6430 /* Return true if the parameters to call EXP represent an object which will
6431 always generate lock free instructions. The first argument represents the
6432 size of the object, and the second parameter is a pointer to the object
6433 itself. If NULL is passed for the object, then the result is based on
6434 typical alignment for an object of the specified size. Otherwise return
6435 false. */
6437 static rtx
6439 {
6440 tree size;
6445 {
6448 }
6454 }
6456 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6457 is lock free on this architecture. */
6459 static tree
6461 {
6465 /* If it isn't always lock free, don't generate a result. */
6470 }
6472 /* Return true if the parameters to call EXP represent an object which will
6473 always generate lock free instructions. The first argument represents the
6474 size of the object, and the second parameter is a pointer to the object
6475 itself. If NULL is passed for the object, then the result is based on
6476 typical alignment for an object of the specified size. Otherwise return
6477 NULL*/
6479 static rtx
6481 {
6482 tree size;
6487 {
6490 }
6495 /* If the value is known at compile time, return the RTX for it. */
6501 }
6503 /* Expand the __atomic_thread_fence intrinsic:
6504 void __atomic_thread_fence (enum memmodel)
6505 EXP is the CALL_EXPR. */
6507 static void
6509 {
6512 }
6514 /* Expand the __atomic_signal_fence intrinsic:
6515 void __atomic_signal_fence (enum memmodel)
6516 EXP is the CALL_EXPR. */
6518 static void
6520 {
6523 }
6525 /* Expand the __sync_synchronize intrinsic. */
6527 static void
6529 {
6531 }
6533 static rtx
6535 {
6541 {
6543 /* If the target is not sutitable then create a new target. */
6551 }
6554 }
6556 static void
6558 {
6564 {
6571 }
6573 }
6575 \f
6576 /* Emit code to restore the current value of stack. */
6578 static void
6580 {
6592 }
6594 /* Emit code to save the current value of stack. */
6596 static rtx
6598 {
6603 }
6606 /* Expand an expression EXP that calls a built-in function,
6607 with result going to TARGET if that's convenient
6608 (and in mode MODE if that's convenient).
6609 SUBTARGET may be used as the target for computing one of EXP's operands.
6610 IGNORE is nonzero if the value is to be ignored. */
6612 rtx
6615 {
6624 /* When ASan is enabled, we don't want to expand some memory/string
6625 builtins and rely on libsanitizer's hooks. This allows us to avoid
6626 redundant checks and be sure, that possible overflow will be detected
6627 by ASan. */
6632 /* When not optimizing, generate calls to library functions for a certain
6633 set of builtins. */
6659 /* The built-in function expanders test for target == const0_rtx
6660 to determine whether the function's result will be ignored. */
6664 /* If the result of a pure or const built-in function is ignored, and
6665 none of its arguments are volatile, we can avoid expanding the
6666 built-in call and just evaluate the arguments for side-effects. */
6670 {
6672 tree arg;
6673 call_expr_arg_iterator iter;
6677 {
6680 }
6683 {
6687 }
6688 }
6690 /* expand_builtin_with_bounds is supposed to be used for
6691 instrumented builtin calls. */
6695 {
6713 /* Just do a normal library call if we were unable to fold
6714 the values. */
6791 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6792 FUNCTION with a copy of the parameters described by
6793 ARGUMENTS, and ARGSIZE. It returns a block of memory
6794 allocated on the stack into which is stored all the registers
6795 that might possibly be used for returning the result of a
6796 function. ARGUMENTS is the value returned by
6797 __builtin_apply_args. ARGSIZE is the number of bytes of
6798 arguments that must be copied. ??? How should this value be
6799 computed? We'll also need a safe worst case value for varargs
6800 functions. */
6807 else
6808 {
6816 }
6818 /* __builtin_return (RESULT) causes the function to return the
6819 value described by RESULT. RESULT is address of the block of
6820 memory returned by __builtin_apply. */
6830 /* All valid uses of __builtin_va_arg_pack () are removed during
6831 inlining. */
6836 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6837 inlining. */
6841 /* Return the address of the first anonymous stack arg. */
6863 /* Returns the address of the area where the structure is returned.
6864 0 otherwise. */
6870 else
6873 CASE_BUILT_IN_ALLOCA:
7036 {
7039 }
7043 /* This should have been lowered to the builtins below. */
7047 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7048 and the receiver label. */
7050 {
7056 /* This is copied from the handling of non-local gotos. */
7058 nonlocal_goto_handler_labels
7060 nonlocal_goto_handler_labels);
7061 /* ??? Do not let expand_label treat us as such since we would
7062 not want to be both on the list of non-local labels and on
7063 the list of forced labels. */
7066 }
7070 /* __builtin_setjmp_receiver is passed the receiver label. */
7072 {
7078 }
7081 /* __builtin_longjmp is passed a pointer to an array of five words.
7082 It's similar to the C library longjmp function but works with
7083 __builtin_setjmp above. */
7086 {
7092 {
7095 }
7099 }
7108 /* This updates the setjmp buffer that is its argument with the value
7109 of the current stack pointer. */
7112 {
7113 rtx buf_addr
7118 }
7138 /* Various hooks for the DWARF 2 __throw routine. */
7144 #ifdef DWARF2_UNWIND_INFO
7150 #endif
7350 mode = get_builtin_sync_mode
7362 mode = get_builtin_sync_mode
7409 {
7413 mode =
7419 /* If this is turned into an external library call, the weak parameter
7420 must be dropped to match the expected parameter list. */
7425 /* Skip the boolean weak parameter. */
7430 }
7459 {
7469 }
7475 {
7485 }
7491 {
7501 }
7507 {
7517 }
7523 {
7533 }
7539 {
7549 }
7696 /* We allow user CHKP builtins if Pointer Bounds
7697 Checker is off. */
7699 {
7710 else
7712 }
7713 /* FALLTHROUGH */
7725 /* Software implementation of Pointer Bounds Checker is NYI.
7726 Target support is required. */
7731 /* Do library call, if we failed to expand the builtin when
7732 folding. */
7737 }
7739 /* The switch statement above can drop through to cause the function
7740 to be called normally. */
7742 }
7744 /* Similar to expand_builtin but is used for instrumented calls. */
7746 rtx
7748 rtx subtarget ATTRIBUTE_UNUSED,
7750 {
7763 {
7786 {
7787 /* memcpy_chkp (void *dst, size_t dstbnd,
7788 const void *src, size_t srcbnd, size_t n)
7789 and others take a pointer bound argument just after each
7790 pointer argument. */
7797 }
7801 }
7803 /* The switch statement above can drop through to cause the function
7804 to be called normally. */
7806 }
7808 /* Determine whether a tree node represents a call to a built-in
7809 function. If the tree T is a call to a built-in function with
7810 the right number of arguments of the appropriate types, return
7811 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7812 Otherwise the return value is END_BUILTINS. */
7814 enum built_in_function
7816 {
7819 const_call_expr_arg_iterator iter;
7835 {
7836 /* If a function doesn't take a variable number of arguments,
7837 the last element in the list will have type `void'. */
7840 {
7844 }
7853 {
7856 }
7858 {
7861 }
7863 {
7866 }
7868 {
7871 }
7872 else
7874 }
7876 /* Variable-length argument list. */
7878 }
7880 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7881 evaluate to a constant. */
7883 static tree
7885 {
7886 /* We return 1 for a numeric type that's known to be a constant
7887 value at compile-time or for an aggregate type that's a
7888 literal constant. */
7891 /* If we know this is a constant, emit the constant of one. */
7897 {
7904 }
7906 /* If this expression has side effects, show we don't know it to be a
7907 constant. Likewise if it's a pointer or aggregate type since in
7908 those case we only want literals, since those are only optimized
7909 when generating RTL, not later.
7910 And finally, if we are compiling an initializer, not code, we
7911 need to return a definite result now; there's not going to be any
7912 more optimization done. */
7917 || folding_initializer
7922 }
7924 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7925 return it as a truthvalue. */
7927 static tree
7929 tree predictor)
7930 {
7942 predictor);
7946 }
7948 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7949 NULL_TREE if no simplification is possible. */
7951 tree
7953 {
7957 /* Distribute the expected value over short-circuiting operators.
7958 See through the cast from truthvalue_type_node to long. */
7965 /* If this is a builtin_expect within a builtin_expect keep the
7966 inner one. See through a comparison against a constant. It
7967 might have been added to create a thruthvalue. */
7983 {
7992 }
7994 /* If the argument isn't invariant then there's nothing else we can do. */
7998 /* If we expect that a comparison against the argument will fold to
7999 a constant return the constant. In practice, this means a true
8000 constant or the address of a non-weak symbol. */
8004 {
8005 do
8006 {
8008 }
8013 }
8015 /* Otherwise, ARG0 already has the proper type for the return value. */
8017 }
8019 /* Fold a call to __builtin_classify_type with argument ARG. */
8021 static tree
8023 {
8028 }
8030 /* Fold a call to __builtin_strlen with argument ARG. */
8032 static tree
8034 {
8037 else
8038 {
8045 }
8046 }
8048 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8050 static tree
8052 {
8053 REAL_VALUE_TYPE real;
8055 /* __builtin_inff is intended to be usable to define INFINITY on all
8056 targets. If an infinity is not available, INFINITY expands "to a
8057 positive constant of type float that overflows at translation
8058 time", footnote "In this case, using INFINITY will violate the
8059 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8060 Thus we pedwarn to ensure this constraint violation is
8061 diagnosed. */
8067 }
8069 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8070 NULL_TREE if no simplification can be made. */
8072 static tree
8075 {
8076 tree type;
8086 /* Calculate the result when the argument is a constant. */
8091 /* Canonicalize sincos to cexpi. */
8093 {
8096 }
8098 {
8105 }
8114 }
8116 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8117 Return NULL_TREE if no simplification can be made. */
8119 static tree
8121 {
8127 /* If the LEN parameter is zero, return zero. */
8132 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8136 /* If len parameter is one, return an expression corresponding to
8137 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8139 {
8141 tree cst_uchar_ptr_node
8144 tree ind1
8148 cst_uchar_ptr_node,
8149 arg1)));
8150 tree ind2
8154 cst_uchar_ptr_node,
8155 arg2)));
8157 }
8160 }
8162 /* Fold a call to builtin isascii with argument ARG. */
8164 static tree
8166 {
8169 else
8170 {
8171 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8177 }
8178 }
8180 /* Fold a call to builtin toascii with argument ARG. */
8182 static tree
8184 {
8188 /* Transform toascii(c) -> (c & 0x7f). */
8191 }
8193 /* Fold a call to builtin isdigit with argument ARG. */
8195 static tree
8197 {
8200 else
8201 {
8202 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8203 /* According to the C standard, isdigit is unaffected by locale.
8204 However, it definitely is affected by the target character set. */
8205 unsigned HOST_WIDE_INT target_digit0
8216 }
8217 }
8219 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8221 static tree
8223 {
8229 }
8231 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8233 static tree
8235 {
8241 }
8243 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
8245 static tree
8247 {
8248 /* ??? Only expand to FMA_EXPR if it's directly supported. */
8256 }
8258 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8260 static tree
8262 {
8265 {
8269 {
8274 }
8275 }
8278 }
8280 /* Fold a call to builtin frexp, we can assume the base is 2. */
8282 static tree
8284 {
8295 /* Proceed if a valid pointer type was passed in. */
8297 {
8302 {
8304 /* For +-0, return (*exp = 0, +-0). */
8310 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8313 {
8314 /* Since the frexp function always expects base 2, and in
8315 GCC normalized significands are already in the range
8316 [0.5, 1.0), we have exactly what frexp wants. */
8321 }
8325 }
8327 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8331 }
8334 }
8336 /* Fold a call to builtin modf. */
8338 static tree
8340 {
8351 /* Proceed if a valid pointer type was passed in. */
8353 {
8358 {
8361 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8365 /* For +-Inf, return (*arg1 = arg0, +-0). */
8371 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8374 /* If the original number was negative and already
8375 integral, then the fractional part is -0.0. */
8379 }
8381 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8387 }
8390 }
8392 /* Given a location LOC, an interclass builtin function decl FNDECL
8393 and its single argument ARG, return an folded expression computing
8394 the same, or NULL_TREE if we either couldn't or didn't want to fold
8395 (the latter happen if there's an RTL instruction available). */
8397 static tree
8399 {
8400 machine_mode mode;
8412 /* If there is no optab, try generic code. */
8414 {
8415 tree result;
8418 {
8419 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8422 REAL_VALUE_TYPE r;
8426 {
8427 /* NaN and Inf are encoded in the high-order double value
8428 only. The low-order value is not significant. */
8432 }
8439 }
8442 {
8443 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8446 REAL_VALUE_TYPE r;
8450 {
8451 /* NaN and Inf are encoded in the high-order double value
8452 only. The low-order value is not significant. */
8456 }
8462 /*result = fold_build2_loc (loc, UNGT_EXPR,
8463 TREE_TYPE (TREE_TYPE (fndecl)),
8464 fold_build1_loc (loc, ABS_EXPR, type, arg),
8465 build_real (type, r));
8466 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8467 TREE_TYPE (TREE_TYPE (fndecl)),
8468 result);*/
8470 }
8472 {
8473 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8474 islessequal(fabs(x),DBL_MAX). */
8484 {
8485 /* Use double to test the normal range of IBM extended
8486 precision. Emin for IBM extended precision is
8487 different to emin for IEEE double, being 53 higher
8488 since the low double exponent is at least 53 lower
8489 than the high double exponent. */
8493 }
8505 {
8506 /* Testing the high end of the range is done just using
8507 the high double, using the same test as isfinite().
8508 For the subnormal end of the range we first test the
8509 high double, then if its magnitude is equal to the
8510 limit of 0x1p-969, we test whether the low double is
8511 non-zero and opposite sign to the high double. */
8527 integer_type_node,
8533 }
8534 else
8535 {
8536 tree const isge_fn
8539 }
8543 }
8546 }
8549 }
8551 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8552 ARG is the argument for the call. */
8554 static tree
8556 {
8563 {
8571 {
8572 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8573 /* In a boolean context, GCC will fold the inner COND_EXPR to
8574 1. So e.g. "if (isinf_sign(x))" would be folded to just
8575 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8583 {
8596 integer_zero_node);
8597 }
8600 }
8613 {
8616 {
8617 /* NaN and Inf are encoded in the high-order double value
8618 only. The low-order value is not significant. */
8620 }
8621 }
8627 }
8628 }
8630 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8631 This builtin will generate code to return the appropriate floating
8632 point classification depending on the value of the floating point
8633 number passed in. The possible return values must be supplied as
8634 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8635 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8636 one floating point argument which is "type generic". */
8638 static tree
8640 {
8643 machine_mode mode;
8644 REAL_VALUE_TYPE r;
8647 /* Verify the required arguments in the original call. */
8667 /* fpclassify(x) ->
8668 isnan(x) ? FP_NAN :
8669 (fabs(x) == Inf ? FP_INFINITE :
8670 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8671 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8685 {
8691 }
8694 {
8697 }
8700 }
8702 /* Fold a call to an unordered comparison function such as
8703 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8704 being called and ARG0 and ARG1 are the arguments for the call.
8705 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8706 the opposite of the desired result. UNORDERED_CODE is used
8707 for modes that can hold NaNs and ORDERED_CODE is used for
8708 the rest. */
8710 static tree
8714 {
8728 /* Choose the wider of two real types. */
8740 {
8744 }
8749 }
8751 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8752 arithmetics if it can never overflow, or into internal functions that
8753 return both result of arithmetics and overflowed boolean flag in
8754 a complex integer result, or some other check for overflow.
8755 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8756 checking part of that. */
8758 static tree
8761 {
8763 /* The code of the expression corresponding to the type-generic
8764 built-in, or ERROR_MARK for the type-specific ones. */
8769 {
8772 /* FALLTHRU */
8775 /* FALLTHRU */
8786 /* FALLTHRU */
8789 /* FALLTHRU */
8800 /* FALLTHRU */
8803 /* FALLTHRU */
8814 }
8816 /* For the "generic" overloads, the first two arguments can have different
8817 types and the last argument determines the target type to use to check
8818 for overflow. The arguments of the other overloads all have the same
8819 type. */
8822 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8823 arguments are constant, attempt to fold the built-in call into a constant
8824 expression indicating whether or not it detected an overflow. */
8828 /* Perform the computation in the target type and check for overflow. */
8832 arg2);
8846 tree store
8849 }
8851 /* Fold a call to __builtin_FILE to a constant string. */
8855 {
8860 }
8862 /* Fold a call to __builtin_FUNCTION to a constant string. */
8866 {
8873 }
8875 /* Fold a call to __builtin_LINE to an integer constant. */
8879 {
8881 }
8883 /* Fold a call to built-in function FNDECL with 0 arguments.
8884 This function returns NULL_TREE if no simplification was possible. */
8886 static tree
8888 {
8892 {
8918 }
8920 }
8922 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8923 This function returns NULL_TREE if no simplification was possible. */
8925 static tree
8927 {
8938 {
8940 {
8943 /* Gimplification will pull the CALL_EXPR for the builtin out of
8944 an if condition. When not optimizing, we'll not CSE it back.
8945 To avoid link error types of regressions, return false now. */
8950 }
9006 {
9011 }
9017 {
9022 }
9043 }
9047 }
9049 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9050 This function returns NULL_TREE if no simplification was possible. */
9052 static tree
9054 {
9066 {
9110 NOP_EXPR);
9112 /* We do the folding for va_start in the expander. */
9127 }
9129 }
9131 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9132 and ARG2.
9133 This function returns NULL_TREE if no simplification was possible. */
9135 static tree
9138 {
9152 {
9202 }
9204 }
9206 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9207 arguments. IGNORE is true if the result of the
9208 function call is ignored. This function returns NULL_TREE if no
9209 simplification was possible. */
9211 tree
9213 {
9217 {
9233 }
9235 {
9240 }
9242 }
9244 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9245 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9246 of arguments in ARGS to be omitted. OLDNARGS is the number of
9247 elements in ARGS. */
9249 static tree
9252 {
9257 {
9265 }
9266 else
9270 }
9272 /* Return true if FNDECL shouldn't be folded right now.
9273 If a built-in function has an inline attribute always_inline
9274 wrapper, defer folding it after always_inline functions have
9275 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9276 might not be performed. */
9278 bool
9280 {
9283 && cfun
9286 }
9288 /* A wrapper function for builtin folding that prevents warnings for
9289 "statement without effect" and the like, caused by removing the
9290 call node earlier than the warning is generated. */
9292 tree
9294 {
9300 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9301 yet. Defer folding until we see all the arguments
9302 (after inlining). */
9304 {
9307 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9308 instead last argument is __builtin_va_arg_pack (). Defer folding
9309 even in that case, until arguments are finalized. */
9311 {
9318 }
9326 else
9327 {
9332 }
9333 }
9335 }
9337 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9338 N arguments are passed in the array ARGARRAY. Return a folded
9339 expression or NULL_TREE if no simplification was possible. */
9341 tree
9343 tree fn,
9346 {
9353 {
9354 /* If last argument is __builtin_va_arg_pack (), arguments to this
9355 function are not finalized yet. Defer folding until they are. */
9357 {
9364 }
9369 else
9371 }
9374 }
9376 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9377 along with N new arguments specified as the "..." parameters. SKIP
9378 is the number of arguments in EXP to be omitted. This function is used
9379 to do varargs-to-varargs transformations. */
9381 static tree
9383 {
9385 tree t;
9393 }
9395 /* Validate a single argument ARG against a tree code CODE representing
9396 a type. Return true when argument is valid. */
9398 static bool
9400 {
9408 }
9410 /* This function validates the types of a function call argument list
9411 against a specified list of tree_codes. If the last specifier is a 0,
9412 that represents an ellipses, otherwise the last specifier must be a
9413 VOID_TYPE.
9415 This is the GIMPLE version of validate_arglist. Eventually we want to
9416 completely convert builtins.c to work from GIMPLEs and the tree based
9417 validate_arglist will then be removed. */
9419 bool
9421 {
9425 const_tree arg;
9431 do
9432 {
9435 {
9437 /* This signifies an ellipses, any further arguments are all ok. */
9441 /* This signifies an endlink, if no arguments remain, return
9442 true, otherwise return false. */
9446 /* If no parameters remain or the parameter's code does not
9447 match the specified code, return false. Otherwise continue
9448 checking any remaining arguments. */
9453 }
9454 }
9457 /* We need gotos here since we can only have one VA_CLOSE in a
9458 function. */
9459 end: ;
9463 }
9465 /* Default target-specific builtin expander that does nothing. */
9467 rtx
9469 rtx target ATTRIBUTE_UNUSED,
9470 rtx subtarget ATTRIBUTE_UNUSED,
9471 machine_mode mode ATTRIBUTE_UNUSED,
9473 {
9475 }
9477 /* Returns true is EXP represents data that would potentially reside
9478 in a readonly section. */
9480 bool
9482 {
9492 /* Make sure we call decl_readonly_section only for trees it
9493 can handle (since it returns true for everything it doesn't
9494 understand). */
9499 else
9501 }
9503 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9504 to the call, and TYPE is its return type.
9506 Return NULL_TREE if no simplification was possible, otherwise return the
9507 simplified form of the call as a tree.
9509 The simplified form may be a constant or other expression which
9510 computes the same value, but in a more efficient manner (including
9511 calls to other builtin functions).
9513 The call may contain arguments which need to be evaluated, but
9514 which are not useful to determine the result of the call. In
9515 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9516 COMPOUND_EXPR will be an argument which must be evaluated.
9517 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9518 COMPOUND_EXPR in the chain will contain the tree for the simplified
9519 form of the builtin function call. */
9521 static tree
9523 {
9527 else
9528 {
9529 tree fn;
9538 {
9540 tree tem;
9545 /* Return an offset into the constant string argument. */
9548 }
9551 /* strpbrk(x, "") == NULL.
9552 Evaluate and ignore s1 in case it had side-effects. */
9562 /* New argument list transforming strpbrk(s1, s2) to
9563 strchr(s1, s2[0]). */
9566 }
9567 }
9569 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9570 to the call.
9572 Return NULL_TREE if no simplification was possible, otherwise return the
9573 simplified form of the call as a tree.
9575 The simplified form may be a constant or other expression which
9576 computes the same value, but in a more efficient manner (including
9577 calls to other builtin functions).
9579 The call may contain arguments which need to be evaluated, but
9580 which are not useful to determine the result of the call. In
9581 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9582 COMPOUND_EXPR will be an argument which must be evaluated.
9583 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9584 COMPOUND_EXPR in the chain will contain the tree for the simplified
9585 form of the builtin function call. */
9587 static tree
9589 {
9593 else
9594 {
9597 /* If either argument is "", return NULL_TREE. */
9599 /* Evaluate and ignore both arguments in case either one has
9600 side-effects. */
9604 }
9605 }
9607 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9608 to the call.
9610 Return NULL_TREE if no simplification was possible, otherwise return the
9611 simplified form of the call as a tree.
9613 The simplified form may be a constant or other expression which
9614 computes the same value, but in a more efficient manner (including
9615 calls to other builtin functions).
9617 The call may contain arguments which need to be evaluated, but
9618 which are not useful to determine the result of the call. In
9619 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9620 COMPOUND_EXPR will be an argument which must be evaluated.
9621 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9622 COMPOUND_EXPR in the chain will contain the tree for the simplified
9623 form of the builtin function call. */
9625 static tree
9627 {
9631 else
9632 {
9633 /* If the first argument is "", return NULL_TREE. */
9636 {
9637 /* Evaluate and ignore argument s2 in case it has
9638 side-effects. */
9641 }
9643 /* If the second argument is "", return __builtin_strlen(s1). */
9646 {
9649 /* If the replacement _DECL isn't initialized, don't do the
9650 transformation. */
9655 }
9657 }
9658 }
9660 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9661 produced. False otherwise. This is done so that we don't output the error
9662 or warning twice or three times. */
9664 bool
9666 {
9669 tree arg;
9670 /* There is good chance the current input_location points inside the
9671 definition of the va_start macro (perhaps on the token for
9672 builtin) in a system header, so warnings will not be emitted.
9673 Use the location in real source code. */
9674 source_location current_location =
9676 NULL);
9679 {
9682 }
9685 {
9687 {
9690 }
9692 }
9693 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9694 when we checked the arguments and if needed issued a warning. */
9695 else
9696 {
9698 {
9699 /* Evidently an out of date version of <stdarg.h>; can't validate
9700 va_start's second argument, but can still work as intended. */
9702 OPT_Wvarargs,
9705 }
9707 {
9710 }
9712 }
9717 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9718 or __builtin_next_arg (0) the first time we see it, after checking
9719 the arguments and if needed issuing a warning. */
9721 {
9724 /* Strip off all nops for the sake of the comparison. This
9725 is not quite the same as STRIP_NOPS. It does more.
9726 We must also strip off INDIRECT_EXPR for C++ reference
9727 parameters. */
9732 {
9733 /* FIXME: Sometimes with the tree optimizers we can get the
9734 not the last argument even though the user used the last
9735 argument. We just warn and set the arg to be the last
9736 argument so that we will get wrong-code because of
9737 it. */
9739 OPT_Wvarargs,
9741 }
9743 /* Undefined by C99 7.15.1.4p4 (va_start):
9744 "If the parameter parmN is declared with the register storage
9745 class, with a function or array type, or with a type that is
9746 not compatible with the type that results after application of
9747 the default argument promotions, the behavior is undefined."
9748 */
9750 {
9752 OPT_Wvarargs,
9753 "undefined behavior when second parameter of "
9755 }
9757 /* We want to verify the second parameter just once before the tree
9758 optimizers are run and then avoid keeping it in the tree,
9759 as otherwise we could warn even for correct code like:
9760 void foo (int i, ...)
9761 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9764 else
9766 }
9768 }
9771 /* Expand a call EXP to __builtin_object_size. */
9773 static rtx
9775 {
9776 tree ost;
9781 {
9786 }
9794 {
9799 }
9804 }
9806 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9807 FCODE is the BUILT_IN_* to use.
9808 Return NULL_RTX if we failed; the caller should emit a normal call,
9809 otherwise try to get the result in TARGET, if convenient (and in
9810 mode MODE if that's convenient). */
9812 static rtx
9815 {
9817 POINTER_TYPE,
9818 fcode == BUILT_IN_MEMSET_CHK
9835 {
9836 /* Avoid transforming the checking call to an ordinary one when
9837 an overflow has been detected or when the call couldn't be
9838 validated because the size is not constant. */
9843 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9844 mem{cpy,pcpy,move,set} is available. */
9846 {
9861 }
9870 }
9873 else
9874 {
9877 /* If DEST is not a pointer type, call the normal function. */
9881 /* If SRC and DEST are the same (and not volatile), do nothing. */
9883 {
9884 tree expr;
9887 {
9888 /* Evaluate and ignore LEN in case it has side-effects. */
9891 }
9895 }
9897 /* __memmove_chk special case. */
9899 {
9905 /* If src is categorized for a readonly section we can use
9906 normal __memcpy_chk. */
9908 {
9917 }
9918 }
9920 }
9921 }
9923 /* Emit warning if a buffer overflow is detected at compile time. */
9925 static void
9927 {
9928 /* The source string. */
9930 /* The size of the destination object. */
9932 /* The string that is being concatenated with (as in __strcat_chk)
9933 or null if it isn't. */
9935 /* The maximum length of the source sequence in a bounded operation
9936 (such as __strncat_chk) or null if the operation isn't bounded
9937 (such as __strcat_chk). */
9939 /* The exact size of the access (such as in __strncpy_chk). */
9943 {
9951 /* For __strcat_chk the warning will be emitted only if overflowing
9952 by at least strlen (dest) + 1 bytes. */
9979 }
9982 {
9983 /* Check __strncat_chk. There is no way to determine the length
9984 of the string to which the source string is being appended so
9985 just warn when the length of the source string is not known. */
9988 }
9990 /* The destination argument is the first one for all built-ins above. */
9994 }
9996 /* Emit warning if a buffer overflow is detected at compile time
9997 in __sprintf_chk/__vsprintf_chk calls. */
9999 static void
10001 {
10006 /* Verify the required arguments in the original call. */
10016 /* Check whether the format is a literal string constant. */
10024 /* If the format doesn't contain % args or %%, we know its size. */
10027 /* If the format is "%s" and first ... argument is a string literal,
10028 we know it too. */
10031 {
10032 tree arg;
10043 }
10044 else
10047 /* Add one for the terminating nul. */
10052 }
10054 /* Emit warning if a free is called with address of a variable. */
10056 static void
10058 {
10072 else
10075 }
10077 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10078 if possible. */
10080 static tree
10082 {
10099 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10100 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10101 and (size_t) 0 for types 2 and 3. */
10106 {
10110 }
10112 {
10113 /* If object size is not known yet, delay folding until
10114 later. Maybe subsequent passes will help determining
10115 it. */
10119 }
10122 }
10124 /* Builtins with folding operations that operate on "..." arguments
10125 need special handling; we need to store the arguments in a convenient
10126 data structure before attempting any folding. Fortunately there are
10127 only a few builtins that fall into this category. FNDECL is the
10128 function, EXP is the CALL_EXPR for the call. */
10130 static tree
10132 {
10137 {
10144 }
10146 {
10151 }
10153 }
10155 /* Initialize format string characters in the target charset. */
10157 bool
10159 {
10162 {
10185 }
10187 }
10189 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10190 and no overflow/underflow occurred. INEXACT is true if M was not
10191 exactly calculated. TYPE is the tree type for the result. This
10192 function assumes that you cleared the MPFR flags and then
10193 calculated M to see if anything subsequently set a flag prior to
10194 entering this function. Return NULL_TREE if any checks fail. */
10196 static tree
10198 {
10199 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10200 overflow/underflow occurred. If -frounding-math, proceed iff the
10201 result of calling FUNC was exact. */
10204 {
10205 REAL_VALUE_TYPE rr;
10208 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10209 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10210 but the mpft_t is not, then we underflowed in the
10211 conversion. */
10214 {
10215 REAL_VALUE_TYPE rmode;
10218 /* Proceed iff the specified mode can hold the value. */
10221 }
10222 }
10224 }
10226 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10227 number and no overflow/underflow occurred. INEXACT is true if M
10228 was not exactly calculated. TYPE is the tree type for the result.
10229 This function assumes that you cleared the MPFR flags and then
10230 calculated M to see if anything subsequently set a flag prior to
10231 entering this function. Return NULL_TREE if any checks fail, if
10232 FORCE_CONVERT is true, then bypass the checks. */
10234 static tree
10236 {
10237 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10238 overflow/underflow occurred. If -frounding-math, proceed iff the
10239 result of calling FUNC was exact. */
10244 {
10249 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10250 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10251 but the mpft_t is not, then we underflowed in the
10252 conversion. */
10257 {
10262 /* Proceed iff the specified mode can hold the value. */
10268 }
10269 }
10271 }
10273 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10274 the pointer *(ARG_QUO) and return the result. The type is taken
10275 from the type of ARG0 and is used for setting the precision of the
10276 calculation and results. */
10278 static tree
10280 {
10287 /* To proceed, MPFR must exactly represent the target floating point
10288 format, which only happens when the target base equals two. */
10292 {
10297 {
10301 tree result_rem;
10310 /* Remquo is independent of the rounding mode, so pass
10311 inexact=0 to do_mpfr_ckconv(). */
10315 {
10316 /* MPFR calculates quo in the host's long so it may
10317 return more bits in quo than the target int can hold
10318 if sizeof(host long) > sizeof(target int). This can
10319 happen even for native compilers in LP64 mode. In
10320 these cases, modulo the quo value with the largest
10321 number that the target int can hold while leaving one
10322 bit for the sign. */
10326 /* Dereference the quo pointer argument. */
10328 /* Proceed iff a valid pointer type was passed in. */
10330 {
10331 /* Set the value. */
10332 tree result_quo
10335 integer_quo));
10337 /* Combine the quo assignment with the rem. */
10340 }
10341 }
10342 }
10343 }
10345 }
10347 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10348 resulting value as a tree with type TYPE. The mpfr precision is
10349 set to the precision of TYPE. We assume that this mpfr function
10350 returns zero if the result could be calculated exactly within the
10351 requested precision. In addition, the integer pointer represented
10352 by ARG_SG will be dereferenced and set to the appropriate signgam
10353 (-1,1) value. */
10355 static tree
10357 {
10362 /* To proceed, MPFR must exactly represent the target floating point
10363 format, which only happens when the target base equals two. Also
10364 verify ARG is a constant and that ARG_SG is an int pointer. */
10369 {
10372 /* In addition to NaN and Inf, the argument cannot be zero or a
10373 negative integer. */
10377 {
10382 mpfr_t m;
10383 tree result_lg;
10392 {
10393 tree result_sg;
10395 /* Dereference the arg_sg pointer argument. */
10397 /* Assign the signgam value into *arg_sg. */
10402 /* Combine the signgam assignment with the lgamma result. */
10405 }
10406 }
10407 }
10410 }
10412 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10413 mpc function FUNC on it and return the resulting value as a tree
10414 with type TYPE. The mpfr precision is set to the precision of
10415 TYPE. We assume that function FUNC returns zero if the result
10416 could be calculated exactly within the requested precision. If
10417 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10418 in the arguments and/or results. */
10420 tree
10423 {
10429 /* To proceed, MPFR must exactly represent the target floating point
10430 format, which only happens when the target base equals two. */
10436 {
10445 {
10465 }
10466 }
10469 }
10471 /* A wrapper function for builtin folding that prevents warnings for
10472 "statement without effect" and the like, caused by removing the
10473 call node earlier than the warning is generated. */
10475 tree
10477 {
10485 {
10494 {
10496 }
10497 else
10498 {
10501 {
10502 /* Propagate location information from original call to
10503 expansion of builtin. Otherwise things like
10504 maybe_emit_chk_warning, that operate on the expansion
10505 of a builtin, will use the wrong location information. */
10507 {
10515 }
10517 }
10518 }
10519 }
10521 }
10523 /* Look up the function in builtin_decl that corresponds to DECL
10524 and set ASMSPEC as its user assembler name. DECL must be a
10525 function decl that declares a builtin. */
10527 void
10529 {
10539 {
10543 }
10544 }
10546 /* Return true if DECL is a builtin that expands to a constant or similarly
10547 simple code. */
10548 bool
10550 {
10553 {
10554 /* Builtins that expand to constants. */
10559 /* Simple register moves or loads from stack. */
10570 /* Exception state returns or moves registers around. */
10578 }
10581 }
10583 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10584 most probably expanded inline into reasonably simple code. This is a
10585 superset of is_simple_builtin. */
10586 bool
10588 {
10595 {
10597 CASE_BUILT_IN_ALLOCA:
10663 }
10666 }
10668 /* Return true if T is a constant and the value cast to a target char
10669 can be represented by a host char.
10670 Store the casted char constant in *P if so. */
10672 bool
10674 {
10680 }
10682 /* Return the maximum object size. */
10684 tree
10686 {
10687 /* To do: Make this a configurable parameter. */
10689 }