| blob | 3f39d10977d7ea1d4262ea684b05c93bba7a980b |
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. */
197 /* Return true if NAME starts with __builtin_ or __sync_. */
199 static bool
201 {
209 }
211 /* Return true if NODE should be considered for inline expansion regardless
212 of the optimization level. This means whenever a function is invoked with
213 its "internal" name, which normally contains the prefix "__builtin". */
215 bool
217 {
218 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
219 we want the name used to call the function, not the name it
220 will have. */
223 }
225 /* Compute values M and N such that M divides (address of EXP - N) and such
226 that N < M. If these numbers can be determined, store M in alignp and N in
227 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
228 *alignp and any bit-offset to *bitposp.
230 Note that the address (and thus the alignment) computed here is based
231 on the address to which a symbol resolves, whereas DECL_ALIGN is based
232 on the address at which an object is actually located. These two
233 addresses are not always the same. For example, on ARM targets,
234 the address &foo of a Thumb function foo() has the lowest bit set,
235 whereas foo() itself starts on an even address.
237 If ADDR_P is true we are taking the address of the memory reference EXP
238 and thus cannot rely on the access taking place. */
240 static bool
243 {
245 tree offset;
246 machine_mode mode;
251 /* Get the innermost object and the constant (bitpos) and possibly
252 variable (offset) offset of the access. */
256 /* Extract alignment information from the innermost object and
257 possibly adjust bitpos and offset. */
259 {
260 /* Function addresses can encode extra information besides their
261 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
262 allows the low bit to be used as a virtual bit, we know
263 that the address itself must be at least 2-byte aligned. */
266 }
268 ;
270 {
271 /* The alignment of a CONST_DECL is determined by its initializer. */
278 }
280 {
283 }
287 {
293 /* If the address is explicitely aligned, handle that. */
296 {
301 }
303 known_alignment
307 /* Re-apply explicit alignment to the bitpos. */
310 /* The alignment of the pointer operand in a TARGET_MEM_REF
311 has to take the variable offset parts into account. */
313 {
315 {
320 }
324 }
326 /* When EXP is an actual memory reference then we can use
327 TYPE_ALIGN of a pointer indirection to derive alignment.
328 Do so only if get_pointer_alignment_1 did not reveal absolute
329 alignment knowledge and if using that alignment would
330 improve the situation. */
336 else
337 {
338 /* Else adjust bitpos accordingly. */
343 }
344 }
346 {
347 /* STRING_CST are the only constant objects we allow to be not
348 wrapped inside a CONST_DECL. */
354 }
356 /* If there is a non-constant offset part extract the maximum
357 alignment that can prevail. */
359 {
362 {
366 }
367 }
369 /* Account for the alignment of runtime coefficients, so that the constant
370 bitpos is guaranteed to be accurate. */
373 {
376 }
381 }
383 /* For a memory reference expression EXP compute values M and N such that M
384 divides (&EXP - N) and such that N < M. If these numbers can be determined,
385 store M in alignp and N in *BITPOSP and return true. Otherwise return false
386 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
388 bool
391 {
393 }
395 /* Return the alignment in bits of EXP, an object. */
397 unsigned int
399 {
405 /* align and bitpos now specify known low bits of the pointer.
406 ptr & (align - 1) == bitpos. */
411 }
413 /* For a pointer valued expression EXP compute values M and N such that M
414 divides (EXP - N) and such that N < M. If these numbers can be determined,
415 store M in alignp and N in *BITPOSP and return true. Return false if
416 the results are just a conservative approximation.
418 If EXP is not a pointer, false is returned too. */
420 bool
423 {
430 {
437 else
438 {
441 {
445 }
446 }
450 }
453 {
458 {
461 /* Make sure to return a sensible alignment when the multiplication
462 by BITS_PER_UNIT overflowed. */
465 /* We cannot really tell whether this result is an approximation. */
467 }
468 else
469 {
473 }
474 }
476 {
481 }
486 }
488 /* Return the alignment in bits of EXP, a pointer valued expression.
489 The alignment returned is, by default, the alignment of the thing that
490 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
492 Otherwise, look at the expression to see if we can do better, i.e., if the
493 expression is actually pointing at an object whose alignment is tighter. */
495 unsigned int
497 {
503 /* align and bitpos now specify known low bits of the pointer.
504 ptr & (align - 1) == bitpos. */
510 }
512 /* Return the number of leading non-zero elements in the sequence
513 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
514 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
516 unsigned
518 {
524 {
525 /* Optimize the common case of plain char. */
527 {
531 }
532 }
533 else
534 {
536 {
540 }
541 }
543 }
545 /* For a call at LOC to a function FN that expects a string in the argument
546 ARG, issue a diagnostic due to it being a called with an argument
547 declared at NONSTR that is a character array with no terminating NUL. */
549 void
551 {
559 {
563 }
564 }
566 /* If EXP refers to an unterminated constant character array return
567 the declaration of the object of which the array is a member or
568 element. Otherwise return null. */
570 tree
572 {
574 {
588 }
595 }
597 /* Compute the length of a null-terminated character string or wide
598 character string handling character sizes of 1, 2, and 4 bytes.
599 TREE_STRING_LENGTH is not the right way because it evaluates to
600 the size of the character array in bytes (as opposed to characters)
601 and because it can contain a zero byte in the middle.
603 ONLY_VALUE should be nonzero if the result is not going to be emitted
604 into the instruction stream and zero if it is going to be expanded.
605 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
606 is returned, otherwise NULL, since
607 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
608 evaluate the side-effects.
610 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
611 accesses. Note that this implies the result is not going to be emitted
612 into the instruction stream.
614 If a not zero-terminated string value is encountered and NONSTR is
615 non-zero, the declaration of the string value is assigned to *NONSTR.
616 *NONSTR is accumulating, thus not cleared on success, therefore it has
617 to be initialized to NULL_TREE by the caller.
619 ELTSIZE is 1 for normal single byte character strings, and 2 or
620 4 for wide characer strings. ELTSIZE is by default 1.
622 The value returned is of type `ssizetype'. */
624 tree
626 {
631 {
638 }
646 /* Offset from the beginning of the string in bytes. */
647 tree byteoff;
648 tree memsize;
649 tree decl;
654 /* Determine the size of the string element. */
658 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
659 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
660 in case the latter is less than the size of the array, such as when
661 SRC refers to a short string literal used to initialize a large array.
662 In that case, the elements of the array after the terminating NUL are
663 all NUL. */
672 /* PTR can point to the byte representation of any string type, including
673 char* and wchar_t*. */
677 {
678 /* The code below works only for single byte character types. */
682 /* If the string has an internal NUL character followed by any
683 non-NUL characters (e.g., "foo\0bar"), we can't compute
684 the offset to the following NUL if we don't know where to
685 start searching for it. */
688 /* Return when an embedded null character is found or none at all. */
692 {
696 }
698 /* For empty strings the result should be zero. */
702 /* We don't know the starting offset, but we do know that the string
703 has no internal zero bytes. If the offset falls within the bounds
704 of the string subtract the offset from the length of the string,
705 and return that. Otherwise the length is zero. Take care to
706 use SAVE_EXPR in case the OFFSET has side-effects. */
714 }
716 /* Offset from the beginning of the string in elements. */
717 HOST_WIDE_INT eltoff;
719 /* We have a known offset into the string. Start searching there for
720 a null character if we can represent it as a single HOST_WIDE_INT. */
725 else
728 /* If the offset is known to be out of bounds, warn, and call strlen at
729 runtime. */
731 {
732 /* Suppress multiple warnings for propagated constant strings. */
735 {
738 eltoff);
740 }
742 }
744 /* If eltoff is larger than strelts but less than maxelts the
745 string length is zero, since the excess memory will be zero. */
749 /* Use strlen to search for the first zero byte. Since any strings
750 constructed with build_string will have nulls appended, we win even
751 if we get handed something like (char[4])"abcd".
753 Since ELTOFF is our starting index into the string, no further
754 calculation is needed. */
758 /* Don't know what to return if there was no zero termination.
759 Ideally this would turn into a gcc_checking_assert over time. */
761 {
765 }
768 }
770 /* Return a constant integer corresponding to target reading
771 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
773 static rtx
775 {
776 HOST_WIDE_INT ch;
790 {
802 }
806 }
808 /* Cast a target constant CST to target CHAR and if that value fits into
809 host char type, return zero and put that value into variable pointed to by
810 P. */
812 static int
814 {
821 /* Do not care if it fits or not right here. */
836 }
838 /* Similar to save_expr, but assumes that arbitrary code is not executed
839 in between the multiple evaluations. In particular, we assume that a
840 non-addressable local variable will not be modified. */
842 static tree
844 {
852 }
854 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
855 times to get the address of either a higher stack frame, or a return
856 address located within it (depending on FNDECL_CODE). */
858 static rtx
860 {
864 {
865 /* For a zero count with __builtin_return_address, we don't care what
866 frame address we return, because target-specific definitions will
867 override us. Therefore frame pointer elimination is OK, and using
868 the soft frame pointer is OK.
870 For a nonzero count, or a zero count with __builtin_frame_address,
871 we require a stable offset from the current frame pointer to the
872 previous one, so we must use the hard frame pointer, and
873 we must disable frame pointer elimination. */
876 else
877 {
880 /* Tell reload not to eliminate the frame pointer. */
882 }
883 }
888 /* On the SPARC, the return address is not in the frame, it is in a
889 register. There is no way to access it off of the current frame
890 pointer, but it can be accessed off the previous frame pointer by
891 reading the value from the register window save area. */
893 count--;
895 /* Scan back COUNT frames to the specified frame. */
897 {
898 /* Assume the dynamic chain pointer is in the word that the
899 frame address points to, unless otherwise specified. */
904 }
906 /* For __builtin_frame_address, return what we've got. But, on
907 the SPARC for example, we may have to add a bias. */
911 /* For __builtin_return_address, get the return address from that frame. */
912 #ifdef RETURN_ADDR_RTX
914 #else
918 #endif
920 }
922 /* Alias set used for setjmp buffer. */
925 /* Construct the leading half of a __builtin_setjmp call. Control will
926 return to RECEIVER_LABEL. This is also called directly by the SJLJ
927 exception handling code. */
929 void
931 {
933 rtx stack_save;
934 rtx mem;
943 /* We store the frame pointer and the address of receiver_label in
944 the buffer and use the rest of it for the stack save area, which
945 is machine-dependent. */
964 /* If there is further processing to do, do it. */
968 /* We have a nonlocal label. */
970 }
972 /* Construct the trailing part of a __builtin_setjmp call. This is
973 also called directly by the SJLJ exception handling code.
974 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
976 void
978 {
979 rtx chain;
981 /* Mark the FP as used when we get here, so we have to make sure it's
982 marked as used by this function. */
985 /* Mark the static chain as clobbered here so life information
986 doesn't get messed up for it. */
991 /* Now put in the code to restore the frame pointer, and argument
992 pointer, if needed. */
994 {
995 /* First adjust our frame pointer to its actual value. It was
996 previously set to the start of the virtual area corresponding to
997 the stacked variables when we branched here and now needs to be
998 adjusted to the actual hardware fp value.
1000 Assignments to virtual registers are converted by
1001 instantiate_virtual_regs into the corresponding assignment
1002 to the underlying register (fp in this case) that makes
1003 the original assignment true.
1004 So the following insn will actually be decrementing fp by
1005 TARGET_STARTING_FRAME_OFFSET. */
1008 /* Restoring the frame pointer also modifies the hard frame pointer.
1009 Mark it used (so that the previous assignment remains live once
1010 the frame pointer is eliminated) and clobbered (to represent the
1011 implicit update from the assignment). */
1014 }
1017 {
1018 /* If the argument pointer can be eliminated in favor of the
1019 frame pointer, we don't need to restore it. We assume here
1020 that if such an elimination is present, it can always be used.
1021 This is the case on all known machines; if we don't make this
1022 assumption, we do unnecessary saving on many machines. */
1032 {
1033 /* Now restore our arg pointer from the address at which it
1034 was saved in our stack frame. */
1037 }
1038 }
1044 else
1047 /* We must not allow the code we just generated to be reordered by
1048 scheduling. Specifically, the update of the frame pointer must
1049 happen immediately, not later. */
1051 }
1053 /* __builtin_longjmp is passed a pointer to an array of five words (not
1054 all will be used on all machines). It operates similarly to the C
1055 library function of the same name, but is more efficient. Much of
1056 the code below is copied from the handling of non-local gotos. */
1058 static void
1060 {
1065 /* DRAP is needed for stack realign if longjmp is expanded to current
1066 function */
1077 /* We require that the user must pass a second argument of 1, because
1078 that is what builtin_setjmp will return. */
1084 else
1085 {
1096 /* Pick up FP, label, and SP from the block and jump. This code is
1097 from expand_goto in stmt.c; see there for detailed comments. */
1099 /* We have to pass a value to the nonlocal_goto pattern that will
1100 get copied into the static_chain pointer, but it does not matter
1101 what that value is, because builtin_setjmp does not use it. */
1103 else
1104 {
1116 }
1117 }
1119 /* Search backwards and mark the jump insn as a non-local goto.
1120 Note that this precludes the use of __builtin_longjmp to a
1121 __builtin_setjmp target in the same function. However, we've
1122 already cautioned the user that these functions are for
1123 internal exception handling use only. */
1125 {
1129 {
1132 }
1135 }
1136 }
1140 {
1142 }
1144 /* This function validates the types of a function call argument list
1145 against a specified list of tree_codes. If the last specifier is a 0,
1146 that represents an ellipsis, otherwise the last specifier must be a
1147 VOID_TYPE. */
1149 static bool
1151 {
1155 const_call_expr_arg_iterator iter;
1156 const_tree arg;
1161 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1166 {
1170 {
1172 /* This signifies an ellipses, any further arguments are all ok. */
1176 /* This signifies an endlink, if no arguments remain, return
1177 true, otherwise return false. */
1181 /* The actual argument must be nonnull when either the whole
1182 called function has been declared nonnull, or when the formal
1183 argument corresponding to the actual argument has been. */
1186 {
1191 }
1192 /* FALLTHRU */
1194 /* If no parameters remain or the parameter's code does not
1195 match the specified code, return false. Otherwise continue
1196 checking any remaining arguments. */
1201 }
1202 }
1204 /* We need gotos here since we can only have one VA_CLOSE in a
1205 function. */
1206 end: ;
1212 }
1214 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1215 and the address of the save area. */
1217 static rtx
1219 {
1234 /* Copy the address of the save location to a register just in case it was
1235 based on the frame pointer. */
1244 /* ??? We no longer need to pass the static chain value, afaik. */
1247 else
1248 {
1254 /* Restore frame pointer for containing function. */
1258 /* USE of hard_frame_pointer_rtx added for consistency;
1259 not clear if really needed. */
1263 /* If the architecture is using a GP register, we must
1264 conservatively assume that the target function makes use of it.
1265 The prologue of functions with nonlocal gotos must therefore
1266 initialize the GP register to the appropriate value, and we
1267 must then make sure that this value is live at the point
1268 of the jump. (Note that this doesn't necessarily apply
1269 to targets with a nonlocal_goto pattern; they are free
1270 to implement it in their own way. Note also that this is
1271 a no-op if the GP register is a global invariant.) */
1277 }
1279 /* Search backwards to the jump insn and mark it as a
1280 non-local goto. */
1282 {
1284 {
1287 }
1290 }
1293 }
1295 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1296 (not all will be used on all machines) that was passed to __builtin_setjmp.
1297 It updates the stack pointer in that block to the current value. This is
1298 also called directly by the SJLJ exception handling code. */
1300 void
1302 {
1305 rtx stack_save
1307 memory_address
1313 }
1315 /* Expand a call to __builtin_prefetch. For a target that does not support
1316 data prefetch, evaluate the memory address argument in case it has side
1317 effects. */
1319 static void
1321 {
1331 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1332 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1333 locality). */
1337 else
1341 else
1344 /* Argument 0 is an address. */
1347 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1349 {
1352 }
1354 /* Argument 1 must be either zero or one. */
1356 {
1360 }
1362 /* Argument 2 (locality) must be a compile-time constant int. */
1364 {
1367 }
1369 /* Argument 2 must be 0, 1, 2, or 3. */
1371 {
1374 }
1377 {
1385 }
1387 /* Don't do anything with direct references to volatile memory, but
1388 generate code to handle other side effects. */
1391 }
1393 /* Get a MEM rtx for expression EXP which is the address of an operand
1394 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1395 the maximum length of the block of memory that might be accessed or
1396 NULL if unknown. */
1398 static rtx
1400 {
1404 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1405 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1412 /* Get an expression we can use to find the attributes to assign to MEM.
1413 First remove any nops. */
1418 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1419 (as builtin stringops may alias with anything). */
1426 /* If the MEM_REF has no acceptable address, try to get the base object
1427 from the original address we got, and build an all-aliasing
1428 unknown-sized access to that one. */
1434 {
1439 size_zero_node,
1440 NULL)),
1443 }
1446 }
1447 \f
1448 /* Built-in functions to perform an untyped call and return. */
1450 #define apply_args_mode \
1451 (this_target_builtins->x_apply_args_mode)
1452 #define apply_result_mode \
1453 (this_target_builtins->x_apply_result_mode)
1455 /* Return the size required for the block returned by __builtin_apply_args,
1456 and initialize apply_args_mode. */
1458 static int
1460 {
1465 /* The values computed by this function never change. */
1467 {
1468 /* The first value is the incoming arg-pointer. */
1471 /* The second value is the structure value address unless this is
1472 passed as an "invisible" first argument. */
1478 {
1488 }
1489 else
1490 {
1492 }
1493 }
1495 }
1497 /* Return the size required for the block returned by __builtin_apply,
1498 and initialize apply_result_mode. */
1500 static int
1502 {
1506 /* The values computed by this function never change. */
1508 {
1513 {
1523 }
1524 else
1527 /* Allow targets that use untyped_call and untyped_return to override
1528 the size so that machine-specific information can be stored here. */
1529 #ifdef APPLY_RESULT_SIZE
1531 #endif
1532 }
1534 }
1536 /* Create a vector describing the result block RESULT. If SAVEP is true,
1537 the result block is used to save the values; otherwise it is used to
1538 restore the values. */
1540 static rtx
1542 {
1544 fixed_size_mode mode;
1551 {
1561 }
1563 }
1565 /* Save the state required to perform an untyped call with the same
1566 arguments as were passed to the current function. */
1568 static rtx
1570 {
1573 fixed_size_mode mode;
1574 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1576 /* Create a block where the arg-pointer, structure value address,
1577 and argument registers can be saved. */
1580 /* Walk past the arg-pointer and structure value address. */
1585 /* Save each register used in calling a function to the block. */
1588 {
1597 }
1599 /* Save the arg pointer to the block. */
1601 /* We need the pointer as the caller actually passed them to us, not
1602 as we might have pretended they were passed. Make sure it's a valid
1603 operand, as emit_move_insn isn't expected to handle a PLUS. */
1605 tem
1608 NULL_RTX);
1613 /* Save the structure value address unless this is passed as an
1614 "invisible" first argument. */
1616 {
1620 }
1622 /* Return the address of the block. */
1624 }
1626 /* __builtin_apply_args returns block of memory allocated on
1627 the stack into which is stored the arg pointer, structure
1628 value address, static chain, and all the registers that might
1629 possibly be used in performing a function call. The code is
1630 moved to the start of the function so the incoming values are
1631 saved. */
1633 static rtx
1635 {
1636 /* Don't do __builtin_apply_args more than once in a function.
1637 Save the result of the first call and reuse it. */
1640 {
1641 /* When this function is called, it means that registers must be
1642 saved on entry to this function. So we migrate the
1643 call to the first insn of this function. */
1644 rtx temp;
1653 /* Put the insns after the NOTE that starts the function.
1654 If this is inside a start_sequence, make the outer-level insn
1655 chain current, so the code is placed at the start of the
1656 function. If internal_arg_pointer is a non-virtual pseudo,
1657 it needs to be placed after the function that initializes
1658 that pseudo. */
1663 else
1667 }
1668 }
1670 /* Perform an untyped call and save the state required to perform an
1671 untyped return of whatever value was returned by the given function. */
1673 static rtx
1675 {
1677 fixed_size_mode mode;
1686 /* Create a block where the return registers can be saved. */
1689 /* Fetch the arg pointer from the ARGUMENTS block. */
1696 /* Push a new argument block and copy the arguments. Do not allow
1697 the (potential) memcpy call below to interfere with our stack
1698 manipulations. */
1700 NO_DEFER_POP;
1702 /* Save the stack with nonlocal if available. */
1705 else
1708 /* Allocate a block of memory onto the stack and copy the memory
1709 arguments to the outgoing arguments address. We can pass TRUE
1710 as the 4th argument because we just saved the stack pointer
1711 and will restore it right after the call. */
1714 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1715 may have already set current_function_calls_alloca to true.
1716 current_function_calls_alloca won't be set if argsize is zero,
1717 so we have to guarantee need_drap is true here. */
1723 {
1726 else
1728 }
1735 /* Refer to the argument block. */
1740 /* Walk past the arg-pointer and structure value address. */
1745 /* Restore each of the registers previously saved. Make USE insns
1746 for each of these registers for use in making the call. */
1749 {
1757 }
1759 /* Restore the structure value address unless this is passed as an
1760 "invisible" first argument. */
1763 {
1770 }
1772 /* All arguments and registers used for the call are set up by now! */
1775 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1776 and we don't want to load it into a register as an optimization,
1777 because prepare_call_address already did it if it should be done. */
1781 /* Generate the actual call instruction and save the return value. */
1783 {
1787 }
1789 {
1792 /* Locate the unique return register. It is not possible to
1793 express a call that sets more than one return register using
1794 call_value; use untyped_call for that. In fact, untyped_call
1795 only needs to save the return registers in the given block. */
1798 {
1802 }
1809 }
1810 else
1813 /* Find the CALL insn we just emitted, and attach the register usage
1814 information. */
1818 /* Restore the stack. */
1821 else
1825 OK_DEFER_POP;
1827 /* Return the address of the result block. */
1830 }
1832 /* Perform an untyped return. */
1834 static void
1836 {
1838 fixed_size_mode mode;
1839 rtx reg;
1848 {
1853 }
1855 /* Restore the return value and note that each value is used. */
1859 {
1871 }
1873 /* Put the USE insns before the return. */
1876 /* Return whatever values was restored by jumping directly to the end
1877 of the function. */
1879 }
1881 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1883 static enum type_class
1885 {
1887 {
1906 }
1907 }
1909 /* Expand a call EXP to __builtin_classify_type. */
1911 static rtx
1913 {
1917 }
1919 /* This helper macro, meant to be used in mathfn_built_in below, determines
1920 which among a set of builtin math functions is appropriate for a given type
1921 mode. The `F' (float) and `L' (long double) are automatically generated
1922 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1923 types, there are additional types that are considered with 'F32', 'F64',
1924 'F128', etc. suffixes. */
1925 #define CASE_MATHFN(MATHFN) \
1926 CASE_CFN_##MATHFN: \
1927 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1928 fcodel = BUILT_IN_##MATHFN##L ; break;
1929 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1930 types. */
1931 #define CASE_MATHFN_FLOATN(MATHFN) \
1932 CASE_CFN_##MATHFN: \
1933 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1934 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1935 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1936 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1937 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1938 break;
1939 /* Similar to above, but appends _R after any F/L suffix. */
1940 #define CASE_MATHFN_REENT(MATHFN) \
1941 case CFN_BUILT_IN_##MATHFN##_R: \
1942 case CFN_BUILT_IN_##MATHFN##F_R: \
1943 case CFN_BUILT_IN_##MATHFN##L_R: \
1944 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1945 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1947 /* Return a function equivalent to FN but operating on floating-point
1948 values of type TYPE, or END_BUILTINS if no such function exists.
1949 This is purely an operation on function codes; it does not guarantee
1950 that the target actually has an implementation of the function. */
1952 static built_in_function
1954 {
1955 tree mtype;
1966 {
2057 }
2080 else
2082 }
2084 /* Return mathematic function equivalent to FN but operating directly on TYPE,
2085 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2086 otherwise use the explicit declaration. If we can't do the conversion,
2087 return null. */
2089 static tree
2091 {
2100 }
2102 /* Like mathfn_built_in_1, but always use the implicit array. */
2104 tree
2106 {
2108 }
2110 /* Like mathfn_built_in_1, but take a built_in_function and
2111 always use the implicit array. */
2113 tree
2115 {
2117 }
2119 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2120 return its code, otherwise return IFN_LAST. Note that this function
2121 only tests whether the function is defined in internals.def, not whether
2122 it is actually available on the target. */
2124 internal_fn
2126 {
2130 {
2131 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2132 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2133 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2134 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2135 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2136 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2137 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2154 }
2155 }
2157 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2158 on the current target by a call to an internal function, return the
2159 code of that internal function, otherwise return IFN_LAST. The caller
2160 is responsible for ensuring that any side-effects of the built-in
2161 call are dealt with correctly. E.g. if CALL sets errno, the caller
2162 must decide that the errno result isn't needed or make it available
2163 in some other way. */
2165 internal_fn
2167 {
2169 {
2172 {
2177 }
2178 }
2180 }
2182 /* Expand a call to the builtin trinary math functions (fma).
2183 Return NULL_RTX if a normal call should be emitted rather than expanding the
2184 function in-line. EXP is the expression that is a call to the builtin
2185 function; if convenient, the result should be placed in TARGET.
2186 SUBTARGET may be used as the target for computing one of EXP's
2187 operands. */
2189 static rtx
2191 {
2192 optab builtin_optab;
2197 machine_mode mode;
2207 {
2213 }
2215 /* Make a suitable register to place result in. */
2218 /* Before working hard, check whether the instruction is available. */
2224 /* Always stabilize the argument list. */
2235 /* Compute into RESULT.
2236 Set RESULT to wherever the result comes back. */
2240 /* If we were unable to expand via the builtin, stop the sequence
2241 (without outputting the insns) and call to the library function
2242 with the stabilized argument list. */
2244 {
2247 }
2249 /* Output the entire sequence. */
2255 }
2257 /* Expand a call to the builtin sin and cos math functions.
2258 Return NULL_RTX if a normal call should be emitted rather than expanding the
2259 function in-line. EXP is the expression that is a call to the builtin
2260 function; if convenient, the result should be placed in TARGET.
2261 SUBTARGET may be used as the target for computing one of EXP's
2262 operands. */
2264 static rtx
2266 {
2267 optab builtin_optab;
2268 rtx op0;
2271 machine_mode mode;
2272 tree arg;
2280 {
2286 }
2288 /* Make a suitable register to place result in. */
2291 /* Check if sincos insn is available, otherwise fallback
2292 to sin or cos insn. */
2295 {
2302 }
2304 /* Before working hard, check whether the instruction is available. */
2306 {
2309 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2310 need to expand the argument again. This way, we will not perform
2311 side-effects more the once. */
2318 /* Compute into RESULT.
2319 Set RESULT to wherever the result comes back. */
2321 {
2325 {
2334 }
2336 }
2337 else
2341 {
2342 /* Output the entire sequence. */
2347 }
2349 /* If we were unable to expand via the builtin, stop the sequence
2350 (without outputting the insns) and call to the library function
2351 with the stabilized argument list. */
2353 }
2356 }
2358 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2359 return an RTL instruction code that implements the functionality.
2360 If that isn't possible or available return CODE_FOR_nothing. */
2362 static enum insn_code
2364 {
2367 machine_mode mode;
2370 {
2384 /* These builtins have no optabs (yet). */
2388 }
2390 /* There's no easy way to detect the case we need to set EDOM. */
2394 /* Optab mode depends on the mode of the input argument. */
2400 }
2402 /* Expand a call to one of the builtin math functions that operate on
2403 floating point argument and output an integer result (ilogb, isinf,
2404 isnan, etc).
2405 Return 0 if a normal call should be emitted rather than expanding the
2406 function in-line. EXP is the expression that is a call to the builtin
2407 function; if convenient, the result should be placed in TARGET. */
2409 static rtx
2411 {
2413 rtx op0;
2415 machine_mode mode;
2416 tree arg;
2426 {
2431 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2432 need to expand the argument again. This way, we will not perform
2433 side-effects more the once. */
2448 }
2451 }
2453 /* Expand a call to the builtin sincos math function.
2454 Return NULL_RTX if a normal call should be emitted rather than expanding the
2455 function in-line. EXP is the expression that is a call to the builtin
2456 function. */
2458 static rtx
2460 {
2462 machine_mode mode;
2476 /* Make a suitable register to place result in. */
2479 /* Check if sincos insn is available, otherwise emit the call. */
2494 /* Compute into target1 and target2.
2495 Set TARGET to wherever the result comes back. */
2499 /* Move target1 and target2 to the memory locations indicated
2500 by op1 and op2. */
2505 }
2507 /* Expand a call to the internal cexpi builtin to the sincos math function.
2508 EXP is the expression that is a call to the builtin function; if convenient,
2509 the result should be placed in TARGET. */
2511 static rtx
2513 {
2516 machine_mode mode;
2527 /* Try expanding via a sincos optab, fall back to emitting a libcall
2528 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2529 is only generated from sincos, cexp or if we have either of them. */
2531 {
2537 /* Compute into op1 and op2. */
2539 }
2541 {
2552 else
2562 /* Make sure not to fold the sincos call again. */
2566 }
2567 else
2568 {
2578 else
2581 /* If we don't have a decl for cexp create one. This is the
2582 friendliest fallback if the user calls __builtin_cexpi
2583 without full target C99 function support. */
2585 {
2586 tree fntype;
2598 }
2603 /* Make sure not to fold the cexp call again. */
2607 }
2609 /* Now build the proper return type. */
2614 }
2616 /* Conveniently construct a function call expression. FNDECL names the
2617 function to be called, N is the number of arguments, and the "..."
2618 parameters are the argument expressions. Unlike build_call_exr
2619 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2621 static tree
2623 {
2633 }
2635 /* Expand a call to one of the builtin rounding functions gcc defines
2636 as an extension (lfloor and lceil). As these are gcc extensions we
2637 do not need to worry about setting errno to EDOM.
2638 If expanding via optab fails, lower expression to (int)(floor(x)).
2639 EXP is the expression that is a call to the builtin function;
2640 if convenient, the result should be placed in TARGET. */
2642 static rtx
2644 {
2645 convert_optab builtin_optab;
2650 tree fallback_fndecl;
2651 machine_mode mode;
2652 tree arg;
2660 {
2677 }
2679 /* Make a suitable register to place result in. */
2684 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2685 need to expand the argument again. This way, we will not perform
2686 side-effects more the once. */
2693 /* Compute into TARGET. */
2695 {
2696 /* Output the entire sequence. */
2701 }
2703 /* If we were unable to expand via the builtin, stop the sequence
2704 (without outputting the insns). */
2707 /* Fall back to floating point rounding optab. */
2710 /* For non-C99 targets we may end up without a fallback fndecl here
2711 if the user called __builtin_lfloor directly. In this case emit
2712 a call to the floor/ceil variants nevertheless. This should result
2713 in the best user experience for not full C99 targets. */
2715 {
2716 tree fntype;
2720 {
2753 }
2758 }
2765 /* Truncate the result of floating point optab to integer
2766 via expand_fix (). */
2771 }
2773 /* Expand a call to one of the builtin math functions doing integer
2774 conversion (lrint).
2775 Return 0 if a normal call should be emitted rather than expanding the
2776 function in-line. EXP is the expression that is a call to the builtin
2777 function; if convenient, the result should be placed in TARGET. */
2779 static rtx
2781 {
2782 convert_optab builtin_optab;
2783 rtx op0;
2786 tree arg;
2787 machine_mode mode;
2796 {
2815 }
2817 /* There's no easy way to detect the case we need to set EDOM. */
2821 /* Make a suitable register to place result in. */
2824 /* There's no easy way to detect the case we need to set EDOM. */
2826 {
2829 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2830 need to expand the argument again. This way, we will not perform
2831 side-effects more the once. */
2839 {
2840 /* Output the entire sequence. */
2845 }
2847 /* If we were unable to expand via the builtin, stop the sequence
2848 (without outputting the insns) and call to the library function
2849 with the stabilized argument list. */
2851 }
2854 {
2855 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2856 targets, (int) round (x) should never be transformed into
2857 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2858 a call to lround in the hope that the target provides at least some
2859 C99 functions. This should result in the best user experience for
2860 not full C99 targets. */
2861 tree fallback_fndecl = mathfn_built_in_1
2870 }
2873 }
2875 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2876 a normal call should be emitted rather than expanding the function
2877 in-line. EXP is the expression that is a call to the builtin
2878 function; if convenient, the result should be placed in TARGET. */
2880 static rtx
2882 {
2885 machine_mode mode;
2886 machine_mode mode2;
2895 /* Emit a libcall to libgcc. */
2897 /* Mode of the 2nd argument must match that of an int. */
2915 }
2917 /* Expand expression EXP which is a call to the strlen builtin. Return
2918 NULL_RTX if we failed and the caller should emit a normal call, otherwise
2919 try to get the result in TARGET, if convenient. */
2921 static rtx
2923 machine_mode target_mode)
2924 {
2929 rtx pat;
2930 tree len;
2932 rtx src_reg;
2934 machine_mode insn_mode;
2938 /* If the length can be computed at compile-time, return it. */
2943 /* If the length can be computed at compile-time and is constant
2944 integer, but there are side-effects in src, evaluate
2945 src for side-effects, then return len.
2946 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2947 can be optimized into: i++; x = 3; */
2950 {
2953 }
2957 /* If SRC is not a pointer type, don't do this operation inline. */
2961 /* Bail out if we can't compute strlen in the right mode. */
2963 {
2967 }
2971 /* Make a place to hold the source address. We will not expand
2972 the actual source until we are sure that the expansion will
2973 not fail -- there are trees that cannot be expanded twice. */
2976 /* Mark the beginning of the strlen sequence so we can emit the
2977 source operand later. */
2987 /* Check to see if the argument was declared attribute nonstring
2988 and if so, issue a warning since at this point it's not known
2989 to be nul-terminated. */
2992 /* Now that we are assured of success, expand the source. */
2996 {
2997 #ifdef POINTERS_EXTEND_UNSIGNED
3000 POINTERS_EXTEND_UNSIGNED);
3001 #endif
3003 }
3009 else
3012 /* Return the value in the proper mode for this function. */
3017 else
3021 }
3023 /* Expand call EXP to the strnlen built-in, returning the result
3024 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
3026 static rtx
3028 {
3046 /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
3047 so these conversions aren't necessary. */
3052 {
3056 "%K%qD specified bound %E "
3066 }
3079 "%K%qD specified bound [%wu, %wu] "
3092 }
3094 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3095 bytes from constant string DATA + OFFSET and return it as target
3096 constant. */
3098 static rtx
3100 scalar_int_mode mode)
3101 {
3109 }
3111 /* LEN specify length of the block of memcpy/memset operation.
3112 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3113 In some cases we can make very likely guess on max size, then we
3114 set it into PROBABLE_MAX_SIZE. */
3116 static void
3121 {
3123 {
3126 }
3127 else
3128 {
3132 /* Determine bounds from the type. */
3135 else
3140 else
3146 {
3151 }
3153 {
3154 /* Anti range 0...N lets us to determine minimal size to N+1. */
3156 {
3159 }
3160 /* Code like
3162 int n;
3163 if (n < 100)
3164 memcpy (a, b, n)
3166 Produce anti range allowing negative values of N. We still
3167 can use the information and make a guess that N is not negative.
3168 */
3171 }
3172 }
3176 }
3178 /* Try to verify that the sizes and lengths of the arguments to a string
3179 manipulation function given by EXP are within valid bounds and that
3180 the operation does not lead to buffer overflow or read past the end.
3181 Arguments other than EXP may be null. When non-null, the arguments
3182 have the following meaning:
3183 DST is the destination of a copy call or NULL otherwise.
3184 SRC is the source of a copy call or NULL otherwise.
3185 DSTWRITE is the number of bytes written into the destination obtained
3186 from the user-supplied size argument to the function (such as in
3187 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3188 MAXREAD is the user-supplied bound on the length of the source sequence
3189 (such as in strncat(d, s, N). It specifies the upper limit on the number
3190 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3191 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3192 expression EXP is a string function call (as opposed to a memory call
3193 like memcpy). As an exception, SRCSTR can also be an integer denoting
3194 the precomputed size of the source string or object (for functions like
3195 memcpy).
3196 DSTSIZE is the size of the destination object specified by the last
3197 argument to the _chk builtins, typically resulting from the expansion
3198 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3199 DSTSIZE).
3201 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3202 SIZE_MAX.
3204 If the call is successfully verified as safe return true, otherwise
3205 return false. */
3207 static bool
3210 {
3213 /* The size of the largest object is half the address space, or
3214 PTRDIFF_MAX. (This is way too permissive.) */
3217 /* Either the length of the source string for string functions or
3218 the size of the source object for raw memory functions. */
3223 /* Set to true when the exact number of bytes written by a string
3224 function like strcpy is not known and the only thing that is
3225 known is that it must be at least one (for the terminating nul). */
3228 {
3229 /* SRCSTR is normally a pointer to string but as a special case
3230 it can be an integer denoting the length of a string. */
3232 {
3233 /* Try to determine the range of lengths the source string
3234 refers to. If it can be determined and is less than
3235 the upper bound given by MAXREAD add one to it for
3236 the terminating nul. Otherwise, set it to one for
3237 the same reason, or to MAXREAD as appropriate. */
3240 {
3243 else
3254 }
3255 else
3256 {
3259 }
3260 }
3261 else
3263 }
3266 {
3267 /* When the only available piece of data is the object size
3268 there is nothing to do. */
3272 /* Otherwise, when the length of the source sequence is known
3273 (as with strlen), set DSTWRITE to it. */
3276 }
3286 /* First check the number of bytes to be written against the maximum
3287 object size. */
3291 {
3301 "%K%qD specified size %E "
3304 else
3306 "%K%qD specified size between %E and %E "
3314 }
3316 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3317 constant, and in range of unsigned HOST_WIDE_INT. */
3320 /* Next check the number of bytes to be written against the destination
3321 object size. */
3323 {
3328 || (dstwrite
3331 {
3339 {
3340 /* This is a call to strcpy with a destination of 0 size
3341 and a source of unknown length. The call will write
3342 at least one byte past the end of the destination. */
3344 "%K%qD writing %E or more bytes into a region "
3347 }
3350 "%K%qD writing %E byte into a region "
3352 "%K%qD writing %E bytes into a region "
3356 {
3357 /* Avoid printing the upper bound if it's invalid. */
3359 "%K%qD writing %E or more bytes into a region "
3362 }
3363 else
3365 "%K%qD writing between %E and %E bytes into "
3368 dstsize);
3370 /* Return error when an overflow has been detected. */
3372 }
3373 }
3375 /* Check the maximum length of the source sequence against the size
3376 of the destination object if known, or against the maximum size
3377 of an object. */
3379 {
3382 /* Use the lower end for MAXREAD from now on. */
3387 {
3392 {
3396 /* Warn about crazy big sizes first since that's more
3397 likely to be meaningful than saying that the bound
3398 is greater than the object size if both are big. */
3401 "%K%qD specified bound %E "
3405 else
3407 "%K%qD specified bound between %E and %E "
3413 }
3416 {
3422 "%K%qD specified bound %E "
3426 else
3428 "%K%qD specified bound between %E and %E "
3433 }
3434 }
3435 }
3437 /* Check for reading past the end of SRC. */
3442 {
3454 {
3455 /* Avoid printing the upper bound if it's invalid. */
3457 "%K%qD reading %E or more bytes from a region "
3460 }
3461 else
3463 "%K%qD reading between %E and %E bytes from a region "
3467 }
3470 }
3472 /* Helper to compute the size of the object referenced by the DEST
3473 expression which must have pointer type, using Object Size type
3474 OSTYPE (only the least significant 2 bits are used). Return
3475 an estimate of the size of the object if successful or NULL when
3476 the size cannot be determined. When the referenced object involves
3477 a non-constant offset in some range the returned value represents
3478 the largest size given the smallest non-negative offset in the
3479 range. The function is intended for diagnostics and should not
3480 be used to influence code generation or optimization. */
3482 tree
3484 {
3487 /* Only the two least significant bits are meaningful. */
3494 {
3503 {
3504 /* compute_builtin_object_size fails for addresses with
3505 non-constant offsets. Try to determine the range of
3506 such an offset here and use it to adjust the constant
3507 size. */
3510 {
3512 {
3516 /* Ignore negative offsets for now. For others,
3517 use the lower bound as the most optimistic
3518 estimate of the (remaining) size. */
3520 ;
3524 else
3526 }
3527 }
3530 {
3535 {
3537 {
3540 /* Ignore negative offsets for now. For others,
3541 use the lower bound as the most optimistic
3542 estimate of the (remaining)size. */
3544 ;
3548 else
3550 }
3551 }
3552 }
3553 }
3556 }
3558 /* Unless computing the largest size (for memcpy and other raw memory
3559 functions), try to determine the size of the object from its type. */
3574 {
3575 /* Return the constant size unless it's zero (that's a zero-length
3576 array likely at the end of a struct). */
3581 }
3584 }
3586 /* Helper to determine and check the sizes of the source and the destination
3587 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3588 call expression, DEST is the destination argument, SRC is the source
3589 argument or null, and LEN is the number of bytes. Use Object Size type-0
3590 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3591 (no overflow or invalid sizes), false otherwise. */
3593 static bool
3595 {
3596 /* For functions like memset and memcpy that operate on raw memory
3597 try to determine the size of the largest source and destination
3598 object using type-0 Object Size regardless of the object size
3599 type specified by the option. */
3605 }
3607 /* Validate memchr arguments without performing any expansion.
3608 Return NULL_RTX. */
3610 static rtx
3612 {
3620 /* Diagnose calls where the specified length exceeds the size
3621 of the object. */
3623 {
3627 }
3630 }
3632 /* Expand a call EXP to the memcpy builtin.
3633 Return NULL_RTX if we failed, the caller should emit a normal call,
3634 otherwise try to get the result in TARGET, if convenient (and in
3635 mode MODE if that's convenient). */
3637 static rtx
3639 {
3652 }
3654 /* Check a call EXP to the memmove built-in for validity.
3655 Return NULL_RTX on both success and failure. */
3657 static rtx
3659 {
3671 }
3673 /* Expand a call EXP to the mempcpy builtin.
3674 Return NULL_RTX if we failed; the caller should emit a normal call,
3675 otherwise try to get the result in TARGET, if convenient (and in
3676 mode MODE if that's convenient). If ENDP is 0 return the
3677 destination pointer, if ENDP is 1 return the end pointer ala
3678 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3679 stpcpy. */
3681 static rtx
3683 {
3692 /* Policy does not generally allow using compute_objsize (which
3693 is used internally by check_memop_size) to change code generation
3694 or drive optimization decisions.
3696 In this instance it is safe because the code we generate has
3697 the same semantics regardless of the return value of
3698 check_memop_sizes. Exactly the same amount of data is copied
3699 and the return value is exactly the same in both cases.
3701 Furthermore, check_memop_size always uses mode 0 for the call to
3702 compute_objsize, so the imprecise nature of compute_objsize is
3703 avoided. */
3705 /* Avoid expanding mempcpy into memcpy when the call is determined
3706 to overflow the buffer. This also prevents the same overflow
3707 from being diagnosed again when expanding memcpy. */
3713 }
3715 /* Helper function to do the actual work for expand of memory copy family
3716 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3717 of memory from SRC to DEST and assign to TARGET if convenient.
3718 If ENDP is 0 return the
3719 destination pointer, if ENDP is 1 return the end pointer ala
3720 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3721 stpcpy. */
3723 static rtx
3726 {
3737 /* If DEST is not a pointer type, call the normal function. */
3741 /* If either SRC is not a pointer type, don't do this
3742 operation in-line. */
3759 /* If SRC is a string constant and block move would be done
3760 by pieces, we can avoid loading the string from memory
3761 and only stored the computed constants. */
3768 {
3770 builtin_memcpy_read_str,
3776 }
3781 /* Copy word part most expediently. */
3794 {
3797 }
3800 {
3802 /* stpcpy pointer to last byte. */
3805 }
3808 }
3810 static rtx
3813 {
3815 endp);
3816 }
3818 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3819 we failed, the caller should emit a normal call, otherwise try to
3820 get the result in TARGET, if convenient. If ENDP is 0 return the
3821 destination pointer, if ENDP is 1 return the end pointer ala
3822 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3823 stpcpy. */
3825 static rtx
3827 {
3829 rtx dest_mem;
3830 rtx src_mem;
3838 {
3841 }
3850 {
3852 /* movstr is supposed to set end to the address of the NUL
3853 terminator. If the caller requested a mempcpy-like return value,
3854 adjust it. */
3856 {
3860 }
3861 }
3863 }
3865 /* Do some very basic size validation of a call to the strcpy builtin
3866 given by EXP. Return NULL_RTX to have the built-in expand to a call
3867 to the library function. */
3869 static rtx
3871 {
3879 /* There is no way here to determine the length of the string in
3880 the destination to which the SRC string is being appended so
3881 just diagnose cases when the souce string is longer than
3882 the destination object. */
3887 destsize);
3890 }
3892 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3893 NULL_RTX if we failed the caller should emit a normal call, otherwise
3894 try to get the result in TARGET, if convenient (and in mode MODE if that's
3895 convenient). */
3897 static rtx
3899 {
3907 {
3911 }
3914 {
3915 /* Check to see if the argument was declared attribute nonstring
3916 and if so, issue a warning since at this point it's not known
3917 to be nul-terminated. */
3921 }
3924 }
3926 /* Helper function to do the actual work for expand_builtin_strcpy. The
3927 arguments to the builtin_strcpy call DEST and SRC are broken out
3928 so that this can also be called without constructing an actual CALL_EXPR.
3929 The other arguments and return value are the same as for
3930 expand_builtin_strcpy. */
3932 static rtx
3934 {
3935 /* Detect strcpy calls with unterminated arrays.. */
3937 {
3938 /* NONSTR refers to the non-nul terminated constant array. */
3942 }
3945 }
3947 /* Expand a call EXP to the stpcpy builtin.
3948 Return NULL_RTX if we failed the caller should emit a normal call,
3949 otherwise try to get the result in TARGET, if convenient (and in
3950 mode MODE if that's convenient). */
3952 static rtx
3954 {
3965 {
3969 }
3971 /* If return value is ignored, transform stpcpy into strcpy. */
3973 {
3977 }
3978 else
3979 {
3981 rtx ret;
3983 /* Ensure we get an actual string whose length can be evaluated at
3984 compile-time, not an expression containing a string. This is
3985 because the latter will potentially produce pessimized code
3986 when used to produce the return value. */
4003 {
4007 {
4011 {
4013 {
4016 else
4018 }
4027 }
4028 }
4029 }
4032 }
4033 }
4035 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
4036 arguments while being careful to avoid duplicate warnings (which could
4037 be issued if the expander were to expand the call, resulting in it
4038 being emitted in expand_call(). */
4040 static rtx
4042 {
4044 {
4045 /* The call has been successfully expanded. Check for nonstring
4046 arguments and issue warnings as appropriate. */
4049 }
4052 }
4054 /* Check a call EXP to the stpncpy built-in for validity.
4055 Return NULL_RTX on both success and failure. */
4057 static rtx
4059 {
4065 /* The source and destination of the call. */
4069 /* The exact number of bytes to write (not the maximum). */
4072 /* The size of the destination object. */
4078 }
4080 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4081 bytes from constant string DATA + OFFSET and return it as target
4082 constant. */
4084 rtx
4086 scalar_int_mode mode)
4087 {
4094 }
4096 /* Helper to check the sizes of sequences and the destination of calls
4097 to __builtin_strncat and __builtin___strncat_chk. Returns true on
4098 success (no overflow or invalid sizes), false otherwise. */
4100 static bool
4102 {
4107 /* Try to determine the range of lengths that the source expression
4108 refers to. */
4112 /* Try to verify that the destination is big enough for the shortest
4113 string. */
4116 {
4117 /* If it hasn't been provided by __strncat_chk, try to determine
4118 the size of the destination object into which the source is
4119 being copied. */
4121 }
4123 /* Add one for the terminating nul. */
4126 size_one_node)
4129 /* The strncat function copies at most MAXREAD bytes and always appends
4130 the terminating nul so the specified upper bound should never be equal
4131 to (or greater than) the size of the destination. */
4134 {
4143 }
4151 /* The number of bytes to write is LEN but check_access will also
4152 check SRCLEN if LEN's value isn't known. */
4154 objsize);
4155 }
4157 /* Similar to expand_builtin_strcat, do some very basic size validation
4158 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4159 the built-in expand to a call to the library function. */
4161 static rtx
4163 {
4171 /* The upper bound on the number of bytes to write. */
4173 /* The length of the source sequence. */
4176 /* Try to determine the range of lengths that the source expression
4177 refers to. */
4181 else
4184 /* Try to verify that the destination is big enough for the shortest
4185 string. First try to determine the size of the destination object
4186 into which the source is being copied. */
4189 /* Add one for the terminating nul. */
4192 size_one_node)
4195 /* The strncat function copies at most MAXREAD bytes and always appends
4196 the terminating nul so the specified upper bound should never be equal
4197 to (or greater than) the size of the destination. */
4200 {
4209 }
4217 /* The number of bytes to write is SRCLEN. */
4221 }
4223 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4224 NULL_RTX if we failed the caller should emit a normal call. */
4226 static rtx
4228 {
4233 {
4236 /* The number of bytes to write (not the maximum). */
4238 /* The length of the source sequence. */
4242 {
4246 /* The number of bytes to write is LEN but check_access will also
4247 check SLEN if LEN's value isn't known. */
4249 destsize);
4250 }
4252 /* We must be passed a constant len and src parameter. */
4258 /* We're required to pad with trailing zeros if the requested
4259 len is greater than strlen(s2)+1. In that case try to
4260 use store_by_pieces, if it fails, punt. */
4262 {
4265 rtx dest_mem;
4269 builtin_strncpy_read_str,
4276 builtin_strncpy_read_str,
4281 }
4282 }
4284 }
4286 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4287 bytes from constant string DATA + OFFSET and return it as target
4288 constant. */
4290 rtx
4292 scalar_int_mode mode)
4293 {
4300 }
4302 /* Callback routine for store_by_pieces. Return the RTL of a register
4303 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4304 char value given in the RTL register data. For example, if mode is
4305 4 bytes wide, return the RTL for 0x01010101*data. */
4307 static rtx
4309 scalar_int_mode mode)
4310 {
4326 }
4328 /* Expand expression EXP, which is a call to the memset builtin. Return
4329 NULL_RTX if we failed the caller should emit a normal call, otherwise
4330 try to get the result in TARGET, if convenient (and in mode MODE if that's
4331 convenient). */
4333 static rtx
4335 {
4347 }
4349 /* Helper function to do the actual work for expand_builtin_memset. The
4350 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4351 so that this can also be called without constructing an actual CALL_EXPR.
4352 The other arguments and return value are the same as for
4353 expand_builtin_memset. */
4355 static rtx
4358 {
4361 machine_mode val_mode;
4373 /* If DEST is not a pointer type, don't do this operation in-line. */
4384 /* If the LEN parameter is zero, return DEST. */
4386 {
4387 /* Evaluate and ignore VAL in case it has side-effects. */
4390 }
4392 /* Stabilize the arguments in case we fail. */
4404 {
4405 rtx val_rtx;
4410 /* Assume that we can memset by pieces if we can store
4411 * the coefficients by pieces (in the required modes).
4412 * We can't pass builtin_memset_gen_str as that emits RTL. */
4418 {
4423 }
4427 probable_max_size))
4433 }
4439 {
4450 probable_max_size))
4456 }
4464 probable_max_size);
4467 {
4470 }
4474 do_libcall:
4483 else
4488 }
4490 /* Expand expression EXP, which is a call to the bzero builtin. Return
4491 NULL_RTX if we failed the caller should emit a normal call. */
4493 static rtx
4495 {
4504 /* New argument list transforming bzero(ptr x, int y) to
4505 memset(ptr x, int 0, size_t y). This is done this way
4506 so that if it isn't expanded inline, we fallback to
4507 calling bzero instead of memset. */
4515 }
4517 /* Try to expand cmpstr operation ICODE with the given operands.
4518 Return the result rtx on success, otherwise return null. */
4520 static rtx
4522 HOST_WIDE_INT align)
4523 {
4537 }
4539 /* Expand expression EXP, which is a call to the memcmp built-in function.
4540 Return NULL_RTX if we failed and the caller should emit a normal call,
4541 otherwise try to get the result in TARGET, if convenient.
4542 RESULT_EQ is true if we can relax the returned value to be either zero
4543 or nonzero, without caring about the sign. */
4545 static rtx
4547 {
4558 /* Diagnose calls where the specified length exceeds the size of either
4559 object. */
4565 {
4570 }
4572 /* If the specified length exceeds the size of either object,
4573 call the function. */
4577 /* Due to the performance benefit, always inline the calls first
4578 when result_eq is false. */
4582 {
4586 }
4594 /* If we don't have POINTER_TYPE, call the function. */
4602 /* Set MEM_SIZE as appropriate. */
4604 {
4607 }
4613 {
4617 }
4619 /* If SRC is a string constant and block move would be done
4620 by pieces, we can avoid loading the string from memory
4621 and only stored the computed constants. */
4633 {
4634 /* Return the value in the proper mode for this function. */
4639 {
4642 }
4645 }
4648 }
4650 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4651 if we failed the caller should emit a normal call, otherwise try to get
4652 the result in TARGET, if convenient. */
4654 static rtx
4656 {
4660 /* Due to the performance benefit, always inline the calls first. */
4677 /* If we don't have POINTER_TYPE, call the function. */
4681 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4688 /* Try to call cmpstrsi. */
4693 /* Try to determine at least one length and call cmpstrnsi. */
4695 {
4696 tree len;
4697 rtx arg3_rtx;
4707 /* If we don't have a constant length for the first, use the length
4708 of the second, if we know it. We don't require a constant for
4709 this case; some cost analysis could be done if both are available
4710 but neither is constant. For now, assume they're equally cheap,
4711 unless one has side effects. If both strings have constant lengths,
4712 use the smaller. */
4728 else
4731 /* If both arguments have side effects, we cannot optimize. */
4733 {
4735 result = expand_cmpstrn_or_cmpmem
4738 }
4739 }
4743 {
4744 /* Check to see if the argument was declared attribute nonstring
4745 and if so, issue a warning since at this point it's not known
4746 to be nul-terminated. */
4749 /* Return the value in the proper mode for this function. */
4757 }
4759 /* Expand the library call ourselves using a stabilized argument
4760 list to avoid re-evaluating the function's arguments twice. */
4765 }
4767 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4768 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4769 the result in TARGET, if convenient. */
4771 static rtx
4773 ATTRIBUTE_UNUSED machine_mode mode)
4774 {
4779 /* Due to the performance benefit, always inline the calls first. */
4785 /* If c_strlen can determine an expression for one of the string
4786 lengths, and it doesn't have side effects, then emit cmpstrnsi
4787 using length MIN(strlen(string)+1, arg3). */
4792 tree len;
4813 /* If we don't have a constant length for the first, use the length
4814 of the second, if we know it. If neither string is constant length,
4815 use the given length argument. We don't require a constant for
4816 this case; some cost analysis could be done if both are available
4817 but neither is constant. For now, assume they're equally cheap,
4818 unless one has side effects. If both strings have constant lengths,
4819 use the smaller. */
4837 else
4840 /* If we are not using the given length, we must incorporate it here.
4841 The actual new length parameter will be MIN(len,arg3) in this case. */
4843 {
4846 }
4856 {
4857 /* Check to see if the argument was declared attribute nonstring
4858 and if so, issue a warning since at this point it's not known
4859 to be nul-terminated. */
4862 /* Return the value in the proper mode for this function. */
4870 }
4872 /* Expand the library call ourselves using a stabilized argument
4873 list to avoid re-evaluating the function's arguments twice. */
4878 }
4880 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4881 if that's convenient. */
4883 rtx
4885 {
4886 rtx val;
4889 /* Don't do __builtin_saveregs more than once in a function.
4890 Save the result of the first call and reuse it. */
4894 /* When this function is called, it means that registers must be
4895 saved on entry to this function. So we migrate the call to the
4896 first insn of this function. */
4900 /* Do whatever the machine needs done in this case. */
4908 /* Put the insns after the NOTE that starts the function. If this
4909 is inside a start_sequence, make the outer-level insn chain current, so
4910 the code is placed at the start of the function. */
4916 }
4918 /* Expand a call to __builtin_next_arg. */
4920 static rtx
4922 {
4923 /* Checking arguments is already done in fold_builtin_next_arg
4924 that must be called before this function. */
4929 }
4931 /* Make it easier for the backends by protecting the valist argument
4932 from multiple evaluations. */
4934 static tree
4936 {
4939 /* The current way of determining the type of valist is completely
4940 bogus. We should have the information on the va builtin instead. */
4945 {
4949 /* For this case, the backends will be expecting a pointer to
4950 vatype, but it's possible we've actually been given an array
4951 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4952 So fix it. */
4954 {
4957 }
4958 }
4959 else
4960 {
4964 {
4970 }
4976 }
4979 }
4981 /* The "standard" definition of va_list is void*. */
4983 tree
4985 {
4987 }
4989 /* The "standard" abi va_list is va_list_type_node. */
4991 tree
4993 {
4995 }
4997 /* The "standard" type of va_list is va_list_type_node. */
4999 tree
5001 {
5008 {
5009 /* If va_list is an array type, the argument may have decayed
5010 to a pointer type, e.g. by being passed to another function.
5011 In that case, unwrap both types so that we can compare the
5012 underlying records. */
5015 {
5018 }
5019 }
5024 }
5026 /* The "standard" implementation of va_start: just assign `nextarg' to
5027 the variable. */
5029 void
5031 {
5034 }
5036 /* Expand EXP, a call to __builtin_va_start. */
5038 static rtx
5040 {
5041 rtx nextarg;
5042 tree valist;
5046 {
5049 }
5059 else
5063 }
5065 /* Expand EXP, a call to __builtin_va_end. */
5067 static rtx
5069 {
5072 /* Evaluate for side effects, if needed. I hate macros that don't
5073 do that. */
5078 }
5080 /* Expand EXP, a call to __builtin_va_copy. We do this as a
5081 builtin rather than just as an assignment in stdarg.h because of the
5082 nastiness of array-type va_list types. */
5084 static rtx
5086 {
5099 {
5103 }
5104 else
5105 {
5108 /* Evaluate to pointers. */
5117 /* "Dereference" to BLKmode memories. */
5125 /* Copy. */
5127 }
5130 }
5132 /* Expand a call to one of the builtin functions __builtin_frame_address or
5133 __builtin_return_address. */
5135 static rtx
5137 {
5138 /* The argument must be a nonnegative integer constant.
5139 It counts the number of frames to scan up the stack.
5140 The value is either the frame pointer value or the return
5141 address saved in that frame. */
5143 /* Warning about missing arg was already issued. */
5146 {
5149 }
5150 else
5151 {
5152 /* Number of frames to scan up the stack. */
5157 /* Some ports cannot access arbitrary stack frames. */
5159 {
5162 }
5165 {
5166 /* Warn since no effort is made to ensure that any frame
5167 beyond the current one exists or can be safely reached. */
5170 }
5172 /* For __builtin_frame_address, return what we've got. */
5180 }
5181 }
5183 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5184 failed and the caller should emit a normal call. */
5186 static rtx
5188 {
5189 rtx op0;
5190 rtx result;
5193 HOST_WIDE_INT max_size;
5196 bool valid_arglist
5199 VOID_TYPE)
5210 || (!alloca_for_var
5213 ))
5214 {
5215 /* -Walloca-larger-than and -Wvla-larger-than settings of
5216 less than HOST_WIDE_INT_MAX override the more general
5217 -Walloc-size-larger-than so unless either of the former
5218 options is smaller than the last one (wchich would imply
5219 that the call was already checked), check the alloca
5220 arguments for overflow. */
5224 }
5226 /* Compute the argument. */
5229 /* Compute the alignment. */
5231 ? BIGGEST_ALIGNMENT
5234 /* Compute the maximum size. */
5239 /* Allocate the desired space. If the allocation stems from the declaration
5240 of a variable-sized object, it cannot accumulate. */
5241 result
5246 }
5248 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5249 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5250 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5251 handle_builtin_stack_restore function. */
5253 static rtx
5255 {
5262 OPTAB_LIB_WIDEN);
5265 OPTAB_LIB_WIDEN);
5270 }
5272 /* Expand a call to bswap builtin in EXP.
5273 Return NULL_RTX if a normal call should be emitted rather than expanding the
5274 function in-line. If convenient, the result should be placed in TARGET.
5275 SUBTARGET may be used as the target for computing one of EXP's operands. */
5277 static rtx
5279 rtx subtarget)
5280 {
5281 tree arg;
5282 rtx op0;
5300 }
5302 /* Expand a call to a unary builtin in EXP.
5303 Return NULL_RTX if a normal call should be emitted rather than expanding the
5304 function in-line. If convenient, the result should be placed in TARGET.
5305 SUBTARGET may be used as the target for computing one of EXP's operands. */
5307 static rtx
5310 {
5311 rtx op0;
5316 /* Compute the argument. */
5318 (subtarget
5322 /* Compute op, into TARGET if possible.
5323 Set TARGET to wherever the result comes back. */
5329 }
5331 /* Expand a call to __builtin_expect. We just return our argument
5332 as the builtin_expect semantic should've been already executed by
5333 tree branch prediction pass. */
5335 static rtx
5337 {
5338 tree arg;
5345 /* When guessing was done, the hints should be already stripped away. */
5349 }
5351 /* Expand a call to __builtin_expect_with_probability. We just return our
5352 argument as the builtin_expect semantic should've been already executed by
5353 tree branch prediction pass. */
5355 static rtx
5357 {
5358 tree arg;
5365 /* When guessing was done, the hints should be already stripped away. */
5369 }
5372 /* Expand a call to __builtin_assume_aligned. We just return our first
5373 argument as the builtin_assume_aligned semantic should've been already
5374 executed by CCP. */
5376 static rtx
5378 {
5382 EXPAND_NORMAL);
5387 }
5389 void
5391 {
5393 {
5395 /* For trap insns when not accumulating outgoing args force
5396 REG_ARGS_SIZE note to prevent crossjumping of calls with
5397 different args sizes. */
5400 }
5401 else
5402 {
5406 }
5409 }
5411 /* Expand a call to __builtin_unreachable. We do nothing except emit
5412 a barrier saying that control flow will not pass here.
5414 It is the responsibility of the program being compiled to ensure
5415 that control flow does never reach __builtin_unreachable. */
5416 static void
5418 {
5420 }
5422 /* Expand EXP, a call to fabs, fabsf or fabsl.
5423 Return NULL_RTX if a normal call should be emitted rather than expanding
5424 the function inline. If convenient, the result should be placed
5425 in TARGET. SUBTARGET may be used as the target for computing
5426 the operand. */
5428 static rtx
5430 {
5431 machine_mode mode;
5432 tree arg;
5433 rtx op0;
5443 }
5445 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5446 Return NULL is a normal call should be emitted rather than expanding the
5447 function inline. If convenient, the result should be placed in TARGET.
5448 SUBTARGET may be used as the target for computing the operand. */
5450 static rtx
5452 {
5454 tree arg;
5466 }
5468 /* Expand a call to __builtin___clear_cache. */
5470 static rtx
5472 {
5474 {
5475 #ifdef CLEAR_INSN_CACHE
5476 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5477 does something. Just do the default expansion to a call to
5478 __clear_cache(). */
5480 #else
5481 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5482 does nothing. There is no need to call it. Do nothing. */
5485 }
5487 /* We have a "clear_cache" insn, and it will handle everything. */
5491 /* We must not expand to a library call. If we did, any
5492 fallback library function in libgcc that might contain a call to
5493 __builtin___clear_cache() would recurse infinitely. */
5495 {
5498 }
5501 {
5514 }
5516 }
5518 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5520 static rtx
5522 {
5525 /* If we don't need too much alignment, we'll have been guaranteed
5526 proper alignment by get_trampoline_type. */
5530 /* Round address up to desired boundary. */
5541 }
5543 static rtx
5545 {
5561 /* If ONSTACK, the TRAMP argument should be the address of a field
5562 within the local function's FRAME decl. Either way, let's see if
5563 we can fill in the MEM_ATTRs for this memory. */
5567 /* Creator of a heap trampoline is responsible for making sure the
5568 address is aligned to at least STACK_BOUNDARY. Normally malloc
5569 will ensure this anyhow. */
5572 {
5576 }
5578 /* The FUNC argument should be the address of the nested function.
5579 Extract the actual function decl to pass to the hook. */
5586 /* Generate insns to initialize the trampoline. */
5590 {
5596 }
5599 }
5601 static rtx
5603 {
5604 rtx tramp;
5615 }
5617 /* Expand a call to the builtin descriptor initialization routine.
5618 A descriptor is made up of a couple of pointers to the static
5619 chain and the code entry in this order. */
5621 static rtx
5623 {
5628 VOID_TYPE))
5642 /* Generate insns to initialize the descriptor. */
5648 }
5650 /* Expand a call to the builtin descriptor adjustment routine. */
5652 static rtx
5654 {
5655 rtx tramp;
5662 /* Unalign the descriptor to allow runtime identification. */
5667 }
5669 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5670 function. The function first checks whether the back end provides
5671 an insn to implement signbit for the respective mode. If not, it
5672 checks whether the floating point format of the value is such that
5673 the sign bit can be extracted. If that is not the case, error out.
5674 EXP is the expression that is a call to the builtin function; if
5675 convenient, the result should be placed in TARGET. */
5676 static rtx
5678 {
5680 scalar_float_mode fmode;
5682 tree arg;
5685 rtx temp;
5698 /* Expand the argument yielding a RTX expression. */
5701 /* Check if the back end provides an insn that handles signbit for the
5702 argument's mode. */
5705 {
5711 }
5713 /* For floating point formats without a sign bit, implement signbit
5714 as "ARG < 0.0". */
5717 {
5718 /* But we can't do this if the format supports signed zero. */
5724 }
5727 {
5730 }
5731 else
5732 {
5734 /* Handle targets with different FP word orders. */
5737 else
5741 }
5743 /* Force the intermediate word_mode (or narrower) result into a
5744 register. This avoids attempting to create paradoxical SUBREGs
5745 of floating point modes below. */
5748 /* If the bitpos is within the "result mode" lowpart, the operation
5749 can be implement with a single bitwise AND. Otherwise, we need
5750 a right shift and an AND. */
5753 {
5761 }
5762 else
5763 {
5764 /* Perform a logical right shift to place the signbit in the least
5765 significant bit, then truncate the result to the desired mode
5766 and mask just this bit. */
5771 }
5774 }
5776 /* Expand fork or exec calls. TARGET is the desired target of the
5777 call. EXP is the call. FN is the
5778 identificator of the actual function. IGNORE is nonzero if the
5779 value is to be ignored. */
5781 static rtx
5783 {
5785 tree call;
5787 /* If we are not profiling, just call the function. */
5791 /* Otherwise call the wrapper. This should be equivalent for the rest of
5792 compiler, so the code does not diverge, and the wrapper may run the
5793 code necessary for keeping the profiling sane. */
5796 {
5827 }
5839 }
5842 \f
5843 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5844 the pointer in these functions is void*, the tree optimizers may remove
5845 casts. The mode computed in expand_builtin isn't reliable either, due
5846 to __sync_bool_compare_and_swap.
5848 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5849 group of builtins. This gives us log2 of the mode size. */
5853 {
5854 /* The size is not negotiable, so ask not to get BLKmode in return
5855 if the target indicates that a smaller size would be better. */
5857 }
5859 /* Expand the memory expression LOC and return the appropriate memory operand
5860 for the builtin_sync operations. */
5862 static rtx
5864 {
5870 /* Note that we explicitly do not want any alias information for this
5871 memory, so that we kill all other live memories. Otherwise we don't
5872 satisfy the full barrier semantics of the intrinsic. */
5875 /* The alignment needs to be at least according to that of the mode. */
5882 }
5884 /* Make sure an argument is in the right mode.
5885 EXP is the tree argument.
5886 MODE is the mode it should be in. */
5888 static rtx
5890 {
5891 rtx val;
5892 machine_mode old_mode;
5895 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5896 of CONST_INTs, where we know the old_mode only from the call argument. */
5903 }
5906 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5907 EXP is the CALL_EXPR. CODE is the rtx code
5908 that corresponds to the arithmetic or logical operation from the name;
5909 an exception here is that NOT actually means NAND. TARGET is an optional
5910 place for us to store the results; AFTER is true if this is the
5911 fetch_and_xxx form. */
5913 static rtx
5916 rtx target)
5917 {
5922 {
5929 {
5958 }
5959 }
5961 /* Expand the operands. */
5966 after);
5967 }
5969 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5970 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5971 true if this is the boolean form. TARGET is a place for us to store the
5972 results; this is NOT optional if IS_BOOL is true. */
5974 static rtx
5977 {
5981 /* Expand the operands. */
5988 {
5991 else
5993 }
5996 MEMMODEL_SYNC_SEQ_CST))
6000 }
6002 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
6003 general form is actually an atomic exchange, and some targets only
6004 support a reduced form with the second argument being a constant 1.
6005 EXP is the CALL_EXPR; TARGET is an optional place for us to store
6006 the results. */
6008 static rtx
6010 rtx target)
6011 {
6014 /* Expand the operands. */
6019 }
6021 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
6023 static void
6025 {
6026 rtx mem;
6028 /* Expand the operands. */
6032 }
6034 /* Given an integer representing an ``enum memmodel'', verify its
6035 correctness and return the memory model enum. */
6037 static enum memmodel
6039 {
6040 rtx op;
6042 source_location loc
6045 /* If the parameter is not a constant, it's a run time value so we'll just
6046 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
6056 {
6060 }
6062 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
6064 {
6068 }
6070 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
6071 be conservative and promote consume to acquire. */
6076 }
6078 /* Expand the __atomic_exchange intrinsic:
6079 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
6080 EXP is the CALL_EXPR.
6081 TARGET is an optional place for us to store the results. */
6083 static rtx
6085 {
6094 /* Expand the operands. */
6099 }
6101 /* Expand the __atomic_compare_exchange intrinsic:
6102 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
6103 TYPE desired, BOOL weak,
6104 enum memmodel success,
6105 enum memmodel failure)
6106 EXP is the CALL_EXPR.
6107 TARGET is an optional place for us to store the results. */
6109 static rtx
6111 rtx target)
6112 {
6116 tree weak;
6118 source_location loc
6125 {
6127 "failure memory model cannot be stronger than success "
6130 }
6133 {
6135 "invalid failure memory model for "
6139 }
6145 /* Expand the operands. */
6161 /* Lest the rtl backend create a race condition with an imporoper store
6162 to memory, always create a new pseudo for OLDVAL. */
6169 /* Conditionally store back to EXPECT, lest we create a race condition
6170 with an improper store to memory. */
6171 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6172 the normal case where EXPECT is totally private, i.e. a register. At
6173 which point the store can be unconditional. */
6181 }
6183 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6184 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6185 call. The weak parameter must be dropped to match the expected parameter
6186 list and the expected argument changed from value to pointer to memory
6187 slot. */
6189 static void
6191 {
6207 /* Skip the boolean weak parameter. */
6210 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6213 built_in_function fncode
6218 fndecl);
6223 {
6230 }
6231 }
6233 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6235 void
6237 {
6243 tree lhs;
6245 source_location loc
6252 {
6254 "failure memory model cannot be stronger than success "
6257 }
6260 {
6262 "invalid failure memory model for "
6266 }
6269 {
6272 }
6274 /* Expand the operands. */
6287 {
6290 }
6294 {
6300 }
6301 }
6303 /* Expand the __atomic_load intrinsic:
6304 TYPE __atomic_load (TYPE *object, enum memmodel)
6305 EXP is the CALL_EXPR.
6306 TARGET is an optional place for us to store the results. */
6308 static rtx
6310 {
6311 rtx mem;
6316 {
6317 source_location loc
6322 }
6327 /* Expand the operand. */
6331 }
6334 /* Expand the __atomic_store intrinsic:
6335 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6336 EXP is the CALL_EXPR.
6337 TARGET is an optional place for us to store the results. */
6339 static rtx
6341 {
6348 {
6349 source_location loc
6354 }
6359 /* Expand the operands. */
6364 }
6366 /* Expand the __atomic_fetch_XXX intrinsic:
6367 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6368 EXP is the CALL_EXPR.
6369 TARGET is an optional place for us to store the results.
6370 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6371 FETCH_AFTER is true if returning the result of the operation.
6372 FETCH_AFTER is false if returning the value before the operation.
6373 IGNORE is true if the result is not used.
6374 EXT_CALL is the correct builtin for an external call if this cannot be
6375 resolved to an instruction sequence. */
6377 static rtx
6381 {
6384 tree fndecl;
6385 tree addr;
6389 /* Expand the operands. */
6393 /* Only try generating instructions if inlining is turned on. */
6395 {
6399 }
6401 /* Return if a different routine isn't needed for the library call. */
6405 /* Change the call to the specified function. */
6413 /* If we will emit code after the call, the call can not be a tail call.
6414 If it is emitted as a tail call, a barrier is emitted after it, and
6415 then all trailing code is removed. */
6419 /* Expand the call here so we can emit trailing code. */
6422 /* Replace the original function just in case it matters. */
6425 /* Then issue the arithmetic correction to return the right result. */
6427 {
6429 {
6431 OPTAB_LIB_WIDEN);
6433 }
6434 else
6436 OPTAB_LIB_WIDEN);
6437 }
6439 }
6441 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6443 void
6445 {
6453 optab optab;
6465 {
6480 }
6483 {
6490 }
6512 {
6517 }
6518 else
6520 OPTAB_DIRECT);
6523 }
6525 /* Expand an atomic clear operation.
6526 void _atomic_clear (BOOL *obj, enum memmodel)
6527 EXP is the call expression. */
6529 static rtx
6531 {
6532 machine_mode mode;
6541 {
6542 source_location loc
6547 }
6549 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6550 Failing that, a store is issued by __atomic_store. The only way this can
6551 fail is if the bool type is larger than a word size. Unlikely, but
6552 handle it anyway for completeness. Assume a single threaded model since
6553 there is no atomic support in this case, and no barriers are required. */
6558 }
6560 /* Expand an atomic test_and_set operation.
6561 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6562 EXP is the call expression. */
6564 static rtx
6566 {
6567 rtx mem;
6569 machine_mode mode;
6576 }
6579 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6580 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6582 static tree
6584 {
6586 machine_mode mode;
6592 /* We need a corresponding integer mode for the access to be lock-free. */
6600 {
6603 /* Either this argument is null, or it's a fake pointer encoding
6604 the alignment of the object. */
6610 else
6612 }
6613 else
6614 {
6617 /* This function is usually invoked and folded immediately by the front
6618 end before anything else has a chance to look at it. The pointer
6619 parameter at this point is usually cast to a void *, so check for that
6620 and look past the cast. */
6630 /* Get the underlying type of the object. */
6633 }
6635 /* If the object has smaller alignment, the lock free routines cannot
6636 be used. */
6640 /* Check if a compare_and_swap pattern exists for the mode which represents
6641 the required size. The pattern is not allowed to fail, so the existence
6642 of the pattern indicates support is present. Also require that an
6643 atomic load exists for the required size. */
6646 else
6648 }
6650 /* Return true if the parameters to call EXP represent an object which will
6651 always generate lock free instructions. The first argument represents the
6652 size of the object, and the second parameter is a pointer to the object
6653 itself. If NULL is passed for the object, then the result is based on
6654 typical alignment for an object of the specified size. Otherwise return
6655 false. */
6657 static rtx
6659 {
6660 tree size;
6665 {
6668 }
6674 }
6676 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6677 is lock free on this architecture. */
6679 static tree
6681 {
6685 /* If it isn't always lock free, don't generate a result. */
6690 }
6692 /* Return true if the parameters to call EXP represent an object which will
6693 always generate lock free instructions. The first argument represents the
6694 size of the object, and the second parameter is a pointer to the object
6695 itself. If NULL is passed for the object, then the result is based on
6696 typical alignment for an object of the specified size. Otherwise return
6697 NULL*/
6699 static rtx
6701 {
6702 tree size;
6707 {
6710 }
6715 /* If the value is known at compile time, return the RTX for it. */
6721 }
6723 /* Expand the __atomic_thread_fence intrinsic:
6724 void __atomic_thread_fence (enum memmodel)
6725 EXP is the CALL_EXPR. */
6727 static void
6729 {
6732 }
6734 /* Expand the __atomic_signal_fence intrinsic:
6735 void __atomic_signal_fence (enum memmodel)
6736 EXP is the CALL_EXPR. */
6738 static void
6740 {
6743 }
6745 /* Expand the __sync_synchronize intrinsic. */
6747 static void
6749 {
6751 }
6753 static rtx
6755 {
6761 {
6763 /* If the target is not sutitable then create a new target. */
6771 }
6774 }
6776 static void
6778 {
6784 {
6791 }
6793 }
6795 \f
6796 /* Emit code to restore the current value of stack. */
6798 static void
6800 {
6812 }
6814 /* Emit code to save the current value of stack. */
6816 static rtx
6818 {
6823 }
6825 /* Emit code to get the openacc gang, worker or vector id or size. */
6827 static rtx
6829 {
6831 rtx fallback_retval;
6834 {
6847 }
6850 {
6853 }
6857 {
6860 }
6864 {
6872 }
6881 {
6884 }
6892 }
6894 /* Expand a string compare operation using a sequence of char comparison
6895 to get rid of the calling overhead, with result going to TARGET if
6896 that's convenient.
6898 VAR_STR is the variable string source;
6899 CONST_STR is the constant string source;
6900 LENGTH is the number of chars to compare;
6901 CONST_STR_N indicates which source string is the constant string;
6902 IS_MEMCMP indicates whether it's a memcmp or strcmp.
6904 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
6906 target = (int) (unsigned char) var_str[0]
6907 - (int) (unsigned char) const_str[0];
6908 if (target != 0)
6909 goto ne_label;
6910 ...
6911 target = (int) (unsigned char) var_str[length - 2]
6912 - (int) (unsigned char) const_str[length - 2];
6913 if (target != 0)
6914 goto ne_label;
6915 target = (int) (unsigned char) var_str[length - 1]
6916 - (int) (unsigned char) const_str[length - 1];
6917 ne_label:
6918 */
6920 static rtx
6924 {
6926 rtx var_rtx_array
6933 scalar_int_mode unit_mode
6939 {
6940 var_rtx
6954 }
6962 }
6964 /* Inline expansion a call to str(n)cmp, with result going to
6965 TARGET if that's convenient.
6966 If the call is not been inlined, return NULL_RTX. */
6967 static rtx
6969 {
6975 /* Do NOT apply this inlining expansion when optimizing for size or
6976 optimization level below 2. */
6984 /* On a target where the type of the call (int) has same or narrower presicion
6985 than unsigned char, give up the inlining expansion. */
7001 /* If neither strings is constant string, the call is not qualify. */
7005 /* For strncmp, if the length is not a const, not qualify. */
7016 else
7025 /* If the length of the comparision is larger than the threshold,
7026 do nothing. */
7033 /* Now, start inline expansion the call. */
7037 }
7039 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
7040 represents the size of the first argument to that call, or VOIDmode
7041 if the argument is a pointer. IGNORE will be true if the result
7042 isn't used. */
7043 static rtx
7046 {
7053 {
7056 }
7060 /* An optional second argument can be used as a failsafe value on
7061 some machines. If it isn't present, then the failsafe value is
7062 assumed to be 0. */
7064 {
7067 }
7068 else
7071 /* If the result isn't used, the behavior is undefined. It would be
7072 nice to emit a warning here, but path splitting means this might
7073 happen with legitimate code. So simply drop the builtin
7074 expansion in that case; we've handled any side-effects above. */
7078 /* If we don't have a suitable target, create one to hold the result. */
7086 }
7088 /* Expand an expression EXP that calls a built-in function,
7089 with result going to TARGET if that's convenient
7090 (and in mode MODE if that's convenient).
7091 SUBTARGET may be used as the target for computing one of EXP's operands.
7092 IGNORE is nonzero if the value is to be ignored. */
7094 rtx
7097 {
7106 /* When ASan is enabled, we don't want to expand some memory/string
7107 builtins and rely on libsanitizer's hooks. This allows us to avoid
7108 redundant checks and be sure, that possible overflow will be detected
7109 by ASan. */
7114 /* When not optimizing, generate calls to library functions for a certain
7115 set of builtins. */
7129 /* The built-in function expanders test for target == const0_rtx
7130 to determine whether the function's result will be ignored. */
7134 /* If the result of a pure or const built-in function is ignored, and
7135 none of its arguments are volatile, we can avoid expanding the
7136 built-in call and just evaluate the arguments for side-effects. */
7140 {
7142 tree arg;
7143 call_expr_arg_iterator iter;
7147 {
7150 }
7153 {
7157 }
7158 }
7161 {
7179 /* Just do a normal library call if we were unable to fold
7180 the values. */
7257 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7258 FUNCTION with a copy of the parameters described by
7259 ARGUMENTS, and ARGSIZE. It returns a block of memory
7260 allocated on the stack into which is stored all the registers
7261 that might possibly be used for returning the result of a
7262 function. ARGUMENTS is the value returned by
7263 __builtin_apply_args. ARGSIZE is the number of bytes of
7264 arguments that must be copied. ??? How should this value be
7265 computed? We'll also need a safe worst case value for varargs
7266 functions. */
7273 else
7274 {
7282 }
7284 /* __builtin_return (RESULT) causes the function to return the
7285 value described by RESULT. RESULT is address of the block of
7286 memory returned by __builtin_apply. */
7296 /* All valid uses of __builtin_va_arg_pack () are removed during
7297 inlining. */
7302 /* All valid uses of __builtin_va_arg_pack_len () are removed during
7303 inlining. */
7307 /* Return the address of the first anonymous stack arg. */
7329 /* Returns the address of the area where the structure is returned.
7330 0 otherwise. */
7336 else
7339 CASE_BUILT_IN_ALLOCA:
7489 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7490 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7491 when changing it to a strcmp call. */
7497 /* Change this call back to a BUILT_IN_STRCMP. */
7501 /* Delete the last parameter. */
7508 /* FALLTHROUGH */
7516 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7517 back to a BUILT_IN_STRNCMP. */
7523 /* Change it back to a BUILT_IN_STRNCMP. */
7526 /* FALLTHROUGH */
7541 {
7544 }
7548 /* This should have been lowered to the builtins below. */
7552 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7553 and the receiver label. */
7555 {
7561 /* This is copied from the handling of non-local gotos. */
7563 nonlocal_goto_handler_labels
7565 nonlocal_goto_handler_labels);
7566 /* ??? Do not let expand_label treat us as such since we would
7567 not want to be both on the list of non-local labels and on
7568 the list of forced labels. */
7571 }
7575 /* __builtin_setjmp_receiver is passed the receiver label. */
7577 {
7583 }
7586 /* __builtin_longjmp is passed a pointer to an array of five words.
7587 It's similar to the C library longjmp function but works with
7588 __builtin_setjmp above. */
7591 {
7597 {
7600 }
7604 }
7613 /* This updates the setjmp buffer that is its argument with the value
7614 of the current stack pointer. */
7617 {
7618 rtx buf_addr
7623 }
7643 /* Various hooks for the DWARF 2 __throw routine. */
7649 #ifdef DWARF2_UNWIND_INFO
7655 #endif
7857 mode = get_builtin_sync_mode
7869 mode = get_builtin_sync_mode
7916 {
7920 mode =
7926 /* If this is turned into an external library call, the weak parameter
7927 must be dropped to match the expected parameter list. */
7932 /* Skip the boolean weak parameter. */
7937 }
7966 {
7976 }
7982 {
7992 }
7998 {
8008 }
8014 {
8024 }
8030 {
8040 }
8046 {
8056 }
8193 /* Do library call, if we failed to expand the builtin when
8194 folding. */
8214 }
8216 /* The switch statement above can drop through to cause the function
8217 to be called normally. */
8219 }
8221 /* Determine whether a tree node represents a call to a built-in
8222 function. If the tree T is a call to a built-in function with
8223 the right number of arguments of the appropriate types, return
8224 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8225 Otherwise the return value is END_BUILTINS. */
8227 enum built_in_function
8229 {
8232 const_call_expr_arg_iterator iter;
8244 {
8245 /* If a function doesn't take a variable number of arguments,
8246 the last element in the list will have type `void'. */
8249 {
8253 }
8262 {
8265 }
8267 {
8270 }
8272 {
8275 }
8277 {
8280 }
8281 else
8283 }
8285 /* Variable-length argument list. */
8287 }
8289 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
8290 evaluate to a constant. */
8292 static tree
8294 {
8295 /* We return 1 for a numeric type that's known to be a constant
8296 value at compile-time or for an aggregate type that's a
8297 literal constant. */
8300 /* If we know this is a constant, emit the constant of one. */
8306 {
8313 }
8315 /* If this expression has side effects, show we don't know it to be a
8316 constant. Likewise if it's a pointer or aggregate type since in
8317 those case we only want literals, since those are only optimized
8318 when generating RTL, not later.
8319 And finally, if we are compiling an initializer, not code, we
8320 need to return a definite result now; there's not going to be any
8321 more optimization done. */
8326 || folding_initializer
8331 }
8333 /* Create builtin_expect or builtin_expect_with_probability
8334 with PRED and EXPECTED as its arguments and return it as a truthvalue.
8335 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
8336 builtin_expect_with_probability instead uses third argument as PROBABILITY
8337 value. */
8339 static tree
8342 {
8357 else
8359 predictor);
8363 }
8365 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
8366 NULL_TREE if no simplification is possible. */
8368 tree
8370 tree arg3)
8371 {
8375 /* Distribute the expected value over short-circuiting operators.
8376 See through the cast from truthvalue_type_node to long. */
8383 /* If this is a builtin_expect within a builtin_expect keep the
8384 inner one. See through a comparison against a constant. It
8385 might have been added to create a thruthvalue. */
8401 {
8411 }
8413 /* If the argument isn't invariant then there's nothing else we can do. */
8417 /* If we expect that a comparison against the argument will fold to
8418 a constant return the constant. In practice, this means a true
8419 constant or the address of a non-weak symbol. */
8423 {
8424 do
8425 {
8427 }
8432 }
8434 /* Otherwise, ARG0 already has the proper type for the return value. */
8436 }
8438 /* Fold a call to __builtin_classify_type with argument ARG. */
8440 static tree
8442 {
8447 }
8449 /* Fold a call to __builtin_strlen with argument ARG. */
8451 static tree
8453 {
8456 else
8457 {
8468 {
8474 }
8477 }
8478 }
8480 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8482 static tree
8484 {
8485 REAL_VALUE_TYPE real;
8487 /* __builtin_inff is intended to be usable to define INFINITY on all
8488 targets. If an infinity is not available, INFINITY expands "to a
8489 positive constant of type float that overflows at translation
8490 time", footnote "In this case, using INFINITY will violate the
8491 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8492 Thus we pedwarn to ensure this constraint violation is
8493 diagnosed. */
8499 }
8501 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8502 NULL_TREE if no simplification can be made. */
8504 static tree
8507 {
8508 tree type;
8518 /* Calculate the result when the argument is a constant. */
8523 /* Canonicalize sincos to cexpi. */
8525 {
8528 }
8530 {
8537 }
8549 }
8551 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8552 Return NULL_TREE if no simplification can be made. */
8554 static tree
8556 {
8562 /* If the LEN parameter is zero, return zero. */
8567 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8571 /* If len parameter is one, return an expression corresponding to
8572 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8574 {
8576 tree cst_uchar_ptr_node
8579 tree ind1
8583 cst_uchar_ptr_node,
8584 arg1)));
8585 tree ind2
8589 cst_uchar_ptr_node,
8590 arg2)));
8592 }
8595 }
8597 /* Fold a call to builtin isascii with argument ARG. */
8599 static tree
8601 {
8604 else
8605 {
8606 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8612 }
8613 }
8615 /* Fold a call to builtin toascii with argument ARG. */
8617 static tree
8619 {
8623 /* Transform toascii(c) -> (c & 0x7f). */
8626 }
8628 /* Fold a call to builtin isdigit with argument ARG. */
8630 static tree
8632 {
8635 else
8636 {
8637 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8638 /* According to the C standard, isdigit is unaffected by locale.
8639 However, it definitely is affected by the target character set. */
8640 unsigned HOST_WIDE_INT target_digit0
8651 }
8652 }
8654 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8656 static tree
8658 {
8664 }
8666 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8668 static tree
8670 {
8676 }
8678 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8680 static tree
8682 {
8685 {
8689 {
8694 }
8695 }
8698 }
8700 /* Fold a call to builtin frexp, we can assume the base is 2. */
8702 static tree
8704 {
8715 /* Proceed if a valid pointer type was passed in. */
8717 {
8722 {
8724 /* For +-0, return (*exp = 0, +-0). */
8730 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8733 {
8734 /* Since the frexp function always expects base 2, and in
8735 GCC normalized significands are already in the range
8736 [0.5, 1.0), we have exactly what frexp wants. */
8741 }
8745 }
8747 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8751 }
8754 }
8756 /* Fold a call to builtin modf. */
8758 static tree
8760 {
8771 /* Proceed if a valid pointer type was passed in. */
8773 {
8778 {
8781 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8785 /* For +-Inf, return (*arg1 = arg0, +-0). */
8791 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8794 /* If the original number was negative and already
8795 integral, then the fractional part is -0.0. */
8799 }
8801 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8807 }
8810 }
8812 /* Given a location LOC, an interclass builtin function decl FNDECL
8813 and its single argument ARG, return an folded expression computing
8814 the same, or NULL_TREE if we either couldn't or didn't want to fold
8815 (the latter happen if there's an RTL instruction available). */
8817 static tree
8819 {
8820 machine_mode mode;
8832 /* If there is no optab, try generic code. */
8834 {
8835 tree result;
8838 {
8839 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8842 REAL_VALUE_TYPE r;
8846 {
8847 /* NaN and Inf are encoded in the high-order double value
8848 only. The low-order value is not significant. */
8852 }
8859 }
8862 {
8863 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8866 REAL_VALUE_TYPE r;
8870 {
8871 /* NaN and Inf are encoded in the high-order double value
8872 only. The low-order value is not significant. */
8876 }
8882 /*result = fold_build2_loc (loc, UNGT_EXPR,
8883 TREE_TYPE (TREE_TYPE (fndecl)),
8884 fold_build1_loc (loc, ABS_EXPR, type, arg),
8885 build_real (type, r));
8886 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8887 TREE_TYPE (TREE_TYPE (fndecl)),
8888 result);*/
8890 }
8892 {
8893 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8894 islessequal(fabs(x),DBL_MAX). */
8904 {
8905 /* Use double to test the normal range of IBM extended
8906 precision. Emin for IBM extended precision is
8907 different to emin for IEEE double, being 53 higher
8908 since the low double exponent is at least 53 lower
8909 than the high double exponent. */
8913 }
8925 {
8926 /* Testing the high end of the range is done just using
8927 the high double, using the same test as isfinite().
8928 For the subnormal end of the range we first test the
8929 high double, then if its magnitude is equal to the
8930 limit of 0x1p-969, we test whether the low double is
8931 non-zero and opposite sign to the high double. */
8947 integer_type_node,
8953 }
8954 else
8955 {
8956 tree const isge_fn
8959 }
8963 }
8966 }
8969 }
8971 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8972 ARG is the argument for the call. */
8974 static tree
8976 {
8983 {
8991 {
8992 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8993 /* In a boolean context, GCC will fold the inner COND_EXPR to
8994 1. So e.g. "if (isinf_sign(x))" would be folded to just
8995 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9003 {
9016 integer_zero_node);
9017 }
9020 }
9033 {
9036 {
9037 /* NaN and Inf are encoded in the high-order double value
9038 only. The low-order value is not significant. */
9040 }
9041 }
9047 }
9048 }
9050 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9051 This builtin will generate code to return the appropriate floating
9052 point classification depending on the value of the floating point
9053 number passed in. The possible return values must be supplied as
9054 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9055 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9056 one floating point argument which is "type generic". */
9058 static tree
9060 {
9063 machine_mode mode;
9064 REAL_VALUE_TYPE r;
9067 /* Verify the required arguments in the original call. */
9087 /* fpclassify(x) ->
9088 isnan(x) ? FP_NAN :
9089 (fabs(x) == Inf ? FP_INFINITE :
9090 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9091 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9105 {
9111 }
9114 {
9117 }
9120 }
9122 /* Fold a call to an unordered comparison function such as
9123 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9124 being called and ARG0 and ARG1 are the arguments for the call.
9125 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9126 the opposite of the desired result. UNORDERED_CODE is used
9127 for modes that can hold NaNs and ORDERED_CODE is used for
9128 the rest. */
9130 static tree
9134 {
9148 /* Choose the wider of two real types. */
9160 {
9164 }
9169 }
9171 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9172 arithmetics if it can never overflow, or into internal functions that
9173 return both result of arithmetics and overflowed boolean flag in
9174 a complex integer result, or some other check for overflow.
9175 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9176 checking part of that. */
9178 static tree
9181 {
9183 /* The code of the expression corresponding to the type-generic
9184 built-in, or ERROR_MARK for the type-specific ones. */
9189 {
9192 /* FALLTHRU */
9195 /* FALLTHRU */
9206 /* FALLTHRU */
9209 /* FALLTHRU */
9220 /* FALLTHRU */
9223 /* FALLTHRU */
9234 }
9236 /* For the "generic" overloads, the first two arguments can have different
9237 types and the last argument determines the target type to use to check
9238 for overflow. The arguments of the other overloads all have the same
9239 type. */
9242 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
9243 arguments are constant, attempt to fold the built-in call into a constant
9244 expression indicating whether or not it detected an overflow. */
9248 /* Perform the computation in the target type and check for overflow. */
9252 arg2);
9266 tree store
9269 }
9271 /* Fold a call to __builtin_FILE to a constant string. */
9275 {
9277 {
9278 /* The documentation says this builtin is equivalent to the preprocessor
9279 __FILE__ macro so it appears appropriate to use the same file prefix
9280 mappings. */
9283 }
9286 }
9288 /* Fold a call to __builtin_FUNCTION to a constant string. */
9292 {
9299 }
9301 /* Fold a call to __builtin_LINE to an integer constant. */
9305 {
9307 }
9309 /* Fold a call to built-in function FNDECL with 0 arguments.
9310 This function returns NULL_TREE if no simplification was possible. */
9312 static tree
9314 {
9318 {
9344 }
9346 }
9348 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9349 This function returns NULL_TREE if no simplification was possible. */
9351 static tree
9353 {
9364 {
9366 {
9369 /* Gimplification will pull the CALL_EXPR for the builtin out of
9370 an if condition. When not optimizing, we'll not CSE it back.
9371 To avoid link error types of regressions, return false now. */
9376 }
9432 {
9437 }
9443 {
9448 }
9469 }
9473 }
9475 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9476 This function returns NULL_TREE if no simplification was possible. */
9478 static tree
9480 {
9492 {
9536 NOP_EXPR);
9538 /* We do the folding for va_start in the expander. */
9553 }
9555 }
9557 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9558 and ARG2.
9559 This function returns NULL_TREE if no simplification was possible. */
9561 static tree
9564 {
9578 {
9627 }
9629 }
9631 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9632 arguments. IGNORE is true if the result of the
9633 function call is ignored. This function returns NULL_TREE if no
9634 simplification was possible. */
9636 tree
9638 {
9642 {
9658 }
9660 {
9664 }
9666 }
9668 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9669 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9670 of arguments in ARGS to be omitted. OLDNARGS is the number of
9671 elements in ARGS. */
9673 static tree
9676 {
9681 {
9689 }
9690 else
9694 }
9696 /* Return true if FNDECL shouldn't be folded right now.
9697 If a built-in function has an inline attribute always_inline
9698 wrapper, defer folding it after always_inline functions have
9699 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9700 might not be performed. */
9702 bool
9704 {
9707 && cfun
9710 }
9712 /* A wrapper function for builtin folding that prevents warnings for
9713 "statement without effect" and the like, caused by removing the
9714 call node earlier than the warning is generated. */
9716 tree
9718 {
9722 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9723 yet. Defer folding until we see all the arguments
9724 (after inlining). */
9726 {
9729 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9730 instead last argument is __builtin_va_arg_pack (). Defer folding
9731 even in that case, until arguments are finalized. */
9733 {
9737 }
9745 else
9746 {
9751 }
9752 }
9754 }
9756 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9757 N arguments are passed in the array ARGARRAY. Return a folded
9758 expression or NULL_TREE if no simplification was possible. */
9760 tree
9762 tree fn,
9765 {
9772 {
9773 /* If last argument is __builtin_va_arg_pack (), arguments to this
9774 function are not finalized yet. Defer folding until they are. */
9776 {
9780 }
9785 else
9787 }
9790 }
9792 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9793 along with N new arguments specified as the "..." parameters. SKIP
9794 is the number of arguments in EXP to be omitted. This function is used
9795 to do varargs-to-varargs transformations. */
9797 static tree
9799 {
9801 tree t;
9809 }
9811 /* Validate a single argument ARG against a tree code CODE representing
9812 a type. Return true when argument is valid. */
9814 static bool
9816 {
9824 }
9826 /* This function validates the types of a function call argument list
9827 against a specified list of tree_codes. If the last specifier is a 0,
9828 that represents an ellipses, otherwise the last specifier must be a
9829 VOID_TYPE.
9831 This is the GIMPLE version of validate_arglist. Eventually we want to
9832 completely convert builtins.c to work from GIMPLEs and the tree based
9833 validate_arglist will then be removed. */
9835 bool
9837 {
9841 const_tree arg;
9847 do
9848 {
9851 {
9853 /* This signifies an ellipses, any further arguments are all ok. */
9857 /* This signifies an endlink, if no arguments remain, return
9858 true, otherwise return false. */
9862 /* If no parameters remain or the parameter's code does not
9863 match the specified code, return false. Otherwise continue
9864 checking any remaining arguments. */
9869 }
9870 }
9873 /* We need gotos here since we can only have one VA_CLOSE in a
9874 function. */
9875 end: ;
9879 }
9881 /* Default target-specific builtin expander that does nothing. */
9883 rtx
9885 rtx target ATTRIBUTE_UNUSED,
9886 rtx subtarget ATTRIBUTE_UNUSED,
9887 machine_mode mode ATTRIBUTE_UNUSED,
9889 {
9891 }
9893 /* Returns true is EXP represents data that would potentially reside
9894 in a readonly section. */
9896 bool
9898 {
9908 /* Make sure we call decl_readonly_section only for trees it
9909 can handle (since it returns true for everything it doesn't
9910 understand). */
9915 else
9917 }
9919 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9920 to the call, and TYPE is its return type.
9922 Return NULL_TREE if no simplification was possible, otherwise return the
9923 simplified form of the call as a tree.
9925 The simplified form may be a constant or other expression which
9926 computes the same value, but in a more efficient manner (including
9927 calls to other builtin functions).
9929 The call may contain arguments which need to be evaluated, but
9930 which are not useful to determine the result of the call. In
9931 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9932 COMPOUND_EXPR will be an argument which must be evaluated.
9933 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9934 COMPOUND_EXPR in the chain will contain the tree for the simplified
9935 form of the builtin function call. */
9937 static tree
9939 {
9943 else
9944 {
9945 tree fn;
9954 {
9956 tree tem;
9961 /* Return an offset into the constant string argument. */
9964 }
9967 /* strpbrk(x, "") == NULL.
9968 Evaluate and ignore s1 in case it had side-effects. */
9978 /* New argument list transforming strpbrk(s1, s2) to
9979 strchr(s1, s2[0]). */
9982 }
9983 }
9985 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9986 to the call.
9988 Return NULL_TREE if no simplification was possible, otherwise return the
9989 simplified form of the call as a tree.
9991 The simplified form may be a constant or other expression which
9992 computes the same value, but in a more efficient manner (including
9993 calls to other builtin functions).
9995 The call may contain arguments which need to be evaluated, but
9996 which are not useful to determine the result of the call. In
9997 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9998 COMPOUND_EXPR will be an argument which must be evaluated.
9999 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10000 COMPOUND_EXPR in the chain will contain the tree for the simplified
10001 form of the builtin function call. */
10003 static tree
10005 {
10009 else
10010 {
10013 /* If either argument is "", return NULL_TREE. */
10015 /* Evaluate and ignore both arguments in case either one has
10016 side-effects. */
10020 }
10021 }
10023 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
10024 to the call.
10026 Return NULL_TREE if no simplification was possible, otherwise return the
10027 simplified form of the call as a tree.
10029 The simplified form may be a constant or other expression which
10030 computes the same value, but in a more efficient manner (including
10031 calls to other builtin functions).
10033 The call may contain arguments which need to be evaluated, but
10034 which are not useful to determine the result of the call. In
10035 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10036 COMPOUND_EXPR will be an argument which must be evaluated.
10037 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10038 COMPOUND_EXPR in the chain will contain the tree for the simplified
10039 form of the builtin function call. */
10041 static tree
10043 {
10047 else
10048 {
10049 /* If the first argument is "", return NULL_TREE. */
10052 {
10053 /* Evaluate and ignore argument s2 in case it has
10054 side-effects. */
10057 }
10059 /* If the second argument is "", return __builtin_strlen(s1). */
10062 {
10065 /* If the replacement _DECL isn't initialized, don't do the
10066 transformation. */
10071 }
10073 }
10074 }
10076 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
10077 produced. False otherwise. This is done so that we don't output the error
10078 or warning twice or three times. */
10080 bool
10082 {
10085 tree arg;
10086 /* There is good chance the current input_location points inside the
10087 definition of the va_start macro (perhaps on the token for
10088 builtin) in a system header, so warnings will not be emitted.
10089 Use the location in real source code. */
10090 source_location current_location =
10092 NULL);
10095 {
10098 }
10101 {
10103 {
10106 }
10108 }
10109 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
10110 when we checked the arguments and if needed issued a warning. */
10111 else
10112 {
10114 {
10115 /* Evidently an out of date version of <stdarg.h>; can't validate
10116 va_start's second argument, but can still work as intended. */
10118 OPT_Wvarargs,
10121 }
10123 {
10126 }
10128 }
10133 /* We destructively modify the call to be __builtin_va_start (ap, 0)
10134 or __builtin_next_arg (0) the first time we see it, after checking
10135 the arguments and if needed issuing a warning. */
10137 {
10140 /* Strip off all nops for the sake of the comparison. This
10141 is not quite the same as STRIP_NOPS. It does more.
10142 We must also strip off INDIRECT_EXPR for C++ reference
10143 parameters. */
10148 {
10149 /* FIXME: Sometimes with the tree optimizers we can get the
10150 not the last argument even though the user used the last
10151 argument. We just warn and set the arg to be the last
10152 argument so that we will get wrong-code because of
10153 it. */
10155 OPT_Wvarargs,
10157 }
10159 /* Undefined by C99 7.15.1.4p4 (va_start):
10160 "If the parameter parmN is declared with the register storage
10161 class, with a function or array type, or with a type that is
10162 not compatible with the type that results after application of
10163 the default argument promotions, the behavior is undefined."
10164 */
10166 {
10168 OPT_Wvarargs,
10169 "undefined behavior when second parameter of "
10171 }
10173 /* We want to verify the second parameter just once before the tree
10174 optimizers are run and then avoid keeping it in the tree,
10175 as otherwise we could warn even for correct code like:
10176 void foo (int i, ...)
10177 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
10180 else
10182 }
10184 }
10187 /* Expand a call EXP to __builtin_object_size. */
10189 static rtx
10191 {
10192 tree ost;
10197 {
10202 }
10210 {
10215 }
10220 }
10222 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10223 FCODE is the BUILT_IN_* to use.
10224 Return NULL_RTX if we failed; the caller should emit a normal call,
10225 otherwise try to get the result in TARGET, if convenient (and in
10226 mode MODE if that's convenient). */
10228 static rtx
10231 {
10233 POINTER_TYPE,
10234 fcode == BUILT_IN_MEMSET_CHK
10251 {
10252 /* Avoid transforming the checking call to an ordinary one when
10253 an overflow has been detected or when the call couldn't be
10254 validated because the size is not constant. */
10259 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10260 mem{cpy,pcpy,move,set} is available. */
10262 {
10277 }
10286 }
10289 else
10290 {
10293 /* If DEST is not a pointer type, call the normal function. */
10297 /* If SRC and DEST are the same (and not volatile), do nothing. */
10299 {
10300 tree expr;
10303 {
10304 /* Evaluate and ignore LEN in case it has side-effects. */
10307 }
10311 }
10313 /* __memmove_chk special case. */
10315 {
10321 /* If src is categorized for a readonly section we can use
10322 normal __memcpy_chk. */
10324 {
10333 }
10334 }
10336 }
10337 }
10339 /* Emit warning if a buffer overflow is detected at compile time. */
10341 static void
10343 {
10344 /* The source string. */
10346 /* The size of the destination object. */
10348 /* The string that is being concatenated with (as in __strcat_chk)
10349 or null if it isn't. */
10351 /* The maximum length of the source sequence in a bounded operation
10352 (such as __strncat_chk) or null if the operation isn't bounded
10353 (such as __strcat_chk). */
10355 /* The exact size of the access (such as in __strncpy_chk). */
10359 {
10367 /* For __strcat_chk the warning will be emitted only if overflowing
10368 by at least strlen (dest) + 1 bytes. */
10395 }
10398 {
10399 /* Check __strncat_chk. There is no way to determine the length
10400 of the string to which the source string is being appended so
10401 just warn when the length of the source string is not known. */
10404 }
10406 /* The destination argument is the first one for all built-ins above. */
10410 }
10412 /* Emit warning if a buffer overflow is detected at compile time
10413 in __sprintf_chk/__vsprintf_chk calls. */
10415 static void
10417 {
10422 /* Verify the required arguments in the original call. */
10432 /* Check whether the format is a literal string constant. */
10440 /* If the format doesn't contain % args or %%, we know its size. */
10443 /* If the format is "%s" and first ... argument is a string literal,
10444 we know it too. */
10447 {
10448 tree arg;
10459 }
10460 else
10463 /* Add one for the terminating nul. */
10468 }
10470 /* Emit warning if a free is called with address of a variable. */
10472 static void
10474 {
10488 else
10491 }
10493 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10494 if possible. */
10496 static tree
10498 {
10515 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10516 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10517 and (size_t) 0 for types 2 and 3. */
10522 {
10526 }
10528 {
10529 /* If object size is not known yet, delay folding until
10530 later. Maybe subsequent passes will help determining
10531 it. */
10535 }
10538 }
10540 /* Builtins with folding operations that operate on "..." arguments
10541 need special handling; we need to store the arguments in a convenient
10542 data structure before attempting any folding. Fortunately there are
10543 only a few builtins that fall into this category. FNDECL is the
10544 function, EXP is the CALL_EXPR for the call. */
10546 static tree
10548 {
10553 {
10560 }
10562 {
10567 }
10569 }
10571 /* Initialize format string characters in the target charset. */
10573 bool
10575 {
10578 {
10601 }
10603 }
10605 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10606 and no overflow/underflow occurred. INEXACT is true if M was not
10607 exactly calculated. TYPE is the tree type for the result. This
10608 function assumes that you cleared the MPFR flags and then
10609 calculated M to see if anything subsequently set a flag prior to
10610 entering this function. Return NULL_TREE if any checks fail. */
10612 static tree
10614 {
10615 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10616 overflow/underflow occurred. If -frounding-math, proceed iff the
10617 result of calling FUNC was exact. */
10620 {
10621 REAL_VALUE_TYPE rr;
10624 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10625 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10626 but the mpft_t is not, then we underflowed in the
10627 conversion. */
10630 {
10631 REAL_VALUE_TYPE rmode;
10634 /* Proceed iff the specified mode can hold the value. */
10637 }
10638 }
10640 }
10642 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10643 number and no overflow/underflow occurred. INEXACT is true if M
10644 was not exactly calculated. TYPE is the tree type for the result.
10645 This function assumes that you cleared the MPFR flags and then
10646 calculated M to see if anything subsequently set a flag prior to
10647 entering this function. Return NULL_TREE if any checks fail, if
10648 FORCE_CONVERT is true, then bypass the checks. */
10650 static tree
10652 {
10653 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10654 overflow/underflow occurred. If -frounding-math, proceed iff the
10655 result of calling FUNC was exact. */
10660 {
10665 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10666 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10667 but the mpft_t is not, then we underflowed in the
10668 conversion. */
10673 {
10678 /* Proceed iff the specified mode can hold the value. */
10684 }
10685 }
10687 }
10689 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10690 the pointer *(ARG_QUO) and return the result. The type is taken
10691 from the type of ARG0 and is used for setting the precision of the
10692 calculation and results. */
10694 static tree
10696 {
10703 /* To proceed, MPFR must exactly represent the target floating point
10704 format, which only happens when the target base equals two. */
10708 {
10713 {
10717 tree result_rem;
10726 /* Remquo is independent of the rounding mode, so pass
10727 inexact=0 to do_mpfr_ckconv(). */
10731 {
10732 /* MPFR calculates quo in the host's long so it may
10733 return more bits in quo than the target int can hold
10734 if sizeof(host long) > sizeof(target int). This can
10735 happen even for native compilers in LP64 mode. In
10736 these cases, modulo the quo value with the largest
10737 number that the target int can hold while leaving one
10738 bit for the sign. */
10742 /* Dereference the quo pointer argument. */
10744 /* Proceed iff a valid pointer type was passed in. */
10746 {
10747 /* Set the value. */
10748 tree result_quo
10751 integer_quo));
10753 /* Combine the quo assignment with the rem. */
10756 }
10757 }
10758 }
10759 }
10761 }
10763 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10764 resulting value as a tree with type TYPE. The mpfr precision is
10765 set to the precision of TYPE. We assume that this mpfr function
10766 returns zero if the result could be calculated exactly within the
10767 requested precision. In addition, the integer pointer represented
10768 by ARG_SG will be dereferenced and set to the appropriate signgam
10769 (-1,1) value. */
10771 static tree
10773 {
10778 /* To proceed, MPFR must exactly represent the target floating point
10779 format, which only happens when the target base equals two. Also
10780 verify ARG is a constant and that ARG_SG is an int pointer. */
10785 {
10788 /* In addition to NaN and Inf, the argument cannot be zero or a
10789 negative integer. */
10793 {
10798 mpfr_t m;
10799 tree result_lg;
10808 {
10809 tree result_sg;
10811 /* Dereference the arg_sg pointer argument. */
10813 /* Assign the signgam value into *arg_sg. */
10818 /* Combine the signgam assignment with the lgamma result. */
10821 }
10822 }
10823 }
10826 }
10828 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10829 mpc function FUNC on it and return the resulting value as a tree
10830 with type TYPE. The mpfr precision is set to the precision of
10831 TYPE. We assume that function FUNC returns zero if the result
10832 could be calculated exactly within the requested precision. If
10833 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10834 in the arguments and/or results. */
10836 tree
10839 {
10845 /* To proceed, MPFR must exactly represent the target floating point
10846 format, which only happens when the target base equals two. */
10852 {
10861 {
10881 }
10882 }
10885 }
10887 /* A wrapper function for builtin folding that prevents warnings for
10888 "statement without effect" and the like, caused by removing the
10889 call node earlier than the warning is generated. */
10891 tree
10893 {
10899 {
10908 {
10910 }
10911 else
10912 {
10915 {
10916 /* Propagate location information from original call to
10917 expansion of builtin. Otherwise things like
10918 maybe_emit_chk_warning, that operate on the expansion
10919 of a builtin, will use the wrong location information. */
10921 {
10929 }
10931 }
10932 }
10933 }
10935 }
10937 /* Look up the function in builtin_decl that corresponds to DECL
10938 and set ASMSPEC as its user assembler name. DECL must be a
10939 function decl that declares a builtin. */
10941 void
10943 {
10952 {
10956 }
10957 }
10959 /* Return true if DECL is a builtin that expands to a constant or similarly
10960 simple code. */
10961 bool
10963 {
10966 {
10967 /* Builtins that expand to constants. */
10972 /* Simple register moves or loads from stack. */
10983 /* Exception state returns or moves registers around. */
10991 }
10994 }
10996 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10997 most probably expanded inline into reasonably simple code. This is a
10998 superset of is_simple_builtin. */
10999 bool
11001 {
11008 {
11010 CASE_BUILT_IN_ALLOCA:
11076 }
11079 }
11081 /* Return true if T is a constant and the value cast to a target char
11082 can be represented by a host char.
11083 Store the casted char constant in *P if so. */
11085 bool
11087 {
11093 }
11095 /* Return the maximum object size. */
11097 tree
11099 {
11100 /* To do: Make this a configurable parameter. */
11102 }