| blob | b97445920170c1bc9b7220442b68d00dc49dde7f |
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 /* Check to see if the argument was declared attribute nonstring
2889 and if so, issue a warning since at this point it's not known
2890 to be nul-terminated. */
2893 /* Now that we are assured of success, expand the source. */
2897 {
2898 #ifdef POINTERS_EXTEND_UNSIGNED
2901 POINTERS_EXTEND_UNSIGNED);
2902 #endif
2904 }
2910 else
2913 /* Return the value in the proper mode for this function. */
2918 else
2922 }
2923 }
2925 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2926 bytes from constant string DATA + OFFSET and return it as target
2927 constant. */
2929 static rtx
2931 scalar_int_mode mode)
2932 {
2940 }
2942 /* LEN specify length of the block of memcpy/memset operation.
2943 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2944 In some cases we can make very likely guess on max size, then we
2945 set it into PROBABLE_MAX_SIZE. */
2947 static void
2952 {
2954 {
2957 }
2958 else
2959 {
2963 /* Determine bounds from the type. */
2966 else
2971 else
2977 {
2982 }
2984 {
2985 /* Anti range 0...N lets us to determine minimal size to N+1. */
2987 {
2990 }
2991 /* Code like
2993 int n;
2994 if (n < 100)
2995 memcpy (a, b, n)
2997 Produce anti range allowing negative values of N. We still
2998 can use the information and make a guess that N is not negative.
2999 */
3002 }
3003 }
3007 }
3009 /* Try to verify that the sizes and lengths of the arguments to a string
3010 manipulation function given by EXP are within valid bounds and that
3011 the operation does not lead to buffer overflow. Arguments other than
3012 EXP may be null. When non-null, the arguments have the following
3013 meaning:
3014 SIZE is the user-supplied size argument to the function (such as in
3015 memcpy(d, s, SIZE) or strncpy(d, s, SIZE). It specifies the exact
3016 number of bytes to write.
3017 MAXLEN is the user-supplied bound on the length of the source sequence
3018 (such as in strncat(d, s, N). It specifies the upper limit on the number
3019 of bytes to write.
3020 SRC is the source string (such as in strcpy(d, s)) when the expression
3021 EXP is a string function call (as opposed to a memory call like memcpy).
3022 As an exception, SRC can also be an integer denoting the precomputed
3023 size of the source string or object (for functions like memcpy).
3024 OBJSIZE is the size of the destination object specified by the last
3025 argument to the _chk builtins, typically resulting from the expansion
3026 of __builtin_object_size (such as in __builtin___strcpy_chk(d, s,
3027 OBJSIZE).
3029 When SIZE is null LEN is checked to verify that it doesn't exceed
3030 SIZE_MAX.
3032 If the call is successfully verified as safe from buffer overflow
3033 the function returns true, otherwise false.. */
3035 static bool
3037 {
3038 /* The size of the largest object is half the address space, or
3039 SSIZE_MAX. (This is way too permissive.) */
3046 /* Set to true when the exact number of bytes written by a string
3047 function like strcpy is not known and the only thing that is
3048 known is that it must be at least one (for the terminating nul). */
3051 {
3052 /* SRC is normally a pointer to string but as a special case
3053 it can be an integer denoting the length of a string. */
3055 {
3056 /* Try to determine the range of lengths the source string
3057 refers to. If it can be determined and is less than
3058 the upper bound given by MAXLEN add one to it for
3059 the terminating nul. Otherwise, set it to one for
3060 the same reason, or to MAXLEN as appropriate. */
3063 {
3066 else
3077 }
3078 else
3079 {
3082 }
3083 }
3084 else
3086 }
3089 {
3090 /* When the only available piece of data is the object size
3091 there is nothing to do. */
3095 /* Otherwise, when the length of the source sequence is known
3096 (as with with strlen), set SIZE to it. */
3099 }
3104 /* The SIZE is exact if it's non-null, constant, and in range of
3105 unsigned HOST_WIDE_INT. */
3111 /* First check the number of bytes to be written against the maximum
3112 object size. */
3114 {
3120 "%K%qD specified size %E "
3123 else
3125 "%K%qD specified size between %E and %E "
3130 }
3132 /* Next check the number of bytes to be written against the destination
3133 object size. */
3135 {
3141 {
3146 {
3147 /* This is a call to strcpy with a destination of 0 size
3148 and a source of unknown length. The call will write
3149 at least one byte past the end of the destination. */
3151 "%K%qD writing %E or more bytes into a region "
3154 }
3164 {
3165 /* Avoid printing the upper bound if it's invalid. */
3167 "%K%qD writing %E or more bytes into a region "
3170 }
3171 else
3173 "%K%qD writing between %E and %E bytes into "
3176 objsize);
3178 /* Return error when an overflow has been detected. */
3180 }
3181 }
3183 /* Check the maximum length of the source sequence against the size
3184 of the destination object if known, or against the maximum size
3185 of an object. */
3187 {
3191 {
3196 {
3197 /* Warn about crazy big sizes first since that's more
3198 likely to be meaningful than saying that the bound
3199 is greater than the object size if both are big. */
3202 "%K%qD specified bound %E "
3206 else
3208 "%K%qD specified bound between %E and %E "
3214 }
3217 {
3220 "%K%qD specified bound %E "
3224 else
3226 "%K%qD specified bound between %E and %E "
3231 }
3232 }
3233 }
3239 {
3249 {
3250 /* Avoid printing the upper bound if it's invalid. */
3252 "%K%qD reading %E or more bytes from a region "
3255 }
3256 else
3258 "%K%qD reading between %E and %E bytes from a region "
3262 }
3265 }
3267 /* Helper to compute the size of the object referenced by the DEST
3268 expression which must have pointer type, using Object Size type
3269 OSTYPE (only the least significant 2 bits are used). Return
3270 the size of the object if successful or NULL when the size cannot
3271 be determined. */
3273 tree
3275 {
3278 /* Only the two least significant bits are meaningful. */
3284 /* Unless computing the largest size (for memcpy and other raw memory
3285 functions), try to determine the size of the object from its type. */
3290 {
3300 }
3313 {
3314 /* Return the constant size unless it's zero (that's a zero-length
3315 array likely at the end of a struct). */
3320 }
3323 }
3325 /* Helper to determine and check the sizes of the source and the destination
3326 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3327 call expression, DEST is the destination argument, SRC is the source
3328 argument or null, and LEN is the number of bytes. Use Object Size type-0
3329 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3330 (no overflow or invalid sizes), false otherwise. */
3332 static bool
3334 {
3338 /* For functions like memset and memcpy that operate on raw memory
3339 try to determine the size of the largest source and destination
3340 object using type-0 Object Size regardless of the object size
3341 type specified by the option. */
3347 }
3349 /* Validate memchr arguments without performing any expansion.
3350 Return NULL_RTX. */
3352 static rtx
3354 {
3362 /* Diagnose calls where the specified length exceeds the size
3363 of the object. */
3365 {
3370 }
3373 }
3375 /* Expand a call EXP to the memcpy builtin.
3376 Return NULL_RTX if we failed, the caller should emit a normal call,
3377 otherwise try to get the result in TARGET, if convenient (and in
3378 mode MODE if that's convenient). */
3380 static rtx
3382 {
3395 }
3397 /* Check a call EXP to the memmove built-in for validity.
3398 Return NULL_RTX on both success and failure. */
3400 static rtx
3402 {
3414 }
3416 /* Expand an instrumented call EXP to the memcpy builtin.
3417 Return NULL_RTX if we failed, the caller should emit a normal call,
3418 otherwise try to get the result in TARGET, if convenient (and in
3419 mode MODE if that's convenient). */
3421 static rtx
3423 {
3429 else
3430 {
3437 /* Return src bounds with the result. */
3439 {
3443 }
3445 }
3446 }
3448 /* Expand a call EXP to the mempcpy builtin.
3449 Return NULL_RTX if we failed; the caller should emit a normal call,
3450 otherwise try to get the result in TARGET, if convenient (and in
3451 mode MODE if that's convenient). If ENDP is 0 return the
3452 destination pointer, if ENDP is 1 return the end pointer ala
3453 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3454 stpcpy. */
3456 static rtx
3458 {
3467 /* Avoid expanding mempcpy into memcpy when the call is determined
3468 to overflow the buffer. This also prevents the same overflow
3469 from being diagnosed again when expanding memcpy. */
3475 }
3477 /* Expand an instrumented call EXP to the mempcpy builtin.
3478 Return NULL_RTX if we failed, the caller should emit a normal call,
3479 otherwise try to get the result in TARGET, if convenient (and in
3480 mode MODE if that's convenient). */
3482 static rtx
3484 {
3490 else
3491 {
3498 /* Return src bounds with the result. */
3500 {
3504 }
3506 }
3507 }
3509 /* Helper function to do the actual work for expand of memory copy family
3510 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3511 of memory from SRC to DEST and assign to TARGET if convenient.
3512 If ENDP is 0 return the
3513 destination pointer, if ENDP is 1 return the end pointer ala
3514 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3515 stpcpy. */
3517 static rtx
3520 {
3531 /* If DEST is not a pointer type, call the normal function. */
3535 /* If either SRC is not a pointer type, don't do this
3536 operation in-line. */
3553 /* If SRC is a string constant and block move would be done
3554 by pieces, we can avoid loading the string from memory
3555 and only stored the computed constants. */
3562 {
3564 builtin_memcpy_read_str,
3570 }
3575 /* Copy word part most expediently. */
3584 {
3587 }
3590 {
3592 /* stpcpy pointer to last byte. */
3595 }
3598 }
3600 static rtx
3603 {
3605 endp);
3606 }
3608 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3609 we failed, the caller should emit a normal call, otherwise try to
3610 get the result in TARGET, if convenient. If ENDP is 0 return the
3611 destination pointer, if ENDP is 1 return the end pointer ala
3612 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3613 stpcpy. */
3615 static rtx
3617 {
3619 rtx dest_mem;
3620 rtx src_mem;
3628 {
3631 }
3640 {
3642 /* movstr is supposed to set end to the address of the NUL
3643 terminator. If the caller requested a mempcpy-like return value,
3644 adjust it. */
3646 {
3650 }
3651 }
3653 }
3655 /* Do some very basic size validation of a call to the strcpy builtin
3656 given by EXP. Return NULL_RTX to have the built-in expand to a call
3657 to the library function. */
3659 static rtx
3661 {
3669 /* There is no way here to determine the length of the string in
3670 the destination to which the SRC string is being appended so
3671 just diagnose cases when the souce string is longer than
3672 the destination object. */
3680 }
3682 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3683 NULL_RTX if we failed the caller should emit a normal call, otherwise
3684 try to get the result in TARGET, if convenient (and in mode MODE if that's
3685 convenient). */
3687 static rtx
3689 {
3697 {
3701 }
3704 }
3706 /* Helper function to do the actual work for expand_builtin_strcpy. The
3707 arguments to the builtin_strcpy call DEST and SRC are broken out
3708 so that this can also be called without constructing an actual CALL_EXPR.
3709 The other arguments and return value are the same as for
3710 expand_builtin_strcpy. */
3712 static rtx
3714 {
3716 }
3718 /* Expand a call EXP to the stpcpy builtin.
3719 Return NULL_RTX if we failed the caller should emit a normal call,
3720 otherwise try to get the result in TARGET, if convenient (and in
3721 mode MODE if that's convenient). */
3723 static rtx
3725 {
3736 {
3740 }
3742 /* If return value is ignored, transform stpcpy into strcpy. */
3744 {
3748 }
3749 else
3750 {
3752 rtx ret;
3754 /* Ensure we get an actual string whose length can be evaluated at
3755 compile-time, not an expression containing a string. This is
3756 because the latter will potentially produce pessimized code
3757 when used to produce the return value. */
3769 {
3773 {
3777 {
3779 {
3782 else
3784 }
3793 }
3794 }
3795 }
3798 }
3799 }
3801 /* Check a call EXP to the stpncpy built-in for validity.
3802 Return NULL_RTX on both success and failure. */
3804 static rtx
3806 {
3812 /* The source and destination of the call. */
3816 /* The exact number of bytes to write (not the maximum). */
3819 /* The size of the destination object. */
3826 }
3828 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3829 bytes from constant string DATA + OFFSET and return it as target
3830 constant. */
3832 rtx
3834 scalar_int_mode mode)
3835 {
3842 }
3844 /* Helper to check the sizes of sequences and the destination of calls
3845 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3846 success (no overflow or invalid sizes), false otherwise. */
3848 static bool
3850 {
3855 /* Try to determine the range of lengths that the source expression
3856 refers to. */
3860 /* Try to verify that the destination is big enough for the shortest
3861 string. */
3864 {
3865 /* If it hasn't been provided by __strncat_chk, try to determine
3866 the size of the destination object into which the source is
3867 being copied. */
3869 }
3871 /* Add one for the terminating nul. */
3874 size_one_node)
3877 /* Strncat copies at most MAXLEN bytes and always appends the terminating
3878 nul so the specified upper bound should never be equal to (or greater
3879 than) the size of the destination. */
3882 {
3891 }
3899 /* The number of bytes to write is LEN but check_sizes will also
3900 check SRCLEN if LEN's value isn't known. */
3903 }
3905 /* Similar to expand_builtin_strcat, do some very basic size validation
3906 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3907 the built-in expand to a call to the library function. */
3909 static rtx
3911 {
3919 /* The upper bound on the number of bytes to write. */
3921 /* The length of the source sequence. */
3924 /* Try to determine the range of lengths that the source expression
3925 refers to. */
3929 else
3932 /* Try to verify that the destination is big enough for the shortest
3933 string. First try to determine the size of the destination object
3934 into which the source is being copied. */
3937 /* Add one for the terminating nul. */
3940 size_one_node)
3943 /* Strncat copies at most MAXLEN bytes and always appends the terminating
3944 nul so the specified upper bound should never be equal to (or greater
3945 than) the size of the destination. */
3948 {
3957 }
3965 /* The number of bytes to write is LEN but check_sizes will also
3966 check SRCLEN if LEN's value isn't known. */
3971 }
3973 /* Helper to check the sizes of sequences and the destination of calls
3974 to __builtin_strncpy (DST, SRC, CNT) and __builtin___strncpy_chk.
3975 Returns true on success (no overflow warning), false otherwise. */
3977 static bool
3979 {
3987 }
3989 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3990 NULL_RTX if we failed the caller should emit a normal call. */
3992 static rtx
3994 {
3999 {
4002 /* The number of bytes to write (not the maximum). */
4004 /* The length of the source sequence. */
4009 /* We must be passed a constant len and src parameter. */
4015 /* We're required to pad with trailing zeros if the requested
4016 len is greater than strlen(s2)+1. In that case try to
4017 use store_by_pieces, if it fails, punt. */
4019 {
4022 rtx dest_mem;
4026 builtin_strncpy_read_str,
4033 builtin_strncpy_read_str,
4038 }
4039 }
4041 }
4043 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4044 bytes from constant string DATA + OFFSET and return it as target
4045 constant. */
4047 rtx
4049 scalar_int_mode mode)
4050 {
4057 }
4059 /* Callback routine for store_by_pieces. Return the RTL of a register
4060 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4061 char value given in the RTL register data. For example, if mode is
4062 4 bytes wide, return the RTL for 0x01010101*data. */
4064 static rtx
4066 scalar_int_mode mode)
4067 {
4083 }
4085 /* Expand expression EXP, which is a call to the memset builtin. Return
4086 NULL_RTX if we failed the caller should emit a normal call, otherwise
4087 try to get the result in TARGET, if convenient (and in mode MODE if that's
4088 convenient). */
4090 static rtx
4092 {
4104 }
4106 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4107 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4108 try to get the result in TARGET, if convenient (and in mode MODE if that's
4109 convenient). */
4111 static rtx
4113 {
4118 else
4119 {
4125 /* Return src bounds with the result. */
4127 {
4131 }
4133 }
4134 }
4136 /* Helper function to do the actual work for expand_builtin_memset. The
4137 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4138 so that this can also be called without constructing an actual CALL_EXPR.
4139 The other arguments and return value are the same as for
4140 expand_builtin_memset. */
4142 static rtx
4145 {
4148 machine_mode val_mode;
4160 /* If DEST is not a pointer type, don't do this operation in-line. */
4171 /* If the LEN parameter is zero, return DEST. */
4173 {
4174 /* Evaluate and ignore VAL in case it has side-effects. */
4177 }
4179 /* Stabilize the arguments in case we fail. */
4191 {
4192 rtx val_rtx;
4197 /* Assume that we can memset by pieces if we can store
4198 * the coefficients by pieces (in the required modes).
4199 * We can't pass builtin_memset_gen_str as that emits RTL. */
4205 {
4210 }
4214 probable_max_size))
4220 }
4226 {
4237 probable_max_size))
4243 }
4251 probable_max_size);
4254 {
4257 }
4261 do_libcall:
4271 else
4276 }
4278 /* Expand expression EXP, which is a call to the bzero builtin. Return
4279 NULL_RTX if we failed the caller should emit a normal call. */
4281 static rtx
4283 {
4292 /* New argument list transforming bzero(ptr x, int y) to
4293 memset(ptr x, int 0, size_t y). This is done this way
4294 so that if it isn't expanded inline, we fallback to
4295 calling bzero instead of memset. */
4303 }
4305 /* Try to expand cmpstr operation ICODE with the given operands.
4306 Return the result rtx on success, otherwise return null. */
4308 static rtx
4310 HOST_WIDE_INT align)
4311 {
4325 }
4327 /* Expand expression EXP, which is a call to the memcmp built-in function.
4328 Return NULL_RTX if we failed and the caller should emit a normal call,
4329 otherwise try to get the result in TARGET, if convenient.
4330 RESULT_EQ is true if we can relax the returned value to be either zero
4331 or nonzero, without caring about the sign. */
4333 static rtx
4335 {
4344 /* Diagnose calls where the specified length exceeds the size of either
4345 object. */
4347 {
4352 {
4357 }
4358 }
4366 /* If we don't have POINTER_TYPE, call the function. */
4374 /* Set MEM_SIZE as appropriate. */
4376 {
4379 }
4385 {
4389 }
4391 /* If SRC is a string constant and block move would be done
4392 by pieces, we can avoid loading the string from memory
4393 and only stored the computed constants. */
4405 {
4406 /* Return the value in the proper mode for this function. */
4411 {
4414 }
4417 }
4420 }
4422 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4423 if we failed the caller should emit a normal call, otherwise try to get
4424 the result in TARGET, if convenient. */
4426 static rtx
4428 {
4435 {
4445 /* If we don't have POINTER_TYPE, call the function. */
4449 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4456 /* Try to call cmpstrsi. */
4461 /* Try to determine at least one length and call cmpstrnsi. */
4463 {
4464 tree len;
4465 rtx arg3_rtx;
4475 /* If we don't have a constant length for the first, use the length
4476 of the second, if we know it. We don't require a constant for
4477 this case; some cost analysis could be done if both are available
4478 but neither is constant. For now, assume they're equally cheap,
4479 unless one has side effects. If both strings have constant lengths,
4480 use the smaller. */
4496 else
4499 /* If both arguments have side effects, we cannot optimize. */
4501 {
4503 result = expand_cmpstrn_or_cmpmem
4506 }
4507 }
4510 {
4511 /* Return the value in the proper mode for this function. */
4519 }
4521 /* Expand the library call ourselves using a stabilized argument
4522 list to avoid re-evaluating the function's arguments twice. */
4528 }
4530 }
4532 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4533 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4534 the result in TARGET, if convenient. */
4536 static rtx
4538 ATTRIBUTE_UNUSED machine_mode mode)
4539 {
4546 /* If c_strlen can determine an expression for one of the string
4547 lengths, and it doesn't have side effects, then emit cmpstrnsi
4548 using length MIN(strlen(string)+1, arg3). */
4551 {
4554 rtx result;
4573 /* If we don't have a constant length for the first, use the length
4574 of the second, if we know it. If neither string is constant length,
4575 use the given length argument. We don't require a constant for
4576 this case; some cost analysis could be done if both are available
4577 but neither is constant. For now, assume they're equally cheap,
4578 unless one has side effects. If both strings have constant lengths,
4579 use the smaller. */
4597 else
4600 /* If we are not using the given length, we must incorporate it here.
4601 The actual new length parameter will be MIN(len,arg3) in this case. */
4611 {
4612 /* Return the value in the proper mode for this function. */
4620 }
4622 /* Expand the library call ourselves using a stabilized argument
4623 list to avoid re-evaluating the function's arguments twice. */
4630 }
4632 }
4634 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4635 if that's convenient. */
4637 rtx
4639 {
4640 rtx val;
4643 /* Don't do __builtin_saveregs more than once in a function.
4644 Save the result of the first call and reuse it. */
4648 /* When this function is called, it means that registers must be
4649 saved on entry to this function. So we migrate the call to the
4650 first insn of this function. */
4654 /* Do whatever the machine needs done in this case. */
4662 /* Put the insns after the NOTE that starts the function. If this
4663 is inside a start_sequence, make the outer-level insn chain current, so
4664 the code is placed at the start of the function. */
4670 }
4672 /* Expand a call to __builtin_next_arg. */
4674 static rtx
4676 {
4677 /* Checking arguments is already done in fold_builtin_next_arg
4678 that must be called before this function. */
4683 }
4685 /* Make it easier for the backends by protecting the valist argument
4686 from multiple evaluations. */
4688 static tree
4690 {
4693 /* The current way of determining the type of valist is completely
4694 bogus. We should have the information on the va builtin instead. */
4699 {
4703 /* For this case, the backends will be expecting a pointer to
4704 vatype, but it's possible we've actually been given an array
4705 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4706 So fix it. */
4708 {
4711 }
4712 }
4713 else
4714 {
4718 {
4724 }
4730 }
4733 }
4735 /* The "standard" definition of va_list is void*. */
4737 tree
4739 {
4741 }
4743 /* The "standard" abi va_list is va_list_type_node. */
4745 tree
4747 {
4749 }
4751 /* The "standard" type of va_list is va_list_type_node. */
4753 tree
4755 {
4762 {
4763 /* If va_list is an array type, the argument may have decayed
4764 to a pointer type, e.g. by being passed to another function.
4765 In that case, unwrap both types so that we can compare the
4766 underlying records. */
4769 {
4772 }
4773 }
4778 }
4780 /* The "standard" implementation of va_start: just assign `nextarg' to
4781 the variable. */
4783 void
4785 {
4789 /* We do not have any valid bounds for the pointer, so
4790 just store zero bounds for it. */
4794 nextarg));
4795 }
4797 /* Expand EXP, a call to __builtin_va_start. */
4799 static rtx
4801 {
4802 rtx nextarg;
4803 tree valist;
4807 {
4810 }
4820 else
4824 }
4826 /* Expand EXP, a call to __builtin_va_end. */
4828 static rtx
4830 {
4833 /* Evaluate for side effects, if needed. I hate macros that don't
4834 do that. */
4839 }
4841 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4842 builtin rather than just as an assignment in stdarg.h because of the
4843 nastiness of array-type va_list types. */
4845 static rtx
4847 {
4860 {
4864 }
4865 else
4866 {
4869 /* Evaluate to pointers. */
4878 /* "Dereference" to BLKmode memories. */
4886 /* Copy. */
4888 }
4891 }
4893 /* Expand a call to one of the builtin functions __builtin_frame_address or
4894 __builtin_return_address. */
4896 static rtx
4898 {
4899 /* The argument must be a nonnegative integer constant.
4900 It counts the number of frames to scan up the stack.
4901 The value is either the frame pointer value or the return
4902 address saved in that frame. */
4904 /* Warning about missing arg was already issued. */
4907 {
4910 }
4911 else
4912 {
4913 /* Number of frames to scan up the stack. */
4918 /* Some ports cannot access arbitrary stack frames. */
4920 {
4923 }
4926 {
4927 /* Warn since no effort is made to ensure that any frame
4928 beyond the current one exists or can be safely reached. */
4931 }
4933 /* For __builtin_frame_address, return what we've got. */
4941 }
4942 }
4944 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
4945 failed and the caller should emit a normal call. */
4947 static rtx
4949 {
4950 rtx op0;
4951 rtx result;
4954 HOST_WIDE_INT max_size;
4957 bool valid_arglist
4960 VOID_TYPE)
4970 {
4971 /* -Walloca-larger-than and -Wvla-larger-than settings override
4972 the more general -Walloc-size-larger-than so unless either of
4973 the former options is specified check the alloca arguments for
4974 overflow. */
4978 }
4980 /* Compute the argument. */
4983 /* Compute the alignment. */
4985 ? BIGGEST_ALIGNMENT
4988 /* Compute the maximum size. */
4993 /* Allocate the desired space. If the allocation stems from the declaration
4994 of a variable-sized object, it cannot accumulate. */
4995 result
5000 }
5002 /* Emit a call to __asan_allocas_unpoison call in EXP. Replace second argument
5003 of the call with virtual_stack_dynamic_rtx because in asan pass we emit a
5004 dummy value into second parameter relying on this function to perform the
5005 change. See motivation for this in comment to handle_builtin_stack_restore
5006 function. */
5008 static rtx
5010 {
5018 }
5020 /* Expand a call to bswap builtin in EXP.
5021 Return NULL_RTX if a normal call should be emitted rather than expanding the
5022 function in-line. If convenient, the result should be placed in TARGET.
5023 SUBTARGET may be used as the target for computing one of EXP's operands. */
5025 static rtx
5027 rtx subtarget)
5028 {
5029 tree arg;
5030 rtx op0;
5048 }
5050 /* Expand a call to a unary builtin in EXP.
5051 Return NULL_RTX if a normal call should be emitted rather than expanding the
5052 function in-line. If convenient, the result should be placed in TARGET.
5053 SUBTARGET may be used as the target for computing one of EXP's operands. */
5055 static rtx
5058 {
5059 rtx op0;
5064 /* Compute the argument. */
5066 (subtarget
5070 /* Compute op, into TARGET if possible.
5071 Set TARGET to wherever the result comes back. */
5077 }
5079 /* Expand a call to __builtin_expect. We just return our argument
5080 as the builtin_expect semantic should've been already executed by
5081 tree branch prediction pass. */
5083 static rtx
5085 {
5086 tree arg;
5093 /* When guessing was done, the hints should be already stripped away. */
5097 }
5099 /* Expand a call to __builtin_assume_aligned. We just return our first
5100 argument as the builtin_assume_aligned semantic should've been already
5101 executed by CCP. */
5103 static rtx
5105 {
5109 EXPAND_NORMAL);
5114 }
5116 void
5118 {
5120 {
5122 /* For trap insns when not accumulating outgoing args force
5123 REG_ARGS_SIZE note to prevent crossjumping of calls with
5124 different args sizes. */
5127 }
5128 else
5129 {
5133 }
5136 }
5138 /* Expand a call to __builtin_unreachable. We do nothing except emit
5139 a barrier saying that control flow will not pass here.
5141 It is the responsibility of the program being compiled to ensure
5142 that control flow does never reach __builtin_unreachable. */
5143 static void
5145 {
5147 }
5149 /* Expand EXP, a call to fabs, fabsf or fabsl.
5150 Return NULL_RTX if a normal call should be emitted rather than expanding
5151 the function inline. If convenient, the result should be placed
5152 in TARGET. SUBTARGET may be used as the target for computing
5153 the operand. */
5155 static rtx
5157 {
5158 machine_mode mode;
5159 tree arg;
5160 rtx op0;
5170 }
5172 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5173 Return NULL is a normal call should be emitted rather than expanding the
5174 function inline. If convenient, the result should be placed in TARGET.
5175 SUBTARGET may be used as the target for computing the operand. */
5177 static rtx
5179 {
5181 tree arg;
5193 }
5195 /* Expand a call to __builtin___clear_cache. */
5197 static rtx
5199 {
5201 {
5202 #ifdef CLEAR_INSN_CACHE
5203 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5204 does something. Just do the default expansion to a call to
5205 __clear_cache(). */
5207 #else
5208 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5209 does nothing. There is no need to call it. Do nothing. */
5212 }
5214 /* We have a "clear_cache" insn, and it will handle everything. */
5218 /* We must not expand to a library call. If we did, any
5219 fallback library function in libgcc that might contain a call to
5220 __builtin___clear_cache() would recurse infinitely. */
5222 {
5225 }
5228 {
5241 }
5243 }
5245 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5247 static rtx
5249 {
5252 /* If we don't need too much alignment, we'll have been guaranteed
5253 proper alignment by get_trampoline_type. */
5257 /* Round address up to desired boundary. */
5268 }
5270 static rtx
5272 {
5288 /* If ONSTACK, the TRAMP argument should be the address of a field
5289 within the local function's FRAME decl. Either way, let's see if
5290 we can fill in the MEM_ATTRs for this memory. */
5294 /* Creator of a heap trampoline is responsible for making sure the
5295 address is aligned to at least STACK_BOUNDARY. Normally malloc
5296 will ensure this anyhow. */
5299 {
5303 }
5305 /* The FUNC argument should be the address of the nested function.
5306 Extract the actual function decl to pass to the hook. */
5313 /* Generate insns to initialize the trampoline. */
5317 {
5323 }
5326 }
5328 static rtx
5330 {
5331 rtx tramp;
5342 }
5344 /* Expand a call to the builtin descriptor initialization routine.
5345 A descriptor is made up of a couple of pointers to the static
5346 chain and the code entry in this order. */
5348 static rtx
5350 {
5355 VOID_TYPE))
5369 /* Generate insns to initialize the descriptor. */
5375 }
5377 /* Expand a call to the builtin descriptor adjustment routine. */
5379 static rtx
5381 {
5382 rtx tramp;
5389 /* Unalign the descriptor to allow runtime identification. */
5394 }
5396 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5397 function. The function first checks whether the back end provides
5398 an insn to implement signbit for the respective mode. If not, it
5399 checks whether the floating point format of the value is such that
5400 the sign bit can be extracted. If that is not the case, error out.
5401 EXP is the expression that is a call to the builtin function; if
5402 convenient, the result should be placed in TARGET. */
5403 static rtx
5405 {
5407 scalar_float_mode fmode;
5409 tree arg;
5412 rtx temp;
5425 /* Expand the argument yielding a RTX expression. */
5428 /* Check if the back end provides an insn that handles signbit for the
5429 argument's mode. */
5432 {
5438 }
5440 /* For floating point formats without a sign bit, implement signbit
5441 as "ARG < 0.0". */
5444 {
5445 /* But we can't do this if the format supports signed zero. */
5451 }
5454 {
5457 }
5458 else
5459 {
5461 /* Handle targets with different FP word orders. */
5464 else
5468 }
5470 /* Force the intermediate word_mode (or narrower) result into a
5471 register. This avoids attempting to create paradoxical SUBREGs
5472 of floating point modes below. */
5475 /* If the bitpos is within the "result mode" lowpart, the operation
5476 can be implement with a single bitwise AND. Otherwise, we need
5477 a right shift and an AND. */
5480 {
5488 }
5489 else
5490 {
5491 /* Perform a logical right shift to place the signbit in the least
5492 significant bit, then truncate the result to the desired mode
5493 and mask just this bit. */
5498 }
5501 }
5503 /* Expand fork or exec calls. TARGET is the desired target of the
5504 call. EXP is the call. FN is the
5505 identificator of the actual function. IGNORE is nonzero if the
5506 value is to be ignored. */
5508 static rtx
5510 {
5512 tree call;
5514 /* If we are not profiling, just call the function. */
5518 /* Otherwise call the wrapper. This should be equivalent for the rest of
5519 compiler, so the code does not diverge, and the wrapper may run the
5520 code necessary for keeping the profiling sane. */
5523 {
5554 }
5566 }
5569 \f
5570 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5571 the pointer in these functions is void*, the tree optimizers may remove
5572 casts. The mode computed in expand_builtin isn't reliable either, due
5573 to __sync_bool_compare_and_swap.
5575 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5576 group of builtins. This gives us log2 of the mode size. */
5580 {
5581 /* The size is not negotiable, so ask not to get BLKmode in return
5582 if the target indicates that a smaller size would be better. */
5584 }
5586 /* Expand the memory expression LOC and return the appropriate memory operand
5587 for the builtin_sync operations. */
5589 static rtx
5591 {
5597 /* Note that we explicitly do not want any alias information for this
5598 memory, so that we kill all other live memories. Otherwise we don't
5599 satisfy the full barrier semantics of the intrinsic. */
5602 /* The alignment needs to be at least according to that of the mode. */
5609 }
5611 /* Make sure an argument is in the right mode.
5612 EXP is the tree argument.
5613 MODE is the mode it should be in. */
5615 static rtx
5617 {
5618 rtx val;
5619 machine_mode old_mode;
5622 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5623 of CONST_INTs, where we know the old_mode only from the call argument. */
5630 }
5633 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5634 EXP is the CALL_EXPR. CODE is the rtx code
5635 that corresponds to the arithmetic or logical operation from the name;
5636 an exception here is that NOT actually means NAND. TARGET is an optional
5637 place for us to store the results; AFTER is true if this is the
5638 fetch_and_xxx form. */
5640 static rtx
5643 rtx target)
5644 {
5649 {
5656 {
5685 }
5686 }
5688 /* Expand the operands. */
5693 after);
5694 }
5696 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5697 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5698 true if this is the boolean form. TARGET is a place for us to store the
5699 results; this is NOT optional if IS_BOOL is true. */
5701 static rtx
5704 {
5708 /* Expand the operands. */
5715 {
5718 else
5720 }
5723 MEMMODEL_SYNC_SEQ_CST))
5727 }
5729 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5730 general form is actually an atomic exchange, and some targets only
5731 support a reduced form with the second argument being a constant 1.
5732 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5733 the results. */
5735 static rtx
5737 rtx target)
5738 {
5741 /* Expand the operands. */
5746 }
5748 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5750 static void
5752 {
5753 rtx mem;
5755 /* Expand the operands. */
5759 }
5761 /* Given an integer representing an ``enum memmodel'', verify its
5762 correctness and return the memory model enum. */
5764 static enum memmodel
5766 {
5767 rtx op;
5769 source_location loc
5772 /* If the parameter is not a constant, it's a run time value so we'll just
5773 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5783 {
5787 }
5789 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5791 {
5795 }
5797 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5798 be conservative and promote consume to acquire. */
5803 }
5805 /* Expand the __atomic_exchange intrinsic:
5806 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5807 EXP is the CALL_EXPR.
5808 TARGET is an optional place for us to store the results. */
5810 static rtx
5812 {
5821 /* Expand the operands. */
5826 }
5828 /* Expand the __atomic_compare_exchange intrinsic:
5829 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5830 TYPE desired, BOOL weak,
5831 enum memmodel success,
5832 enum memmodel failure)
5833 EXP is the CALL_EXPR.
5834 TARGET is an optional place for us to store the results. */
5836 static rtx
5838 rtx target)
5839 {
5843 tree weak;
5845 source_location loc
5852 {
5854 "failure memory model cannot be stronger than success "
5857 }
5860 {
5862 "invalid failure memory model for "
5866 }
5872 /* Expand the operands. */
5888 /* Lest the rtl backend create a race condition with an imporoper store
5889 to memory, always create a new pseudo for OLDVAL. */
5896 /* Conditionally store back to EXPECT, lest we create a race condition
5897 with an improper store to memory. */
5898 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5899 the normal case where EXPECT is totally private, i.e. a register. At
5900 which point the store can be unconditional. */
5908 }
5910 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5911 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5912 call. The weak parameter must be dropped to match the expected parameter
5913 list and the expected argument changed from value to pointer to memory
5914 slot. */
5916 static void
5918 {
5934 /* Skip the boolean weak parameter. */
5937 built_in_function fncode
5942 fndecl);
5947 {
5954 }
5955 }
5957 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
5959 void
5961 {
5967 tree lhs;
5969 source_location loc
5976 {
5978 "failure memory model cannot be stronger than success "
5981 }
5984 {
5986 "invalid failure memory model for "
5990 }
5993 {
5996 }
5998 /* Expand the operands. */
6011 {
6014 }
6018 {
6024 }
6025 }
6027 /* Expand the __atomic_load intrinsic:
6028 TYPE __atomic_load (TYPE *object, enum memmodel)
6029 EXP is the CALL_EXPR.
6030 TARGET is an optional place for us to store the results. */
6032 static rtx
6034 {
6035 rtx mem;
6040 {
6041 source_location loc
6046 }
6051 /* Expand the operand. */
6055 }
6058 /* Expand the __atomic_store intrinsic:
6059 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6060 EXP is the CALL_EXPR.
6061 TARGET is an optional place for us to store the results. */
6063 static rtx
6065 {
6072 {
6073 source_location loc
6078 }
6083 /* Expand the operands. */
6088 }
6090 /* Expand the __atomic_fetch_XXX intrinsic:
6091 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6092 EXP is the CALL_EXPR.
6093 TARGET is an optional place for us to store the results.
6094 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6095 FETCH_AFTER is true if returning the result of the operation.
6096 FETCH_AFTER is false if returning the value before the operation.
6097 IGNORE is true if the result is not used.
6098 EXT_CALL is the correct builtin for an external call if this cannot be
6099 resolved to an instruction sequence. */
6101 static rtx
6105 {
6108 tree fndecl;
6109 tree addr;
6113 /* Expand the operands. */
6117 /* Only try generating instructions if inlining is turned on. */
6119 {
6123 }
6125 /* Return if a different routine isn't needed for the library call. */
6129 /* Change the call to the specified function. */
6137 /* If we will emit code after the call, the call can not be a tail call.
6138 If it is emitted as a tail call, a barrier is emitted after it, and
6139 then all trailing code is removed. */
6143 /* Expand the call here so we can emit trailing code. */
6146 /* Replace the original function just in case it matters. */
6149 /* Then issue the arithmetic correction to return the right result. */
6151 {
6153 {
6155 OPTAB_LIB_WIDEN);
6157 }
6158 else
6160 OPTAB_LIB_WIDEN);
6161 }
6163 }
6165 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6167 void
6169 {
6177 optab optab;
6189 {
6204 }
6207 {
6214 }
6236 {
6241 }
6242 else
6244 OPTAB_DIRECT);
6247 }
6249 /* Expand an atomic clear operation.
6250 void _atomic_clear (BOOL *obj, enum memmodel)
6251 EXP is the call expression. */
6253 static rtx
6255 {
6256 machine_mode mode;
6265 {
6266 source_location loc
6271 }
6273 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6274 Failing that, a store is issued by __atomic_store. The only way this can
6275 fail is if the bool type is larger than a word size. Unlikely, but
6276 handle it anyway for completeness. Assume a single threaded model since
6277 there is no atomic support in this case, and no barriers are required. */
6282 }
6284 /* Expand an atomic test_and_set operation.
6285 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6286 EXP is the call expression. */
6288 static rtx
6290 {
6291 rtx mem;
6293 machine_mode mode;
6300 }
6303 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6304 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6306 static tree
6308 {
6310 machine_mode mode;
6316 /* We need a corresponding integer mode for the access to be lock-free. */
6324 {
6327 /* Either this argument is null, or it's a fake pointer encoding
6328 the alignment of the object. */
6334 else
6336 }
6337 else
6338 {
6341 /* This function is usually invoked and folded immediately by the front
6342 end before anything else has a chance to look at it. The pointer
6343 parameter at this point is usually cast to a void *, so check for that
6344 and look past the cast. */
6354 /* Get the underlying type of the object. */
6357 }
6359 /* If the object has smaller alignment, the lock free routines cannot
6360 be used. */
6364 /* Check if a compare_and_swap pattern exists for the mode which represents
6365 the required size. The pattern is not allowed to fail, so the existence
6366 of the pattern indicates support is present. Also require that an
6367 atomic load exists for the required size. */
6370 else
6372 }
6374 /* Return true if the parameters to call EXP represent an object which will
6375 always generate lock free instructions. The first argument represents the
6376 size of the object, and the second parameter is a pointer to the object
6377 itself. If NULL is passed for the object, then the result is based on
6378 typical alignment for an object of the specified size. Otherwise return
6379 false. */
6381 static rtx
6383 {
6384 tree size;
6389 {
6392 }
6398 }
6400 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6401 is lock free on this architecture. */
6403 static tree
6405 {
6409 /* If it isn't always lock free, don't generate a result. */
6414 }
6416 /* Return true if the parameters to call EXP represent an object which will
6417 always generate lock free instructions. The first argument represents the
6418 size of the object, and the second parameter is a pointer to the object
6419 itself. If NULL is passed for the object, then the result is based on
6420 typical alignment for an object of the specified size. Otherwise return
6421 NULL*/
6423 static rtx
6425 {
6426 tree size;
6431 {
6434 }
6439 /* If the value is known at compile time, return the RTX for it. */
6445 }
6447 /* Expand the __atomic_thread_fence intrinsic:
6448 void __atomic_thread_fence (enum memmodel)
6449 EXP is the CALL_EXPR. */
6451 static void
6453 {
6456 }
6458 /* Expand the __atomic_signal_fence intrinsic:
6459 void __atomic_signal_fence (enum memmodel)
6460 EXP is the CALL_EXPR. */
6462 static void
6464 {
6467 }
6469 /* Expand the __sync_synchronize intrinsic. */
6471 static void
6473 {
6475 }
6477 static rtx
6479 {
6485 {
6487 /* If the target is not sutitable then create a new target. */
6495 }
6498 }
6500 static void
6502 {
6508 {
6515 }
6517 }
6519 \f
6520 /* Emit code to restore the current value of stack. */
6522 static void
6524 {
6536 }
6538 /* Emit code to save the current value of stack. */
6540 static rtx
6542 {
6547 }
6550 /* Expand an expression EXP that calls a built-in function,
6551 with result going to TARGET if that's convenient
6552 (and in mode MODE if that's convenient).
6553 SUBTARGET may be used as the target for computing one of EXP's operands.
6554 IGNORE is nonzero if the value is to be ignored. */
6556 rtx
6559 {
6568 /* When ASan is enabled, we don't want to expand some memory/string
6569 builtins and rely on libsanitizer's hooks. This allows us to avoid
6570 redundant checks and be sure, that possible overflow will be detected
6571 by ASan. */
6576 /* When not optimizing, generate calls to library functions for a certain
6577 set of builtins. */
6603 /* The built-in function expanders test for target == const0_rtx
6604 to determine whether the function's result will be ignored. */
6608 /* If the result of a pure or const built-in function is ignored, and
6609 none of its arguments are volatile, we can avoid expanding the
6610 built-in call and just evaluate the arguments for side-effects. */
6614 {
6616 tree arg;
6617 call_expr_arg_iterator iter;
6621 {
6624 }
6627 {
6631 }
6632 }
6634 /* expand_builtin_with_bounds is supposed to be used for
6635 instrumented builtin calls. */
6639 {
6657 /* Just do a normal library call if we were unable to fold
6658 the values. */
6735 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6736 FUNCTION with a copy of the parameters described by
6737 ARGUMENTS, and ARGSIZE. It returns a block of memory
6738 allocated on the stack into which is stored all the registers
6739 that might possibly be used for returning the result of a
6740 function. ARGUMENTS is the value returned by
6741 __builtin_apply_args. ARGSIZE is the number of bytes of
6742 arguments that must be copied. ??? How should this value be
6743 computed? We'll also need a safe worst case value for varargs
6744 functions. */
6751 else
6752 {
6760 }
6762 /* __builtin_return (RESULT) causes the function to return the
6763 value described by RESULT. RESULT is address of the block of
6764 memory returned by __builtin_apply. */
6774 /* All valid uses of __builtin_va_arg_pack () are removed during
6775 inlining. */
6780 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6781 inlining. */
6785 /* Return the address of the first anonymous stack arg. */
6807 /* Returns the address of the area where the structure is returned.
6808 0 otherwise. */
6814 else
6817 CASE_BUILT_IN_ALLOCA:
6980 {
6983 }
6987 /* This should have been lowered to the builtins below. */
6991 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6992 and the receiver label. */
6994 {
7000 /* This is copied from the handling of non-local gotos. */
7002 nonlocal_goto_handler_labels
7004 nonlocal_goto_handler_labels);
7005 /* ??? Do not let expand_label treat us as such since we would
7006 not want to be both on the list of non-local labels and on
7007 the list of forced labels. */
7010 }
7014 /* __builtin_setjmp_receiver is passed the receiver label. */
7016 {
7022 }
7025 /* __builtin_longjmp is passed a pointer to an array of five words.
7026 It's similar to the C library longjmp function but works with
7027 __builtin_setjmp above. */
7030 {
7036 {
7039 }
7043 }
7052 /* This updates the setjmp buffer that is its argument with the value
7053 of the current stack pointer. */
7056 {
7057 rtx buf_addr
7062 }
7082 /* Various hooks for the DWARF 2 __throw routine. */
7088 #ifdef DWARF2_UNWIND_INFO
7094 #endif
7294 mode = get_builtin_sync_mode
7306 mode = get_builtin_sync_mode
7353 {
7357 mode =
7363 /* If this is turned into an external library call, the weak parameter
7364 must be dropped to match the expected parameter list. */
7369 /* Skip the boolean weak parameter. */
7374 }
7403 {
7413 }
7419 {
7429 }
7435 {
7445 }
7451 {
7461 }
7467 {
7477 }
7483 {
7493 }
7648 /* We allow user CHKP builtins if Pointer Bounds
7649 Checker is off. */
7651 {
7662 else
7664 }
7665 /* FALLTHROUGH */
7677 /* Software implementation of Pointer Bounds Checker is NYI.
7678 Target support is required. */
7683 /* Do library call, if we failed to expand the builtin when
7684 folding. */
7689 }
7691 /* The switch statement above can drop through to cause the function
7692 to be called normally. */
7694 }
7696 /* Similar to expand_builtin but is used for instrumented calls. */
7698 rtx
7700 rtx subtarget ATTRIBUTE_UNUSED,
7702 {
7715 {
7736 }
7738 /* The switch statement above can drop through to cause the function
7739 to be called normally. */
7741 }
7743 /* Determine whether a tree node represents a call to a built-in
7744 function. If the tree T is a call to a built-in function with
7745 the right number of arguments of the appropriate types, return
7746 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7747 Otherwise the return value is END_BUILTINS. */
7749 enum built_in_function
7751 {
7754 const_call_expr_arg_iterator iter;
7770 {
7771 /* If a function doesn't take a variable number of arguments,
7772 the last element in the list will have type `void'. */
7775 {
7779 }
7788 {
7791 }
7793 {
7796 }
7798 {
7801 }
7803 {
7806 }
7807 else
7809 }
7811 /* Variable-length argument list. */
7813 }
7815 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7816 evaluate to a constant. */
7818 static tree
7820 {
7821 /* We return 1 for a numeric type that's known to be a constant
7822 value at compile-time or for an aggregate type that's a
7823 literal constant. */
7826 /* If we know this is a constant, emit the constant of one. */
7832 {
7839 }
7841 /* If this expression has side effects, show we don't know it to be a
7842 constant. Likewise if it's a pointer or aggregate type since in
7843 those case we only want literals, since those are only optimized
7844 when generating RTL, not later.
7845 And finally, if we are compiling an initializer, not code, we
7846 need to return a definite result now; there's not going to be any
7847 more optimization done. */
7852 || folding_initializer
7857 }
7859 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7860 return it as a truthvalue. */
7862 static tree
7864 tree predictor)
7865 {
7877 predictor);
7881 }
7883 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7884 NULL_TREE if no simplification is possible. */
7886 tree
7888 {
7892 /* Distribute the expected value over short-circuiting operators.
7893 See through the cast from truthvalue_type_node to long. */
7900 /* If this is a builtin_expect within a builtin_expect keep the
7901 inner one. See through a comparison against a constant. It
7902 might have been added to create a thruthvalue. */
7918 {
7927 }
7929 /* If the argument isn't invariant then there's nothing else we can do. */
7933 /* If we expect that a comparison against the argument will fold to
7934 a constant return the constant. In practice, this means a true
7935 constant or the address of a non-weak symbol. */
7939 {
7940 do
7941 {
7943 }
7948 }
7950 /* Otherwise, ARG0 already has the proper type for the return value. */
7952 }
7954 /* Fold a call to __builtin_classify_type with argument ARG. */
7956 static tree
7958 {
7963 }
7965 /* Fold a call to __builtin_strlen with argument ARG. */
7967 static tree
7969 {
7972 else
7973 {
7980 }
7981 }
7983 /* Fold a call to __builtin_inf or __builtin_huge_val. */
7985 static tree
7987 {
7988 REAL_VALUE_TYPE real;
7990 /* __builtin_inff is intended to be usable to define INFINITY on all
7991 targets. If an infinity is not available, INFINITY expands "to a
7992 positive constant of type float that overflows at translation
7993 time", footnote "In this case, using INFINITY will violate the
7994 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
7995 Thus we pedwarn to ensure this constraint violation is
7996 diagnosed. */
8002 }
8004 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8005 NULL_TREE if no simplification can be made. */
8007 static tree
8010 {
8011 tree type;
8021 /* Calculate the result when the argument is a constant. */
8026 /* Canonicalize sincos to cexpi. */
8028 {
8031 }
8033 {
8040 }
8049 }
8051 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8052 Return NULL_TREE if no simplification can be made. */
8054 static tree
8056 {
8062 /* If the LEN parameter is zero, return zero. */
8067 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8071 /* If len parameter is one, return an expression corresponding to
8072 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8074 {
8076 tree cst_uchar_ptr_node
8079 tree ind1
8083 cst_uchar_ptr_node,
8084 arg1)));
8085 tree ind2
8089 cst_uchar_ptr_node,
8090 arg2)));
8092 }
8095 }
8097 /* Fold a call to builtin isascii with argument ARG. */
8099 static tree
8101 {
8104 else
8105 {
8106 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8112 }
8113 }
8115 /* Fold a call to builtin toascii with argument ARG. */
8117 static tree
8119 {
8123 /* Transform toascii(c) -> (c & 0x7f). */
8126 }
8128 /* Fold a call to builtin isdigit with argument ARG. */
8130 static tree
8132 {
8135 else
8136 {
8137 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8138 /* According to the C standard, isdigit is unaffected by locale.
8139 However, it definitely is affected by the target character set. */
8140 unsigned HOST_WIDE_INT target_digit0
8151 }
8152 }
8154 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8156 static tree
8158 {
8164 }
8166 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8168 static tree
8170 {
8176 }
8178 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
8180 static tree
8182 {
8183 /* ??? Only expand to FMA_EXPR if it's directly supported. */
8191 }
8193 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8195 static tree
8197 {
8200 {
8204 {
8209 }
8210 }
8213 }
8215 /* Fold a call to builtin frexp, we can assume the base is 2. */
8217 static tree
8219 {
8230 /* Proceed if a valid pointer type was passed in. */
8232 {
8237 {
8239 /* For +-0, return (*exp = 0, +-0). */
8245 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8248 {
8249 /* Since the frexp function always expects base 2, and in
8250 GCC normalized significands are already in the range
8251 [0.5, 1.0), we have exactly what frexp wants. */
8256 }
8260 }
8262 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8266 }
8269 }
8271 /* Fold a call to builtin modf. */
8273 static tree
8275 {
8286 /* Proceed if a valid pointer type was passed in. */
8288 {
8293 {
8296 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8300 /* For +-Inf, return (*arg1 = arg0, +-0). */
8306 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8309 /* If the original number was negative and already
8310 integral, then the fractional part is -0.0. */
8314 }
8316 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8322 }
8325 }
8327 /* Given a location LOC, an interclass builtin function decl FNDECL
8328 and its single argument ARG, return an folded expression computing
8329 the same, or NULL_TREE if we either couldn't or didn't want to fold
8330 (the latter happen if there's an RTL instruction available). */
8332 static tree
8334 {
8335 machine_mode mode;
8347 /* If there is no optab, try generic code. */
8349 {
8350 tree result;
8353 {
8354 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8357 REAL_VALUE_TYPE r;
8361 {
8362 /* NaN and Inf are encoded in the high-order double value
8363 only. The low-order value is not significant. */
8367 }
8374 }
8377 {
8378 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8381 REAL_VALUE_TYPE r;
8385 {
8386 /* NaN and Inf are encoded in the high-order double value
8387 only. The low-order value is not significant. */
8391 }
8397 /*result = fold_build2_loc (loc, UNGT_EXPR,
8398 TREE_TYPE (TREE_TYPE (fndecl)),
8399 fold_build1_loc (loc, ABS_EXPR, type, arg),
8400 build_real (type, r));
8401 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8402 TREE_TYPE (TREE_TYPE (fndecl)),
8403 result);*/
8405 }
8407 {
8408 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8409 islessequal(fabs(x),DBL_MAX). */
8419 {
8420 /* Use double to test the normal range of IBM extended
8421 precision. Emin for IBM extended precision is
8422 different to emin for IEEE double, being 53 higher
8423 since the low double exponent is at least 53 lower
8424 than the high double exponent. */
8428 }
8440 {
8441 /* Testing the high end of the range is done just using
8442 the high double, using the same test as isfinite().
8443 For the subnormal end of the range we first test the
8444 high double, then if its magnitude is equal to the
8445 limit of 0x1p-969, we test whether the low double is
8446 non-zero and opposite sign to the high double. */
8462 integer_type_node,
8468 }
8469 else
8470 {
8471 tree const isge_fn
8474 }
8478 }
8481 }
8484 }
8486 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8487 ARG is the argument for the call. */
8489 static tree
8491 {
8498 {
8506 {
8507 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8508 /* In a boolean context, GCC will fold the inner COND_EXPR to
8509 1. So e.g. "if (isinf_sign(x))" would be folded to just
8510 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8518 {
8531 integer_zero_node);
8532 }
8535 }
8548 {
8551 {
8552 /* NaN and Inf are encoded in the high-order double value
8553 only. The low-order value is not significant. */
8555 }
8556 }
8562 }
8563 }
8565 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8566 This builtin will generate code to return the appropriate floating
8567 point classification depending on the value of the floating point
8568 number passed in. The possible return values must be supplied as
8569 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8570 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8571 one floating point argument which is "type generic". */
8573 static tree
8575 {
8578 machine_mode mode;
8579 REAL_VALUE_TYPE r;
8582 /* Verify the required arguments in the original call. */
8602 /* fpclassify(x) ->
8603 isnan(x) ? FP_NAN :
8604 (fabs(x) == Inf ? FP_INFINITE :
8605 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8606 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8620 {
8626 }
8629 {
8632 }
8635 }
8637 /* Fold a call to an unordered comparison function such as
8638 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8639 being called and ARG0 and ARG1 are the arguments for the call.
8640 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8641 the opposite of the desired result. UNORDERED_CODE is used
8642 for modes that can hold NaNs and ORDERED_CODE is used for
8643 the rest. */
8645 static tree
8649 {
8663 /* Choose the wider of two real types. */
8675 {
8679 }
8684 }
8686 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8687 arithmetics if it can never overflow, or into internal functions that
8688 return both result of arithmetics and overflowed boolean flag in
8689 a complex integer result, or some other check for overflow.
8690 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8691 checking part of that. */
8693 static tree
8696 {
8698 /* The code of the expression corresponding to the type-generic
8699 built-in, or ERROR_MARK for the type-specific ones. */
8704 {
8707 /* FALLTHRU */
8710 /* FALLTHRU */
8721 /* FALLTHRU */
8724 /* FALLTHRU */
8735 /* FALLTHRU */
8738 /* FALLTHRU */
8749 }
8751 /* For the "generic" overloads, the first two arguments can have different
8752 types and the last argument determines the target type to use to check
8753 for overflow. The arguments of the other overloads all have the same
8754 type. */
8757 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8758 arguments are constant, attempt to fold the built-in call into a constant
8759 expression indicating whether or not it detected an overflow. */
8763 /* Perform the computation in the target type and check for overflow. */
8767 arg2);
8781 tree store
8784 }
8786 /* Fold a call to __builtin_FILE to a constant string. */
8790 {
8795 }
8797 /* Fold a call to __builtin_FUNCTION to a constant string. */
8801 {
8808 }
8810 /* Fold a call to __builtin_LINE to an integer constant. */
8814 {
8816 }
8818 /* Fold a call to built-in function FNDECL with 0 arguments.
8819 This function returns NULL_TREE if no simplification was possible. */
8821 static tree
8823 {
8827 {
8853 }
8855 }
8857 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8858 This function returns NULL_TREE if no simplification was possible. */
8860 static tree
8862 {
8873 {
8875 {
8878 /* Gimplification will pull the CALL_EXPR for the builtin out of
8879 an if condition. When not optimizing, we'll not CSE it back.
8880 To avoid link error types of regressions, return false now. */
8885 }
8941 {
8946 }
8952 {
8957 }
8978 }
8982 }
8984 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
8985 This function returns NULL_TREE if no simplification was possible. */
8987 static tree
8989 {
9001 {
9045 NOP_EXPR);
9047 /* We do the folding for va_start in the expander. */
9062 }
9064 }
9066 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9067 and ARG2.
9068 This function returns NULL_TREE if no simplification was possible. */
9070 static tree
9073 {
9087 {
9137 }
9139 }
9141 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9142 arguments. IGNORE is true if the result of the
9143 function call is ignored. This function returns NULL_TREE if no
9144 simplification was possible. */
9146 tree
9148 {
9152 {
9168 }
9170 {
9175 }
9177 }
9179 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9180 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9181 of arguments in ARGS to be omitted. OLDNARGS is the number of
9182 elements in ARGS. */
9184 static tree
9187 {
9192 {
9200 }
9201 else
9205 }
9207 /* Return true if FNDECL shouldn't be folded right now.
9208 If a built-in function has an inline attribute always_inline
9209 wrapper, defer folding it after always_inline functions have
9210 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9211 might not be performed. */
9213 bool
9215 {
9218 && cfun
9221 }
9223 /* A wrapper function for builtin folding that prevents warnings for
9224 "statement without effect" and the like, caused by removing the
9225 call node earlier than the warning is generated. */
9227 tree
9229 {
9235 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9236 yet. Defer folding until we see all the arguments
9237 (after inlining). */
9239 {
9242 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9243 instead last argument is __builtin_va_arg_pack (). Defer folding
9244 even in that case, until arguments are finalized. */
9246 {
9253 }
9261 else
9262 {
9267 }
9268 }
9270 }
9272 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9273 N arguments are passed in the array ARGARRAY. Return a folded
9274 expression or NULL_TREE if no simplification was possible. */
9276 tree
9278 tree fn,
9281 {
9288 {
9289 /* If last argument is __builtin_va_arg_pack (), arguments to this
9290 function are not finalized yet. Defer folding until they are. */
9292 {
9299 }
9304 else
9306 }
9309 }
9311 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9312 along with N new arguments specified as the "..." parameters. SKIP
9313 is the number of arguments in EXP to be omitted. This function is used
9314 to do varargs-to-varargs transformations. */
9316 static tree
9318 {
9320 tree t;
9328 }
9330 /* Validate a single argument ARG against a tree code CODE representing
9331 a type. Return true when argument is valid. */
9333 static bool
9335 {
9343 }
9345 /* This function validates the types of a function call argument list
9346 against a specified list of tree_codes. If the last specifier is a 0,
9347 that represents an ellipses, otherwise the last specifier must be a
9348 VOID_TYPE.
9350 This is the GIMPLE version of validate_arglist. Eventually we want to
9351 completely convert builtins.c to work from GIMPLEs and the tree based
9352 validate_arglist will then be removed. */
9354 bool
9356 {
9360 const_tree arg;
9366 do
9367 {
9370 {
9372 /* This signifies an ellipses, any further arguments are all ok. */
9376 /* This signifies an endlink, if no arguments remain, return
9377 true, otherwise return false. */
9381 /* If no parameters remain or the parameter's code does not
9382 match the specified code, return false. Otherwise continue
9383 checking any remaining arguments. */
9388 }
9389 }
9392 /* We need gotos here since we can only have one VA_CLOSE in a
9393 function. */
9394 end: ;
9398 }
9400 /* Default target-specific builtin expander that does nothing. */
9402 rtx
9404 rtx target ATTRIBUTE_UNUSED,
9405 rtx subtarget ATTRIBUTE_UNUSED,
9406 machine_mode mode ATTRIBUTE_UNUSED,
9408 {
9410 }
9412 /* Returns true is EXP represents data that would potentially reside
9413 in a readonly section. */
9415 bool
9417 {
9427 /* Make sure we call decl_readonly_section only for trees it
9428 can handle (since it returns true for everything it doesn't
9429 understand). */
9434 else
9436 }
9438 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9439 to the call, and TYPE is its return type.
9441 Return NULL_TREE if no simplification was possible, otherwise return the
9442 simplified form of the call as a tree.
9444 The simplified form may be a constant or other expression which
9445 computes the same value, but in a more efficient manner (including
9446 calls to other builtin functions).
9448 The call may contain arguments which need to be evaluated, but
9449 which are not useful to determine the result of the call. In
9450 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9451 COMPOUND_EXPR will be an argument which must be evaluated.
9452 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9453 COMPOUND_EXPR in the chain will contain the tree for the simplified
9454 form of the builtin function call. */
9456 static tree
9458 {
9462 else
9463 {
9464 tree fn;
9473 {
9475 tree tem;
9480 /* Return an offset into the constant string argument. */
9483 }
9486 /* strpbrk(x, "") == NULL.
9487 Evaluate and ignore s1 in case it had side-effects. */
9497 /* New argument list transforming strpbrk(s1, s2) to
9498 strchr(s1, s2[0]). */
9501 }
9502 }
9504 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9505 to the call.
9507 Return NULL_TREE if no simplification was possible, otherwise return the
9508 simplified form of the call as a tree.
9510 The simplified form may be a constant or other expression which
9511 computes the same value, but in a more efficient manner (including
9512 calls to other builtin functions).
9514 The call may contain arguments which need to be evaluated, but
9515 which are not useful to determine the result of the call. In
9516 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9517 COMPOUND_EXPR will be an argument which must be evaluated.
9518 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9519 COMPOUND_EXPR in the chain will contain the tree for the simplified
9520 form of the builtin function call. */
9522 static tree
9524 {
9528 else
9529 {
9532 /* If either argument is "", return NULL_TREE. */
9534 /* Evaluate and ignore both arguments in case either one has
9535 side-effects. */
9539 }
9540 }
9542 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9543 to the call.
9545 Return NULL_TREE if no simplification was possible, otherwise return the
9546 simplified form of the call as a tree.
9548 The simplified form may be a constant or other expression which
9549 computes the same value, but in a more efficient manner (including
9550 calls to other builtin functions).
9552 The call may contain arguments which need to be evaluated, but
9553 which are not useful to determine the result of the call. In
9554 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9555 COMPOUND_EXPR will be an argument which must be evaluated.
9556 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9557 COMPOUND_EXPR in the chain will contain the tree for the simplified
9558 form of the builtin function call. */
9560 static tree
9562 {
9566 else
9567 {
9568 /* If the first argument is "", return NULL_TREE. */
9571 {
9572 /* Evaluate and ignore argument s2 in case it has
9573 side-effects. */
9576 }
9578 /* If the second argument is "", return __builtin_strlen(s1). */
9581 {
9584 /* If the replacement _DECL isn't initialized, don't do the
9585 transformation. */
9590 }
9592 }
9593 }
9595 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9596 produced. False otherwise. This is done so that we don't output the error
9597 or warning twice or three times. */
9599 bool
9601 {
9604 tree arg;
9605 /* There is good chance the current input_location points inside the
9606 definition of the va_start macro (perhaps on the token for
9607 builtin) in a system header, so warnings will not be emitted.
9608 Use the location in real source code. */
9609 source_location current_location =
9611 NULL);
9614 {
9617 }
9620 {
9622 {
9625 }
9627 }
9628 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9629 when we checked the arguments and if needed issued a warning. */
9630 else
9631 {
9633 {
9634 /* Evidently an out of date version of <stdarg.h>; can't validate
9635 va_start's second argument, but can still work as intended. */
9637 OPT_Wvarargs,
9640 }
9642 {
9645 }
9647 }
9652 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9653 or __builtin_next_arg (0) the first time we see it, after checking
9654 the arguments and if needed issuing a warning. */
9656 {
9659 /* Strip off all nops for the sake of the comparison. This
9660 is not quite the same as STRIP_NOPS. It does more.
9661 We must also strip off INDIRECT_EXPR for C++ reference
9662 parameters. */
9667 {
9668 /* FIXME: Sometimes with the tree optimizers we can get the
9669 not the last argument even though the user used the last
9670 argument. We just warn and set the arg to be the last
9671 argument so that we will get wrong-code because of
9672 it. */
9674 OPT_Wvarargs,
9676 }
9678 /* Undefined by C99 7.15.1.4p4 (va_start):
9679 "If the parameter parmN is declared with the register storage
9680 class, with a function or array type, or with a type that is
9681 not compatible with the type that results after application of
9682 the default argument promotions, the behavior is undefined."
9683 */
9685 {
9687 OPT_Wvarargs,
9688 "undefined behavior when second parameter of "
9690 }
9692 /* We want to verify the second parameter just once before the tree
9693 optimizers are run and then avoid keeping it in the tree,
9694 as otherwise we could warn even for correct code like:
9695 void foo (int i, ...)
9696 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9699 else
9701 }
9703 }
9706 /* Expand a call EXP to __builtin_object_size. */
9708 static rtx
9710 {
9711 tree ost;
9716 {
9721 }
9729 {
9734 }
9739 }
9741 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9742 FCODE is the BUILT_IN_* to use.
9743 Return NULL_RTX if we failed; the caller should emit a normal call,
9744 otherwise try to get the result in TARGET, if convenient (and in
9745 mode MODE if that's convenient). */
9747 static rtx
9750 {
9754 POINTER_TYPE,
9755 fcode == BUILT_IN_MEMSET_CHK
9773 {
9774 /* Avoid transforming the checking call to an ordinary one when
9775 an overflow has been detected or when the call couldn't be
9776 validated because the size is not constant. */
9781 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9782 mem{cpy,pcpy,move,set} is available. */
9784 {
9799 }
9808 }
9811 else
9812 {
9815 /* If DEST is not a pointer type, call the normal function. */
9819 /* If SRC and DEST are the same (and not volatile), do nothing. */
9821 {
9822 tree expr;
9825 {
9826 /* Evaluate and ignore LEN in case it has side-effects. */
9829 }
9833 }
9835 /* __memmove_chk special case. */
9837 {
9843 /* If src is categorized for a readonly section we can use
9844 normal __memcpy_chk. */
9846 {
9855 }
9856 }
9858 }
9859 }
9861 /* Emit warning if a buffer overflow is detected at compile time. */
9863 static void
9865 {
9866 /* The source string. */
9868 /* The size of the destination object. */
9870 /* The string that is being concatenated with (as in __strcat_chk)
9871 or null if it isn't. */
9873 /* The maximum length of the source sequence in a bounded operation
9874 (such as __strncat_chk) or null if the operation isn't bounded
9875 (such as __strcat_chk). */
9879 {
9887 /* For __strcat_chk the warning will be emitted only if overflowing
9888 by at least strlen (dest) + 1 bytes. */
9915 }
9918 {
9919 /* Check __strncat_chk. There is no way to determine the length
9920 of the string to which the source string is being appended so
9921 just warn when the length of the source string is not known. */
9924 }
9928 }
9930 /* Emit warning if a buffer overflow is detected at compile time
9931 in __sprintf_chk/__vsprintf_chk calls. */
9933 static void
9935 {
9940 /* Verify the required arguments in the original call. */
9950 /* Check whether the format is a literal string constant. */
9958 /* If the format doesn't contain % args or %%, we know its size. */
9961 /* If the format is "%s" and first ... argument is a string literal,
9962 we know it too. */
9965 {
9966 tree arg;
9977 }
9978 else
9981 /* Add one for the terminating nul. */
9985 }
9987 /* Emit warning if a free is called with address of a variable. */
9989 static void
9991 {
10005 else
10008 }
10010 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10011 if possible. */
10013 static tree
10015 {
10032 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10033 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10034 and (size_t) 0 for types 2 and 3. */
10039 {
10043 }
10045 {
10046 /* If object size is not known yet, delay folding until
10047 later. Maybe subsequent passes will help determining
10048 it. */
10052 }
10055 }
10057 /* Builtins with folding operations that operate on "..." arguments
10058 need special handling; we need to store the arguments in a convenient
10059 data structure before attempting any folding. Fortunately there are
10060 only a few builtins that fall into this category. FNDECL is the
10061 function, EXP is the CALL_EXPR for the call. */
10063 static tree
10065 {
10070 {
10077 }
10079 {
10084 }
10086 }
10088 /* Initialize format string characters in the target charset. */
10090 bool
10092 {
10095 {
10118 }
10120 }
10122 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10123 and no overflow/underflow occurred. INEXACT is true if M was not
10124 exactly calculated. TYPE is the tree type for the result. This
10125 function assumes that you cleared the MPFR flags and then
10126 calculated M to see if anything subsequently set a flag prior to
10127 entering this function. Return NULL_TREE if any checks fail. */
10129 static tree
10131 {
10132 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10133 overflow/underflow occurred. If -frounding-math, proceed iff the
10134 result of calling FUNC was exact. */
10137 {
10138 REAL_VALUE_TYPE rr;
10141 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10142 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10143 but the mpft_t is not, then we underflowed in the
10144 conversion. */
10147 {
10148 REAL_VALUE_TYPE rmode;
10151 /* Proceed iff the specified mode can hold the value. */
10154 }
10155 }
10157 }
10159 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10160 number and no overflow/underflow occurred. INEXACT is true if M
10161 was not exactly calculated. TYPE is the tree type for the result.
10162 This function assumes that you cleared the MPFR flags and then
10163 calculated M to see if anything subsequently set a flag prior to
10164 entering this function. Return NULL_TREE if any checks fail, if
10165 FORCE_CONVERT is true, then bypass the checks. */
10167 static tree
10169 {
10170 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10171 overflow/underflow occurred. If -frounding-math, proceed iff the
10172 result of calling FUNC was exact. */
10177 {
10182 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10183 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10184 but the mpft_t is not, then we underflowed in the
10185 conversion. */
10190 {
10195 /* Proceed iff the specified mode can hold the value. */
10201 }
10202 }
10204 }
10206 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10207 the pointer *(ARG_QUO) and return the result. The type is taken
10208 from the type of ARG0 and is used for setting the precision of the
10209 calculation and results. */
10211 static tree
10213 {
10220 /* To proceed, MPFR must exactly represent the target floating point
10221 format, which only happens when the target base equals two. */
10225 {
10230 {
10234 tree result_rem;
10243 /* Remquo is independent of the rounding mode, so pass
10244 inexact=0 to do_mpfr_ckconv(). */
10248 {
10249 /* MPFR calculates quo in the host's long so it may
10250 return more bits in quo than the target int can hold
10251 if sizeof(host long) > sizeof(target int). This can
10252 happen even for native compilers in LP64 mode. In
10253 these cases, modulo the quo value with the largest
10254 number that the target int can hold while leaving one
10255 bit for the sign. */
10259 /* Dereference the quo pointer argument. */
10261 /* Proceed iff a valid pointer type was passed in. */
10263 {
10264 /* Set the value. */
10265 tree result_quo
10268 integer_quo));
10270 /* Combine the quo assignment with the rem. */
10273 }
10274 }
10275 }
10276 }
10278 }
10280 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10281 resulting value as a tree with type TYPE. The mpfr precision is
10282 set to the precision of TYPE. We assume that this mpfr function
10283 returns zero if the result could be calculated exactly within the
10284 requested precision. In addition, the integer pointer represented
10285 by ARG_SG will be dereferenced and set to the appropriate signgam
10286 (-1,1) value. */
10288 static tree
10290 {
10295 /* To proceed, MPFR must exactly represent the target floating point
10296 format, which only happens when the target base equals two. Also
10297 verify ARG is a constant and that ARG_SG is an int pointer. */
10302 {
10305 /* In addition to NaN and Inf, the argument cannot be zero or a
10306 negative integer. */
10310 {
10315 mpfr_t m;
10316 tree result_lg;
10325 {
10326 tree result_sg;
10328 /* Dereference the arg_sg pointer argument. */
10330 /* Assign the signgam value into *arg_sg. */
10335 /* Combine the signgam assignment with the lgamma result. */
10338 }
10339 }
10340 }
10343 }
10345 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10346 mpc function FUNC on it and return the resulting value as a tree
10347 with type TYPE. The mpfr precision is set to the precision of
10348 TYPE. We assume that function FUNC returns zero if the result
10349 could be calculated exactly within the requested precision. If
10350 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10351 in the arguments and/or results. */
10353 tree
10356 {
10362 /* To proceed, MPFR must exactly represent the target floating point
10363 format, which only happens when the target base equals two. */
10369 {
10378 {
10398 }
10399 }
10402 }
10404 /* A wrapper function for builtin folding that prevents warnings for
10405 "statement without effect" and the like, caused by removing the
10406 call node earlier than the warning is generated. */
10408 tree
10410 {
10418 {
10427 {
10429 }
10430 else
10431 {
10434 {
10435 /* Propagate location information from original call to
10436 expansion of builtin. Otherwise things like
10437 maybe_emit_chk_warning, that operate on the expansion
10438 of a builtin, will use the wrong location information. */
10440 {
10448 }
10450 }
10451 }
10452 }
10454 }
10456 /* Look up the function in builtin_decl that corresponds to DECL
10457 and set ASMSPEC as its user assembler name. DECL must be a
10458 function decl that declares a builtin. */
10460 void
10462 {
10472 {
10476 }
10477 }
10479 /* Return true if DECL is a builtin that expands to a constant or similarly
10480 simple code. */
10481 bool
10483 {
10486 {
10487 /* Builtins that expand to constants. */
10492 /* Simple register moves or loads from stack. */
10503 /* Exception state returns or moves registers around. */
10511 }
10514 }
10516 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10517 most probably expanded inline into reasonably simple code. This is a
10518 superset of is_simple_builtin. */
10519 bool
10521 {
10528 {
10530 CASE_BUILT_IN_ALLOCA:
10596 }
10599 }
10601 /* Return true if T is a constant and the value cast to a target char
10602 can be represented by a host char.
10603 Store the casted char constant in *P if so. */
10605 bool
10607 {
10613 }