| blob | a0d0a10d38fcdb3e3204f32e887d77bff6ba28a4 |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2018 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* Legacy warning! Please add no further builtin simplifications here
21 (apart from pure constant folding) - builtin simplifications should go
22 to match.pd or gimple-fold.c instead. */
75 #if SWITCHABLE_TARGET
77 #endif
79 /* Define the names of the builtin function types and codes. */
83 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
85 {
87 };
89 /* Setup an array of builtin_info_type, make sure each element decl is
90 initialized to NULL_TREE. */
93 /* Non-zero if __builtin_constant_p should be folded right away. */
195 /* Return true if NAME starts with __builtin_ or __sync_. */
197 static bool
199 {
207 }
210 /* Return true if DECL is a function symbol representing a built-in. */
212 bool
214 {
216 }
218 /* Return true if NODE should be considered for inline expansion regardless
219 of the optimization level. This means whenever a function is invoked with
220 its "internal" name, which normally contains the prefix "__builtin". */
222 bool
224 {
225 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
226 we want the name used to call the function, not the name it
227 will have. */
230 }
232 /* Compute values M and N such that M divides (address of EXP - N) and such
233 that N < M. If these numbers can be determined, store M in alignp and N in
234 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
235 *alignp and any bit-offset to *bitposp.
237 Note that the address (and thus the alignment) computed here is based
238 on the address to which a symbol resolves, whereas DECL_ALIGN is based
239 on the address at which an object is actually located. These two
240 addresses are not always the same. For example, on ARM targets,
241 the address &foo of a Thumb function foo() has the lowest bit set,
242 whereas foo() itself starts on an even address.
244 If ADDR_P is true we are taking the address of the memory reference EXP
245 and thus cannot rely on the access taking place. */
247 static bool
250 {
252 tree offset;
253 machine_mode mode;
258 /* Get the innermost object and the constant (bitpos) and possibly
259 variable (offset) offset of the access. */
263 /* Extract alignment information from the innermost object and
264 possibly adjust bitpos and offset. */
266 {
267 /* Function addresses can encode extra information besides their
268 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
269 allows the low bit to be used as a virtual bit, we know
270 that the address itself must be at least 2-byte aligned. */
273 }
275 ;
277 {
278 /* The alignment of a CONST_DECL is determined by its initializer. */
285 }
287 {
290 }
294 {
300 /* If the address is explicitely aligned, handle that. */
303 {
308 }
310 known_alignment
314 /* Re-apply explicit alignment to the bitpos. */
317 /* The alignment of the pointer operand in a TARGET_MEM_REF
318 has to take the variable offset parts into account. */
320 {
322 {
327 }
331 }
333 /* When EXP is an actual memory reference then we can use
334 TYPE_ALIGN of a pointer indirection to derive alignment.
335 Do so only if get_pointer_alignment_1 did not reveal absolute
336 alignment knowledge and if using that alignment would
337 improve the situation. */
343 else
344 {
345 /* Else adjust bitpos accordingly. */
350 }
351 }
353 {
354 /* STRING_CST are the only constant objects we allow to be not
355 wrapped inside a CONST_DECL. */
361 }
363 /* If there is a non-constant offset part extract the maximum
364 alignment that can prevail. */
366 {
369 {
373 }
374 }
376 /* Account for the alignment of runtime coefficients, so that the constant
377 bitpos is guaranteed to be accurate. */
380 {
383 }
388 }
390 /* For a memory reference expression EXP compute values M and N such that M
391 divides (&EXP - N) and such that N < M. If these numbers can be determined,
392 store M in alignp and N in *BITPOSP and return true. Otherwise return false
393 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
395 bool
398 {
400 }
402 /* Return the alignment in bits of EXP, an object. */
404 unsigned int
406 {
412 /* align and bitpos now specify known low bits of the pointer.
413 ptr & (align - 1) == bitpos. */
418 }
420 /* For a pointer valued expression EXP compute values M and N such that M
421 divides (EXP - N) and such that N < M. If these numbers can be determined,
422 store M in alignp and N in *BITPOSP and return true. Return false if
423 the results are just a conservative approximation.
425 If EXP is not a pointer, false is returned too. */
427 bool
430 {
437 {
444 else
445 {
448 {
452 }
453 }
457 }
460 {
465 {
468 /* Make sure to return a sensible alignment when the multiplication
469 by BITS_PER_UNIT overflowed. */
472 /* We cannot really tell whether this result is an approximation. */
474 }
475 else
476 {
480 }
481 }
483 {
488 }
493 }
495 /* Return the alignment in bits of EXP, a pointer valued expression.
496 The alignment returned is, by default, the alignment of the thing that
497 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
499 Otherwise, look at the expression to see if we can do better, i.e., if the
500 expression is actually pointing at an object whose alignment is tighter. */
502 unsigned int
504 {
510 /* align and bitpos now specify known low bits of the pointer.
511 ptr & (align - 1) == bitpos. */
517 }
519 /* Return the number of non-zero elements in the sequence
520 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
521 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
523 static unsigned
525 {
531 {
532 /* Optimize the common case of plain char. */
534 {
538 }
539 }
540 else
541 {
543 {
547 }
548 }
550 }
552 /* Compute the length of a null-terminated character string or wide
553 character string handling character sizes of 1, 2, and 4 bytes.
554 TREE_STRING_LENGTH is not the right way because it evaluates to
555 the size of the character array in bytes (as opposed to characters)
556 and because it can contain a zero byte in the middle.
558 ONLY_VALUE should be nonzero if the result is not going to be emitted
559 into the instruction stream and zero if it is going to be expanded.
560 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
561 is returned, otherwise NULL, since
562 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
563 evaluate the side-effects.
565 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
566 accesses. Note that this implies the result is not going to be emitted
567 into the instruction stream.
569 The value returned is of type `ssizetype'.
571 Unfortunately, string_constant can't access the values of const char
572 arrays with initializers, so neither can we do so here. */
574 tree
576 {
580 {
587 }
595 /* Offset from the beginning of the string in bytes. */
596 tree byteoff;
601 /* Determine the size of the string element. */
602 unsigned eltsize
605 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
606 length of SRC. */
609 /* PTR can point to the byte representation of any string type, including
610 char* and wchar_t*. */
614 {
615 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
616 compute the offset to the following null if we don't know where to
617 start searching for it. */
619 {
620 /* Return when an embedded null character is found. */
622 }
627 /* We don't know the starting offset, but we do know that the string
628 has no internal zero bytes. We can assume that the offset falls
629 within the bounds of the string; otherwise, the programmer deserves
630 what he gets. Subtract the offset from the length of the string,
631 and return that. This would perhaps not be valid if we were dealing
632 with named arrays in addition to literal string constants. */
635 }
637 /* Offset from the beginning of the string in elements. */
638 HOST_WIDE_INT eltoff;
640 /* We have a known offset into the string. Start searching there for
641 a null character if we can represent it as a single HOST_WIDE_INT. */
646 else
649 /* If the offset is known to be out of bounds, warn, and call strlen at
650 runtime. */
652 {
653 /* Suppress multiple warnings for propagated constant strings. */
656 {
659 eltoff);
661 }
663 }
665 /* Use strlen to search for the first zero byte. Since any strings
666 constructed with build_string will have nulls appended, we win even
667 if we get handed something like (char[4])"abcd".
669 Since ELTOFF is our starting index into the string, no further
670 calculation is needed. */
675 }
677 /* Return a constant integer corresponding to target reading
678 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
680 static rtx
682 {
683 HOST_WIDE_INT ch;
697 {
709 }
713 }
715 /* Cast a target constant CST to target CHAR and if that value fits into
716 host char type, return zero and put that value into variable pointed to by
717 P. */
719 static int
721 {
728 /* Do not care if it fits or not right here. */
743 }
745 /* Similar to save_expr, but assumes that arbitrary code is not executed
746 in between the multiple evaluations. In particular, we assume that a
747 non-addressable local variable will not be modified. */
749 static tree
751 {
759 }
761 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
762 times to get the address of either a higher stack frame, or a return
763 address located within it (depending on FNDECL_CODE). */
765 static rtx
767 {
771 {
772 /* For a zero count with __builtin_return_address, we don't care what
773 frame address we return, because target-specific definitions will
774 override us. Therefore frame pointer elimination is OK, and using
775 the soft frame pointer is OK.
777 For a nonzero count, or a zero count with __builtin_frame_address,
778 we require a stable offset from the current frame pointer to the
779 previous one, so we must use the hard frame pointer, and
780 we must disable frame pointer elimination. */
783 else
784 {
787 /* Tell reload not to eliminate the frame pointer. */
789 }
790 }
795 /* On the SPARC, the return address is not in the frame, it is in a
796 register. There is no way to access it off of the current frame
797 pointer, but it can be accessed off the previous frame pointer by
798 reading the value from the register window save area. */
800 count--;
802 /* Scan back COUNT frames to the specified frame. */
804 {
805 /* Assume the dynamic chain pointer is in the word that the
806 frame address points to, unless otherwise specified. */
811 }
813 /* For __builtin_frame_address, return what we've got. But, on
814 the SPARC for example, we may have to add a bias. */
818 /* For __builtin_return_address, get the return address from that frame. */
819 #ifdef RETURN_ADDR_RTX
821 #else
825 #endif
827 }
829 /* Alias set used for setjmp buffer. */
832 /* Construct the leading half of a __builtin_setjmp call. Control will
833 return to RECEIVER_LABEL. This is also called directly by the SJLJ
834 exception handling code. */
836 void
838 {
840 rtx stack_save;
841 rtx mem;
850 /* We store the frame pointer and the address of receiver_label in
851 the buffer and use the rest of it for the stack save area, which
852 is machine-dependent. */
871 /* If there is further processing to do, do it. */
875 /* We have a nonlocal label. */
877 }
879 /* Construct the trailing part of a __builtin_setjmp call. This is
880 also called directly by the SJLJ exception handling code.
881 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
883 void
885 {
886 rtx chain;
888 /* Mark the FP as used when we get here, so we have to make sure it's
889 marked as used by this function. */
892 /* Mark the static chain as clobbered here so life information
893 doesn't get messed up for it. */
898 /* Now put in the code to restore the frame pointer, and argument
899 pointer, if needed. */
901 {
902 /* First adjust our frame pointer to its actual value. It was
903 previously set to the start of the virtual area corresponding to
904 the stacked variables when we branched here and now needs to be
905 adjusted to the actual hardware fp value.
907 Assignments to virtual registers are converted by
908 instantiate_virtual_regs into the corresponding assignment
909 to the underlying register (fp in this case) that makes
910 the original assignment true.
911 So the following insn will actually be decrementing fp by
912 TARGET_STARTING_FRAME_OFFSET. */
915 /* Restoring the frame pointer also modifies the hard frame pointer.
916 Mark it used (so that the previous assignment remains live once
917 the frame pointer is eliminated) and clobbered (to represent the
918 implicit update from the assignment). */
921 }
924 {
925 /* If the argument pointer can be eliminated in favor of the
926 frame pointer, we don't need to restore it. We assume here
927 that if such an elimination is present, it can always be used.
928 This is the case on all known machines; if we don't make this
929 assumption, we do unnecessary saving on many machines. */
939 {
940 /* Now restore our arg pointer from the address at which it
941 was saved in our stack frame. */
944 }
945 }
951 else
954 /* We must not allow the code we just generated to be reordered by
955 scheduling. Specifically, the update of the frame pointer must
956 happen immediately, not later. */
958 }
960 /* __builtin_longjmp is passed a pointer to an array of five words (not
961 all will be used on all machines). It operates similarly to the C
962 library function of the same name, but is more efficient. Much of
963 the code below is copied from the handling of non-local gotos. */
965 static void
967 {
972 /* DRAP is needed for stack realign if longjmp is expanded to current
973 function */
984 /* We require that the user must pass a second argument of 1, because
985 that is what builtin_setjmp will return. */
991 else
992 {
1003 /* Pick up FP, label, and SP from the block and jump. This code is
1004 from expand_goto in stmt.c; see there for detailed comments. */
1006 /* We have to pass a value to the nonlocal_goto pattern that will
1007 get copied into the static_chain pointer, but it does not matter
1008 what that value is, because builtin_setjmp does not use it. */
1010 else
1011 {
1023 }
1024 }
1026 /* Search backwards and mark the jump insn as a non-local goto.
1027 Note that this precludes the use of __builtin_longjmp to a
1028 __builtin_setjmp target in the same function. However, we've
1029 already cautioned the user that these functions are for
1030 internal exception handling use only. */
1032 {
1036 {
1039 }
1042 }
1043 }
1047 {
1049 }
1051 /* This function validates the types of a function call argument list
1052 against a specified list of tree_codes. If the last specifier is a 0,
1053 that represents an ellipsis, otherwise the last specifier must be a
1054 VOID_TYPE. */
1056 static bool
1058 {
1062 const_call_expr_arg_iterator iter;
1063 const_tree arg;
1068 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1073 {
1077 {
1079 /* This signifies an ellipses, any further arguments are all ok. */
1083 /* This signifies an endlink, if no arguments remain, return
1084 true, otherwise return false. */
1088 /* The actual argument must be nonnull when either the whole
1089 called function has been declared nonnull, or when the formal
1090 argument corresponding to the actual argument has been. */
1093 {
1098 }
1099 /* FALLTHRU */
1101 /* If no parameters remain or the parameter's code does not
1102 match the specified code, return false. Otherwise continue
1103 checking any remaining arguments. */
1108 }
1109 }
1111 /* We need gotos here since we can only have one VA_CLOSE in a
1112 function. */
1113 end: ;
1119 }
1121 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1122 and the address of the save area. */
1124 static rtx
1126 {
1141 /* Copy the address of the save location to a register just in case it was
1142 based on the frame pointer. */
1151 /* ??? We no longer need to pass the static chain value, afaik. */
1154 else
1155 {
1161 /* Restore frame pointer for containing function. */
1165 /* USE of hard_frame_pointer_rtx added for consistency;
1166 not clear if really needed. */
1170 /* If the architecture is using a GP register, we must
1171 conservatively assume that the target function makes use of it.
1172 The prologue of functions with nonlocal gotos must therefore
1173 initialize the GP register to the appropriate value, and we
1174 must then make sure that this value is live at the point
1175 of the jump. (Note that this doesn't necessarily apply
1176 to targets with a nonlocal_goto pattern; they are free
1177 to implement it in their own way. Note also that this is
1178 a no-op if the GP register is a global invariant.) */
1184 }
1186 /* Search backwards to the jump insn and mark it as a
1187 non-local goto. */
1189 {
1191 {
1194 }
1197 }
1200 }
1202 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1203 (not all will be used on all machines) that was passed to __builtin_setjmp.
1204 It updates the stack pointer in that block to the current value. This is
1205 also called directly by the SJLJ exception handling code. */
1207 void
1209 {
1212 rtx stack_save
1214 memory_address
1220 }
1222 /* Expand a call to __builtin_prefetch. For a target that does not support
1223 data prefetch, evaluate the memory address argument in case it has side
1224 effects. */
1226 static void
1228 {
1238 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1239 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1240 locality). */
1244 else
1248 else
1251 /* Argument 0 is an address. */
1254 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1256 {
1259 }
1261 /* Argument 1 must be either zero or one. */
1263 {
1267 }
1269 /* Argument 2 (locality) must be a compile-time constant int. */
1271 {
1274 }
1276 /* Argument 2 must be 0, 1, 2, or 3. */
1278 {
1281 }
1284 {
1292 }
1294 /* Don't do anything with direct references to volatile memory, but
1295 generate code to handle other side effects. */
1298 }
1300 /* Get a MEM rtx for expression EXP which is the address of an operand
1301 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1302 the maximum length of the block of memory that might be accessed or
1303 NULL if unknown. */
1305 static rtx
1307 {
1311 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1312 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1319 /* Get an expression we can use to find the attributes to assign to MEM.
1320 First remove any nops. */
1325 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1326 (as builtin stringops may alias with anything). */
1333 /* If the MEM_REF has no acceptable address, try to get the base object
1334 from the original address we got, and build an all-aliasing
1335 unknown-sized access to that one. */
1341 {
1346 size_zero_node,
1347 NULL)),
1350 }
1353 }
1354 \f
1355 /* Built-in functions to perform an untyped call and return. */
1357 #define apply_args_mode \
1358 (this_target_builtins->x_apply_args_mode)
1359 #define apply_result_mode \
1360 (this_target_builtins->x_apply_result_mode)
1362 /* Return the size required for the block returned by __builtin_apply_args,
1363 and initialize apply_args_mode. */
1365 static int
1367 {
1372 /* The values computed by this function never change. */
1374 {
1375 /* The first value is the incoming arg-pointer. */
1378 /* The second value is the structure value address unless this is
1379 passed as an "invisible" first argument. */
1385 {
1395 }
1396 else
1397 {
1399 }
1400 }
1402 }
1404 /* Return the size required for the block returned by __builtin_apply,
1405 and initialize apply_result_mode. */
1407 static int
1409 {
1413 /* The values computed by this function never change. */
1415 {
1420 {
1430 }
1431 else
1434 /* Allow targets that use untyped_call and untyped_return to override
1435 the size so that machine-specific information can be stored here. */
1436 #ifdef APPLY_RESULT_SIZE
1438 #endif
1439 }
1441 }
1443 /* Create a vector describing the result block RESULT. If SAVEP is true,
1444 the result block is used to save the values; otherwise it is used to
1445 restore the values. */
1447 static rtx
1449 {
1451 fixed_size_mode mode;
1458 {
1468 }
1470 }
1472 /* Save the state required to perform an untyped call with the same
1473 arguments as were passed to the current function. */
1475 static rtx
1477 {
1480 fixed_size_mode mode;
1481 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1483 /* Create a block where the arg-pointer, structure value address,
1484 and argument registers can be saved. */
1487 /* Walk past the arg-pointer and structure value address. */
1492 /* Save each register used in calling a function to the block. */
1495 {
1504 }
1506 /* Save the arg pointer to the block. */
1508 /* We need the pointer as the caller actually passed them to us, not
1509 as we might have pretended they were passed. Make sure it's a valid
1510 operand, as emit_move_insn isn't expected to handle a PLUS. */
1512 tem
1515 NULL_RTX);
1520 /* Save the structure value address unless this is passed as an
1521 "invisible" first argument. */
1523 {
1527 }
1529 /* Return the address of the block. */
1531 }
1533 /* __builtin_apply_args returns block of memory allocated on
1534 the stack into which is stored the arg pointer, structure
1535 value address, static chain, and all the registers that might
1536 possibly be used in performing a function call. The code is
1537 moved to the start of the function so the incoming values are
1538 saved. */
1540 static rtx
1542 {
1543 /* Don't do __builtin_apply_args more than once in a function.
1544 Save the result of the first call and reuse it. */
1547 {
1548 /* When this function is called, it means that registers must be
1549 saved on entry to this function. So we migrate the
1550 call to the first insn of this function. */
1551 rtx temp;
1560 /* Put the insns after the NOTE that starts the function.
1561 If this is inside a start_sequence, make the outer-level insn
1562 chain current, so the code is placed at the start of the
1563 function. If internal_arg_pointer is a non-virtual pseudo,
1564 it needs to be placed after the function that initializes
1565 that pseudo. */
1570 else
1574 }
1575 }
1577 /* Perform an untyped call and save the state required to perform an
1578 untyped return of whatever value was returned by the given function. */
1580 static rtx
1582 {
1584 fixed_size_mode mode;
1593 /* Create a block where the return registers can be saved. */
1596 /* Fetch the arg pointer from the ARGUMENTS block. */
1603 /* Push a new argument block and copy the arguments. Do not allow
1604 the (potential) memcpy call below to interfere with our stack
1605 manipulations. */
1607 NO_DEFER_POP;
1609 /* Save the stack with nonlocal if available. */
1612 else
1615 /* Allocate a block of memory onto the stack and copy the memory
1616 arguments to the outgoing arguments address. We can pass TRUE
1617 as the 4th argument because we just saved the stack pointer
1618 and will restore it right after the call. */
1621 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1622 may have already set current_function_calls_alloca to true.
1623 current_function_calls_alloca won't be set if argsize is zero,
1624 so we have to guarantee need_drap is true here. */
1630 {
1633 else
1635 }
1642 /* Refer to the argument block. */
1647 /* Walk past the arg-pointer and structure value address. */
1652 /* Restore each of the registers previously saved. Make USE insns
1653 for each of these registers for use in making the call. */
1656 {
1664 }
1666 /* Restore the structure value address unless this is passed as an
1667 "invisible" first argument. */
1670 {
1677 }
1679 /* All arguments and registers used for the call are set up by now! */
1682 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1683 and we don't want to load it into a register as an optimization,
1684 because prepare_call_address already did it if it should be done. */
1688 /* Generate the actual call instruction and save the return value. */
1690 {
1694 }
1696 {
1699 /* Locate the unique return register. It is not possible to
1700 express a call that sets more than one return register using
1701 call_value; use untyped_call for that. In fact, untyped_call
1702 only needs to save the return registers in the given block. */
1705 {
1709 }
1716 }
1717 else
1720 /* Find the CALL insn we just emitted, and attach the register usage
1721 information. */
1725 /* Restore the stack. */
1728 else
1732 OK_DEFER_POP;
1734 /* Return the address of the result block. */
1737 }
1739 /* Perform an untyped return. */
1741 static void
1743 {
1745 fixed_size_mode mode;
1746 rtx reg;
1755 {
1760 }
1762 /* Restore the return value and note that each value is used. */
1766 {
1778 }
1780 /* Put the USE insns before the return. */
1783 /* Return whatever values was restored by jumping directly to the end
1784 of the function. */
1786 }
1788 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1790 static enum type_class
1792 {
1794 {
1813 }
1814 }
1816 /* Expand a call EXP to __builtin_classify_type. */
1818 static rtx
1820 {
1824 }
1826 /* This helper macro, meant to be used in mathfn_built_in below, determines
1827 which among a set of builtin math functions is appropriate for a given type
1828 mode. The `F' (float) and `L' (long double) are automatically generated
1829 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1830 types, there are additional types that are considered with 'F32', 'F64',
1831 'F128', etc. suffixes. */
1832 #define CASE_MATHFN(MATHFN) \
1833 CASE_CFN_##MATHFN: \
1834 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1835 fcodel = BUILT_IN_##MATHFN##L ; break;
1836 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1837 types. */
1838 #define CASE_MATHFN_FLOATN(MATHFN) \
1839 CASE_CFN_##MATHFN: \
1840 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1841 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1842 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1843 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1844 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1845 break;
1846 /* Similar to above, but appends _R after any F/L suffix. */
1847 #define CASE_MATHFN_REENT(MATHFN) \
1848 case CFN_BUILT_IN_##MATHFN##_R: \
1849 case CFN_BUILT_IN_##MATHFN##F_R: \
1850 case CFN_BUILT_IN_##MATHFN##L_R: \
1851 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1852 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1854 /* Return a function equivalent to FN but operating on floating-point
1855 values of type TYPE, or END_BUILTINS if no such function exists.
1856 This is purely an operation on function codes; it does not guarantee
1857 that the target actually has an implementation of the function. */
1859 static built_in_function
1861 {
1862 tree mtype;
1873 {
1964 }
1987 else
1989 }
1991 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1992 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1993 otherwise use the explicit declaration. If we can't do the conversion,
1994 return null. */
1996 static tree
1998 {
2007 }
2009 /* Like mathfn_built_in_1, but always use the implicit array. */
2011 tree
2013 {
2015 }
2017 /* Like mathfn_built_in_1, but take a built_in_function and
2018 always use the implicit array. */
2020 tree
2022 {
2024 }
2026 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2027 return its code, otherwise return IFN_LAST. Note that this function
2028 only tests whether the function is defined in internals.def, not whether
2029 it is actually available on the target. */
2031 internal_fn
2033 {
2037 {
2038 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2039 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2040 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2041 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2042 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2043 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2044 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2061 }
2062 }
2064 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2065 on the current target by a call to an internal function, return the
2066 code of that internal function, otherwise return IFN_LAST. The caller
2067 is responsible for ensuring that any side-effects of the built-in
2068 call are dealt with correctly. E.g. if CALL sets errno, the caller
2069 must decide that the errno result isn't needed or make it available
2070 in some other way. */
2072 internal_fn
2074 {
2076 {
2079 {
2084 }
2085 }
2087 }
2089 /* Expand a call to the builtin trinary math functions (fma).
2090 Return NULL_RTX if a normal call should be emitted rather than expanding the
2091 function in-line. EXP is the expression that is a call to the builtin
2092 function; if convenient, the result should be placed in TARGET.
2093 SUBTARGET may be used as the target for computing one of EXP's
2094 operands. */
2096 static rtx
2098 {
2099 optab builtin_optab;
2104 machine_mode mode;
2114 {
2120 }
2122 /* Make a suitable register to place result in. */
2125 /* Before working hard, check whether the instruction is available. */
2131 /* Always stabilize the argument list. */
2142 /* Compute into RESULT.
2143 Set RESULT to wherever the result comes back. */
2147 /* If we were unable to expand via the builtin, stop the sequence
2148 (without outputting the insns) and call to the library function
2149 with the stabilized argument list. */
2151 {
2154 }
2156 /* Output the entire sequence. */
2162 }
2164 /* Expand a call to the builtin sin and cos math functions.
2165 Return NULL_RTX if a normal call should be emitted rather than expanding the
2166 function in-line. EXP is the expression that is a call to the builtin
2167 function; if convenient, the result should be placed in TARGET.
2168 SUBTARGET may be used as the target for computing one of EXP's
2169 operands. */
2171 static rtx
2173 {
2174 optab builtin_optab;
2175 rtx op0;
2178 machine_mode mode;
2179 tree arg;
2187 {
2193 }
2195 /* Make a suitable register to place result in. */
2198 /* Check if sincos insn is available, otherwise fallback
2199 to sin or cos insn. */
2202 {
2209 }
2211 /* Before working hard, check whether the instruction is available. */
2213 {
2216 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2217 need to expand the argument again. This way, we will not perform
2218 side-effects more the once. */
2225 /* Compute into RESULT.
2226 Set RESULT to wherever the result comes back. */
2228 {
2232 {
2241 }
2243 }
2244 else
2248 {
2249 /* Output the entire sequence. */
2254 }
2256 /* If we were unable to expand via the builtin, stop the sequence
2257 (without outputting the insns) and call to the library function
2258 with the stabilized argument list. */
2260 }
2263 }
2265 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2266 return an RTL instruction code that implements the functionality.
2267 If that isn't possible or available return CODE_FOR_nothing. */
2269 static enum insn_code
2271 {
2274 machine_mode mode;
2277 {
2291 /* These builtins have no optabs (yet). */
2295 }
2297 /* There's no easy way to detect the case we need to set EDOM. */
2301 /* Optab mode depends on the mode of the input argument. */
2307 }
2309 /* Expand a call to one of the builtin math functions that operate on
2310 floating point argument and output an integer result (ilogb, isinf,
2311 isnan, etc).
2312 Return 0 if a normal call should be emitted rather than expanding the
2313 function in-line. EXP is the expression that is a call to the builtin
2314 function; if convenient, the result should be placed in TARGET. */
2316 static rtx
2318 {
2320 rtx op0;
2322 machine_mode mode;
2323 tree arg;
2333 {
2338 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2339 need to expand the argument again. This way, we will not perform
2340 side-effects more the once. */
2355 }
2358 }
2360 /* Expand a call to the builtin sincos math function.
2361 Return NULL_RTX if a normal call should be emitted rather than expanding the
2362 function in-line. EXP is the expression that is a call to the builtin
2363 function. */
2365 static rtx
2367 {
2369 machine_mode mode;
2383 /* Make a suitable register to place result in. */
2386 /* Check if sincos insn is available, otherwise emit the call. */
2401 /* Compute into target1 and target2.
2402 Set TARGET to wherever the result comes back. */
2406 /* Move target1 and target2 to the memory locations indicated
2407 by op1 and op2. */
2412 }
2414 /* Expand a call to the internal cexpi builtin to the sincos math function.
2415 EXP is the expression that is a call to the builtin function; if convenient,
2416 the result should be placed in TARGET. */
2418 static rtx
2420 {
2423 machine_mode mode;
2434 /* Try expanding via a sincos optab, fall back to emitting a libcall
2435 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2436 is only generated from sincos, cexp or if we have either of them. */
2438 {
2444 /* Compute into op1 and op2. */
2446 }
2448 {
2459 else
2469 /* Make sure not to fold the sincos call again. */
2473 }
2474 else
2475 {
2485 else
2488 /* If we don't have a decl for cexp create one. This is the
2489 friendliest fallback if the user calls __builtin_cexpi
2490 without full target C99 function support. */
2492 {
2493 tree fntype;
2505 }
2510 /* Make sure not to fold the cexp call again. */
2514 }
2516 /* Now build the proper return type. */
2521 }
2523 /* Conveniently construct a function call expression. FNDECL names the
2524 function to be called, N is the number of arguments, and the "..."
2525 parameters are the argument expressions. Unlike build_call_exr
2526 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2528 static tree
2530 {
2540 }
2542 /* Expand a call to one of the builtin rounding functions gcc defines
2543 as an extension (lfloor and lceil). As these are gcc extensions we
2544 do not need to worry about setting errno to EDOM.
2545 If expanding via optab fails, lower expression to (int)(floor(x)).
2546 EXP is the expression that is a call to the builtin function;
2547 if convenient, the result should be placed in TARGET. */
2549 static rtx
2551 {
2552 convert_optab builtin_optab;
2557 tree fallback_fndecl;
2558 machine_mode mode;
2559 tree arg;
2567 {
2584 }
2586 /* Make a suitable register to place result in. */
2591 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2592 need to expand the argument again. This way, we will not perform
2593 side-effects more the once. */
2600 /* Compute into TARGET. */
2602 {
2603 /* Output the entire sequence. */
2608 }
2610 /* If we were unable to expand via the builtin, stop the sequence
2611 (without outputting the insns). */
2614 /* Fall back to floating point rounding optab. */
2617 /* For non-C99 targets we may end up without a fallback fndecl here
2618 if the user called __builtin_lfloor directly. In this case emit
2619 a call to the floor/ceil variants nevertheless. This should result
2620 in the best user experience for not full C99 targets. */
2622 {
2623 tree fntype;
2627 {
2660 }
2665 }
2672 /* Truncate the result of floating point optab to integer
2673 via expand_fix (). */
2678 }
2680 /* Expand a call to one of the builtin math functions doing integer
2681 conversion (lrint).
2682 Return 0 if a normal call should be emitted rather than expanding the
2683 function in-line. EXP is the expression that is a call to the builtin
2684 function; if convenient, the result should be placed in TARGET. */
2686 static rtx
2688 {
2689 convert_optab builtin_optab;
2690 rtx op0;
2693 tree arg;
2694 machine_mode mode;
2703 {
2722 }
2724 /* There's no easy way to detect the case we need to set EDOM. */
2728 /* Make a suitable register to place result in. */
2731 /* There's no easy way to detect the case we need to set EDOM. */
2733 {
2736 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2737 need to expand the argument again. This way, we will not perform
2738 side-effects more the once. */
2746 {
2747 /* Output the entire sequence. */
2752 }
2754 /* If we were unable to expand via the builtin, stop the sequence
2755 (without outputting the insns) and call to the library function
2756 with the stabilized argument list. */
2758 }
2761 {
2762 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2763 targets, (int) round (x) should never be transformed into
2764 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2765 a call to lround in the hope that the target provides at least some
2766 C99 functions. This should result in the best user experience for
2767 not full C99 targets. */
2768 tree fallback_fndecl = mathfn_built_in_1
2777 }
2780 }
2782 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2783 a normal call should be emitted rather than expanding the function
2784 in-line. EXP is the expression that is a call to the builtin
2785 function; if convenient, the result should be placed in TARGET. */
2787 static rtx
2789 {
2792 machine_mode mode;
2793 machine_mode mode2;
2802 /* Emit a libcall to libgcc. */
2804 /* Mode of the 2nd argument must match that of an int. */
2822 }
2824 /* Expand expression EXP which is a call to the strlen builtin. Return
2825 NULL_RTX if we failed the caller should emit a normal call, otherwise
2826 try to get the result in TARGET, if convenient. */
2828 static rtx
2830 machine_mode target_mode)
2831 {
2836 rtx pat;
2837 tree len;
2839 rtx src_reg;
2841 machine_mode insn_mode;
2845 /* If the length can be computed at compile-time, return it. */
2850 /* If the length can be computed at compile-time and is constant
2851 integer, but there are side-effects in src, evaluate
2852 src for side-effects, then return len.
2853 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2854 can be optimized into: i++; x = 3; */
2857 {
2860 }
2864 /* If SRC is not a pointer type, don't do this operation inline. */
2868 /* Bail out if we can't compute strlen in the right mode. */
2870 {
2874 }
2878 /* Make a place to hold the source address. We will not expand
2879 the actual source until we are sure that the expansion will
2880 not fail -- there are trees that cannot be expanded twice. */
2883 /* Mark the beginning of the strlen sequence so we can emit the
2884 source operand later. */
2894 /* Check to see if the argument was declared attribute nonstring
2895 and if so, issue a warning since at this point it's not known
2896 to be nul-terminated. */
2899 /* Now that we are assured of success, expand the source. */
2903 {
2904 #ifdef POINTERS_EXTEND_UNSIGNED
2907 POINTERS_EXTEND_UNSIGNED);
2908 #endif
2910 }
2916 else
2919 /* Return the value in the proper mode for this function. */
2924 else
2928 }
2930 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2931 bytes from constant string DATA + OFFSET and return it as target
2932 constant. */
2934 static rtx
2936 scalar_int_mode mode)
2937 {
2945 }
2947 /* LEN specify length of the block of memcpy/memset operation.
2948 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2949 In some cases we can make very likely guess on max size, then we
2950 set it into PROBABLE_MAX_SIZE. */
2952 static void
2957 {
2959 {
2962 }
2963 else
2964 {
2968 /* Determine bounds from the type. */
2971 else
2976 else
2982 {
2987 }
2989 {
2990 /* Anti range 0...N lets us to determine minimal size to N+1. */
2992 {
2995 }
2996 /* Code like
2998 int n;
2999 if (n < 100)
3000 memcpy (a, b, n)
3002 Produce anti range allowing negative values of N. We still
3003 can use the information and make a guess that N is not negative.
3004 */
3007 }
3008 }
3012 }
3014 /* Try to verify that the sizes and lengths of the arguments to a string
3015 manipulation function given by EXP are within valid bounds and that
3016 the operation does not lead to buffer overflow or read past the end.
3017 Arguments other than EXP may be null. When non-null, the arguments
3018 have the following meaning:
3019 DST is the destination of a copy call or NULL otherwise.
3020 SRC is the source of a copy call or NULL otherwise.
3021 DSTWRITE is the number of bytes written into the destination obtained
3022 from the user-supplied size argument to the function (such as in
3023 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3024 MAXREAD is the user-supplied bound on the length of the source sequence
3025 (such as in strncat(d, s, N). It specifies the upper limit on the number
3026 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3027 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3028 expression EXP is a string function call (as opposed to a memory call
3029 like memcpy). As an exception, SRCSTR can also be an integer denoting
3030 the precomputed size of the source string or object (for functions like
3031 memcpy).
3032 DSTSIZE is the size of the destination object specified by the last
3033 argument to the _chk builtins, typically resulting from the expansion
3034 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3035 DSTSIZE).
3037 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3038 SIZE_MAX.
3040 If the call is successfully verified as safe return true, otherwise
3041 return false. */
3043 static bool
3046 {
3049 /* The size of the largest object is half the address space, or
3050 PTRDIFF_MAX. (This is way too permissive.) */
3053 /* Either the length of the source string for string functions or
3054 the size of the source object for raw memory functions. */
3059 /* Set to true when the exact number of bytes written by a string
3060 function like strcpy is not known and the only thing that is
3061 known is that it must be at least one (for the terminating nul). */
3064 {
3065 /* SRCSTR is normally a pointer to string but as a special case
3066 it can be an integer denoting the length of a string. */
3068 {
3069 /* Try to determine the range of lengths the source string
3070 refers to. If it can be determined and is less than
3071 the upper bound given by MAXREAD add one to it for
3072 the terminating nul. Otherwise, set it to one for
3073 the same reason, or to MAXREAD as appropriate. */
3076 {
3079 else
3090 }
3091 else
3092 {
3095 }
3096 }
3097 else
3099 }
3102 {
3103 /* When the only available piece of data is the object size
3104 there is nothing to do. */
3108 /* Otherwise, when the length of the source sequence is known
3109 (as with strlen), set DSTWRITE to it. */
3112 }
3122 /* First check the number of bytes to be written against the maximum
3123 object size. */
3125 {
3131 "%K%qD specified size %E "
3134 else
3136 "%K%qD specified size between %E and %E "
3141 }
3143 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3144 constant, and in range of unsigned HOST_WIDE_INT. */
3147 /* Next check the number of bytes to be written against the destination
3148 object size. */
3150 {
3156 {
3161 {
3162 /* This is a call to strcpy with a destination of 0 size
3163 and a source of unknown length. The call will write
3164 at least one byte past the end of the destination. */
3166 "%K%qD writing %E or more bytes into a region "
3169 }
3179 {
3180 /* Avoid printing the upper bound if it's invalid. */
3182 "%K%qD writing %E or more bytes into a region "
3185 }
3186 else
3188 "%K%qD writing between %E and %E bytes into "
3191 dstsize);
3193 /* Return error when an overflow has been detected. */
3195 }
3196 }
3198 /* Check the maximum length of the source sequence against the size
3199 of the destination object if known, or against the maximum size
3200 of an object. */
3202 {
3205 /* Use the lower end for MAXREAD from now on. */
3210 {
3215 {
3216 /* Warn about crazy big sizes first since that's more
3217 likely to be meaningful than saying that the bound
3218 is greater than the object size if both are big. */
3221 "%K%qD specified bound %E "
3225 else
3227 "%K%qD specified bound between %E and %E "
3233 }
3236 {
3239 "%K%qD specified bound %E "
3243 else
3245 "%K%qD specified bound between %E and %E "
3250 }
3251 }
3252 }
3254 /* Check for reading past the end of SRC. */
3259 {
3269 {
3270 /* Avoid printing the upper bound if it's invalid. */
3272 "%K%qD reading %E or more bytes from a region "
3275 }
3276 else
3278 "%K%qD reading between %E and %E bytes from a region "
3282 }
3285 }
3287 /* Helper to compute the size of the object referenced by the DEST
3288 expression which must have pointer type, using Object Size type
3289 OSTYPE (only the least significant 2 bits are used). Return
3290 an estimate of the size of the object if successful or NULL when
3291 the size cannot be determined. When the referenced object involves
3292 a non-constant offset in some range the returned value represents
3293 the largest size given the smallest non-negative offset in the
3294 range. The function is intended for diagnostics and should not
3295 be used to influence code generation or optimization. */
3297 tree
3299 {
3302 /* Only the two least significant bits are meaningful. */
3309 {
3318 {
3319 /* compute_builtin_object_size fails for addresses with
3320 non-constant offsets. Try to determine the range of
3321 such an offset here and use it to adjus the constant
3322 size. */
3326 {
3331 {
3333 {
3336 /* Ignore negative offsets for now. For others,
3337 use the lower bound as the most optimistic
3338 estimate of the (remaining)size. */
3340 ;
3344 else
3346 }
3347 }
3348 }
3349 }
3352 }
3354 /* Unless computing the largest size (for memcpy and other raw memory
3355 functions), try to determine the size of the object from its type. */
3370 {
3371 /* Return the constant size unless it's zero (that's a zero-length
3372 array likely at the end of a struct). */
3377 }
3380 }
3382 /* Helper to determine and check the sizes of the source and the destination
3383 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3384 call expression, DEST is the destination argument, SRC is the source
3385 argument or null, and LEN is the number of bytes. Use Object Size type-0
3386 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3387 (no overflow or invalid sizes), false otherwise. */
3389 static bool
3391 {
3392 /* For functions like memset and memcpy that operate on raw memory
3393 try to determine the size of the largest source and destination
3394 object using type-0 Object Size regardless of the object size
3395 type specified by the option. */
3401 }
3403 /* Validate memchr arguments without performing any expansion.
3404 Return NULL_RTX. */
3406 static rtx
3408 {
3416 /* Diagnose calls where the specified length exceeds the size
3417 of the object. */
3419 {
3423 }
3426 }
3428 /* Expand a call EXP to the memcpy builtin.
3429 Return NULL_RTX if we failed, the caller should emit a normal call,
3430 otherwise try to get the result in TARGET, if convenient (and in
3431 mode MODE if that's convenient). */
3433 static rtx
3435 {
3448 }
3450 /* Check a call EXP to the memmove built-in for validity.
3451 Return NULL_RTX on both success and failure. */
3453 static rtx
3455 {
3467 }
3469 /* Expand an instrumented call EXP to the memcpy builtin.
3470 Return NULL_RTX if we failed, the caller should emit a normal call,
3471 otherwise try to get the result in TARGET, if convenient (and in
3472 mode MODE if that's convenient). */
3474 static rtx
3476 {
3482 else
3483 {
3490 /* Return src bounds with the result. */
3492 {
3496 }
3498 }
3499 }
3501 /* Expand a call EXP to the mempcpy builtin.
3502 Return NULL_RTX if we failed; the caller should emit a normal call,
3503 otherwise try to get the result in TARGET, if convenient (and in
3504 mode MODE if that's convenient). If ENDP is 0 return the
3505 destination pointer, if ENDP is 1 return the end pointer ala
3506 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3507 stpcpy. */
3509 static rtx
3511 {
3520 /* Policy does not generally allow using compute_objsize (which
3521 is used internally by check_memop_size) to change code generation
3522 or drive optimization decisions.
3524 In this instance it is safe because the code we generate has
3525 the same semantics regardless of the return value of
3526 check_memop_sizes. Exactly the same amount of data is copied
3527 and the return value is exactly the same in both cases.
3529 Furthermore, check_memop_size always uses mode 0 for the call to
3530 compute_objsize, so the imprecise nature of compute_objsize is
3531 avoided. */
3533 /* Avoid expanding mempcpy into memcpy when the call is determined
3534 to overflow the buffer. This also prevents the same overflow
3535 from being diagnosed again when expanding memcpy. */
3541 }
3543 /* Expand an instrumented call EXP to the mempcpy builtin.
3544 Return NULL_RTX if we failed, the caller should emit a normal call,
3545 otherwise try to get the result in TARGET, if convenient (and in
3546 mode MODE if that's convenient). */
3548 static rtx
3550 {
3556 else
3557 {
3564 /* Return src bounds with the result. */
3566 {
3570 }
3572 }
3573 }
3575 /* Helper function to do the actual work for expand of memory copy family
3576 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3577 of memory from SRC to DEST and assign to TARGET if convenient.
3578 If ENDP is 0 return the
3579 destination pointer, if ENDP is 1 return the end pointer ala
3580 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3581 stpcpy. */
3583 static rtx
3586 {
3597 /* If DEST is not a pointer type, call the normal function. */
3601 /* If either SRC is not a pointer type, don't do this
3602 operation in-line. */
3619 /* If SRC is a string constant and block move would be done
3620 by pieces, we can avoid loading the string from memory
3621 and only stored the computed constants. */
3628 {
3630 builtin_memcpy_read_str,
3636 }
3641 /* Copy word part most expediently. */
3650 {
3653 }
3656 {
3658 /* stpcpy pointer to last byte. */
3661 }
3664 }
3666 static rtx
3669 {
3671 endp);
3672 }
3674 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3675 we failed, the caller should emit a normal call, otherwise try to
3676 get the result in TARGET, if convenient. If ENDP is 0 return the
3677 destination pointer, if ENDP is 1 return the end pointer ala
3678 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3679 stpcpy. */
3681 static rtx
3683 {
3685 rtx dest_mem;
3686 rtx src_mem;
3694 {
3697 }
3706 {
3708 /* movstr is supposed to set end to the address of the NUL
3709 terminator. If the caller requested a mempcpy-like return value,
3710 adjust it. */
3712 {
3716 }
3717 }
3719 }
3721 /* Do some very basic size validation of a call to the strcpy builtin
3722 given by EXP. Return NULL_RTX to have the built-in expand to a call
3723 to the library function. */
3725 static rtx
3727 {
3735 /* There is no way here to determine the length of the string in
3736 the destination to which the SRC string is being appended so
3737 just diagnose cases when the souce string is longer than
3738 the destination object. */
3743 destsize);
3746 }
3748 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3749 NULL_RTX if we failed the caller should emit a normal call, otherwise
3750 try to get the result in TARGET, if convenient (and in mode MODE if that's
3751 convenient). */
3753 static rtx
3755 {
3763 {
3767 }
3770 }
3772 /* Helper function to do the actual work for expand_builtin_strcpy. The
3773 arguments to the builtin_strcpy call DEST and SRC are broken out
3774 so that this can also be called without constructing an actual CALL_EXPR.
3775 The other arguments and return value are the same as for
3776 expand_builtin_strcpy. */
3778 static rtx
3780 {
3782 }
3784 /* Expand a call EXP to the stpcpy builtin.
3785 Return NULL_RTX if we failed the caller should emit a normal call,
3786 otherwise try to get the result in TARGET, if convenient (and in
3787 mode MODE if that's convenient). */
3789 static rtx
3791 {
3802 {
3806 }
3808 /* If return value is ignored, transform stpcpy into strcpy. */
3810 {
3814 }
3815 else
3816 {
3818 rtx ret;
3820 /* Ensure we get an actual string whose length can be evaluated at
3821 compile-time, not an expression containing a string. This is
3822 because the latter will potentially produce pessimized code
3823 when used to produce the return value. */
3835 {
3839 {
3843 {
3845 {
3848 else
3850 }
3859 }
3860 }
3861 }
3864 }
3865 }
3867 /* Check a call EXP to the stpncpy built-in for validity.
3868 Return NULL_RTX on both success and failure. */
3870 static rtx
3872 {
3878 /* The source and destination of the call. */
3882 /* The exact number of bytes to write (not the maximum). */
3885 /* The size of the destination object. */
3891 }
3893 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3894 bytes from constant string DATA + OFFSET and return it as target
3895 constant. */
3897 rtx
3899 scalar_int_mode mode)
3900 {
3907 }
3909 /* Helper to check the sizes of sequences and the destination of calls
3910 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3911 success (no overflow or invalid sizes), false otherwise. */
3913 static bool
3915 {
3920 /* Try to determine the range of lengths that the source expression
3921 refers to. */
3925 /* Try to verify that the destination is big enough for the shortest
3926 string. */
3929 {
3930 /* If it hasn't been provided by __strncat_chk, try to determine
3931 the size of the destination object into which the source is
3932 being copied. */
3934 }
3936 /* Add one for the terminating nul. */
3939 size_one_node)
3942 /* The strncat function copies at most MAXREAD bytes and always appends
3943 the terminating nul so the specified upper bound should never be equal
3944 to (or greater than) the size of the destination. */
3947 {
3956 }
3964 /* The number of bytes to write is LEN but check_access will also
3965 check SRCLEN if LEN's value isn't known. */
3967 objsize);
3968 }
3970 /* Similar to expand_builtin_strcat, do some very basic size validation
3971 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3972 the built-in expand to a call to the library function. */
3974 static rtx
3976 {
3984 /* The upper bound on the number of bytes to write. */
3986 /* The length of the source sequence. */
3989 /* Try to determine the range of lengths that the source expression
3990 refers to. */
3994 else
3997 /* Try to verify that the destination is big enough for the shortest
3998 string. First try to determine the size of the destination object
3999 into which the source is being copied. */
4002 /* Add one for the terminating nul. */
4005 size_one_node)
4008 /* The strncat function copies at most MAXREAD bytes and always appends
4009 the terminating nul so the specified upper bound should never be equal
4010 to (or greater than) the size of the destination. */
4013 {
4022 }
4030 /* The number of bytes to write is SRCLEN. */
4034 }
4036 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4037 NULL_RTX if we failed the caller should emit a normal call. */
4039 static rtx
4041 {
4046 {
4049 /* The number of bytes to write (not the maximum). */
4051 /* The length of the source sequence. */
4055 {
4059 /* The number of bytes to write is LEN but check_access will also
4060 check SLEN if LEN's value isn't known. */
4062 destsize);
4063 }
4065 /* We must be passed a constant len and src parameter. */
4071 /* We're required to pad with trailing zeros if the requested
4072 len is greater than strlen(s2)+1. In that case try to
4073 use store_by_pieces, if it fails, punt. */
4075 {
4078 rtx dest_mem;
4082 builtin_strncpy_read_str,
4089 builtin_strncpy_read_str,
4094 }
4095 }
4097 }
4099 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4100 bytes from constant string DATA + OFFSET and return it as target
4101 constant. */
4103 rtx
4105 scalar_int_mode mode)
4106 {
4113 }
4115 /* Callback routine for store_by_pieces. Return the RTL of a register
4116 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4117 char value given in the RTL register data. For example, if mode is
4118 4 bytes wide, return the RTL for 0x01010101*data. */
4120 static rtx
4122 scalar_int_mode mode)
4123 {
4139 }
4141 /* Expand expression EXP, which is a call to the memset builtin. Return
4142 NULL_RTX if we failed the caller should emit a normal call, otherwise
4143 try to get the result in TARGET, if convenient (and in mode MODE if that's
4144 convenient). */
4146 static rtx
4148 {
4160 }
4162 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4163 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4164 try to get the result in TARGET, if convenient (and in mode MODE if that's
4165 convenient). */
4167 static rtx
4169 {
4174 else
4175 {
4181 /* Return src bounds with the result. */
4183 {
4187 }
4189 }
4190 }
4192 /* Helper function to do the actual work for expand_builtin_memset. The
4193 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4194 so that this can also be called without constructing an actual CALL_EXPR.
4195 The other arguments and return value are the same as for
4196 expand_builtin_memset. */
4198 static rtx
4201 {
4204 machine_mode val_mode;
4216 /* If DEST is not a pointer type, don't do this operation in-line. */
4227 /* If the LEN parameter is zero, return DEST. */
4229 {
4230 /* Evaluate and ignore VAL in case it has side-effects. */
4233 }
4235 /* Stabilize the arguments in case we fail. */
4247 {
4248 rtx val_rtx;
4253 /* Assume that we can memset by pieces if we can store
4254 * the coefficients by pieces (in the required modes).
4255 * We can't pass builtin_memset_gen_str as that emits RTL. */
4261 {
4266 }
4270 probable_max_size))
4276 }
4282 {
4293 probable_max_size))
4299 }
4307 probable_max_size);
4310 {
4313 }
4317 do_libcall:
4327 else
4332 }
4334 /* Expand expression EXP, which is a call to the bzero builtin. Return
4335 NULL_RTX if we failed the caller should emit a normal call. */
4337 static rtx
4339 {
4348 /* New argument list transforming bzero(ptr x, int y) to
4349 memset(ptr x, int 0, size_t y). This is done this way
4350 so that if it isn't expanded inline, we fallback to
4351 calling bzero instead of memset. */
4359 }
4361 /* Try to expand cmpstr operation ICODE with the given operands.
4362 Return the result rtx on success, otherwise return null. */
4364 static rtx
4366 HOST_WIDE_INT align)
4367 {
4381 }
4383 /* Expand expression EXP, which is a call to the memcmp built-in function.
4384 Return NULL_RTX if we failed and the caller should emit a normal call,
4385 otherwise try to get the result in TARGET, if convenient.
4386 RESULT_EQ is true if we can relax the returned value to be either zero
4387 or nonzero, without caring about the sign. */
4389 static rtx
4391 {
4400 /* Diagnose calls where the specified length exceeds the size of either
4401 object. */
4403 {
4407 {
4411 }
4412 }
4420 /* If we don't have POINTER_TYPE, call the function. */
4428 /* Set MEM_SIZE as appropriate. */
4430 {
4433 }
4439 {
4443 }
4445 /* If SRC is a string constant and block move would be done
4446 by pieces, we can avoid loading the string from memory
4447 and only stored the computed constants. */
4459 {
4460 /* Return the value in the proper mode for this function. */
4465 {
4468 }
4471 }
4474 }
4476 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4477 if we failed the caller should emit a normal call, otherwise try to get
4478 the result in TARGET, if convenient. */
4480 static rtx
4482 {
4497 /* If we don't have POINTER_TYPE, call the function. */
4501 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4509 /* Try to call cmpstrsi. */
4514 /* Try to determine at least one length and call cmpstrnsi. */
4516 {
4517 tree len;
4518 rtx arg3_rtx;
4528 /* If we don't have a constant length for the first, use the length
4529 of the second, if we know it. We don't require a constant for
4530 this case; some cost analysis could be done if both are available
4531 but neither is constant. For now, assume they're equally cheap,
4532 unless one has side effects. If both strings have constant lengths,
4533 use the smaller. */
4549 else
4552 /* If both arguments have side effects, we cannot optimize. */
4554 {
4556 result = expand_cmpstrn_or_cmpmem
4559 }
4560 }
4562 /* Check to see if the argument was declared attribute nonstring
4563 and if so, issue a warning since at this point it's not known
4564 to be nul-terminated. */
4569 {
4570 /* Return the value in the proper mode for this function. */
4578 }
4580 /* Expand the library call ourselves using a stabilized argument
4581 list to avoid re-evaluating the function's arguments twice. */
4586 }
4588 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4589 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4590 the result in TARGET, if convenient. */
4592 static rtx
4594 ATTRIBUTE_UNUSED machine_mode mode)
4595 {
4600 /* If c_strlen can determine an expression for one of the string
4601 lengths, and it doesn't have side effects, then emit cmpstrnsi
4602 using length MIN(strlen(string)+1, arg3). */
4607 tree len;
4628 /* If we don't have a constant length for the first, use the length
4629 of the second, if we know it. If neither string is constant length,
4630 use the given length argument. We don't require a constant for
4631 this case; some cost analysis could be done if both are available
4632 but neither is constant. For now, assume they're equally cheap,
4633 unless one has side effects. If both strings have constant lengths,
4634 use the smaller. */
4652 else
4655 /* If we are not using the given length, we must incorporate it here.
4656 The actual new length parameter will be MIN(len,arg3) in this case. */
4666 /* Check to see if the argument was declared attribute nonstring
4667 and if so, issue a warning since at this point it's not known
4668 to be nul-terminated. */
4673 {
4674 /* Return the value in the proper mode for this function. */
4682 }
4684 /* Expand the library call ourselves using a stabilized argument
4685 list to avoid re-evaluating the function's arguments twice. */
4690 }
4692 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4693 if that's convenient. */
4695 rtx
4697 {
4698 rtx val;
4701 /* Don't do __builtin_saveregs more than once in a function.
4702 Save the result of the first call and reuse it. */
4706 /* When this function is called, it means that registers must be
4707 saved on entry to this function. So we migrate the call to the
4708 first insn of this function. */
4712 /* Do whatever the machine needs done in this case. */
4720 /* Put the insns after the NOTE that starts the function. If this
4721 is inside a start_sequence, make the outer-level insn chain current, so
4722 the code is placed at the start of the function. */
4728 }
4730 /* Expand a call to __builtin_next_arg. */
4732 static rtx
4734 {
4735 /* Checking arguments is already done in fold_builtin_next_arg
4736 that must be called before this function. */
4741 }
4743 /* Make it easier for the backends by protecting the valist argument
4744 from multiple evaluations. */
4746 static tree
4748 {
4751 /* The current way of determining the type of valist is completely
4752 bogus. We should have the information on the va builtin instead. */
4757 {
4761 /* For this case, the backends will be expecting a pointer to
4762 vatype, but it's possible we've actually been given an array
4763 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4764 So fix it. */
4766 {
4769 }
4770 }
4771 else
4772 {
4776 {
4782 }
4788 }
4791 }
4793 /* The "standard" definition of va_list is void*. */
4795 tree
4797 {
4799 }
4801 /* The "standard" abi va_list is va_list_type_node. */
4803 tree
4805 {
4807 }
4809 /* The "standard" type of va_list is va_list_type_node. */
4811 tree
4813 {
4820 {
4821 /* If va_list is an array type, the argument may have decayed
4822 to a pointer type, e.g. by being passed to another function.
4823 In that case, unwrap both types so that we can compare the
4824 underlying records. */
4827 {
4830 }
4831 }
4836 }
4838 /* The "standard" implementation of va_start: just assign `nextarg' to
4839 the variable. */
4841 void
4843 {
4847 /* We do not have any valid bounds for the pointer, so
4848 just store zero bounds for it. */
4852 nextarg));
4853 }
4855 /* Expand EXP, a call to __builtin_va_start. */
4857 static rtx
4859 {
4860 rtx nextarg;
4861 tree valist;
4865 {
4868 }
4878 else
4882 }
4884 /* Expand EXP, a call to __builtin_va_end. */
4886 static rtx
4888 {
4891 /* Evaluate for side effects, if needed. I hate macros that don't
4892 do that. */
4897 }
4899 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4900 builtin rather than just as an assignment in stdarg.h because of the
4901 nastiness of array-type va_list types. */
4903 static rtx
4905 {
4918 {
4922 }
4923 else
4924 {
4927 /* Evaluate to pointers. */
4936 /* "Dereference" to BLKmode memories. */
4944 /* Copy. */
4946 }
4949 }
4951 /* Expand a call to one of the builtin functions __builtin_frame_address or
4952 __builtin_return_address. */
4954 static rtx
4956 {
4957 /* The argument must be a nonnegative integer constant.
4958 It counts the number of frames to scan up the stack.
4959 The value is either the frame pointer value or the return
4960 address saved in that frame. */
4962 /* Warning about missing arg was already issued. */
4965 {
4968 }
4969 else
4970 {
4971 /* Number of frames to scan up the stack. */
4976 /* Some ports cannot access arbitrary stack frames. */
4978 {
4981 }
4984 {
4985 /* Warn since no effort is made to ensure that any frame
4986 beyond the current one exists or can be safely reached. */
4989 }
4991 /* For __builtin_frame_address, return what we've got. */
4999 }
5000 }
5002 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5003 failed and the caller should emit a normal call. */
5005 static rtx
5007 {
5008 rtx op0;
5009 rtx result;
5012 HOST_WIDE_INT max_size;
5015 bool valid_arglist
5018 VOID_TYPE)
5028 {
5029 /* -Walloca-larger-than and -Wvla-larger-than settings override
5030 the more general -Walloc-size-larger-than so unless either of
5031 the former options is specified check the alloca arguments for
5032 overflow. */
5036 }
5038 /* Compute the argument. */
5041 /* Compute the alignment. */
5043 ? BIGGEST_ALIGNMENT
5046 /* Compute the maximum size. */
5051 /* Allocate the desired space. If the allocation stems from the declaration
5052 of a variable-sized object, it cannot accumulate. */
5053 result
5058 }
5060 /* Emit a call to __asan_allocas_unpoison call in EXP. Replace second argument
5061 of the call with virtual_stack_dynamic_rtx because in asan pass we emit a
5062 dummy value into second parameter relying on this function to perform the
5063 change. See motivation for this in comment to handle_builtin_stack_restore
5064 function. */
5066 static rtx
5068 {
5076 }
5078 /* Expand a call to bswap builtin in EXP.
5079 Return NULL_RTX if a normal call should be emitted rather than expanding the
5080 function in-line. If convenient, the result should be placed in TARGET.
5081 SUBTARGET may be used as the target for computing one of EXP's operands. */
5083 static rtx
5085 rtx subtarget)
5086 {
5087 tree arg;
5088 rtx op0;
5106 }
5108 /* Expand a call to a unary builtin in EXP.
5109 Return NULL_RTX if a normal call should be emitted rather than expanding the
5110 function in-line. If convenient, the result should be placed in TARGET.
5111 SUBTARGET may be used as the target for computing one of EXP's operands. */
5113 static rtx
5116 {
5117 rtx op0;
5122 /* Compute the argument. */
5124 (subtarget
5128 /* Compute op, into TARGET if possible.
5129 Set TARGET to wherever the result comes back. */
5135 }
5137 /* Expand a call to __builtin_expect. We just return our argument
5138 as the builtin_expect semantic should've been already executed by
5139 tree branch prediction pass. */
5141 static rtx
5143 {
5144 tree arg;
5151 /* When guessing was done, the hints should be already stripped away. */
5155 }
5157 /* Expand a call to __builtin_assume_aligned. We just return our first
5158 argument as the builtin_assume_aligned semantic should've been already
5159 executed by CCP. */
5161 static rtx
5163 {
5167 EXPAND_NORMAL);
5172 }
5174 void
5176 {
5178 {
5180 /* For trap insns when not accumulating outgoing args force
5181 REG_ARGS_SIZE note to prevent crossjumping of calls with
5182 different args sizes. */
5185 }
5186 else
5187 {
5191 }
5194 }
5196 /* Expand a call to __builtin_unreachable. We do nothing except emit
5197 a barrier saying that control flow will not pass here.
5199 It is the responsibility of the program being compiled to ensure
5200 that control flow does never reach __builtin_unreachable. */
5201 static void
5203 {
5205 }
5207 /* Expand EXP, a call to fabs, fabsf or fabsl.
5208 Return NULL_RTX if a normal call should be emitted rather than expanding
5209 the function inline. If convenient, the result should be placed
5210 in TARGET. SUBTARGET may be used as the target for computing
5211 the operand. */
5213 static rtx
5215 {
5216 machine_mode mode;
5217 tree arg;
5218 rtx op0;
5228 }
5230 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5231 Return NULL is a normal call should be emitted rather than expanding the
5232 function inline. If convenient, the result should be placed in TARGET.
5233 SUBTARGET may be used as the target for computing the operand. */
5235 static rtx
5237 {
5239 tree arg;
5251 }
5253 /* Expand a call to __builtin___clear_cache. */
5255 static rtx
5257 {
5259 {
5260 #ifdef CLEAR_INSN_CACHE
5261 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5262 does something. Just do the default expansion to a call to
5263 __clear_cache(). */
5265 #else
5266 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5267 does nothing. There is no need to call it. Do nothing. */
5270 }
5272 /* We have a "clear_cache" insn, and it will handle everything. */
5276 /* We must not expand to a library call. If we did, any
5277 fallback library function in libgcc that might contain a call to
5278 __builtin___clear_cache() would recurse infinitely. */
5280 {
5283 }
5286 {
5299 }
5301 }
5303 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5305 static rtx
5307 {
5310 /* If we don't need too much alignment, we'll have been guaranteed
5311 proper alignment by get_trampoline_type. */
5315 /* Round address up to desired boundary. */
5326 }
5328 static rtx
5330 {
5346 /* If ONSTACK, the TRAMP argument should be the address of a field
5347 within the local function's FRAME decl. Either way, let's see if
5348 we can fill in the MEM_ATTRs for this memory. */
5352 /* Creator of a heap trampoline is responsible for making sure the
5353 address is aligned to at least STACK_BOUNDARY. Normally malloc
5354 will ensure this anyhow. */
5357 {
5361 }
5363 /* The FUNC argument should be the address of the nested function.
5364 Extract the actual function decl to pass to the hook. */
5371 /* Generate insns to initialize the trampoline. */
5375 {
5381 }
5384 }
5386 static rtx
5388 {
5389 rtx tramp;
5400 }
5402 /* Expand a call to the builtin descriptor initialization routine.
5403 A descriptor is made up of a couple of pointers to the static
5404 chain and the code entry in this order. */
5406 static rtx
5408 {
5413 VOID_TYPE))
5427 /* Generate insns to initialize the descriptor. */
5433 }
5435 /* Expand a call to the builtin descriptor adjustment routine. */
5437 static rtx
5439 {
5440 rtx tramp;
5447 /* Unalign the descriptor to allow runtime identification. */
5452 }
5454 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5455 function. The function first checks whether the back end provides
5456 an insn to implement signbit for the respective mode. If not, it
5457 checks whether the floating point format of the value is such that
5458 the sign bit can be extracted. If that is not the case, error out.
5459 EXP is the expression that is a call to the builtin function; if
5460 convenient, the result should be placed in TARGET. */
5461 static rtx
5463 {
5465 scalar_float_mode fmode;
5467 tree arg;
5470 rtx temp;
5483 /* Expand the argument yielding a RTX expression. */
5486 /* Check if the back end provides an insn that handles signbit for the
5487 argument's mode. */
5490 {
5496 }
5498 /* For floating point formats without a sign bit, implement signbit
5499 as "ARG < 0.0". */
5502 {
5503 /* But we can't do this if the format supports signed zero. */
5509 }
5512 {
5515 }
5516 else
5517 {
5519 /* Handle targets with different FP word orders. */
5522 else
5526 }
5528 /* Force the intermediate word_mode (or narrower) result into a
5529 register. This avoids attempting to create paradoxical SUBREGs
5530 of floating point modes below. */
5533 /* If the bitpos is within the "result mode" lowpart, the operation
5534 can be implement with a single bitwise AND. Otherwise, we need
5535 a right shift and an AND. */
5538 {
5546 }
5547 else
5548 {
5549 /* Perform a logical right shift to place the signbit in the least
5550 significant bit, then truncate the result to the desired mode
5551 and mask just this bit. */
5556 }
5559 }
5561 /* Expand fork or exec calls. TARGET is the desired target of the
5562 call. EXP is the call. FN is the
5563 identificator of the actual function. IGNORE is nonzero if the
5564 value is to be ignored. */
5566 static rtx
5568 {
5570 tree call;
5572 /* If we are not profiling, just call the function. */
5576 /* Otherwise call the wrapper. This should be equivalent for the rest of
5577 compiler, so the code does not diverge, and the wrapper may run the
5578 code necessary for keeping the profiling sane. */
5581 {
5612 }
5624 }
5627 \f
5628 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5629 the pointer in these functions is void*, the tree optimizers may remove
5630 casts. The mode computed in expand_builtin isn't reliable either, due
5631 to __sync_bool_compare_and_swap.
5633 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5634 group of builtins. This gives us log2 of the mode size. */
5638 {
5639 /* The size is not negotiable, so ask not to get BLKmode in return
5640 if the target indicates that a smaller size would be better. */
5642 }
5644 /* Expand the memory expression LOC and return the appropriate memory operand
5645 for the builtin_sync operations. */
5647 static rtx
5649 {
5655 /* Note that we explicitly do not want any alias information for this
5656 memory, so that we kill all other live memories. Otherwise we don't
5657 satisfy the full barrier semantics of the intrinsic. */
5660 /* The alignment needs to be at least according to that of the mode. */
5667 }
5669 /* Make sure an argument is in the right mode.
5670 EXP is the tree argument.
5671 MODE is the mode it should be in. */
5673 static rtx
5675 {
5676 rtx val;
5677 machine_mode old_mode;
5680 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5681 of CONST_INTs, where we know the old_mode only from the call argument. */
5688 }
5691 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5692 EXP is the CALL_EXPR. CODE is the rtx code
5693 that corresponds to the arithmetic or logical operation from the name;
5694 an exception here is that NOT actually means NAND. TARGET is an optional
5695 place for us to store the results; AFTER is true if this is the
5696 fetch_and_xxx form. */
5698 static rtx
5701 rtx target)
5702 {
5707 {
5714 {
5743 }
5744 }
5746 /* Expand the operands. */
5751 after);
5752 }
5754 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5755 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5756 true if this is the boolean form. TARGET is a place for us to store the
5757 results; this is NOT optional if IS_BOOL is true. */
5759 static rtx
5762 {
5766 /* Expand the operands. */
5773 {
5776 else
5778 }
5781 MEMMODEL_SYNC_SEQ_CST))
5785 }
5787 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5788 general form is actually an atomic exchange, and some targets only
5789 support a reduced form with the second argument being a constant 1.
5790 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5791 the results. */
5793 static rtx
5795 rtx target)
5796 {
5799 /* Expand the operands. */
5804 }
5806 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5808 static void
5810 {
5811 rtx mem;
5813 /* Expand the operands. */
5817 }
5819 /* Given an integer representing an ``enum memmodel'', verify its
5820 correctness and return the memory model enum. */
5822 static enum memmodel
5824 {
5825 rtx op;
5827 source_location loc
5830 /* If the parameter is not a constant, it's a run time value so we'll just
5831 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5841 {
5845 }
5847 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5849 {
5853 }
5855 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5856 be conservative and promote consume to acquire. */
5861 }
5863 /* Expand the __atomic_exchange intrinsic:
5864 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5865 EXP is the CALL_EXPR.
5866 TARGET is an optional place for us to store the results. */
5868 static rtx
5870 {
5879 /* Expand the operands. */
5884 }
5886 /* Expand the __atomic_compare_exchange intrinsic:
5887 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5888 TYPE desired, BOOL weak,
5889 enum memmodel success,
5890 enum memmodel failure)
5891 EXP is the CALL_EXPR.
5892 TARGET is an optional place for us to store the results. */
5894 static rtx
5896 rtx target)
5897 {
5901 tree weak;
5903 source_location loc
5910 {
5912 "failure memory model cannot be stronger than success "
5915 }
5918 {
5920 "invalid failure memory model for "
5924 }
5930 /* Expand the operands. */
5946 /* Lest the rtl backend create a race condition with an imporoper store
5947 to memory, always create a new pseudo for OLDVAL. */
5954 /* Conditionally store back to EXPECT, lest we create a race condition
5955 with an improper store to memory. */
5956 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5957 the normal case where EXPECT is totally private, i.e. a register. At
5958 which point the store can be unconditional. */
5966 }
5968 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5969 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5970 call. The weak parameter must be dropped to match the expected parameter
5971 list and the expected argument changed from value to pointer to memory
5972 slot. */
5974 static void
5976 {
5992 /* Skip the boolean weak parameter. */
5995 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
5998 built_in_function fncode
6003 fndecl);
6008 {
6015 }
6016 }
6018 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6020 void
6022 {
6028 tree lhs;
6030 source_location loc
6037 {
6039 "failure memory model cannot be stronger than success "
6042 }
6045 {
6047 "invalid failure memory model for "
6051 }
6054 {
6057 }
6059 /* Expand the operands. */
6072 {
6075 }
6079 {
6085 }
6086 }
6088 /* Expand the __atomic_load intrinsic:
6089 TYPE __atomic_load (TYPE *object, enum memmodel)
6090 EXP is the CALL_EXPR.
6091 TARGET is an optional place for us to store the results. */
6093 static rtx
6095 {
6096 rtx mem;
6101 {
6102 source_location loc
6107 }
6112 /* Expand the operand. */
6116 }
6119 /* Expand the __atomic_store intrinsic:
6120 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6121 EXP is the CALL_EXPR.
6122 TARGET is an optional place for us to store the results. */
6124 static rtx
6126 {
6133 {
6134 source_location loc
6139 }
6144 /* Expand the operands. */
6149 }
6151 /* Expand the __atomic_fetch_XXX intrinsic:
6152 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6153 EXP is the CALL_EXPR.
6154 TARGET is an optional place for us to store the results.
6155 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6156 FETCH_AFTER is true if returning the result of the operation.
6157 FETCH_AFTER is false if returning the value before the operation.
6158 IGNORE is true if the result is not used.
6159 EXT_CALL is the correct builtin for an external call if this cannot be
6160 resolved to an instruction sequence. */
6162 static rtx
6166 {
6169 tree fndecl;
6170 tree addr;
6174 /* Expand the operands. */
6178 /* Only try generating instructions if inlining is turned on. */
6180 {
6184 }
6186 /* Return if a different routine isn't needed for the library call. */
6190 /* Change the call to the specified function. */
6198 /* If we will emit code after the call, the call can not be a tail call.
6199 If it is emitted as a tail call, a barrier is emitted after it, and
6200 then all trailing code is removed. */
6204 /* Expand the call here so we can emit trailing code. */
6207 /* Replace the original function just in case it matters. */
6210 /* Then issue the arithmetic correction to return the right result. */
6212 {
6214 {
6216 OPTAB_LIB_WIDEN);
6218 }
6219 else
6221 OPTAB_LIB_WIDEN);
6222 }
6224 }
6226 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6228 void
6230 {
6238 optab optab;
6250 {
6265 }
6268 {
6275 }
6297 {
6302 }
6303 else
6305 OPTAB_DIRECT);
6308 }
6310 /* Expand an atomic clear operation.
6311 void _atomic_clear (BOOL *obj, enum memmodel)
6312 EXP is the call expression. */
6314 static rtx
6316 {
6317 machine_mode mode;
6326 {
6327 source_location loc
6332 }
6334 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6335 Failing that, a store is issued by __atomic_store. The only way this can
6336 fail is if the bool type is larger than a word size. Unlikely, but
6337 handle it anyway for completeness. Assume a single threaded model since
6338 there is no atomic support in this case, and no barriers are required. */
6343 }
6345 /* Expand an atomic test_and_set operation.
6346 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6347 EXP is the call expression. */
6349 static rtx
6351 {
6352 rtx mem;
6354 machine_mode mode;
6361 }
6364 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6365 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6367 static tree
6369 {
6371 machine_mode mode;
6377 /* We need a corresponding integer mode for the access to be lock-free. */
6385 {
6388 /* Either this argument is null, or it's a fake pointer encoding
6389 the alignment of the object. */
6395 else
6397 }
6398 else
6399 {
6402 /* This function is usually invoked and folded immediately by the front
6403 end before anything else has a chance to look at it. The pointer
6404 parameter at this point is usually cast to a void *, so check for that
6405 and look past the cast. */
6415 /* Get the underlying type of the object. */
6418 }
6420 /* If the object has smaller alignment, the lock free routines cannot
6421 be used. */
6425 /* Check if a compare_and_swap pattern exists for the mode which represents
6426 the required size. The pattern is not allowed to fail, so the existence
6427 of the pattern indicates support is present. Also require that an
6428 atomic load exists for the required size. */
6431 else
6433 }
6435 /* Return true if the parameters to call EXP represent an object which will
6436 always generate lock free instructions. The first argument represents the
6437 size of the object, and the second parameter is a pointer to the object
6438 itself. If NULL is passed for the object, then the result is based on
6439 typical alignment for an object of the specified size. Otherwise return
6440 false. */
6442 static rtx
6444 {
6445 tree size;
6450 {
6453 }
6459 }
6461 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6462 is lock free on this architecture. */
6464 static tree
6466 {
6470 /* If it isn't always lock free, don't generate a result. */
6475 }
6477 /* Return true if the parameters to call EXP represent an object which will
6478 always generate lock free instructions. The first argument represents the
6479 size of the object, and the second parameter is a pointer to the object
6480 itself. If NULL is passed for the object, then the result is based on
6481 typical alignment for an object of the specified size. Otherwise return
6482 NULL*/
6484 static rtx
6486 {
6487 tree size;
6492 {
6495 }
6500 /* If the value is known at compile time, return the RTX for it. */
6506 }
6508 /* Expand the __atomic_thread_fence intrinsic:
6509 void __atomic_thread_fence (enum memmodel)
6510 EXP is the CALL_EXPR. */
6512 static void
6514 {
6517 }
6519 /* Expand the __atomic_signal_fence intrinsic:
6520 void __atomic_signal_fence (enum memmodel)
6521 EXP is the CALL_EXPR. */
6523 static void
6525 {
6528 }
6530 /* Expand the __sync_synchronize intrinsic. */
6532 static void
6534 {
6536 }
6538 static rtx
6540 {
6546 {
6548 /* If the target is not sutitable then create a new target. */
6556 }
6559 }
6561 static void
6563 {
6569 {
6576 }
6578 }
6580 \f
6581 /* Emit code to restore the current value of stack. */
6583 static void
6585 {
6597 }
6599 /* Emit code to save the current value of stack. */
6601 static rtx
6603 {
6608 }
6611 /* Expand an expression EXP that calls a built-in function,
6612 with result going to TARGET if that's convenient
6613 (and in mode MODE if that's convenient).
6614 SUBTARGET may be used as the target for computing one of EXP's operands.
6615 IGNORE is nonzero if the value is to be ignored. */
6617 rtx
6620 {
6629 /* When ASan is enabled, we don't want to expand some memory/string
6630 builtins and rely on libsanitizer's hooks. This allows us to avoid
6631 redundant checks and be sure, that possible overflow will be detected
6632 by ASan. */
6637 /* When not optimizing, generate calls to library functions for a certain
6638 set of builtins. */
6664 /* The built-in function expanders test for target == const0_rtx
6665 to determine whether the function's result will be ignored. */
6669 /* If the result of a pure or const built-in function is ignored, and
6670 none of its arguments are volatile, we can avoid expanding the
6671 built-in call and just evaluate the arguments for side-effects. */
6675 {
6677 tree arg;
6678 call_expr_arg_iterator iter;
6682 {
6685 }
6688 {
6692 }
6693 }
6695 /* expand_builtin_with_bounds is supposed to be used for
6696 instrumented builtin calls. */
6700 {
6718 /* Just do a normal library call if we were unable to fold
6719 the values. */
6796 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6797 FUNCTION with a copy of the parameters described by
6798 ARGUMENTS, and ARGSIZE. It returns a block of memory
6799 allocated on the stack into which is stored all the registers
6800 that might possibly be used for returning the result of a
6801 function. ARGUMENTS is the value returned by
6802 __builtin_apply_args. ARGSIZE is the number of bytes of
6803 arguments that must be copied. ??? How should this value be
6804 computed? We'll also need a safe worst case value for varargs
6805 functions. */
6812 else
6813 {
6821 }
6823 /* __builtin_return (RESULT) causes the function to return the
6824 value described by RESULT. RESULT is address of the block of
6825 memory returned by __builtin_apply. */
6835 /* All valid uses of __builtin_va_arg_pack () are removed during
6836 inlining. */
6841 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6842 inlining. */
6846 /* Return the address of the first anonymous stack arg. */
6868 /* Returns the address of the area where the structure is returned.
6869 0 otherwise. */
6875 else
6878 CASE_BUILT_IN_ALLOCA:
7041 {
7044 }
7048 /* This should have been lowered to the builtins below. */
7052 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7053 and the receiver label. */
7055 {
7061 /* This is copied from the handling of non-local gotos. */
7063 nonlocal_goto_handler_labels
7065 nonlocal_goto_handler_labels);
7066 /* ??? Do not let expand_label treat us as such since we would
7067 not want to be both on the list of non-local labels and on
7068 the list of forced labels. */
7071 }
7075 /* __builtin_setjmp_receiver is passed the receiver label. */
7077 {
7083 }
7086 /* __builtin_longjmp is passed a pointer to an array of five words.
7087 It's similar to the C library longjmp function but works with
7088 __builtin_setjmp above. */
7091 {
7097 {
7100 }
7104 }
7113 /* This updates the setjmp buffer that is its argument with the value
7114 of the current stack pointer. */
7117 {
7118 rtx buf_addr
7123 }
7143 /* Various hooks for the DWARF 2 __throw routine. */
7149 #ifdef DWARF2_UNWIND_INFO
7155 #endif
7355 mode = get_builtin_sync_mode
7367 mode = get_builtin_sync_mode
7414 {
7418 mode =
7424 /* If this is turned into an external library call, the weak parameter
7425 must be dropped to match the expected parameter list. */
7430 /* Skip the boolean weak parameter. */
7435 }
7464 {
7474 }
7480 {
7490 }
7496 {
7506 }
7512 {
7522 }
7528 {
7538 }
7544 {
7554 }
7701 /* We allow user CHKP builtins if Pointer Bounds
7702 Checker is off. */
7704 {
7715 else
7717 }
7718 /* FALLTHROUGH */
7730 /* Software implementation of Pointer Bounds Checker is NYI.
7731 Target support is required. */
7736 /* Do library call, if we failed to expand the builtin when
7737 folding. */
7742 }
7744 /* The switch statement above can drop through to cause the function
7745 to be called normally. */
7747 }
7749 /* Similar to expand_builtin but is used for instrumented calls. */
7751 rtx
7753 rtx subtarget ATTRIBUTE_UNUSED,
7755 {
7768 {
7791 {
7792 /* memcpy_chkp (void *dst, size_t dstbnd,
7793 const void *src, size_t srcbnd, size_t n)
7794 and others take a pointer bound argument just after each
7795 pointer argument. */
7802 }
7806 }
7808 /* The switch statement above can drop through to cause the function
7809 to be called normally. */
7811 }
7813 /* Determine whether a tree node represents a call to a built-in
7814 function. If the tree T is a call to a built-in function with
7815 the right number of arguments of the appropriate types, return
7816 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7817 Otherwise the return value is END_BUILTINS. */
7819 enum built_in_function
7821 {
7824 const_call_expr_arg_iterator iter;
7840 {
7841 /* If a function doesn't take a variable number of arguments,
7842 the last element in the list will have type `void'. */
7845 {
7849 }
7858 {
7861 }
7863 {
7866 }
7868 {
7871 }
7873 {
7876 }
7877 else
7879 }
7881 /* Variable-length argument list. */
7883 }
7885 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7886 evaluate to a constant. */
7888 static tree
7890 {
7891 /* We return 1 for a numeric type that's known to be a constant
7892 value at compile-time or for an aggregate type that's a
7893 literal constant. */
7896 /* If we know this is a constant, emit the constant of one. */
7902 {
7909 }
7911 /* If this expression has side effects, show we don't know it to be a
7912 constant. Likewise if it's a pointer or aggregate type since in
7913 those case we only want literals, since those are only optimized
7914 when generating RTL, not later.
7915 And finally, if we are compiling an initializer, not code, we
7916 need to return a definite result now; there's not going to be any
7917 more optimization done. */
7922 || folding_initializer
7927 }
7929 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7930 return it as a truthvalue. */
7932 static tree
7934 tree predictor)
7935 {
7947 predictor);
7951 }
7953 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7954 NULL_TREE if no simplification is possible. */
7956 tree
7958 {
7962 /* Distribute the expected value over short-circuiting operators.
7963 See through the cast from truthvalue_type_node to long. */
7970 /* If this is a builtin_expect within a builtin_expect keep the
7971 inner one. See through a comparison against a constant. It
7972 might have been added to create a thruthvalue. */
7988 {
7997 }
7999 /* If the argument isn't invariant then there's nothing else we can do. */
8003 /* If we expect that a comparison against the argument will fold to
8004 a constant return the constant. In practice, this means a true
8005 constant or the address of a non-weak symbol. */
8009 {
8010 do
8011 {
8013 }
8018 }
8020 /* Otherwise, ARG0 already has the proper type for the return value. */
8022 }
8024 /* Fold a call to __builtin_classify_type with argument ARG. */
8026 static tree
8028 {
8033 }
8035 /* Fold a call to __builtin_strlen with argument ARG. */
8037 static tree
8039 {
8042 else
8043 {
8050 }
8051 }
8053 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8055 static tree
8057 {
8058 REAL_VALUE_TYPE real;
8060 /* __builtin_inff is intended to be usable to define INFINITY on all
8061 targets. If an infinity is not available, INFINITY expands "to a
8062 positive constant of type float that overflows at translation
8063 time", footnote "In this case, using INFINITY will violate the
8064 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8065 Thus we pedwarn to ensure this constraint violation is
8066 diagnosed. */
8072 }
8074 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8075 NULL_TREE if no simplification can be made. */
8077 static tree
8080 {
8081 tree type;
8091 /* Calculate the result when the argument is a constant. */
8096 /* Canonicalize sincos to cexpi. */
8098 {
8101 }
8103 {
8110 }
8119 }
8121 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8122 Return NULL_TREE if no simplification can be made. */
8124 static tree
8126 {
8132 /* If the LEN parameter is zero, return zero. */
8137 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8141 /* If len parameter is one, return an expression corresponding to
8142 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8144 {
8146 tree cst_uchar_ptr_node
8149 tree ind1
8153 cst_uchar_ptr_node,
8154 arg1)));
8155 tree ind2
8159 cst_uchar_ptr_node,
8160 arg2)));
8162 }
8165 }
8167 /* Fold a call to builtin isascii with argument ARG. */
8169 static tree
8171 {
8174 else
8175 {
8176 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8182 }
8183 }
8185 /* Fold a call to builtin toascii with argument ARG. */
8187 static tree
8189 {
8193 /* Transform toascii(c) -> (c & 0x7f). */
8196 }
8198 /* Fold a call to builtin isdigit with argument ARG. */
8200 static tree
8202 {
8205 else
8206 {
8207 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8208 /* According to the C standard, isdigit is unaffected by locale.
8209 However, it definitely is affected by the target character set. */
8210 unsigned HOST_WIDE_INT target_digit0
8221 }
8222 }
8224 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8226 static tree
8228 {
8234 }
8236 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8238 static tree
8240 {
8246 }
8248 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
8250 static tree
8252 {
8253 /* ??? Only expand to FMA_EXPR if it's directly supported. */
8261 }
8263 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8265 static tree
8267 {
8270 {
8274 {
8279 }
8280 }
8283 }
8285 /* Fold a call to builtin frexp, we can assume the base is 2. */
8287 static tree
8289 {
8300 /* Proceed if a valid pointer type was passed in. */
8302 {
8307 {
8309 /* For +-0, return (*exp = 0, +-0). */
8315 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8318 {
8319 /* Since the frexp function always expects base 2, and in
8320 GCC normalized significands are already in the range
8321 [0.5, 1.0), we have exactly what frexp wants. */
8326 }
8330 }
8332 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8336 }
8339 }
8341 /* Fold a call to builtin modf. */
8343 static tree
8345 {
8356 /* Proceed if a valid pointer type was passed in. */
8358 {
8363 {
8366 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8370 /* For +-Inf, return (*arg1 = arg0, +-0). */
8376 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8379 /* If the original number was negative and already
8380 integral, then the fractional part is -0.0. */
8384 }
8386 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8392 }
8395 }
8397 /* Given a location LOC, an interclass builtin function decl FNDECL
8398 and its single argument ARG, return an folded expression computing
8399 the same, or NULL_TREE if we either couldn't or didn't want to fold
8400 (the latter happen if there's an RTL instruction available). */
8402 static tree
8404 {
8405 machine_mode mode;
8417 /* If there is no optab, try generic code. */
8419 {
8420 tree result;
8423 {
8424 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8427 REAL_VALUE_TYPE r;
8431 {
8432 /* NaN and Inf are encoded in the high-order double value
8433 only. The low-order value is not significant. */
8437 }
8444 }
8447 {
8448 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8451 REAL_VALUE_TYPE r;
8455 {
8456 /* NaN and Inf are encoded in the high-order double value
8457 only. The low-order value is not significant. */
8461 }
8467 /*result = fold_build2_loc (loc, UNGT_EXPR,
8468 TREE_TYPE (TREE_TYPE (fndecl)),
8469 fold_build1_loc (loc, ABS_EXPR, type, arg),
8470 build_real (type, r));
8471 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8472 TREE_TYPE (TREE_TYPE (fndecl)),
8473 result);*/
8475 }
8477 {
8478 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8479 islessequal(fabs(x),DBL_MAX). */
8489 {
8490 /* Use double to test the normal range of IBM extended
8491 precision. Emin for IBM extended precision is
8492 different to emin for IEEE double, being 53 higher
8493 since the low double exponent is at least 53 lower
8494 than the high double exponent. */
8498 }
8510 {
8511 /* Testing the high end of the range is done just using
8512 the high double, using the same test as isfinite().
8513 For the subnormal end of the range we first test the
8514 high double, then if its magnitude is equal to the
8515 limit of 0x1p-969, we test whether the low double is
8516 non-zero and opposite sign to the high double. */
8532 integer_type_node,
8538 }
8539 else
8540 {
8541 tree const isge_fn
8544 }
8548 }
8551 }
8554 }
8556 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8557 ARG is the argument for the call. */
8559 static tree
8561 {
8568 {
8576 {
8577 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8578 /* In a boolean context, GCC will fold the inner COND_EXPR to
8579 1. So e.g. "if (isinf_sign(x))" would be folded to just
8580 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8588 {
8601 integer_zero_node);
8602 }
8605 }
8618 {
8621 {
8622 /* NaN and Inf are encoded in the high-order double value
8623 only. The low-order value is not significant. */
8625 }
8626 }
8632 }
8633 }
8635 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8636 This builtin will generate code to return the appropriate floating
8637 point classification depending on the value of the floating point
8638 number passed in. The possible return values must be supplied as
8639 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8640 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8641 one floating point argument which is "type generic". */
8643 static tree
8645 {
8648 machine_mode mode;
8649 REAL_VALUE_TYPE r;
8652 /* Verify the required arguments in the original call. */
8672 /* fpclassify(x) ->
8673 isnan(x) ? FP_NAN :
8674 (fabs(x) == Inf ? FP_INFINITE :
8675 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8676 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8690 {
8696 }
8699 {
8702 }
8705 }
8707 /* Fold a call to an unordered comparison function such as
8708 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8709 being called and ARG0 and ARG1 are the arguments for the call.
8710 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8711 the opposite of the desired result. UNORDERED_CODE is used
8712 for modes that can hold NaNs and ORDERED_CODE is used for
8713 the rest. */
8715 static tree
8719 {
8733 /* Choose the wider of two real types. */
8745 {
8749 }
8754 }
8756 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8757 arithmetics if it can never overflow, or into internal functions that
8758 return both result of arithmetics and overflowed boolean flag in
8759 a complex integer result, or some other check for overflow.
8760 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8761 checking part of that. */
8763 static tree
8766 {
8768 /* The code of the expression corresponding to the type-generic
8769 built-in, or ERROR_MARK for the type-specific ones. */
8774 {
8777 /* FALLTHRU */
8780 /* FALLTHRU */
8791 /* FALLTHRU */
8794 /* FALLTHRU */
8805 /* FALLTHRU */
8808 /* FALLTHRU */
8819 }
8821 /* For the "generic" overloads, the first two arguments can have different
8822 types and the last argument determines the target type to use to check
8823 for overflow. The arguments of the other overloads all have the same
8824 type. */
8827 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8828 arguments are constant, attempt to fold the built-in call into a constant
8829 expression indicating whether or not it detected an overflow. */
8833 /* Perform the computation in the target type and check for overflow. */
8837 arg2);
8851 tree store
8854 }
8856 /* Fold a call to __builtin_FILE to a constant string. */
8860 {
8865 }
8867 /* Fold a call to __builtin_FUNCTION to a constant string. */
8871 {
8878 }
8880 /* Fold a call to __builtin_LINE to an integer constant. */
8884 {
8886 }
8888 /* Fold a call to built-in function FNDECL with 0 arguments.
8889 This function returns NULL_TREE if no simplification was possible. */
8891 static tree
8893 {
8897 {
8923 }
8925 }
8927 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8928 This function returns NULL_TREE if no simplification was possible. */
8930 static tree
8932 {
8943 {
8945 {
8948 /* Gimplification will pull the CALL_EXPR for the builtin out of
8949 an if condition. When not optimizing, we'll not CSE it back.
8950 To avoid link error types of regressions, return false now. */
8955 }
9011 {
9016 }
9022 {
9027 }
9048 }
9052 }
9054 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9055 This function returns NULL_TREE if no simplification was possible. */
9057 static tree
9059 {
9071 {
9115 NOP_EXPR);
9117 /* We do the folding for va_start in the expander. */
9132 }
9134 }
9136 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9137 and ARG2.
9138 This function returns NULL_TREE if no simplification was possible. */
9140 static tree
9143 {
9157 {
9207 }
9209 }
9211 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9212 arguments. IGNORE is true if the result of the
9213 function call is ignored. This function returns NULL_TREE if no
9214 simplification was possible. */
9216 tree
9218 {
9222 {
9238 }
9240 {
9245 }
9247 }
9249 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9250 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9251 of arguments in ARGS to be omitted. OLDNARGS is the number of
9252 elements in ARGS. */
9254 static tree
9257 {
9262 {
9270 }
9271 else
9275 }
9277 /* Return true if FNDECL shouldn't be folded right now.
9278 If a built-in function has an inline attribute always_inline
9279 wrapper, defer folding it after always_inline functions have
9280 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9281 might not be performed. */
9283 bool
9285 {
9288 && cfun
9291 }
9293 /* A wrapper function for builtin folding that prevents warnings for
9294 "statement without effect" and the like, caused by removing the
9295 call node earlier than the warning is generated. */
9297 tree
9299 {
9305 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9306 yet. Defer folding until we see all the arguments
9307 (after inlining). */
9309 {
9312 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9313 instead last argument is __builtin_va_arg_pack (). Defer folding
9314 even in that case, until arguments are finalized. */
9316 {
9323 }
9331 else
9332 {
9337 }
9338 }
9340 }
9342 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9343 N arguments are passed in the array ARGARRAY. Return a folded
9344 expression or NULL_TREE if no simplification was possible. */
9346 tree
9348 tree fn,
9351 {
9358 {
9359 /* If last argument is __builtin_va_arg_pack (), arguments to this
9360 function are not finalized yet. Defer folding until they are. */
9362 {
9369 }
9374 else
9376 }
9379 }
9381 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9382 along with N new arguments specified as the "..." parameters. SKIP
9383 is the number of arguments in EXP to be omitted. This function is used
9384 to do varargs-to-varargs transformations. */
9386 static tree
9388 {
9390 tree t;
9398 }
9400 /* Validate a single argument ARG against a tree code CODE representing
9401 a type. Return true when argument is valid. */
9403 static bool
9405 {
9413 }
9415 /* This function validates the types of a function call argument list
9416 against a specified list of tree_codes. If the last specifier is a 0,
9417 that represents an ellipses, otherwise the last specifier must be a
9418 VOID_TYPE.
9420 This is the GIMPLE version of validate_arglist. Eventually we want to
9421 completely convert builtins.c to work from GIMPLEs and the tree based
9422 validate_arglist will then be removed. */
9424 bool
9426 {
9430 const_tree arg;
9436 do
9437 {
9440 {
9442 /* This signifies an ellipses, any further arguments are all ok. */
9446 /* This signifies an endlink, if no arguments remain, return
9447 true, otherwise return false. */
9451 /* If no parameters remain or the parameter's code does not
9452 match the specified code, return false. Otherwise continue
9453 checking any remaining arguments. */
9458 }
9459 }
9462 /* We need gotos here since we can only have one VA_CLOSE in a
9463 function. */
9464 end: ;
9468 }
9470 /* Default target-specific builtin expander that does nothing. */
9472 rtx
9474 rtx target ATTRIBUTE_UNUSED,
9475 rtx subtarget ATTRIBUTE_UNUSED,
9476 machine_mode mode ATTRIBUTE_UNUSED,
9478 {
9480 }
9482 /* Returns true is EXP represents data that would potentially reside
9483 in a readonly section. */
9485 bool
9487 {
9497 /* Make sure we call decl_readonly_section only for trees it
9498 can handle (since it returns true for everything it doesn't
9499 understand). */
9504 else
9506 }
9508 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9509 to the call, and TYPE is its return type.
9511 Return NULL_TREE if no simplification was possible, otherwise return the
9512 simplified form of the call as a tree.
9514 The simplified form may be a constant or other expression which
9515 computes the same value, but in a more efficient manner (including
9516 calls to other builtin functions).
9518 The call may contain arguments which need to be evaluated, but
9519 which are not useful to determine the result of the call. In
9520 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9521 COMPOUND_EXPR will be an argument which must be evaluated.
9522 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9523 COMPOUND_EXPR in the chain will contain the tree for the simplified
9524 form of the builtin function call. */
9526 static tree
9528 {
9532 else
9533 {
9534 tree fn;
9543 {
9545 tree tem;
9550 /* Return an offset into the constant string argument. */
9553 }
9556 /* strpbrk(x, "") == NULL.
9557 Evaluate and ignore s1 in case it had side-effects. */
9567 /* New argument list transforming strpbrk(s1, s2) to
9568 strchr(s1, s2[0]). */
9571 }
9572 }
9574 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9575 to the call.
9577 Return NULL_TREE if no simplification was possible, otherwise return the
9578 simplified form of the call as a tree.
9580 The simplified form may be a constant or other expression which
9581 computes the same value, but in a more efficient manner (including
9582 calls to other builtin functions).
9584 The call may contain arguments which need to be evaluated, but
9585 which are not useful to determine the result of the call. In
9586 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9587 COMPOUND_EXPR will be an argument which must be evaluated.
9588 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9589 COMPOUND_EXPR in the chain will contain the tree for the simplified
9590 form of the builtin function call. */
9592 static tree
9594 {
9598 else
9599 {
9602 /* If either argument is "", return NULL_TREE. */
9604 /* Evaluate and ignore both arguments in case either one has
9605 side-effects. */
9609 }
9610 }
9612 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9613 to the call.
9615 Return NULL_TREE if no simplification was possible, otherwise return the
9616 simplified form of the call as a tree.
9618 The simplified form may be a constant or other expression which
9619 computes the same value, but in a more efficient manner (including
9620 calls to other builtin functions).
9622 The call may contain arguments which need to be evaluated, but
9623 which are not useful to determine the result of the call. In
9624 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9625 COMPOUND_EXPR will be an argument which must be evaluated.
9626 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9627 COMPOUND_EXPR in the chain will contain the tree for the simplified
9628 form of the builtin function call. */
9630 static tree
9632 {
9636 else
9637 {
9638 /* If the first argument is "", return NULL_TREE. */
9641 {
9642 /* Evaluate and ignore argument s2 in case it has
9643 side-effects. */
9646 }
9648 /* If the second argument is "", return __builtin_strlen(s1). */
9651 {
9654 /* If the replacement _DECL isn't initialized, don't do the
9655 transformation. */
9660 }
9662 }
9663 }
9665 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9666 produced. False otherwise. This is done so that we don't output the error
9667 or warning twice or three times. */
9669 bool
9671 {
9674 tree arg;
9675 /* There is good chance the current input_location points inside the
9676 definition of the va_start macro (perhaps on the token for
9677 builtin) in a system header, so warnings will not be emitted.
9678 Use the location in real source code. */
9679 source_location current_location =
9681 NULL);
9684 {
9687 }
9690 {
9692 {
9695 }
9697 }
9698 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9699 when we checked the arguments and if needed issued a warning. */
9700 else
9701 {
9703 {
9704 /* Evidently an out of date version of <stdarg.h>; can't validate
9705 va_start's second argument, but can still work as intended. */
9707 OPT_Wvarargs,
9710 }
9712 {
9715 }
9717 }
9722 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9723 or __builtin_next_arg (0) the first time we see it, after checking
9724 the arguments and if needed issuing a warning. */
9726 {
9729 /* Strip off all nops for the sake of the comparison. This
9730 is not quite the same as STRIP_NOPS. It does more.
9731 We must also strip off INDIRECT_EXPR for C++ reference
9732 parameters. */
9737 {
9738 /* FIXME: Sometimes with the tree optimizers we can get the
9739 not the last argument even though the user used the last
9740 argument. We just warn and set the arg to be the last
9741 argument so that we will get wrong-code because of
9742 it. */
9744 OPT_Wvarargs,
9746 }
9748 /* Undefined by C99 7.15.1.4p4 (va_start):
9749 "If the parameter parmN is declared with the register storage
9750 class, with a function or array type, or with a type that is
9751 not compatible with the type that results after application of
9752 the default argument promotions, the behavior is undefined."
9753 */
9755 {
9757 OPT_Wvarargs,
9758 "undefined behavior when second parameter of "
9760 }
9762 /* We want to verify the second parameter just once before the tree
9763 optimizers are run and then avoid keeping it in the tree,
9764 as otherwise we could warn even for correct code like:
9765 void foo (int i, ...)
9766 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9769 else
9771 }
9773 }
9776 /* Expand a call EXP to __builtin_object_size. */
9778 static rtx
9780 {
9781 tree ost;
9786 {
9791 }
9799 {
9804 }
9809 }
9811 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9812 FCODE is the BUILT_IN_* to use.
9813 Return NULL_RTX if we failed; the caller should emit a normal call,
9814 otherwise try to get the result in TARGET, if convenient (and in
9815 mode MODE if that's convenient). */
9817 static rtx
9820 {
9822 POINTER_TYPE,
9823 fcode == BUILT_IN_MEMSET_CHK
9840 {
9841 /* Avoid transforming the checking call to an ordinary one when
9842 an overflow has been detected or when the call couldn't be
9843 validated because the size is not constant. */
9848 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9849 mem{cpy,pcpy,move,set} is available. */
9851 {
9866 }
9875 }
9878 else
9879 {
9882 /* If DEST is not a pointer type, call the normal function. */
9886 /* If SRC and DEST are the same (and not volatile), do nothing. */
9888 {
9889 tree expr;
9892 {
9893 /* Evaluate and ignore LEN in case it has side-effects. */
9896 }
9900 }
9902 /* __memmove_chk special case. */
9904 {
9910 /* If src is categorized for a readonly section we can use
9911 normal __memcpy_chk. */
9913 {
9922 }
9923 }
9925 }
9926 }
9928 /* Emit warning if a buffer overflow is detected at compile time. */
9930 static void
9932 {
9933 /* The source string. */
9935 /* The size of the destination object. */
9937 /* The string that is being concatenated with (as in __strcat_chk)
9938 or null if it isn't. */
9940 /* The maximum length of the source sequence in a bounded operation
9941 (such as __strncat_chk) or null if the operation isn't bounded
9942 (such as __strcat_chk). */
9944 /* The exact size of the access (such as in __strncpy_chk). */
9948 {
9956 /* For __strcat_chk the warning will be emitted only if overflowing
9957 by at least strlen (dest) + 1 bytes. */
9984 }
9987 {
9988 /* Check __strncat_chk. There is no way to determine the length
9989 of the string to which the source string is being appended so
9990 just warn when the length of the source string is not known. */
9993 }
9995 /* The destination argument is the first one for all built-ins above. */
9999 }
10001 /* Emit warning if a buffer overflow is detected at compile time
10002 in __sprintf_chk/__vsprintf_chk calls. */
10004 static void
10006 {
10011 /* Verify the required arguments in the original call. */
10021 /* Check whether the format is a literal string constant. */
10029 /* If the format doesn't contain % args or %%, we know its size. */
10032 /* If the format is "%s" and first ... argument is a string literal,
10033 we know it too. */
10036 {
10037 tree arg;
10048 }
10049 else
10052 /* Add one for the terminating nul. */
10057 }
10059 /* Emit warning if a free is called with address of a variable. */
10061 static void
10063 {
10077 else
10080 }
10082 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10083 if possible. */
10085 static tree
10087 {
10104 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10105 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10106 and (size_t) 0 for types 2 and 3. */
10111 {
10115 }
10117 {
10118 /* If object size is not known yet, delay folding until
10119 later. Maybe subsequent passes will help determining
10120 it. */
10124 }
10127 }
10129 /* Builtins with folding operations that operate on "..." arguments
10130 need special handling; we need to store the arguments in a convenient
10131 data structure before attempting any folding. Fortunately there are
10132 only a few builtins that fall into this category. FNDECL is the
10133 function, EXP is the CALL_EXPR for the call. */
10135 static tree
10137 {
10142 {
10149 }
10151 {
10156 }
10158 }
10160 /* Initialize format string characters in the target charset. */
10162 bool
10164 {
10167 {
10190 }
10192 }
10194 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10195 and no overflow/underflow occurred. INEXACT is true if M was not
10196 exactly calculated. TYPE is the tree type for the result. This
10197 function assumes that you cleared the MPFR flags and then
10198 calculated M to see if anything subsequently set a flag prior to
10199 entering this function. Return NULL_TREE if any checks fail. */
10201 static tree
10203 {
10204 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10205 overflow/underflow occurred. If -frounding-math, proceed iff the
10206 result of calling FUNC was exact. */
10209 {
10210 REAL_VALUE_TYPE rr;
10213 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10214 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10215 but the mpft_t is not, then we underflowed in the
10216 conversion. */
10219 {
10220 REAL_VALUE_TYPE rmode;
10223 /* Proceed iff the specified mode can hold the value. */
10226 }
10227 }
10229 }
10231 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10232 number and no overflow/underflow occurred. INEXACT is true if M
10233 was not exactly calculated. TYPE is the tree type for the result.
10234 This function assumes that you cleared the MPFR flags and then
10235 calculated M to see if anything subsequently set a flag prior to
10236 entering this function. Return NULL_TREE if any checks fail, if
10237 FORCE_CONVERT is true, then bypass the checks. */
10239 static tree
10241 {
10242 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10243 overflow/underflow occurred. If -frounding-math, proceed iff the
10244 result of calling FUNC was exact. */
10249 {
10254 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10255 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10256 but the mpft_t is not, then we underflowed in the
10257 conversion. */
10262 {
10267 /* Proceed iff the specified mode can hold the value. */
10273 }
10274 }
10276 }
10278 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10279 the pointer *(ARG_QUO) and return the result. The type is taken
10280 from the type of ARG0 and is used for setting the precision of the
10281 calculation and results. */
10283 static tree
10285 {
10292 /* To proceed, MPFR must exactly represent the target floating point
10293 format, which only happens when the target base equals two. */
10297 {
10302 {
10306 tree result_rem;
10315 /* Remquo is independent of the rounding mode, so pass
10316 inexact=0 to do_mpfr_ckconv(). */
10320 {
10321 /* MPFR calculates quo in the host's long so it may
10322 return more bits in quo than the target int can hold
10323 if sizeof(host long) > sizeof(target int). This can
10324 happen even for native compilers in LP64 mode. In
10325 these cases, modulo the quo value with the largest
10326 number that the target int can hold while leaving one
10327 bit for the sign. */
10331 /* Dereference the quo pointer argument. */
10333 /* Proceed iff a valid pointer type was passed in. */
10335 {
10336 /* Set the value. */
10337 tree result_quo
10340 integer_quo));
10342 /* Combine the quo assignment with the rem. */
10345 }
10346 }
10347 }
10348 }
10350 }
10352 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10353 resulting value as a tree with type TYPE. The mpfr precision is
10354 set to the precision of TYPE. We assume that this mpfr function
10355 returns zero if the result could be calculated exactly within the
10356 requested precision. In addition, the integer pointer represented
10357 by ARG_SG will be dereferenced and set to the appropriate signgam
10358 (-1,1) value. */
10360 static tree
10362 {
10367 /* To proceed, MPFR must exactly represent the target floating point
10368 format, which only happens when the target base equals two. Also
10369 verify ARG is a constant and that ARG_SG is an int pointer. */
10374 {
10377 /* In addition to NaN and Inf, the argument cannot be zero or a
10378 negative integer. */
10382 {
10387 mpfr_t m;
10388 tree result_lg;
10397 {
10398 tree result_sg;
10400 /* Dereference the arg_sg pointer argument. */
10402 /* Assign the signgam value into *arg_sg. */
10407 /* Combine the signgam assignment with the lgamma result. */
10410 }
10411 }
10412 }
10415 }
10417 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10418 mpc function FUNC on it and return the resulting value as a tree
10419 with type TYPE. The mpfr precision is set to the precision of
10420 TYPE. We assume that function FUNC returns zero if the result
10421 could be calculated exactly within the requested precision. If
10422 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10423 in the arguments and/or results. */
10425 tree
10428 {
10434 /* To proceed, MPFR must exactly represent the target floating point
10435 format, which only happens when the target base equals two. */
10441 {
10450 {
10470 }
10471 }
10474 }
10476 /* A wrapper function for builtin folding that prevents warnings for
10477 "statement without effect" and the like, caused by removing the
10478 call node earlier than the warning is generated. */
10480 tree
10482 {
10490 {
10499 {
10501 }
10502 else
10503 {
10506 {
10507 /* Propagate location information from original call to
10508 expansion of builtin. Otherwise things like
10509 maybe_emit_chk_warning, that operate on the expansion
10510 of a builtin, will use the wrong location information. */
10512 {
10520 }
10522 }
10523 }
10524 }
10526 }
10528 /* Look up the function in builtin_decl that corresponds to DECL
10529 and set ASMSPEC as its user assembler name. DECL must be a
10530 function decl that declares a builtin. */
10532 void
10534 {
10544 {
10548 }
10549 }
10551 /* Return true if DECL is a builtin that expands to a constant or similarly
10552 simple code. */
10553 bool
10555 {
10558 {
10559 /* Builtins that expand to constants. */
10564 /* Simple register moves or loads from stack. */
10575 /* Exception state returns or moves registers around. */
10583 }
10586 }
10588 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10589 most probably expanded inline into reasonably simple code. This is a
10590 superset of is_simple_builtin. */
10591 bool
10593 {
10600 {
10602 CASE_BUILT_IN_ALLOCA:
10668 }
10671 }
10673 /* Return true if T is a constant and the value cast to a target char
10674 can be represented by a host char.
10675 Store the casted char constant in *P if so. */
10677 bool
10679 {
10685 }
10687 /* Return the maximum object size. */
10689 tree
10691 {
10692 /* To do: Make this a configurable parameter. */
10694 }