| blob | 0097d5bae97dcb480b831b537f92eff9524bb18a |
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. */
78 #if SWITCHABLE_TARGET
80 #endif
82 /* Define the names of the builtin function types and codes. */
86 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
88 {
90 };
92 /* Setup an array of builtin_info_type, make sure each element decl is
93 initialized to NULL_TREE. */
96 /* Non-zero if __builtin_constant_p should be folded right away. */
198 /* Return true if NAME starts with __builtin_ or __sync_. */
200 static bool
202 {
210 }
213 /* Return true if DECL is a function symbol representing a built-in. */
215 bool
217 {
219 }
221 /* Return true if NODE should be considered for inline expansion regardless
222 of the optimization level. This means whenever a function is invoked with
223 its "internal" name, which normally contains the prefix "__builtin". */
225 bool
227 {
228 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
229 we want the name used to call the function, not the name it
230 will have. */
233 }
235 /* Compute values M and N such that M divides (address of EXP - N) and such
236 that N < M. If these numbers can be determined, store M in alignp and N in
237 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
238 *alignp and any bit-offset to *bitposp.
240 Note that the address (and thus the alignment) computed here is based
241 on the address to which a symbol resolves, whereas DECL_ALIGN is based
242 on the address at which an object is actually located. These two
243 addresses are not always the same. For example, on ARM targets,
244 the address &foo of a Thumb function foo() has the lowest bit set,
245 whereas foo() itself starts on an even address.
247 If ADDR_P is true we are taking the address of the memory reference EXP
248 and thus cannot rely on the access taking place. */
250 static bool
253 {
255 tree offset;
256 machine_mode mode;
261 /* Get the innermost object and the constant (bitpos) and possibly
262 variable (offset) offset of the access. */
266 /* Extract alignment information from the innermost object and
267 possibly adjust bitpos and offset. */
269 {
270 /* Function addresses can encode extra information besides their
271 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
272 allows the low bit to be used as a virtual bit, we know
273 that the address itself must be at least 2-byte aligned. */
276 }
278 ;
280 {
281 /* The alignment of a CONST_DECL is determined by its initializer. */
288 }
290 {
293 }
297 {
303 /* If the address is explicitely aligned, handle that. */
306 {
311 }
313 known_alignment
317 /* Re-apply explicit alignment to the bitpos. */
320 /* The alignment of the pointer operand in a TARGET_MEM_REF
321 has to take the variable offset parts into account. */
323 {
325 {
330 }
334 }
336 /* When EXP is an actual memory reference then we can use
337 TYPE_ALIGN of a pointer indirection to derive alignment.
338 Do so only if get_pointer_alignment_1 did not reveal absolute
339 alignment knowledge and if using that alignment would
340 improve the situation. */
346 else
347 {
348 /* Else adjust bitpos accordingly. */
353 }
354 }
356 {
357 /* STRING_CST are the only constant objects we allow to be not
358 wrapped inside a CONST_DECL. */
364 }
366 /* If there is a non-constant offset part extract the maximum
367 alignment that can prevail. */
369 {
372 {
376 }
377 }
379 /* Account for the alignment of runtime coefficients, so that the constant
380 bitpos is guaranteed to be accurate. */
383 {
386 }
391 }
393 /* For a memory reference expression EXP compute values M and N such that M
394 divides (&EXP - N) and such that N < M. If these numbers can be determined,
395 store M in alignp and N in *BITPOSP and return true. Otherwise return false
396 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
398 bool
401 {
403 }
405 /* Return the alignment in bits of EXP, an object. */
407 unsigned int
409 {
415 /* align and bitpos now specify known low bits of the pointer.
416 ptr & (align - 1) == bitpos. */
421 }
423 /* For a pointer valued expression EXP compute values M and N such that M
424 divides (EXP - N) and such that N < M. If these numbers can be determined,
425 store M in alignp and N in *BITPOSP and return true. Return false if
426 the results are just a conservative approximation.
428 If EXP is not a pointer, false is returned too. */
430 bool
433 {
440 {
447 else
448 {
451 {
455 }
456 }
460 }
463 {
468 {
471 /* Make sure to return a sensible alignment when the multiplication
472 by BITS_PER_UNIT overflowed. */
475 /* We cannot really tell whether this result is an approximation. */
477 }
478 else
479 {
483 }
484 }
486 {
491 }
496 }
498 /* Return the alignment in bits of EXP, a pointer valued expression.
499 The alignment returned is, by default, the alignment of the thing that
500 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
502 Otherwise, look at the expression to see if we can do better, i.e., if the
503 expression is actually pointing at an object whose alignment is tighter. */
505 unsigned int
507 {
513 /* align and bitpos now specify known low bits of the pointer.
514 ptr & (align - 1) == bitpos. */
520 }
522 /* Return the number of non-zero elements in the sequence
523 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
524 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
526 static unsigned
528 {
534 {
535 /* Optimize the common case of plain char. */
537 {
541 }
542 }
543 else
544 {
546 {
550 }
551 }
553 }
555 /* Compute the length of a null-terminated character string or wide
556 character string handling character sizes of 1, 2, and 4 bytes.
557 TREE_STRING_LENGTH is not the right way because it evaluates to
558 the size of the character array in bytes (as opposed to characters)
559 and because it can contain a zero byte in the middle.
561 ONLY_VALUE should be nonzero if the result is not going to be emitted
562 into the instruction stream and zero if it is going to be expanded.
563 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
564 is returned, otherwise NULL, since
565 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
566 evaluate the side-effects.
568 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
569 accesses. Note that this implies the result is not going to be emitted
570 into the instruction stream.
572 The value returned is of type `ssizetype'.
574 Unfortunately, string_constant can't access the values of const char
575 arrays with initializers, so neither can we do so here. */
577 tree
579 {
583 {
590 }
598 /* Offset from the beginning of the string in bytes. */
599 tree byteoff;
604 /* Determine the size of the string element. */
605 unsigned eltsize
608 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
609 length of SRC. */
612 /* PTR can point to the byte representation of any string type, including
613 char* and wchar_t*. */
617 {
618 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
619 compute the offset to the following null if we don't know where to
620 start searching for it. */
622 {
623 /* Return when an embedded null character is found. */
625 }
630 /* We don't know the starting offset, but we do know that the string
631 has no internal zero bytes. We can assume that the offset falls
632 within the bounds of the string; otherwise, the programmer deserves
633 what he gets. Subtract the offset from the length of the string,
634 and return that. This would perhaps not be valid if we were dealing
635 with named arrays in addition to literal string constants. */
638 }
640 /* Offset from the beginning of the string in elements. */
641 HOST_WIDE_INT eltoff;
643 /* We have a known offset into the string. Start searching there for
644 a null character if we can represent it as a single HOST_WIDE_INT. */
649 else
652 /* If the offset is known to be out of bounds, warn, and call strlen at
653 runtime. */
655 {
656 /* Suppress multiple warnings for propagated constant strings. */
659 {
662 eltoff);
664 }
666 }
668 /* Use strlen to search for the first zero byte. Since any strings
669 constructed with build_string will have nulls appended, we win even
670 if we get handed something like (char[4])"abcd".
672 Since ELTOFF is our starting index into the string, no further
673 calculation is needed. */
678 }
680 /* Return a constant integer corresponding to target reading
681 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
683 static rtx
685 {
686 HOST_WIDE_INT ch;
700 {
712 }
716 }
718 /* Cast a target constant CST to target CHAR and if that value fits into
719 host char type, return zero and put that value into variable pointed to by
720 P. */
722 static int
724 {
731 /* Do not care if it fits or not right here. */
746 }
748 /* Similar to save_expr, but assumes that arbitrary code is not executed
749 in between the multiple evaluations. In particular, we assume that a
750 non-addressable local variable will not be modified. */
752 static tree
754 {
762 }
764 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
765 times to get the address of either a higher stack frame, or a return
766 address located within it (depending on FNDECL_CODE). */
768 static rtx
770 {
774 {
775 /* For a zero count with __builtin_return_address, we don't care what
776 frame address we return, because target-specific definitions will
777 override us. Therefore frame pointer elimination is OK, and using
778 the soft frame pointer is OK.
780 For a nonzero count, or a zero count with __builtin_frame_address,
781 we require a stable offset from the current frame pointer to the
782 previous one, so we must use the hard frame pointer, and
783 we must disable frame pointer elimination. */
786 else
787 {
790 /* Tell reload not to eliminate the frame pointer. */
792 }
793 }
798 /* On the SPARC, the return address is not in the frame, it is in a
799 register. There is no way to access it off of the current frame
800 pointer, but it can be accessed off the previous frame pointer by
801 reading the value from the register window save area. */
803 count--;
805 /* Scan back COUNT frames to the specified frame. */
807 {
808 /* Assume the dynamic chain pointer is in the word that the
809 frame address points to, unless otherwise specified. */
814 }
816 /* For __builtin_frame_address, return what we've got. But, on
817 the SPARC for example, we may have to add a bias. */
821 /* For __builtin_return_address, get the return address from that frame. */
822 #ifdef RETURN_ADDR_RTX
824 #else
828 #endif
830 }
832 /* Alias set used for setjmp buffer. */
835 /* Construct the leading half of a __builtin_setjmp call. Control will
836 return to RECEIVER_LABEL. This is also called directly by the SJLJ
837 exception handling code. */
839 void
841 {
843 rtx stack_save;
844 rtx mem;
853 /* We store the frame pointer and the address of receiver_label in
854 the buffer and use the rest of it for the stack save area, which
855 is machine-dependent. */
874 /* If there is further processing to do, do it. */
878 /* We have a nonlocal label. */
880 }
882 /* Construct the trailing part of a __builtin_setjmp call. This is
883 also called directly by the SJLJ exception handling code.
884 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
886 void
888 {
889 rtx chain;
891 /* Mark the FP as used when we get here, so we have to make sure it's
892 marked as used by this function. */
895 /* Mark the static chain as clobbered here so life information
896 doesn't get messed up for it. */
901 /* Now put in the code to restore the frame pointer, and argument
902 pointer, if needed. */
904 {
905 /* First adjust our frame pointer to its actual value. It was
906 previously set to the start of the virtual area corresponding to
907 the stacked variables when we branched here and now needs to be
908 adjusted to the actual hardware fp value.
910 Assignments to virtual registers are converted by
911 instantiate_virtual_regs into the corresponding assignment
912 to the underlying register (fp in this case) that makes
913 the original assignment true.
914 So the following insn will actually be decrementing fp by
915 TARGET_STARTING_FRAME_OFFSET. */
918 /* Restoring the frame pointer also modifies the hard frame pointer.
919 Mark it used (so that the previous assignment remains live once
920 the frame pointer is eliminated) and clobbered (to represent the
921 implicit update from the assignment). */
924 }
927 {
928 /* If the argument pointer can be eliminated in favor of the
929 frame pointer, we don't need to restore it. We assume here
930 that if such an elimination is present, it can always be used.
931 This is the case on all known machines; if we don't make this
932 assumption, we do unnecessary saving on many machines. */
942 {
943 /* Now restore our arg pointer from the address at which it
944 was saved in our stack frame. */
947 }
948 }
954 else
957 /* We must not allow the code we just generated to be reordered by
958 scheduling. Specifically, the update of the frame pointer must
959 happen immediately, not later. */
961 }
963 /* __builtin_longjmp is passed a pointer to an array of five words (not
964 all will be used on all machines). It operates similarly to the C
965 library function of the same name, but is more efficient. Much of
966 the code below is copied from the handling of non-local gotos. */
968 static void
970 {
975 /* DRAP is needed for stack realign if longjmp is expanded to current
976 function */
987 /* We require that the user must pass a second argument of 1, because
988 that is what builtin_setjmp will return. */
994 else
995 {
1006 /* Pick up FP, label, and SP from the block and jump. This code is
1007 from expand_goto in stmt.c; see there for detailed comments. */
1009 /* We have to pass a value to the nonlocal_goto pattern that will
1010 get copied into the static_chain pointer, but it does not matter
1011 what that value is, because builtin_setjmp does not use it. */
1013 else
1014 {
1026 }
1027 }
1029 /* Search backwards and mark the jump insn as a non-local goto.
1030 Note that this precludes the use of __builtin_longjmp to a
1031 __builtin_setjmp target in the same function. However, we've
1032 already cautioned the user that these functions are for
1033 internal exception handling use only. */
1035 {
1039 {
1042 }
1045 }
1046 }
1050 {
1052 }
1054 /* This function validates the types of a function call argument list
1055 against a specified list of tree_codes. If the last specifier is a 0,
1056 that represents an ellipsis, otherwise the last specifier must be a
1057 VOID_TYPE. */
1059 static bool
1061 {
1065 const_call_expr_arg_iterator iter;
1066 const_tree arg;
1071 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1076 {
1080 {
1082 /* This signifies an ellipses, any further arguments are all ok. */
1086 /* This signifies an endlink, if no arguments remain, return
1087 true, otherwise return false. */
1091 /* The actual argument must be nonnull when either the whole
1092 called function has been declared nonnull, or when the formal
1093 argument corresponding to the actual argument has been. */
1096 {
1101 }
1102 /* FALLTHRU */
1104 /* If no parameters remain or the parameter's code does not
1105 match the specified code, return false. Otherwise continue
1106 checking any remaining arguments. */
1111 }
1112 }
1114 /* We need gotos here since we can only have one VA_CLOSE in a
1115 function. */
1116 end: ;
1122 }
1124 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1125 and the address of the save area. */
1127 static rtx
1129 {
1144 /* Copy the address of the save location to a register just in case it was
1145 based on the frame pointer. */
1154 /* ??? We no longer need to pass the static chain value, afaik. */
1157 else
1158 {
1164 /* Restore frame pointer for containing function. */
1168 /* USE of hard_frame_pointer_rtx added for consistency;
1169 not clear if really needed. */
1173 /* If the architecture is using a GP register, we must
1174 conservatively assume that the target function makes use of it.
1175 The prologue of functions with nonlocal gotos must therefore
1176 initialize the GP register to the appropriate value, and we
1177 must then make sure that this value is live at the point
1178 of the jump. (Note that this doesn't necessarily apply
1179 to targets with a nonlocal_goto pattern; they are free
1180 to implement it in their own way. Note also that this is
1181 a no-op if the GP register is a global invariant.) */
1187 }
1189 /* Search backwards to the jump insn and mark it as a
1190 non-local goto. */
1192 {
1194 {
1197 }
1200 }
1203 }
1205 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1206 (not all will be used on all machines) that was passed to __builtin_setjmp.
1207 It updates the stack pointer in that block to the current value. This is
1208 also called directly by the SJLJ exception handling code. */
1210 void
1212 {
1215 rtx stack_save
1217 memory_address
1223 }
1225 /* Expand a call to __builtin_prefetch. For a target that does not support
1226 data prefetch, evaluate the memory address argument in case it has side
1227 effects. */
1229 static void
1231 {
1241 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1242 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1243 locality). */
1247 else
1251 else
1254 /* Argument 0 is an address. */
1257 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1259 {
1262 }
1264 /* Argument 1 must be either zero or one. */
1266 {
1270 }
1272 /* Argument 2 (locality) must be a compile-time constant int. */
1274 {
1277 }
1279 /* Argument 2 must be 0, 1, 2, or 3. */
1281 {
1284 }
1287 {
1295 }
1297 /* Don't do anything with direct references to volatile memory, but
1298 generate code to handle other side effects. */
1301 }
1303 /* Get a MEM rtx for expression EXP which is the address of an operand
1304 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1305 the maximum length of the block of memory that might be accessed or
1306 NULL if unknown. */
1308 static rtx
1310 {
1314 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1315 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1322 /* Get an expression we can use to find the attributes to assign to MEM.
1323 First remove any nops. */
1328 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1329 (as builtin stringops may alias with anything). */
1336 /* If the MEM_REF has no acceptable address, try to get the base object
1337 from the original address we got, and build an all-aliasing
1338 unknown-sized access to that one. */
1344 {
1349 size_zero_node,
1350 NULL)),
1353 }
1356 }
1357 \f
1358 /* Built-in functions to perform an untyped call and return. */
1360 #define apply_args_mode \
1361 (this_target_builtins->x_apply_args_mode)
1362 #define apply_result_mode \
1363 (this_target_builtins->x_apply_result_mode)
1365 /* Return the size required for the block returned by __builtin_apply_args,
1366 and initialize apply_args_mode. */
1368 static int
1370 {
1375 /* The values computed by this function never change. */
1377 {
1378 /* The first value is the incoming arg-pointer. */
1381 /* The second value is the structure value address unless this is
1382 passed as an "invisible" first argument. */
1388 {
1398 }
1399 else
1400 {
1402 }
1403 }
1405 }
1407 /* Return the size required for the block returned by __builtin_apply,
1408 and initialize apply_result_mode. */
1410 static int
1412 {
1416 /* The values computed by this function never change. */
1418 {
1423 {
1433 }
1434 else
1437 /* Allow targets that use untyped_call and untyped_return to override
1438 the size so that machine-specific information can be stored here. */
1439 #ifdef APPLY_RESULT_SIZE
1441 #endif
1442 }
1444 }
1446 /* Create a vector describing the result block RESULT. If SAVEP is true,
1447 the result block is used to save the values; otherwise it is used to
1448 restore the values. */
1450 static rtx
1452 {
1454 fixed_size_mode mode;
1461 {
1471 }
1473 }
1475 /* Save the state required to perform an untyped call with the same
1476 arguments as were passed to the current function. */
1478 static rtx
1480 {
1483 fixed_size_mode mode;
1484 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1486 /* Create a block where the arg-pointer, structure value address,
1487 and argument registers can be saved. */
1490 /* Walk past the arg-pointer and structure value address. */
1495 /* Save each register used in calling a function to the block. */
1498 {
1507 }
1509 /* Save the arg pointer to the block. */
1511 /* We need the pointer as the caller actually passed them to us, not
1512 as we might have pretended they were passed. Make sure it's a valid
1513 operand, as emit_move_insn isn't expected to handle a PLUS. */
1515 tem
1518 NULL_RTX);
1523 /* Save the structure value address unless this is passed as an
1524 "invisible" first argument. */
1526 {
1530 }
1532 /* Return the address of the block. */
1534 }
1536 /* __builtin_apply_args returns block of memory allocated on
1537 the stack into which is stored the arg pointer, structure
1538 value address, static chain, and all the registers that might
1539 possibly be used in performing a function call. The code is
1540 moved to the start of the function so the incoming values are
1541 saved. */
1543 static rtx
1545 {
1546 /* Don't do __builtin_apply_args more than once in a function.
1547 Save the result of the first call and reuse it. */
1550 {
1551 /* When this function is called, it means that registers must be
1552 saved on entry to this function. So we migrate the
1553 call to the first insn of this function. */
1554 rtx temp;
1563 /* Put the insns after the NOTE that starts the function.
1564 If this is inside a start_sequence, make the outer-level insn
1565 chain current, so the code is placed at the start of the
1566 function. If internal_arg_pointer is a non-virtual pseudo,
1567 it needs to be placed after the function that initializes
1568 that pseudo. */
1573 else
1577 }
1578 }
1580 /* Perform an untyped call and save the state required to perform an
1581 untyped return of whatever value was returned by the given function. */
1583 static rtx
1585 {
1587 fixed_size_mode mode;
1596 /* Create a block where the return registers can be saved. */
1599 /* Fetch the arg pointer from the ARGUMENTS block. */
1606 /* Push a new argument block and copy the arguments. Do not allow
1607 the (potential) memcpy call below to interfere with our stack
1608 manipulations. */
1610 NO_DEFER_POP;
1612 /* Save the stack with nonlocal if available. */
1615 else
1618 /* Allocate a block of memory onto the stack and copy the memory
1619 arguments to the outgoing arguments address. We can pass TRUE
1620 as the 4th argument because we just saved the stack pointer
1621 and will restore it right after the call. */
1624 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1625 may have already set current_function_calls_alloca to true.
1626 current_function_calls_alloca won't be set if argsize is zero,
1627 so we have to guarantee need_drap is true here. */
1633 {
1636 else
1638 }
1645 /* Refer to the argument block. */
1650 /* Walk past the arg-pointer and structure value address. */
1655 /* Restore each of the registers previously saved. Make USE insns
1656 for each of these registers for use in making the call. */
1659 {
1667 }
1669 /* Restore the structure value address unless this is passed as an
1670 "invisible" first argument. */
1673 {
1680 }
1682 /* All arguments and registers used for the call are set up by now! */
1685 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1686 and we don't want to load it into a register as an optimization,
1687 because prepare_call_address already did it if it should be done. */
1691 /* Generate the actual call instruction and save the return value. */
1693 {
1697 }
1699 {
1702 /* Locate the unique return register. It is not possible to
1703 express a call that sets more than one return register using
1704 call_value; use untyped_call for that. In fact, untyped_call
1705 only needs to save the return registers in the given block. */
1708 {
1712 }
1719 }
1720 else
1723 /* Find the CALL insn we just emitted, and attach the register usage
1724 information. */
1728 /* Restore the stack. */
1731 else
1735 OK_DEFER_POP;
1737 /* Return the address of the result block. */
1740 }
1742 /* Perform an untyped return. */
1744 static void
1746 {
1748 fixed_size_mode mode;
1749 rtx reg;
1758 {
1763 }
1765 /* Restore the return value and note that each value is used. */
1769 {
1781 }
1783 /* Put the USE insns before the return. */
1786 /* Return whatever values was restored by jumping directly to the end
1787 of the function. */
1789 }
1791 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1793 static enum type_class
1795 {
1797 {
1816 }
1817 }
1819 /* Expand a call EXP to __builtin_classify_type. */
1821 static rtx
1823 {
1827 }
1829 /* This helper macro, meant to be used in mathfn_built_in below, determines
1830 which among a set of builtin math functions is appropriate for a given type
1831 mode. The `F' (float) and `L' (long double) are automatically generated
1832 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1833 types, there are additional types that are considered with 'F32', 'F64',
1834 'F128', etc. suffixes. */
1835 #define CASE_MATHFN(MATHFN) \
1836 CASE_CFN_##MATHFN: \
1837 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1838 fcodel = BUILT_IN_##MATHFN##L ; break;
1839 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1840 types. */
1841 #define CASE_MATHFN_FLOATN(MATHFN) \
1842 CASE_CFN_##MATHFN: \
1843 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1844 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1845 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1846 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1847 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1848 break;
1849 /* Similar to above, but appends _R after any F/L suffix. */
1850 #define CASE_MATHFN_REENT(MATHFN) \
1851 case CFN_BUILT_IN_##MATHFN##_R: \
1852 case CFN_BUILT_IN_##MATHFN##F_R: \
1853 case CFN_BUILT_IN_##MATHFN##L_R: \
1854 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1855 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1857 /* Return a function equivalent to FN but operating on floating-point
1858 values of type TYPE, or END_BUILTINS if no such function exists.
1859 This is purely an operation on function codes; it does not guarantee
1860 that the target actually has an implementation of the function. */
1862 static built_in_function
1864 {
1865 tree mtype;
1876 {
1967 }
1990 else
1992 }
1994 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1995 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1996 otherwise use the explicit declaration. If we can't do the conversion,
1997 return null. */
1999 static tree
2001 {
2010 }
2012 /* Like mathfn_built_in_1, but always use the implicit array. */
2014 tree
2016 {
2018 }
2020 /* Like mathfn_built_in_1, but take a built_in_function and
2021 always use the implicit array. */
2023 tree
2025 {
2027 }
2029 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2030 return its code, otherwise return IFN_LAST. Note that this function
2031 only tests whether the function is defined in internals.def, not whether
2032 it is actually available on the target. */
2034 internal_fn
2036 {
2040 {
2041 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2042 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2043 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2044 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2045 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2046 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2047 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2064 }
2065 }
2067 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2068 on the current target by a call to an internal function, return the
2069 code of that internal function, otherwise return IFN_LAST. The caller
2070 is responsible for ensuring that any side-effects of the built-in
2071 call are dealt with correctly. E.g. if CALL sets errno, the caller
2072 must decide that the errno result isn't needed or make it available
2073 in some other way. */
2075 internal_fn
2077 {
2079 {
2082 {
2087 }
2088 }
2090 }
2092 /* Expand a call to the builtin trinary math functions (fma).
2093 Return NULL_RTX if a normal call should be emitted rather than expanding the
2094 function in-line. EXP is the expression that is a call to the builtin
2095 function; if convenient, the result should be placed in TARGET.
2096 SUBTARGET may be used as the target for computing one of EXP's
2097 operands. */
2099 static rtx
2101 {
2102 optab builtin_optab;
2107 machine_mode mode;
2117 {
2123 }
2125 /* Make a suitable register to place result in. */
2128 /* Before working hard, check whether the instruction is available. */
2134 /* Always stabilize the argument list. */
2145 /* Compute into RESULT.
2146 Set RESULT to wherever the result comes back. */
2150 /* If we were unable to expand via the builtin, stop the sequence
2151 (without outputting the insns) and call to the library function
2152 with the stabilized argument list. */
2154 {
2157 }
2159 /* Output the entire sequence. */
2165 }
2167 /* Expand a call to the builtin sin and cos math functions.
2168 Return NULL_RTX if a normal call should be emitted rather than expanding the
2169 function in-line. EXP is the expression that is a call to the builtin
2170 function; if convenient, the result should be placed in TARGET.
2171 SUBTARGET may be used as the target for computing one of EXP's
2172 operands. */
2174 static rtx
2176 {
2177 optab builtin_optab;
2178 rtx op0;
2181 machine_mode mode;
2182 tree arg;
2190 {
2196 }
2198 /* Make a suitable register to place result in. */
2201 /* Check if sincos insn is available, otherwise fallback
2202 to sin or cos insn. */
2205 {
2212 }
2214 /* Before working hard, check whether the instruction is available. */
2216 {
2219 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2220 need to expand the argument again. This way, we will not perform
2221 side-effects more the once. */
2228 /* Compute into RESULT.
2229 Set RESULT to wherever the result comes back. */
2231 {
2235 {
2244 }
2246 }
2247 else
2251 {
2252 /* Output the entire sequence. */
2257 }
2259 /* If we were unable to expand via the builtin, stop the sequence
2260 (without outputting the insns) and call to the library function
2261 with the stabilized argument list. */
2263 }
2266 }
2268 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2269 return an RTL instruction code that implements the functionality.
2270 If that isn't possible or available return CODE_FOR_nothing. */
2272 static enum insn_code
2274 {
2277 machine_mode mode;
2280 {
2294 /* These builtins have no optabs (yet). */
2298 }
2300 /* There's no easy way to detect the case we need to set EDOM. */
2304 /* Optab mode depends on the mode of the input argument. */
2310 }
2312 /* Expand a call to one of the builtin math functions that operate on
2313 floating point argument and output an integer result (ilogb, isinf,
2314 isnan, etc).
2315 Return 0 if a normal call should be emitted rather than expanding the
2316 function in-line. EXP is the expression that is a call to the builtin
2317 function; if convenient, the result should be placed in TARGET. */
2319 static rtx
2321 {
2323 rtx op0;
2325 machine_mode mode;
2326 tree arg;
2336 {
2341 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2342 need to expand the argument again. This way, we will not perform
2343 side-effects more the once. */
2358 }
2361 }
2363 /* Expand a call to the builtin sincos math function.
2364 Return NULL_RTX if a normal call should be emitted rather than expanding the
2365 function in-line. EXP is the expression that is a call to the builtin
2366 function. */
2368 static rtx
2370 {
2372 machine_mode mode;
2386 /* Make a suitable register to place result in. */
2389 /* Check if sincos insn is available, otherwise emit the call. */
2404 /* Compute into target1 and target2.
2405 Set TARGET to wherever the result comes back. */
2409 /* Move target1 and target2 to the memory locations indicated
2410 by op1 and op2. */
2415 }
2417 /* Expand a call to the internal cexpi builtin to the sincos math function.
2418 EXP is the expression that is a call to the builtin function; if convenient,
2419 the result should be placed in TARGET. */
2421 static rtx
2423 {
2426 machine_mode mode;
2437 /* Try expanding via a sincos optab, fall back to emitting a libcall
2438 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2439 is only generated from sincos, cexp or if we have either of them. */
2441 {
2447 /* Compute into op1 and op2. */
2449 }
2451 {
2462 else
2472 /* Make sure not to fold the sincos call again. */
2476 }
2477 else
2478 {
2488 else
2491 /* If we don't have a decl for cexp create one. This is the
2492 friendliest fallback if the user calls __builtin_cexpi
2493 without full target C99 function support. */
2495 {
2496 tree fntype;
2508 }
2513 /* Make sure not to fold the cexp call again. */
2517 }
2519 /* Now build the proper return type. */
2524 }
2526 /* Conveniently construct a function call expression. FNDECL names the
2527 function to be called, N is the number of arguments, and the "..."
2528 parameters are the argument expressions. Unlike build_call_exr
2529 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2531 static tree
2533 {
2543 }
2545 /* Expand a call to one of the builtin rounding functions gcc defines
2546 as an extension (lfloor and lceil). As these are gcc extensions we
2547 do not need to worry about setting errno to EDOM.
2548 If expanding via optab fails, lower expression to (int)(floor(x)).
2549 EXP is the expression that is a call to the builtin function;
2550 if convenient, the result should be placed in TARGET. */
2552 static rtx
2554 {
2555 convert_optab builtin_optab;
2560 tree fallback_fndecl;
2561 machine_mode mode;
2562 tree arg;
2570 {
2587 }
2589 /* Make a suitable register to place result in. */
2594 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2595 need to expand the argument again. This way, we will not perform
2596 side-effects more the once. */
2603 /* Compute into TARGET. */
2605 {
2606 /* Output the entire sequence. */
2611 }
2613 /* If we were unable to expand via the builtin, stop the sequence
2614 (without outputting the insns). */
2617 /* Fall back to floating point rounding optab. */
2620 /* For non-C99 targets we may end up without a fallback fndecl here
2621 if the user called __builtin_lfloor directly. In this case emit
2622 a call to the floor/ceil variants nevertheless. This should result
2623 in the best user experience for not full C99 targets. */
2625 {
2626 tree fntype;
2630 {
2663 }
2668 }
2675 /* Truncate the result of floating point optab to integer
2676 via expand_fix (). */
2681 }
2683 /* Expand a call to one of the builtin math functions doing integer
2684 conversion (lrint).
2685 Return 0 if a normal call should be emitted rather than expanding the
2686 function in-line. EXP is the expression that is a call to the builtin
2687 function; if convenient, the result should be placed in TARGET. */
2689 static rtx
2691 {
2692 convert_optab builtin_optab;
2693 rtx op0;
2696 tree arg;
2697 machine_mode mode;
2706 {
2725 }
2727 /* There's no easy way to detect the case we need to set EDOM. */
2731 /* Make a suitable register to place result in. */
2734 /* There's no easy way to detect the case we need to set EDOM. */
2736 {
2739 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2740 need to expand the argument again. This way, we will not perform
2741 side-effects more the once. */
2749 {
2750 /* Output the entire sequence. */
2755 }
2757 /* If we were unable to expand via the builtin, stop the sequence
2758 (without outputting the insns) and call to the library function
2759 with the stabilized argument list. */
2761 }
2764 {
2765 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2766 targets, (int) round (x) should never be transformed into
2767 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2768 a call to lround in the hope that the target provides at least some
2769 C99 functions. This should result in the best user experience for
2770 not full C99 targets. */
2771 tree fallback_fndecl = mathfn_built_in_1
2780 }
2783 }
2785 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2786 a normal call should be emitted rather than expanding the function
2787 in-line. EXP is the expression that is a call to the builtin
2788 function; if convenient, the result should be placed in TARGET. */
2790 static rtx
2792 {
2795 machine_mode mode;
2796 machine_mode mode2;
2805 /* Emit a libcall to libgcc. */
2807 /* Mode of the 2nd argument must match that of an int. */
2825 }
2827 /* Expand expression EXP which is a call to the strlen builtin. Return
2828 NULL_RTX if we failed the caller should emit a normal call, otherwise
2829 try to get the result in TARGET, if convenient. */
2831 static rtx
2833 machine_mode target_mode)
2834 {
2839 rtx pat;
2840 tree len;
2842 rtx src_reg;
2844 machine_mode insn_mode;
2848 /* If the length can be computed at compile-time, return it. */
2853 /* If the length can be computed at compile-time and is constant
2854 integer, but there are side-effects in src, evaluate
2855 src for side-effects, then return len.
2856 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2857 can be optimized into: i++; x = 3; */
2860 {
2863 }
2867 /* If SRC is not a pointer type, don't do this operation inline. */
2871 /* Bail out if we can't compute strlen in the right mode. */
2873 {
2877 }
2881 /* Make a place to hold the source address. We will not expand
2882 the actual source until we are sure that the expansion will
2883 not fail -- there are trees that cannot be expanded twice. */
2886 /* Mark the beginning of the strlen sequence so we can emit the
2887 source operand later. */
2897 /* Check to see if the argument was declared attribute nonstring
2898 and if so, issue a warning since at this point it's not known
2899 to be nul-terminated. */
2902 /* Now that we are assured of success, expand the source. */
2906 {
2907 #ifdef POINTERS_EXTEND_UNSIGNED
2910 POINTERS_EXTEND_UNSIGNED);
2911 #endif
2913 }
2919 else
2922 /* Return the value in the proper mode for this function. */
2927 else
2931 }
2933 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2934 bytes from constant string DATA + OFFSET and return it as target
2935 constant. */
2937 static rtx
2939 scalar_int_mode mode)
2940 {
2948 }
2950 /* LEN specify length of the block of memcpy/memset operation.
2951 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2952 In some cases we can make very likely guess on max size, then we
2953 set it into PROBABLE_MAX_SIZE. */
2955 static void
2960 {
2962 {
2965 }
2966 else
2967 {
2971 /* Determine bounds from the type. */
2974 else
2979 else
2985 {
2990 }
2992 {
2993 /* Anti range 0...N lets us to determine minimal size to N+1. */
2995 {
2998 }
2999 /* Code like
3001 int n;
3002 if (n < 100)
3003 memcpy (a, b, n)
3005 Produce anti range allowing negative values of N. We still
3006 can use the information and make a guess that N is not negative.
3007 */
3010 }
3011 }
3015 }
3017 /* Try to verify that the sizes and lengths of the arguments to a string
3018 manipulation function given by EXP are within valid bounds and that
3019 the operation does not lead to buffer overflow or read past the end.
3020 Arguments other than EXP may be null. When non-null, the arguments
3021 have the following meaning:
3022 DST is the destination of a copy call or NULL otherwise.
3023 SRC is the source of a copy call or NULL otherwise.
3024 DSTWRITE is the number of bytes written into the destination obtained
3025 from the user-supplied size argument to the function (such as in
3026 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3027 MAXREAD is the user-supplied bound on the length of the source sequence
3028 (such as in strncat(d, s, N). It specifies the upper limit on the number
3029 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3030 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3031 expression EXP is a string function call (as opposed to a memory call
3032 like memcpy). As an exception, SRCSTR can also be an integer denoting
3033 the precomputed size of the source string or object (for functions like
3034 memcpy).
3035 DSTSIZE is the size of the destination object specified by the last
3036 argument to the _chk builtins, typically resulting from the expansion
3037 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3038 DSTSIZE).
3040 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3041 SIZE_MAX.
3043 If the call is successfully verified as safe return true, otherwise
3044 return false. */
3046 static bool
3049 {
3052 /* The size of the largest object is half the address space, or
3053 PTRDIFF_MAX. (This is way too permissive.) */
3056 /* Either the length of the source string for string functions or
3057 the size of the source object for raw memory functions. */
3062 /* Set to true when the exact number of bytes written by a string
3063 function like strcpy is not known and the only thing that is
3064 known is that it must be at least one (for the terminating nul). */
3067 {
3068 /* SRCSTR is normally a pointer to string but as a special case
3069 it can be an integer denoting the length of a string. */
3071 {
3072 /* Try to determine the range of lengths the source string
3073 refers to. If it can be determined and is less than
3074 the upper bound given by MAXREAD add one to it for
3075 the terminating nul. Otherwise, set it to one for
3076 the same reason, or to MAXREAD as appropriate. */
3079 {
3082 else
3093 }
3094 else
3095 {
3098 }
3099 }
3100 else
3102 }
3105 {
3106 /* When the only available piece of data is the object size
3107 there is nothing to do. */
3111 /* Otherwise, when the length of the source sequence is known
3112 (as with strlen), set DSTWRITE to it. */
3115 }
3125 /* First check the number of bytes to be written against the maximum
3126 object size. */
3128 {
3134 "%K%qD specified size %E "
3137 else
3139 "%K%qD specified size between %E and %E "
3144 }
3146 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3147 constant, and in range of unsigned HOST_WIDE_INT. */
3150 /* Next check the number of bytes to be written against the destination
3151 object size. */
3153 {
3159 {
3167 {
3168 /* This is a call to strcpy with a destination of 0 size
3169 and a source of unknown length. The call will write
3170 at least one byte past the end of the destination. */
3172 "%K%qD writing %E or more bytes into a region "
3175 }
3178 "%K%qD writing %E byte into a region "
3180 "%K%qD writing %E bytes into a region "
3184 {
3185 /* Avoid printing the upper bound if it's invalid. */
3187 "%K%qD writing %E or more bytes into a region "
3190 }
3191 else
3193 "%K%qD writing between %E and %E bytes into "
3196 dstsize);
3198 /* Return error when an overflow has been detected. */
3200 }
3201 }
3203 /* Check the maximum length of the source sequence against the size
3204 of the destination object if known, or against the maximum size
3205 of an object. */
3207 {
3210 /* Use the lower end for MAXREAD from now on. */
3215 {
3220 {
3224 /* Warn about crazy big sizes first since that's more
3225 likely to be meaningful than saying that the bound
3226 is greater than the object size if both are big. */
3229 "%K%qD specified bound %E "
3233 else
3235 "%K%qD specified bound between %E and %E "
3241 }
3244 {
3250 "%K%qD specified bound %E "
3254 else
3256 "%K%qD specified bound between %E and %E "
3261 }
3262 }
3263 }
3265 /* Check for reading past the end of SRC. */
3270 {
3282 {
3283 /* Avoid printing the upper bound if it's invalid. */
3285 "%K%qD reading %E or more bytes from a region "
3288 }
3289 else
3291 "%K%qD reading between %E and %E bytes from a region "
3295 }
3298 }
3300 /* Helper to compute the size of the object referenced by the DEST
3301 expression which must have pointer type, using Object Size type
3302 OSTYPE (only the least significant 2 bits are used). Return
3303 an estimate of the size of the object if successful or NULL when
3304 the size cannot be determined. When the referenced object involves
3305 a non-constant offset in some range the returned value represents
3306 the largest size given the smallest non-negative offset in the
3307 range. The function is intended for diagnostics and should not
3308 be used to influence code generation or optimization. */
3310 tree
3312 {
3315 /* Only the two least significant bits are meaningful. */
3322 {
3331 {
3332 /* compute_builtin_object_size fails for addresses with
3333 non-constant offsets. Try to determine the range of
3334 such an offset here and use it to adjus the constant
3335 size. */
3339 {
3344 {
3346 {
3349 /* Ignore negative offsets for now. For others,
3350 use the lower bound as the most optimistic
3351 estimate of the (remaining)size. */
3353 ;
3357 else
3359 }
3360 }
3361 }
3362 }
3365 }
3367 /* Unless computing the largest size (for memcpy and other raw memory
3368 functions), try to determine the size of the object from its type. */
3383 {
3384 /* Return the constant size unless it's zero (that's a zero-length
3385 array likely at the end of a struct). */
3390 }
3393 }
3395 /* Helper to determine and check the sizes of the source and the destination
3396 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3397 call expression, DEST is the destination argument, SRC is the source
3398 argument or null, and LEN is the number of bytes. Use Object Size type-0
3399 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3400 (no overflow or invalid sizes), false otherwise. */
3402 static bool
3404 {
3405 /* For functions like memset and memcpy that operate on raw memory
3406 try to determine the size of the largest source and destination
3407 object using type-0 Object Size regardless of the object size
3408 type specified by the option. */
3414 }
3416 /* Validate memchr arguments without performing any expansion.
3417 Return NULL_RTX. */
3419 static rtx
3421 {
3429 /* Diagnose calls where the specified length exceeds the size
3430 of the object. */
3432 {
3436 }
3439 }
3441 /* Expand a call EXP to the memcpy builtin.
3442 Return NULL_RTX if we failed, the caller should emit a normal call,
3443 otherwise try to get the result in TARGET, if convenient (and in
3444 mode MODE if that's convenient). */
3446 static rtx
3448 {
3461 }
3463 /* Check a call EXP to the memmove built-in for validity.
3464 Return NULL_RTX on both success and failure. */
3466 static rtx
3468 {
3480 }
3482 /* Expand an instrumented call EXP to the memcpy builtin.
3483 Return NULL_RTX if we failed, the caller should emit a normal call,
3484 otherwise try to get the result in TARGET, if convenient (and in
3485 mode MODE if that's convenient). */
3487 static rtx
3489 {
3495 else
3496 {
3503 /* Return src bounds with the result. */
3505 {
3509 }
3511 }
3512 }
3514 /* Expand a call EXP to the mempcpy builtin.
3515 Return NULL_RTX if we failed; the caller should emit a normal call,
3516 otherwise try to get the result in TARGET, if convenient (and in
3517 mode MODE if that's convenient). If ENDP is 0 return the
3518 destination pointer, if ENDP is 1 return the end pointer ala
3519 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3520 stpcpy. */
3522 static rtx
3524 {
3533 /* Policy does not generally allow using compute_objsize (which
3534 is used internally by check_memop_size) to change code generation
3535 or drive optimization decisions.
3537 In this instance it is safe because the code we generate has
3538 the same semantics regardless of the return value of
3539 check_memop_sizes. Exactly the same amount of data is copied
3540 and the return value is exactly the same in both cases.
3542 Furthermore, check_memop_size always uses mode 0 for the call to
3543 compute_objsize, so the imprecise nature of compute_objsize is
3544 avoided. */
3546 /* Avoid expanding mempcpy into memcpy when the call is determined
3547 to overflow the buffer. This also prevents the same overflow
3548 from being diagnosed again when expanding memcpy. */
3554 }
3556 /* Expand an instrumented call EXP to the mempcpy builtin.
3557 Return NULL_RTX if we failed, the caller should emit a normal call,
3558 otherwise try to get the result in TARGET, if convenient (and in
3559 mode MODE if that's convenient). */
3561 static rtx
3563 {
3569 else
3570 {
3577 /* Return src bounds with the result. */
3579 {
3583 }
3585 }
3586 }
3588 /* Helper function to do the actual work for expand of memory copy family
3589 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3590 of memory from SRC to DEST and assign to TARGET if convenient.
3591 If ENDP is 0 return the
3592 destination pointer, if ENDP is 1 return the end pointer ala
3593 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3594 stpcpy. */
3596 static rtx
3599 {
3610 /* If DEST is not a pointer type, call the normal function. */
3614 /* If either SRC is not a pointer type, don't do this
3615 operation in-line. */
3632 /* If SRC is a string constant and block move would be done
3633 by pieces, we can avoid loading the string from memory
3634 and only stored the computed constants. */
3641 {
3643 builtin_memcpy_read_str,
3649 }
3654 /* Copy word part most expediently. */
3667 {
3670 }
3673 {
3675 /* stpcpy pointer to last byte. */
3678 }
3681 }
3683 static rtx
3686 {
3688 endp);
3689 }
3691 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3692 we failed, the caller should emit a normal call, otherwise try to
3693 get the result in TARGET, if convenient. If ENDP is 0 return the
3694 destination pointer, if ENDP is 1 return the end pointer ala
3695 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3696 stpcpy. */
3698 static rtx
3700 {
3702 rtx dest_mem;
3703 rtx src_mem;
3711 {
3714 }
3723 {
3725 /* movstr is supposed to set end to the address of the NUL
3726 terminator. If the caller requested a mempcpy-like return value,
3727 adjust it. */
3729 {
3733 }
3734 }
3736 }
3738 /* Do some very basic size validation of a call to the strcpy builtin
3739 given by EXP. Return NULL_RTX to have the built-in expand to a call
3740 to the library function. */
3742 static rtx
3744 {
3752 /* There is no way here to determine the length of the string in
3753 the destination to which the SRC string is being appended so
3754 just diagnose cases when the souce string is longer than
3755 the destination object. */
3760 destsize);
3763 }
3765 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3766 NULL_RTX if we failed the caller should emit a normal call, otherwise
3767 try to get the result in TARGET, if convenient (and in mode MODE if that's
3768 convenient). */
3770 static rtx
3772 {
3780 {
3784 }
3787 }
3789 /* Helper function to do the actual work for expand_builtin_strcpy. The
3790 arguments to the builtin_strcpy call DEST and SRC are broken out
3791 so that this can also be called without constructing an actual CALL_EXPR.
3792 The other arguments and return value are the same as for
3793 expand_builtin_strcpy. */
3795 static rtx
3797 {
3799 }
3801 /* Expand a call EXP to the stpcpy builtin.
3802 Return NULL_RTX if we failed the caller should emit a normal call,
3803 otherwise try to get the result in TARGET, if convenient (and in
3804 mode MODE if that's convenient). */
3806 static rtx
3808 {
3819 {
3823 }
3825 /* If return value is ignored, transform stpcpy into strcpy. */
3827 {
3831 }
3832 else
3833 {
3835 rtx ret;
3837 /* Ensure we get an actual string whose length can be evaluated at
3838 compile-time, not an expression containing a string. This is
3839 because the latter will potentially produce pessimized code
3840 when used to produce the return value. */
3852 {
3856 {
3860 {
3862 {
3865 else
3867 }
3876 }
3877 }
3878 }
3881 }
3882 }
3884 /* Check a call EXP to the stpncpy built-in for validity.
3885 Return NULL_RTX on both success and failure. */
3887 static rtx
3889 {
3895 /* The source and destination of the call. */
3899 /* The exact number of bytes to write (not the maximum). */
3902 /* The size of the destination object. */
3908 }
3910 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3911 bytes from constant string DATA + OFFSET and return it as target
3912 constant. */
3914 rtx
3916 scalar_int_mode mode)
3917 {
3924 }
3926 /* Helper to check the sizes of sequences and the destination of calls
3927 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3928 success (no overflow or invalid sizes), false otherwise. */
3930 static bool
3932 {
3937 /* Try to determine the range of lengths that the source expression
3938 refers to. */
3942 /* Try to verify that the destination is big enough for the shortest
3943 string. */
3946 {
3947 /* If it hasn't been provided by __strncat_chk, try to determine
3948 the size of the destination object into which the source is
3949 being copied. */
3951 }
3953 /* Add one for the terminating nul. */
3956 size_one_node)
3959 /* The strncat function copies at most MAXREAD bytes and always appends
3960 the terminating nul so the specified upper bound should never be equal
3961 to (or greater than) the size of the destination. */
3964 {
3973 }
3981 /* The number of bytes to write is LEN but check_access will also
3982 check SRCLEN if LEN's value isn't known. */
3984 objsize);
3985 }
3987 /* Similar to expand_builtin_strcat, do some very basic size validation
3988 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3989 the built-in expand to a call to the library function. */
3991 static rtx
3993 {
4001 /* The upper bound on the number of bytes to write. */
4003 /* The length of the source sequence. */
4006 /* Try to determine the range of lengths that the source expression
4007 refers to. */
4011 else
4014 /* Try to verify that the destination is big enough for the shortest
4015 string. First try to determine the size of the destination object
4016 into which the source is being copied. */
4019 /* Add one for the terminating nul. */
4022 size_one_node)
4025 /* The strncat function copies at most MAXREAD bytes and always appends
4026 the terminating nul so the specified upper bound should never be equal
4027 to (or greater than) the size of the destination. */
4030 {
4039 }
4047 /* The number of bytes to write is SRCLEN. */
4051 }
4053 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4054 NULL_RTX if we failed the caller should emit a normal call. */
4056 static rtx
4058 {
4063 {
4066 /* The number of bytes to write (not the maximum). */
4068 /* The length of the source sequence. */
4072 {
4076 /* The number of bytes to write is LEN but check_access will also
4077 check SLEN if LEN's value isn't known. */
4079 destsize);
4080 }
4082 /* We must be passed a constant len and src parameter. */
4088 /* We're required to pad with trailing zeros if the requested
4089 len is greater than strlen(s2)+1. In that case try to
4090 use store_by_pieces, if it fails, punt. */
4092 {
4095 rtx dest_mem;
4099 builtin_strncpy_read_str,
4106 builtin_strncpy_read_str,
4111 }
4112 }
4114 }
4116 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4117 bytes from constant string DATA + OFFSET and return it as target
4118 constant. */
4120 rtx
4122 scalar_int_mode mode)
4123 {
4130 }
4132 /* Callback routine for store_by_pieces. Return the RTL of a register
4133 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4134 char value given in the RTL register data. For example, if mode is
4135 4 bytes wide, return the RTL for 0x01010101*data. */
4137 static rtx
4139 scalar_int_mode mode)
4140 {
4156 }
4158 /* Expand expression EXP, which is a call to the memset builtin. Return
4159 NULL_RTX if we failed the caller should emit a normal call, otherwise
4160 try to get the result in TARGET, if convenient (and in mode MODE if that's
4161 convenient). */
4163 static rtx
4165 {
4177 }
4179 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4180 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4181 try to get the result in TARGET, if convenient (and in mode MODE if that's
4182 convenient). */
4184 static rtx
4186 {
4191 else
4192 {
4198 /* Return src bounds with the result. */
4200 {
4204 }
4206 }
4207 }
4209 /* Helper function to do the actual work for expand_builtin_memset. The
4210 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4211 so that this can also be called without constructing an actual CALL_EXPR.
4212 The other arguments and return value are the same as for
4213 expand_builtin_memset. */
4215 static rtx
4218 {
4221 machine_mode val_mode;
4233 /* If DEST is not a pointer type, don't do this operation in-line. */
4244 /* If the LEN parameter is zero, return DEST. */
4246 {
4247 /* Evaluate and ignore VAL in case it has side-effects. */
4250 }
4252 /* Stabilize the arguments in case we fail. */
4264 {
4265 rtx val_rtx;
4270 /* Assume that we can memset by pieces if we can store
4271 * the coefficients by pieces (in the required modes).
4272 * We can't pass builtin_memset_gen_str as that emits RTL. */
4278 {
4283 }
4287 probable_max_size))
4293 }
4299 {
4310 probable_max_size))
4316 }
4324 probable_max_size);
4327 {
4330 }
4334 do_libcall:
4344 else
4349 }
4351 /* Expand expression EXP, which is a call to the bzero builtin. Return
4352 NULL_RTX if we failed the caller should emit a normal call. */
4354 static rtx
4356 {
4365 /* New argument list transforming bzero(ptr x, int y) to
4366 memset(ptr x, int 0, size_t y). This is done this way
4367 so that if it isn't expanded inline, we fallback to
4368 calling bzero instead of memset. */
4376 }
4378 /* Try to expand cmpstr operation ICODE with the given operands.
4379 Return the result rtx on success, otherwise return null. */
4381 static rtx
4383 HOST_WIDE_INT align)
4384 {
4398 }
4400 /* Expand expression EXP, which is a call to the memcmp built-in function.
4401 Return NULL_RTX if we failed and the caller should emit a normal call,
4402 otherwise try to get the result in TARGET, if convenient.
4403 RESULT_EQ is true if we can relax the returned value to be either zero
4404 or nonzero, without caring about the sign. */
4406 static rtx
4408 {
4417 /* Diagnose calls where the specified length exceeds the size of either
4418 object. */
4420 {
4424 {
4428 }
4429 }
4437 /* If we don't have POINTER_TYPE, call the function. */
4445 /* Set MEM_SIZE as appropriate. */
4447 {
4450 }
4456 {
4460 }
4462 /* If SRC is a string constant and block move would be done
4463 by pieces, we can avoid loading the string from memory
4464 and only stored the computed constants. */
4476 {
4477 /* Return the value in the proper mode for this function. */
4482 {
4485 }
4488 }
4491 }
4493 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4494 if we failed the caller should emit a normal call, otherwise try to get
4495 the result in TARGET, if convenient. */
4497 static rtx
4499 {
4514 /* If we don't have POINTER_TYPE, call the function. */
4518 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4526 /* Try to call cmpstrsi. */
4531 /* Try to determine at least one length and call cmpstrnsi. */
4533 {
4534 tree len;
4535 rtx arg3_rtx;
4545 /* If we don't have a constant length for the first, use the length
4546 of the second, if we know it. We don't require a constant for
4547 this case; some cost analysis could be done if both are available
4548 but neither is constant. For now, assume they're equally cheap,
4549 unless one has side effects. If both strings have constant lengths,
4550 use the smaller. */
4566 else
4569 /* If both arguments have side effects, we cannot optimize. */
4571 {
4573 result = expand_cmpstrn_or_cmpmem
4576 }
4577 }
4579 /* Check to see if the argument was declared attribute nonstring
4580 and if so, issue a warning since at this point it's not known
4581 to be nul-terminated. */
4586 {
4587 /* Return the value in the proper mode for this function. */
4595 }
4597 /* Expand the library call ourselves using a stabilized argument
4598 list to avoid re-evaluating the function's arguments twice. */
4603 }
4605 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4606 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4607 the result in TARGET, if convenient. */
4609 static rtx
4611 ATTRIBUTE_UNUSED machine_mode mode)
4612 {
4617 /* If c_strlen can determine an expression for one of the string
4618 lengths, and it doesn't have side effects, then emit cmpstrnsi
4619 using length MIN(strlen(string)+1, arg3). */
4624 tree len;
4645 /* If we don't have a constant length for the first, use the length
4646 of the second, if we know it. If neither string is constant length,
4647 use the given length argument. We don't require a constant for
4648 this case; some cost analysis could be done if both are available
4649 but neither is constant. For now, assume they're equally cheap,
4650 unless one has side effects. If both strings have constant lengths,
4651 use the smaller. */
4669 else
4672 /* If we are not using the given length, we must incorporate it here.
4673 The actual new length parameter will be MIN(len,arg3) in this case. */
4683 /* Check to see if the argument was declared attribute nonstring
4684 and if so, issue a warning since at this point it's not known
4685 to be nul-terminated. */
4690 {
4691 /* Return the value in the proper mode for this function. */
4699 }
4701 /* Expand the library call ourselves using a stabilized argument
4702 list to avoid re-evaluating the function's arguments twice. */
4707 }
4709 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4710 if that's convenient. */
4712 rtx
4714 {
4715 rtx val;
4718 /* Don't do __builtin_saveregs more than once in a function.
4719 Save the result of the first call and reuse it. */
4723 /* When this function is called, it means that registers must be
4724 saved on entry to this function. So we migrate the call to the
4725 first insn of this function. */
4729 /* Do whatever the machine needs done in this case. */
4737 /* Put the insns after the NOTE that starts the function. If this
4738 is inside a start_sequence, make the outer-level insn chain current, so
4739 the code is placed at the start of the function. */
4745 }
4747 /* Expand a call to __builtin_next_arg. */
4749 static rtx
4751 {
4752 /* Checking arguments is already done in fold_builtin_next_arg
4753 that must be called before this function. */
4758 }
4760 /* Make it easier for the backends by protecting the valist argument
4761 from multiple evaluations. */
4763 static tree
4765 {
4768 /* The current way of determining the type of valist is completely
4769 bogus. We should have the information on the va builtin instead. */
4774 {
4778 /* For this case, the backends will be expecting a pointer to
4779 vatype, but it's possible we've actually been given an array
4780 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4781 So fix it. */
4783 {
4786 }
4787 }
4788 else
4789 {
4793 {
4799 }
4805 }
4808 }
4810 /* The "standard" definition of va_list is void*. */
4812 tree
4814 {
4816 }
4818 /* The "standard" abi va_list is va_list_type_node. */
4820 tree
4822 {
4824 }
4826 /* The "standard" type of va_list is va_list_type_node. */
4828 tree
4830 {
4837 {
4838 /* If va_list is an array type, the argument may have decayed
4839 to a pointer type, e.g. by being passed to another function.
4840 In that case, unwrap both types so that we can compare the
4841 underlying records. */
4844 {
4847 }
4848 }
4853 }
4855 /* The "standard" implementation of va_start: just assign `nextarg' to
4856 the variable. */
4858 void
4860 {
4864 /* We do not have any valid bounds for the pointer, so
4865 just store zero bounds for it. */
4869 nextarg));
4870 }
4872 /* Expand EXP, a call to __builtin_va_start. */
4874 static rtx
4876 {
4877 rtx nextarg;
4878 tree valist;
4882 {
4885 }
4895 else
4899 }
4901 /* Expand EXP, a call to __builtin_va_end. */
4903 static rtx
4905 {
4908 /* Evaluate for side effects, if needed. I hate macros that don't
4909 do that. */
4914 }
4916 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4917 builtin rather than just as an assignment in stdarg.h because of the
4918 nastiness of array-type va_list types. */
4920 static rtx
4922 {
4935 {
4939 }
4940 else
4941 {
4944 /* Evaluate to pointers. */
4953 /* "Dereference" to BLKmode memories. */
4961 /* Copy. */
4963 }
4966 }
4968 /* Expand a call to one of the builtin functions __builtin_frame_address or
4969 __builtin_return_address. */
4971 static rtx
4973 {
4974 /* The argument must be a nonnegative integer constant.
4975 It counts the number of frames to scan up the stack.
4976 The value is either the frame pointer value or the return
4977 address saved in that frame. */
4979 /* Warning about missing arg was already issued. */
4982 {
4985 }
4986 else
4987 {
4988 /* Number of frames to scan up the stack. */
4993 /* Some ports cannot access arbitrary stack frames. */
4995 {
4998 }
5001 {
5002 /* Warn since no effort is made to ensure that any frame
5003 beyond the current one exists or can be safely reached. */
5006 }
5008 /* For __builtin_frame_address, return what we've got. */
5016 }
5017 }
5019 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5020 failed and the caller should emit a normal call. */
5022 static rtx
5024 {
5025 rtx op0;
5026 rtx result;
5029 HOST_WIDE_INT max_size;
5032 bool valid_arglist
5035 VOID_TYPE)
5045 {
5046 /* -Walloca-larger-than and -Wvla-larger-than settings override
5047 the more general -Walloc-size-larger-than so unless either of
5048 the former options is specified check the alloca arguments for
5049 overflow. */
5053 }
5055 /* Compute the argument. */
5058 /* Compute the alignment. */
5060 ? BIGGEST_ALIGNMENT
5063 /* Compute the maximum size. */
5068 /* Allocate the desired space. If the allocation stems from the declaration
5069 of a variable-sized object, it cannot accumulate. */
5070 result
5075 }
5077 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5078 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5079 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5080 handle_builtin_stack_restore function. */
5082 static rtx
5084 {
5091 OPTAB_LIB_WIDEN);
5094 OPTAB_LIB_WIDEN);
5099 }
5101 /* Expand a call to bswap builtin in EXP.
5102 Return NULL_RTX if a normal call should be emitted rather than expanding the
5103 function in-line. If convenient, the result should be placed in TARGET.
5104 SUBTARGET may be used as the target for computing one of EXP's operands. */
5106 static rtx
5108 rtx subtarget)
5109 {
5110 tree arg;
5111 rtx op0;
5129 }
5131 /* Expand a call to a unary builtin in EXP.
5132 Return NULL_RTX if a normal call should be emitted rather than expanding the
5133 function in-line. If convenient, the result should be placed in TARGET.
5134 SUBTARGET may be used as the target for computing one of EXP's operands. */
5136 static rtx
5139 {
5140 rtx op0;
5145 /* Compute the argument. */
5147 (subtarget
5151 /* Compute op, into TARGET if possible.
5152 Set TARGET to wherever the result comes back. */
5158 }
5160 /* Expand a call to __builtin_expect. We just return our argument
5161 as the builtin_expect semantic should've been already executed by
5162 tree branch prediction pass. */
5164 static rtx
5166 {
5167 tree arg;
5174 /* When guessing was done, the hints should be already stripped away. */
5178 }
5180 /* Expand a call to __builtin_assume_aligned. We just return our first
5181 argument as the builtin_assume_aligned semantic should've been already
5182 executed by CCP. */
5184 static rtx
5186 {
5190 EXPAND_NORMAL);
5195 }
5197 void
5199 {
5201 {
5203 /* For trap insns when not accumulating outgoing args force
5204 REG_ARGS_SIZE note to prevent crossjumping of calls with
5205 different args sizes. */
5208 }
5209 else
5210 {
5214 }
5217 }
5219 /* Expand a call to __builtin_unreachable. We do nothing except emit
5220 a barrier saying that control flow will not pass here.
5222 It is the responsibility of the program being compiled to ensure
5223 that control flow does never reach __builtin_unreachable. */
5224 static void
5226 {
5228 }
5230 /* Expand EXP, a call to fabs, fabsf or fabsl.
5231 Return NULL_RTX if a normal call should be emitted rather than expanding
5232 the function inline. If convenient, the result should be placed
5233 in TARGET. SUBTARGET may be used as the target for computing
5234 the operand. */
5236 static rtx
5238 {
5239 machine_mode mode;
5240 tree arg;
5241 rtx op0;
5251 }
5253 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5254 Return NULL is a normal call should be emitted rather than expanding the
5255 function inline. If convenient, the result should be placed in TARGET.
5256 SUBTARGET may be used as the target for computing the operand. */
5258 static rtx
5260 {
5262 tree arg;
5274 }
5276 /* Expand a call to __builtin___clear_cache. */
5278 static rtx
5280 {
5282 {
5283 #ifdef CLEAR_INSN_CACHE
5284 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5285 does something. Just do the default expansion to a call to
5286 __clear_cache(). */
5288 #else
5289 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5290 does nothing. There is no need to call it. Do nothing. */
5293 }
5295 /* We have a "clear_cache" insn, and it will handle everything. */
5299 /* We must not expand to a library call. If we did, any
5300 fallback library function in libgcc that might contain a call to
5301 __builtin___clear_cache() would recurse infinitely. */
5303 {
5306 }
5309 {
5322 }
5324 }
5326 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5328 static rtx
5330 {
5333 /* If we don't need too much alignment, we'll have been guaranteed
5334 proper alignment by get_trampoline_type. */
5338 /* Round address up to desired boundary. */
5349 }
5351 static rtx
5353 {
5369 /* If ONSTACK, the TRAMP argument should be the address of a field
5370 within the local function's FRAME decl. Either way, let's see if
5371 we can fill in the MEM_ATTRs for this memory. */
5375 /* Creator of a heap trampoline is responsible for making sure the
5376 address is aligned to at least STACK_BOUNDARY. Normally malloc
5377 will ensure this anyhow. */
5380 {
5384 }
5386 /* The FUNC argument should be the address of the nested function.
5387 Extract the actual function decl to pass to the hook. */
5394 /* Generate insns to initialize the trampoline. */
5398 {
5404 }
5407 }
5409 static rtx
5411 {
5412 rtx tramp;
5423 }
5425 /* Expand a call to the builtin descriptor initialization routine.
5426 A descriptor is made up of a couple of pointers to the static
5427 chain and the code entry in this order. */
5429 static rtx
5431 {
5436 VOID_TYPE))
5450 /* Generate insns to initialize the descriptor. */
5456 }
5458 /* Expand a call to the builtin descriptor adjustment routine. */
5460 static rtx
5462 {
5463 rtx tramp;
5470 /* Unalign the descriptor to allow runtime identification. */
5475 }
5477 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5478 function. The function first checks whether the back end provides
5479 an insn to implement signbit for the respective mode. If not, it
5480 checks whether the floating point format of the value is such that
5481 the sign bit can be extracted. If that is not the case, error out.
5482 EXP is the expression that is a call to the builtin function; if
5483 convenient, the result should be placed in TARGET. */
5484 static rtx
5486 {
5488 scalar_float_mode fmode;
5490 tree arg;
5493 rtx temp;
5506 /* Expand the argument yielding a RTX expression. */
5509 /* Check if the back end provides an insn that handles signbit for the
5510 argument's mode. */
5513 {
5519 }
5521 /* For floating point formats without a sign bit, implement signbit
5522 as "ARG < 0.0". */
5525 {
5526 /* But we can't do this if the format supports signed zero. */
5532 }
5535 {
5538 }
5539 else
5540 {
5542 /* Handle targets with different FP word orders. */
5545 else
5549 }
5551 /* Force the intermediate word_mode (or narrower) result into a
5552 register. This avoids attempting to create paradoxical SUBREGs
5553 of floating point modes below. */
5556 /* If the bitpos is within the "result mode" lowpart, the operation
5557 can be implement with a single bitwise AND. Otherwise, we need
5558 a right shift and an AND. */
5561 {
5569 }
5570 else
5571 {
5572 /* Perform a logical right shift to place the signbit in the least
5573 significant bit, then truncate the result to the desired mode
5574 and mask just this bit. */
5579 }
5582 }
5584 /* Expand fork or exec calls. TARGET is the desired target of the
5585 call. EXP is the call. FN is the
5586 identificator of the actual function. IGNORE is nonzero if the
5587 value is to be ignored. */
5589 static rtx
5591 {
5593 tree call;
5595 /* If we are not profiling, just call the function. */
5599 /* Otherwise call the wrapper. This should be equivalent for the rest of
5600 compiler, so the code does not diverge, and the wrapper may run the
5601 code necessary for keeping the profiling sane. */
5604 {
5635 }
5647 }
5650 \f
5651 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5652 the pointer in these functions is void*, the tree optimizers may remove
5653 casts. The mode computed in expand_builtin isn't reliable either, due
5654 to __sync_bool_compare_and_swap.
5656 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5657 group of builtins. This gives us log2 of the mode size. */
5661 {
5662 /* The size is not negotiable, so ask not to get BLKmode in return
5663 if the target indicates that a smaller size would be better. */
5665 }
5667 /* Expand the memory expression LOC and return the appropriate memory operand
5668 for the builtin_sync operations. */
5670 static rtx
5672 {
5678 /* Note that we explicitly do not want any alias information for this
5679 memory, so that we kill all other live memories. Otherwise we don't
5680 satisfy the full barrier semantics of the intrinsic. */
5683 /* The alignment needs to be at least according to that of the mode. */
5690 }
5692 /* Make sure an argument is in the right mode.
5693 EXP is the tree argument.
5694 MODE is the mode it should be in. */
5696 static rtx
5698 {
5699 rtx val;
5700 machine_mode old_mode;
5703 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5704 of CONST_INTs, where we know the old_mode only from the call argument. */
5711 }
5714 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5715 EXP is the CALL_EXPR. CODE is the rtx code
5716 that corresponds to the arithmetic or logical operation from the name;
5717 an exception here is that NOT actually means NAND. TARGET is an optional
5718 place for us to store the results; AFTER is true if this is the
5719 fetch_and_xxx form. */
5721 static rtx
5724 rtx target)
5725 {
5730 {
5737 {
5766 }
5767 }
5769 /* Expand the operands. */
5774 after);
5775 }
5777 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5778 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5779 true if this is the boolean form. TARGET is a place for us to store the
5780 results; this is NOT optional if IS_BOOL is true. */
5782 static rtx
5785 {
5789 /* Expand the operands. */
5796 {
5799 else
5801 }
5804 MEMMODEL_SYNC_SEQ_CST))
5808 }
5810 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5811 general form is actually an atomic exchange, and some targets only
5812 support a reduced form with the second argument being a constant 1.
5813 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5814 the results. */
5816 static rtx
5818 rtx target)
5819 {
5822 /* Expand the operands. */
5827 }
5829 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5831 static void
5833 {
5834 rtx mem;
5836 /* Expand the operands. */
5840 }
5842 /* Given an integer representing an ``enum memmodel'', verify its
5843 correctness and return the memory model enum. */
5845 static enum memmodel
5847 {
5848 rtx op;
5850 source_location loc
5853 /* If the parameter is not a constant, it's a run time value so we'll just
5854 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5864 {
5868 }
5870 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5872 {
5876 }
5878 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5879 be conservative and promote consume to acquire. */
5884 }
5886 /* Expand the __atomic_exchange intrinsic:
5887 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5888 EXP is the CALL_EXPR.
5889 TARGET is an optional place for us to store the results. */
5891 static rtx
5893 {
5902 /* Expand the operands. */
5907 }
5909 /* Expand the __atomic_compare_exchange intrinsic:
5910 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5911 TYPE desired, BOOL weak,
5912 enum memmodel success,
5913 enum memmodel failure)
5914 EXP is the CALL_EXPR.
5915 TARGET is an optional place for us to store the results. */
5917 static rtx
5919 rtx target)
5920 {
5924 tree weak;
5926 source_location loc
5933 {
5935 "failure memory model cannot be stronger than success "
5938 }
5941 {
5943 "invalid failure memory model for "
5947 }
5953 /* Expand the operands. */
5969 /* Lest the rtl backend create a race condition with an imporoper store
5970 to memory, always create a new pseudo for OLDVAL. */
5977 /* Conditionally store back to EXPECT, lest we create a race condition
5978 with an improper store to memory. */
5979 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5980 the normal case where EXPECT is totally private, i.e. a register. At
5981 which point the store can be unconditional. */
5989 }
5991 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5992 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5993 call. The weak parameter must be dropped to match the expected parameter
5994 list and the expected argument changed from value to pointer to memory
5995 slot. */
5997 static void
5999 {
6015 /* Skip the boolean weak parameter. */
6018 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6021 built_in_function fncode
6026 fndecl);
6031 {
6038 }
6039 }
6041 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6043 void
6045 {
6051 tree lhs;
6053 source_location loc
6060 {
6062 "failure memory model cannot be stronger than success "
6065 }
6068 {
6070 "invalid failure memory model for "
6074 }
6077 {
6080 }
6082 /* Expand the operands. */
6095 {
6098 }
6102 {
6108 }
6109 }
6111 /* Expand the __atomic_load intrinsic:
6112 TYPE __atomic_load (TYPE *object, enum memmodel)
6113 EXP is the CALL_EXPR.
6114 TARGET is an optional place for us to store the results. */
6116 static rtx
6118 {
6119 rtx mem;
6124 {
6125 source_location loc
6130 }
6135 /* Expand the operand. */
6139 }
6142 /* Expand the __atomic_store intrinsic:
6143 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6144 EXP is the CALL_EXPR.
6145 TARGET is an optional place for us to store the results. */
6147 static rtx
6149 {
6156 {
6157 source_location loc
6162 }
6167 /* Expand the operands. */
6172 }
6174 /* Expand the __atomic_fetch_XXX intrinsic:
6175 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6176 EXP is the CALL_EXPR.
6177 TARGET is an optional place for us to store the results.
6178 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6179 FETCH_AFTER is true if returning the result of the operation.
6180 FETCH_AFTER is false if returning the value before the operation.
6181 IGNORE is true if the result is not used.
6182 EXT_CALL is the correct builtin for an external call if this cannot be
6183 resolved to an instruction sequence. */
6185 static rtx
6189 {
6192 tree fndecl;
6193 tree addr;
6197 /* Expand the operands. */
6201 /* Only try generating instructions if inlining is turned on. */
6203 {
6207 }
6209 /* Return if a different routine isn't needed for the library call. */
6213 /* Change the call to the specified function. */
6221 /* If we will emit code after the call, the call can not be a tail call.
6222 If it is emitted as a tail call, a barrier is emitted after it, and
6223 then all trailing code is removed. */
6227 /* Expand the call here so we can emit trailing code. */
6230 /* Replace the original function just in case it matters. */
6233 /* Then issue the arithmetic correction to return the right result. */
6235 {
6237 {
6239 OPTAB_LIB_WIDEN);
6241 }
6242 else
6244 OPTAB_LIB_WIDEN);
6245 }
6247 }
6249 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6251 void
6253 {
6261 optab optab;
6273 {
6288 }
6291 {
6298 }
6320 {
6325 }
6326 else
6328 OPTAB_DIRECT);
6331 }
6333 /* Expand an atomic clear operation.
6334 void _atomic_clear (BOOL *obj, enum memmodel)
6335 EXP is the call expression. */
6337 static rtx
6339 {
6340 machine_mode mode;
6349 {
6350 source_location loc
6355 }
6357 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6358 Failing that, a store is issued by __atomic_store. The only way this can
6359 fail is if the bool type is larger than a word size. Unlikely, but
6360 handle it anyway for completeness. Assume a single threaded model since
6361 there is no atomic support in this case, and no barriers are required. */
6366 }
6368 /* Expand an atomic test_and_set operation.
6369 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6370 EXP is the call expression. */
6372 static rtx
6374 {
6375 rtx mem;
6377 machine_mode mode;
6384 }
6387 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6388 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6390 static tree
6392 {
6394 machine_mode mode;
6400 /* We need a corresponding integer mode for the access to be lock-free. */
6408 {
6411 /* Either this argument is null, or it's a fake pointer encoding
6412 the alignment of the object. */
6418 else
6420 }
6421 else
6422 {
6425 /* This function is usually invoked and folded immediately by the front
6426 end before anything else has a chance to look at it. The pointer
6427 parameter at this point is usually cast to a void *, so check for that
6428 and look past the cast. */
6438 /* Get the underlying type of the object. */
6441 }
6443 /* If the object has smaller alignment, the lock free routines cannot
6444 be used. */
6448 /* Check if a compare_and_swap pattern exists for the mode which represents
6449 the required size. The pattern is not allowed to fail, so the existence
6450 of the pattern indicates support is present. Also require that an
6451 atomic load exists for the required size. */
6454 else
6456 }
6458 /* Return true if the parameters to call EXP represent an object which will
6459 always generate lock free instructions. The first argument represents the
6460 size of the object, and the second parameter is a pointer to the object
6461 itself. If NULL is passed for the object, then the result is based on
6462 typical alignment for an object of the specified size. Otherwise return
6463 false. */
6465 static rtx
6467 {
6468 tree size;
6473 {
6476 }
6482 }
6484 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6485 is lock free on this architecture. */
6487 static tree
6489 {
6493 /* If it isn't always lock free, don't generate a result. */
6498 }
6500 /* Return true if the parameters to call EXP represent an object which will
6501 always generate lock free instructions. The first argument represents the
6502 size of the object, and the second parameter is a pointer to the object
6503 itself. If NULL is passed for the object, then the result is based on
6504 typical alignment for an object of the specified size. Otherwise return
6505 NULL*/
6507 static rtx
6509 {
6510 tree size;
6515 {
6518 }
6523 /* If the value is known at compile time, return the RTX for it. */
6529 }
6531 /* Expand the __atomic_thread_fence intrinsic:
6532 void __atomic_thread_fence (enum memmodel)
6533 EXP is the CALL_EXPR. */
6535 static void
6537 {
6540 }
6542 /* Expand the __atomic_signal_fence intrinsic:
6543 void __atomic_signal_fence (enum memmodel)
6544 EXP is the CALL_EXPR. */
6546 static void
6548 {
6551 }
6553 /* Expand the __sync_synchronize intrinsic. */
6555 static void
6557 {
6559 }
6561 static rtx
6563 {
6569 {
6571 /* If the target is not sutitable then create a new target. */
6579 }
6582 }
6584 static void
6586 {
6592 {
6599 }
6601 }
6603 \f
6604 /* Emit code to restore the current value of stack. */
6606 static void
6608 {
6620 }
6622 /* Emit code to save the current value of stack. */
6624 static rtx
6626 {
6631 }
6633 /* Emit code to get the openacc gang, worker or vector id or size. */
6635 static rtx
6637 {
6639 rtx fallback_retval;
6642 {
6655 }
6658 {
6661 }
6665 {
6668 }
6672 {
6680 }
6689 {
6692 }
6700 }
6702 /* Expand an expression EXP that calls a built-in function,
6703 with result going to TARGET if that's convenient
6704 (and in mode MODE if that's convenient).
6705 SUBTARGET may be used as the target for computing one of EXP's operands.
6706 IGNORE is nonzero if the value is to be ignored. */
6708 rtx
6711 {
6720 /* When ASan is enabled, we don't want to expand some memory/string
6721 builtins and rely on libsanitizer's hooks. This allows us to avoid
6722 redundant checks and be sure, that possible overflow will be detected
6723 by ASan. */
6728 /* When not optimizing, generate calls to library functions for a certain
6729 set of builtins. */
6755 /* The built-in function expanders test for target == const0_rtx
6756 to determine whether the function's result will be ignored. */
6760 /* If the result of a pure or const built-in function is ignored, and
6761 none of its arguments are volatile, we can avoid expanding the
6762 built-in call and just evaluate the arguments for side-effects. */
6766 {
6768 tree arg;
6769 call_expr_arg_iterator iter;
6773 {
6776 }
6779 {
6783 }
6784 }
6786 /* expand_builtin_with_bounds is supposed to be used for
6787 instrumented builtin calls. */
6791 {
6809 /* Just do a normal library call if we were unable to fold
6810 the values. */
6887 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6888 FUNCTION with a copy of the parameters described by
6889 ARGUMENTS, and ARGSIZE. It returns a block of memory
6890 allocated on the stack into which is stored all the registers
6891 that might possibly be used for returning the result of a
6892 function. ARGUMENTS is the value returned by
6893 __builtin_apply_args. ARGSIZE is the number of bytes of
6894 arguments that must be copied. ??? How should this value be
6895 computed? We'll also need a safe worst case value for varargs
6896 functions. */
6903 else
6904 {
6912 }
6914 /* __builtin_return (RESULT) causes the function to return the
6915 value described by RESULT. RESULT is address of the block of
6916 memory returned by __builtin_apply. */
6926 /* All valid uses of __builtin_va_arg_pack () are removed during
6927 inlining. */
6932 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6933 inlining. */
6937 /* Return the address of the first anonymous stack arg. */
6959 /* Returns the address of the area where the structure is returned.
6960 0 otherwise. */
6966 else
6969 CASE_BUILT_IN_ALLOCA:
7132 {
7135 }
7139 /* This should have been lowered to the builtins below. */
7143 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7144 and the receiver label. */
7146 {
7152 /* This is copied from the handling of non-local gotos. */
7154 nonlocal_goto_handler_labels
7156 nonlocal_goto_handler_labels);
7157 /* ??? Do not let expand_label treat us as such since we would
7158 not want to be both on the list of non-local labels and on
7159 the list of forced labels. */
7162 }
7166 /* __builtin_setjmp_receiver is passed the receiver label. */
7168 {
7174 }
7177 /* __builtin_longjmp is passed a pointer to an array of five words.
7178 It's similar to the C library longjmp function but works with
7179 __builtin_setjmp above. */
7182 {
7188 {
7191 }
7195 }
7204 /* This updates the setjmp buffer that is its argument with the value
7205 of the current stack pointer. */
7208 {
7209 rtx buf_addr
7214 }
7234 /* Various hooks for the DWARF 2 __throw routine. */
7240 #ifdef DWARF2_UNWIND_INFO
7246 #endif
7446 mode = get_builtin_sync_mode
7458 mode = get_builtin_sync_mode
7505 {
7509 mode =
7515 /* If this is turned into an external library call, the weak parameter
7516 must be dropped to match the expected parameter list. */
7521 /* Skip the boolean weak parameter. */
7526 }
7555 {
7565 }
7571 {
7581 }
7587 {
7597 }
7603 {
7613 }
7619 {
7629 }
7635 {
7645 }
7792 /* We allow user CHKP builtins if Pointer Bounds
7793 Checker is off. */
7795 {
7806 else
7808 }
7809 /* FALLTHROUGH */
7821 /* Software implementation of Pointer Bounds Checker is NYI.
7822 Target support is required. */
7827 /* Do library call, if we failed to expand the builtin when
7828 folding. */
7837 }
7839 /* The switch statement above can drop through to cause the function
7840 to be called normally. */
7842 }
7844 /* Similar to expand_builtin but is used for instrumented calls. */
7846 rtx
7848 rtx subtarget ATTRIBUTE_UNUSED,
7850 {
7863 {
7886 {
7887 /* memcpy_chkp (void *dst, size_t dstbnd,
7888 const void *src, size_t srcbnd, size_t n)
7889 and others take a pointer bound argument just after each
7890 pointer argument. */
7897 }
7901 }
7903 /* The switch statement above can drop through to cause the function
7904 to be called normally. */
7906 }
7908 /* Determine whether a tree node represents a call to a built-in
7909 function. If the tree T is a call to a built-in function with
7910 the right number of arguments of the appropriate types, return
7911 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7912 Otherwise the return value is END_BUILTINS. */
7914 enum built_in_function
7916 {
7919 const_call_expr_arg_iterator iter;
7934 {
7935 /* If a function doesn't take a variable number of arguments,
7936 the last element in the list will have type `void'. */
7939 {
7943 }
7952 {
7955 }
7957 {
7960 }
7962 {
7965 }
7967 {
7970 }
7971 else
7973 }
7975 /* Variable-length argument list. */
7977 }
7979 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7980 evaluate to a constant. */
7982 static tree
7984 {
7985 /* We return 1 for a numeric type that's known to be a constant
7986 value at compile-time or for an aggregate type that's a
7987 literal constant. */
7990 /* If we know this is a constant, emit the constant of one. */
7996 {
8003 }
8005 /* If this expression has side effects, show we don't know it to be a
8006 constant. Likewise if it's a pointer or aggregate type since in
8007 those case we only want literals, since those are only optimized
8008 when generating RTL, not later.
8009 And finally, if we are compiling an initializer, not code, we
8010 need to return a definite result now; there's not going to be any
8011 more optimization done. */
8016 || folding_initializer
8021 }
8023 /* Create builtin_expect with PRED and EXPECTED as its arguments and
8024 return it as a truthvalue. */
8026 static tree
8028 tree predictor)
8029 {
8041 predictor);
8045 }
8047 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
8048 NULL_TREE if no simplification is possible. */
8050 tree
8052 {
8056 /* Distribute the expected value over short-circuiting operators.
8057 See through the cast from truthvalue_type_node to long. */
8064 /* If this is a builtin_expect within a builtin_expect keep the
8065 inner one. See through a comparison against a constant. It
8066 might have been added to create a thruthvalue. */
8082 {
8092 }
8094 /* If the argument isn't invariant then there's nothing else we can do. */
8098 /* If we expect that a comparison against the argument will fold to
8099 a constant return the constant. In practice, this means a true
8100 constant or the address of a non-weak symbol. */
8104 {
8105 do
8106 {
8108 }
8113 }
8115 /* Otherwise, ARG0 already has the proper type for the return value. */
8117 }
8119 /* Fold a call to __builtin_classify_type with argument ARG. */
8121 static tree
8123 {
8128 }
8130 /* Fold a call to __builtin_strlen with argument ARG. */
8132 static tree
8134 {
8137 else
8138 {
8145 }
8146 }
8148 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8150 static tree
8152 {
8153 REAL_VALUE_TYPE real;
8155 /* __builtin_inff is intended to be usable to define INFINITY on all
8156 targets. If an infinity is not available, INFINITY expands "to a
8157 positive constant of type float that overflows at translation
8158 time", footnote "In this case, using INFINITY will violate the
8159 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8160 Thus we pedwarn to ensure this constraint violation is
8161 diagnosed. */
8167 }
8169 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8170 NULL_TREE if no simplification can be made. */
8172 static tree
8175 {
8176 tree type;
8186 /* Calculate the result when the argument is a constant. */
8191 /* Canonicalize sincos to cexpi. */
8193 {
8196 }
8198 {
8205 }
8214 }
8216 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8217 Return NULL_TREE if no simplification can be made. */
8219 static tree
8221 {
8227 /* If the LEN parameter is zero, return zero. */
8232 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8236 /* If len parameter is one, return an expression corresponding to
8237 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8239 {
8241 tree cst_uchar_ptr_node
8244 tree ind1
8248 cst_uchar_ptr_node,
8249 arg1)));
8250 tree ind2
8254 cst_uchar_ptr_node,
8255 arg2)));
8257 }
8260 }
8262 /* Fold a call to builtin isascii with argument ARG. */
8264 static tree
8266 {
8269 else
8270 {
8271 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8277 }
8278 }
8280 /* Fold a call to builtin toascii with argument ARG. */
8282 static tree
8284 {
8288 /* Transform toascii(c) -> (c & 0x7f). */
8291 }
8293 /* Fold a call to builtin isdigit with argument ARG. */
8295 static tree
8297 {
8300 else
8301 {
8302 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8303 /* According to the C standard, isdigit is unaffected by locale.
8304 However, it definitely is affected by the target character set. */
8305 unsigned HOST_WIDE_INT target_digit0
8316 }
8317 }
8319 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8321 static tree
8323 {
8329 }
8331 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8333 static tree
8335 {
8341 }
8343 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
8345 static tree
8347 {
8348 /* ??? Only expand to FMA_EXPR if it's directly supported. */
8356 }
8358 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8360 static tree
8362 {
8365 {
8369 {
8374 }
8375 }
8378 }
8380 /* Fold a call to builtin frexp, we can assume the base is 2. */
8382 static tree
8384 {
8395 /* Proceed if a valid pointer type was passed in. */
8397 {
8402 {
8404 /* For +-0, return (*exp = 0, +-0). */
8410 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8413 {
8414 /* Since the frexp function always expects base 2, and in
8415 GCC normalized significands are already in the range
8416 [0.5, 1.0), we have exactly what frexp wants. */
8421 }
8425 }
8427 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8431 }
8434 }
8436 /* Fold a call to builtin modf. */
8438 static tree
8440 {
8451 /* Proceed if a valid pointer type was passed in. */
8453 {
8458 {
8461 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8465 /* For +-Inf, return (*arg1 = arg0, +-0). */
8471 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8474 /* If the original number was negative and already
8475 integral, then the fractional part is -0.0. */
8479 }
8481 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8487 }
8490 }
8492 /* Given a location LOC, an interclass builtin function decl FNDECL
8493 and its single argument ARG, return an folded expression computing
8494 the same, or NULL_TREE if we either couldn't or didn't want to fold
8495 (the latter happen if there's an RTL instruction available). */
8497 static tree
8499 {
8500 machine_mode mode;
8512 /* If there is no optab, try generic code. */
8514 {
8515 tree result;
8518 {
8519 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8522 REAL_VALUE_TYPE r;
8526 {
8527 /* NaN and Inf are encoded in the high-order double value
8528 only. The low-order value is not significant. */
8532 }
8539 }
8542 {
8543 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8546 REAL_VALUE_TYPE r;
8550 {
8551 /* NaN and Inf are encoded in the high-order double value
8552 only. The low-order value is not significant. */
8556 }
8562 /*result = fold_build2_loc (loc, UNGT_EXPR,
8563 TREE_TYPE (TREE_TYPE (fndecl)),
8564 fold_build1_loc (loc, ABS_EXPR, type, arg),
8565 build_real (type, r));
8566 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8567 TREE_TYPE (TREE_TYPE (fndecl)),
8568 result);*/
8570 }
8572 {
8573 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8574 islessequal(fabs(x),DBL_MAX). */
8584 {
8585 /* Use double to test the normal range of IBM extended
8586 precision. Emin for IBM extended precision is
8587 different to emin for IEEE double, being 53 higher
8588 since the low double exponent is at least 53 lower
8589 than the high double exponent. */
8593 }
8605 {
8606 /* Testing the high end of the range is done just using
8607 the high double, using the same test as isfinite().
8608 For the subnormal end of the range we first test the
8609 high double, then if its magnitude is equal to the
8610 limit of 0x1p-969, we test whether the low double is
8611 non-zero and opposite sign to the high double. */
8627 integer_type_node,
8633 }
8634 else
8635 {
8636 tree const isge_fn
8639 }
8643 }
8646 }
8649 }
8651 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8652 ARG is the argument for the call. */
8654 static tree
8656 {
8663 {
8671 {
8672 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8673 /* In a boolean context, GCC will fold the inner COND_EXPR to
8674 1. So e.g. "if (isinf_sign(x))" would be folded to just
8675 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8683 {
8696 integer_zero_node);
8697 }
8700 }
8713 {
8716 {
8717 /* NaN and Inf are encoded in the high-order double value
8718 only. The low-order value is not significant. */
8720 }
8721 }
8727 }
8728 }
8730 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8731 This builtin will generate code to return the appropriate floating
8732 point classification depending on the value of the floating point
8733 number passed in. The possible return values must be supplied as
8734 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8735 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8736 one floating point argument which is "type generic". */
8738 static tree
8740 {
8743 machine_mode mode;
8744 REAL_VALUE_TYPE r;
8747 /* Verify the required arguments in the original call. */
8767 /* fpclassify(x) ->
8768 isnan(x) ? FP_NAN :
8769 (fabs(x) == Inf ? FP_INFINITE :
8770 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8771 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8785 {
8791 }
8794 {
8797 }
8800 }
8802 /* Fold a call to an unordered comparison function such as
8803 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8804 being called and ARG0 and ARG1 are the arguments for the call.
8805 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8806 the opposite of the desired result. UNORDERED_CODE is used
8807 for modes that can hold NaNs and ORDERED_CODE is used for
8808 the rest. */
8810 static tree
8814 {
8828 /* Choose the wider of two real types. */
8840 {
8844 }
8849 }
8851 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8852 arithmetics if it can never overflow, or into internal functions that
8853 return both result of arithmetics and overflowed boolean flag in
8854 a complex integer result, or some other check for overflow.
8855 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8856 checking part of that. */
8858 static tree
8861 {
8863 /* The code of the expression corresponding to the type-generic
8864 built-in, or ERROR_MARK for the type-specific ones. */
8869 {
8872 /* FALLTHRU */
8875 /* FALLTHRU */
8886 /* FALLTHRU */
8889 /* FALLTHRU */
8900 /* FALLTHRU */
8903 /* FALLTHRU */
8914 }
8916 /* For the "generic" overloads, the first two arguments can have different
8917 types and the last argument determines the target type to use to check
8918 for overflow. The arguments of the other overloads all have the same
8919 type. */
8922 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8923 arguments are constant, attempt to fold the built-in call into a constant
8924 expression indicating whether or not it detected an overflow. */
8928 /* Perform the computation in the target type and check for overflow. */
8932 arg2);
8946 tree store
8949 }
8951 /* Fold a call to __builtin_FILE to a constant string. */
8955 {
8957 {
8958 /* The documentation says this builtin is equivalent to the preprocessor
8959 __FILE__ macro so it appears appropriate to use the same file prefix
8960 mappings. */
8963 }
8966 }
8968 /* Fold a call to __builtin_FUNCTION to a constant string. */
8972 {
8979 }
8981 /* Fold a call to __builtin_LINE to an integer constant. */
8985 {
8987 }
8989 /* Fold a call to built-in function FNDECL with 0 arguments.
8990 This function returns NULL_TREE if no simplification was possible. */
8992 static tree
8994 {
8998 {
9024 }
9026 }
9028 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9029 This function returns NULL_TREE if no simplification was possible. */
9031 static tree
9033 {
9044 {
9046 {
9049 /* Gimplification will pull the CALL_EXPR for the builtin out of
9050 an if condition. When not optimizing, we'll not CSE it back.
9051 To avoid link error types of regressions, return false now. */
9056 }
9112 {
9117 }
9123 {
9128 }
9149 }
9153 }
9155 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9156 This function returns NULL_TREE if no simplification was possible. */
9158 static tree
9160 {
9172 {
9216 NOP_EXPR);
9218 /* We do the folding for va_start in the expander. */
9233 }
9235 }
9237 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9238 and ARG2.
9239 This function returns NULL_TREE if no simplification was possible. */
9241 static tree
9244 {
9258 {
9308 }
9310 }
9312 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9313 arguments. IGNORE is true if the result of the
9314 function call is ignored. This function returns NULL_TREE if no
9315 simplification was possible. */
9317 tree
9319 {
9323 {
9339 }
9341 {
9346 }
9348 }
9350 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9351 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9352 of arguments in ARGS to be omitted. OLDNARGS is the number of
9353 elements in ARGS. */
9355 static tree
9358 {
9363 {
9371 }
9372 else
9376 }
9378 /* Return true if FNDECL shouldn't be folded right now.
9379 If a built-in function has an inline attribute always_inline
9380 wrapper, defer folding it after always_inline functions have
9381 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9382 might not be performed. */
9384 bool
9386 {
9389 && cfun
9392 }
9394 /* A wrapper function for builtin folding that prevents warnings for
9395 "statement without effect" and the like, caused by removing the
9396 call node earlier than the warning is generated. */
9398 tree
9400 {
9406 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9407 yet. Defer folding until we see all the arguments
9408 (after inlining). */
9410 {
9413 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9414 instead last argument is __builtin_va_arg_pack (). Defer folding
9415 even in that case, until arguments are finalized. */
9417 {
9424 }
9432 else
9433 {
9438 }
9439 }
9441 }
9443 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9444 N arguments are passed in the array ARGARRAY. Return a folded
9445 expression or NULL_TREE if no simplification was possible. */
9447 tree
9449 tree fn,
9452 {
9459 {
9460 /* If last argument is __builtin_va_arg_pack (), arguments to this
9461 function are not finalized yet. Defer folding until they are. */
9463 {
9470 }
9475 else
9477 }
9480 }
9482 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9483 along with N new arguments specified as the "..." parameters. SKIP
9484 is the number of arguments in EXP to be omitted. This function is used
9485 to do varargs-to-varargs transformations. */
9487 static tree
9489 {
9491 tree t;
9499 }
9501 /* Validate a single argument ARG against a tree code CODE representing
9502 a type. Return true when argument is valid. */
9504 static bool
9506 {
9514 }
9516 /* This function validates the types of a function call argument list
9517 against a specified list of tree_codes. If the last specifier is a 0,
9518 that represents an ellipses, otherwise the last specifier must be a
9519 VOID_TYPE.
9521 This is the GIMPLE version of validate_arglist. Eventually we want to
9522 completely convert builtins.c to work from GIMPLEs and the tree based
9523 validate_arglist will then be removed. */
9525 bool
9527 {
9531 const_tree arg;
9537 do
9538 {
9541 {
9543 /* This signifies an ellipses, any further arguments are all ok. */
9547 /* This signifies an endlink, if no arguments remain, return
9548 true, otherwise return false. */
9552 /* If no parameters remain or the parameter's code does not
9553 match the specified code, return false. Otherwise continue
9554 checking any remaining arguments. */
9559 }
9560 }
9563 /* We need gotos here since we can only have one VA_CLOSE in a
9564 function. */
9565 end: ;
9569 }
9571 /* Default target-specific builtin expander that does nothing. */
9573 rtx
9575 rtx target ATTRIBUTE_UNUSED,
9576 rtx subtarget ATTRIBUTE_UNUSED,
9577 machine_mode mode ATTRIBUTE_UNUSED,
9579 {
9581 }
9583 /* Returns true is EXP represents data that would potentially reside
9584 in a readonly section. */
9586 bool
9588 {
9598 /* Make sure we call decl_readonly_section only for trees it
9599 can handle (since it returns true for everything it doesn't
9600 understand). */
9605 else
9607 }
9609 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9610 to the call, and TYPE is its return type.
9612 Return NULL_TREE if no simplification was possible, otherwise return the
9613 simplified form of the call as a tree.
9615 The simplified form may be a constant or other expression which
9616 computes the same value, but in a more efficient manner (including
9617 calls to other builtin functions).
9619 The call may contain arguments which need to be evaluated, but
9620 which are not useful to determine the result of the call. In
9621 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9622 COMPOUND_EXPR will be an argument which must be evaluated.
9623 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9624 COMPOUND_EXPR in the chain will contain the tree for the simplified
9625 form of the builtin function call. */
9627 static tree
9629 {
9633 else
9634 {
9635 tree fn;
9644 {
9646 tree tem;
9651 /* Return an offset into the constant string argument. */
9654 }
9657 /* strpbrk(x, "") == NULL.
9658 Evaluate and ignore s1 in case it had side-effects. */
9668 /* New argument list transforming strpbrk(s1, s2) to
9669 strchr(s1, s2[0]). */
9672 }
9673 }
9675 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9676 to the call.
9678 Return NULL_TREE if no simplification was possible, otherwise return the
9679 simplified form of the call as a tree.
9681 The simplified form may be a constant or other expression which
9682 computes the same value, but in a more efficient manner (including
9683 calls to other builtin functions).
9685 The call may contain arguments which need to be evaluated, but
9686 which are not useful to determine the result of the call. In
9687 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9688 COMPOUND_EXPR will be an argument which must be evaluated.
9689 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9690 COMPOUND_EXPR in the chain will contain the tree for the simplified
9691 form of the builtin function call. */
9693 static tree
9695 {
9699 else
9700 {
9703 /* If either argument is "", return NULL_TREE. */
9705 /* Evaluate and ignore both arguments in case either one has
9706 side-effects. */
9710 }
9711 }
9713 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9714 to the call.
9716 Return NULL_TREE if no simplification was possible, otherwise return the
9717 simplified form of the call as a tree.
9719 The simplified form may be a constant or other expression which
9720 computes the same value, but in a more efficient manner (including
9721 calls to other builtin functions).
9723 The call may contain arguments which need to be evaluated, but
9724 which are not useful to determine the result of the call. In
9725 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9726 COMPOUND_EXPR will be an argument which must be evaluated.
9727 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9728 COMPOUND_EXPR in the chain will contain the tree for the simplified
9729 form of the builtin function call. */
9731 static tree
9733 {
9737 else
9738 {
9739 /* If the first argument is "", return NULL_TREE. */
9742 {
9743 /* Evaluate and ignore argument s2 in case it has
9744 side-effects. */
9747 }
9749 /* If the second argument is "", return __builtin_strlen(s1). */
9752 {
9755 /* If the replacement _DECL isn't initialized, don't do the
9756 transformation. */
9761 }
9763 }
9764 }
9766 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9767 produced. False otherwise. This is done so that we don't output the error
9768 or warning twice or three times. */
9770 bool
9772 {
9775 tree arg;
9776 /* There is good chance the current input_location points inside the
9777 definition of the va_start macro (perhaps on the token for
9778 builtin) in a system header, so warnings will not be emitted.
9779 Use the location in real source code. */
9780 source_location current_location =
9782 NULL);
9785 {
9788 }
9791 {
9793 {
9796 }
9798 }
9799 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9800 when we checked the arguments and if needed issued a warning. */
9801 else
9802 {
9804 {
9805 /* Evidently an out of date version of <stdarg.h>; can't validate
9806 va_start's second argument, but can still work as intended. */
9808 OPT_Wvarargs,
9811 }
9813 {
9816 }
9818 }
9823 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9824 or __builtin_next_arg (0) the first time we see it, after checking
9825 the arguments and if needed issuing a warning. */
9827 {
9830 /* Strip off all nops for the sake of the comparison. This
9831 is not quite the same as STRIP_NOPS. It does more.
9832 We must also strip off INDIRECT_EXPR for C++ reference
9833 parameters. */
9838 {
9839 /* FIXME: Sometimes with the tree optimizers we can get the
9840 not the last argument even though the user used the last
9841 argument. We just warn and set the arg to be the last
9842 argument so that we will get wrong-code because of
9843 it. */
9845 OPT_Wvarargs,
9847 }
9849 /* Undefined by C99 7.15.1.4p4 (va_start):
9850 "If the parameter parmN is declared with the register storage
9851 class, with a function or array type, or with a type that is
9852 not compatible with the type that results after application of
9853 the default argument promotions, the behavior is undefined."
9854 */
9856 {
9858 OPT_Wvarargs,
9859 "undefined behavior when second parameter of "
9861 }
9863 /* We want to verify the second parameter just once before the tree
9864 optimizers are run and then avoid keeping it in the tree,
9865 as otherwise we could warn even for correct code like:
9866 void foo (int i, ...)
9867 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9870 else
9872 }
9874 }
9877 /* Expand a call EXP to __builtin_object_size. */
9879 static rtx
9881 {
9882 tree ost;
9887 {
9892 }
9900 {
9905 }
9910 }
9912 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9913 FCODE is the BUILT_IN_* to use.
9914 Return NULL_RTX if we failed; the caller should emit a normal call,
9915 otherwise try to get the result in TARGET, if convenient (and in
9916 mode MODE if that's convenient). */
9918 static rtx
9921 {
9923 POINTER_TYPE,
9924 fcode == BUILT_IN_MEMSET_CHK
9941 {
9942 /* Avoid transforming the checking call to an ordinary one when
9943 an overflow has been detected or when the call couldn't be
9944 validated because the size is not constant. */
9949 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9950 mem{cpy,pcpy,move,set} is available. */
9952 {
9967 }
9976 }
9979 else
9980 {
9983 /* If DEST is not a pointer type, call the normal function. */
9987 /* If SRC and DEST are the same (and not volatile), do nothing. */
9989 {
9990 tree expr;
9993 {
9994 /* Evaluate and ignore LEN in case it has side-effects. */
9997 }
10001 }
10003 /* __memmove_chk special case. */
10005 {
10011 /* If src is categorized for a readonly section we can use
10012 normal __memcpy_chk. */
10014 {
10023 }
10024 }
10026 }
10027 }
10029 /* Emit warning if a buffer overflow is detected at compile time. */
10031 static void
10033 {
10034 /* The source string. */
10036 /* The size of the destination object. */
10038 /* The string that is being concatenated with (as in __strcat_chk)
10039 or null if it isn't. */
10041 /* The maximum length of the source sequence in a bounded operation
10042 (such as __strncat_chk) or null if the operation isn't bounded
10043 (such as __strcat_chk). */
10045 /* The exact size of the access (such as in __strncpy_chk). */
10049 {
10057 /* For __strcat_chk the warning will be emitted only if overflowing
10058 by at least strlen (dest) + 1 bytes. */
10085 }
10088 {
10089 /* Check __strncat_chk. There is no way to determine the length
10090 of the string to which the source string is being appended so
10091 just warn when the length of the source string is not known. */
10094 }
10096 /* The destination argument is the first one for all built-ins above. */
10100 }
10102 /* Emit warning if a buffer overflow is detected at compile time
10103 in __sprintf_chk/__vsprintf_chk calls. */
10105 static void
10107 {
10112 /* Verify the required arguments in the original call. */
10122 /* Check whether the format is a literal string constant. */
10130 /* If the format doesn't contain % args or %%, we know its size. */
10133 /* If the format is "%s" and first ... argument is a string literal,
10134 we know it too. */
10137 {
10138 tree arg;
10149 }
10150 else
10153 /* Add one for the terminating nul. */
10158 }
10160 /* Emit warning if a free is called with address of a variable. */
10162 static void
10164 {
10178 else
10181 }
10183 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10184 if possible. */
10186 static tree
10188 {
10205 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10206 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10207 and (size_t) 0 for types 2 and 3. */
10212 {
10216 }
10218 {
10219 /* If object size is not known yet, delay folding until
10220 later. Maybe subsequent passes will help determining
10221 it. */
10225 }
10228 }
10230 /* Builtins with folding operations that operate on "..." arguments
10231 need special handling; we need to store the arguments in a convenient
10232 data structure before attempting any folding. Fortunately there are
10233 only a few builtins that fall into this category. FNDECL is the
10234 function, EXP is the CALL_EXPR for the call. */
10236 static tree
10238 {
10243 {
10250 }
10252 {
10257 }
10259 }
10261 /* Initialize format string characters in the target charset. */
10263 bool
10265 {
10268 {
10291 }
10293 }
10295 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10296 and no overflow/underflow occurred. INEXACT is true if M was not
10297 exactly calculated. TYPE is the tree type for the result. This
10298 function assumes that you cleared the MPFR flags and then
10299 calculated M to see if anything subsequently set a flag prior to
10300 entering this function. Return NULL_TREE if any checks fail. */
10302 static tree
10304 {
10305 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10306 overflow/underflow occurred. If -frounding-math, proceed iff the
10307 result of calling FUNC was exact. */
10310 {
10311 REAL_VALUE_TYPE rr;
10314 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10315 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10316 but the mpft_t is not, then we underflowed in the
10317 conversion. */
10320 {
10321 REAL_VALUE_TYPE rmode;
10324 /* Proceed iff the specified mode can hold the value. */
10327 }
10328 }
10330 }
10332 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10333 number and no overflow/underflow occurred. INEXACT is true if M
10334 was not exactly calculated. TYPE is the tree type for the result.
10335 This function assumes that you cleared the MPFR flags and then
10336 calculated M to see if anything subsequently set a flag prior to
10337 entering this function. Return NULL_TREE if any checks fail, if
10338 FORCE_CONVERT is true, then bypass the checks. */
10340 static tree
10342 {
10343 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10344 overflow/underflow occurred. If -frounding-math, proceed iff the
10345 result of calling FUNC was exact. */
10350 {
10355 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10356 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10357 but the mpft_t is not, then we underflowed in the
10358 conversion. */
10363 {
10368 /* Proceed iff the specified mode can hold the value. */
10374 }
10375 }
10377 }
10379 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10380 the pointer *(ARG_QUO) and return the result. The type is taken
10381 from the type of ARG0 and is used for setting the precision of the
10382 calculation and results. */
10384 static tree
10386 {
10393 /* To proceed, MPFR must exactly represent the target floating point
10394 format, which only happens when the target base equals two. */
10398 {
10403 {
10407 tree result_rem;
10416 /* Remquo is independent of the rounding mode, so pass
10417 inexact=0 to do_mpfr_ckconv(). */
10421 {
10422 /* MPFR calculates quo in the host's long so it may
10423 return more bits in quo than the target int can hold
10424 if sizeof(host long) > sizeof(target int). This can
10425 happen even for native compilers in LP64 mode. In
10426 these cases, modulo the quo value with the largest
10427 number that the target int can hold while leaving one
10428 bit for the sign. */
10432 /* Dereference the quo pointer argument. */
10434 /* Proceed iff a valid pointer type was passed in. */
10436 {
10437 /* Set the value. */
10438 tree result_quo
10441 integer_quo));
10443 /* Combine the quo assignment with the rem. */
10446 }
10447 }
10448 }
10449 }
10451 }
10453 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10454 resulting value as a tree with type TYPE. The mpfr precision is
10455 set to the precision of TYPE. We assume that this mpfr function
10456 returns zero if the result could be calculated exactly within the
10457 requested precision. In addition, the integer pointer represented
10458 by ARG_SG will be dereferenced and set to the appropriate signgam
10459 (-1,1) value. */
10461 static tree
10463 {
10468 /* To proceed, MPFR must exactly represent the target floating point
10469 format, which only happens when the target base equals two. Also
10470 verify ARG is a constant and that ARG_SG is an int pointer. */
10475 {
10478 /* In addition to NaN and Inf, the argument cannot be zero or a
10479 negative integer. */
10483 {
10488 mpfr_t m;
10489 tree result_lg;
10498 {
10499 tree result_sg;
10501 /* Dereference the arg_sg pointer argument. */
10503 /* Assign the signgam value into *arg_sg. */
10508 /* Combine the signgam assignment with the lgamma result. */
10511 }
10512 }
10513 }
10516 }
10518 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10519 mpc function FUNC on it and return the resulting value as a tree
10520 with type TYPE. The mpfr precision is set to the precision of
10521 TYPE. We assume that function FUNC returns zero if the result
10522 could be calculated exactly within the requested precision. If
10523 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10524 in the arguments and/or results. */
10526 tree
10529 {
10535 /* To proceed, MPFR must exactly represent the target floating point
10536 format, which only happens when the target base equals two. */
10542 {
10551 {
10571 }
10572 }
10575 }
10577 /* A wrapper function for builtin folding that prevents warnings for
10578 "statement without effect" and the like, caused by removing the
10579 call node earlier than the warning is generated. */
10581 tree
10583 {
10591 {
10600 {
10602 }
10603 else
10604 {
10607 {
10608 /* Propagate location information from original call to
10609 expansion of builtin. Otherwise things like
10610 maybe_emit_chk_warning, that operate on the expansion
10611 of a builtin, will use the wrong location information. */
10613 {
10621 }
10623 }
10624 }
10625 }
10627 }
10629 /* Look up the function in builtin_decl that corresponds to DECL
10630 and set ASMSPEC as its user assembler name. DECL must be a
10631 function decl that declares a builtin. */
10633 void
10635 {
10645 {
10649 }
10650 }
10652 /* Return true if DECL is a builtin that expands to a constant or similarly
10653 simple code. */
10654 bool
10656 {
10659 {
10660 /* Builtins that expand to constants. */
10665 /* Simple register moves or loads from stack. */
10676 /* Exception state returns or moves registers around. */
10684 }
10687 }
10689 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10690 most probably expanded inline into reasonably simple code. This is a
10691 superset of is_simple_builtin. */
10692 bool
10694 {
10701 {
10703 CASE_BUILT_IN_ALLOCA:
10769 }
10772 }
10774 /* Return true if T is a constant and the value cast to a target char
10775 can be represented by a host char.
10776 Store the casted char constant in *P if so. */
10778 bool
10780 {
10786 }
10788 /* Return the maximum object size. */
10790 tree
10792 {
10793 /* To do: Make this a configurable parameter. */
10795 }