| blob | 839a8180e48bdc8b4ee5ce8870761e425ee83b22 |
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. */
77 #if SWITCHABLE_TARGET
79 #endif
81 /* Define the names of the builtin function types and codes. */
85 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
87 {
89 };
91 /* Setup an array of builtin_info_type, make sure each element decl is
92 initialized to NULL_TREE. */
95 /* Non-zero if __builtin_constant_p should be folded right away. */
196 /* Return true if NAME starts with __builtin_ or __sync_. */
198 static bool
200 {
208 }
211 /* Return true if DECL is a function symbol representing a built-in. */
213 bool
215 {
217 }
219 /* Return true if NODE should be considered for inline expansion regardless
220 of the optimization level. This means whenever a function is invoked with
221 its "internal" name, which normally contains the prefix "__builtin". */
223 bool
225 {
226 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
227 we want the name used to call the function, not the name it
228 will have. */
231 }
233 /* Compute values M and N such that M divides (address of EXP - N) and such
234 that N < M. If these numbers can be determined, store M in alignp and N in
235 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
236 *alignp and any bit-offset to *bitposp.
238 Note that the address (and thus the alignment) computed here is based
239 on the address to which a symbol resolves, whereas DECL_ALIGN is based
240 on the address at which an object is actually located. These two
241 addresses are not always the same. For example, on ARM targets,
242 the address &foo of a Thumb function foo() has the lowest bit set,
243 whereas foo() itself starts on an even address.
245 If ADDR_P is true we are taking the address of the memory reference EXP
246 and thus cannot rely on the access taking place. */
248 static bool
251 {
253 tree offset;
254 machine_mode mode;
259 /* Get the innermost object and the constant (bitpos) and possibly
260 variable (offset) offset of the access. */
264 /* Extract alignment information from the innermost object and
265 possibly adjust bitpos and offset. */
267 {
268 /* Function addresses can encode extra information besides their
269 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
270 allows the low bit to be used as a virtual bit, we know
271 that the address itself must be at least 2-byte aligned. */
274 }
276 ;
278 {
279 /* The alignment of a CONST_DECL is determined by its initializer. */
286 }
288 {
291 }
295 {
301 /* If the address is explicitely aligned, handle that. */
304 {
309 }
311 known_alignment
315 /* Re-apply explicit alignment to the bitpos. */
318 /* The alignment of the pointer operand in a TARGET_MEM_REF
319 has to take the variable offset parts into account. */
321 {
323 {
328 }
332 }
334 /* When EXP is an actual memory reference then we can use
335 TYPE_ALIGN of a pointer indirection to derive alignment.
336 Do so only if get_pointer_alignment_1 did not reveal absolute
337 alignment knowledge and if using that alignment would
338 improve the situation. */
344 else
345 {
346 /* Else adjust bitpos accordingly. */
351 }
352 }
354 {
355 /* STRING_CST are the only constant objects we allow to be not
356 wrapped inside a CONST_DECL. */
362 }
364 /* If there is a non-constant offset part extract the maximum
365 alignment that can prevail. */
367 {
370 {
374 }
375 }
377 /* Account for the alignment of runtime coefficients, so that the constant
378 bitpos is guaranteed to be accurate. */
381 {
384 }
389 }
391 /* For a memory reference expression EXP compute values M and N such that M
392 divides (&EXP - N) and such that N < M. If these numbers can be determined,
393 store M in alignp and N in *BITPOSP and return true. Otherwise return false
394 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
396 bool
399 {
401 }
403 /* Return the alignment in bits of EXP, an object. */
405 unsigned int
407 {
413 /* align and bitpos now specify known low bits of the pointer.
414 ptr & (align - 1) == bitpos. */
419 }
421 /* For a pointer valued expression EXP compute values M and N such that M
422 divides (EXP - N) and such that N < M. If these numbers can be determined,
423 store M in alignp and N in *BITPOSP and return true. Return false if
424 the results are just a conservative approximation.
426 If EXP is not a pointer, false is returned too. */
428 bool
431 {
438 {
445 else
446 {
449 {
453 }
454 }
458 }
461 {
466 {
469 /* Make sure to return a sensible alignment when the multiplication
470 by BITS_PER_UNIT overflowed. */
473 /* We cannot really tell whether this result is an approximation. */
475 }
476 else
477 {
481 }
482 }
484 {
489 }
494 }
496 /* Return the alignment in bits of EXP, a pointer valued expression.
497 The alignment returned is, by default, the alignment of the thing that
498 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
500 Otherwise, look at the expression to see if we can do better, i.e., if the
501 expression is actually pointing at an object whose alignment is tighter. */
503 unsigned int
505 {
511 /* align and bitpos now specify known low bits of the pointer.
512 ptr & (align - 1) == bitpos. */
518 }
520 /* Return the number of non-zero elements in the sequence
521 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
522 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
524 static unsigned
526 {
532 {
533 /* Optimize the common case of plain char. */
535 {
539 }
540 }
541 else
542 {
544 {
548 }
549 }
551 }
553 /* Compute the length of a null-terminated character string or wide
554 character string handling character sizes of 1, 2, and 4 bytes.
555 TREE_STRING_LENGTH is not the right way because it evaluates to
556 the size of the character array in bytes (as opposed to characters)
557 and because it can contain a zero byte in the middle.
559 ONLY_VALUE should be nonzero if the result is not going to be emitted
560 into the instruction stream and zero if it is going to be expanded.
561 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
562 is returned, otherwise NULL, since
563 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
564 evaluate the side-effects.
566 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
567 accesses. Note that this implies the result is not going to be emitted
568 into the instruction stream.
570 The value returned is of type `ssizetype'.
572 Unfortunately, string_constant can't access the values of const char
573 arrays with initializers, so neither can we do so here. */
575 tree
577 {
581 {
588 }
596 /* Offset from the beginning of the string in bytes. */
597 tree byteoff;
602 /* Determine the size of the string element. */
603 unsigned eltsize
606 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
607 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
608 in case the latter is less than the size of the array. */
617 /* PTR can point to the byte representation of any string type, including
618 char* and wchar_t*. */
622 {
623 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
624 compute the offset to the following null if we don't know where to
625 start searching for it. */
627 {
628 /* Return when an embedded null character is found. */
630 }
635 /* We don't know the starting offset, but we do know that the string
636 has no internal zero bytes. We can assume that the offset falls
637 within the bounds of the string; otherwise, the programmer deserves
638 what he gets. Subtract the offset from the length of the string,
639 and return that. This would perhaps not be valid if we were dealing
640 with named arrays in addition to literal string constants. */
642 }
644 /* Offset from the beginning of the string in elements. */
645 HOST_WIDE_INT eltoff;
647 /* We have a known offset into the string. Start searching there for
648 a null character if we can represent it as a single HOST_WIDE_INT. */
653 else
656 /* If the offset is known to be out of bounds, warn, and call strlen at
657 runtime. */
659 {
660 /* Suppress multiple warnings for propagated constant strings. */
663 {
666 eltoff);
668 }
670 }
672 /* Use strlen to search for the first zero byte. Since any strings
673 constructed with build_string will have nulls appended, we win even
674 if we get handed something like (char[4])"abcd".
676 Since ELTOFF is our starting index into the string, no further
677 calculation is needed. */
682 }
684 /* Return a constant integer corresponding to target reading
685 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
687 static rtx
689 {
690 HOST_WIDE_INT ch;
704 {
716 }
720 }
722 /* Cast a target constant CST to target CHAR and if that value fits into
723 host char type, return zero and put that value into variable pointed to by
724 P. */
726 static int
728 {
735 /* Do not care if it fits or not right here. */
750 }
752 /* Similar to save_expr, but assumes that arbitrary code is not executed
753 in between the multiple evaluations. In particular, we assume that a
754 non-addressable local variable will not be modified. */
756 static tree
758 {
766 }
768 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
769 times to get the address of either a higher stack frame, or a return
770 address located within it (depending on FNDECL_CODE). */
772 static rtx
774 {
778 {
779 /* For a zero count with __builtin_return_address, we don't care what
780 frame address we return, because target-specific definitions will
781 override us. Therefore frame pointer elimination is OK, and using
782 the soft frame pointer is OK.
784 For a nonzero count, or a zero count with __builtin_frame_address,
785 we require a stable offset from the current frame pointer to the
786 previous one, so we must use the hard frame pointer, and
787 we must disable frame pointer elimination. */
790 else
791 {
794 /* Tell reload not to eliminate the frame pointer. */
796 }
797 }
802 /* On the SPARC, the return address is not in the frame, it is in a
803 register. There is no way to access it off of the current frame
804 pointer, but it can be accessed off the previous frame pointer by
805 reading the value from the register window save area. */
807 count--;
809 /* Scan back COUNT frames to the specified frame. */
811 {
812 /* Assume the dynamic chain pointer is in the word that the
813 frame address points to, unless otherwise specified. */
818 }
820 /* For __builtin_frame_address, return what we've got. But, on
821 the SPARC for example, we may have to add a bias. */
825 /* For __builtin_return_address, get the return address from that frame. */
826 #ifdef RETURN_ADDR_RTX
828 #else
832 #endif
834 }
836 /* Alias set used for setjmp buffer. */
839 /* Construct the leading half of a __builtin_setjmp call. Control will
840 return to RECEIVER_LABEL. This is also called directly by the SJLJ
841 exception handling code. */
843 void
845 {
847 rtx stack_save;
848 rtx mem;
857 /* We store the frame pointer and the address of receiver_label in
858 the buffer and use the rest of it for the stack save area, which
859 is machine-dependent. */
878 /* If there is further processing to do, do it. */
882 /* We have a nonlocal label. */
884 }
886 /* Construct the trailing part of a __builtin_setjmp call. This is
887 also called directly by the SJLJ exception handling code.
888 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
890 void
892 {
893 rtx chain;
895 /* Mark the FP as used when we get here, so we have to make sure it's
896 marked as used by this function. */
899 /* Mark the static chain as clobbered here so life information
900 doesn't get messed up for it. */
905 /* Now put in the code to restore the frame pointer, and argument
906 pointer, if needed. */
908 {
909 /* First adjust our frame pointer to its actual value. It was
910 previously set to the start of the virtual area corresponding to
911 the stacked variables when we branched here and now needs to be
912 adjusted to the actual hardware fp value.
914 Assignments to virtual registers are converted by
915 instantiate_virtual_regs into the corresponding assignment
916 to the underlying register (fp in this case) that makes
917 the original assignment true.
918 So the following insn will actually be decrementing fp by
919 TARGET_STARTING_FRAME_OFFSET. */
922 /* Restoring the frame pointer also modifies the hard frame pointer.
923 Mark it used (so that the previous assignment remains live once
924 the frame pointer is eliminated) and clobbered (to represent the
925 implicit update from the assignment). */
928 }
931 {
932 /* If the argument pointer can be eliminated in favor of the
933 frame pointer, we don't need to restore it. We assume here
934 that if such an elimination is present, it can always be used.
935 This is the case on all known machines; if we don't make this
936 assumption, we do unnecessary saving on many machines. */
946 {
947 /* Now restore our arg pointer from the address at which it
948 was saved in our stack frame. */
951 }
952 }
958 else
961 /* We must not allow the code we just generated to be reordered by
962 scheduling. Specifically, the update of the frame pointer must
963 happen immediately, not later. */
965 }
967 /* __builtin_longjmp is passed a pointer to an array of five words (not
968 all will be used on all machines). It operates similarly to the C
969 library function of the same name, but is more efficient. Much of
970 the code below is copied from the handling of non-local gotos. */
972 static void
974 {
979 /* DRAP is needed for stack realign if longjmp is expanded to current
980 function */
991 /* We require that the user must pass a second argument of 1, because
992 that is what builtin_setjmp will return. */
998 else
999 {
1010 /* Pick up FP, label, and SP from the block and jump. This code is
1011 from expand_goto in stmt.c; see there for detailed comments. */
1013 /* We have to pass a value to the nonlocal_goto pattern that will
1014 get copied into the static_chain pointer, but it does not matter
1015 what that value is, because builtin_setjmp does not use it. */
1017 else
1018 {
1030 }
1031 }
1033 /* Search backwards and mark the jump insn as a non-local goto.
1034 Note that this precludes the use of __builtin_longjmp to a
1035 __builtin_setjmp target in the same function. However, we've
1036 already cautioned the user that these functions are for
1037 internal exception handling use only. */
1039 {
1043 {
1046 }
1049 }
1050 }
1054 {
1056 }
1058 /* This function validates the types of a function call argument list
1059 against a specified list of tree_codes. If the last specifier is a 0,
1060 that represents an ellipsis, otherwise the last specifier must be a
1061 VOID_TYPE. */
1063 static bool
1065 {
1069 const_call_expr_arg_iterator iter;
1070 const_tree arg;
1075 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1080 {
1084 {
1086 /* This signifies an ellipses, any further arguments are all ok. */
1090 /* This signifies an endlink, if no arguments remain, return
1091 true, otherwise return false. */
1095 /* The actual argument must be nonnull when either the whole
1096 called function has been declared nonnull, or when the formal
1097 argument corresponding to the actual argument has been. */
1100 {
1105 }
1106 /* FALLTHRU */
1108 /* If no parameters remain or the parameter's code does not
1109 match the specified code, return false. Otherwise continue
1110 checking any remaining arguments. */
1115 }
1116 }
1118 /* We need gotos here since we can only have one VA_CLOSE in a
1119 function. */
1120 end: ;
1126 }
1128 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1129 and the address of the save area. */
1131 static rtx
1133 {
1148 /* Copy the address of the save location to a register just in case it was
1149 based on the frame pointer. */
1158 /* ??? We no longer need to pass the static chain value, afaik. */
1161 else
1162 {
1168 /* Restore frame pointer for containing function. */
1172 /* USE of hard_frame_pointer_rtx added for consistency;
1173 not clear if really needed. */
1177 /* If the architecture is using a GP register, we must
1178 conservatively assume that the target function makes use of it.
1179 The prologue of functions with nonlocal gotos must therefore
1180 initialize the GP register to the appropriate value, and we
1181 must then make sure that this value is live at the point
1182 of the jump. (Note that this doesn't necessarily apply
1183 to targets with a nonlocal_goto pattern; they are free
1184 to implement it in their own way. Note also that this is
1185 a no-op if the GP register is a global invariant.) */
1191 }
1193 /* Search backwards to the jump insn and mark it as a
1194 non-local goto. */
1196 {
1198 {
1201 }
1204 }
1207 }
1209 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1210 (not all will be used on all machines) that was passed to __builtin_setjmp.
1211 It updates the stack pointer in that block to the current value. This is
1212 also called directly by the SJLJ exception handling code. */
1214 void
1216 {
1219 rtx stack_save
1221 memory_address
1227 }
1229 /* Expand a call to __builtin_prefetch. For a target that does not support
1230 data prefetch, evaluate the memory address argument in case it has side
1231 effects. */
1233 static void
1235 {
1245 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1246 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1247 locality). */
1251 else
1255 else
1258 /* Argument 0 is an address. */
1261 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1263 {
1266 }
1268 /* Argument 1 must be either zero or one. */
1270 {
1274 }
1276 /* Argument 2 (locality) must be a compile-time constant int. */
1278 {
1281 }
1283 /* Argument 2 must be 0, 1, 2, or 3. */
1285 {
1288 }
1291 {
1299 }
1301 /* Don't do anything with direct references to volatile memory, but
1302 generate code to handle other side effects. */
1305 }
1307 /* Get a MEM rtx for expression EXP which is the address of an operand
1308 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1309 the maximum length of the block of memory that might be accessed or
1310 NULL if unknown. */
1312 static rtx
1314 {
1318 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1319 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1326 /* Get an expression we can use to find the attributes to assign to MEM.
1327 First remove any nops. */
1332 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1333 (as builtin stringops may alias with anything). */
1340 /* If the MEM_REF has no acceptable address, try to get the base object
1341 from the original address we got, and build an all-aliasing
1342 unknown-sized access to that one. */
1348 {
1353 size_zero_node,
1354 NULL)),
1357 }
1360 }
1361 \f
1362 /* Built-in functions to perform an untyped call and return. */
1364 #define apply_args_mode \
1365 (this_target_builtins->x_apply_args_mode)
1366 #define apply_result_mode \
1367 (this_target_builtins->x_apply_result_mode)
1369 /* Return the size required for the block returned by __builtin_apply_args,
1370 and initialize apply_args_mode. */
1372 static int
1374 {
1379 /* The values computed by this function never change. */
1381 {
1382 /* The first value is the incoming arg-pointer. */
1385 /* The second value is the structure value address unless this is
1386 passed as an "invisible" first argument. */
1392 {
1402 }
1403 else
1404 {
1406 }
1407 }
1409 }
1411 /* Return the size required for the block returned by __builtin_apply,
1412 and initialize apply_result_mode. */
1414 static int
1416 {
1420 /* The values computed by this function never change. */
1422 {
1427 {
1437 }
1438 else
1441 /* Allow targets that use untyped_call and untyped_return to override
1442 the size so that machine-specific information can be stored here. */
1443 #ifdef APPLY_RESULT_SIZE
1445 #endif
1446 }
1448 }
1450 /* Create a vector describing the result block RESULT. If SAVEP is true,
1451 the result block is used to save the values; otherwise it is used to
1452 restore the values. */
1454 static rtx
1456 {
1458 fixed_size_mode mode;
1465 {
1475 }
1477 }
1479 /* Save the state required to perform an untyped call with the same
1480 arguments as were passed to the current function. */
1482 static rtx
1484 {
1487 fixed_size_mode mode;
1488 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1490 /* Create a block where the arg-pointer, structure value address,
1491 and argument registers can be saved. */
1494 /* Walk past the arg-pointer and structure value address. */
1499 /* Save each register used in calling a function to the block. */
1502 {
1511 }
1513 /* Save the arg pointer to the block. */
1515 /* We need the pointer as the caller actually passed them to us, not
1516 as we might have pretended they were passed. Make sure it's a valid
1517 operand, as emit_move_insn isn't expected to handle a PLUS. */
1519 tem
1522 NULL_RTX);
1527 /* Save the structure value address unless this is passed as an
1528 "invisible" first argument. */
1530 {
1534 }
1536 /* Return the address of the block. */
1538 }
1540 /* __builtin_apply_args returns block of memory allocated on
1541 the stack into which is stored the arg pointer, structure
1542 value address, static chain, and all the registers that might
1543 possibly be used in performing a function call. The code is
1544 moved to the start of the function so the incoming values are
1545 saved. */
1547 static rtx
1549 {
1550 /* Don't do __builtin_apply_args more than once in a function.
1551 Save the result of the first call and reuse it. */
1554 {
1555 /* When this function is called, it means that registers must be
1556 saved on entry to this function. So we migrate the
1557 call to the first insn of this function. */
1558 rtx temp;
1567 /* Put the insns after the NOTE that starts the function.
1568 If this is inside a start_sequence, make the outer-level insn
1569 chain current, so the code is placed at the start of the
1570 function. If internal_arg_pointer is a non-virtual pseudo,
1571 it needs to be placed after the function that initializes
1572 that pseudo. */
1577 else
1581 }
1582 }
1584 /* Perform an untyped call and save the state required to perform an
1585 untyped return of whatever value was returned by the given function. */
1587 static rtx
1589 {
1591 fixed_size_mode mode;
1600 /* Create a block where the return registers can be saved. */
1603 /* Fetch the arg pointer from the ARGUMENTS block. */
1610 /* Push a new argument block and copy the arguments. Do not allow
1611 the (potential) memcpy call below to interfere with our stack
1612 manipulations. */
1614 NO_DEFER_POP;
1616 /* Save the stack with nonlocal if available. */
1619 else
1622 /* Allocate a block of memory onto the stack and copy the memory
1623 arguments to the outgoing arguments address. We can pass TRUE
1624 as the 4th argument because we just saved the stack pointer
1625 and will restore it right after the call. */
1628 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1629 may have already set current_function_calls_alloca to true.
1630 current_function_calls_alloca won't be set if argsize is zero,
1631 so we have to guarantee need_drap is true here. */
1637 {
1640 else
1642 }
1649 /* Refer to the argument block. */
1654 /* Walk past the arg-pointer and structure value address. */
1659 /* Restore each of the registers previously saved. Make USE insns
1660 for each of these registers for use in making the call. */
1663 {
1671 }
1673 /* Restore the structure value address unless this is passed as an
1674 "invisible" first argument. */
1677 {
1684 }
1686 /* All arguments and registers used for the call are set up by now! */
1689 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1690 and we don't want to load it into a register as an optimization,
1691 because prepare_call_address already did it if it should be done. */
1695 /* Generate the actual call instruction and save the return value. */
1697 {
1701 }
1703 {
1706 /* Locate the unique return register. It is not possible to
1707 express a call that sets more than one return register using
1708 call_value; use untyped_call for that. In fact, untyped_call
1709 only needs to save the return registers in the given block. */
1712 {
1716 }
1723 }
1724 else
1727 /* Find the CALL insn we just emitted, and attach the register usage
1728 information. */
1732 /* Restore the stack. */
1735 else
1739 OK_DEFER_POP;
1741 /* Return the address of the result block. */
1744 }
1746 /* Perform an untyped return. */
1748 static void
1750 {
1752 fixed_size_mode mode;
1753 rtx reg;
1762 {
1767 }
1769 /* Restore the return value and note that each value is used. */
1773 {
1785 }
1787 /* Put the USE insns before the return. */
1790 /* Return whatever values was restored by jumping directly to the end
1791 of the function. */
1793 }
1795 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1797 static enum type_class
1799 {
1801 {
1820 }
1821 }
1823 /* Expand a call EXP to __builtin_classify_type. */
1825 static rtx
1827 {
1831 }
1833 /* This helper macro, meant to be used in mathfn_built_in below, determines
1834 which among a set of builtin math functions is appropriate for a given type
1835 mode. The `F' (float) and `L' (long double) are automatically generated
1836 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1837 types, there are additional types that are considered with 'F32', 'F64',
1838 'F128', etc. suffixes. */
1839 #define CASE_MATHFN(MATHFN) \
1840 CASE_CFN_##MATHFN: \
1841 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1842 fcodel = BUILT_IN_##MATHFN##L ; break;
1843 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1844 types. */
1845 #define CASE_MATHFN_FLOATN(MATHFN) \
1846 CASE_CFN_##MATHFN: \
1847 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1848 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1849 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1850 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1851 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1852 break;
1853 /* Similar to above, but appends _R after any F/L suffix. */
1854 #define CASE_MATHFN_REENT(MATHFN) \
1855 case CFN_BUILT_IN_##MATHFN##_R: \
1856 case CFN_BUILT_IN_##MATHFN##F_R: \
1857 case CFN_BUILT_IN_##MATHFN##L_R: \
1858 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1859 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1861 /* Return a function equivalent to FN but operating on floating-point
1862 values of type TYPE, or END_BUILTINS if no such function exists.
1863 This is purely an operation on function codes; it does not guarantee
1864 that the target actually has an implementation of the function. */
1866 static built_in_function
1868 {
1869 tree mtype;
1880 {
1971 }
1994 else
1996 }
1998 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1999 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2000 otherwise use the explicit declaration. If we can't do the conversion,
2001 return null. */
2003 static tree
2005 {
2014 }
2016 /* Like mathfn_built_in_1, but always use the implicit array. */
2018 tree
2020 {
2022 }
2024 /* Like mathfn_built_in_1, but take a built_in_function and
2025 always use the implicit array. */
2027 tree
2029 {
2031 }
2033 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2034 return its code, otherwise return IFN_LAST. Note that this function
2035 only tests whether the function is defined in internals.def, not whether
2036 it is actually available on the target. */
2038 internal_fn
2040 {
2044 {
2045 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2046 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2047 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2048 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2049 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2050 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2051 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2068 }
2069 }
2071 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2072 on the current target by a call to an internal function, return the
2073 code of that internal function, otherwise return IFN_LAST. The caller
2074 is responsible for ensuring that any side-effects of the built-in
2075 call are dealt with correctly. E.g. if CALL sets errno, the caller
2076 must decide that the errno result isn't needed or make it available
2077 in some other way. */
2079 internal_fn
2081 {
2083 {
2086 {
2091 }
2092 }
2094 }
2096 /* Expand a call to the builtin trinary math functions (fma).
2097 Return NULL_RTX if a normal call should be emitted rather than expanding the
2098 function in-line. EXP is the expression that is a call to the builtin
2099 function; if convenient, the result should be placed in TARGET.
2100 SUBTARGET may be used as the target for computing one of EXP's
2101 operands. */
2103 static rtx
2105 {
2106 optab builtin_optab;
2111 machine_mode mode;
2121 {
2127 }
2129 /* Make a suitable register to place result in. */
2132 /* Before working hard, check whether the instruction is available. */
2138 /* Always stabilize the argument list. */
2149 /* Compute into RESULT.
2150 Set RESULT to wherever the result comes back. */
2154 /* If we were unable to expand via the builtin, stop the sequence
2155 (without outputting the insns) and call to the library function
2156 with the stabilized argument list. */
2158 {
2161 }
2163 /* Output the entire sequence. */
2169 }
2171 /* Expand a call to the builtin sin and cos math functions.
2172 Return NULL_RTX if a normal call should be emitted rather than expanding the
2173 function in-line. EXP is the expression that is a call to the builtin
2174 function; if convenient, the result should be placed in TARGET.
2175 SUBTARGET may be used as the target for computing one of EXP's
2176 operands. */
2178 static rtx
2180 {
2181 optab builtin_optab;
2182 rtx op0;
2185 machine_mode mode;
2186 tree arg;
2194 {
2200 }
2202 /* Make a suitable register to place result in. */
2205 /* Check if sincos insn is available, otherwise fallback
2206 to sin or cos insn. */
2209 {
2216 }
2218 /* Before working hard, check whether the instruction is available. */
2220 {
2223 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2224 need to expand the argument again. This way, we will not perform
2225 side-effects more the once. */
2232 /* Compute into RESULT.
2233 Set RESULT to wherever the result comes back. */
2235 {
2239 {
2248 }
2250 }
2251 else
2255 {
2256 /* Output the entire sequence. */
2261 }
2263 /* If we were unable to expand via the builtin, stop the sequence
2264 (without outputting the insns) and call to the library function
2265 with the stabilized argument list. */
2267 }
2270 }
2272 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2273 return an RTL instruction code that implements the functionality.
2274 If that isn't possible or available return CODE_FOR_nothing. */
2276 static enum insn_code
2278 {
2281 machine_mode mode;
2284 {
2298 /* These builtins have no optabs (yet). */
2302 }
2304 /* There's no easy way to detect the case we need to set EDOM. */
2308 /* Optab mode depends on the mode of the input argument. */
2314 }
2316 /* Expand a call to one of the builtin math functions that operate on
2317 floating point argument and output an integer result (ilogb, isinf,
2318 isnan, etc).
2319 Return 0 if a normal call should be emitted rather than expanding the
2320 function in-line. EXP is the expression that is a call to the builtin
2321 function; if convenient, the result should be placed in TARGET. */
2323 static rtx
2325 {
2327 rtx op0;
2329 machine_mode mode;
2330 tree arg;
2340 {
2345 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2346 need to expand the argument again. This way, we will not perform
2347 side-effects more the once. */
2362 }
2365 }
2367 /* Expand a call to the builtin sincos math function.
2368 Return NULL_RTX if a normal call should be emitted rather than expanding the
2369 function in-line. EXP is the expression that is a call to the builtin
2370 function. */
2372 static rtx
2374 {
2376 machine_mode mode;
2390 /* Make a suitable register to place result in. */
2393 /* Check if sincos insn is available, otherwise emit the call. */
2408 /* Compute into target1 and target2.
2409 Set TARGET to wherever the result comes back. */
2413 /* Move target1 and target2 to the memory locations indicated
2414 by op1 and op2. */
2419 }
2421 /* Expand a call to the internal cexpi builtin to the sincos math function.
2422 EXP is the expression that is a call to the builtin function; if convenient,
2423 the result should be placed in TARGET. */
2425 static rtx
2427 {
2430 machine_mode mode;
2441 /* Try expanding via a sincos optab, fall back to emitting a libcall
2442 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2443 is only generated from sincos, cexp or if we have either of them. */
2445 {
2451 /* Compute into op1 and op2. */
2453 }
2455 {
2466 else
2476 /* Make sure not to fold the sincos call again. */
2480 }
2481 else
2482 {
2492 else
2495 /* If we don't have a decl for cexp create one. This is the
2496 friendliest fallback if the user calls __builtin_cexpi
2497 without full target C99 function support. */
2499 {
2500 tree fntype;
2512 }
2517 /* Make sure not to fold the cexp call again. */
2521 }
2523 /* Now build the proper return type. */
2528 }
2530 /* Conveniently construct a function call expression. FNDECL names the
2531 function to be called, N is the number of arguments, and the "..."
2532 parameters are the argument expressions. Unlike build_call_exr
2533 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2535 static tree
2537 {
2547 }
2549 /* Expand a call to one of the builtin rounding functions gcc defines
2550 as an extension (lfloor and lceil). As these are gcc extensions we
2551 do not need to worry about setting errno to EDOM.
2552 If expanding via optab fails, lower expression to (int)(floor(x)).
2553 EXP is the expression that is a call to the builtin function;
2554 if convenient, the result should be placed in TARGET. */
2556 static rtx
2558 {
2559 convert_optab builtin_optab;
2564 tree fallback_fndecl;
2565 machine_mode mode;
2566 tree arg;
2574 {
2591 }
2593 /* Make a suitable register to place result in. */
2598 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2599 need to expand the argument again. This way, we will not perform
2600 side-effects more the once. */
2607 /* Compute into TARGET. */
2609 {
2610 /* Output the entire sequence. */
2615 }
2617 /* If we were unable to expand via the builtin, stop the sequence
2618 (without outputting the insns). */
2621 /* Fall back to floating point rounding optab. */
2624 /* For non-C99 targets we may end up without a fallback fndecl here
2625 if the user called __builtin_lfloor directly. In this case emit
2626 a call to the floor/ceil variants nevertheless. This should result
2627 in the best user experience for not full C99 targets. */
2629 {
2630 tree fntype;
2634 {
2667 }
2672 }
2679 /* Truncate the result of floating point optab to integer
2680 via expand_fix (). */
2685 }
2687 /* Expand a call to one of the builtin math functions doing integer
2688 conversion (lrint).
2689 Return 0 if a normal call should be emitted rather than expanding the
2690 function in-line. EXP is the expression that is a call to the builtin
2691 function; if convenient, the result should be placed in TARGET. */
2693 static rtx
2695 {
2696 convert_optab builtin_optab;
2697 rtx op0;
2700 tree arg;
2701 machine_mode mode;
2710 {
2729 }
2731 /* There's no easy way to detect the case we need to set EDOM. */
2735 /* Make a suitable register to place result in. */
2738 /* There's no easy way to detect the case we need to set EDOM. */
2740 {
2743 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2744 need to expand the argument again. This way, we will not perform
2745 side-effects more the once. */
2753 {
2754 /* Output the entire sequence. */
2759 }
2761 /* If we were unable to expand via the builtin, stop the sequence
2762 (without outputting the insns) and call to the library function
2763 with the stabilized argument list. */
2765 }
2768 {
2769 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2770 targets, (int) round (x) should never be transformed into
2771 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2772 a call to lround in the hope that the target provides at least some
2773 C99 functions. This should result in the best user experience for
2774 not full C99 targets. */
2775 tree fallback_fndecl = mathfn_built_in_1
2784 }
2787 }
2789 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2790 a normal call should be emitted rather than expanding the function
2791 in-line. EXP is the expression that is a call to the builtin
2792 function; if convenient, the result should be placed in TARGET. */
2794 static rtx
2796 {
2799 machine_mode mode;
2800 machine_mode mode2;
2809 /* Emit a libcall to libgcc. */
2811 /* Mode of the 2nd argument must match that of an int. */
2829 }
2831 /* Expand expression EXP which is a call to the strlen builtin. Return
2832 NULL_RTX if we failed and the caller should emit a normal call, otherwise
2833 try to get the result in TARGET, if convenient. */
2835 static rtx
2837 machine_mode target_mode)
2838 {
2843 rtx pat;
2844 tree len;
2846 rtx src_reg;
2848 machine_mode insn_mode;
2852 /* If the length can be computed at compile-time, return it. */
2857 /* If the length can be computed at compile-time and is constant
2858 integer, but there are side-effects in src, evaluate
2859 src for side-effects, then return len.
2860 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2861 can be optimized into: i++; x = 3; */
2864 {
2867 }
2871 /* If SRC is not a pointer type, don't do this operation inline. */
2875 /* Bail out if we can't compute strlen in the right mode. */
2877 {
2881 }
2885 /* Make a place to hold the source address. We will not expand
2886 the actual source until we are sure that the expansion will
2887 not fail -- there are trees that cannot be expanded twice. */
2890 /* Mark the beginning of the strlen sequence so we can emit the
2891 source operand later. */
2901 /* Check to see if the argument was declared attribute nonstring
2902 and if so, issue a warning since at this point it's not known
2903 to be nul-terminated. */
2906 /* Now that we are assured of success, expand the source. */
2910 {
2911 #ifdef POINTERS_EXTEND_UNSIGNED
2914 POINTERS_EXTEND_UNSIGNED);
2915 #endif
2917 }
2923 else
2926 /* Return the value in the proper mode for this function. */
2931 else
2935 }
2937 /* Expand call EXP to the strnlen built-in, returning the result
2938 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
2940 static rtx
2942 {
2962 {
2966 "%K%qD specified bound %E "
2977 }
2990 "%K%qD specified bound [%wu, %wu] "
3003 }
3005 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3006 bytes from constant string DATA + OFFSET and return it as target
3007 constant. */
3009 static rtx
3011 scalar_int_mode mode)
3012 {
3020 }
3022 /* LEN specify length of the block of memcpy/memset operation.
3023 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3024 In some cases we can make very likely guess on max size, then we
3025 set it into PROBABLE_MAX_SIZE. */
3027 static void
3032 {
3034 {
3037 }
3038 else
3039 {
3043 /* Determine bounds from the type. */
3046 else
3051 else
3057 {
3062 }
3064 {
3065 /* Anti range 0...N lets us to determine minimal size to N+1. */
3067 {
3070 }
3071 /* Code like
3073 int n;
3074 if (n < 100)
3075 memcpy (a, b, n)
3077 Produce anti range allowing negative values of N. We still
3078 can use the information and make a guess that N is not negative.
3079 */
3082 }
3083 }
3087 }
3089 /* Try to verify that the sizes and lengths of the arguments to a string
3090 manipulation function given by EXP are within valid bounds and that
3091 the operation does not lead to buffer overflow or read past the end.
3092 Arguments other than EXP may be null. When non-null, the arguments
3093 have the following meaning:
3094 DST is the destination of a copy call or NULL otherwise.
3095 SRC is the source of a copy call or NULL otherwise.
3096 DSTWRITE is the number of bytes written into the destination obtained
3097 from the user-supplied size argument to the function (such as in
3098 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3099 MAXREAD is the user-supplied bound on the length of the source sequence
3100 (such as in strncat(d, s, N). It specifies the upper limit on the number
3101 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3102 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3103 expression EXP is a string function call (as opposed to a memory call
3104 like memcpy). As an exception, SRCSTR can also be an integer denoting
3105 the precomputed size of the source string or object (for functions like
3106 memcpy).
3107 DSTSIZE is the size of the destination object specified by the last
3108 argument to the _chk builtins, typically resulting from the expansion
3109 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3110 DSTSIZE).
3112 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3113 SIZE_MAX.
3115 If the call is successfully verified as safe return true, otherwise
3116 return false. */
3118 static bool
3121 {
3124 /* The size of the largest object is half the address space, or
3125 PTRDIFF_MAX. (This is way too permissive.) */
3128 /* Either the length of the source string for string functions or
3129 the size of the source object for raw memory functions. */
3134 /* Set to true when the exact number of bytes written by a string
3135 function like strcpy is not known and the only thing that is
3136 known is that it must be at least one (for the terminating nul). */
3139 {
3140 /* SRCSTR is normally a pointer to string but as a special case
3141 it can be an integer denoting the length of a string. */
3143 {
3144 /* Try to determine the range of lengths the source string
3145 refers to. If it can be determined and is less than
3146 the upper bound given by MAXREAD add one to it for
3147 the terminating nul. Otherwise, set it to one for
3148 the same reason, or to MAXREAD as appropriate. */
3151 {
3154 else
3165 }
3166 else
3167 {
3170 }
3171 }
3172 else
3174 }
3177 {
3178 /* When the only available piece of data is the object size
3179 there is nothing to do. */
3183 /* Otherwise, when the length of the source sequence is known
3184 (as with strlen), set DSTWRITE to it. */
3187 }
3197 /* First check the number of bytes to be written against the maximum
3198 object size. */
3200 {
3210 "%K%qD specified size %E "
3213 else
3215 "%K%qD specified size between %E and %E "
3223 }
3225 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3226 constant, and in range of unsigned HOST_WIDE_INT. */
3229 /* Next check the number of bytes to be written against the destination
3230 object size. */
3232 {
3238 {
3246 {
3247 /* This is a call to strcpy with a destination of 0 size
3248 and a source of unknown length. The call will write
3249 at least one byte past the end of the destination. */
3251 "%K%qD writing %E or more bytes into a region "
3254 }
3257 "%K%qD writing %E byte into a region "
3259 "%K%qD writing %E bytes into a region "
3263 {
3264 /* Avoid printing the upper bound if it's invalid. */
3266 "%K%qD writing %E or more bytes into a region "
3269 }
3270 else
3272 "%K%qD writing between %E and %E bytes into "
3275 dstsize);
3277 /* Return error when an overflow has been detected. */
3279 }
3280 }
3282 /* Check the maximum length of the source sequence against the size
3283 of the destination object if known, or against the maximum size
3284 of an object. */
3286 {
3289 /* Use the lower end for MAXREAD from now on. */
3294 {
3299 {
3303 /* Warn about crazy big sizes first since that's more
3304 likely to be meaningful than saying that the bound
3305 is greater than the object size if both are big. */
3308 "%K%qD specified bound %E "
3312 else
3314 "%K%qD specified bound between %E and %E "
3320 }
3323 {
3329 "%K%qD specified bound %E "
3333 else
3335 "%K%qD specified bound between %E and %E "
3340 }
3341 }
3342 }
3344 /* Check for reading past the end of SRC. */
3349 {
3361 {
3362 /* Avoid printing the upper bound if it's invalid. */
3364 "%K%qD reading %E or more bytes from a region "
3367 }
3368 else
3370 "%K%qD reading between %E and %E bytes from a region "
3374 }
3377 }
3379 /* Helper to compute the size of the object referenced by the DEST
3380 expression which must have pointer type, using Object Size type
3381 OSTYPE (only the least significant 2 bits are used). Return
3382 an estimate of the size of the object if successful or NULL when
3383 the size cannot be determined. When the referenced object involves
3384 a non-constant offset in some range the returned value represents
3385 the largest size given the smallest non-negative offset in the
3386 range. The function is intended for diagnostics and should not
3387 be used to influence code generation or optimization. */
3389 tree
3391 {
3394 /* Only the two least significant bits are meaningful. */
3401 {
3410 {
3411 /* compute_builtin_object_size fails for addresses with
3412 non-constant offsets. Try to determine the range of
3413 such an offset here and use it to adjust the constant
3414 size. */
3417 {
3419 {
3423 /* Ignore negative offsets for now. For others,
3424 use the lower bound as the most optimistic
3425 estimate of the (remaining) size. */
3427 ;
3431 else
3433 }
3434 }
3437 {
3442 {
3444 {
3447 /* Ignore negative offsets for now. For others,
3448 use the lower bound as the most optimistic
3449 estimate of the (remaining)size. */
3451 ;
3455 else
3457 }
3458 }
3459 }
3460 }
3463 }
3465 /* Unless computing the largest size (for memcpy and other raw memory
3466 functions), try to determine the size of the object from its type. */
3481 {
3482 /* Return the constant size unless it's zero (that's a zero-length
3483 array likely at the end of a struct). */
3488 }
3491 }
3493 /* Helper to determine and check the sizes of the source and the destination
3494 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3495 call expression, DEST is the destination argument, SRC is the source
3496 argument or null, and LEN is the number of bytes. Use Object Size type-0
3497 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3498 (no overflow or invalid sizes), false otherwise. */
3500 static bool
3502 {
3503 /* For functions like memset and memcpy that operate on raw memory
3504 try to determine the size of the largest source and destination
3505 object using type-0 Object Size regardless of the object size
3506 type specified by the option. */
3512 }
3514 /* Validate memchr arguments without performing any expansion.
3515 Return NULL_RTX. */
3517 static rtx
3519 {
3527 /* Diagnose calls where the specified length exceeds the size
3528 of the object. */
3530 {
3534 }
3537 }
3539 /* Expand a call EXP to the memcpy builtin.
3540 Return NULL_RTX if we failed, the caller should emit a normal call,
3541 otherwise try to get the result in TARGET, if convenient (and in
3542 mode MODE if that's convenient). */
3544 static rtx
3546 {
3559 }
3561 /* Check a call EXP to the memmove built-in for validity.
3562 Return NULL_RTX on both success and failure. */
3564 static rtx
3566 {
3578 }
3580 /* Expand a call EXP to the mempcpy builtin.
3581 Return NULL_RTX if we failed; the caller should emit a normal call,
3582 otherwise try to get the result in TARGET, if convenient (and in
3583 mode MODE if that's convenient). If ENDP is 0 return the
3584 destination pointer, if ENDP is 1 return the end pointer ala
3585 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3586 stpcpy. */
3588 static rtx
3590 {
3599 /* Policy does not generally allow using compute_objsize (which
3600 is used internally by check_memop_size) to change code generation
3601 or drive optimization decisions.
3603 In this instance it is safe because the code we generate has
3604 the same semantics regardless of the return value of
3605 check_memop_sizes. Exactly the same amount of data is copied
3606 and the return value is exactly the same in both cases.
3608 Furthermore, check_memop_size always uses mode 0 for the call to
3609 compute_objsize, so the imprecise nature of compute_objsize is
3610 avoided. */
3612 /* Avoid expanding mempcpy into memcpy when the call is determined
3613 to overflow the buffer. This also prevents the same overflow
3614 from being diagnosed again when expanding memcpy. */
3620 }
3622 /* Helper function to do the actual work for expand of memory copy family
3623 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3624 of memory from SRC to DEST and assign to TARGET if convenient.
3625 If ENDP is 0 return the
3626 destination pointer, if ENDP is 1 return the end pointer ala
3627 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3628 stpcpy. */
3630 static rtx
3633 {
3644 /* If DEST is not a pointer type, call the normal function. */
3648 /* If either SRC is not a pointer type, don't do this
3649 operation in-line. */
3666 /* If SRC is a string constant and block move would be done
3667 by pieces, we can avoid loading the string from memory
3668 and only stored the computed constants. */
3675 {
3677 builtin_memcpy_read_str,
3683 }
3688 /* Copy word part most expediently. */
3701 {
3704 }
3707 {
3709 /* stpcpy pointer to last byte. */
3712 }
3715 }
3717 static rtx
3720 {
3722 endp);
3723 }
3725 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3726 we failed, the caller should emit a normal call, otherwise try to
3727 get the result in TARGET, if convenient. If ENDP is 0 return the
3728 destination pointer, if ENDP is 1 return the end pointer ala
3729 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3730 stpcpy. */
3732 static rtx
3734 {
3736 rtx dest_mem;
3737 rtx src_mem;
3745 {
3748 }
3757 {
3759 /* movstr is supposed to set end to the address of the NUL
3760 terminator. If the caller requested a mempcpy-like return value,
3761 adjust it. */
3763 {
3767 }
3768 }
3770 }
3772 /* Do some very basic size validation of a call to the strcpy builtin
3773 given by EXP. Return NULL_RTX to have the built-in expand to a call
3774 to the library function. */
3776 static rtx
3778 {
3786 /* There is no way here to determine the length of the string in
3787 the destination to which the SRC string is being appended so
3788 just diagnose cases when the souce string is longer than
3789 the destination object. */
3794 destsize);
3797 }
3799 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3800 NULL_RTX if we failed the caller should emit a normal call, otherwise
3801 try to get the result in TARGET, if convenient (and in mode MODE if that's
3802 convenient). */
3804 static rtx
3806 {
3814 {
3818 }
3821 {
3822 /* Check to see if the argument was declared attribute nonstring
3823 and if so, issue a warning since at this point it's not known
3824 to be nul-terminated. */
3828 }
3831 }
3833 /* Helper function to do the actual work for expand_builtin_strcpy. The
3834 arguments to the builtin_strcpy call DEST and SRC are broken out
3835 so that this can also be called without constructing an actual CALL_EXPR.
3836 The other arguments and return value are the same as for
3837 expand_builtin_strcpy. */
3839 static rtx
3841 {
3843 }
3845 /* Expand a call EXP to the stpcpy builtin.
3846 Return NULL_RTX if we failed the caller should emit a normal call,
3847 otherwise try to get the result in TARGET, if convenient (and in
3848 mode MODE if that's convenient). */
3850 static rtx
3852 {
3863 {
3867 }
3869 /* If return value is ignored, transform stpcpy into strcpy. */
3871 {
3875 }
3876 else
3877 {
3879 rtx ret;
3881 /* Ensure we get an actual string whose length can be evaluated at
3882 compile-time, not an expression containing a string. This is
3883 because the latter will potentially produce pessimized code
3884 when used to produce the return value. */
3896 {
3900 {
3904 {
3906 {
3909 else
3911 }
3920 }
3921 }
3922 }
3925 }
3926 }
3928 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
3929 arguments while being careful to avoid duplicate warnings (which could
3930 be issued if the expander were to expand the call, resulting in it
3931 being emitted in expand_call(). */
3933 static rtx
3935 {
3937 {
3938 /* The call has been successfully expanded. Check for nonstring
3939 arguments and issue warnings as appropriate. */
3942 }
3945 }
3947 /* Check a call EXP to the stpncpy built-in for validity.
3948 Return NULL_RTX on both success and failure. */
3950 static rtx
3952 {
3958 /* The source and destination of the call. */
3962 /* The exact number of bytes to write (not the maximum). */
3965 /* The size of the destination object. */
3971 }
3973 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3974 bytes from constant string DATA + OFFSET and return it as target
3975 constant. */
3977 rtx
3979 scalar_int_mode mode)
3980 {
3987 }
3989 /* Helper to check the sizes of sequences and the destination of calls
3990 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3991 success (no overflow or invalid sizes), false otherwise. */
3993 static bool
3995 {
4000 /* Try to determine the range of lengths that the source expression
4001 refers to. */
4005 /* Try to verify that the destination is big enough for the shortest
4006 string. */
4009 {
4010 /* If it hasn't been provided by __strncat_chk, try to determine
4011 the size of the destination object into which the source is
4012 being copied. */
4014 }
4016 /* Add one for the terminating nul. */
4019 size_one_node)
4022 /* The strncat function copies at most MAXREAD bytes and always appends
4023 the terminating nul so the specified upper bound should never be equal
4024 to (or greater than) the size of the destination. */
4027 {
4036 }
4044 /* The number of bytes to write is LEN but check_access will also
4045 check SRCLEN if LEN's value isn't known. */
4047 objsize);
4048 }
4050 /* Similar to expand_builtin_strcat, do some very basic size validation
4051 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4052 the built-in expand to a call to the library function. */
4054 static rtx
4056 {
4064 /* The upper bound on the number of bytes to write. */
4066 /* The length of the source sequence. */
4069 /* Try to determine the range of lengths that the source expression
4070 refers to. */
4074 else
4077 /* Try to verify that the destination is big enough for the shortest
4078 string. First try to determine the size of the destination object
4079 into which the source is being copied. */
4082 /* Add one for the terminating nul. */
4085 size_one_node)
4088 /* The strncat function copies at most MAXREAD bytes and always appends
4089 the terminating nul so the specified upper bound should never be equal
4090 to (or greater than) the size of the destination. */
4093 {
4102 }
4110 /* The number of bytes to write is SRCLEN. */
4114 }
4116 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4117 NULL_RTX if we failed the caller should emit a normal call. */
4119 static rtx
4121 {
4126 {
4129 /* The number of bytes to write (not the maximum). */
4131 /* The length of the source sequence. */
4135 {
4139 /* The number of bytes to write is LEN but check_access will also
4140 check SLEN if LEN's value isn't known. */
4142 destsize);
4143 }
4145 /* We must be passed a constant len and src parameter. */
4151 /* We're required to pad with trailing zeros if the requested
4152 len is greater than strlen(s2)+1. In that case try to
4153 use store_by_pieces, if it fails, punt. */
4155 {
4158 rtx dest_mem;
4162 builtin_strncpy_read_str,
4169 builtin_strncpy_read_str,
4174 }
4175 }
4177 }
4179 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4180 bytes from constant string DATA + OFFSET and return it as target
4181 constant. */
4183 rtx
4185 scalar_int_mode mode)
4186 {
4193 }
4195 /* Callback routine for store_by_pieces. Return the RTL of a register
4196 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4197 char value given in the RTL register data. For example, if mode is
4198 4 bytes wide, return the RTL for 0x01010101*data. */
4200 static rtx
4202 scalar_int_mode mode)
4203 {
4219 }
4221 /* Expand expression EXP, which is a call to the memset builtin. Return
4222 NULL_RTX if we failed the caller should emit a normal call, otherwise
4223 try to get the result in TARGET, if convenient (and in mode MODE if that's
4224 convenient). */
4226 static rtx
4228 {
4240 }
4242 /* Helper function to do the actual work for expand_builtin_memset. The
4243 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4244 so that this can also be called without constructing an actual CALL_EXPR.
4245 The other arguments and return value are the same as for
4246 expand_builtin_memset. */
4248 static rtx
4251 {
4254 machine_mode val_mode;
4266 /* If DEST is not a pointer type, don't do this operation in-line. */
4277 /* If the LEN parameter is zero, return DEST. */
4279 {
4280 /* Evaluate and ignore VAL in case it has side-effects. */
4283 }
4285 /* Stabilize the arguments in case we fail. */
4297 {
4298 rtx val_rtx;
4303 /* Assume that we can memset by pieces if we can store
4304 * the coefficients by pieces (in the required modes).
4305 * We can't pass builtin_memset_gen_str as that emits RTL. */
4311 {
4316 }
4320 probable_max_size))
4326 }
4332 {
4343 probable_max_size))
4349 }
4357 probable_max_size);
4360 {
4363 }
4367 do_libcall:
4376 else
4381 }
4383 /* Expand expression EXP, which is a call to the bzero builtin. Return
4384 NULL_RTX if we failed the caller should emit a normal call. */
4386 static rtx
4388 {
4397 /* New argument list transforming bzero(ptr x, int y) to
4398 memset(ptr x, int 0, size_t y). This is done this way
4399 so that if it isn't expanded inline, we fallback to
4400 calling bzero instead of memset. */
4408 }
4410 /* Try to expand cmpstr operation ICODE with the given operands.
4411 Return the result rtx on success, otherwise return null. */
4413 static rtx
4415 HOST_WIDE_INT align)
4416 {
4430 }
4432 /* Expand expression EXP, which is a call to the memcmp built-in function.
4433 Return NULL_RTX if we failed and the caller should emit a normal call,
4434 otherwise try to get the result in TARGET, if convenient.
4435 RESULT_EQ is true if we can relax the returned value to be either zero
4436 or nonzero, without caring about the sign. */
4438 static rtx
4440 {
4451 /* Diagnose calls where the specified length exceeds the size of either
4452 object. */
4458 {
4463 }
4465 /* Due to the performance benefit, always inline the calls first
4466 when result_eq is false. */
4470 {
4474 }
4482 /* If we don't have POINTER_TYPE, call the function. */
4490 /* Set MEM_SIZE as appropriate. */
4492 {
4495 }
4501 {
4505 }
4507 /* If SRC is a string constant and block move would be done
4508 by pieces, we can avoid loading the string from memory
4509 and only stored the computed constants. */
4521 {
4522 /* Return the value in the proper mode for this function. */
4527 {
4530 }
4533 }
4536 }
4538 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4539 if we failed the caller should emit a normal call, otherwise try to get
4540 the result in TARGET, if convenient. */
4542 static rtx
4544 {
4548 /* Due to the performance benefit, always inline the calls first. */
4565 /* If we don't have POINTER_TYPE, call the function. */
4569 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4576 /* Try to call cmpstrsi. */
4581 /* Try to determine at least one length and call cmpstrnsi. */
4583 {
4584 tree len;
4585 rtx arg3_rtx;
4595 /* If we don't have a constant length for the first, use the length
4596 of the second, if we know it. We don't require a constant for
4597 this case; some cost analysis could be done if both are available
4598 but neither is constant. For now, assume they're equally cheap,
4599 unless one has side effects. If both strings have constant lengths,
4600 use the smaller. */
4616 else
4619 /* If both arguments have side effects, we cannot optimize. */
4621 {
4623 result = expand_cmpstrn_or_cmpmem
4626 }
4627 }
4631 {
4632 /* Check to see if the argument was declared attribute nonstring
4633 and if so, issue a warning since at this point it's not known
4634 to be nul-terminated. */
4637 /* Return the value in the proper mode for this function. */
4645 }
4647 /* Expand the library call ourselves using a stabilized argument
4648 list to avoid re-evaluating the function's arguments twice. */
4653 }
4655 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4656 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4657 the result in TARGET, if convenient. */
4659 static rtx
4661 ATTRIBUTE_UNUSED machine_mode mode)
4662 {
4667 /* Due to the performance benefit, always inline the calls first. */
4673 /* If c_strlen can determine an expression for one of the string
4674 lengths, and it doesn't have side effects, then emit cmpstrnsi
4675 using length MIN(strlen(string)+1, arg3). */
4680 tree len;
4701 /* If we don't have a constant length for the first, use the length
4702 of the second, if we know it. If neither string is constant length,
4703 use the given length argument. We don't require a constant for
4704 this case; some cost analysis could be done if both are available
4705 but neither is constant. For now, assume they're equally cheap,
4706 unless one has side effects. If both strings have constant lengths,
4707 use the smaller. */
4725 else
4728 /* If we are not using the given length, we must incorporate it here.
4729 The actual new length parameter will be MIN(len,arg3) in this case. */
4741 {
4742 /* Check to see if the argument was declared attribute nonstring
4743 and if so, issue a warning since at this point it's not known
4744 to be nul-terminated. */
4747 /* Return the value in the proper mode for this function. */
4755 }
4757 /* Expand the library call ourselves using a stabilized argument
4758 list to avoid re-evaluating the function's arguments twice. */
4763 }
4765 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4766 if that's convenient. */
4768 rtx
4770 {
4771 rtx val;
4774 /* Don't do __builtin_saveregs more than once in a function.
4775 Save the result of the first call and reuse it. */
4779 /* When this function is called, it means that registers must be
4780 saved on entry to this function. So we migrate the call to the
4781 first insn of this function. */
4785 /* Do whatever the machine needs done in this case. */
4793 /* Put the insns after the NOTE that starts the function. If this
4794 is inside a start_sequence, make the outer-level insn chain current, so
4795 the code is placed at the start of the function. */
4801 }
4803 /* Expand a call to __builtin_next_arg. */
4805 static rtx
4807 {
4808 /* Checking arguments is already done in fold_builtin_next_arg
4809 that must be called before this function. */
4814 }
4816 /* Make it easier for the backends by protecting the valist argument
4817 from multiple evaluations. */
4819 static tree
4821 {
4824 /* The current way of determining the type of valist is completely
4825 bogus. We should have the information on the va builtin instead. */
4830 {
4834 /* For this case, the backends will be expecting a pointer to
4835 vatype, but it's possible we've actually been given an array
4836 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4837 So fix it. */
4839 {
4842 }
4843 }
4844 else
4845 {
4849 {
4855 }
4861 }
4864 }
4866 /* The "standard" definition of va_list is void*. */
4868 tree
4870 {
4872 }
4874 /* The "standard" abi va_list is va_list_type_node. */
4876 tree
4878 {
4880 }
4882 /* The "standard" type of va_list is va_list_type_node. */
4884 tree
4886 {
4893 {
4894 /* If va_list is an array type, the argument may have decayed
4895 to a pointer type, e.g. by being passed to another function.
4896 In that case, unwrap both types so that we can compare the
4897 underlying records. */
4900 {
4903 }
4904 }
4909 }
4911 /* The "standard" implementation of va_start: just assign `nextarg' to
4912 the variable. */
4914 void
4916 {
4919 }
4921 /* Expand EXP, a call to __builtin_va_start. */
4923 static rtx
4925 {
4926 rtx nextarg;
4927 tree valist;
4931 {
4934 }
4944 else
4948 }
4950 /* Expand EXP, a call to __builtin_va_end. */
4952 static rtx
4954 {
4957 /* Evaluate for side effects, if needed. I hate macros that don't
4958 do that. */
4963 }
4965 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4966 builtin rather than just as an assignment in stdarg.h because of the
4967 nastiness of array-type va_list types. */
4969 static rtx
4971 {
4984 {
4988 }
4989 else
4990 {
4993 /* Evaluate to pointers. */
5002 /* "Dereference" to BLKmode memories. */
5010 /* Copy. */
5012 }
5015 }
5017 /* Expand a call to one of the builtin functions __builtin_frame_address or
5018 __builtin_return_address. */
5020 static rtx
5022 {
5023 /* The argument must be a nonnegative integer constant.
5024 It counts the number of frames to scan up the stack.
5025 The value is either the frame pointer value or the return
5026 address saved in that frame. */
5028 /* Warning about missing arg was already issued. */
5031 {
5034 }
5035 else
5036 {
5037 /* Number of frames to scan up the stack. */
5042 /* Some ports cannot access arbitrary stack frames. */
5044 {
5047 }
5050 {
5051 /* Warn since no effort is made to ensure that any frame
5052 beyond the current one exists or can be safely reached. */
5055 }
5057 /* For __builtin_frame_address, return what we've got. */
5065 }
5066 }
5068 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5069 failed and the caller should emit a normal call. */
5071 static rtx
5073 {
5074 rtx op0;
5075 rtx result;
5078 HOST_WIDE_INT max_size;
5081 bool valid_arglist
5084 VOID_TYPE)
5094 {
5095 /* -Walloca-larger-than and -Wvla-larger-than settings override
5096 the more general -Walloc-size-larger-than so unless either of
5097 the former options is specified check the alloca arguments for
5098 overflow. */
5102 }
5104 /* Compute the argument. */
5107 /* Compute the alignment. */
5109 ? BIGGEST_ALIGNMENT
5112 /* Compute the maximum size. */
5117 /* Allocate the desired space. If the allocation stems from the declaration
5118 of a variable-sized object, it cannot accumulate. */
5119 result
5124 }
5126 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5127 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5128 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5129 handle_builtin_stack_restore function. */
5131 static rtx
5133 {
5140 OPTAB_LIB_WIDEN);
5143 OPTAB_LIB_WIDEN);
5148 }
5150 /* Expand a call to bswap builtin in EXP.
5151 Return NULL_RTX if a normal call should be emitted rather than expanding the
5152 function in-line. If convenient, the result should be placed in TARGET.
5153 SUBTARGET may be used as the target for computing one of EXP's operands. */
5155 static rtx
5157 rtx subtarget)
5158 {
5159 tree arg;
5160 rtx op0;
5178 }
5180 /* Expand a call to a unary builtin in EXP.
5181 Return NULL_RTX if a normal call should be emitted rather than expanding the
5182 function in-line. If convenient, the result should be placed in TARGET.
5183 SUBTARGET may be used as the target for computing one of EXP's operands. */
5185 static rtx
5188 {
5189 rtx op0;
5194 /* Compute the argument. */
5196 (subtarget
5200 /* Compute op, into TARGET if possible.
5201 Set TARGET to wherever the result comes back. */
5207 }
5209 /* Expand a call to __builtin_expect. We just return our argument
5210 as the builtin_expect semantic should've been already executed by
5211 tree branch prediction pass. */
5213 static rtx
5215 {
5216 tree arg;
5223 /* When guessing was done, the hints should be already stripped away. */
5227 }
5229 /* Expand a call to __builtin_assume_aligned. We just return our first
5230 argument as the builtin_assume_aligned semantic should've been already
5231 executed by CCP. */
5233 static rtx
5235 {
5239 EXPAND_NORMAL);
5244 }
5246 void
5248 {
5250 {
5252 /* For trap insns when not accumulating outgoing args force
5253 REG_ARGS_SIZE note to prevent crossjumping of calls with
5254 different args sizes. */
5257 }
5258 else
5259 {
5263 }
5266 }
5268 /* Expand a call to __builtin_unreachable. We do nothing except emit
5269 a barrier saying that control flow will not pass here.
5271 It is the responsibility of the program being compiled to ensure
5272 that control flow does never reach __builtin_unreachable. */
5273 static void
5275 {
5277 }
5279 /* Expand EXP, a call to fabs, fabsf or fabsl.
5280 Return NULL_RTX if a normal call should be emitted rather than expanding
5281 the function inline. If convenient, the result should be placed
5282 in TARGET. SUBTARGET may be used as the target for computing
5283 the operand. */
5285 static rtx
5287 {
5288 machine_mode mode;
5289 tree arg;
5290 rtx op0;
5300 }
5302 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5303 Return NULL is a normal call should be emitted rather than expanding the
5304 function inline. If convenient, the result should be placed in TARGET.
5305 SUBTARGET may be used as the target for computing the operand. */
5307 static rtx
5309 {
5311 tree arg;
5323 }
5325 /* Expand a call to __builtin___clear_cache. */
5327 static rtx
5329 {
5331 {
5332 #ifdef CLEAR_INSN_CACHE
5333 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5334 does something. Just do the default expansion to a call to
5335 __clear_cache(). */
5337 #else
5338 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5339 does nothing. There is no need to call it. Do nothing. */
5342 }
5344 /* We have a "clear_cache" insn, and it will handle everything. */
5348 /* We must not expand to a library call. If we did, any
5349 fallback library function in libgcc that might contain a call to
5350 __builtin___clear_cache() would recurse infinitely. */
5352 {
5355 }
5358 {
5371 }
5373 }
5375 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5377 static rtx
5379 {
5382 /* If we don't need too much alignment, we'll have been guaranteed
5383 proper alignment by get_trampoline_type. */
5387 /* Round address up to desired boundary. */
5398 }
5400 static rtx
5402 {
5418 /* If ONSTACK, the TRAMP argument should be the address of a field
5419 within the local function's FRAME decl. Either way, let's see if
5420 we can fill in the MEM_ATTRs for this memory. */
5424 /* Creator of a heap trampoline is responsible for making sure the
5425 address is aligned to at least STACK_BOUNDARY. Normally malloc
5426 will ensure this anyhow. */
5429 {
5433 }
5435 /* The FUNC argument should be the address of the nested function.
5436 Extract the actual function decl to pass to the hook. */
5443 /* Generate insns to initialize the trampoline. */
5447 {
5453 }
5456 }
5458 static rtx
5460 {
5461 rtx tramp;
5472 }
5474 /* Expand a call to the builtin descriptor initialization routine.
5475 A descriptor is made up of a couple of pointers to the static
5476 chain and the code entry in this order. */
5478 static rtx
5480 {
5485 VOID_TYPE))
5499 /* Generate insns to initialize the descriptor. */
5505 }
5507 /* Expand a call to the builtin descriptor adjustment routine. */
5509 static rtx
5511 {
5512 rtx tramp;
5519 /* Unalign the descriptor to allow runtime identification. */
5524 }
5526 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5527 function. The function first checks whether the back end provides
5528 an insn to implement signbit for the respective mode. If not, it
5529 checks whether the floating point format of the value is such that
5530 the sign bit can be extracted. If that is not the case, error out.
5531 EXP is the expression that is a call to the builtin function; if
5532 convenient, the result should be placed in TARGET. */
5533 static rtx
5535 {
5537 scalar_float_mode fmode;
5539 tree arg;
5542 rtx temp;
5555 /* Expand the argument yielding a RTX expression. */
5558 /* Check if the back end provides an insn that handles signbit for the
5559 argument's mode. */
5562 {
5568 }
5570 /* For floating point formats without a sign bit, implement signbit
5571 as "ARG < 0.0". */
5574 {
5575 /* But we can't do this if the format supports signed zero. */
5581 }
5584 {
5587 }
5588 else
5589 {
5591 /* Handle targets with different FP word orders. */
5594 else
5598 }
5600 /* Force the intermediate word_mode (or narrower) result into a
5601 register. This avoids attempting to create paradoxical SUBREGs
5602 of floating point modes below. */
5605 /* If the bitpos is within the "result mode" lowpart, the operation
5606 can be implement with a single bitwise AND. Otherwise, we need
5607 a right shift and an AND. */
5610 {
5618 }
5619 else
5620 {
5621 /* Perform a logical right shift to place the signbit in the least
5622 significant bit, then truncate the result to the desired mode
5623 and mask just this bit. */
5628 }
5631 }
5633 /* Expand fork or exec calls. TARGET is the desired target of the
5634 call. EXP is the call. FN is the
5635 identificator of the actual function. IGNORE is nonzero if the
5636 value is to be ignored. */
5638 static rtx
5640 {
5642 tree call;
5644 /* If we are not profiling, just call the function. */
5648 /* Otherwise call the wrapper. This should be equivalent for the rest of
5649 compiler, so the code does not diverge, and the wrapper may run the
5650 code necessary for keeping the profiling sane. */
5653 {
5684 }
5696 }
5699 \f
5700 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5701 the pointer in these functions is void*, the tree optimizers may remove
5702 casts. The mode computed in expand_builtin isn't reliable either, due
5703 to __sync_bool_compare_and_swap.
5705 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5706 group of builtins. This gives us log2 of the mode size. */
5710 {
5711 /* The size is not negotiable, so ask not to get BLKmode in return
5712 if the target indicates that a smaller size would be better. */
5714 }
5716 /* Expand the memory expression LOC and return the appropriate memory operand
5717 for the builtin_sync operations. */
5719 static rtx
5721 {
5727 /* Note that we explicitly do not want any alias information for this
5728 memory, so that we kill all other live memories. Otherwise we don't
5729 satisfy the full barrier semantics of the intrinsic. */
5732 /* The alignment needs to be at least according to that of the mode. */
5739 }
5741 /* Make sure an argument is in the right mode.
5742 EXP is the tree argument.
5743 MODE is the mode it should be in. */
5745 static rtx
5747 {
5748 rtx val;
5749 machine_mode old_mode;
5752 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5753 of CONST_INTs, where we know the old_mode only from the call argument. */
5760 }
5763 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5764 EXP is the CALL_EXPR. CODE is the rtx code
5765 that corresponds to the arithmetic or logical operation from the name;
5766 an exception here is that NOT actually means NAND. TARGET is an optional
5767 place for us to store the results; AFTER is true if this is the
5768 fetch_and_xxx form. */
5770 static rtx
5773 rtx target)
5774 {
5779 {
5786 {
5815 }
5816 }
5818 /* Expand the operands. */
5823 after);
5824 }
5826 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5827 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5828 true if this is the boolean form. TARGET is a place for us to store the
5829 results; this is NOT optional if IS_BOOL is true. */
5831 static rtx
5834 {
5838 /* Expand the operands. */
5845 {
5848 else
5850 }
5853 MEMMODEL_SYNC_SEQ_CST))
5857 }
5859 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5860 general form is actually an atomic exchange, and some targets only
5861 support a reduced form with the second argument being a constant 1.
5862 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5863 the results. */
5865 static rtx
5867 rtx target)
5868 {
5871 /* Expand the operands. */
5876 }
5878 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5880 static void
5882 {
5883 rtx mem;
5885 /* Expand the operands. */
5889 }
5891 /* Given an integer representing an ``enum memmodel'', verify its
5892 correctness and return the memory model enum. */
5894 static enum memmodel
5896 {
5897 rtx op;
5899 source_location loc
5902 /* If the parameter is not a constant, it's a run time value so we'll just
5903 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5913 {
5917 }
5919 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5921 {
5925 }
5927 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5928 be conservative and promote consume to acquire. */
5933 }
5935 /* Expand the __atomic_exchange intrinsic:
5936 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5937 EXP is the CALL_EXPR.
5938 TARGET is an optional place for us to store the results. */
5940 static rtx
5942 {
5951 /* Expand the operands. */
5956 }
5958 /* Expand the __atomic_compare_exchange intrinsic:
5959 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5960 TYPE desired, BOOL weak,
5961 enum memmodel success,
5962 enum memmodel failure)
5963 EXP is the CALL_EXPR.
5964 TARGET is an optional place for us to store the results. */
5966 static rtx
5968 rtx target)
5969 {
5973 tree weak;
5975 source_location loc
5982 {
5984 "failure memory model cannot be stronger than success "
5987 }
5990 {
5992 "invalid failure memory model for "
5996 }
6002 /* Expand the operands. */
6018 /* Lest the rtl backend create a race condition with an imporoper store
6019 to memory, always create a new pseudo for OLDVAL. */
6026 /* Conditionally store back to EXPECT, lest we create a race condition
6027 with an improper store to memory. */
6028 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6029 the normal case where EXPECT is totally private, i.e. a register. At
6030 which point the store can be unconditional. */
6038 }
6040 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6041 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6042 call. The weak parameter must be dropped to match the expected parameter
6043 list and the expected argument changed from value to pointer to memory
6044 slot. */
6046 static void
6048 {
6064 /* Skip the boolean weak parameter. */
6067 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6070 built_in_function fncode
6075 fndecl);
6080 {
6087 }
6088 }
6090 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6092 void
6094 {
6100 tree lhs;
6102 source_location loc
6109 {
6111 "failure memory model cannot be stronger than success "
6114 }
6117 {
6119 "invalid failure memory model for "
6123 }
6126 {
6129 }
6131 /* Expand the operands. */
6144 {
6147 }
6151 {
6157 }
6158 }
6160 /* Expand the __atomic_load intrinsic:
6161 TYPE __atomic_load (TYPE *object, enum memmodel)
6162 EXP is the CALL_EXPR.
6163 TARGET is an optional place for us to store the results. */
6165 static rtx
6167 {
6168 rtx mem;
6173 {
6174 source_location loc
6179 }
6184 /* Expand the operand. */
6188 }
6191 /* Expand the __atomic_store intrinsic:
6192 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6193 EXP is the CALL_EXPR.
6194 TARGET is an optional place for us to store the results. */
6196 static rtx
6198 {
6205 {
6206 source_location loc
6211 }
6216 /* Expand the operands. */
6221 }
6223 /* Expand the __atomic_fetch_XXX intrinsic:
6224 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6225 EXP is the CALL_EXPR.
6226 TARGET is an optional place for us to store the results.
6227 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6228 FETCH_AFTER is true if returning the result of the operation.
6229 FETCH_AFTER is false if returning the value before the operation.
6230 IGNORE is true if the result is not used.
6231 EXT_CALL is the correct builtin for an external call if this cannot be
6232 resolved to an instruction sequence. */
6234 static rtx
6238 {
6241 tree fndecl;
6242 tree addr;
6246 /* Expand the operands. */
6250 /* Only try generating instructions if inlining is turned on. */
6252 {
6256 }
6258 /* Return if a different routine isn't needed for the library call. */
6262 /* Change the call to the specified function. */
6270 /* If we will emit code after the call, the call can not be a tail call.
6271 If it is emitted as a tail call, a barrier is emitted after it, and
6272 then all trailing code is removed. */
6276 /* Expand the call here so we can emit trailing code. */
6279 /* Replace the original function just in case it matters. */
6282 /* Then issue the arithmetic correction to return the right result. */
6284 {
6286 {
6288 OPTAB_LIB_WIDEN);
6290 }
6291 else
6293 OPTAB_LIB_WIDEN);
6294 }
6296 }
6298 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6300 void
6302 {
6310 optab optab;
6322 {
6337 }
6340 {
6347 }
6369 {
6374 }
6375 else
6377 OPTAB_DIRECT);
6380 }
6382 /* Expand an atomic clear operation.
6383 void _atomic_clear (BOOL *obj, enum memmodel)
6384 EXP is the call expression. */
6386 static rtx
6388 {
6389 machine_mode mode;
6398 {
6399 source_location loc
6404 }
6406 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6407 Failing that, a store is issued by __atomic_store. The only way this can
6408 fail is if the bool type is larger than a word size. Unlikely, but
6409 handle it anyway for completeness. Assume a single threaded model since
6410 there is no atomic support in this case, and no barriers are required. */
6415 }
6417 /* Expand an atomic test_and_set operation.
6418 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6419 EXP is the call expression. */
6421 static rtx
6423 {
6424 rtx mem;
6426 machine_mode mode;
6433 }
6436 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6437 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6439 static tree
6441 {
6443 machine_mode mode;
6449 /* We need a corresponding integer mode for the access to be lock-free. */
6457 {
6460 /* Either this argument is null, or it's a fake pointer encoding
6461 the alignment of the object. */
6467 else
6469 }
6470 else
6471 {
6474 /* This function is usually invoked and folded immediately by the front
6475 end before anything else has a chance to look at it. The pointer
6476 parameter at this point is usually cast to a void *, so check for that
6477 and look past the cast. */
6487 /* Get the underlying type of the object. */
6490 }
6492 /* If the object has smaller alignment, the lock free routines cannot
6493 be used. */
6497 /* Check if a compare_and_swap pattern exists for the mode which represents
6498 the required size. The pattern is not allowed to fail, so the existence
6499 of the pattern indicates support is present. Also require that an
6500 atomic load exists for the required size. */
6503 else
6505 }
6507 /* Return true if the parameters to call EXP represent an object which will
6508 always generate lock free instructions. The first argument represents the
6509 size of the object, and the second parameter is a pointer to the object
6510 itself. If NULL is passed for the object, then the result is based on
6511 typical alignment for an object of the specified size. Otherwise return
6512 false. */
6514 static rtx
6516 {
6517 tree size;
6522 {
6525 }
6531 }
6533 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6534 is lock free on this architecture. */
6536 static tree
6538 {
6542 /* If it isn't always lock free, don't generate a result. */
6547 }
6549 /* Return true if the parameters to call EXP represent an object which will
6550 always generate lock free instructions. The first argument represents the
6551 size of the object, and the second parameter is a pointer to the object
6552 itself. If NULL is passed for the object, then the result is based on
6553 typical alignment for an object of the specified size. Otherwise return
6554 NULL*/
6556 static rtx
6558 {
6559 tree size;
6564 {
6567 }
6572 /* If the value is known at compile time, return the RTX for it. */
6578 }
6580 /* Expand the __atomic_thread_fence intrinsic:
6581 void __atomic_thread_fence (enum memmodel)
6582 EXP is the CALL_EXPR. */
6584 static void
6586 {
6589 }
6591 /* Expand the __atomic_signal_fence intrinsic:
6592 void __atomic_signal_fence (enum memmodel)
6593 EXP is the CALL_EXPR. */
6595 static void
6597 {
6600 }
6602 /* Expand the __sync_synchronize intrinsic. */
6604 static void
6606 {
6608 }
6610 static rtx
6612 {
6618 {
6620 /* If the target is not sutitable then create a new target. */
6628 }
6631 }
6633 static void
6635 {
6641 {
6648 }
6650 }
6652 \f
6653 /* Emit code to restore the current value of stack. */
6655 static void
6657 {
6669 }
6671 /* Emit code to save the current value of stack. */
6673 static rtx
6675 {
6680 }
6682 /* Emit code to get the openacc gang, worker or vector id or size. */
6684 static rtx
6686 {
6688 rtx fallback_retval;
6691 {
6704 }
6707 {
6710 }
6714 {
6717 }
6721 {
6729 }
6738 {
6741 }
6749 }
6751 /* Expand a string compare operation using a sequence of char comparison
6752 to get rid of the calling overhead, with result going to TARGET if
6753 that's convenient.
6755 VAR_STR is the variable string source;
6756 CONST_STR is the constant string source;
6757 LENGTH is the number of chars to compare;
6758 CONST_STR_N indicates which source string is the constant string;
6759 IS_MEMCMP indicates whether it's a memcmp or strcmp.
6761 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
6763 target = var_str[0] - const_str[0];
6764 if (target != 0)
6765 goto ne_label;
6766 ...
6767 target = var_str[length - 2] - const_str[length - 2];
6768 if (target != 0)
6769 goto ne_label;
6770 target = var_str[length - 1] - const_str[length - 1];
6771 ne_label:
6772 */
6774 static rtx
6779 {
6781 rtx var_rtx_array
6792 {
6793 var_rtx
6795 const_rtx
6797 offset,
6808 offset
6810 }
6818 }
6820 /* Inline expansion a call to str(n)cmp, with result going to
6821 TARGET if that's convenient.
6822 If the call is not been inlined, return NULL_RTX. */
6823 static rtx
6825 {
6846 /* If neither strings is constant string, the call is not qualify. */
6850 /* For strncmp, if the length is not a const, not qualify. */
6861 else
6870 /* If the length of the comparision is larger than the threshold,
6871 do nothing. */
6878 /* Now, start inline expansion the call. */
6882 }
6884 /* Expand an expression EXP that calls a built-in function,
6885 with result going to TARGET if that's convenient
6886 (and in mode MODE if that's convenient).
6887 SUBTARGET may be used as the target for computing one of EXP's operands.
6888 IGNORE is nonzero if the value is to be ignored. */
6890 rtx
6893 {
6902 /* When ASan is enabled, we don't want to expand some memory/string
6903 builtins and rely on libsanitizer's hooks. This allows us to avoid
6904 redundant checks and be sure, that possible overflow will be detected
6905 by ASan. */
6910 /* When not optimizing, generate calls to library functions for a certain
6911 set of builtins. */
6925 /* The built-in function expanders test for target == const0_rtx
6926 to determine whether the function's result will be ignored. */
6930 /* If the result of a pure or const built-in function is ignored, and
6931 none of its arguments are volatile, we can avoid expanding the
6932 built-in call and just evaluate the arguments for side-effects. */
6936 {
6938 tree arg;
6939 call_expr_arg_iterator iter;
6943 {
6946 }
6949 {
6953 }
6954 }
6957 {
6975 /* Just do a normal library call if we were unable to fold
6976 the values. */
7053 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7054 FUNCTION with a copy of the parameters described by
7055 ARGUMENTS, and ARGSIZE. It returns a block of memory
7056 allocated on the stack into which is stored all the registers
7057 that might possibly be used for returning the result of a
7058 function. ARGUMENTS is the value returned by
7059 __builtin_apply_args. ARGSIZE is the number of bytes of
7060 arguments that must be copied. ??? How should this value be
7061 computed? We'll also need a safe worst case value for varargs
7062 functions. */
7069 else
7070 {
7078 }
7080 /* __builtin_return (RESULT) causes the function to return the
7081 value described by RESULT. RESULT is address of the block of
7082 memory returned by __builtin_apply. */
7092 /* All valid uses of __builtin_va_arg_pack () are removed during
7093 inlining. */
7098 /* All valid uses of __builtin_va_arg_pack_len () are removed during
7099 inlining. */
7103 /* Return the address of the first anonymous stack arg. */
7125 /* Returns the address of the area where the structure is returned.
7126 0 otherwise. */
7132 else
7135 CASE_BUILT_IN_ALLOCA:
7285 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7286 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7287 when changing it to a strcmp call. */
7293 /* Change this call back to a BUILT_IN_STRCMP. */
7297 /* Delete the last parameter. */
7304 /* FALLTHROUGH */
7312 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7313 back to a BUILT_IN_STRNCMP. */
7319 /* Change it back to a BUILT_IN_STRNCMP. */
7322 /* FALLTHROUGH */
7337 {
7340 }
7344 /* This should have been lowered to the builtins below. */
7348 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7349 and the receiver label. */
7351 {
7357 /* This is copied from the handling of non-local gotos. */
7359 nonlocal_goto_handler_labels
7361 nonlocal_goto_handler_labels);
7362 /* ??? Do not let expand_label treat us as such since we would
7363 not want to be both on the list of non-local labels and on
7364 the list of forced labels. */
7367 }
7371 /* __builtin_setjmp_receiver is passed the receiver label. */
7373 {
7379 }
7382 /* __builtin_longjmp is passed a pointer to an array of five words.
7383 It's similar to the C library longjmp function but works with
7384 __builtin_setjmp above. */
7387 {
7393 {
7396 }
7400 }
7409 /* This updates the setjmp buffer that is its argument with the value
7410 of the current stack pointer. */
7413 {
7414 rtx buf_addr
7419 }
7439 /* Various hooks for the DWARF 2 __throw routine. */
7445 #ifdef DWARF2_UNWIND_INFO
7451 #endif
7651 mode = get_builtin_sync_mode
7663 mode = get_builtin_sync_mode
7710 {
7714 mode =
7720 /* If this is turned into an external library call, the weak parameter
7721 must be dropped to match the expected parameter list. */
7726 /* Skip the boolean weak parameter. */
7731 }
7760 {
7770 }
7776 {
7786 }
7792 {
7802 }
7808 {
7818 }
7824 {
7834 }
7840 {
7850 }
7987 /* Do library call, if we failed to expand the builtin when
7988 folding. */
7997 }
7999 /* The switch statement above can drop through to cause the function
8000 to be called normally. */
8002 }
8004 /* Determine whether a tree node represents a call to a built-in
8005 function. If the tree T is a call to a built-in function with
8006 the right number of arguments of the appropriate types, return
8007 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8008 Otherwise the return value is END_BUILTINS. */
8010 enum built_in_function
8012 {
8015 const_call_expr_arg_iterator iter;
8030 {
8031 /* If a function doesn't take a variable number of arguments,
8032 the last element in the list will have type `void'. */
8035 {
8039 }
8048 {
8051 }
8053 {
8056 }
8058 {
8061 }
8063 {
8066 }
8067 else
8069 }
8071 /* Variable-length argument list. */
8073 }
8075 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
8076 evaluate to a constant. */
8078 static tree
8080 {
8081 /* We return 1 for a numeric type that's known to be a constant
8082 value at compile-time or for an aggregate type that's a
8083 literal constant. */
8086 /* If we know this is a constant, emit the constant of one. */
8092 {
8099 }
8101 /* If this expression has side effects, show we don't know it to be a
8102 constant. Likewise if it's a pointer or aggregate type since in
8103 those case we only want literals, since those are only optimized
8104 when generating RTL, not later.
8105 And finally, if we are compiling an initializer, not code, we
8106 need to return a definite result now; there's not going to be any
8107 more optimization done. */
8112 || folding_initializer
8117 }
8119 /* Create builtin_expect with PRED and EXPECTED as its arguments and
8120 return it as a truthvalue. */
8122 static tree
8124 tree predictor)
8125 {
8137 predictor);
8141 }
8143 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
8144 NULL_TREE if no simplification is possible. */
8146 tree
8148 {
8152 /* Distribute the expected value over short-circuiting operators.
8153 See through the cast from truthvalue_type_node to long. */
8160 /* If this is a builtin_expect within a builtin_expect keep the
8161 inner one. See through a comparison against a constant. It
8162 might have been added to create a thruthvalue. */
8178 {
8188 }
8190 /* If the argument isn't invariant then there's nothing else we can do. */
8194 /* If we expect that a comparison against the argument will fold to
8195 a constant return the constant. In practice, this means a true
8196 constant or the address of a non-weak symbol. */
8200 {
8201 do
8202 {
8204 }
8209 }
8211 /* Otherwise, ARG0 already has the proper type for the return value. */
8213 }
8215 /* Fold a call to __builtin_classify_type with argument ARG. */
8217 static tree
8219 {
8224 }
8226 /* Fold a call to __builtin_strlen with argument ARG. */
8228 static tree
8230 {
8233 else
8234 {
8241 }
8242 }
8244 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8246 static tree
8248 {
8249 REAL_VALUE_TYPE real;
8251 /* __builtin_inff is intended to be usable to define INFINITY on all
8252 targets. If an infinity is not available, INFINITY expands "to a
8253 positive constant of type float that overflows at translation
8254 time", footnote "In this case, using INFINITY will violate the
8255 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8256 Thus we pedwarn to ensure this constraint violation is
8257 diagnosed. */
8263 }
8265 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8266 NULL_TREE if no simplification can be made. */
8268 static tree
8271 {
8272 tree type;
8282 /* Calculate the result when the argument is a constant. */
8287 /* Canonicalize sincos to cexpi. */
8289 {
8292 }
8294 {
8301 }
8313 }
8315 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8316 Return NULL_TREE if no simplification can be made. */
8318 static tree
8320 {
8326 /* If the LEN parameter is zero, return zero. */
8331 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8335 /* If len parameter is one, return an expression corresponding to
8336 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8338 {
8340 tree cst_uchar_ptr_node
8343 tree ind1
8347 cst_uchar_ptr_node,
8348 arg1)));
8349 tree ind2
8353 cst_uchar_ptr_node,
8354 arg2)));
8356 }
8359 }
8361 /* Fold a call to builtin isascii with argument ARG. */
8363 static tree
8365 {
8368 else
8369 {
8370 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8376 }
8377 }
8379 /* Fold a call to builtin toascii with argument ARG. */
8381 static tree
8383 {
8387 /* Transform toascii(c) -> (c & 0x7f). */
8390 }
8392 /* Fold a call to builtin isdigit with argument ARG. */
8394 static tree
8396 {
8399 else
8400 {
8401 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8402 /* According to the C standard, isdigit is unaffected by locale.
8403 However, it definitely is affected by the target character set. */
8404 unsigned HOST_WIDE_INT target_digit0
8415 }
8416 }
8418 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8420 static tree
8422 {
8428 }
8430 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8432 static tree
8434 {
8440 }
8442 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8444 static tree
8446 {
8449 {
8453 {
8458 }
8459 }
8462 }
8464 /* Fold a call to builtin frexp, we can assume the base is 2. */
8466 static tree
8468 {
8479 /* Proceed if a valid pointer type was passed in. */
8481 {
8486 {
8488 /* For +-0, return (*exp = 0, +-0). */
8494 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8497 {
8498 /* Since the frexp function always expects base 2, and in
8499 GCC normalized significands are already in the range
8500 [0.5, 1.0), we have exactly what frexp wants. */
8505 }
8509 }
8511 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8515 }
8518 }
8520 /* Fold a call to builtin modf. */
8522 static tree
8524 {
8535 /* Proceed if a valid pointer type was passed in. */
8537 {
8542 {
8545 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8549 /* For +-Inf, return (*arg1 = arg0, +-0). */
8555 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8558 /* If the original number was negative and already
8559 integral, then the fractional part is -0.0. */
8563 }
8565 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8571 }
8574 }
8576 /* Given a location LOC, an interclass builtin function decl FNDECL
8577 and its single argument ARG, return an folded expression computing
8578 the same, or NULL_TREE if we either couldn't or didn't want to fold
8579 (the latter happen if there's an RTL instruction available). */
8581 static tree
8583 {
8584 machine_mode mode;
8596 /* If there is no optab, try generic code. */
8598 {
8599 tree result;
8602 {
8603 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8606 REAL_VALUE_TYPE r;
8610 {
8611 /* NaN and Inf are encoded in the high-order double value
8612 only. The low-order value is not significant. */
8616 }
8623 }
8626 {
8627 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8630 REAL_VALUE_TYPE r;
8634 {
8635 /* NaN and Inf are encoded in the high-order double value
8636 only. The low-order value is not significant. */
8640 }
8646 /*result = fold_build2_loc (loc, UNGT_EXPR,
8647 TREE_TYPE (TREE_TYPE (fndecl)),
8648 fold_build1_loc (loc, ABS_EXPR, type, arg),
8649 build_real (type, r));
8650 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8651 TREE_TYPE (TREE_TYPE (fndecl)),
8652 result);*/
8654 }
8656 {
8657 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8658 islessequal(fabs(x),DBL_MAX). */
8668 {
8669 /* Use double to test the normal range of IBM extended
8670 precision. Emin for IBM extended precision is
8671 different to emin for IEEE double, being 53 higher
8672 since the low double exponent is at least 53 lower
8673 than the high double exponent. */
8677 }
8689 {
8690 /* Testing the high end of the range is done just using
8691 the high double, using the same test as isfinite().
8692 For the subnormal end of the range we first test the
8693 high double, then if its magnitude is equal to the
8694 limit of 0x1p-969, we test whether the low double is
8695 non-zero and opposite sign to the high double. */
8711 integer_type_node,
8717 }
8718 else
8719 {
8720 tree const isge_fn
8723 }
8727 }
8730 }
8733 }
8735 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8736 ARG is the argument for the call. */
8738 static tree
8740 {
8747 {
8755 {
8756 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8757 /* In a boolean context, GCC will fold the inner COND_EXPR to
8758 1. So e.g. "if (isinf_sign(x))" would be folded to just
8759 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8767 {
8780 integer_zero_node);
8781 }
8784 }
8797 {
8800 {
8801 /* NaN and Inf are encoded in the high-order double value
8802 only. The low-order value is not significant. */
8804 }
8805 }
8811 }
8812 }
8814 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8815 This builtin will generate code to return the appropriate floating
8816 point classification depending on the value of the floating point
8817 number passed in. The possible return values must be supplied as
8818 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8819 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8820 one floating point argument which is "type generic". */
8822 static tree
8824 {
8827 machine_mode mode;
8828 REAL_VALUE_TYPE r;
8831 /* Verify the required arguments in the original call. */
8851 /* fpclassify(x) ->
8852 isnan(x) ? FP_NAN :
8853 (fabs(x) == Inf ? FP_INFINITE :
8854 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8855 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8869 {
8875 }
8878 {
8881 }
8884 }
8886 /* Fold a call to an unordered comparison function such as
8887 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8888 being called and ARG0 and ARG1 are the arguments for the call.
8889 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8890 the opposite of the desired result. UNORDERED_CODE is used
8891 for modes that can hold NaNs and ORDERED_CODE is used for
8892 the rest. */
8894 static tree
8898 {
8912 /* Choose the wider of two real types. */
8924 {
8928 }
8933 }
8935 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8936 arithmetics if it can never overflow, or into internal functions that
8937 return both result of arithmetics and overflowed boolean flag in
8938 a complex integer result, or some other check for overflow.
8939 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8940 checking part of that. */
8942 static tree
8945 {
8947 /* The code of the expression corresponding to the type-generic
8948 built-in, or ERROR_MARK for the type-specific ones. */
8953 {
8956 /* FALLTHRU */
8959 /* FALLTHRU */
8970 /* FALLTHRU */
8973 /* FALLTHRU */
8984 /* FALLTHRU */
8987 /* FALLTHRU */
8998 }
9000 /* For the "generic" overloads, the first two arguments can have different
9001 types and the last argument determines the target type to use to check
9002 for overflow. The arguments of the other overloads all have the same
9003 type. */
9006 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
9007 arguments are constant, attempt to fold the built-in call into a constant
9008 expression indicating whether or not it detected an overflow. */
9012 /* Perform the computation in the target type and check for overflow. */
9016 arg2);
9030 tree store
9033 }
9035 /* Fold a call to __builtin_FILE to a constant string. */
9039 {
9041 {
9042 /* The documentation says this builtin is equivalent to the preprocessor
9043 __FILE__ macro so it appears appropriate to use the same file prefix
9044 mappings. */
9047 }
9050 }
9052 /* Fold a call to __builtin_FUNCTION to a constant string. */
9056 {
9063 }
9065 /* Fold a call to __builtin_LINE to an integer constant. */
9069 {
9071 }
9073 /* Fold a call to built-in function FNDECL with 0 arguments.
9074 This function returns NULL_TREE if no simplification was possible. */
9076 static tree
9078 {
9082 {
9108 }
9110 }
9112 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9113 This function returns NULL_TREE if no simplification was possible. */
9115 static tree
9117 {
9128 {
9130 {
9133 /* Gimplification will pull the CALL_EXPR for the builtin out of
9134 an if condition. When not optimizing, we'll not CSE it back.
9135 To avoid link error types of regressions, return false now. */
9140 }
9196 {
9201 }
9207 {
9212 }
9233 }
9237 }
9239 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9240 This function returns NULL_TREE if no simplification was possible. */
9242 static tree
9244 {
9256 {
9300 NOP_EXPR);
9302 /* We do the folding for va_start in the expander. */
9317 }
9319 }
9321 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9322 and ARG2.
9323 This function returns NULL_TREE if no simplification was possible. */
9325 static tree
9328 {
9342 {
9388 }
9390 }
9392 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9393 arguments. IGNORE is true if the result of the
9394 function call is ignored. This function returns NULL_TREE if no
9395 simplification was possible. */
9397 tree
9399 {
9403 {
9419 }
9421 {
9425 }
9427 }
9429 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9430 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9431 of arguments in ARGS to be omitted. OLDNARGS is the number of
9432 elements in ARGS. */
9434 static tree
9437 {
9442 {
9450 }
9451 else
9455 }
9457 /* Return true if FNDECL shouldn't be folded right now.
9458 If a built-in function has an inline attribute always_inline
9459 wrapper, defer folding it after always_inline functions have
9460 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9461 might not be performed. */
9463 bool
9465 {
9468 && cfun
9471 }
9473 /* A wrapper function for builtin folding that prevents warnings for
9474 "statement without effect" and the like, caused by removing the
9475 call node earlier than the warning is generated. */
9477 tree
9479 {
9485 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9486 yet. Defer folding until we see all the arguments
9487 (after inlining). */
9489 {
9492 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9493 instead last argument is __builtin_va_arg_pack (). Defer folding
9494 even in that case, until arguments are finalized. */
9496 {
9503 }
9511 else
9512 {
9517 }
9518 }
9520 }
9522 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9523 N arguments are passed in the array ARGARRAY. Return a folded
9524 expression or NULL_TREE if no simplification was possible. */
9526 tree
9528 tree fn,
9531 {
9538 {
9539 /* If last argument is __builtin_va_arg_pack (), arguments to this
9540 function are not finalized yet. Defer folding until they are. */
9542 {
9549 }
9554 else
9556 }
9559 }
9561 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9562 along with N new arguments specified as the "..." parameters. SKIP
9563 is the number of arguments in EXP to be omitted. This function is used
9564 to do varargs-to-varargs transformations. */
9566 static tree
9568 {
9570 tree t;
9578 }
9580 /* Validate a single argument ARG against a tree code CODE representing
9581 a type. Return true when argument is valid. */
9583 static bool
9585 {
9593 }
9595 /* This function validates the types of a function call argument list
9596 against a specified list of tree_codes. If the last specifier is a 0,
9597 that represents an ellipses, otherwise the last specifier must be a
9598 VOID_TYPE.
9600 This is the GIMPLE version of validate_arglist. Eventually we want to
9601 completely convert builtins.c to work from GIMPLEs and the tree based
9602 validate_arglist will then be removed. */
9604 bool
9606 {
9610 const_tree arg;
9616 do
9617 {
9620 {
9622 /* This signifies an ellipses, any further arguments are all ok. */
9626 /* This signifies an endlink, if no arguments remain, return
9627 true, otherwise return false. */
9631 /* If no parameters remain or the parameter's code does not
9632 match the specified code, return false. Otherwise continue
9633 checking any remaining arguments. */
9638 }
9639 }
9642 /* We need gotos here since we can only have one VA_CLOSE in a
9643 function. */
9644 end: ;
9648 }
9650 /* Default target-specific builtin expander that does nothing. */
9652 rtx
9654 rtx target ATTRIBUTE_UNUSED,
9655 rtx subtarget ATTRIBUTE_UNUSED,
9656 machine_mode mode ATTRIBUTE_UNUSED,
9658 {
9660 }
9662 /* Returns true is EXP represents data that would potentially reside
9663 in a readonly section. */
9665 bool
9667 {
9677 /* Make sure we call decl_readonly_section only for trees it
9678 can handle (since it returns true for everything it doesn't
9679 understand). */
9684 else
9686 }
9688 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9689 to the call, and TYPE is its return type.
9691 Return NULL_TREE if no simplification was possible, otherwise return the
9692 simplified form of the call as a tree.
9694 The simplified form may be a constant or other expression which
9695 computes the same value, but in a more efficient manner (including
9696 calls to other builtin functions).
9698 The call may contain arguments which need to be evaluated, but
9699 which are not useful to determine the result of the call. In
9700 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9701 COMPOUND_EXPR will be an argument which must be evaluated.
9702 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9703 COMPOUND_EXPR in the chain will contain the tree for the simplified
9704 form of the builtin function call. */
9706 static tree
9708 {
9712 else
9713 {
9714 tree fn;
9723 {
9725 tree tem;
9730 /* Return an offset into the constant string argument. */
9733 }
9736 /* strpbrk(x, "") == NULL.
9737 Evaluate and ignore s1 in case it had side-effects. */
9747 /* New argument list transforming strpbrk(s1, s2) to
9748 strchr(s1, s2[0]). */
9751 }
9752 }
9754 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9755 to the call.
9757 Return NULL_TREE if no simplification was possible, otherwise return the
9758 simplified form of the call as a tree.
9760 The simplified form may be a constant or other expression which
9761 computes the same value, but in a more efficient manner (including
9762 calls to other builtin functions).
9764 The call may contain arguments which need to be evaluated, but
9765 which are not useful to determine the result of the call. In
9766 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9767 COMPOUND_EXPR will be an argument which must be evaluated.
9768 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9769 COMPOUND_EXPR in the chain will contain the tree for the simplified
9770 form of the builtin function call. */
9772 static tree
9774 {
9778 else
9779 {
9782 /* If either argument is "", return NULL_TREE. */
9784 /* Evaluate and ignore both arguments in case either one has
9785 side-effects. */
9789 }
9790 }
9792 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9793 to the call.
9795 Return NULL_TREE if no simplification was possible, otherwise return the
9796 simplified form of the call as a tree.
9798 The simplified form may be a constant or other expression which
9799 computes the same value, but in a more efficient manner (including
9800 calls to other builtin functions).
9802 The call may contain arguments which need to be evaluated, but
9803 which are not useful to determine the result of the call. In
9804 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9805 COMPOUND_EXPR will be an argument which must be evaluated.
9806 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9807 COMPOUND_EXPR in the chain will contain the tree for the simplified
9808 form of the builtin function call. */
9810 static tree
9812 {
9816 else
9817 {
9818 /* If the first argument is "", return NULL_TREE. */
9821 {
9822 /* Evaluate and ignore argument s2 in case it has
9823 side-effects. */
9826 }
9828 /* If the second argument is "", return __builtin_strlen(s1). */
9831 {
9834 /* If the replacement _DECL isn't initialized, don't do the
9835 transformation. */
9840 }
9842 }
9843 }
9845 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9846 produced. False otherwise. This is done so that we don't output the error
9847 or warning twice or three times. */
9849 bool
9851 {
9854 tree arg;
9855 /* There is good chance the current input_location points inside the
9856 definition of the va_start macro (perhaps on the token for
9857 builtin) in a system header, so warnings will not be emitted.
9858 Use the location in real source code. */
9859 source_location current_location =
9861 NULL);
9864 {
9867 }
9870 {
9872 {
9875 }
9877 }
9878 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9879 when we checked the arguments and if needed issued a warning. */
9880 else
9881 {
9883 {
9884 /* Evidently an out of date version of <stdarg.h>; can't validate
9885 va_start's second argument, but can still work as intended. */
9887 OPT_Wvarargs,
9890 }
9892 {
9895 }
9897 }
9902 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9903 or __builtin_next_arg (0) the first time we see it, after checking
9904 the arguments and if needed issuing a warning. */
9906 {
9909 /* Strip off all nops for the sake of the comparison. This
9910 is not quite the same as STRIP_NOPS. It does more.
9911 We must also strip off INDIRECT_EXPR for C++ reference
9912 parameters. */
9917 {
9918 /* FIXME: Sometimes with the tree optimizers we can get the
9919 not the last argument even though the user used the last
9920 argument. We just warn and set the arg to be the last
9921 argument so that we will get wrong-code because of
9922 it. */
9924 OPT_Wvarargs,
9926 }
9928 /* Undefined by C99 7.15.1.4p4 (va_start):
9929 "If the parameter parmN is declared with the register storage
9930 class, with a function or array type, or with a type that is
9931 not compatible with the type that results after application of
9932 the default argument promotions, the behavior is undefined."
9933 */
9935 {
9937 OPT_Wvarargs,
9938 "undefined behavior when second parameter of "
9940 }
9942 /* We want to verify the second parameter just once before the tree
9943 optimizers are run and then avoid keeping it in the tree,
9944 as otherwise we could warn even for correct code like:
9945 void foo (int i, ...)
9946 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9949 else
9951 }
9953 }
9956 /* Expand a call EXP to __builtin_object_size. */
9958 static rtx
9960 {
9961 tree ost;
9966 {
9971 }
9979 {
9984 }
9989 }
9991 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9992 FCODE is the BUILT_IN_* to use.
9993 Return NULL_RTX if we failed; the caller should emit a normal call,
9994 otherwise try to get the result in TARGET, if convenient (and in
9995 mode MODE if that's convenient). */
9997 static rtx
10000 {
10002 POINTER_TYPE,
10003 fcode == BUILT_IN_MEMSET_CHK
10020 {
10021 /* Avoid transforming the checking call to an ordinary one when
10022 an overflow has been detected or when the call couldn't be
10023 validated because the size is not constant. */
10028 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10029 mem{cpy,pcpy,move,set} is available. */
10031 {
10046 }
10055 }
10058 else
10059 {
10062 /* If DEST is not a pointer type, call the normal function. */
10066 /* If SRC and DEST are the same (and not volatile), do nothing. */
10068 {
10069 tree expr;
10072 {
10073 /* Evaluate and ignore LEN in case it has side-effects. */
10076 }
10080 }
10082 /* __memmove_chk special case. */
10084 {
10090 /* If src is categorized for a readonly section we can use
10091 normal __memcpy_chk. */
10093 {
10102 }
10103 }
10105 }
10106 }
10108 /* Emit warning if a buffer overflow is detected at compile time. */
10110 static void
10112 {
10113 /* The source string. */
10115 /* The size of the destination object. */
10117 /* The string that is being concatenated with (as in __strcat_chk)
10118 or null if it isn't. */
10120 /* The maximum length of the source sequence in a bounded operation
10121 (such as __strncat_chk) or null if the operation isn't bounded
10122 (such as __strcat_chk). */
10124 /* The exact size of the access (such as in __strncpy_chk). */
10128 {
10136 /* For __strcat_chk the warning will be emitted only if overflowing
10137 by at least strlen (dest) + 1 bytes. */
10164 }
10167 {
10168 /* Check __strncat_chk. There is no way to determine the length
10169 of the string to which the source string is being appended so
10170 just warn when the length of the source string is not known. */
10173 }
10175 /* The destination argument is the first one for all built-ins above. */
10179 }
10181 /* Emit warning if a buffer overflow is detected at compile time
10182 in __sprintf_chk/__vsprintf_chk calls. */
10184 static void
10186 {
10191 /* Verify the required arguments in the original call. */
10201 /* Check whether the format is a literal string constant. */
10209 /* If the format doesn't contain % args or %%, we know its size. */
10212 /* If the format is "%s" and first ... argument is a string literal,
10213 we know it too. */
10216 {
10217 tree arg;
10228 }
10229 else
10232 /* Add one for the terminating nul. */
10237 }
10239 /* Emit warning if a free is called with address of a variable. */
10241 static void
10243 {
10257 else
10260 }
10262 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10263 if possible. */
10265 static tree
10267 {
10284 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10285 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10286 and (size_t) 0 for types 2 and 3. */
10291 {
10295 }
10297 {
10298 /* If object size is not known yet, delay folding until
10299 later. Maybe subsequent passes will help determining
10300 it. */
10304 }
10307 }
10309 /* Builtins with folding operations that operate on "..." arguments
10310 need special handling; we need to store the arguments in a convenient
10311 data structure before attempting any folding. Fortunately there are
10312 only a few builtins that fall into this category. FNDECL is the
10313 function, EXP is the CALL_EXPR for the call. */
10315 static tree
10317 {
10322 {
10329 }
10331 {
10336 }
10338 }
10340 /* Initialize format string characters in the target charset. */
10342 bool
10344 {
10347 {
10370 }
10372 }
10374 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10375 and no overflow/underflow occurred. INEXACT is true if M was not
10376 exactly calculated. TYPE is the tree type for the result. This
10377 function assumes that you cleared the MPFR flags and then
10378 calculated M to see if anything subsequently set a flag prior to
10379 entering this function. Return NULL_TREE if any checks fail. */
10381 static tree
10383 {
10384 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10385 overflow/underflow occurred. If -frounding-math, proceed iff the
10386 result of calling FUNC was exact. */
10389 {
10390 REAL_VALUE_TYPE rr;
10393 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10394 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10395 but the mpft_t is not, then we underflowed in the
10396 conversion. */
10399 {
10400 REAL_VALUE_TYPE rmode;
10403 /* Proceed iff the specified mode can hold the value. */
10406 }
10407 }
10409 }
10411 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10412 number and no overflow/underflow occurred. INEXACT is true if M
10413 was not exactly calculated. TYPE is the tree type for the result.
10414 This function assumes that you cleared the MPFR flags and then
10415 calculated M to see if anything subsequently set a flag prior to
10416 entering this function. Return NULL_TREE if any checks fail, if
10417 FORCE_CONVERT is true, then bypass the checks. */
10419 static tree
10421 {
10422 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10423 overflow/underflow occurred. If -frounding-math, proceed iff the
10424 result of calling FUNC was exact. */
10429 {
10434 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10435 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10436 but the mpft_t is not, then we underflowed in the
10437 conversion. */
10442 {
10447 /* Proceed iff the specified mode can hold the value. */
10453 }
10454 }
10456 }
10458 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10459 the pointer *(ARG_QUO) and return the result. The type is taken
10460 from the type of ARG0 and is used for setting the precision of the
10461 calculation and results. */
10463 static tree
10465 {
10472 /* To proceed, MPFR must exactly represent the target floating point
10473 format, which only happens when the target base equals two. */
10477 {
10482 {
10486 tree result_rem;
10495 /* Remquo is independent of the rounding mode, so pass
10496 inexact=0 to do_mpfr_ckconv(). */
10500 {
10501 /* MPFR calculates quo in the host's long so it may
10502 return more bits in quo than the target int can hold
10503 if sizeof(host long) > sizeof(target int). This can
10504 happen even for native compilers in LP64 mode. In
10505 these cases, modulo the quo value with the largest
10506 number that the target int can hold while leaving one
10507 bit for the sign. */
10511 /* Dereference the quo pointer argument. */
10513 /* Proceed iff a valid pointer type was passed in. */
10515 {
10516 /* Set the value. */
10517 tree result_quo
10520 integer_quo));
10522 /* Combine the quo assignment with the rem. */
10525 }
10526 }
10527 }
10528 }
10530 }
10532 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10533 resulting value as a tree with type TYPE. The mpfr precision is
10534 set to the precision of TYPE. We assume that this mpfr function
10535 returns zero if the result could be calculated exactly within the
10536 requested precision. In addition, the integer pointer represented
10537 by ARG_SG will be dereferenced and set to the appropriate signgam
10538 (-1,1) value. */
10540 static tree
10542 {
10547 /* To proceed, MPFR must exactly represent the target floating point
10548 format, which only happens when the target base equals two. Also
10549 verify ARG is a constant and that ARG_SG is an int pointer. */
10554 {
10557 /* In addition to NaN and Inf, the argument cannot be zero or a
10558 negative integer. */
10562 {
10567 mpfr_t m;
10568 tree result_lg;
10577 {
10578 tree result_sg;
10580 /* Dereference the arg_sg pointer argument. */
10582 /* Assign the signgam value into *arg_sg. */
10587 /* Combine the signgam assignment with the lgamma result. */
10590 }
10591 }
10592 }
10595 }
10597 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10598 mpc function FUNC on it and return the resulting value as a tree
10599 with type TYPE. The mpfr precision is set to the precision of
10600 TYPE. We assume that function FUNC returns zero if the result
10601 could be calculated exactly within the requested precision. If
10602 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10603 in the arguments and/or results. */
10605 tree
10608 {
10614 /* To proceed, MPFR must exactly represent the target floating point
10615 format, which only happens when the target base equals two. */
10621 {
10630 {
10650 }
10651 }
10654 }
10656 /* A wrapper function for builtin folding that prevents warnings for
10657 "statement without effect" and the like, caused by removing the
10658 call node earlier than the warning is generated. */
10660 tree
10662 {
10670 {
10679 {
10681 }
10682 else
10683 {
10686 {
10687 /* Propagate location information from original call to
10688 expansion of builtin. Otherwise things like
10689 maybe_emit_chk_warning, that operate on the expansion
10690 of a builtin, will use the wrong location information. */
10692 {
10700 }
10702 }
10703 }
10704 }
10706 }
10708 /* Look up the function in builtin_decl that corresponds to DECL
10709 and set ASMSPEC as its user assembler name. DECL must be a
10710 function decl that declares a builtin. */
10712 void
10714 {
10724 {
10728 }
10729 }
10731 /* Return true if DECL is a builtin that expands to a constant or similarly
10732 simple code. */
10733 bool
10735 {
10738 {
10739 /* Builtins that expand to constants. */
10744 /* Simple register moves or loads from stack. */
10755 /* Exception state returns or moves registers around. */
10763 }
10766 }
10768 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10769 most probably expanded inline into reasonably simple code. This is a
10770 superset of is_simple_builtin. */
10771 bool
10773 {
10780 {
10782 CASE_BUILT_IN_ALLOCA:
10848 }
10851 }
10853 /* Return true if T is a constant and the value cast to a target char
10854 can be represented by a host char.
10855 Store the casted char constant in *P if so. */
10857 bool
10859 {
10865 }
10867 /* Return the maximum object size. */
10869 tree
10871 {
10872 /* To do: Make this a configurable parameter. */
10874 }