| blob | 650de0d9aca71388b7a5cb5cc54bfda341956c21 |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2017 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* Legacy warning! Please add no further builtin simplifications here
21 (apart from pure constant folding) - builtin simplifications should go
22 to match.pd or gimple-fold.c instead. */
75 #if SWITCHABLE_TARGET
77 #endif
79 /* Define the names of the builtin function types and codes. */
83 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
85 {
87 };
89 /* Setup an array of builtin_info_type, make sure each element decl is
90 initialized to NULL_TREE. */
93 /* Non-zero if __builtin_constant_p should be folded right away. */
195 /* Return true if NAME starts with __builtin_ or __sync_. */
197 static bool
199 {
211 }
214 /* Return true if DECL is a function symbol representing a built-in. */
216 bool
218 {
220 }
222 /* Return true if NODE should be considered for inline expansion regardless
223 of the optimization level. This means whenever a function is invoked with
224 its "internal" name, which normally contains the prefix "__builtin". */
226 bool
228 {
229 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
230 we want the name used to call the function, not the name it
231 will have. */
234 }
236 /* Compute values M and N such that M divides (address of EXP - N) and such
237 that N < M. If these numbers can be determined, store M in alignp and N in
238 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
239 *alignp and any bit-offset to *bitposp.
241 Note that the address (and thus the alignment) computed here is based
242 on the address to which a symbol resolves, whereas DECL_ALIGN is based
243 on the address at which an object is actually located. These two
244 addresses are not always the same. For example, on ARM targets,
245 the address &foo of a Thumb function foo() has the lowest bit set,
246 whereas foo() itself starts on an even address.
248 If ADDR_P is true we are taking the address of the memory reference EXP
249 and thus cannot rely on the access taking place. */
251 static bool
254 {
256 tree offset;
257 machine_mode mode;
262 /* Get the innermost object and the constant (bitpos) and possibly
263 variable (offset) offset of the access. */
267 /* Extract alignment information from the innermost object and
268 possibly adjust bitpos and offset. */
270 {
271 /* Function addresses can encode extra information besides their
272 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
273 allows the low bit to be used as a virtual bit, we know
274 that the address itself must be at least 2-byte aligned. */
277 }
279 ;
281 {
282 /* The alignment of a CONST_DECL is determined by its initializer. */
289 }
291 {
294 }
298 {
304 /* If the address is explicitely aligned, handle that. */
307 {
312 }
314 known_alignment
318 /* Re-apply explicit alignment to the bitpos. */
321 /* The alignment of the pointer operand in a TARGET_MEM_REF
322 has to take the variable offset parts into account. */
324 {
326 {
331 }
335 }
337 /* When EXP is an actual memory reference then we can use
338 TYPE_ALIGN of a pointer indirection to derive alignment.
339 Do so only if get_pointer_alignment_1 did not reveal absolute
340 alignment knowledge and if using that alignment would
341 improve the situation. */
347 else
348 {
349 /* Else adjust bitpos accordingly. */
354 }
355 }
357 {
358 /* STRING_CST are the only constant objects we allow to be not
359 wrapped inside a CONST_DECL. */
365 }
367 /* If there is a non-constant offset part extract the maximum
368 alignment that can prevail. */
370 {
373 {
377 }
378 }
383 }
385 /* For a memory reference expression EXP compute values M and N such that M
386 divides (&EXP - N) and such that N < M. If these numbers can be determined,
387 store M in alignp and N in *BITPOSP and return true. Otherwise return false
388 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
390 bool
393 {
395 }
397 /* Return the alignment in bits of EXP, an object. */
399 unsigned int
401 {
407 /* align and bitpos now specify known low bits of the pointer.
408 ptr & (align - 1) == bitpos. */
413 }
415 /* For a pointer valued expression EXP compute values M and N such that M
416 divides (EXP - N) and such that N < M. If these numbers can be determined,
417 store M in alignp and N in *BITPOSP and return true. Return false if
418 the results are just a conservative approximation.
420 If EXP is not a pointer, false is returned too. */
422 bool
425 {
432 {
439 else
440 {
443 {
447 }
448 }
452 }
455 {
460 {
463 /* Make sure to return a sensible alignment when the multiplication
464 by BITS_PER_UNIT overflowed. */
467 /* We cannot really tell whether this result is an approximation. */
469 }
470 else
471 {
475 }
476 }
478 {
483 }
488 }
490 /* Return the alignment in bits of EXP, a pointer valued expression.
491 The alignment returned is, by default, the alignment of the thing that
492 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
494 Otherwise, look at the expression to see if we can do better, i.e., if the
495 expression is actually pointing at an object whose alignment is tighter. */
497 unsigned int
499 {
505 /* align and bitpos now specify known low bits of the pointer.
506 ptr & (align - 1) == bitpos. */
512 }
514 /* Return the number of non-zero elements in the sequence
515 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
516 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
518 static unsigned
520 {
526 {
527 /* Optimize the common case of plain char. */
529 {
533 }
534 }
535 else
536 {
538 {
542 }
543 }
545 }
547 /* Compute the length of a null-terminated character string or wide
548 character string handling character sizes of 1, 2, and 4 bytes.
549 TREE_STRING_LENGTH is not the right way because it evaluates to
550 the size of the character array in bytes (as opposed to characters)
551 and because it can contain a zero byte in the middle.
553 ONLY_VALUE should be nonzero if the result is not going to be emitted
554 into the instruction stream and zero if it is going to be expanded.
555 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
556 is returned, otherwise NULL, since
557 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
558 evaluate the side-effects.
560 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
561 accesses. Note that this implies the result is not going to be emitted
562 into the instruction stream.
564 The value returned is of type `ssizetype'.
566 Unfortunately, string_constant can't access the values of const char
567 arrays with initializers, so neither can we do so here. */
569 tree
571 {
575 {
582 }
590 /* Offset from the beginning of the string in bytes. */
591 tree byteoff;
596 /* Determine the size of the string element. */
597 unsigned eltsize
600 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
601 length of SRC. */
604 /* PTR can point to the byte representation of any string type, including
605 char* and wchar_t*. */
609 {
610 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
611 compute the offset to the following null if we don't know where to
612 start searching for it. */
614 {
615 /* Return when an embedded null character is found. */
617 }
619 /* We don't know the starting offset, but we do know that the string
620 has no internal zero bytes. We can assume that the offset falls
621 within the bounds of the string; otherwise, the programmer deserves
622 what he gets. Subtract the offset from the length of the string,
623 and return that. This would perhaps not be valid if we were dealing
624 with named arrays in addition to literal string constants. */
627 }
629 /* Offset from the beginning of the string in elements. */
630 HOST_WIDE_INT eltoff;
632 /* We have a known offset into the string. Start searching there for
633 a null character if we can represent it as a single HOST_WIDE_INT. */
638 else
641 /* If the offset is known to be out of bounds, warn, and call strlen at
642 runtime. */
644 {
645 /* Suppress multiple warnings for propagated constant strings. */
648 {
650 eltoff);
652 }
654 }
656 /* Use strlen to search for the first zero byte. Since any strings
657 constructed with build_string will have nulls appended, we win even
658 if we get handed something like (char[4])"abcd".
660 Since ELTOFF is our starting index into the string, no further
661 calculation is needed. */
666 }
668 /* Return a constant integer corresponding to target reading
669 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
671 static rtx
673 {
674 HOST_WIDE_INT ch;
688 {
700 }
704 }
706 /* Cast a target constant CST to target CHAR and if that value fits into
707 host char type, return zero and put that value into variable pointed to by
708 P. */
710 static int
712 {
719 /* Do not care if it fits or not right here. */
734 }
736 /* Similar to save_expr, but assumes that arbitrary code is not executed
737 in between the multiple evaluations. In particular, we assume that a
738 non-addressable local variable will not be modified. */
740 static tree
742 {
750 }
752 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
753 times to get the address of either a higher stack frame, or a return
754 address located within it (depending on FNDECL_CODE). */
756 static rtx
758 {
762 {
763 /* For a zero count with __builtin_return_address, we don't care what
764 frame address we return, because target-specific definitions will
765 override us. Therefore frame pointer elimination is OK, and using
766 the soft frame pointer is OK.
768 For a nonzero count, or a zero count with __builtin_frame_address,
769 we require a stable offset from the current frame pointer to the
770 previous one, so we must use the hard frame pointer, and
771 we must disable frame pointer elimination. */
774 else
775 {
778 /* Tell reload not to eliminate the frame pointer. */
780 }
781 }
786 /* On the SPARC, the return address is not in the frame, it is in a
787 register. There is no way to access it off of the current frame
788 pointer, but it can be accessed off the previous frame pointer by
789 reading the value from the register window save area. */
791 count--;
793 /* Scan back COUNT frames to the specified frame. */
795 {
796 /* Assume the dynamic chain pointer is in the word that the
797 frame address points to, unless otherwise specified. */
802 }
804 /* For __builtin_frame_address, return what we've got. But, on
805 the SPARC for example, we may have to add a bias. */
809 /* For __builtin_return_address, get the return address from that frame. */
810 #ifdef RETURN_ADDR_RTX
812 #else
816 #endif
818 }
820 /* Alias set used for setjmp buffer. */
823 /* Construct the leading half of a __builtin_setjmp call. Control will
824 return to RECEIVER_LABEL. This is also called directly by the SJLJ
825 exception handling code. */
827 void
829 {
831 rtx stack_save;
832 rtx mem;
841 /* We store the frame pointer and the address of receiver_label in
842 the buffer and use the rest of it for the stack save area, which
843 is machine-dependent. */
862 /* If there is further processing to do, do it. */
866 /* We have a nonlocal label. */
868 }
870 /* Construct the trailing part of a __builtin_setjmp call. This is
871 also called directly by the SJLJ exception handling code.
872 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
874 void
876 {
877 rtx chain;
879 /* Mark the FP as used when we get here, so we have to make sure it's
880 marked as used by this function. */
883 /* Mark the static chain as clobbered here so life information
884 doesn't get messed up for it. */
889 /* Now put in the code to restore the frame pointer, and argument
890 pointer, if needed. */
892 {
893 /* First adjust our frame pointer to its actual value. It was
894 previously set to the start of the virtual area corresponding to
895 the stacked variables when we branched here and now needs to be
896 adjusted to the actual hardware fp value.
898 Assignments to virtual registers are converted by
899 instantiate_virtual_regs into the corresponding assignment
900 to the underlying register (fp in this case) that makes
901 the original assignment true.
902 So the following insn will actually be decrementing fp by
903 TARGET_STARTING_FRAME_OFFSET. */
906 /* Restoring the frame pointer also modifies the hard frame pointer.
907 Mark it used (so that the previous assignment remains live once
908 the frame pointer is eliminated) and clobbered (to represent the
909 implicit update from the assignment). */
912 }
915 {
916 /* If the argument pointer can be eliminated in favor of the
917 frame pointer, we don't need to restore it. We assume here
918 that if such an elimination is present, it can always be used.
919 This is the case on all known machines; if we don't make this
920 assumption, we do unnecessary saving on many machines. */
930 {
931 /* Now restore our arg pointer from the address at which it
932 was saved in our stack frame. */
935 }
936 }
942 else
945 /* We must not allow the code we just generated to be reordered by
946 scheduling. Specifically, the update of the frame pointer must
947 happen immediately, not later. */
949 }
951 /* __builtin_longjmp is passed a pointer to an array of five words (not
952 all will be used on all machines). It operates similarly to the C
953 library function of the same name, but is more efficient. Much of
954 the code below is copied from the handling of non-local gotos. */
956 static void
958 {
963 /* DRAP is needed for stack realign if longjmp is expanded to current
964 function */
975 /* We require that the user must pass a second argument of 1, because
976 that is what builtin_setjmp will return. */
982 else
983 {
994 /* Pick up FP, label, and SP from the block and jump. This code is
995 from expand_goto in stmt.c; see there for detailed comments. */
997 /* We have to pass a value to the nonlocal_goto pattern that will
998 get copied into the static_chain pointer, but it does not matter
999 what that value is, because builtin_setjmp does not use it. */
1001 else
1002 {
1014 }
1015 }
1017 /* Search backwards and mark the jump insn as a non-local goto.
1018 Note that this precludes the use of __builtin_longjmp to a
1019 __builtin_setjmp target in the same function. However, we've
1020 already cautioned the user that these functions are for
1021 internal exception handling use only. */
1023 {
1027 {
1030 }
1033 }
1034 }
1038 {
1040 }
1042 /* This function validates the types of a function call argument list
1043 against a specified list of tree_codes. If the last specifier is a 0,
1044 that represents an ellipsis, otherwise the last specifier must be a
1045 VOID_TYPE. */
1047 static bool
1049 {
1053 const_call_expr_arg_iterator iter;
1054 const_tree arg;
1059 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1064 {
1068 {
1070 /* This signifies an ellipses, any further arguments are all ok. */
1074 /* This signifies an endlink, if no arguments remain, return
1075 true, otherwise return false. */
1079 /* The actual argument must be nonnull when either the whole
1080 called function has been declared nonnull, or when the formal
1081 argument corresponding to the actual argument has been. */
1084 {
1089 }
1090 /* FALLTHRU */
1092 /* If no parameters remain or the parameter's code does not
1093 match the specified code, return false. Otherwise continue
1094 checking any remaining arguments. */
1099 }
1100 }
1102 /* We need gotos here since we can only have one VA_CLOSE in a
1103 function. */
1104 end: ;
1110 }
1112 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1113 and the address of the save area. */
1115 static rtx
1117 {
1132 /* Copy the address of the save location to a register just in case it was
1133 based on the frame pointer. */
1142 /* ??? We no longer need to pass the static chain value, afaik. */
1145 else
1146 {
1152 /* Restore frame pointer for containing function. */
1156 /* USE of hard_frame_pointer_rtx added for consistency;
1157 not clear if really needed. */
1161 /* If the architecture is using a GP register, we must
1162 conservatively assume that the target function makes use of it.
1163 The prologue of functions with nonlocal gotos must therefore
1164 initialize the GP register to the appropriate value, and we
1165 must then make sure that this value is live at the point
1166 of the jump. (Note that this doesn't necessarily apply
1167 to targets with a nonlocal_goto pattern; they are free
1168 to implement it in their own way. Note also that this is
1169 a no-op if the GP register is a global invariant.) */
1175 }
1177 /* Search backwards to the jump insn and mark it as a
1178 non-local goto. */
1180 {
1182 {
1185 }
1188 }
1191 }
1193 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1194 (not all will be used on all machines) that was passed to __builtin_setjmp.
1195 It updates the stack pointer in that block to the current value. This is
1196 also called directly by the SJLJ exception handling code. */
1198 void
1200 {
1203 rtx stack_save
1205 memory_address
1211 }
1213 /* Expand a call to __builtin_prefetch. For a target that does not support
1214 data prefetch, evaluate the memory address argument in case it has side
1215 effects. */
1217 static void
1219 {
1229 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1230 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1231 locality). */
1235 else
1239 else
1242 /* Argument 0 is an address. */
1245 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1247 {
1250 }
1252 /* Argument 1 must be either zero or one. */
1254 {
1258 }
1260 /* Argument 2 (locality) must be a compile-time constant int. */
1262 {
1265 }
1267 /* Argument 2 must be 0, 1, 2, or 3. */
1269 {
1272 }
1275 {
1283 }
1285 /* Don't do anything with direct references to volatile memory, but
1286 generate code to handle other side effects. */
1289 }
1291 /* Get a MEM rtx for expression EXP which is the address of an operand
1292 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1293 the maximum length of the block of memory that might be accessed or
1294 NULL if unknown. */
1296 static rtx
1298 {
1302 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1303 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1310 /* Get an expression we can use to find the attributes to assign to MEM.
1311 First remove any nops. */
1316 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1317 (as builtin stringops may alias with anything). */
1324 /* If the MEM_REF has no acceptable address, try to get the base object
1325 from the original address we got, and build an all-aliasing
1326 unknown-sized access to that one. */
1332 {
1337 size_zero_node,
1338 NULL)),
1341 }
1344 }
1345 \f
1346 /* Built-in functions to perform an untyped call and return. */
1348 #define apply_args_mode \
1349 (this_target_builtins->x_apply_args_mode)
1350 #define apply_result_mode \
1351 (this_target_builtins->x_apply_result_mode)
1353 /* Return the size required for the block returned by __builtin_apply_args,
1354 and initialize apply_args_mode. */
1356 static int
1358 {
1362 machine_mode mode;
1364 /* The values computed by this function never change. */
1366 {
1367 /* The first value is the incoming arg-pointer. */
1370 /* The second value is the structure value address unless this is
1371 passed as an "invisible" first argument. */
1377 {
1387 }
1388 else
1389 {
1391 }
1392 }
1394 }
1396 /* Return the size required for the block returned by __builtin_apply,
1397 and initialize apply_result_mode. */
1399 static int
1401 {
1404 machine_mode mode;
1406 /* The values computed by this function never change. */
1408 {
1413 {
1423 }
1424 else
1427 /* Allow targets that use untyped_call and untyped_return to override
1428 the size so that machine-specific information can be stored here. */
1429 #ifdef APPLY_RESULT_SIZE
1431 #endif
1432 }
1434 }
1436 /* Create a vector describing the result block RESULT. If SAVEP is true,
1437 the result block is used to save the values; otherwise it is used to
1438 restore the values. */
1440 static rtx
1442 {
1444 machine_mode mode;
1451 {
1461 }
1463 }
1465 /* Save the state required to perform an untyped call with the same
1466 arguments as were passed to the current function. */
1468 static rtx
1470 {
1473 machine_mode mode;
1474 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1476 /* Create a block where the arg-pointer, structure value address,
1477 and argument registers can be saved. */
1480 /* Walk past the arg-pointer and structure value address. */
1485 /* Save each register used in calling a function to the block. */
1488 {
1497 }
1499 /* Save the arg pointer to the block. */
1501 /* We need the pointer as the caller actually passed them to us, not
1502 as we might have pretended they were passed. Make sure it's a valid
1503 operand, as emit_move_insn isn't expected to handle a PLUS. */
1505 tem
1508 NULL_RTX);
1513 /* Save the structure value address unless this is passed as an
1514 "invisible" first argument. */
1516 {
1520 }
1522 /* Return the address of the block. */
1524 }
1526 /* __builtin_apply_args returns block of memory allocated on
1527 the stack into which is stored the arg pointer, structure
1528 value address, static chain, and all the registers that might
1529 possibly be used in performing a function call. The code is
1530 moved to the start of the function so the incoming values are
1531 saved. */
1533 static rtx
1535 {
1536 /* Don't do __builtin_apply_args more than once in a function.
1537 Save the result of the first call and reuse it. */
1540 {
1541 /* When this function is called, it means that registers must be
1542 saved on entry to this function. So we migrate the
1543 call to the first insn of this function. */
1544 rtx temp;
1553 /* Put the insns after the NOTE that starts the function.
1554 If this is inside a start_sequence, make the outer-level insn
1555 chain current, so the code is placed at the start of the
1556 function. If internal_arg_pointer is a non-virtual pseudo,
1557 it needs to be placed after the function that initializes
1558 that pseudo. */
1563 else
1567 }
1568 }
1570 /* Perform an untyped call and save the state required to perform an
1571 untyped return of whatever value was returned by the given function. */
1573 static rtx
1575 {
1577 machine_mode mode;
1586 /* Create a block where the return registers can be saved. */
1589 /* Fetch the arg pointer from the ARGUMENTS block. */
1596 /* Push a new argument block and copy the arguments. Do not allow
1597 the (potential) memcpy call below to interfere with our stack
1598 manipulations. */
1600 NO_DEFER_POP;
1602 /* Save the stack with nonlocal if available. */
1605 else
1608 /* Allocate a block of memory onto the stack and copy the memory
1609 arguments to the outgoing arguments address. We can pass TRUE
1610 as the 4th argument because we just saved the stack pointer
1611 and will restore it right after the call. */
1614 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1615 may have already set current_function_calls_alloca to true.
1616 current_function_calls_alloca won't be set if argsize is zero,
1617 so we have to guarantee need_drap is true here. */
1623 {
1626 else
1628 }
1635 /* Refer to the argument block. */
1640 /* Walk past the arg-pointer and structure value address. */
1645 /* Restore each of the registers previously saved. Make USE insns
1646 for each of these registers for use in making the call. */
1649 {
1657 }
1659 /* Restore the structure value address unless this is passed as an
1660 "invisible" first argument. */
1663 {
1670 }
1672 /* All arguments and registers used for the call are set up by now! */
1675 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1676 and we don't want to load it into a register as an optimization,
1677 because prepare_call_address already did it if it should be done. */
1681 /* Generate the actual call instruction and save the return value. */
1683 {
1687 }
1689 {
1692 /* Locate the unique return register. It is not possible to
1693 express a call that sets more than one return register using
1694 call_value; use untyped_call for that. In fact, untyped_call
1695 only needs to save the return registers in the given block. */
1698 {
1702 }
1709 }
1710 else
1713 /* Find the CALL insn we just emitted, and attach the register usage
1714 information. */
1718 /* Restore the stack. */
1721 else
1725 OK_DEFER_POP;
1727 /* Return the address of the result block. */
1730 }
1732 /* Perform an untyped return. */
1734 static void
1736 {
1738 machine_mode mode;
1739 rtx reg;
1748 {
1753 }
1755 /* Restore the return value and note that each value is used. */
1759 {
1771 }
1773 /* Put the USE insns before the return. */
1776 /* Return whatever values was restored by jumping directly to the end
1777 of the function. */
1779 }
1781 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1783 static enum type_class
1785 {
1787 {
1806 }
1807 }
1809 /* Expand a call EXP to __builtin_classify_type. */
1811 static rtx
1813 {
1817 }
1819 /* This helper macro, meant to be used in mathfn_built_in below, determines
1820 which among a set of builtin math functions is appropriate for a given type
1821 mode. The `F' (float) and `L' (long double) are automatically generated
1822 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1823 types, there are additional types that are considered with 'F32', 'F64',
1824 'F128', etc. suffixes. */
1825 #define CASE_MATHFN(MATHFN) \
1826 CASE_CFN_##MATHFN: \
1827 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1828 fcodel = BUILT_IN_##MATHFN##L ; break;
1829 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1830 types. */
1831 #define CASE_MATHFN_FLOATN(MATHFN) \
1832 CASE_CFN_##MATHFN: \
1833 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1834 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1835 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1836 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1837 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1838 break;
1839 /* Similar to above, but appends _R after any F/L suffix. */
1840 #define CASE_MATHFN_REENT(MATHFN) \
1841 case CFN_BUILT_IN_##MATHFN##_R: \
1842 case CFN_BUILT_IN_##MATHFN##F_R: \
1843 case CFN_BUILT_IN_##MATHFN##L_R: \
1844 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1845 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1847 /* Return a function equivalent to FN but operating on floating-point
1848 values of type TYPE, or END_BUILTINS if no such function exists.
1849 This is purely an operation on function codes; it does not guarantee
1850 that the target actually has an implementation of the function. */
1852 static built_in_function
1854 {
1855 tree mtype;
1866 {
1957 }
1980 else
1982 }
1984 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1985 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1986 otherwise use the explicit declaration. If we can't do the conversion,
1987 return null. */
1989 static tree
1991 {
2000 }
2002 /* Like mathfn_built_in_1, but always use the implicit array. */
2004 tree
2006 {
2008 }
2010 /* Like mathfn_built_in_1, but take a built_in_function and
2011 always use the implicit array. */
2013 tree
2015 {
2017 }
2019 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2020 return its code, otherwise return IFN_LAST. Note that this function
2021 only tests whether the function is defined in internals.def, not whether
2022 it is actually available on the target. */
2024 internal_fn
2026 {
2030 {
2031 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2032 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2033 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2034 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2035 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2036 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2037 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2054 }
2055 }
2057 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2058 on the current target by a call to an internal function, return the
2059 code of that internal function, otherwise return IFN_LAST. The caller
2060 is responsible for ensuring that any side-effects of the built-in
2061 call are dealt with correctly. E.g. if CALL sets errno, the caller
2062 must decide that the errno result isn't needed or make it available
2063 in some other way. */
2065 internal_fn
2067 {
2069 {
2072 {
2077 }
2078 }
2080 }
2082 /* Expand a call to the builtin trinary math functions (fma).
2083 Return NULL_RTX if a normal call should be emitted rather than expanding the
2084 function in-line. EXP is the expression that is a call to the builtin
2085 function; if convenient, the result should be placed in TARGET.
2086 SUBTARGET may be used as the target for computing one of EXP's
2087 operands. */
2089 static rtx
2091 {
2092 optab builtin_optab;
2097 machine_mode mode;
2107 {
2113 }
2115 /* Make a suitable register to place result in. */
2118 /* Before working hard, check whether the instruction is available. */
2124 /* Always stabilize the argument list. */
2135 /* Compute into RESULT.
2136 Set RESULT to wherever the result comes back. */
2140 /* If we were unable to expand via the builtin, stop the sequence
2141 (without outputting the insns) and call to the library function
2142 with the stabilized argument list. */
2144 {
2147 }
2149 /* Output the entire sequence. */
2155 }
2157 /* Expand a call to the builtin sin and cos math functions.
2158 Return NULL_RTX if a normal call should be emitted rather than expanding the
2159 function in-line. EXP is the expression that is a call to the builtin
2160 function; if convenient, the result should be placed in TARGET.
2161 SUBTARGET may be used as the target for computing one of EXP's
2162 operands. */
2164 static rtx
2166 {
2167 optab builtin_optab;
2168 rtx op0;
2171 machine_mode mode;
2172 tree arg;
2180 {
2186 }
2188 /* Make a suitable register to place result in. */
2191 /* Check if sincos insn is available, otherwise fallback
2192 to sin or cos insn. */
2195 {
2202 }
2204 /* Before working hard, check whether the instruction is available. */
2206 {
2209 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2210 need to expand the argument again. This way, we will not perform
2211 side-effects more the once. */
2218 /* Compute into RESULT.
2219 Set RESULT to wherever the result comes back. */
2221 {
2225 {
2234 }
2236 }
2237 else
2241 {
2242 /* Output the entire sequence. */
2247 }
2249 /* If we were unable to expand via the builtin, stop the sequence
2250 (without outputting the insns) and call to the library function
2251 with the stabilized argument list. */
2253 }
2256 }
2258 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2259 return an RTL instruction code that implements the functionality.
2260 If that isn't possible or available return CODE_FOR_nothing. */
2262 static enum insn_code
2264 {
2267 machine_mode mode;
2270 {
2284 /* These builtins have no optabs (yet). */
2288 }
2290 /* There's no easy way to detect the case we need to set EDOM. */
2294 /* Optab mode depends on the mode of the input argument. */
2300 }
2302 /* Expand a call to one of the builtin math functions that operate on
2303 floating point argument and output an integer result (ilogb, isinf,
2304 isnan, etc).
2305 Return 0 if a normal call should be emitted rather than expanding the
2306 function in-line. EXP is the expression that is a call to the builtin
2307 function; if convenient, the result should be placed in TARGET. */
2309 static rtx
2311 {
2313 rtx op0;
2315 machine_mode mode;
2316 tree arg;
2326 {
2331 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2332 need to expand the argument again. This way, we will not perform
2333 side-effects more the once. */
2348 }
2351 }
2353 /* Expand a call to the builtin sincos math function.
2354 Return NULL_RTX if a normal call should be emitted rather than expanding the
2355 function in-line. EXP is the expression that is a call to the builtin
2356 function. */
2358 static rtx
2360 {
2362 machine_mode mode;
2376 /* Make a suitable register to place result in. */
2379 /* Check if sincos insn is available, otherwise emit the call. */
2394 /* Compute into target1 and target2.
2395 Set TARGET to wherever the result comes back. */
2399 /* Move target1 and target2 to the memory locations indicated
2400 by op1 and op2. */
2405 }
2407 /* Expand a call to the internal cexpi builtin to the sincos math function.
2408 EXP is the expression that is a call to the builtin function; if convenient,
2409 the result should be placed in TARGET. */
2411 static rtx
2413 {
2416 machine_mode mode;
2427 /* Try expanding via a sincos optab, fall back to emitting a libcall
2428 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2429 is only generated from sincos, cexp or if we have either of them. */
2431 {
2437 /* Compute into op1 and op2. */
2439 }
2441 {
2452 else
2462 /* Make sure not to fold the sincos call again. */
2466 }
2467 else
2468 {
2478 else
2481 /* If we don't have a decl for cexp create one. This is the
2482 friendliest fallback if the user calls __builtin_cexpi
2483 without full target C99 function support. */
2485 {
2486 tree fntype;
2498 }
2503 /* Make sure not to fold the cexp call again. */
2507 }
2509 /* Now build the proper return type. */
2514 }
2516 /* Conveniently construct a function call expression. FNDECL names the
2517 function to be called, N is the number of arguments, and the "..."
2518 parameters are the argument expressions. Unlike build_call_exr
2519 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2521 static tree
2523 {
2533 }
2535 /* Expand a call to one of the builtin rounding functions gcc defines
2536 as an extension (lfloor and lceil). As these are gcc extensions we
2537 do not need to worry about setting errno to EDOM.
2538 If expanding via optab fails, lower expression to (int)(floor(x)).
2539 EXP is the expression that is a call to the builtin function;
2540 if convenient, the result should be placed in TARGET. */
2542 static rtx
2544 {
2545 convert_optab builtin_optab;
2550 tree fallback_fndecl;
2551 machine_mode mode;
2552 tree arg;
2560 {
2577 }
2579 /* Make a suitable register to place result in. */
2584 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2585 need to expand the argument again. This way, we will not perform
2586 side-effects more the once. */
2593 /* Compute into TARGET. */
2595 {
2596 /* Output the entire sequence. */
2601 }
2603 /* If we were unable to expand via the builtin, stop the sequence
2604 (without outputting the insns). */
2607 /* Fall back to floating point rounding optab. */
2610 /* For non-C99 targets we may end up without a fallback fndecl here
2611 if the user called __builtin_lfloor directly. In this case emit
2612 a call to the floor/ceil variants nevertheless. This should result
2613 in the best user experience for not full C99 targets. */
2615 {
2616 tree fntype;
2620 {
2653 }
2658 }
2665 /* Truncate the result of floating point optab to integer
2666 via expand_fix (). */
2671 }
2673 /* Expand a call to one of the builtin math functions doing integer
2674 conversion (lrint).
2675 Return 0 if a normal call should be emitted rather than expanding the
2676 function in-line. EXP is the expression that is a call to the builtin
2677 function; if convenient, the result should be placed in TARGET. */
2679 static rtx
2681 {
2682 convert_optab builtin_optab;
2683 rtx op0;
2686 tree arg;
2687 machine_mode mode;
2696 {
2715 }
2717 /* There's no easy way to detect the case we need to set EDOM. */
2721 /* Make a suitable register to place result in. */
2724 /* There's no easy way to detect the case we need to set EDOM. */
2726 {
2729 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2730 need to expand the argument again. This way, we will not perform
2731 side-effects more the once. */
2739 {
2740 /* Output the entire sequence. */
2745 }
2747 /* If we were unable to expand via the builtin, stop the sequence
2748 (without outputting the insns) and call to the library function
2749 with the stabilized argument list. */
2751 }
2754 {
2755 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2756 targets, (int) round (x) should never be transformed into
2757 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2758 a call to lround in the hope that the target provides at least some
2759 C99 functions. This should result in the best user experience for
2760 not full C99 targets. */
2761 tree fallback_fndecl = mathfn_built_in_1
2770 }
2773 }
2775 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2776 a normal call should be emitted rather than expanding the function
2777 in-line. EXP is the expression that is a call to the builtin
2778 function; if convenient, the result should be placed in TARGET. */
2780 static rtx
2782 {
2785 machine_mode mode;
2786 machine_mode mode2;
2795 /* Emit a libcall to libgcc. */
2797 /* Mode of the 2nd argument must match that of an int. */
2815 }
2817 /* Expand expression EXP which is a call to the strlen builtin. Return
2818 NULL_RTX if we failed the caller should emit a normal call, otherwise
2819 try to get the result in TARGET, if convenient. */
2821 static rtx
2823 machine_mode target_mode)
2824 {
2827 else
2828 {
2830 rtx pat;
2831 tree len;
2833 rtx src_reg;
2835 machine_mode insn_mode;
2839 /* If the length can be computed at compile-time, return it. */
2844 /* If the length can be computed at compile-time and is constant
2845 integer, but there are side-effects in src, evaluate
2846 src for side-effects, then return len.
2847 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2848 can be optimized into: i++; x = 3; */
2851 {
2854 }
2858 /* If SRC is not a pointer type, don't do this operation inline. */
2862 /* Bail out if we can't compute strlen in the right mode. */
2864 {
2868 }
2872 /* Make a place to hold the source address. We will not expand
2873 the actual source until we are sure that the expansion will
2874 not fail -- there are trees that cannot be expanded twice. */
2877 /* Mark the beginning of the strlen sequence so we can emit the
2878 source operand later. */
2888 /* Now that we are assured of success, expand the source. */
2892 {
2893 #ifdef POINTERS_EXTEND_UNSIGNED
2896 POINTERS_EXTEND_UNSIGNED);
2897 #endif
2899 }
2905 else
2908 /* Return the value in the proper mode for this function. */
2913 else
2917 }
2918 }
2920 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2921 bytes from constant string DATA + OFFSET and return it as target
2922 constant. */
2924 static rtx
2926 scalar_int_mode mode)
2927 {
2935 }
2937 /* LEN specify length of the block of memcpy/memset operation.
2938 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2939 In some cases we can make very likely guess on max size, then we
2940 set it into PROBABLE_MAX_SIZE. */
2942 static void
2947 {
2949 {
2952 }
2953 else
2954 {
2958 /* Determine bounds from the type. */
2961 else
2966 else
2972 {
2977 }
2979 {
2980 /* Anti range 0...N lets us to determine minimal size to N+1. */
2982 {
2985 }
2986 /* Code like
2988 int n;
2989 if (n < 100)
2990 memcpy (a, b, n)
2992 Produce anti range allowing negative values of N. We still
2993 can use the information and make a guess that N is not negative.
2994 */
2997 }
2998 }
3002 }
3004 /* Try to verify that the sizes and lengths of the arguments to a string
3005 manipulation function given by EXP are within valid bounds and that
3006 the operation does not lead to buffer overflow. Arguments other than
3007 EXP may be null. When non-null, the arguments have the following
3008 meaning:
3009 SIZE is the user-supplied size argument to the function (such as in
3010 memcpy(d, s, SIZE) or strncpy(d, s, SIZE). It specifies the exact
3011 number of bytes to write.
3012 MAXLEN is the user-supplied bound on the length of the source sequence
3013 (such as in strncat(d, s, N). It specifies the upper limit on the number
3014 of bytes to write.
3015 SRC is the source string (such as in strcpy(d, s)) when the expression
3016 EXP is a string function call (as opposed to a memory call like memcpy).
3017 As an exception, SRC can also be an integer denoting the precomputed
3018 size of the source string or object (for functions like memcpy).
3019 OBJSIZE is the size of the destination object specified by the last
3020 argument to the _chk builtins, typically resulting from the expansion
3021 of __builtin_object_size (such as in __builtin___strcpy_chk(d, s,
3022 OBJSIZE).
3024 When SIZE is null LEN is checked to verify that it doesn't exceed
3025 SIZE_MAX.
3027 If the call is successfully verified as safe from buffer overflow
3028 the function returns true, otherwise false.. */
3030 static bool
3032 {
3033 /* The size of the largest object is half the address space, or
3034 SSIZE_MAX. (This is way too permissive.) */
3041 /* Set to true when the exact number of bytes written by a string
3042 function like strcpy is not known and the only thing that is
3043 known is that it must be at least one (for the terminating nul). */
3046 {
3047 /* SRC is normally a pointer to string but as a special case
3048 it can be an integer denoting the length of a string. */
3050 {
3051 /* Try to determine the range of lengths the source string
3052 refers to. If it can be determined and is less than
3053 the upper bound given by MAXLEN add one to it for
3054 the terminating nul. Otherwise, set it to one for
3055 the same reason, or to MAXLEN as appropriate. */
3058 {
3061 else
3072 }
3073 else
3074 {
3077 }
3078 }
3079 else
3081 }
3084 {
3085 /* When the only available piece of data is the object size
3086 there is nothing to do. */
3090 /* Otherwise, when the length of the source sequence is known
3091 (as with with strlen), set SIZE to it. */
3094 }
3099 /* The SIZE is exact if it's non-null, constant, and in range of
3100 unsigned HOST_WIDE_INT. */
3106 /* First check the number of bytes to be written against the maximum
3107 object size. */
3109 {
3115 "%K%qD specified size %E "
3118 else
3120 "%K%qD specified size between %E and %E "
3125 }
3127 /* Next check the number of bytes to be written against the destination
3128 object size. */
3130 {
3136 {
3141 {
3142 /* This is a call to strcpy with a destination of 0 size
3143 and a source of unknown length. The call will write
3144 at least one byte past the end of the destination. */
3146 "%K%qD writing %E or more bytes into a region "
3149 }
3159 {
3160 /* Avoid printing the upper bound if it's invalid. */
3162 "%K%qD writing %E or more bytes into a region "
3165 }
3166 else
3168 "%K%qD writing between %E and %E bytes into "
3171 objsize);
3173 /* Return error when an overflow has been detected. */
3175 }
3176 }
3178 /* Check the maximum length of the source sequence against the size
3179 of the destination object if known, or against the maximum size
3180 of an object. */
3182 {
3186 {
3191 {
3192 /* Warn about crazy big sizes first since that's more
3193 likely to be meaningful than saying that the bound
3194 is greater than the object size if both are big. */
3197 "%K%qD specified bound %E "
3201 else
3203 "%K%qD specified bound between %E and %E "
3209 }
3212 {
3215 "%K%qD specified bound %E "
3219 else
3221 "%K%qD specified bound between %E and %E "
3226 }
3227 }
3228 }
3234 {
3244 {
3245 /* Avoid printing the upper bound if it's invalid. */
3247 "%K%qD reading %E or more bytes from a region "
3250 }
3251 else
3253 "%K%qD reading between %E and %E bytes from a region "
3257 }
3260 }
3262 /* Helper to compute the size of the object referenced by the DEST
3263 expression which must have pointer type, using Object Size type
3264 OSTYPE (only the least significant 2 bits are used). Return
3265 the size of the object if successful or NULL when the size cannot
3266 be determined. */
3268 tree
3270 {
3273 /* Only the two least significant bits are meaningful. */
3279 /* Unless computing the largest size (for memcpy and other raw memory
3280 functions), try to determine the size of the object from its type. */
3285 {
3295 }
3308 {
3309 /* Return the constant size unless it's zero (that's a zero-length
3310 array likely at the end of a struct). */
3315 }
3318 }
3320 /* Helper to determine and check the sizes of the source and the destination
3321 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3322 call expression, DEST is the destination argument, SRC is the source
3323 argument or null, and LEN is the number of bytes. Use Object Size type-0
3324 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3325 (no overflow or invalid sizes), false otherwise. */
3327 static bool
3329 {
3333 /* For functions like memset and memcpy that operate on raw memory
3334 try to determine the size of the largest source and destination
3335 object using type-0 Object Size regardless of the object size
3336 type specified by the option. */
3342 }
3344 /* Validate memchr arguments without performing any expansion.
3345 Return NULL_RTX. */
3347 static rtx
3349 {
3357 /* Diagnose calls where the specified length exceeds the size
3358 of the object. */
3360 {
3365 }
3368 }
3370 /* Expand a call EXP to the memcpy builtin.
3371 Return NULL_RTX if we failed, the caller should emit a normal call,
3372 otherwise try to get the result in TARGET, if convenient (and in
3373 mode MODE if that's convenient). */
3375 static rtx
3377 {
3390 }
3392 /* Check a call EXP to the memmove built-in for validity.
3393 Return NULL_RTX on both success and failure. */
3395 static rtx
3397 {
3409 }
3411 /* Expand an instrumented call EXP to the memcpy builtin.
3412 Return NULL_RTX if we failed, the caller should emit a normal call,
3413 otherwise try to get the result in TARGET, if convenient (and in
3414 mode MODE if that's convenient). */
3416 static rtx
3418 {
3424 else
3425 {
3432 /* Return src bounds with the result. */
3434 {
3438 }
3440 }
3441 }
3443 /* Expand a call EXP to the mempcpy builtin.
3444 Return NULL_RTX if we failed; the caller should emit a normal call,
3445 otherwise try to get the result in TARGET, if convenient (and in
3446 mode MODE if that's convenient). If ENDP is 0 return the
3447 destination pointer, if ENDP is 1 return the end pointer ala
3448 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3449 stpcpy. */
3451 static rtx
3453 {
3462 /* Avoid expanding mempcpy into memcpy when the call is determined
3463 to overflow the buffer. This also prevents the same overflow
3464 from being diagnosed again when expanding memcpy. */
3470 }
3472 /* Expand an instrumented call EXP to the mempcpy builtin.
3473 Return NULL_RTX if we failed, the caller should emit a normal call,
3474 otherwise try to get the result in TARGET, if convenient (and in
3475 mode MODE if that's convenient). */
3477 static rtx
3479 {
3485 else
3486 {
3493 /* Return src bounds with the result. */
3495 {
3499 }
3501 }
3502 }
3504 /* Helper function to do the actual work for expand of memory copy family
3505 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3506 of memory from SRC to DEST and assign to TARGET if convenient.
3507 If ENDP is 0 return the
3508 destination pointer, if ENDP is 1 return the end pointer ala
3509 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3510 stpcpy. */
3512 static rtx
3515 {
3526 /* If DEST is not a pointer type, call the normal function. */
3530 /* If either SRC is not a pointer type, don't do this
3531 operation in-line. */
3548 /* If SRC is a string constant and block move would be done
3549 by pieces, we can avoid loading the string from memory
3550 and only stored the computed constants. */
3557 {
3559 builtin_memcpy_read_str,
3565 }
3570 /* Copy word part most expediently. */
3579 {
3582 }
3585 {
3587 /* stpcpy pointer to last byte. */
3590 }
3593 }
3595 static rtx
3598 {
3600 endp);
3601 }
3603 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3604 we failed, the caller should emit a normal call, otherwise try to
3605 get the result in TARGET, if convenient. If ENDP is 0 return the
3606 destination pointer, if ENDP is 1 return the end pointer ala
3607 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3608 stpcpy. */
3610 static rtx
3612 {
3614 rtx dest_mem;
3615 rtx src_mem;
3623 {
3626 }
3635 {
3637 /* movstr is supposed to set end to the address of the NUL
3638 terminator. If the caller requested a mempcpy-like return value,
3639 adjust it. */
3641 {
3645 }
3646 }
3648 }
3650 /* Do some very basic size validation of a call to the strcpy builtin
3651 given by EXP. Return NULL_RTX to have the built-in expand to a call
3652 to the library function. */
3654 static rtx
3656 {
3664 /* There is no way here to determine the length of the string in
3665 the destination to which the SRC string is being appended so
3666 just diagnose cases when the souce string is longer than
3667 the destination object. */
3675 }
3677 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3678 NULL_RTX if we failed the caller should emit a normal call, otherwise
3679 try to get the result in TARGET, if convenient (and in mode MODE if that's
3680 convenient). */
3682 static rtx
3684 {
3692 {
3696 }
3699 }
3701 /* Helper function to do the actual work for expand_builtin_strcpy. The
3702 arguments to the builtin_strcpy call DEST and SRC are broken out
3703 so that this can also be called without constructing an actual CALL_EXPR.
3704 The other arguments and return value are the same as for
3705 expand_builtin_strcpy. */
3707 static rtx
3709 {
3711 }
3713 /* Expand a call EXP to the stpcpy builtin.
3714 Return NULL_RTX if we failed the caller should emit a normal call,
3715 otherwise try to get the result in TARGET, if convenient (and in
3716 mode MODE if that's convenient). */
3718 static rtx
3720 {
3731 {
3735 }
3737 /* If return value is ignored, transform stpcpy into strcpy. */
3739 {
3743 }
3744 else
3745 {
3747 rtx ret;
3749 /* Ensure we get an actual string whose length can be evaluated at
3750 compile-time, not an expression containing a string. This is
3751 because the latter will potentially produce pessimized code
3752 when used to produce the return value. */
3764 {
3768 {
3772 {
3774 {
3777 else
3779 }
3788 }
3789 }
3790 }
3793 }
3794 }
3796 /* Check a call EXP to the stpncpy built-in for validity.
3797 Return NULL_RTX on both success and failure. */
3799 static rtx
3801 {
3807 /* The source and destination of the call. */
3811 /* The exact number of bytes to write (not the maximum). */
3814 /* The size of the destination object. */
3821 }
3823 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3824 bytes from constant string DATA + OFFSET and return it as target
3825 constant. */
3827 rtx
3829 scalar_int_mode mode)
3830 {
3837 }
3839 /* Helper to check the sizes of sequences and the destination of calls
3840 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3841 success (no overflow or invalid sizes), false otherwise. */
3843 static bool
3845 {
3850 /* Try to determine the range of lengths that the source expression
3851 refers to. */
3855 /* Try to verify that the destination is big enough for the shortest
3856 string. */
3859 {
3860 /* If it hasn't been provided by __strncat_chk, try to determine
3861 the size of the destination object into which the source is
3862 being copied. */
3864 }
3866 /* Add one for the terminating nul. */
3869 size_one_node)
3872 /* Strncat copies at most MAXLEN bytes and always appends the terminating
3873 nul so the specified upper bound should never be equal to (or greater
3874 than) the size of the destination. */
3877 {
3886 }
3894 /* The number of bytes to write is LEN but check_sizes will also
3895 check SRCLEN if LEN's value isn't known. */
3898 }
3900 /* Similar to expand_builtin_strcat, do some very basic size validation
3901 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3902 the built-in expand to a call to the library function. */
3904 static rtx
3906 {
3914 /* The upper bound on the number of bytes to write. */
3916 /* The length of the source sequence. */
3919 /* Try to determine the range of lengths that the source expression
3920 refers to. */
3924 else
3927 /* Try to verify that the destination is big enough for the shortest
3928 string. First try to determine the size of the destination object
3929 into which the source is being copied. */
3932 /* Add one for the terminating nul. */
3935 size_one_node)
3938 /* Strncat copies at most MAXLEN bytes and always appends the terminating
3939 nul so the specified upper bound should never be equal to (or greater
3940 than) the size of the destination. */
3943 {
3952 }
3960 /* The number of bytes to write is LEN but check_sizes will also
3961 check SRCLEN if LEN's value isn't known. */
3966 }
3968 /* Helper to check the sizes of sequences and the destination of calls
3969 to __builtin_strncpy (DST, SRC, CNT) and __builtin___strncpy_chk.
3970 Returns true on success (no overflow warning), false otherwise. */
3972 static bool
3974 {
3982 }
3984 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3985 NULL_RTX if we failed the caller should emit a normal call. */
3987 static rtx
3989 {
3994 {
3997 /* The number of bytes to write (not the maximum). */
3999 /* The length of the source sequence. */
4004 /* We must be passed a constant len and src parameter. */
4010 /* We're required to pad with trailing zeros if the requested
4011 len is greater than strlen(s2)+1. In that case try to
4012 use store_by_pieces, if it fails, punt. */
4014 {
4017 rtx dest_mem;
4021 builtin_strncpy_read_str,
4028 builtin_strncpy_read_str,
4033 }
4034 }
4036 }
4038 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4039 bytes from constant string DATA + OFFSET and return it as target
4040 constant. */
4042 rtx
4044 scalar_int_mode mode)
4045 {
4052 }
4054 /* Callback routine for store_by_pieces. Return the RTL of a register
4055 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4056 char value given in the RTL register data. For example, if mode is
4057 4 bytes wide, return the RTL for 0x01010101*data. */
4059 static rtx
4061 scalar_int_mode mode)
4062 {
4078 }
4080 /* Expand expression EXP, which is a call to the memset builtin. Return
4081 NULL_RTX if we failed the caller should emit a normal call, otherwise
4082 try to get the result in TARGET, if convenient (and in mode MODE if that's
4083 convenient). */
4085 static rtx
4087 {
4099 }
4101 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4102 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4103 try to get the result in TARGET, if convenient (and in mode MODE if that's
4104 convenient). */
4106 static rtx
4108 {
4113 else
4114 {
4120 /* Return src bounds with the result. */
4122 {
4126 }
4128 }
4129 }
4131 /* Helper function to do the actual work for expand_builtin_memset. The
4132 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4133 so that this can also be called without constructing an actual CALL_EXPR.
4134 The other arguments and return value are the same as for
4135 expand_builtin_memset. */
4137 static rtx
4140 {
4143 machine_mode val_mode;
4155 /* If DEST is not a pointer type, don't do this operation in-line. */
4166 /* If the LEN parameter is zero, return DEST. */
4168 {
4169 /* Evaluate and ignore VAL in case it has side-effects. */
4172 }
4174 /* Stabilize the arguments in case we fail. */
4186 {
4187 rtx val_rtx;
4192 /* Assume that we can memset by pieces if we can store
4193 * the coefficients by pieces (in the required modes).
4194 * We can't pass builtin_memset_gen_str as that emits RTL. */
4200 {
4205 }
4209 probable_max_size))
4215 }
4221 {
4232 probable_max_size))
4238 }
4246 probable_max_size);
4249 {
4252 }
4256 do_libcall:
4266 else
4271 }
4273 /* Expand expression EXP, which is a call to the bzero builtin. Return
4274 NULL_RTX if we failed the caller should emit a normal call. */
4276 static rtx
4278 {
4287 /* New argument list transforming bzero(ptr x, int y) to
4288 memset(ptr x, int 0, size_t y). This is done this way
4289 so that if it isn't expanded inline, we fallback to
4290 calling bzero instead of memset. */
4298 }
4300 /* Try to expand cmpstr operation ICODE with the given operands.
4301 Return the result rtx on success, otherwise return null. */
4303 static rtx
4305 HOST_WIDE_INT align)
4306 {
4320 }
4322 /* Expand expression EXP, which is a call to the memcmp built-in function.
4323 Return NULL_RTX if we failed and the caller should emit a normal call,
4324 otherwise try to get the result in TARGET, if convenient.
4325 RESULT_EQ is true if we can relax the returned value to be either zero
4326 or nonzero, without caring about the sign. */
4328 static rtx
4330 {
4339 /* Diagnose calls where the specified length exceeds the size of either
4340 object. */
4342 {
4347 {
4352 }
4353 }
4361 /* If we don't have POINTER_TYPE, call the function. */
4369 /* Set MEM_SIZE as appropriate. */
4371 {
4374 }
4380 {
4384 }
4386 /* If SRC is a string constant and block move would be done
4387 by pieces, we can avoid loading the string from memory
4388 and only stored the computed constants. */
4400 {
4401 /* Return the value in the proper mode for this function. */
4406 {
4409 }
4412 }
4415 }
4417 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4418 if we failed the caller should emit a normal call, otherwise try to get
4419 the result in TARGET, if convenient. */
4421 static rtx
4423 {
4430 {
4440 /* If we don't have POINTER_TYPE, call the function. */
4444 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4451 /* Try to call cmpstrsi. */
4456 /* Try to determine at least one length and call cmpstrnsi. */
4458 {
4459 tree len;
4460 rtx arg3_rtx;
4470 /* If we don't have a constant length for the first, use the length
4471 of the second, if we know it. We don't require a constant for
4472 this case; some cost analysis could be done if both are available
4473 but neither is constant. For now, assume they're equally cheap,
4474 unless one has side effects. If both strings have constant lengths,
4475 use the smaller. */
4491 else
4494 /* If both arguments have side effects, we cannot optimize. */
4496 {
4498 result = expand_cmpstrn_or_cmpmem
4501 }
4502 }
4505 {
4506 /* Return the value in the proper mode for this function. */
4514 }
4516 /* Expand the library call ourselves using a stabilized argument
4517 list to avoid re-evaluating the function's arguments twice. */
4523 }
4525 }
4527 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4528 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4529 the result in TARGET, if convenient. */
4531 static rtx
4533 ATTRIBUTE_UNUSED machine_mode mode)
4534 {
4541 /* If c_strlen can determine an expression for one of the string
4542 lengths, and it doesn't have side effects, then emit cmpstrnsi
4543 using length MIN(strlen(string)+1, arg3). */
4546 {
4549 rtx result;
4568 /* If we don't have a constant length for the first, use the length
4569 of the second, if we know it. If neither string is constant length,
4570 use the given length argument. We don't require a constant for
4571 this case; some cost analysis could be done if both are available
4572 but neither is constant. For now, assume they're equally cheap,
4573 unless one has side effects. If both strings have constant lengths,
4574 use the smaller. */
4592 else
4595 /* If we are not using the given length, we must incorporate it here.
4596 The actual new length parameter will be MIN(len,arg3) in this case. */
4606 {
4607 /* Return the value in the proper mode for this function. */
4615 }
4617 /* Expand the library call ourselves using a stabilized argument
4618 list to avoid re-evaluating the function's arguments twice. */
4625 }
4627 }
4629 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4630 if that's convenient. */
4632 rtx
4634 {
4635 rtx val;
4638 /* Don't do __builtin_saveregs more than once in a function.
4639 Save the result of the first call and reuse it. */
4643 /* When this function is called, it means that registers must be
4644 saved on entry to this function. So we migrate the call to the
4645 first insn of this function. */
4649 /* Do whatever the machine needs done in this case. */
4657 /* Put the insns after the NOTE that starts the function. If this
4658 is inside a start_sequence, make the outer-level insn chain current, so
4659 the code is placed at the start of the function. */
4665 }
4667 /* Expand a call to __builtin_next_arg. */
4669 static rtx
4671 {
4672 /* Checking arguments is already done in fold_builtin_next_arg
4673 that must be called before this function. */
4678 }
4680 /* Make it easier for the backends by protecting the valist argument
4681 from multiple evaluations. */
4683 static tree
4685 {
4688 /* The current way of determining the type of valist is completely
4689 bogus. We should have the information on the va builtin instead. */
4694 {
4698 /* For this case, the backends will be expecting a pointer to
4699 vatype, but it's possible we've actually been given an array
4700 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4701 So fix it. */
4703 {
4706 }
4707 }
4708 else
4709 {
4713 {
4719 }
4725 }
4728 }
4730 /* The "standard" definition of va_list is void*. */
4732 tree
4734 {
4736 }
4738 /* The "standard" abi va_list is va_list_type_node. */
4740 tree
4742 {
4744 }
4746 /* The "standard" type of va_list is va_list_type_node. */
4748 tree
4750 {
4757 {
4758 /* If va_list is an array type, the argument may have decayed
4759 to a pointer type, e.g. by being passed to another function.
4760 In that case, unwrap both types so that we can compare the
4761 underlying records. */
4764 {
4767 }
4768 }
4773 }
4775 /* The "standard" implementation of va_start: just assign `nextarg' to
4776 the variable. */
4778 void
4780 {
4784 /* We do not have any valid bounds for the pointer, so
4785 just store zero bounds for it. */
4789 nextarg));
4790 }
4792 /* Expand EXP, a call to __builtin_va_start. */
4794 static rtx
4796 {
4797 rtx nextarg;
4798 tree valist;
4802 {
4805 }
4815 else
4819 }
4821 /* Expand EXP, a call to __builtin_va_end. */
4823 static rtx
4825 {
4828 /* Evaluate for side effects, if needed. I hate macros that don't
4829 do that. */
4834 }
4836 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4837 builtin rather than just as an assignment in stdarg.h because of the
4838 nastiness of array-type va_list types. */
4840 static rtx
4842 {
4855 {
4859 }
4860 else
4861 {
4864 /* Evaluate to pointers. */
4873 /* "Dereference" to BLKmode memories. */
4881 /* Copy. */
4883 }
4886 }
4888 /* Expand a call to one of the builtin functions __builtin_frame_address or
4889 __builtin_return_address. */
4891 static rtx
4893 {
4894 /* The argument must be a nonnegative integer constant.
4895 It counts the number of frames to scan up the stack.
4896 The value is either the frame pointer value or the return
4897 address saved in that frame. */
4899 /* Warning about missing arg was already issued. */
4902 {
4905 }
4906 else
4907 {
4908 /* Number of frames to scan up the stack. */
4913 /* Some ports cannot access arbitrary stack frames. */
4915 {
4918 }
4921 {
4922 /* Warn since no effort is made to ensure that any frame
4923 beyond the current one exists or can be safely reached. */
4926 }
4928 /* For __builtin_frame_address, return what we've got. */
4936 }
4937 }
4939 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
4940 failed and the caller should emit a normal call. */
4942 static rtx
4944 {
4945 rtx op0;
4946 rtx result;
4949 HOST_WIDE_INT max_size;
4952 bool valid_arglist
4955 VOID_TYPE)
4965 {
4966 /* -Walloca-larger-than and -Wvla-larger-than settings override
4967 the more general -Walloc-size-larger-than so unless either of
4968 the former options is specified check the alloca arguments for
4969 overflow. */
4973 }
4975 /* Compute the argument. */
4978 /* Compute the alignment. */
4980 ? BIGGEST_ALIGNMENT
4983 /* Compute the maximum size. */
4988 /* Allocate the desired space. If the allocation stems from the declaration
4989 of a variable-sized object, it cannot accumulate. */
4990 result
4995 }
4997 /* Emit a call to __asan_allocas_unpoison call in EXP. Replace second argument
4998 of the call with virtual_stack_dynamic_rtx because in asan pass we emit a
4999 dummy value into second parameter relying on this function to perform the
5000 change. See motivation for this in comment to handle_builtin_stack_restore
5001 function. */
5003 static rtx
5005 {
5013 }
5015 /* Expand a call to bswap builtin in EXP.
5016 Return NULL_RTX if a normal call should be emitted rather than expanding the
5017 function in-line. If convenient, the result should be placed in TARGET.
5018 SUBTARGET may be used as the target for computing one of EXP's operands. */
5020 static rtx
5022 rtx subtarget)
5023 {
5024 tree arg;
5025 rtx op0;
5043 }
5045 /* Expand a call to a unary builtin in EXP.
5046 Return NULL_RTX if a normal call should be emitted rather than expanding the
5047 function in-line. If convenient, the result should be placed in TARGET.
5048 SUBTARGET may be used as the target for computing one of EXP's operands. */
5050 static rtx
5053 {
5054 rtx op0;
5059 /* Compute the argument. */
5061 (subtarget
5065 /* Compute op, into TARGET if possible.
5066 Set TARGET to wherever the result comes back. */
5072 }
5074 /* Expand a call to __builtin_expect. We just return our argument
5075 as the builtin_expect semantic should've been already executed by
5076 tree branch prediction pass. */
5078 static rtx
5080 {
5081 tree arg;
5088 /* When guessing was done, the hints should be already stripped away. */
5092 }
5094 /* Expand a call to __builtin_assume_aligned. We just return our first
5095 argument as the builtin_assume_aligned semantic should've been already
5096 executed by CCP. */
5098 static rtx
5100 {
5104 EXPAND_NORMAL);
5109 }
5111 void
5113 {
5115 {
5117 /* For trap insns when not accumulating outgoing args force
5118 REG_ARGS_SIZE note to prevent crossjumping of calls with
5119 different args sizes. */
5122 }
5123 else
5124 {
5128 }
5131 }
5133 /* Expand a call to __builtin_unreachable. We do nothing except emit
5134 a barrier saying that control flow will not pass here.
5136 It is the responsibility of the program being compiled to ensure
5137 that control flow does never reach __builtin_unreachable. */
5138 static void
5140 {
5142 }
5144 /* Expand EXP, a call to fabs, fabsf or fabsl.
5145 Return NULL_RTX if a normal call should be emitted rather than expanding
5146 the function inline. If convenient, the result should be placed
5147 in TARGET. SUBTARGET may be used as the target for computing
5148 the operand. */
5150 static rtx
5152 {
5153 machine_mode mode;
5154 tree arg;
5155 rtx op0;
5165 }
5167 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5168 Return NULL is a normal call should be emitted rather than expanding the
5169 function inline. If convenient, the result should be placed in TARGET.
5170 SUBTARGET may be used as the target for computing the operand. */
5172 static rtx
5174 {
5176 tree arg;
5188 }
5190 /* Expand a call to __builtin___clear_cache. */
5192 static rtx
5194 {
5196 {
5197 #ifdef CLEAR_INSN_CACHE
5198 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5199 does something. Just do the default expansion to a call to
5200 __clear_cache(). */
5202 #else
5203 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5204 does nothing. There is no need to call it. Do nothing. */
5207 }
5209 /* We have a "clear_cache" insn, and it will handle everything. */
5213 /* We must not expand to a library call. If we did, any
5214 fallback library function in libgcc that might contain a call to
5215 __builtin___clear_cache() would recurse infinitely. */
5217 {
5220 }
5223 {
5236 }
5238 }
5240 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5242 static rtx
5244 {
5247 /* If we don't need too much alignment, we'll have been guaranteed
5248 proper alignment by get_trampoline_type. */
5252 /* Round address up to desired boundary. */
5263 }
5265 static rtx
5267 {
5283 /* If ONSTACK, the TRAMP argument should be the address of a field
5284 within the local function's FRAME decl. Either way, let's see if
5285 we can fill in the MEM_ATTRs for this memory. */
5289 /* Creator of a heap trampoline is responsible for making sure the
5290 address is aligned to at least STACK_BOUNDARY. Normally malloc
5291 will ensure this anyhow. */
5294 {
5298 }
5300 /* The FUNC argument should be the address of the nested function.
5301 Extract the actual function decl to pass to the hook. */
5308 /* Generate insns to initialize the trampoline. */
5312 {
5318 }
5321 }
5323 static rtx
5325 {
5326 rtx tramp;
5337 }
5339 /* Expand a call to the builtin descriptor initialization routine.
5340 A descriptor is made up of a couple of pointers to the static
5341 chain and the code entry in this order. */
5343 static rtx
5345 {
5350 VOID_TYPE))
5364 /* Generate insns to initialize the descriptor. */
5370 }
5372 /* Expand a call to the builtin descriptor adjustment routine. */
5374 static rtx
5376 {
5377 rtx tramp;
5384 /* Unalign the descriptor to allow runtime identification. */
5389 }
5391 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5392 function. The function first checks whether the back end provides
5393 an insn to implement signbit for the respective mode. If not, it
5394 checks whether the floating point format of the value is such that
5395 the sign bit can be extracted. If that is not the case, error out.
5396 EXP is the expression that is a call to the builtin function; if
5397 convenient, the result should be placed in TARGET. */
5398 static rtx
5400 {
5402 scalar_float_mode fmode;
5404 tree arg;
5407 rtx temp;
5420 /* Expand the argument yielding a RTX expression. */
5423 /* Check if the back end provides an insn that handles signbit for the
5424 argument's mode. */
5427 {
5433 }
5435 /* For floating point formats without a sign bit, implement signbit
5436 as "ARG < 0.0". */
5439 {
5440 /* But we can't do this if the format supports signed zero. */
5446 }
5449 {
5452 }
5453 else
5454 {
5456 /* Handle targets with different FP word orders. */
5459 else
5463 }
5465 /* Force the intermediate word_mode (or narrower) result into a
5466 register. This avoids attempting to create paradoxical SUBREGs
5467 of floating point modes below. */
5470 /* If the bitpos is within the "result mode" lowpart, the operation
5471 can be implement with a single bitwise AND. Otherwise, we need
5472 a right shift and an AND. */
5475 {
5483 }
5484 else
5485 {
5486 /* Perform a logical right shift to place the signbit in the least
5487 significant bit, then truncate the result to the desired mode
5488 and mask just this bit. */
5493 }
5496 }
5498 /* Expand fork or exec calls. TARGET is the desired target of the
5499 call. EXP is the call. FN is the
5500 identificator of the actual function. IGNORE is nonzero if the
5501 value is to be ignored. */
5503 static rtx
5505 {
5507 tree call;
5509 /* If we are not profiling, just call the function. */
5513 /* Otherwise call the wrapper. This should be equivalent for the rest of
5514 compiler, so the code does not diverge, and the wrapper may run the
5515 code necessary for keeping the profiling sane. */
5518 {
5549 }
5561 }
5564 \f
5565 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5566 the pointer in these functions is void*, the tree optimizers may remove
5567 casts. The mode computed in expand_builtin isn't reliable either, due
5568 to __sync_bool_compare_and_swap.
5570 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5571 group of builtins. This gives us log2 of the mode size. */
5575 {
5576 /* The size is not negotiable, so ask not to get BLKmode in return
5577 if the target indicates that a smaller size would be better. */
5579 }
5581 /* Expand the memory expression LOC and return the appropriate memory operand
5582 for the builtin_sync operations. */
5584 static rtx
5586 {
5592 /* Note that we explicitly do not want any alias information for this
5593 memory, so that we kill all other live memories. Otherwise we don't
5594 satisfy the full barrier semantics of the intrinsic. */
5597 /* The alignment needs to be at least according to that of the mode. */
5604 }
5606 /* Make sure an argument is in the right mode.
5607 EXP is the tree argument.
5608 MODE is the mode it should be in. */
5610 static rtx
5612 {
5613 rtx val;
5614 machine_mode old_mode;
5617 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5618 of CONST_INTs, where we know the old_mode only from the call argument. */
5625 }
5628 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5629 EXP is the CALL_EXPR. CODE is the rtx code
5630 that corresponds to the arithmetic or logical operation from the name;
5631 an exception here is that NOT actually means NAND. TARGET is an optional
5632 place for us to store the results; AFTER is true if this is the
5633 fetch_and_xxx form. */
5635 static rtx
5638 rtx target)
5639 {
5644 {
5651 {
5680 }
5681 }
5683 /* Expand the operands. */
5688 after);
5689 }
5691 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5692 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5693 true if this is the boolean form. TARGET is a place for us to store the
5694 results; this is NOT optional if IS_BOOL is true. */
5696 static rtx
5699 {
5703 /* Expand the operands. */
5710 {
5713 else
5715 }
5718 MEMMODEL_SYNC_SEQ_CST))
5722 }
5724 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5725 general form is actually an atomic exchange, and some targets only
5726 support a reduced form with the second argument being a constant 1.
5727 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5728 the results. */
5730 static rtx
5732 rtx target)
5733 {
5736 /* Expand the operands. */
5741 }
5743 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5745 static void
5747 {
5748 rtx mem;
5750 /* Expand the operands. */
5754 }
5756 /* Given an integer representing an ``enum memmodel'', verify its
5757 correctness and return the memory model enum. */
5759 static enum memmodel
5761 {
5762 rtx op;
5764 source_location loc
5767 /* If the parameter is not a constant, it's a run time value so we'll just
5768 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5778 {
5782 }
5784 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5786 {
5790 }
5792 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5793 be conservative and promote consume to acquire. */
5798 }
5800 /* Expand the __atomic_exchange intrinsic:
5801 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5802 EXP is the CALL_EXPR.
5803 TARGET is an optional place for us to store the results. */
5805 static rtx
5807 {
5816 /* Expand the operands. */
5821 }
5823 /* Expand the __atomic_compare_exchange intrinsic:
5824 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5825 TYPE desired, BOOL weak,
5826 enum memmodel success,
5827 enum memmodel failure)
5828 EXP is the CALL_EXPR.
5829 TARGET is an optional place for us to store the results. */
5831 static rtx
5833 rtx target)
5834 {
5838 tree weak;
5840 source_location loc
5847 {
5849 "failure memory model cannot be stronger than success "
5852 }
5855 {
5857 "invalid failure memory model for "
5861 }
5867 /* Expand the operands. */
5883 /* Lest the rtl backend create a race condition with an imporoper store
5884 to memory, always create a new pseudo for OLDVAL. */
5891 /* Conditionally store back to EXPECT, lest we create a race condition
5892 with an improper store to memory. */
5893 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5894 the normal case where EXPECT is totally private, i.e. a register. At
5895 which point the store can be unconditional. */
5903 }
5905 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5906 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5907 call. The weak parameter must be dropped to match the expected parameter
5908 list and the expected argument changed from value to pointer to memory
5909 slot. */
5911 static void
5913 {
5929 /* Skip the boolean weak parameter. */
5932 built_in_function fncode
5937 fndecl);
5942 {
5949 }
5950 }
5952 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
5954 void
5956 {
5962 tree lhs;
5964 source_location loc
5971 {
5973 "failure memory model cannot be stronger than success "
5976 }
5979 {
5981 "invalid failure memory model for "
5985 }
5988 {
5991 }
5993 /* Expand the operands. */
6006 {
6009 }
6013 {
6019 }
6020 }
6022 /* Expand the __atomic_load intrinsic:
6023 TYPE __atomic_load (TYPE *object, enum memmodel)
6024 EXP is the CALL_EXPR.
6025 TARGET is an optional place for us to store the results. */
6027 static rtx
6029 {
6030 rtx mem;
6035 {
6036 source_location loc
6041 }
6046 /* Expand the operand. */
6050 }
6053 /* Expand the __atomic_store intrinsic:
6054 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6055 EXP is the CALL_EXPR.
6056 TARGET is an optional place for us to store the results. */
6058 static rtx
6060 {
6067 {
6068 source_location loc
6073 }
6078 /* Expand the operands. */
6083 }
6085 /* Expand the __atomic_fetch_XXX intrinsic:
6086 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6087 EXP is the CALL_EXPR.
6088 TARGET is an optional place for us to store the results.
6089 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6090 FETCH_AFTER is true if returning the result of the operation.
6091 FETCH_AFTER is false if returning the value before the operation.
6092 IGNORE is true if the result is not used.
6093 EXT_CALL is the correct builtin for an external call if this cannot be
6094 resolved to an instruction sequence. */
6096 static rtx
6100 {
6103 tree fndecl;
6104 tree addr;
6108 /* Expand the operands. */
6112 /* Only try generating instructions if inlining is turned on. */
6114 {
6118 }
6120 /* Return if a different routine isn't needed for the library call. */
6124 /* Change the call to the specified function. */
6132 /* If we will emit code after the call, the call can not be a tail call.
6133 If it is emitted as a tail call, a barrier is emitted after it, and
6134 then all trailing code is removed. */
6138 /* Expand the call here so we can emit trailing code. */
6141 /* Replace the original function just in case it matters. */
6144 /* Then issue the arithmetic correction to return the right result. */
6146 {
6148 {
6150 OPTAB_LIB_WIDEN);
6152 }
6153 else
6155 OPTAB_LIB_WIDEN);
6156 }
6158 }
6160 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6162 void
6164 {
6172 optab optab;
6184 {
6199 }
6202 {
6209 }
6231 {
6236 }
6237 else
6239 OPTAB_DIRECT);
6242 }
6244 /* Expand an atomic clear operation.
6245 void _atomic_clear (BOOL *obj, enum memmodel)
6246 EXP is the call expression. */
6248 static rtx
6250 {
6251 machine_mode mode;
6260 {
6261 source_location loc
6266 }
6268 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6269 Failing that, a store is issued by __atomic_store. The only way this can
6270 fail is if the bool type is larger than a word size. Unlikely, but
6271 handle it anyway for completeness. Assume a single threaded model since
6272 there is no atomic support in this case, and no barriers are required. */
6277 }
6279 /* Expand an atomic test_and_set operation.
6280 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6281 EXP is the call expression. */
6283 static rtx
6285 {
6286 rtx mem;
6288 machine_mode mode;
6295 }
6298 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6299 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6301 static tree
6303 {
6305 machine_mode mode;
6311 /* We need a corresponding integer mode for the access to be lock-free. */
6319 {
6322 /* Either this argument is null, or it's a fake pointer encoding
6323 the alignment of the object. */
6329 else
6331 }
6332 else
6333 {
6336 /* This function is usually invoked and folded immediately by the front
6337 end before anything else has a chance to look at it. The pointer
6338 parameter at this point is usually cast to a void *, so check for that
6339 and look past the cast. */
6349 /* Get the underlying type of the object. */
6352 }
6354 /* If the object has smaller alignment, the lock free routines cannot
6355 be used. */
6359 /* Check if a compare_and_swap pattern exists for the mode which represents
6360 the required size. The pattern is not allowed to fail, so the existence
6361 of the pattern indicates support is present. Also require that an
6362 atomic load exists for the required size. */
6365 else
6367 }
6369 /* Return true if the parameters to call EXP represent an object which will
6370 always generate lock free instructions. The first argument represents the
6371 size of the object, and the second parameter is a pointer to the object
6372 itself. If NULL is passed for the object, then the result is based on
6373 typical alignment for an object of the specified size. Otherwise return
6374 false. */
6376 static rtx
6378 {
6379 tree size;
6384 {
6387 }
6393 }
6395 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6396 is lock free on this architecture. */
6398 static tree
6400 {
6404 /* If it isn't always lock free, don't generate a result. */
6409 }
6411 /* Return true if the parameters to call EXP represent an object which will
6412 always generate lock free instructions. The first argument represents the
6413 size of the object, and the second parameter is a pointer to the object
6414 itself. If NULL is passed for the object, then the result is based on
6415 typical alignment for an object of the specified size. Otherwise return
6416 NULL*/
6418 static rtx
6420 {
6421 tree size;
6426 {
6429 }
6434 /* If the value is known at compile time, return the RTX for it. */
6440 }
6442 /* Expand the __atomic_thread_fence intrinsic:
6443 void __atomic_thread_fence (enum memmodel)
6444 EXP is the CALL_EXPR. */
6446 static void
6448 {
6451 }
6453 /* Expand the __atomic_signal_fence intrinsic:
6454 void __atomic_signal_fence (enum memmodel)
6455 EXP is the CALL_EXPR. */
6457 static void
6459 {
6462 }
6464 /* Expand the __sync_synchronize intrinsic. */
6466 static void
6468 {
6470 }
6472 static rtx
6474 {
6480 {
6482 /* If the target is not sutitable then create a new target. */
6490 }
6493 }
6495 static void
6497 {
6503 {
6510 }
6512 }
6514 \f
6515 /* Emit code to restore the current value of stack. */
6517 static void
6519 {
6531 }
6533 /* Emit code to save the current value of stack. */
6535 static rtx
6537 {
6542 }
6545 /* Expand an expression EXP that calls a built-in function,
6546 with result going to TARGET if that's convenient
6547 (and in mode MODE if that's convenient).
6548 SUBTARGET may be used as the target for computing one of EXP's operands.
6549 IGNORE is nonzero if the value is to be ignored. */
6551 rtx
6554 {
6563 /* When ASan is enabled, we don't want to expand some memory/string
6564 builtins and rely on libsanitizer's hooks. This allows us to avoid
6565 redundant checks and be sure, that possible overflow will be detected
6566 by ASan. */
6571 /* When not optimizing, generate calls to library functions for a certain
6572 set of builtins. */
6598 /* The built-in function expanders test for target == const0_rtx
6599 to determine whether the function's result will be ignored. */
6603 /* If the result of a pure or const built-in function is ignored, and
6604 none of its arguments are volatile, we can avoid expanding the
6605 built-in call and just evaluate the arguments for side-effects. */
6609 {
6611 tree arg;
6612 call_expr_arg_iterator iter;
6616 {
6619 }
6622 {
6626 }
6627 }
6629 /* expand_builtin_with_bounds is supposed to be used for
6630 instrumented builtin calls. */
6634 {
6652 /* Just do a normal library call if we were unable to fold
6653 the values. */
6730 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6731 FUNCTION with a copy of the parameters described by
6732 ARGUMENTS, and ARGSIZE. It returns a block of memory
6733 allocated on the stack into which is stored all the registers
6734 that might possibly be used for returning the result of a
6735 function. ARGUMENTS is the value returned by
6736 __builtin_apply_args. ARGSIZE is the number of bytes of
6737 arguments that must be copied. ??? How should this value be
6738 computed? We'll also need a safe worst case value for varargs
6739 functions. */
6746 else
6747 {
6755 }
6757 /* __builtin_return (RESULT) causes the function to return the
6758 value described by RESULT. RESULT is address of the block of
6759 memory returned by __builtin_apply. */
6769 /* All valid uses of __builtin_va_arg_pack () are removed during
6770 inlining. */
6775 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6776 inlining. */
6780 /* Return the address of the first anonymous stack arg. */
6802 /* Returns the address of the area where the structure is returned.
6803 0 otherwise. */
6809 else
6812 CASE_BUILT_IN_ALLOCA:
6975 {
6978 }
6982 /* This should have been lowered to the builtins below. */
6986 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6987 and the receiver label. */
6989 {
6995 /* This is copied from the handling of non-local gotos. */
6997 nonlocal_goto_handler_labels
6999 nonlocal_goto_handler_labels);
7000 /* ??? Do not let expand_label treat us as such since we would
7001 not want to be both on the list of non-local labels and on
7002 the list of forced labels. */
7005 }
7009 /* __builtin_setjmp_receiver is passed the receiver label. */
7011 {
7017 }
7020 /* __builtin_longjmp is passed a pointer to an array of five words.
7021 It's similar to the C library longjmp function but works with
7022 __builtin_setjmp above. */
7025 {
7031 {
7034 }
7038 }
7047 /* This updates the setjmp buffer that is its argument with the value
7048 of the current stack pointer. */
7051 {
7052 rtx buf_addr
7057 }
7077 /* Various hooks for the DWARF 2 __throw routine. */
7083 #ifdef DWARF2_UNWIND_INFO
7089 #endif
7289 mode = get_builtin_sync_mode
7301 mode = get_builtin_sync_mode
7348 {
7352 mode =
7358 /* If this is turned into an external library call, the weak parameter
7359 must be dropped to match the expected parameter list. */
7364 /* Skip the boolean weak parameter. */
7369 }
7398 {
7408 }
7414 {
7424 }
7430 {
7440 }
7446 {
7456 }
7462 {
7472 }
7478 {
7488 }
7643 /* We allow user CHKP builtins if Pointer Bounds
7644 Checker is off. */
7646 {
7657 else
7659 }
7660 /* FALLTHROUGH */
7672 /* Software implementation of Pointer Bounds Checker is NYI.
7673 Target support is required. */
7678 /* Do library call, if we failed to expand the builtin when
7679 folding. */
7684 }
7686 /* The switch statement above can drop through to cause the function
7687 to be called normally. */
7689 }
7691 /* Similar to expand_builtin but is used for instrumented calls. */
7693 rtx
7695 rtx subtarget ATTRIBUTE_UNUSED,
7697 {
7710 {
7731 }
7733 /* The switch statement above can drop through to cause the function
7734 to be called normally. */
7736 }
7738 /* Determine whether a tree node represents a call to a built-in
7739 function. If the tree T is a call to a built-in function with
7740 the right number of arguments of the appropriate types, return
7741 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7742 Otherwise the return value is END_BUILTINS. */
7744 enum built_in_function
7746 {
7749 const_call_expr_arg_iterator iter;
7765 {
7766 /* If a function doesn't take a variable number of arguments,
7767 the last element in the list will have type `void'. */
7770 {
7774 }
7783 {
7786 }
7788 {
7791 }
7793 {
7796 }
7798 {
7801 }
7802 else
7804 }
7806 /* Variable-length argument list. */
7808 }
7810 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7811 evaluate to a constant. */
7813 static tree
7815 {
7816 /* We return 1 for a numeric type that's known to be a constant
7817 value at compile-time or for an aggregate type that's a
7818 literal constant. */
7821 /* If we know this is a constant, emit the constant of one. */
7827 {
7834 }
7836 /* If this expression has side effects, show we don't know it to be a
7837 constant. Likewise if it's a pointer or aggregate type since in
7838 those case we only want literals, since those are only optimized
7839 when generating RTL, not later.
7840 And finally, if we are compiling an initializer, not code, we
7841 need to return a definite result now; there's not going to be any
7842 more optimization done. */
7847 || folding_initializer
7852 }
7854 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7855 return it as a truthvalue. */
7857 static tree
7859 tree predictor)
7860 {
7872 predictor);
7876 }
7878 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7879 NULL_TREE if no simplification is possible. */
7881 tree
7883 {
7887 /* Distribute the expected value over short-circuiting operators.
7888 See through the cast from truthvalue_type_node to long. */
7895 /* If this is a builtin_expect within a builtin_expect keep the
7896 inner one. See through a comparison against a constant. It
7897 might have been added to create a thruthvalue. */
7913 {
7922 }
7924 /* If the argument isn't invariant then there's nothing else we can do. */
7928 /* If we expect that a comparison against the argument will fold to
7929 a constant return the constant. In practice, this means a true
7930 constant or the address of a non-weak symbol. */
7934 {
7935 do
7936 {
7938 }
7943 }
7945 /* Otherwise, ARG0 already has the proper type for the return value. */
7947 }
7949 /* Fold a call to __builtin_classify_type with argument ARG. */
7951 static tree
7953 {
7958 }
7960 /* Fold a call to __builtin_strlen with argument ARG. */
7962 static tree
7964 {
7967 else
7968 {
7975 }
7976 }
7978 /* Fold a call to __builtin_inf or __builtin_huge_val. */
7980 static tree
7982 {
7983 REAL_VALUE_TYPE real;
7985 /* __builtin_inff is intended to be usable to define INFINITY on all
7986 targets. If an infinity is not available, INFINITY expands "to a
7987 positive constant of type float that overflows at translation
7988 time", footnote "In this case, using INFINITY will violate the
7989 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
7990 Thus we pedwarn to ensure this constraint violation is
7991 diagnosed. */
7997 }
7999 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8000 NULL_TREE if no simplification can be made. */
8002 static tree
8005 {
8006 tree type;
8016 /* Calculate the result when the argument is a constant. */
8021 /* Canonicalize sincos to cexpi. */
8023 {
8026 }
8028 {
8035 }
8044 }
8046 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8047 Return NULL_TREE if no simplification can be made. */
8049 static tree
8051 {
8057 /* If the LEN parameter is zero, return zero. */
8062 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8066 /* If len parameter is one, return an expression corresponding to
8067 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8069 {
8071 tree cst_uchar_ptr_node
8074 tree ind1
8078 cst_uchar_ptr_node,
8079 arg1)));
8080 tree ind2
8084 cst_uchar_ptr_node,
8085 arg2)));
8087 }
8090 }
8092 /* Fold a call to builtin isascii with argument ARG. */
8094 static tree
8096 {
8099 else
8100 {
8101 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8107 }
8108 }
8110 /* Fold a call to builtin toascii with argument ARG. */
8112 static tree
8114 {
8118 /* Transform toascii(c) -> (c & 0x7f). */
8121 }
8123 /* Fold a call to builtin isdigit with argument ARG. */
8125 static tree
8127 {
8130 else
8131 {
8132 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8133 /* According to the C standard, isdigit is unaffected by locale.
8134 However, it definitely is affected by the target character set. */
8135 unsigned HOST_WIDE_INT target_digit0
8146 }
8147 }
8149 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8151 static tree
8153 {
8159 }
8161 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8163 static tree
8165 {
8171 }
8173 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
8175 static tree
8177 {
8178 /* ??? Only expand to FMA_EXPR if it's directly supported. */
8186 }
8188 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8190 static tree
8192 {
8195 {
8199 {
8204 }
8205 }
8208 }
8210 /* Fold a call to builtin frexp, we can assume the base is 2. */
8212 static tree
8214 {
8225 /* Proceed if a valid pointer type was passed in. */
8227 {
8232 {
8234 /* For +-0, return (*exp = 0, +-0). */
8240 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8243 {
8244 /* Since the frexp function always expects base 2, and in
8245 GCC normalized significands are already in the range
8246 [0.5, 1.0), we have exactly what frexp wants. */
8251 }
8255 }
8257 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8261 }
8264 }
8266 /* Fold a call to builtin modf. */
8268 static tree
8270 {
8281 /* Proceed if a valid pointer type was passed in. */
8283 {
8288 {
8291 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8295 /* For +-Inf, return (*arg1 = arg0, +-0). */
8301 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8304 /* If the original number was negative and already
8305 integral, then the fractional part is -0.0. */
8309 }
8311 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8317 }
8320 }
8322 /* Given a location LOC, an interclass builtin function decl FNDECL
8323 and its single argument ARG, return an folded expression computing
8324 the same, or NULL_TREE if we either couldn't or didn't want to fold
8325 (the latter happen if there's an RTL instruction available). */
8327 static tree
8329 {
8330 machine_mode mode;
8342 /* If there is no optab, try generic code. */
8344 {
8345 tree result;
8348 {
8349 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8352 REAL_VALUE_TYPE r;
8356 {
8357 /* NaN and Inf are encoded in the high-order double value
8358 only. The low-order value is not significant. */
8362 }
8369 }
8372 {
8373 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8376 REAL_VALUE_TYPE r;
8380 {
8381 /* NaN and Inf are encoded in the high-order double value
8382 only. The low-order value is not significant. */
8386 }
8392 /*result = fold_build2_loc (loc, UNGT_EXPR,
8393 TREE_TYPE (TREE_TYPE (fndecl)),
8394 fold_build1_loc (loc, ABS_EXPR, type, arg),
8395 build_real (type, r));
8396 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8397 TREE_TYPE (TREE_TYPE (fndecl)),
8398 result);*/
8400 }
8402 {
8403 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8404 islessequal(fabs(x),DBL_MAX). */
8414 {
8415 /* Use double to test the normal range of IBM extended
8416 precision. Emin for IBM extended precision is
8417 different to emin for IEEE double, being 53 higher
8418 since the low double exponent is at least 53 lower
8419 than the high double exponent. */
8423 }
8435 {
8436 /* Testing the high end of the range is done just using
8437 the high double, using the same test as isfinite().
8438 For the subnormal end of the range we first test the
8439 high double, then if its magnitude is equal to the
8440 limit of 0x1p-969, we test whether the low double is
8441 non-zero and opposite sign to the high double. */
8457 integer_type_node,
8463 }
8464 else
8465 {
8466 tree const isge_fn
8469 }
8473 }
8476 }
8479 }
8481 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8482 ARG is the argument for the call. */
8484 static tree
8486 {
8493 {
8501 {
8502 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8503 /* In a boolean context, GCC will fold the inner COND_EXPR to
8504 1. So e.g. "if (isinf_sign(x))" would be folded to just
8505 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8513 {
8526 integer_zero_node);
8527 }
8530 }
8543 {
8546 {
8547 /* NaN and Inf are encoded in the high-order double value
8548 only. The low-order value is not significant. */
8550 }
8551 }
8557 }
8558 }
8560 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8561 This builtin will generate code to return the appropriate floating
8562 point classification depending on the value of the floating point
8563 number passed in. The possible return values must be supplied as
8564 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8565 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8566 one floating point argument which is "type generic". */
8568 static tree
8570 {
8573 machine_mode mode;
8574 REAL_VALUE_TYPE r;
8577 /* Verify the required arguments in the original call. */
8597 /* fpclassify(x) ->
8598 isnan(x) ? FP_NAN :
8599 (fabs(x) == Inf ? FP_INFINITE :
8600 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8601 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8615 {
8621 }
8624 {
8627 }
8630 }
8632 /* Fold a call to an unordered comparison function such as
8633 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8634 being called and ARG0 and ARG1 are the arguments for the call.
8635 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8636 the opposite of the desired result. UNORDERED_CODE is used
8637 for modes that can hold NaNs and ORDERED_CODE is used for
8638 the rest. */
8640 static tree
8644 {
8658 /* Choose the wider of two real types. */
8670 {
8674 }
8679 }
8681 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8682 arithmetics if it can never overflow, or into internal functions that
8683 return both result of arithmetics and overflowed boolean flag in
8684 a complex integer result, or some other check for overflow.
8685 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8686 checking part of that. */
8688 static tree
8691 {
8693 /* The code of the expression corresponding to the type-generic
8694 built-in, or ERROR_MARK for the type-specific ones. */
8699 {
8702 /* FALLTHRU */
8705 /* FALLTHRU */
8716 /* FALLTHRU */
8719 /* FALLTHRU */
8730 /* FALLTHRU */
8733 /* FALLTHRU */
8744 }
8746 /* For the "generic" overloads, the first two arguments can have different
8747 types and the last argument determines the target type to use to check
8748 for overflow. The arguments of the other overloads all have the same
8749 type. */
8752 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8753 arguments are constant, attempt to fold the built-in call into a constant
8754 expression indicating whether or not it detected an overflow. */
8758 /* Perform the computation in the target type and check for overflow. */
8762 arg2);
8776 tree store
8779 }
8781 /* Fold a call to __builtin_FILE to a constant string. */
8785 {
8790 }
8792 /* Fold a call to __builtin_FUNCTION to a constant string. */
8796 {
8803 }
8805 /* Fold a call to __builtin_LINE to an integer constant. */
8809 {
8811 }
8813 /* Fold a call to built-in function FNDECL with 0 arguments.
8814 This function returns NULL_TREE if no simplification was possible. */
8816 static tree
8818 {
8822 {
8848 }
8850 }
8852 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8853 This function returns NULL_TREE if no simplification was possible. */
8855 static tree
8857 {
8868 {
8870 {
8873 /* Gimplification will pull the CALL_EXPR for the builtin out of
8874 an if condition. When not optimizing, we'll not CSE it back.
8875 To avoid link error types of regressions, return false now. */
8880 }
8936 {
8941 }
8947 {
8952 }
8973 }
8977 }
8979 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
8980 This function returns NULL_TREE if no simplification was possible. */
8982 static tree
8984 {
8996 {
9040 NOP_EXPR);
9042 /* We do the folding for va_start in the expander. */
9057 }
9059 }
9061 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9062 and ARG2.
9063 This function returns NULL_TREE if no simplification was possible. */
9065 static tree
9068 {
9082 {
9132 }
9134 }
9136 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9137 arguments. IGNORE is true if the result of the
9138 function call is ignored. This function returns NULL_TREE if no
9139 simplification was possible. */
9141 tree
9143 {
9147 {
9163 }
9165 {
9170 }
9172 }
9174 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9175 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9176 of arguments in ARGS to be omitted. OLDNARGS is the number of
9177 elements in ARGS. */
9179 static tree
9182 {
9187 {
9195 }
9196 else
9200 }
9202 /* Return true if FNDECL shouldn't be folded right now.
9203 If a built-in function has an inline attribute always_inline
9204 wrapper, defer folding it after always_inline functions have
9205 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9206 might not be performed. */
9208 bool
9210 {
9213 && cfun
9216 }
9218 /* A wrapper function for builtin folding that prevents warnings for
9219 "statement without effect" and the like, caused by removing the
9220 call node earlier than the warning is generated. */
9222 tree
9224 {
9230 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9231 yet. Defer folding until we see all the arguments
9232 (after inlining). */
9234 {
9237 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9238 instead last argument is __builtin_va_arg_pack (). Defer folding
9239 even in that case, until arguments are finalized. */
9241 {
9248 }
9256 else
9257 {
9262 }
9263 }
9265 }
9267 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9268 N arguments are passed in the array ARGARRAY. Return a folded
9269 expression or NULL_TREE if no simplification was possible. */
9271 tree
9273 tree fn,
9276 {
9283 {
9284 /* If last argument is __builtin_va_arg_pack (), arguments to this
9285 function are not finalized yet. Defer folding until they are. */
9287 {
9294 }
9299 else
9301 }
9304 }
9306 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9307 along with N new arguments specified as the "..." parameters. SKIP
9308 is the number of arguments in EXP to be omitted. This function is used
9309 to do varargs-to-varargs transformations. */
9311 static tree
9313 {
9315 tree t;
9323 }
9325 /* Validate a single argument ARG against a tree code CODE representing
9326 a type. Return true when argument is valid. */
9328 static bool
9330 {
9338 }
9340 /* This function validates the types of a function call argument list
9341 against a specified list of tree_codes. If the last specifier is a 0,
9342 that represents an ellipses, otherwise the last specifier must be a
9343 VOID_TYPE.
9345 This is the GIMPLE version of validate_arglist. Eventually we want to
9346 completely convert builtins.c to work from GIMPLEs and the tree based
9347 validate_arglist will then be removed. */
9349 bool
9351 {
9355 const_tree arg;
9361 do
9362 {
9365 {
9367 /* This signifies an ellipses, any further arguments are all ok. */
9371 /* This signifies an endlink, if no arguments remain, return
9372 true, otherwise return false. */
9376 /* If no parameters remain or the parameter's code does not
9377 match the specified code, return false. Otherwise continue
9378 checking any remaining arguments. */
9383 }
9384 }
9387 /* We need gotos here since we can only have one VA_CLOSE in a
9388 function. */
9389 end: ;
9393 }
9395 /* Default target-specific builtin expander that does nothing. */
9397 rtx
9399 rtx target ATTRIBUTE_UNUSED,
9400 rtx subtarget ATTRIBUTE_UNUSED,
9401 machine_mode mode ATTRIBUTE_UNUSED,
9403 {
9405 }
9407 /* Returns true is EXP represents data that would potentially reside
9408 in a readonly section. */
9410 bool
9412 {
9422 /* Make sure we call decl_readonly_section only for trees it
9423 can handle (since it returns true for everything it doesn't
9424 understand). */
9429 else
9431 }
9433 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9434 to the call, and TYPE is its return type.
9436 Return NULL_TREE if no simplification was possible, otherwise return the
9437 simplified form of the call as a tree.
9439 The simplified form may be a constant or other expression which
9440 computes the same value, but in a more efficient manner (including
9441 calls to other builtin functions).
9443 The call may contain arguments which need to be evaluated, but
9444 which are not useful to determine the result of the call. In
9445 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9446 COMPOUND_EXPR will be an argument which must be evaluated.
9447 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9448 COMPOUND_EXPR in the chain will contain the tree for the simplified
9449 form of the builtin function call. */
9451 static tree
9453 {
9457 else
9458 {
9459 tree fn;
9468 {
9470 tree tem;
9475 /* Return an offset into the constant string argument. */
9478 }
9481 /* strpbrk(x, "") == NULL.
9482 Evaluate and ignore s1 in case it had side-effects. */
9492 /* New argument list transforming strpbrk(s1, s2) to
9493 strchr(s1, s2[0]). */
9496 }
9497 }
9499 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9500 to the call.
9502 Return NULL_TREE if no simplification was possible, otherwise return the
9503 simplified form of the call as a tree.
9505 The simplified form may be a constant or other expression which
9506 computes the same value, but in a more efficient manner (including
9507 calls to other builtin functions).
9509 The call may contain arguments which need to be evaluated, but
9510 which are not useful to determine the result of the call. In
9511 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9512 COMPOUND_EXPR will be an argument which must be evaluated.
9513 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9514 COMPOUND_EXPR in the chain will contain the tree for the simplified
9515 form of the builtin function call. */
9517 static tree
9519 {
9523 else
9524 {
9527 /* If either argument is "", return NULL_TREE. */
9529 /* Evaluate and ignore both arguments in case either one has
9530 side-effects. */
9534 }
9535 }
9537 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9538 to the call.
9540 Return NULL_TREE if no simplification was possible, otherwise return the
9541 simplified form of the call as a tree.
9543 The simplified form may be a constant or other expression which
9544 computes the same value, but in a more efficient manner (including
9545 calls to other builtin functions).
9547 The call may contain arguments which need to be evaluated, but
9548 which are not useful to determine the result of the call. In
9549 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9550 COMPOUND_EXPR will be an argument which must be evaluated.
9551 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9552 COMPOUND_EXPR in the chain will contain the tree for the simplified
9553 form of the builtin function call. */
9555 static tree
9557 {
9561 else
9562 {
9563 /* If the first argument is "", return NULL_TREE. */
9566 {
9567 /* Evaluate and ignore argument s2 in case it has
9568 side-effects. */
9571 }
9573 /* If the second argument is "", return __builtin_strlen(s1). */
9576 {
9579 /* If the replacement _DECL isn't initialized, don't do the
9580 transformation. */
9585 }
9587 }
9588 }
9590 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9591 produced. False otherwise. This is done so that we don't output the error
9592 or warning twice or three times. */
9594 bool
9596 {
9599 tree arg;
9600 /* There is good chance the current input_location points inside the
9601 definition of the va_start macro (perhaps on the token for
9602 builtin) in a system header, so warnings will not be emitted.
9603 Use the location in real source code. */
9604 source_location current_location =
9606 NULL);
9609 {
9612 }
9615 {
9617 {
9620 }
9622 }
9623 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9624 when we checked the arguments and if needed issued a warning. */
9625 else
9626 {
9628 {
9629 /* Evidently an out of date version of <stdarg.h>; can't validate
9630 va_start's second argument, but can still work as intended. */
9632 OPT_Wvarargs,
9635 }
9637 {
9640 }
9642 }
9647 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9648 or __builtin_next_arg (0) the first time we see it, after checking
9649 the arguments and if needed issuing a warning. */
9651 {
9654 /* Strip off all nops for the sake of the comparison. This
9655 is not quite the same as STRIP_NOPS. It does more.
9656 We must also strip off INDIRECT_EXPR for C++ reference
9657 parameters. */
9662 {
9663 /* FIXME: Sometimes with the tree optimizers we can get the
9664 not the last argument even though the user used the last
9665 argument. We just warn and set the arg to be the last
9666 argument so that we will get wrong-code because of
9667 it. */
9669 OPT_Wvarargs,
9671 }
9673 /* Undefined by C99 7.15.1.4p4 (va_start):
9674 "If the parameter parmN is declared with the register storage
9675 class, with a function or array type, or with a type that is
9676 not compatible with the type that results after application of
9677 the default argument promotions, the behavior is undefined."
9678 */
9680 {
9682 OPT_Wvarargs,
9683 "undefined behavior when second parameter of "
9685 }
9687 /* We want to verify the second parameter just once before the tree
9688 optimizers are run and then avoid keeping it in the tree,
9689 as otherwise we could warn even for correct code like:
9690 void foo (int i, ...)
9691 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9694 else
9696 }
9698 }
9701 /* Expand a call EXP to __builtin_object_size. */
9703 static rtx
9705 {
9706 tree ost;
9711 {
9716 }
9724 {
9729 }
9734 }
9736 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9737 FCODE is the BUILT_IN_* to use.
9738 Return NULL_RTX if we failed; the caller should emit a normal call,
9739 otherwise try to get the result in TARGET, if convenient (and in
9740 mode MODE if that's convenient). */
9742 static rtx
9745 {
9749 POINTER_TYPE,
9750 fcode == BUILT_IN_MEMSET_CHK
9768 {
9769 /* Avoid transforming the checking call to an ordinary one when
9770 an overflow has been detected or when the call couldn't be
9771 validated because the size is not constant. */
9776 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9777 mem{cpy,pcpy,move,set} is available. */
9779 {
9794 }
9803 }
9806 else
9807 {
9810 /* If DEST is not a pointer type, call the normal function. */
9814 /* If SRC and DEST are the same (and not volatile), do nothing. */
9816 {
9817 tree expr;
9820 {
9821 /* Evaluate and ignore LEN in case it has side-effects. */
9824 }
9828 }
9830 /* __memmove_chk special case. */
9832 {
9838 /* If src is categorized for a readonly section we can use
9839 normal __memcpy_chk. */
9841 {
9850 }
9851 }
9853 }
9854 }
9856 /* Emit warning if a buffer overflow is detected at compile time. */
9858 static void
9860 {
9861 /* The source string. */
9863 /* The size of the destination object. */
9865 /* The string that is being concatenated with (as in __strcat_chk)
9866 or null if it isn't. */
9868 /* The maximum length of the source sequence in a bounded operation
9869 (such as __strncat_chk) or null if the operation isn't bounded
9870 (such as __strcat_chk). */
9874 {
9882 /* For __strcat_chk the warning will be emitted only if overflowing
9883 by at least strlen (dest) + 1 bytes. */
9910 }
9913 {
9914 /* Check __strncat_chk. There is no way to determine the length
9915 of the string to which the source string is being appended so
9916 just warn when the length of the source string is not known. */
9919 }
9923 }
9925 /* Emit warning if a buffer overflow is detected at compile time
9926 in __sprintf_chk/__vsprintf_chk calls. */
9928 static void
9930 {
9935 /* Verify the required arguments in the original call. */
9945 /* Check whether the format is a literal string constant. */
9953 /* If the format doesn't contain % args or %%, we know its size. */
9956 /* If the format is "%s" and first ... argument is a string literal,
9957 we know it too. */
9960 {
9961 tree arg;
9972 }
9973 else
9976 /* Add one for the terminating nul. */
9980 }
9982 /* Emit warning if a free is called with address of a variable. */
9984 static void
9986 {
10000 else
10003 }
10005 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10006 if possible. */
10008 static tree
10010 {
10027 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10028 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10029 and (size_t) 0 for types 2 and 3. */
10034 {
10038 }
10040 {
10041 /* If object size is not known yet, delay folding until
10042 later. Maybe subsequent passes will help determining
10043 it. */
10047 }
10050 }
10052 /* Builtins with folding operations that operate on "..." arguments
10053 need special handling; we need to store the arguments in a convenient
10054 data structure before attempting any folding. Fortunately there are
10055 only a few builtins that fall into this category. FNDECL is the
10056 function, EXP is the CALL_EXPR for the call. */
10058 static tree
10060 {
10065 {
10072 }
10074 {
10079 }
10081 }
10083 /* Initialize format string characters in the target charset. */
10085 bool
10087 {
10090 {
10113 }
10115 }
10117 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10118 and no overflow/underflow occurred. INEXACT is true if M was not
10119 exactly calculated. TYPE is the tree type for the result. This
10120 function assumes that you cleared the MPFR flags and then
10121 calculated M to see if anything subsequently set a flag prior to
10122 entering this function. Return NULL_TREE if any checks fail. */
10124 static tree
10126 {
10127 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10128 overflow/underflow occurred. If -frounding-math, proceed iff the
10129 result of calling FUNC was exact. */
10132 {
10133 REAL_VALUE_TYPE rr;
10136 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10137 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10138 but the mpft_t is not, then we underflowed in the
10139 conversion. */
10142 {
10143 REAL_VALUE_TYPE rmode;
10146 /* Proceed iff the specified mode can hold the value. */
10149 }
10150 }
10152 }
10154 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10155 number and no overflow/underflow occurred. INEXACT is true if M
10156 was not exactly calculated. TYPE is the tree type for the result.
10157 This function assumes that you cleared the MPFR flags and then
10158 calculated M to see if anything subsequently set a flag prior to
10159 entering this function. Return NULL_TREE if any checks fail, if
10160 FORCE_CONVERT is true, then bypass the checks. */
10162 static tree
10164 {
10165 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10166 overflow/underflow occurred. If -frounding-math, proceed iff the
10167 result of calling FUNC was exact. */
10172 {
10177 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10178 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10179 but the mpft_t is not, then we underflowed in the
10180 conversion. */
10185 {
10190 /* Proceed iff the specified mode can hold the value. */
10196 }
10197 }
10199 }
10201 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10202 the pointer *(ARG_QUO) and return the result. The type is taken
10203 from the type of ARG0 and is used for setting the precision of the
10204 calculation and results. */
10206 static tree
10208 {
10215 /* To proceed, MPFR must exactly represent the target floating point
10216 format, which only happens when the target base equals two. */
10220 {
10225 {
10229 tree result_rem;
10238 /* Remquo is independent of the rounding mode, so pass
10239 inexact=0 to do_mpfr_ckconv(). */
10243 {
10244 /* MPFR calculates quo in the host's long so it may
10245 return more bits in quo than the target int can hold
10246 if sizeof(host long) > sizeof(target int). This can
10247 happen even for native compilers in LP64 mode. In
10248 these cases, modulo the quo value with the largest
10249 number that the target int can hold while leaving one
10250 bit for the sign. */
10254 /* Dereference the quo pointer argument. */
10256 /* Proceed iff a valid pointer type was passed in. */
10258 {
10259 /* Set the value. */
10260 tree result_quo
10263 integer_quo));
10265 /* Combine the quo assignment with the rem. */
10268 }
10269 }
10270 }
10271 }
10273 }
10275 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10276 resulting value as a tree with type TYPE. The mpfr precision is
10277 set to the precision of TYPE. We assume that this mpfr function
10278 returns zero if the result could be calculated exactly within the
10279 requested precision. In addition, the integer pointer represented
10280 by ARG_SG will be dereferenced and set to the appropriate signgam
10281 (-1,1) value. */
10283 static tree
10285 {
10290 /* To proceed, MPFR must exactly represent the target floating point
10291 format, which only happens when the target base equals two. Also
10292 verify ARG is a constant and that ARG_SG is an int pointer. */
10297 {
10300 /* In addition to NaN and Inf, the argument cannot be zero or a
10301 negative integer. */
10305 {
10310 mpfr_t m;
10311 tree result_lg;
10320 {
10321 tree result_sg;
10323 /* Dereference the arg_sg pointer argument. */
10325 /* Assign the signgam value into *arg_sg. */
10330 /* Combine the signgam assignment with the lgamma result. */
10333 }
10334 }
10335 }
10338 }
10340 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10341 mpc function FUNC on it and return the resulting value as a tree
10342 with type TYPE. The mpfr precision is set to the precision of
10343 TYPE. We assume that function FUNC returns zero if the result
10344 could be calculated exactly within the requested precision. If
10345 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10346 in the arguments and/or results. */
10348 tree
10351 {
10357 /* To proceed, MPFR must exactly represent the target floating point
10358 format, which only happens when the target base equals two. */
10364 {
10373 {
10393 }
10394 }
10397 }
10399 /* A wrapper function for builtin folding that prevents warnings for
10400 "statement without effect" and the like, caused by removing the
10401 call node earlier than the warning is generated. */
10403 tree
10405 {
10413 {
10422 {
10424 }
10425 else
10426 {
10429 {
10430 /* Propagate location information from original call to
10431 expansion of builtin. Otherwise things like
10432 maybe_emit_chk_warning, that operate on the expansion
10433 of a builtin, will use the wrong location information. */
10435 {
10443 }
10445 }
10446 }
10447 }
10449 }
10451 /* Look up the function in builtin_decl that corresponds to DECL
10452 and set ASMSPEC as its user assembler name. DECL must be a
10453 function decl that declares a builtin. */
10455 void
10457 {
10467 {
10471 }
10472 }
10474 /* Return true if DECL is a builtin that expands to a constant or similarly
10475 simple code. */
10476 bool
10478 {
10481 {
10482 /* Builtins that expand to constants. */
10487 /* Simple register moves or loads from stack. */
10498 /* Exception state returns or moves registers around. */
10506 }
10509 }
10511 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10512 most probably expanded inline into reasonably simple code. This is a
10513 superset of is_simple_builtin. */
10514 bool
10516 {
10523 {
10525 CASE_BUILT_IN_ALLOCA:
10591 }
10594 }
10596 /* Return true if T is a constant and the value cast to a target char
10597 can be represented by a host char.
10598 Store the casted char constant in *P if so. */
10600 bool
10602 {
10608 }