| blob | 841c1ef4da798de64897b8b7c2d3f2db50ad3a7a |
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 {
3788 /* Check to see if the argument was declared attribute nonstring
3789 and if so, issue a warning since at this point it's not known
3790 to be nul-terminated. */
3794 }
3797 }
3799 /* Helper function to do the actual work for expand_builtin_strcpy. The
3800 arguments to the builtin_strcpy call DEST and SRC are broken out
3801 so that this can also be called without constructing an actual CALL_EXPR.
3802 The other arguments and return value are the same as for
3803 expand_builtin_strcpy. */
3805 static rtx
3807 {
3809 }
3811 /* Expand a call EXP to the stpcpy builtin.
3812 Return NULL_RTX if we failed the caller should emit a normal call,
3813 otherwise try to get the result in TARGET, if convenient (and in
3814 mode MODE if that's convenient). */
3816 static rtx
3818 {
3829 {
3833 }
3835 /* If return value is ignored, transform stpcpy into strcpy. */
3837 {
3841 }
3842 else
3843 {
3845 rtx ret;
3847 /* Ensure we get an actual string whose length can be evaluated at
3848 compile-time, not an expression containing a string. This is
3849 because the latter will potentially produce pessimized code
3850 when used to produce the return value. */
3862 {
3866 {
3870 {
3872 {
3875 else
3877 }
3886 }
3887 }
3888 }
3891 }
3892 }
3894 /* Check a call EXP to the stpncpy built-in for validity.
3895 Return NULL_RTX on both success and failure. */
3897 static rtx
3899 {
3905 /* The source and destination of the call. */
3909 /* The exact number of bytes to write (not the maximum). */
3912 /* The size of the destination object. */
3918 }
3920 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3921 bytes from constant string DATA + OFFSET and return it as target
3922 constant. */
3924 rtx
3926 scalar_int_mode mode)
3927 {
3934 }
3936 /* Helper to check the sizes of sequences and the destination of calls
3937 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3938 success (no overflow or invalid sizes), false otherwise. */
3940 static bool
3942 {
3947 /* Try to determine the range of lengths that the source expression
3948 refers to. */
3952 /* Try to verify that the destination is big enough for the shortest
3953 string. */
3956 {
3957 /* If it hasn't been provided by __strncat_chk, try to determine
3958 the size of the destination object into which the source is
3959 being copied. */
3961 }
3963 /* Add one for the terminating nul. */
3966 size_one_node)
3969 /* The strncat function copies at most MAXREAD bytes and always appends
3970 the terminating nul so the specified upper bound should never be equal
3971 to (or greater than) the size of the destination. */
3974 {
3983 }
3991 /* The number of bytes to write is LEN but check_access will also
3992 check SRCLEN if LEN's value isn't known. */
3994 objsize);
3995 }
3997 /* Similar to expand_builtin_strcat, do some very basic size validation
3998 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3999 the built-in expand to a call to the library function. */
4001 static rtx
4003 {
4011 /* The upper bound on the number of bytes to write. */
4013 /* The length of the source sequence. */
4016 /* Try to determine the range of lengths that the source expression
4017 refers to. */
4021 else
4024 /* Try to verify that the destination is big enough for the shortest
4025 string. First try to determine the size of the destination object
4026 into which the source is being copied. */
4029 /* Add one for the terminating nul. */
4032 size_one_node)
4035 /* The strncat function copies at most MAXREAD bytes and always appends
4036 the terminating nul so the specified upper bound should never be equal
4037 to (or greater than) the size of the destination. */
4040 {
4049 }
4057 /* The number of bytes to write is SRCLEN. */
4061 }
4063 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4064 NULL_RTX if we failed the caller should emit a normal call. */
4066 static rtx
4068 {
4073 {
4076 /* The number of bytes to write (not the maximum). */
4078 /* The length of the source sequence. */
4082 {
4086 /* The number of bytes to write is LEN but check_access will also
4087 check SLEN if LEN's value isn't known. */
4089 destsize);
4090 }
4092 /* We must be passed a constant len and src parameter. */
4098 /* We're required to pad with trailing zeros if the requested
4099 len is greater than strlen(s2)+1. In that case try to
4100 use store_by_pieces, if it fails, punt. */
4102 {
4105 rtx dest_mem;
4109 builtin_strncpy_read_str,
4116 builtin_strncpy_read_str,
4121 }
4122 }
4124 }
4126 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4127 bytes from constant string DATA + OFFSET and return it as target
4128 constant. */
4130 rtx
4132 scalar_int_mode mode)
4133 {
4140 }
4142 /* Callback routine for store_by_pieces. Return the RTL of a register
4143 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4144 char value given in the RTL register data. For example, if mode is
4145 4 bytes wide, return the RTL for 0x01010101*data. */
4147 static rtx
4149 scalar_int_mode mode)
4150 {
4166 }
4168 /* Expand expression EXP, which is a call to the memset builtin. Return
4169 NULL_RTX if we failed the caller should emit a normal call, otherwise
4170 try to get the result in TARGET, if convenient (and in mode MODE if that's
4171 convenient). */
4173 static rtx
4175 {
4187 }
4189 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4190 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4191 try to get the result in TARGET, if convenient (and in mode MODE if that's
4192 convenient). */
4194 static rtx
4196 {
4201 else
4202 {
4208 /* Return src bounds with the result. */
4210 {
4214 }
4216 }
4217 }
4219 /* Helper function to do the actual work for expand_builtin_memset. The
4220 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4221 so that this can also be called without constructing an actual CALL_EXPR.
4222 The other arguments and return value are the same as for
4223 expand_builtin_memset. */
4225 static rtx
4228 {
4231 machine_mode val_mode;
4243 /* If DEST is not a pointer type, don't do this operation in-line. */
4254 /* If the LEN parameter is zero, return DEST. */
4256 {
4257 /* Evaluate and ignore VAL in case it has side-effects. */
4260 }
4262 /* Stabilize the arguments in case we fail. */
4274 {
4275 rtx val_rtx;
4280 /* Assume that we can memset by pieces if we can store
4281 * the coefficients by pieces (in the required modes).
4282 * We can't pass builtin_memset_gen_str as that emits RTL. */
4288 {
4293 }
4297 probable_max_size))
4303 }
4309 {
4320 probable_max_size))
4326 }
4334 probable_max_size);
4337 {
4340 }
4344 do_libcall:
4354 else
4359 }
4361 /* Expand expression EXP, which is a call to the bzero builtin. Return
4362 NULL_RTX if we failed the caller should emit a normal call. */
4364 static rtx
4366 {
4375 /* New argument list transforming bzero(ptr x, int y) to
4376 memset(ptr x, int 0, size_t y). This is done this way
4377 so that if it isn't expanded inline, we fallback to
4378 calling bzero instead of memset. */
4386 }
4388 /* Try to expand cmpstr operation ICODE with the given operands.
4389 Return the result rtx on success, otherwise return null. */
4391 static rtx
4393 HOST_WIDE_INT align)
4394 {
4408 }
4410 /* Expand expression EXP, which is a call to the memcmp built-in function.
4411 Return NULL_RTX if we failed and the caller should emit a normal call,
4412 otherwise try to get the result in TARGET, if convenient.
4413 RESULT_EQ is true if we can relax the returned value to be either zero
4414 or nonzero, without caring about the sign. */
4416 static rtx
4418 {
4427 /* Diagnose calls where the specified length exceeds the size of either
4428 object. */
4430 {
4434 {
4438 }
4439 }
4447 /* If we don't have POINTER_TYPE, call the function. */
4455 /* Set MEM_SIZE as appropriate. */
4457 {
4460 }
4466 {
4470 }
4472 /* If SRC is a string constant and block move would be done
4473 by pieces, we can avoid loading the string from memory
4474 and only stored the computed constants. */
4486 {
4487 /* Return the value in the proper mode for this function. */
4492 {
4495 }
4498 }
4501 }
4503 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4504 if we failed the caller should emit a normal call, otherwise try to get
4505 the result in TARGET, if convenient. */
4507 static rtx
4509 {
4524 /* If we don't have POINTER_TYPE, call the function. */
4528 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4536 /* Try to call cmpstrsi. */
4541 /* Try to determine at least one length and call cmpstrnsi. */
4543 {
4544 tree len;
4545 rtx arg3_rtx;
4555 /* If we don't have a constant length for the first, use the length
4556 of the second, if we know it. We don't require a constant for
4557 this case; some cost analysis could be done if both are available
4558 but neither is constant. For now, assume they're equally cheap,
4559 unless one has side effects. If both strings have constant lengths,
4560 use the smaller. */
4576 else
4579 /* If both arguments have side effects, we cannot optimize. */
4581 {
4583 result = expand_cmpstrn_or_cmpmem
4586 }
4587 }
4591 {
4592 /* Check to see if the argument was declared attribute nonstring
4593 and if so, issue a warning since at this point it's not known
4594 to be nul-terminated. */
4597 /* Return the value in the proper mode for this function. */
4605 }
4607 /* Expand the library call ourselves using a stabilized argument
4608 list to avoid re-evaluating the function's arguments twice. */
4613 }
4615 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4616 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4617 the result in TARGET, if convenient. */
4619 static rtx
4621 ATTRIBUTE_UNUSED machine_mode mode)
4622 {
4627 /* If c_strlen can determine an expression for one of the string
4628 lengths, and it doesn't have side effects, then emit cmpstrnsi
4629 using length MIN(strlen(string)+1, arg3). */
4634 tree len;
4655 /* If we don't have a constant length for the first, use the length
4656 of the second, if we know it. If neither string is constant length,
4657 use the given length argument. We don't require a constant for
4658 this case; some cost analysis could be done if both are available
4659 but neither is constant. For now, assume they're equally cheap,
4660 unless one has side effects. If both strings have constant lengths,
4661 use the smaller. */
4679 else
4682 /* If we are not using the given length, we must incorporate it here.
4683 The actual new length parameter will be MIN(len,arg3) in this case. */
4695 {
4696 /* Check to see if the argument was declared attribute nonstring
4697 and if so, issue a warning since at this point it's not known
4698 to be nul-terminated. */
4701 /* Return the value in the proper mode for this function. */
4709 }
4711 /* Expand the library call ourselves using a stabilized argument
4712 list to avoid re-evaluating the function's arguments twice. */
4717 }
4719 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4720 if that's convenient. */
4722 rtx
4724 {
4725 rtx val;
4728 /* Don't do __builtin_saveregs more than once in a function.
4729 Save the result of the first call and reuse it. */
4733 /* When this function is called, it means that registers must be
4734 saved on entry to this function. So we migrate the call to the
4735 first insn of this function. */
4739 /* Do whatever the machine needs done in this case. */
4747 /* Put the insns after the NOTE that starts the function. If this
4748 is inside a start_sequence, make the outer-level insn chain current, so
4749 the code is placed at the start of the function. */
4755 }
4757 /* Expand a call to __builtin_next_arg. */
4759 static rtx
4761 {
4762 /* Checking arguments is already done in fold_builtin_next_arg
4763 that must be called before this function. */
4768 }
4770 /* Make it easier for the backends by protecting the valist argument
4771 from multiple evaluations. */
4773 static tree
4775 {
4778 /* The current way of determining the type of valist is completely
4779 bogus. We should have the information on the va builtin instead. */
4784 {
4788 /* For this case, the backends will be expecting a pointer to
4789 vatype, but it's possible we've actually been given an array
4790 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4791 So fix it. */
4793 {
4796 }
4797 }
4798 else
4799 {
4803 {
4809 }
4815 }
4818 }
4820 /* The "standard" definition of va_list is void*. */
4822 tree
4824 {
4826 }
4828 /* The "standard" abi va_list is va_list_type_node. */
4830 tree
4832 {
4834 }
4836 /* The "standard" type of va_list is va_list_type_node. */
4838 tree
4840 {
4847 {
4848 /* If va_list is an array type, the argument may have decayed
4849 to a pointer type, e.g. by being passed to another function.
4850 In that case, unwrap both types so that we can compare the
4851 underlying records. */
4854 {
4857 }
4858 }
4863 }
4865 /* The "standard" implementation of va_start: just assign `nextarg' to
4866 the variable. */
4868 void
4870 {
4874 /* We do not have any valid bounds for the pointer, so
4875 just store zero bounds for it. */
4879 nextarg));
4880 }
4882 /* Expand EXP, a call to __builtin_va_start. */
4884 static rtx
4886 {
4887 rtx nextarg;
4888 tree valist;
4892 {
4895 }
4905 else
4909 }
4911 /* Expand EXP, a call to __builtin_va_end. */
4913 static rtx
4915 {
4918 /* Evaluate for side effects, if needed. I hate macros that don't
4919 do that. */
4924 }
4926 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4927 builtin rather than just as an assignment in stdarg.h because of the
4928 nastiness of array-type va_list types. */
4930 static rtx
4932 {
4945 {
4949 }
4950 else
4951 {
4954 /* Evaluate to pointers. */
4963 /* "Dereference" to BLKmode memories. */
4971 /* Copy. */
4973 }
4976 }
4978 /* Expand a call to one of the builtin functions __builtin_frame_address or
4979 __builtin_return_address. */
4981 static rtx
4983 {
4984 /* The argument must be a nonnegative integer constant.
4985 It counts the number of frames to scan up the stack.
4986 The value is either the frame pointer value or the return
4987 address saved in that frame. */
4989 /* Warning about missing arg was already issued. */
4992 {
4995 }
4996 else
4997 {
4998 /* Number of frames to scan up the stack. */
5003 /* Some ports cannot access arbitrary stack frames. */
5005 {
5008 }
5011 {
5012 /* Warn since no effort is made to ensure that any frame
5013 beyond the current one exists or can be safely reached. */
5016 }
5018 /* For __builtin_frame_address, return what we've got. */
5026 }
5027 }
5029 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5030 failed and the caller should emit a normal call. */
5032 static rtx
5034 {
5035 rtx op0;
5036 rtx result;
5039 HOST_WIDE_INT max_size;
5042 bool valid_arglist
5045 VOID_TYPE)
5055 {
5056 /* -Walloca-larger-than and -Wvla-larger-than settings override
5057 the more general -Walloc-size-larger-than so unless either of
5058 the former options is specified check the alloca arguments for
5059 overflow. */
5063 }
5065 /* Compute the argument. */
5068 /* Compute the alignment. */
5070 ? BIGGEST_ALIGNMENT
5073 /* Compute the maximum size. */
5078 /* Allocate the desired space. If the allocation stems from the declaration
5079 of a variable-sized object, it cannot accumulate. */
5080 result
5085 }
5087 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5088 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5089 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5090 handle_builtin_stack_restore function. */
5092 static rtx
5094 {
5101 OPTAB_LIB_WIDEN);
5104 OPTAB_LIB_WIDEN);
5109 }
5111 /* Expand a call to bswap builtin in EXP.
5112 Return NULL_RTX if a normal call should be emitted rather than expanding the
5113 function in-line. If convenient, the result should be placed in TARGET.
5114 SUBTARGET may be used as the target for computing one of EXP's operands. */
5116 static rtx
5118 rtx subtarget)
5119 {
5120 tree arg;
5121 rtx op0;
5139 }
5141 /* Expand a call to a unary builtin in EXP.
5142 Return NULL_RTX if a normal call should be emitted rather than expanding the
5143 function in-line. If convenient, the result should be placed in TARGET.
5144 SUBTARGET may be used as the target for computing one of EXP's operands. */
5146 static rtx
5149 {
5150 rtx op0;
5155 /* Compute the argument. */
5157 (subtarget
5161 /* Compute op, into TARGET if possible.
5162 Set TARGET to wherever the result comes back. */
5168 }
5170 /* Expand a call to __builtin_expect. We just return our argument
5171 as the builtin_expect semantic should've been already executed by
5172 tree branch prediction pass. */
5174 static rtx
5176 {
5177 tree arg;
5184 /* When guessing was done, the hints should be already stripped away. */
5188 }
5190 /* Expand a call to __builtin_assume_aligned. We just return our first
5191 argument as the builtin_assume_aligned semantic should've been already
5192 executed by CCP. */
5194 static rtx
5196 {
5200 EXPAND_NORMAL);
5205 }
5207 void
5209 {
5211 {
5213 /* For trap insns when not accumulating outgoing args force
5214 REG_ARGS_SIZE note to prevent crossjumping of calls with
5215 different args sizes. */
5218 }
5219 else
5220 {
5224 }
5227 }
5229 /* Expand a call to __builtin_unreachable. We do nothing except emit
5230 a barrier saying that control flow will not pass here.
5232 It is the responsibility of the program being compiled to ensure
5233 that control flow does never reach __builtin_unreachable. */
5234 static void
5236 {
5238 }
5240 /* Expand EXP, a call to fabs, fabsf or fabsl.
5241 Return NULL_RTX if a normal call should be emitted rather than expanding
5242 the function inline. If convenient, the result should be placed
5243 in TARGET. SUBTARGET may be used as the target for computing
5244 the operand. */
5246 static rtx
5248 {
5249 machine_mode mode;
5250 tree arg;
5251 rtx op0;
5261 }
5263 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5264 Return NULL is a normal call should be emitted rather than expanding the
5265 function inline. If convenient, the result should be placed in TARGET.
5266 SUBTARGET may be used as the target for computing the operand. */
5268 static rtx
5270 {
5272 tree arg;
5284 }
5286 /* Expand a call to __builtin___clear_cache. */
5288 static rtx
5290 {
5292 {
5293 #ifdef CLEAR_INSN_CACHE
5294 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5295 does something. Just do the default expansion to a call to
5296 __clear_cache(). */
5298 #else
5299 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5300 does nothing. There is no need to call it. Do nothing. */
5303 }
5305 /* We have a "clear_cache" insn, and it will handle everything. */
5309 /* We must not expand to a library call. If we did, any
5310 fallback library function in libgcc that might contain a call to
5311 __builtin___clear_cache() would recurse infinitely. */
5313 {
5316 }
5319 {
5332 }
5334 }
5336 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5338 static rtx
5340 {
5343 /* If we don't need too much alignment, we'll have been guaranteed
5344 proper alignment by get_trampoline_type. */
5348 /* Round address up to desired boundary. */
5359 }
5361 static rtx
5363 {
5379 /* If ONSTACK, the TRAMP argument should be the address of a field
5380 within the local function's FRAME decl. Either way, let's see if
5381 we can fill in the MEM_ATTRs for this memory. */
5385 /* Creator of a heap trampoline is responsible for making sure the
5386 address is aligned to at least STACK_BOUNDARY. Normally malloc
5387 will ensure this anyhow. */
5390 {
5394 }
5396 /* The FUNC argument should be the address of the nested function.
5397 Extract the actual function decl to pass to the hook. */
5404 /* Generate insns to initialize the trampoline. */
5408 {
5414 }
5417 }
5419 static rtx
5421 {
5422 rtx tramp;
5433 }
5435 /* Expand a call to the builtin descriptor initialization routine.
5436 A descriptor is made up of a couple of pointers to the static
5437 chain and the code entry in this order. */
5439 static rtx
5441 {
5446 VOID_TYPE))
5460 /* Generate insns to initialize the descriptor. */
5466 }
5468 /* Expand a call to the builtin descriptor adjustment routine. */
5470 static rtx
5472 {
5473 rtx tramp;
5480 /* Unalign the descriptor to allow runtime identification. */
5485 }
5487 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5488 function. The function first checks whether the back end provides
5489 an insn to implement signbit for the respective mode. If not, it
5490 checks whether the floating point format of the value is such that
5491 the sign bit can be extracted. If that is not the case, error out.
5492 EXP is the expression that is a call to the builtin function; if
5493 convenient, the result should be placed in TARGET. */
5494 static rtx
5496 {
5498 scalar_float_mode fmode;
5500 tree arg;
5503 rtx temp;
5516 /* Expand the argument yielding a RTX expression. */
5519 /* Check if the back end provides an insn that handles signbit for the
5520 argument's mode. */
5523 {
5529 }
5531 /* For floating point formats without a sign bit, implement signbit
5532 as "ARG < 0.0". */
5535 {
5536 /* But we can't do this if the format supports signed zero. */
5542 }
5545 {
5548 }
5549 else
5550 {
5552 /* Handle targets with different FP word orders. */
5555 else
5559 }
5561 /* Force the intermediate word_mode (or narrower) result into a
5562 register. This avoids attempting to create paradoxical SUBREGs
5563 of floating point modes below. */
5566 /* If the bitpos is within the "result mode" lowpart, the operation
5567 can be implement with a single bitwise AND. Otherwise, we need
5568 a right shift and an AND. */
5571 {
5579 }
5580 else
5581 {
5582 /* Perform a logical right shift to place the signbit in the least
5583 significant bit, then truncate the result to the desired mode
5584 and mask just this bit. */
5589 }
5592 }
5594 /* Expand fork or exec calls. TARGET is the desired target of the
5595 call. EXP is the call. FN is the
5596 identificator of the actual function. IGNORE is nonzero if the
5597 value is to be ignored. */
5599 static rtx
5601 {
5603 tree call;
5605 /* If we are not profiling, just call the function. */
5609 /* Otherwise call the wrapper. This should be equivalent for the rest of
5610 compiler, so the code does not diverge, and the wrapper may run the
5611 code necessary for keeping the profiling sane. */
5614 {
5645 }
5657 }
5660 \f
5661 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5662 the pointer in these functions is void*, the tree optimizers may remove
5663 casts. The mode computed in expand_builtin isn't reliable either, due
5664 to __sync_bool_compare_and_swap.
5666 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5667 group of builtins. This gives us log2 of the mode size. */
5671 {
5672 /* The size is not negotiable, so ask not to get BLKmode in return
5673 if the target indicates that a smaller size would be better. */
5675 }
5677 /* Expand the memory expression LOC and return the appropriate memory operand
5678 for the builtin_sync operations. */
5680 static rtx
5682 {
5688 /* Note that we explicitly do not want any alias information for this
5689 memory, so that we kill all other live memories. Otherwise we don't
5690 satisfy the full barrier semantics of the intrinsic. */
5693 /* The alignment needs to be at least according to that of the mode. */
5700 }
5702 /* Make sure an argument is in the right mode.
5703 EXP is the tree argument.
5704 MODE is the mode it should be in. */
5706 static rtx
5708 {
5709 rtx val;
5710 machine_mode old_mode;
5713 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5714 of CONST_INTs, where we know the old_mode only from the call argument. */
5721 }
5724 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5725 EXP is the CALL_EXPR. CODE is the rtx code
5726 that corresponds to the arithmetic or logical operation from the name;
5727 an exception here is that NOT actually means NAND. TARGET is an optional
5728 place for us to store the results; AFTER is true if this is the
5729 fetch_and_xxx form. */
5731 static rtx
5734 rtx target)
5735 {
5740 {
5747 {
5776 }
5777 }
5779 /* Expand the operands. */
5784 after);
5785 }
5787 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5788 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5789 true if this is the boolean form. TARGET is a place for us to store the
5790 results; this is NOT optional if IS_BOOL is true. */
5792 static rtx
5795 {
5799 /* Expand the operands. */
5806 {
5809 else
5811 }
5814 MEMMODEL_SYNC_SEQ_CST))
5818 }
5820 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5821 general form is actually an atomic exchange, and some targets only
5822 support a reduced form with the second argument being a constant 1.
5823 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5824 the results. */
5826 static rtx
5828 rtx target)
5829 {
5832 /* Expand the operands. */
5837 }
5839 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5841 static void
5843 {
5844 rtx mem;
5846 /* Expand the operands. */
5850 }
5852 /* Given an integer representing an ``enum memmodel'', verify its
5853 correctness and return the memory model enum. */
5855 static enum memmodel
5857 {
5858 rtx op;
5860 source_location loc
5863 /* If the parameter is not a constant, it's a run time value so we'll just
5864 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5874 {
5878 }
5880 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5882 {
5886 }
5888 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5889 be conservative and promote consume to acquire. */
5894 }
5896 /* Expand the __atomic_exchange intrinsic:
5897 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5898 EXP is the CALL_EXPR.
5899 TARGET is an optional place for us to store the results. */
5901 static rtx
5903 {
5912 /* Expand the operands. */
5917 }
5919 /* Expand the __atomic_compare_exchange intrinsic:
5920 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5921 TYPE desired, BOOL weak,
5922 enum memmodel success,
5923 enum memmodel failure)
5924 EXP is the CALL_EXPR.
5925 TARGET is an optional place for us to store the results. */
5927 static rtx
5929 rtx target)
5930 {
5934 tree weak;
5936 source_location loc
5943 {
5945 "failure memory model cannot be stronger than success "
5948 }
5951 {
5953 "invalid failure memory model for "
5957 }
5963 /* Expand the operands. */
5979 /* Lest the rtl backend create a race condition with an imporoper store
5980 to memory, always create a new pseudo for OLDVAL. */
5987 /* Conditionally store back to EXPECT, lest we create a race condition
5988 with an improper store to memory. */
5989 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5990 the normal case where EXPECT is totally private, i.e. a register. At
5991 which point the store can be unconditional. */
5999 }
6001 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6002 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6003 call. The weak parameter must be dropped to match the expected parameter
6004 list and the expected argument changed from value to pointer to memory
6005 slot. */
6007 static void
6009 {
6025 /* Skip the boolean weak parameter. */
6028 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6031 built_in_function fncode
6036 fndecl);
6041 {
6048 }
6049 }
6051 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6053 void
6055 {
6061 tree lhs;
6063 source_location loc
6070 {
6072 "failure memory model cannot be stronger than success "
6075 }
6078 {
6080 "invalid failure memory model for "
6084 }
6087 {
6090 }
6092 /* Expand the operands. */
6105 {
6108 }
6112 {
6118 }
6119 }
6121 /* Expand the __atomic_load intrinsic:
6122 TYPE __atomic_load (TYPE *object, enum memmodel)
6123 EXP is the CALL_EXPR.
6124 TARGET is an optional place for us to store the results. */
6126 static rtx
6128 {
6129 rtx mem;
6134 {
6135 source_location loc
6140 }
6145 /* Expand the operand. */
6149 }
6152 /* Expand the __atomic_store intrinsic:
6153 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6154 EXP is the CALL_EXPR.
6155 TARGET is an optional place for us to store the results. */
6157 static rtx
6159 {
6166 {
6167 source_location loc
6172 }
6177 /* Expand the operands. */
6182 }
6184 /* Expand the __atomic_fetch_XXX intrinsic:
6185 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6186 EXP is the CALL_EXPR.
6187 TARGET is an optional place for us to store the results.
6188 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6189 FETCH_AFTER is true if returning the result of the operation.
6190 FETCH_AFTER is false if returning the value before the operation.
6191 IGNORE is true if the result is not used.
6192 EXT_CALL is the correct builtin for an external call if this cannot be
6193 resolved to an instruction sequence. */
6195 static rtx
6199 {
6202 tree fndecl;
6203 tree addr;
6207 /* Expand the operands. */
6211 /* Only try generating instructions if inlining is turned on. */
6213 {
6217 }
6219 /* Return if a different routine isn't needed for the library call. */
6223 /* Change the call to the specified function. */
6231 /* If we will emit code after the call, the call can not be a tail call.
6232 If it is emitted as a tail call, a barrier is emitted after it, and
6233 then all trailing code is removed. */
6237 /* Expand the call here so we can emit trailing code. */
6240 /* Replace the original function just in case it matters. */
6243 /* Then issue the arithmetic correction to return the right result. */
6245 {
6247 {
6249 OPTAB_LIB_WIDEN);
6251 }
6252 else
6254 OPTAB_LIB_WIDEN);
6255 }
6257 }
6259 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6261 void
6263 {
6271 optab optab;
6283 {
6298 }
6301 {
6308 }
6330 {
6335 }
6336 else
6338 OPTAB_DIRECT);
6341 }
6343 /* Expand an atomic clear operation.
6344 void _atomic_clear (BOOL *obj, enum memmodel)
6345 EXP is the call expression. */
6347 static rtx
6349 {
6350 machine_mode mode;
6359 {
6360 source_location loc
6365 }
6367 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6368 Failing that, a store is issued by __atomic_store. The only way this can
6369 fail is if the bool type is larger than a word size. Unlikely, but
6370 handle it anyway for completeness. Assume a single threaded model since
6371 there is no atomic support in this case, and no barriers are required. */
6376 }
6378 /* Expand an atomic test_and_set operation.
6379 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6380 EXP is the call expression. */
6382 static rtx
6384 {
6385 rtx mem;
6387 machine_mode mode;
6394 }
6397 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6398 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6400 static tree
6402 {
6404 machine_mode mode;
6410 /* We need a corresponding integer mode for the access to be lock-free. */
6418 {
6421 /* Either this argument is null, or it's a fake pointer encoding
6422 the alignment of the object. */
6428 else
6430 }
6431 else
6432 {
6435 /* This function is usually invoked and folded immediately by the front
6436 end before anything else has a chance to look at it. The pointer
6437 parameter at this point is usually cast to a void *, so check for that
6438 and look past the cast. */
6448 /* Get the underlying type of the object. */
6451 }
6453 /* If the object has smaller alignment, the lock free routines cannot
6454 be used. */
6458 /* Check if a compare_and_swap pattern exists for the mode which represents
6459 the required size. The pattern is not allowed to fail, so the existence
6460 of the pattern indicates support is present. Also require that an
6461 atomic load exists for the required size. */
6464 else
6466 }
6468 /* Return true if the parameters to call EXP represent an object which will
6469 always generate lock free instructions. The first argument represents the
6470 size of the object, and the second parameter is a pointer to the object
6471 itself. If NULL is passed for the object, then the result is based on
6472 typical alignment for an object of the specified size. Otherwise return
6473 false. */
6475 static rtx
6477 {
6478 tree size;
6483 {
6486 }
6492 }
6494 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6495 is lock free on this architecture. */
6497 static tree
6499 {
6503 /* If it isn't always lock free, don't generate a result. */
6508 }
6510 /* Return true if the parameters to call EXP represent an object which will
6511 always generate lock free instructions. The first argument represents the
6512 size of the object, and the second parameter is a pointer to the object
6513 itself. If NULL is passed for the object, then the result is based on
6514 typical alignment for an object of the specified size. Otherwise return
6515 NULL*/
6517 static rtx
6519 {
6520 tree size;
6525 {
6528 }
6533 /* If the value is known at compile time, return the RTX for it. */
6539 }
6541 /* Expand the __atomic_thread_fence intrinsic:
6542 void __atomic_thread_fence (enum memmodel)
6543 EXP is the CALL_EXPR. */
6545 static void
6547 {
6550 }
6552 /* Expand the __atomic_signal_fence intrinsic:
6553 void __atomic_signal_fence (enum memmodel)
6554 EXP is the CALL_EXPR. */
6556 static void
6558 {
6561 }
6563 /* Expand the __sync_synchronize intrinsic. */
6565 static void
6567 {
6569 }
6571 static rtx
6573 {
6579 {
6581 /* If the target is not sutitable then create a new target. */
6589 }
6592 }
6594 static void
6596 {
6602 {
6609 }
6611 }
6613 \f
6614 /* Emit code to restore the current value of stack. */
6616 static void
6618 {
6630 }
6632 /* Emit code to save the current value of stack. */
6634 static rtx
6636 {
6641 }
6643 /* Emit code to get the openacc gang, worker or vector id or size. */
6645 static rtx
6647 {
6649 rtx fallback_retval;
6652 {
6665 }
6668 {
6671 }
6675 {
6678 }
6682 {
6690 }
6699 {
6702 }
6710 }
6712 /* Expand an expression EXP that calls a built-in function,
6713 with result going to TARGET if that's convenient
6714 (and in mode MODE if that's convenient).
6715 SUBTARGET may be used as the target for computing one of EXP's operands.
6716 IGNORE is nonzero if the value is to be ignored. */
6718 rtx
6721 {
6730 /* When ASan is enabled, we don't want to expand some memory/string
6731 builtins and rely on libsanitizer's hooks. This allows us to avoid
6732 redundant checks and be sure, that possible overflow will be detected
6733 by ASan. */
6738 /* When not optimizing, generate calls to library functions for a certain
6739 set of builtins. */
6765 /* The built-in function expanders test for target == const0_rtx
6766 to determine whether the function's result will be ignored. */
6770 /* If the result of a pure or const built-in function is ignored, and
6771 none of its arguments are volatile, we can avoid expanding the
6772 built-in call and just evaluate the arguments for side-effects. */
6776 {
6778 tree arg;
6779 call_expr_arg_iterator iter;
6783 {
6786 }
6789 {
6793 }
6794 }
6796 /* expand_builtin_with_bounds is supposed to be used for
6797 instrumented builtin calls. */
6801 {
6819 /* Just do a normal library call if we were unable to fold
6820 the values. */
6897 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6898 FUNCTION with a copy of the parameters described by
6899 ARGUMENTS, and ARGSIZE. It returns a block of memory
6900 allocated on the stack into which is stored all the registers
6901 that might possibly be used for returning the result of a
6902 function. ARGUMENTS is the value returned by
6903 __builtin_apply_args. ARGSIZE is the number of bytes of
6904 arguments that must be copied. ??? How should this value be
6905 computed? We'll also need a safe worst case value for varargs
6906 functions. */
6913 else
6914 {
6922 }
6924 /* __builtin_return (RESULT) causes the function to return the
6925 value described by RESULT. RESULT is address of the block of
6926 memory returned by __builtin_apply. */
6936 /* All valid uses of __builtin_va_arg_pack () are removed during
6937 inlining. */
6942 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6943 inlining. */
6947 /* Return the address of the first anonymous stack arg. */
6969 /* Returns the address of the area where the structure is returned.
6970 0 otherwise. */
6976 else
6979 CASE_BUILT_IN_ALLOCA:
7142 {
7145 }
7149 /* This should have been lowered to the builtins below. */
7153 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7154 and the receiver label. */
7156 {
7162 /* This is copied from the handling of non-local gotos. */
7164 nonlocal_goto_handler_labels
7166 nonlocal_goto_handler_labels);
7167 /* ??? Do not let expand_label treat us as such since we would
7168 not want to be both on the list of non-local labels and on
7169 the list of forced labels. */
7172 }
7176 /* __builtin_setjmp_receiver is passed the receiver label. */
7178 {
7184 }
7187 /* __builtin_longjmp is passed a pointer to an array of five words.
7188 It's similar to the C library longjmp function but works with
7189 __builtin_setjmp above. */
7192 {
7198 {
7201 }
7205 }
7214 /* This updates the setjmp buffer that is its argument with the value
7215 of the current stack pointer. */
7218 {
7219 rtx buf_addr
7224 }
7244 /* Various hooks for the DWARF 2 __throw routine. */
7250 #ifdef DWARF2_UNWIND_INFO
7256 #endif
7456 mode = get_builtin_sync_mode
7468 mode = get_builtin_sync_mode
7515 {
7519 mode =
7525 /* If this is turned into an external library call, the weak parameter
7526 must be dropped to match the expected parameter list. */
7531 /* Skip the boolean weak parameter. */
7536 }
7565 {
7575 }
7581 {
7591 }
7597 {
7607 }
7613 {
7623 }
7629 {
7639 }
7645 {
7655 }
7802 /* We allow user CHKP builtins if Pointer Bounds
7803 Checker is off. */
7805 {
7816 else
7818 }
7819 /* FALLTHROUGH */
7831 /* Software implementation of Pointer Bounds Checker is NYI.
7832 Target support is required. */
7837 /* Do library call, if we failed to expand the builtin when
7838 folding. */
7847 }
7849 /* The switch statement above can drop through to cause the function
7850 to be called normally. */
7852 }
7854 /* Similar to expand_builtin but is used for instrumented calls. */
7856 rtx
7858 rtx subtarget ATTRIBUTE_UNUSED,
7860 {
7873 {
7896 {
7897 /* memcpy_chkp (void *dst, size_t dstbnd,
7898 const void *src, size_t srcbnd, size_t n)
7899 and others take a pointer bound argument just after each
7900 pointer argument. */
7907 }
7911 }
7913 /* The switch statement above can drop through to cause the function
7914 to be called normally. */
7916 }
7918 /* Determine whether a tree node represents a call to a built-in
7919 function. If the tree T is a call to a built-in function with
7920 the right number of arguments of the appropriate types, return
7921 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7922 Otherwise the return value is END_BUILTINS. */
7924 enum built_in_function
7926 {
7929 const_call_expr_arg_iterator iter;
7944 {
7945 /* If a function doesn't take a variable number of arguments,
7946 the last element in the list will have type `void'. */
7949 {
7953 }
7962 {
7965 }
7967 {
7970 }
7972 {
7975 }
7977 {
7980 }
7981 else
7983 }
7985 /* Variable-length argument list. */
7987 }
7989 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7990 evaluate to a constant. */
7992 static tree
7994 {
7995 /* We return 1 for a numeric type that's known to be a constant
7996 value at compile-time or for an aggregate type that's a
7997 literal constant. */
8000 /* If we know this is a constant, emit the constant of one. */
8006 {
8013 }
8015 /* If this expression has side effects, show we don't know it to be a
8016 constant. Likewise if it's a pointer or aggregate type since in
8017 those case we only want literals, since those are only optimized
8018 when generating RTL, not later.
8019 And finally, if we are compiling an initializer, not code, we
8020 need to return a definite result now; there's not going to be any
8021 more optimization done. */
8026 || folding_initializer
8031 }
8033 /* Create builtin_expect with PRED and EXPECTED as its arguments and
8034 return it as a truthvalue. */
8036 static tree
8038 tree predictor)
8039 {
8051 predictor);
8055 }
8057 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
8058 NULL_TREE if no simplification is possible. */
8060 tree
8062 {
8066 /* Distribute the expected value over short-circuiting operators.
8067 See through the cast from truthvalue_type_node to long. */
8074 /* If this is a builtin_expect within a builtin_expect keep the
8075 inner one. See through a comparison against a constant. It
8076 might have been added to create a thruthvalue. */
8092 {
8102 }
8104 /* If the argument isn't invariant then there's nothing else we can do. */
8108 /* If we expect that a comparison against the argument will fold to
8109 a constant return the constant. In practice, this means a true
8110 constant or the address of a non-weak symbol. */
8114 {
8115 do
8116 {
8118 }
8123 }
8125 /* Otherwise, ARG0 already has the proper type for the return value. */
8127 }
8129 /* Fold a call to __builtin_classify_type with argument ARG. */
8131 static tree
8133 {
8138 }
8140 /* Fold a call to __builtin_strlen with argument ARG. */
8142 static tree
8144 {
8147 else
8148 {
8155 }
8156 }
8158 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8160 static tree
8162 {
8163 REAL_VALUE_TYPE real;
8165 /* __builtin_inff is intended to be usable to define INFINITY on all
8166 targets. If an infinity is not available, INFINITY expands "to a
8167 positive constant of type float that overflows at translation
8168 time", footnote "In this case, using INFINITY will violate the
8169 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8170 Thus we pedwarn to ensure this constraint violation is
8171 diagnosed. */
8177 }
8179 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8180 NULL_TREE if no simplification can be made. */
8182 static tree
8185 {
8186 tree type;
8196 /* Calculate the result when the argument is a constant. */
8201 /* Canonicalize sincos to cexpi. */
8203 {
8206 }
8208 {
8215 }
8224 }
8226 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8227 Return NULL_TREE if no simplification can be made. */
8229 static tree
8231 {
8237 /* If the LEN parameter is zero, return zero. */
8242 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8246 /* If len parameter is one, return an expression corresponding to
8247 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8249 {
8251 tree cst_uchar_ptr_node
8254 tree ind1
8258 cst_uchar_ptr_node,
8259 arg1)));
8260 tree ind2
8264 cst_uchar_ptr_node,
8265 arg2)));
8267 }
8270 }
8272 /* Fold a call to builtin isascii with argument ARG. */
8274 static tree
8276 {
8279 else
8280 {
8281 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8287 }
8288 }
8290 /* Fold a call to builtin toascii with argument ARG. */
8292 static tree
8294 {
8298 /* Transform toascii(c) -> (c & 0x7f). */
8301 }
8303 /* Fold a call to builtin isdigit with argument ARG. */
8305 static tree
8307 {
8310 else
8311 {
8312 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8313 /* According to the C standard, isdigit is unaffected by locale.
8314 However, it definitely is affected by the target character set. */
8315 unsigned HOST_WIDE_INT target_digit0
8326 }
8327 }
8329 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8331 static tree
8333 {
8339 }
8341 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8343 static tree
8345 {
8351 }
8353 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8355 static tree
8357 {
8360 {
8364 {
8369 }
8370 }
8373 }
8375 /* Fold a call to builtin frexp, we can assume the base is 2. */
8377 static tree
8379 {
8390 /* Proceed if a valid pointer type was passed in. */
8392 {
8397 {
8399 /* For +-0, return (*exp = 0, +-0). */
8405 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8408 {
8409 /* Since the frexp function always expects base 2, and in
8410 GCC normalized significands are already in the range
8411 [0.5, 1.0), we have exactly what frexp wants. */
8416 }
8420 }
8422 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8426 }
8429 }
8431 /* Fold a call to builtin modf. */
8433 static tree
8435 {
8446 /* Proceed if a valid pointer type was passed in. */
8448 {
8453 {
8456 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8460 /* For +-Inf, return (*arg1 = arg0, +-0). */
8466 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8469 /* If the original number was negative and already
8470 integral, then the fractional part is -0.0. */
8474 }
8476 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8482 }
8485 }
8487 /* Given a location LOC, an interclass builtin function decl FNDECL
8488 and its single argument ARG, return an folded expression computing
8489 the same, or NULL_TREE if we either couldn't or didn't want to fold
8490 (the latter happen if there's an RTL instruction available). */
8492 static tree
8494 {
8495 machine_mode mode;
8507 /* If there is no optab, try generic code. */
8509 {
8510 tree result;
8513 {
8514 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8517 REAL_VALUE_TYPE r;
8521 {
8522 /* NaN and Inf are encoded in the high-order double value
8523 only. The low-order value is not significant. */
8527 }
8534 }
8537 {
8538 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8541 REAL_VALUE_TYPE r;
8545 {
8546 /* NaN and Inf are encoded in the high-order double value
8547 only. The low-order value is not significant. */
8551 }
8557 /*result = fold_build2_loc (loc, UNGT_EXPR,
8558 TREE_TYPE (TREE_TYPE (fndecl)),
8559 fold_build1_loc (loc, ABS_EXPR, type, arg),
8560 build_real (type, r));
8561 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8562 TREE_TYPE (TREE_TYPE (fndecl)),
8563 result);*/
8565 }
8567 {
8568 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8569 islessequal(fabs(x),DBL_MAX). */
8579 {
8580 /* Use double to test the normal range of IBM extended
8581 precision. Emin for IBM extended precision is
8582 different to emin for IEEE double, being 53 higher
8583 since the low double exponent is at least 53 lower
8584 than the high double exponent. */
8588 }
8600 {
8601 /* Testing the high end of the range is done just using
8602 the high double, using the same test as isfinite().
8603 For the subnormal end of the range we first test the
8604 high double, then if its magnitude is equal to the
8605 limit of 0x1p-969, we test whether the low double is
8606 non-zero and opposite sign to the high double. */
8622 integer_type_node,
8628 }
8629 else
8630 {
8631 tree const isge_fn
8634 }
8638 }
8641 }
8644 }
8646 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8647 ARG is the argument for the call. */
8649 static tree
8651 {
8658 {
8666 {
8667 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8668 /* In a boolean context, GCC will fold the inner COND_EXPR to
8669 1. So e.g. "if (isinf_sign(x))" would be folded to just
8670 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8678 {
8691 integer_zero_node);
8692 }
8695 }
8708 {
8711 {
8712 /* NaN and Inf are encoded in the high-order double value
8713 only. The low-order value is not significant. */
8715 }
8716 }
8722 }
8723 }
8725 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8726 This builtin will generate code to return the appropriate floating
8727 point classification depending on the value of the floating point
8728 number passed in. The possible return values must be supplied as
8729 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8730 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8731 one floating point argument which is "type generic". */
8733 static tree
8735 {
8738 machine_mode mode;
8739 REAL_VALUE_TYPE r;
8742 /* Verify the required arguments in the original call. */
8762 /* fpclassify(x) ->
8763 isnan(x) ? FP_NAN :
8764 (fabs(x) == Inf ? FP_INFINITE :
8765 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8766 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8780 {
8786 }
8789 {
8792 }
8795 }
8797 /* Fold a call to an unordered comparison function such as
8798 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8799 being called and ARG0 and ARG1 are the arguments for the call.
8800 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8801 the opposite of the desired result. UNORDERED_CODE is used
8802 for modes that can hold NaNs and ORDERED_CODE is used for
8803 the rest. */
8805 static tree
8809 {
8823 /* Choose the wider of two real types. */
8835 {
8839 }
8844 }
8846 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8847 arithmetics if it can never overflow, or into internal functions that
8848 return both result of arithmetics and overflowed boolean flag in
8849 a complex integer result, or some other check for overflow.
8850 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8851 checking part of that. */
8853 static tree
8856 {
8858 /* The code of the expression corresponding to the type-generic
8859 built-in, or ERROR_MARK for the type-specific ones. */
8864 {
8867 /* FALLTHRU */
8870 /* FALLTHRU */
8881 /* FALLTHRU */
8884 /* FALLTHRU */
8895 /* FALLTHRU */
8898 /* FALLTHRU */
8909 }
8911 /* For the "generic" overloads, the first two arguments can have different
8912 types and the last argument determines the target type to use to check
8913 for overflow. The arguments of the other overloads all have the same
8914 type. */
8917 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8918 arguments are constant, attempt to fold the built-in call into a constant
8919 expression indicating whether or not it detected an overflow. */
8923 /* Perform the computation in the target type and check for overflow. */
8927 arg2);
8941 tree store
8944 }
8946 /* Fold a call to __builtin_FILE to a constant string. */
8950 {
8952 {
8953 /* The documentation says this builtin is equivalent to the preprocessor
8954 __FILE__ macro so it appears appropriate to use the same file prefix
8955 mappings. */
8958 }
8961 }
8963 /* Fold a call to __builtin_FUNCTION to a constant string. */
8967 {
8974 }
8976 /* Fold a call to __builtin_LINE to an integer constant. */
8980 {
8982 }
8984 /* Fold a call to built-in function FNDECL with 0 arguments.
8985 This function returns NULL_TREE if no simplification was possible. */
8987 static tree
8989 {
8993 {
9019 }
9021 }
9023 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9024 This function returns NULL_TREE if no simplification was possible. */
9026 static tree
9028 {
9039 {
9041 {
9044 /* Gimplification will pull the CALL_EXPR for the builtin out of
9045 an if condition. When not optimizing, we'll not CSE it back.
9046 To avoid link error types of regressions, return false now. */
9051 }
9107 {
9112 }
9118 {
9123 }
9144 }
9148 }
9150 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9151 This function returns NULL_TREE if no simplification was possible. */
9153 static tree
9155 {
9167 {
9211 NOP_EXPR);
9213 /* We do the folding for va_start in the expander. */
9228 }
9230 }
9232 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9233 and ARG2.
9234 This function returns NULL_TREE if no simplification was possible. */
9236 static tree
9239 {
9253 {
9299 }
9301 }
9303 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9304 arguments. IGNORE is true if the result of the
9305 function call is ignored. This function returns NULL_TREE if no
9306 simplification was possible. */
9308 tree
9310 {
9314 {
9330 }
9332 {
9337 }
9339 }
9341 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9342 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9343 of arguments in ARGS to be omitted. OLDNARGS is the number of
9344 elements in ARGS. */
9346 static tree
9349 {
9354 {
9362 }
9363 else
9367 }
9369 /* Return true if FNDECL shouldn't be folded right now.
9370 If a built-in function has an inline attribute always_inline
9371 wrapper, defer folding it after always_inline functions have
9372 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9373 might not be performed. */
9375 bool
9377 {
9380 && cfun
9383 }
9385 /* A wrapper function for builtin folding that prevents warnings for
9386 "statement without effect" and the like, caused by removing the
9387 call node earlier than the warning is generated. */
9389 tree
9391 {
9397 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9398 yet. Defer folding until we see all the arguments
9399 (after inlining). */
9401 {
9404 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9405 instead last argument is __builtin_va_arg_pack (). Defer folding
9406 even in that case, until arguments are finalized. */
9408 {
9415 }
9423 else
9424 {
9429 }
9430 }
9432 }
9434 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9435 N arguments are passed in the array ARGARRAY. Return a folded
9436 expression or NULL_TREE if no simplification was possible. */
9438 tree
9440 tree fn,
9443 {
9450 {
9451 /* If last argument is __builtin_va_arg_pack (), arguments to this
9452 function are not finalized yet. Defer folding until they are. */
9454 {
9461 }
9466 else
9468 }
9471 }
9473 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9474 along with N new arguments specified as the "..." parameters. SKIP
9475 is the number of arguments in EXP to be omitted. This function is used
9476 to do varargs-to-varargs transformations. */
9478 static tree
9480 {
9482 tree t;
9490 }
9492 /* Validate a single argument ARG against a tree code CODE representing
9493 a type. Return true when argument is valid. */
9495 static bool
9497 {
9505 }
9507 /* This function validates the types of a function call argument list
9508 against a specified list of tree_codes. If the last specifier is a 0,
9509 that represents an ellipses, otherwise the last specifier must be a
9510 VOID_TYPE.
9512 This is the GIMPLE version of validate_arglist. Eventually we want to
9513 completely convert builtins.c to work from GIMPLEs and the tree based
9514 validate_arglist will then be removed. */
9516 bool
9518 {
9522 const_tree arg;
9528 do
9529 {
9532 {
9534 /* This signifies an ellipses, any further arguments are all ok. */
9538 /* This signifies an endlink, if no arguments remain, return
9539 true, otherwise return false. */
9543 /* If no parameters remain or the parameter's code does not
9544 match the specified code, return false. Otherwise continue
9545 checking any remaining arguments. */
9550 }
9551 }
9554 /* We need gotos here since we can only have one VA_CLOSE in a
9555 function. */
9556 end: ;
9560 }
9562 /* Default target-specific builtin expander that does nothing. */
9564 rtx
9566 rtx target ATTRIBUTE_UNUSED,
9567 rtx subtarget ATTRIBUTE_UNUSED,
9568 machine_mode mode ATTRIBUTE_UNUSED,
9570 {
9572 }
9574 /* Returns true is EXP represents data that would potentially reside
9575 in a readonly section. */
9577 bool
9579 {
9589 /* Make sure we call decl_readonly_section only for trees it
9590 can handle (since it returns true for everything it doesn't
9591 understand). */
9596 else
9598 }
9600 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9601 to the call, and TYPE is its return type.
9603 Return NULL_TREE if no simplification was possible, otherwise return the
9604 simplified form of the call as a tree.
9606 The simplified form may be a constant or other expression which
9607 computes the same value, but in a more efficient manner (including
9608 calls to other builtin functions).
9610 The call may contain arguments which need to be evaluated, but
9611 which are not useful to determine the result of the call. In
9612 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9613 COMPOUND_EXPR will be an argument which must be evaluated.
9614 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9615 COMPOUND_EXPR in the chain will contain the tree for the simplified
9616 form of the builtin function call. */
9618 static tree
9620 {
9624 else
9625 {
9626 tree fn;
9635 {
9637 tree tem;
9642 /* Return an offset into the constant string argument. */
9645 }
9648 /* strpbrk(x, "") == NULL.
9649 Evaluate and ignore s1 in case it had side-effects. */
9659 /* New argument list transforming strpbrk(s1, s2) to
9660 strchr(s1, s2[0]). */
9663 }
9664 }
9666 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9667 to the call.
9669 Return NULL_TREE if no simplification was possible, otherwise return the
9670 simplified form of the call as a tree.
9672 The simplified form may be a constant or other expression which
9673 computes the same value, but in a more efficient manner (including
9674 calls to other builtin functions).
9676 The call may contain arguments which need to be evaluated, but
9677 which are not useful to determine the result of the call. In
9678 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9679 COMPOUND_EXPR will be an argument which must be evaluated.
9680 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9681 COMPOUND_EXPR in the chain will contain the tree for the simplified
9682 form of the builtin function call. */
9684 static tree
9686 {
9690 else
9691 {
9694 /* If either argument is "", return NULL_TREE. */
9696 /* Evaluate and ignore both arguments in case either one has
9697 side-effects. */
9701 }
9702 }
9704 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9705 to the call.
9707 Return NULL_TREE if no simplification was possible, otherwise return the
9708 simplified form of the call as a tree.
9710 The simplified form may be a constant or other expression which
9711 computes the same value, but in a more efficient manner (including
9712 calls to other builtin functions).
9714 The call may contain arguments which need to be evaluated, but
9715 which are not useful to determine the result of the call. In
9716 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9717 COMPOUND_EXPR will be an argument which must be evaluated.
9718 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9719 COMPOUND_EXPR in the chain will contain the tree for the simplified
9720 form of the builtin function call. */
9722 static tree
9724 {
9728 else
9729 {
9730 /* If the first argument is "", return NULL_TREE. */
9733 {
9734 /* Evaluate and ignore argument s2 in case it has
9735 side-effects. */
9738 }
9740 /* If the second argument is "", return __builtin_strlen(s1). */
9743 {
9746 /* If the replacement _DECL isn't initialized, don't do the
9747 transformation. */
9752 }
9754 }
9755 }
9757 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9758 produced. False otherwise. This is done so that we don't output the error
9759 or warning twice or three times. */
9761 bool
9763 {
9766 tree arg;
9767 /* There is good chance the current input_location points inside the
9768 definition of the va_start macro (perhaps on the token for
9769 builtin) in a system header, so warnings will not be emitted.
9770 Use the location in real source code. */
9771 source_location current_location =
9773 NULL);
9776 {
9779 }
9782 {
9784 {
9787 }
9789 }
9790 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9791 when we checked the arguments and if needed issued a warning. */
9792 else
9793 {
9795 {
9796 /* Evidently an out of date version of <stdarg.h>; can't validate
9797 va_start's second argument, but can still work as intended. */
9799 OPT_Wvarargs,
9802 }
9804 {
9807 }
9809 }
9814 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9815 or __builtin_next_arg (0) the first time we see it, after checking
9816 the arguments and if needed issuing a warning. */
9818 {
9821 /* Strip off all nops for the sake of the comparison. This
9822 is not quite the same as STRIP_NOPS. It does more.
9823 We must also strip off INDIRECT_EXPR for C++ reference
9824 parameters. */
9829 {
9830 /* FIXME: Sometimes with the tree optimizers we can get the
9831 not the last argument even though the user used the last
9832 argument. We just warn and set the arg to be the last
9833 argument so that we will get wrong-code because of
9834 it. */
9836 OPT_Wvarargs,
9838 }
9840 /* Undefined by C99 7.15.1.4p4 (va_start):
9841 "If the parameter parmN is declared with the register storage
9842 class, with a function or array type, or with a type that is
9843 not compatible with the type that results after application of
9844 the default argument promotions, the behavior is undefined."
9845 */
9847 {
9849 OPT_Wvarargs,
9850 "undefined behavior when second parameter of "
9852 }
9854 /* We want to verify the second parameter just once before the tree
9855 optimizers are run and then avoid keeping it in the tree,
9856 as otherwise we could warn even for correct code like:
9857 void foo (int i, ...)
9858 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9861 else
9863 }
9865 }
9868 /* Expand a call EXP to __builtin_object_size. */
9870 static rtx
9872 {
9873 tree ost;
9878 {
9883 }
9891 {
9896 }
9901 }
9903 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9904 FCODE is the BUILT_IN_* to use.
9905 Return NULL_RTX if we failed; the caller should emit a normal call,
9906 otherwise try to get the result in TARGET, if convenient (and in
9907 mode MODE if that's convenient). */
9909 static rtx
9912 {
9914 POINTER_TYPE,
9915 fcode == BUILT_IN_MEMSET_CHK
9932 {
9933 /* Avoid transforming the checking call to an ordinary one when
9934 an overflow has been detected or when the call couldn't be
9935 validated because the size is not constant. */
9940 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9941 mem{cpy,pcpy,move,set} is available. */
9943 {
9958 }
9967 }
9970 else
9971 {
9974 /* If DEST is not a pointer type, call the normal function. */
9978 /* If SRC and DEST are the same (and not volatile), do nothing. */
9980 {
9981 tree expr;
9984 {
9985 /* Evaluate and ignore LEN in case it has side-effects. */
9988 }
9992 }
9994 /* __memmove_chk special case. */
9996 {
10002 /* If src is categorized for a readonly section we can use
10003 normal __memcpy_chk. */
10005 {
10014 }
10015 }
10017 }
10018 }
10020 /* Emit warning if a buffer overflow is detected at compile time. */
10022 static void
10024 {
10025 /* The source string. */
10027 /* The size of the destination object. */
10029 /* The string that is being concatenated with (as in __strcat_chk)
10030 or null if it isn't. */
10032 /* The maximum length of the source sequence in a bounded operation
10033 (such as __strncat_chk) or null if the operation isn't bounded
10034 (such as __strcat_chk). */
10036 /* The exact size of the access (such as in __strncpy_chk). */
10040 {
10048 /* For __strcat_chk the warning will be emitted only if overflowing
10049 by at least strlen (dest) + 1 bytes. */
10076 }
10079 {
10080 /* Check __strncat_chk. There is no way to determine the length
10081 of the string to which the source string is being appended so
10082 just warn when the length of the source string is not known. */
10085 }
10087 /* The destination argument is the first one for all built-ins above. */
10091 }
10093 /* Emit warning if a buffer overflow is detected at compile time
10094 in __sprintf_chk/__vsprintf_chk calls. */
10096 static void
10098 {
10103 /* Verify the required arguments in the original call. */
10113 /* Check whether the format is a literal string constant. */
10121 /* If the format doesn't contain % args or %%, we know its size. */
10124 /* If the format is "%s" and first ... argument is a string literal,
10125 we know it too. */
10128 {
10129 tree arg;
10140 }
10141 else
10144 /* Add one for the terminating nul. */
10149 }
10151 /* Emit warning if a free is called with address of a variable. */
10153 static void
10155 {
10169 else
10172 }
10174 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10175 if possible. */
10177 static tree
10179 {
10196 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10197 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10198 and (size_t) 0 for types 2 and 3. */
10203 {
10207 }
10209 {
10210 /* If object size is not known yet, delay folding until
10211 later. Maybe subsequent passes will help determining
10212 it. */
10216 }
10219 }
10221 /* Builtins with folding operations that operate on "..." arguments
10222 need special handling; we need to store the arguments in a convenient
10223 data structure before attempting any folding. Fortunately there are
10224 only a few builtins that fall into this category. FNDECL is the
10225 function, EXP is the CALL_EXPR for the call. */
10227 static tree
10229 {
10234 {
10241 }
10243 {
10248 }
10250 }
10252 /* Initialize format string characters in the target charset. */
10254 bool
10256 {
10259 {
10282 }
10284 }
10286 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10287 and no overflow/underflow occurred. INEXACT is true if M was not
10288 exactly calculated. TYPE is the tree type for the result. This
10289 function assumes that you cleared the MPFR flags and then
10290 calculated M to see if anything subsequently set a flag prior to
10291 entering this function. Return NULL_TREE if any checks fail. */
10293 static tree
10295 {
10296 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10297 overflow/underflow occurred. If -frounding-math, proceed iff the
10298 result of calling FUNC was exact. */
10301 {
10302 REAL_VALUE_TYPE rr;
10305 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10306 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10307 but the mpft_t is not, then we underflowed in the
10308 conversion. */
10311 {
10312 REAL_VALUE_TYPE rmode;
10315 /* Proceed iff the specified mode can hold the value. */
10318 }
10319 }
10321 }
10323 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10324 number and no overflow/underflow occurred. INEXACT is true if M
10325 was not exactly calculated. TYPE is the tree type for the result.
10326 This function assumes that you cleared the MPFR flags and then
10327 calculated M to see if anything subsequently set a flag prior to
10328 entering this function. Return NULL_TREE if any checks fail, if
10329 FORCE_CONVERT is true, then bypass the checks. */
10331 static tree
10333 {
10334 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10335 overflow/underflow occurred. If -frounding-math, proceed iff the
10336 result of calling FUNC was exact. */
10341 {
10346 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10347 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10348 but the mpft_t is not, then we underflowed in the
10349 conversion. */
10354 {
10359 /* Proceed iff the specified mode can hold the value. */
10365 }
10366 }
10368 }
10370 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10371 the pointer *(ARG_QUO) and return the result. The type is taken
10372 from the type of ARG0 and is used for setting the precision of the
10373 calculation and results. */
10375 static tree
10377 {
10384 /* To proceed, MPFR must exactly represent the target floating point
10385 format, which only happens when the target base equals two. */
10389 {
10394 {
10398 tree result_rem;
10407 /* Remquo is independent of the rounding mode, so pass
10408 inexact=0 to do_mpfr_ckconv(). */
10412 {
10413 /* MPFR calculates quo in the host's long so it may
10414 return more bits in quo than the target int can hold
10415 if sizeof(host long) > sizeof(target int). This can
10416 happen even for native compilers in LP64 mode. In
10417 these cases, modulo the quo value with the largest
10418 number that the target int can hold while leaving one
10419 bit for the sign. */
10423 /* Dereference the quo pointer argument. */
10425 /* Proceed iff a valid pointer type was passed in. */
10427 {
10428 /* Set the value. */
10429 tree result_quo
10432 integer_quo));
10434 /* Combine the quo assignment with the rem. */
10437 }
10438 }
10439 }
10440 }
10442 }
10444 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10445 resulting value as a tree with type TYPE. The mpfr precision is
10446 set to the precision of TYPE. We assume that this mpfr function
10447 returns zero if the result could be calculated exactly within the
10448 requested precision. In addition, the integer pointer represented
10449 by ARG_SG will be dereferenced and set to the appropriate signgam
10450 (-1,1) value. */
10452 static tree
10454 {
10459 /* To proceed, MPFR must exactly represent the target floating point
10460 format, which only happens when the target base equals two. Also
10461 verify ARG is a constant and that ARG_SG is an int pointer. */
10466 {
10469 /* In addition to NaN and Inf, the argument cannot be zero or a
10470 negative integer. */
10474 {
10479 mpfr_t m;
10480 tree result_lg;
10489 {
10490 tree result_sg;
10492 /* Dereference the arg_sg pointer argument. */
10494 /* Assign the signgam value into *arg_sg. */
10499 /* Combine the signgam assignment with the lgamma result. */
10502 }
10503 }
10504 }
10507 }
10509 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10510 mpc function FUNC on it and return the resulting value as a tree
10511 with type TYPE. The mpfr precision is set to the precision of
10512 TYPE. We assume that function FUNC returns zero if the result
10513 could be calculated exactly within the requested precision. If
10514 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10515 in the arguments and/or results. */
10517 tree
10520 {
10526 /* To proceed, MPFR must exactly represent the target floating point
10527 format, which only happens when the target base equals two. */
10533 {
10542 {
10562 }
10563 }
10566 }
10568 /* A wrapper function for builtin folding that prevents warnings for
10569 "statement without effect" and the like, caused by removing the
10570 call node earlier than the warning is generated. */
10572 tree
10574 {
10582 {
10591 {
10593 }
10594 else
10595 {
10598 {
10599 /* Propagate location information from original call to
10600 expansion of builtin. Otherwise things like
10601 maybe_emit_chk_warning, that operate on the expansion
10602 of a builtin, will use the wrong location information. */
10604 {
10612 }
10614 }
10615 }
10616 }
10618 }
10620 /* Look up the function in builtin_decl that corresponds to DECL
10621 and set ASMSPEC as its user assembler name. DECL must be a
10622 function decl that declares a builtin. */
10624 void
10626 {
10636 {
10640 }
10641 }
10643 /* Return true if DECL is a builtin that expands to a constant or similarly
10644 simple code. */
10645 bool
10647 {
10650 {
10651 /* Builtins that expand to constants. */
10656 /* Simple register moves or loads from stack. */
10667 /* Exception state returns or moves registers around. */
10675 }
10678 }
10680 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10681 most probably expanded inline into reasonably simple code. This is a
10682 superset of is_simple_builtin. */
10683 bool
10685 {
10692 {
10694 CASE_BUILT_IN_ALLOCA:
10760 }
10763 }
10765 /* Return true if T is a constant and the value cast to a target char
10766 can be represented by a host char.
10767 Store the casted char constant in *P if so. */
10769 bool
10771 {
10777 }
10779 /* Return the maximum object size. */
10781 tree
10783 {
10784 /* To do: Make this a configurable parameter. */
10786 }