| blob | f65c3888f7ae123f82da7c30cad95f1446813baf |
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 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 {
1202 rtx stack_save
1204 memory_address
1210 }
1212 /* Expand a call to __builtin_prefetch. For a target that does not support
1213 data prefetch, evaluate the memory address argument in case it has side
1214 effects. */
1216 static void
1218 {
1228 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1229 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1230 locality). */
1234 else
1238 else
1241 /* Argument 0 is an address. */
1244 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1246 {
1249 }
1251 /* Argument 1 must be either zero or one. */
1253 {
1257 }
1259 /* Argument 2 (locality) must be a compile-time constant int. */
1261 {
1264 }
1266 /* Argument 2 must be 0, 1, 2, or 3. */
1268 {
1271 }
1274 {
1282 }
1284 /* Don't do anything with direct references to volatile memory, but
1285 generate code to handle other side effects. */
1288 }
1290 /* Get a MEM rtx for expression EXP which is the address of an operand
1291 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1292 the maximum length of the block of memory that might be accessed or
1293 NULL if unknown. */
1295 static rtx
1297 {
1301 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1302 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1309 /* Get an expression we can use to find the attributes to assign to MEM.
1310 First remove any nops. */
1315 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1316 (as builtin stringops may alias with anything). */
1323 /* If the MEM_REF has no acceptable address, try to get the base object
1324 from the original address we got, and build an all-aliasing
1325 unknown-sized access to that one. */
1331 {
1336 size_zero_node,
1337 NULL)),
1340 }
1343 }
1344 \f
1345 /* Built-in functions to perform an untyped call and return. */
1347 #define apply_args_mode \
1348 (this_target_builtins->x_apply_args_mode)
1349 #define apply_result_mode \
1350 (this_target_builtins->x_apply_result_mode)
1352 /* Return the size required for the block returned by __builtin_apply_args,
1353 and initialize apply_args_mode. */
1355 static int
1357 {
1361 machine_mode mode;
1363 /* The values computed by this function never change. */
1365 {
1366 /* The first value is the incoming arg-pointer. */
1369 /* The second value is the structure value address unless this is
1370 passed as an "invisible" first argument. */
1376 {
1386 }
1387 else
1388 {
1390 }
1391 }
1393 }
1395 /* Return the size required for the block returned by __builtin_apply,
1396 and initialize apply_result_mode. */
1398 static int
1400 {
1403 machine_mode mode;
1405 /* The values computed by this function never change. */
1407 {
1412 {
1422 }
1423 else
1426 /* Allow targets that use untyped_call and untyped_return to override
1427 the size so that machine-specific information can be stored here. */
1428 #ifdef APPLY_RESULT_SIZE
1430 #endif
1431 }
1433 }
1435 /* Create a vector describing the result block RESULT. If SAVEP is true,
1436 the result block is used to save the values; otherwise it is used to
1437 restore the values. */
1439 static rtx
1441 {
1443 machine_mode mode;
1450 {
1460 }
1462 }
1464 /* Save the state required to perform an untyped call with the same
1465 arguments as were passed to the current function. */
1467 static rtx
1469 {
1472 machine_mode mode;
1473 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1475 /* Create a block where the arg-pointer, structure value address,
1476 and argument registers can be saved. */
1479 /* Walk past the arg-pointer and structure value address. */
1484 /* Save each register used in calling a function to the block. */
1487 {
1496 }
1498 /* Save the arg pointer to the block. */
1500 /* We need the pointer as the caller actually passed them to us, not
1501 as we might have pretended they were passed. Make sure it's a valid
1502 operand, as emit_move_insn isn't expected to handle a PLUS. */
1504 tem
1507 NULL_RTX);
1512 /* Save the structure value address unless this is passed as an
1513 "invisible" first argument. */
1515 {
1519 }
1521 /* Return the address of the block. */
1523 }
1525 /* __builtin_apply_args returns block of memory allocated on
1526 the stack into which is stored the arg pointer, structure
1527 value address, static chain, and all the registers that might
1528 possibly be used in performing a function call. The code is
1529 moved to the start of the function so the incoming values are
1530 saved. */
1532 static rtx
1534 {
1535 /* Don't do __builtin_apply_args more than once in a function.
1536 Save the result of the first call and reuse it. */
1539 {
1540 /* When this function is called, it means that registers must be
1541 saved on entry to this function. So we migrate the
1542 call to the first insn of this function. */
1543 rtx temp;
1552 /* Put the insns after the NOTE that starts the function.
1553 If this is inside a start_sequence, make the outer-level insn
1554 chain current, so the code is placed at the start of the
1555 function. If internal_arg_pointer is a non-virtual pseudo,
1556 it needs to be placed after the function that initializes
1557 that pseudo. */
1562 else
1566 }
1567 }
1569 /* Perform an untyped call and save the state required to perform an
1570 untyped return of whatever value was returned by the given function. */
1572 static rtx
1574 {
1576 machine_mode mode;
1585 /* Create a block where the return registers can be saved. */
1588 /* Fetch the arg pointer from the ARGUMENTS block. */
1595 /* Push a new argument block and copy the arguments. Do not allow
1596 the (potential) memcpy call below to interfere with our stack
1597 manipulations. */
1599 NO_DEFER_POP;
1601 /* Save the stack with nonlocal if available. */
1604 else
1607 /* Allocate a block of memory onto the stack and copy the memory
1608 arguments to the outgoing arguments address. We can pass TRUE
1609 as the 4th argument because we just saved the stack pointer
1610 and will restore it right after the call. */
1613 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1614 may have already set current_function_calls_alloca to true.
1615 current_function_calls_alloca won't be set if argsize is zero,
1616 so we have to guarantee need_drap is true here. */
1622 {
1625 else
1627 }
1634 /* Refer to the argument block. */
1639 /* Walk past the arg-pointer and structure value address. */
1644 /* Restore each of the registers previously saved. Make USE insns
1645 for each of these registers for use in making the call. */
1648 {
1656 }
1658 /* Restore the structure value address unless this is passed as an
1659 "invisible" first argument. */
1662 {
1669 }
1671 /* All arguments and registers used for the call are set up by now! */
1674 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1675 and we don't want to load it into a register as an optimization,
1676 because prepare_call_address already did it if it should be done. */
1680 /* Generate the actual call instruction and save the return value. */
1682 {
1686 }
1688 {
1691 /* Locate the unique return register. It is not possible to
1692 express a call that sets more than one return register using
1693 call_value; use untyped_call for that. In fact, untyped_call
1694 only needs to save the return registers in the given block. */
1697 {
1701 }
1708 }
1709 else
1712 /* Find the CALL insn we just emitted, and attach the register usage
1713 information. */
1717 /* Restore the stack. */
1720 else
1724 OK_DEFER_POP;
1726 /* Return the address of the result block. */
1729 }
1731 /* Perform an untyped return. */
1733 static void
1735 {
1737 machine_mode mode;
1738 rtx reg;
1747 {
1752 }
1754 /* Restore the return value and note that each value is used. */
1758 {
1770 }
1772 /* Put the USE insns before the return. */
1775 /* Return whatever values was restored by jumping directly to the end
1776 of the function. */
1778 }
1780 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1782 static enum type_class
1784 {
1786 {
1805 }
1806 }
1808 /* Expand a call EXP to __builtin_classify_type. */
1810 static rtx
1812 {
1816 }
1818 /* This helper macro, meant to be used in mathfn_built_in below,
1819 determines which among a set of three builtin math functions is
1820 appropriate for a given type mode. The `F' and `L' cases are
1821 automatically generated from the `double' case. */
1822 #define CASE_MATHFN(MATHFN) \
1823 CASE_CFN_##MATHFN: \
1824 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1825 fcodel = BUILT_IN_##MATHFN##L ; break;
1826 /* Similar to above, but appends _R after any F/L suffix. */
1827 #define CASE_MATHFN_REENT(MATHFN) \
1828 case CFN_BUILT_IN_##MATHFN##_R: \
1829 case CFN_BUILT_IN_##MATHFN##F_R: \
1830 case CFN_BUILT_IN_##MATHFN##L_R: \
1831 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1832 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1834 /* Return a function equivalent to FN but operating on floating-point
1835 values of type TYPE, or END_BUILTINS if no such function exists.
1836 This is purely an operation on function codes; it does not guarantee
1837 that the target actually has an implementation of the function. */
1839 static built_in_function
1841 {
1845 {
1936 }
1944 else
1946 }
1948 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1949 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1950 otherwise use the explicit declaration. If we can't do the conversion,
1951 return null. */
1953 static tree
1955 {
1964 }
1966 /* Like mathfn_built_in_1, but always use the implicit array. */
1968 tree
1970 {
1972 }
1974 /* Like mathfn_built_in_1, but take a built_in_function and
1975 always use the implicit array. */
1977 tree
1979 {
1981 }
1983 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
1984 return its code, otherwise return IFN_LAST. Note that this function
1985 only tests whether the function is defined in internals.def, not whether
1986 it is actually available on the target. */
1988 internal_fn
1990 {
1994 {
1995 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
1996 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
1997 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
1998 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2015 }
2016 }
2018 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2019 on the current target by a call to an internal function, return the
2020 code of that internal function, otherwise return IFN_LAST. The caller
2021 is responsible for ensuring that any side-effects of the built-in
2022 call are dealt with correctly. E.g. if CALL sets errno, the caller
2023 must decide that the errno result isn't needed or make it available
2024 in some other way. */
2026 internal_fn
2028 {
2030 {
2033 {
2038 }
2039 }
2041 }
2043 /* Expand a call to the builtin trinary math functions (fma).
2044 Return NULL_RTX if a normal call should be emitted rather than expanding the
2045 function in-line. EXP is the expression that is a call to the builtin
2046 function; if convenient, the result should be placed in TARGET.
2047 SUBTARGET may be used as the target for computing one of EXP's
2048 operands. */
2050 static rtx
2052 {
2053 optab builtin_optab;
2058 machine_mode mode;
2068 {
2073 }
2075 /* Make a suitable register to place result in. */
2078 /* Before working hard, check whether the instruction is available. */
2084 /* Always stabilize the argument list. */
2095 /* Compute into RESULT.
2096 Set RESULT to wherever the result comes back. */
2100 /* If we were unable to expand via the builtin, stop the sequence
2101 (without outputting the insns) and call to the library function
2102 with the stabilized argument list. */
2104 {
2107 }
2109 /* Output the entire sequence. */
2115 }
2117 /* Expand a call to the builtin sin and cos math functions.
2118 Return NULL_RTX if a normal call should be emitted rather than expanding the
2119 function in-line. EXP is the expression that is a call to the builtin
2120 function; if convenient, the result should be placed in TARGET.
2121 SUBTARGET may be used as the target for computing one of EXP's
2122 operands. */
2124 static rtx
2126 {
2127 optab builtin_optab;
2128 rtx op0;
2131 machine_mode mode;
2132 tree arg;
2140 {
2146 }
2148 /* Make a suitable register to place result in. */
2151 /* Check if sincos insn is available, otherwise fallback
2152 to sin or cos insn. */
2155 {
2162 }
2164 /* Before working hard, check whether the instruction is available. */
2166 {
2169 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2170 need to expand the argument again. This way, we will not perform
2171 side-effects more the once. */
2178 /* Compute into RESULT.
2179 Set RESULT to wherever the result comes back. */
2181 {
2185 {
2194 }
2196 }
2197 else
2201 {
2202 /* Output the entire sequence. */
2207 }
2209 /* If we were unable to expand via the builtin, stop the sequence
2210 (without outputting the insns) and call to the library function
2211 with the stabilized argument list. */
2213 }
2216 }
2218 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2219 return an RTL instruction code that implements the functionality.
2220 If that isn't possible or available return CODE_FOR_nothing. */
2222 static enum insn_code
2224 {
2227 machine_mode mode;
2230 {
2244 /* These builtins have no optabs (yet). */
2248 }
2250 /* There's no easy way to detect the case we need to set EDOM. */
2254 /* Optab mode depends on the mode of the input argument. */
2260 }
2262 /* Expand a call to one of the builtin math functions that operate on
2263 floating point argument and output an integer result (ilogb, isinf,
2264 isnan, etc).
2265 Return 0 if a normal call should be emitted rather than expanding the
2266 function in-line. EXP is the expression that is a call to the builtin
2267 function; if convenient, the result should be placed in TARGET. */
2269 static rtx
2271 {
2273 rtx op0;
2275 machine_mode mode;
2276 tree arg;
2286 {
2291 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2292 need to expand the argument again. This way, we will not perform
2293 side-effects more the once. */
2308 }
2311 }
2313 /* Expand a call to the builtin sincos math function.
2314 Return NULL_RTX if a normal call should be emitted rather than expanding the
2315 function in-line. EXP is the expression that is a call to the builtin
2316 function. */
2318 static rtx
2320 {
2322 machine_mode mode;
2336 /* Make a suitable register to place result in. */
2339 /* Check if sincos insn is available, otherwise emit the call. */
2354 /* Compute into target1 and target2.
2355 Set TARGET to wherever the result comes back. */
2359 /* Move target1 and target2 to the memory locations indicated
2360 by op1 and op2. */
2365 }
2367 /* Expand a call to the internal cexpi builtin to the sincos math function.
2368 EXP is the expression that is a call to the builtin function; if convenient,
2369 the result should be placed in TARGET. */
2371 static rtx
2373 {
2376 machine_mode mode;
2387 /* Try expanding via a sincos optab, fall back to emitting a libcall
2388 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2389 is only generated from sincos, cexp or if we have either of them. */
2391 {
2397 /* Compute into op1 and op2. */
2399 }
2401 {
2412 else
2422 /* Make sure not to fold the sincos call again. */
2426 }
2427 else
2428 {
2438 else
2441 /* If we don't have a decl for cexp create one. This is the
2442 friendliest fallback if the user calls __builtin_cexpi
2443 without full target C99 function support. */
2445 {
2446 tree fntype;
2458 }
2463 /* Make sure not to fold the cexp call again. */
2467 }
2469 /* Now build the proper return type. */
2474 }
2476 /* Conveniently construct a function call expression. FNDECL names the
2477 function to be called, N is the number of arguments, and the "..."
2478 parameters are the argument expressions. Unlike build_call_exr
2479 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2481 static tree
2483 {
2493 }
2495 /* Expand a call to one of the builtin rounding functions gcc defines
2496 as an extension (lfloor and lceil). As these are gcc extensions we
2497 do not need to worry about setting errno to EDOM.
2498 If expanding via optab fails, lower expression to (int)(floor(x)).
2499 EXP is the expression that is a call to the builtin function;
2500 if convenient, the result should be placed in TARGET. */
2502 static rtx
2504 {
2505 convert_optab builtin_optab;
2510 tree fallback_fndecl;
2511 machine_mode mode;
2512 tree arg;
2520 {
2537 }
2539 /* Make a suitable register to place result in. */
2544 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2545 need to expand the argument again. This way, we will not perform
2546 side-effects more the once. */
2553 /* Compute into TARGET. */
2555 {
2556 /* Output the entire sequence. */
2561 }
2563 /* If we were unable to expand via the builtin, stop the sequence
2564 (without outputting the insns). */
2567 /* Fall back to floating point rounding optab. */
2570 /* For non-C99 targets we may end up without a fallback fndecl here
2571 if the user called __builtin_lfloor directly. In this case emit
2572 a call to the floor/ceil variants nevertheless. This should result
2573 in the best user experience for not full C99 targets. */
2575 {
2576 tree fntype;
2580 {
2613 }
2618 }
2625 /* Truncate the result of floating point optab to integer
2626 via expand_fix (). */
2631 }
2633 /* Expand a call to one of the builtin math functions doing integer
2634 conversion (lrint).
2635 Return 0 if a normal call should be emitted rather than expanding the
2636 function in-line. EXP is the expression that is a call to the builtin
2637 function; if convenient, the result should be placed in TARGET. */
2639 static rtx
2641 {
2642 convert_optab builtin_optab;
2643 rtx op0;
2646 tree arg;
2647 machine_mode mode;
2656 {
2675 }
2677 /* There's no easy way to detect the case we need to set EDOM. */
2681 /* Make a suitable register to place result in. */
2684 /* There's no easy way to detect the case we need to set EDOM. */
2686 {
2689 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2690 need to expand the argument again. This way, we will not perform
2691 side-effects more the once. */
2699 {
2700 /* Output the entire sequence. */
2705 }
2707 /* If we were unable to expand via the builtin, stop the sequence
2708 (without outputting the insns) and call to the library function
2709 with the stabilized argument list. */
2711 }
2714 {
2715 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2716 targets, (int) round (x) should never be transformed into
2717 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2718 a call to lround in the hope that the target provides at least some
2719 C99 functions. This should result in the best user experience for
2720 not full C99 targets. */
2721 tree fallback_fndecl = mathfn_built_in_1
2730 }
2733 }
2735 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2736 a normal call should be emitted rather than expanding the function
2737 in-line. EXP is the expression that is a call to the builtin
2738 function; if convenient, the result should be placed in TARGET. */
2740 static rtx
2742 {
2745 machine_mode mode;
2746 machine_mode mode2;
2755 /* Emit a libcall to libgcc. */
2757 /* Mode of the 2nd argument must match that of an int. */
2775 }
2777 /* Expand expression EXP which is a call to the strlen builtin. Return
2778 NULL_RTX if we failed the caller should emit a normal call, otherwise
2779 try to get the result in TARGET, if convenient. */
2781 static rtx
2783 machine_mode target_mode)
2784 {
2787 else
2788 {
2790 rtx pat;
2791 tree len;
2793 rtx src_reg;
2795 machine_mode insn_mode;
2799 /* If the length can be computed at compile-time, return it. */
2804 /* If the length can be computed at compile-time and is constant
2805 integer, but there are side-effects in src, evaluate
2806 src for side-effects, then return len.
2807 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2808 can be optimized into: i++; x = 3; */
2811 {
2814 }
2818 /* If SRC is not a pointer type, don't do this operation inline. */
2822 /* Bail out if we can't compute strlen in the right mode. */
2824 {
2828 }
2832 /* Make a place to hold the source address. We will not expand
2833 the actual source until we are sure that the expansion will
2834 not fail -- there are trees that cannot be expanded twice. */
2837 /* Mark the beginning of the strlen sequence so we can emit the
2838 source operand later. */
2848 /* Now that we are assured of success, expand the source. */
2852 {
2853 #ifdef POINTERS_EXTEND_UNSIGNED
2856 POINTERS_EXTEND_UNSIGNED);
2857 #endif
2859 }
2865 else
2868 /* Return the value in the proper mode for this function. */
2873 else
2877 }
2878 }
2880 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2881 bytes from constant string DATA + OFFSET and return it as target
2882 constant. */
2884 static rtx
2886 machine_mode mode)
2887 {
2895 }
2897 /* LEN specify length of the block of memcpy/memset operation.
2898 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2899 In some cases we can make very likely guess on max size, then we
2900 set it into PROBABLE_MAX_SIZE. */
2902 static void
2907 {
2909 {
2912 }
2913 else
2914 {
2918 /* Determine bounds from the type. */
2921 else
2926 else
2932 {
2937 }
2939 {
2940 /* Anti range 0...N lets us to determine minimal size to N+1. */
2942 {
2945 }
2946 /* Code like
2948 int n;
2949 if (n < 100)
2950 memcpy (a, b, n)
2952 Produce anti range allowing negative values of N. We still
2953 can use the information and make a guess that N is not negative.
2954 */
2957 }
2958 }
2962 }
2964 /* Try to verify that the sizes and lengths of the arguments to a string
2965 manipulation function given by EXP are within valid bounds and that
2966 the operation does not lead to buffer overflow. Arguments other than
2967 EXP may be null. When non-null, the arguments have the following
2968 meaning:
2969 SIZE is the user-supplied size argument to the function (such as in
2970 memcpy(d, s, SIZE) or strncpy(d, s, SIZE). It specifies the exact
2971 number of bytes to write.
2972 MAXLEN is the user-supplied bound on the length of the source sequence
2973 (such as in strncat(d, s, N). It specifies the upper limit on the number
2974 of bytes to write.
2975 SRC is the source string (such as in strcpy(d, s)) when the expression
2976 EXP is a string function call (as opposed to a memory call like memcpy).
2977 As an exception, SRC can also be an integer denoting the precomputed
2978 size of the source string or object (for functions like memcpy).
2979 OBJSIZE is the size of the destination object specified by the last
2980 argument to the _chk builtins, typically resulting from the expansion
2981 of __builtin_object_size (such as in __builtin___strcpy_chk(d, s,
2982 OBJSIZE).
2984 When SIZE is null LEN is checked to verify that it doesn't exceed
2985 SIZE_MAX.
2987 If the call is successfully verified as safe from buffer overflow
2988 the function returns true, otherwise false.. */
2990 static bool
2992 {
2993 /* The size of the largest object is half the address space, or
2994 SSIZE_MAX. (This is way too permissive.) */
3001 /* Set to true when the exact number of bytes written by a string
3002 function like strcpy is not known and the only thing that is
3003 known is that it must be at least one (for the terminating nul). */
3006 {
3007 /* SRC is normally a pointer to string but as a special case
3008 it can be an integer denoting the length of a string. */
3010 {
3011 /* Try to determine the range of lengths the source string
3012 refers to. If it can be determined and is less than
3013 the upper bound given by MAXLEN add one to it for
3014 the terminating nul. Otherwise, set it to one for
3015 the same reason, or to MAXLEN as appropriate. */
3018 {
3021 else
3032 }
3033 else
3034 {
3037 }
3038 }
3039 else
3041 }
3044 {
3045 /* When the only available piece of data is the object size
3046 there is nothing to do. */
3050 /* Otherwise, when the length of the source sequence is known
3051 (as with with strlen), set SIZE to it. */
3054 }
3059 /* The SIZE is exact if it's non-null, constant, and in range of
3060 unsigned HOST_WIDE_INT. */
3066 /* First check the number of bytes to be written against the maximum
3067 object size. */
3069 {
3075 "%K%qD specified size %E "
3078 else
3080 "%K%qD specified size between %E and %E "
3085 }
3087 /* Next check the number of bytes to be written against the destination
3088 object size. */
3090 {
3096 {
3101 {
3102 /* This is a call to strcpy with a destination of 0 size
3103 and a source of unknown length. The call will write
3104 at least one byte past the end of the destination. */
3106 "%K%qD writing %E or more bytes into a region "
3109 }
3119 {
3120 /* Avoid printing the upper bound if it's invalid. */
3122 "%K%qD writing %E or more bytes into a region "
3125 }
3126 else
3128 "%K%qD writing between %E and %E bytes into "
3131 objsize);
3133 /* Return error when an overflow has been detected. */
3135 }
3136 }
3138 /* Check the maximum length of the source sequence against the size
3139 of the destination object if known, or against the maximum size
3140 of an object. */
3142 {
3146 {
3151 {
3152 /* Warn about crazy big sizes first since that's more
3153 likely to be meaningful than saying that the bound
3154 is greater than the object size if both are big. */
3157 "%K%qD specified bound %E "
3161 else
3163 "%K%qD specified bound between %E and %E "
3169 }
3172 {
3175 "%K%qD specified bound %E "
3179 else
3181 "%K%qD specified bound between %E and %E "
3186 }
3187 }
3188 }
3194 {
3204 {
3205 /* Avoid printing the upper bound if it's invalid. */
3207 "%K%qD reading %E or more bytes from a region "
3210 }
3211 else
3213 "%K%qD reading between %E and %E bytes from a region "
3217 }
3220 }
3222 /* Helper to compute the size of the object referenced by the DEST
3223 expression which must of of pointer type, using Object Size type
3224 OSTYPE (only the least significant 2 bits are used). Return
3225 the size of the object if successful or NULL when the size cannot
3226 be determined. */
3230 {
3236 }
3238 /* Helper to determine and check the sizes of the source and the destination
3239 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3240 call expression, DEST is the destination argument, SRC is the source
3241 argument or null, and LEN is the number of bytes. Use Object Size type-0
3242 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3243 (no overflow or invalid sizes), false otherwise. */
3245 static bool
3247 {
3251 /* For functions like memset and memcpy that operate on raw memory
3252 try to determine the size of the largest source and destination
3253 object using type-0 Object Size regardless of the object size
3254 type specified by the option. */
3260 }
3262 /* Validate memchr arguments without performing any expansion.
3263 Return NULL_RTX. */
3265 static rtx
3267 {
3275 /* Diagnose calls where the specified length exceeds the size
3276 of the object. */
3278 {
3283 }
3286 }
3288 /* Expand a call EXP to the memcpy builtin.
3289 Return NULL_RTX if we failed, the caller should emit a normal call,
3290 otherwise try to get the result in TARGET, if convenient (and in
3291 mode MODE if that's convenient). */
3293 static rtx
3295 {
3308 }
3310 /* Check a call EXP to the memmove built-in for validity.
3311 Return NULL_RTX on both success and failure. */
3313 static rtx
3315 {
3327 }
3329 /* Expand an instrumented call EXP to the memcpy builtin.
3330 Return NULL_RTX if we failed, the caller should emit a normal call,
3331 otherwise try to get the result in TARGET, if convenient (and in
3332 mode MODE if that's convenient). */
3334 static rtx
3336 {
3342 else
3343 {
3350 /* Return src bounds with the result. */
3352 {
3356 }
3358 }
3359 }
3361 /* Expand a call EXP to the mempcpy builtin.
3362 Return NULL_RTX if we failed; the caller should emit a normal call,
3363 otherwise try to get the result in TARGET, if convenient (and in
3364 mode MODE if that's convenient). If ENDP is 0 return the
3365 destination pointer, if ENDP is 1 return the end pointer ala
3366 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3367 stpcpy. */
3369 static rtx
3371 {
3380 /* Avoid expanding mempcpy into memcpy when the call is determined
3381 to overflow the buffer. This also prevents the same overflow
3382 from being diagnosed again when expanding memcpy. */
3388 }
3390 /* Expand an instrumented call EXP to the mempcpy builtin.
3391 Return NULL_RTX if we failed, the caller should emit a normal call,
3392 otherwise try to get the result in TARGET, if convenient (and in
3393 mode MODE if that's convenient). */
3395 static rtx
3397 {
3403 else
3404 {
3411 /* Return src bounds with the result. */
3413 {
3417 }
3419 }
3420 }
3422 /* Helper function to do the actual work for expand of memory copy family
3423 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3424 of memory from SRC to DEST and assign to TARGET if convenient.
3425 If ENDP is 0 return the
3426 destination pointer, if ENDP is 1 return the end pointer ala
3427 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3428 stpcpy. */
3430 static rtx
3433 {
3444 /* If DEST is not a pointer type, call the normal function. */
3448 /* If either SRC is not a pointer type, don't do this
3449 operation in-line. */
3466 /* If SRC is a string constant and block move would be done
3467 by pieces, we can avoid loading the string from memory
3468 and only stored the computed constants. */
3475 {
3477 builtin_memcpy_read_str,
3483 }
3488 /* Copy word part most expediently. */
3497 {
3500 }
3503 {
3505 /* stpcpy pointer to last byte. */
3508 }
3511 }
3513 static rtx
3516 {
3518 endp);
3519 }
3521 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3522 we failed, the caller should emit a normal call, otherwise try to
3523 get the result in TARGET, if convenient. If ENDP is 0 return the
3524 destination pointer, if ENDP is 1 return the end pointer ala
3525 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3526 stpcpy. */
3528 static rtx
3530 {
3532 rtx dest_mem;
3533 rtx src_mem;
3541 {
3544 }
3553 {
3555 /* movstr is supposed to set end to the address of the NUL
3556 terminator. If the caller requested a mempcpy-like return value,
3557 adjust it. */
3559 {
3563 }
3564 }
3566 }
3568 /* Do some very basic size validation of a call to the strcpy builtin
3569 given by EXP. Return NULL_RTX to have the built-in expand to a call
3570 to the library function. */
3572 static rtx
3574 {
3582 /* There is no way here to determine the length of the string in
3583 the destination to which the SRC string is being appended so
3584 just diagnose cases when the souce string is longer than
3585 the destination object. */
3593 }
3595 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3596 NULL_RTX if we failed the caller should emit a normal call, otherwise
3597 try to get the result in TARGET, if convenient (and in mode MODE if that's
3598 convenient). */
3600 static rtx
3602 {
3610 {
3614 }
3617 }
3619 /* Helper function to do the actual work for expand_builtin_strcpy. The
3620 arguments to the builtin_strcpy call DEST and SRC are broken out
3621 so that this can also be called without constructing an actual CALL_EXPR.
3622 The other arguments and return value are the same as for
3623 expand_builtin_strcpy. */
3625 static rtx
3627 {
3629 }
3631 /* Expand a call EXP to the stpcpy builtin.
3632 Return NULL_RTX if we failed the caller should emit a normal call,
3633 otherwise try to get the result in TARGET, if convenient (and in
3634 mode MODE if that's convenient). */
3636 static rtx
3638 {
3649 {
3653 }
3655 /* If return value is ignored, transform stpcpy into strcpy. */
3657 {
3661 }
3662 else
3663 {
3665 rtx ret;
3667 /* Ensure we get an actual string whose length can be evaluated at
3668 compile-time, not an expression containing a string. This is
3669 because the latter will potentially produce pessimized code
3670 when used to produce the return value. */
3682 {
3686 {
3690 {
3692 {
3695 else
3697 }
3706 }
3707 }
3708 }
3711 }
3712 }
3714 /* Check a call EXP to the stpncpy built-in for validity.
3715 Return NULL_RTX on both success and failure. */
3717 static rtx
3719 {
3725 /* The source and destination of the call. */
3729 /* The exact number of bytes to write (not the maximum). */
3732 /* The size of the destination object. */
3739 }
3741 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3742 bytes from constant string DATA + OFFSET and return it as target
3743 constant. */
3745 rtx
3747 machine_mode mode)
3748 {
3755 }
3757 /* Helper to check the sizes of sequences and the destination of calls
3758 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3759 success (no overflow or invalid sizes), false otherwise. */
3761 static bool
3763 {
3768 /* Try to determine the range of lengths that the source expression
3769 refers to. */
3773 /* Try to verify that the destination is big enough for the shortest
3774 string. */
3777 {
3778 /* If it hasn't been provided by __strncat_chk, try to determine
3779 the size of the destination object into which the source is
3780 being copied. */
3782 }
3784 /* Add one for the terminating nul. */
3787 size_one_node)
3790 /* Strncat copies at most MAXLEN bytes and always appends the terminating
3791 nul so the specified upper bound should never be equal to (or greater
3792 than) the size of the destination. */
3795 {
3804 }
3812 /* The number of bytes to write is LEN but check_sizes will also
3813 check SRCLEN if LEN's value isn't known. */
3816 }
3818 /* Similar to expand_builtin_strcat, do some very basic size validation
3819 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3820 the built-in expand to a call to the library function. */
3822 static rtx
3824 {
3832 /* The upper bound on the number of bytes to write. */
3834 /* The length of the source sequence. */
3837 /* Try to determine the range of lengths that the source expression
3838 refers to. */
3842 else
3845 /* Try to verify that the destination is big enough for the shortest
3846 string. First try to determine the size of the destination object
3847 into which the source is being copied. */
3850 /* Add one for the terminating nul. */
3853 size_one_node)
3856 /* Strncat copies at most MAXLEN bytes and always appends the terminating
3857 nul so the specified upper bound should never be equal to (or greater
3858 than) the size of the destination. */
3861 {
3870 }
3878 /* The number of bytes to write is LEN but check_sizes will also
3879 check SRCLEN if LEN's value isn't known. */
3884 }
3886 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3887 NULL_RTX if we failed the caller should emit a normal call. */
3889 static rtx
3891 {
3896 {
3899 /* The number of bytes to write (not the maximum). */
3901 /* The length of the source sequence. */
3905 {
3909 /* The number of bytes to write is LEN but check_sizes will also
3910 check SLEN if LEN's value isn't known. */
3913 }
3915 /* We must be passed a constant len and src parameter. */
3921 /* We're required to pad with trailing zeros if the requested
3922 len is greater than strlen(s2)+1. In that case try to
3923 use store_by_pieces, if it fails, punt. */
3925 {
3928 rtx dest_mem;
3932 builtin_strncpy_read_str,
3939 builtin_strncpy_read_str,
3944 }
3945 }
3947 }
3949 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3950 bytes from constant string DATA + OFFSET and return it as target
3951 constant. */
3953 rtx
3955 machine_mode mode)
3956 {
3963 }
3965 /* Callback routine for store_by_pieces. Return the RTL of a register
3966 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3967 char value given in the RTL register data. For example, if mode is
3968 4 bytes wide, return the RTL for 0x01010101*data. */
3970 static rtx
3972 machine_mode mode)
3973 {
3989 }
3991 /* Expand expression EXP, which is a call to the memset builtin. Return
3992 NULL_RTX if we failed the caller should emit a normal call, otherwise
3993 try to get the result in TARGET, if convenient (and in mode MODE if that's
3994 convenient). */
3996 static rtx
3998 {
4010 }
4012 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4013 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4014 try to get the result in TARGET, if convenient (and in mode MODE if that's
4015 convenient). */
4017 static rtx
4019 {
4024 else
4025 {
4031 /* Return src bounds with the result. */
4033 {
4037 }
4039 }
4040 }
4042 /* Helper function to do the actual work for expand_builtin_memset. The
4043 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4044 so that this can also be called without constructing an actual CALL_EXPR.
4045 The other arguments and return value are the same as for
4046 expand_builtin_memset. */
4048 static rtx
4051 {
4054 machine_mode val_mode;
4066 /* If DEST is not a pointer type, don't do this operation in-line. */
4077 /* If the LEN parameter is zero, return DEST. */
4079 {
4080 /* Evaluate and ignore VAL in case it has side-effects. */
4083 }
4085 /* Stabilize the arguments in case we fail. */
4097 {
4098 rtx val_rtx;
4103 /* Assume that we can memset by pieces if we can store
4104 * the coefficients by pieces (in the required modes).
4105 * We can't pass builtin_memset_gen_str as that emits RTL. */
4111 {
4116 }
4120 probable_max_size))
4126 }
4132 {
4143 probable_max_size))
4149 }
4157 probable_max_size);
4160 {
4163 }
4167 do_libcall:
4177 else
4182 }
4184 /* Expand expression EXP, which is a call to the bzero builtin. Return
4185 NULL_RTX if we failed the caller should emit a normal call. */
4187 static rtx
4189 {
4198 /* New argument list transforming bzero(ptr x, int y) to
4199 memset(ptr x, int 0, size_t y). This is done this way
4200 so that if it isn't expanded inline, we fallback to
4201 calling bzero instead of memset. */
4209 }
4211 /* Try to expand cmpstr operation ICODE with the given operands.
4212 Return the result rtx on success, otherwise return null. */
4214 static rtx
4216 HOST_WIDE_INT align)
4217 {
4231 }
4233 /* Expand expression EXP, which is a call to the memcmp built-in function.
4234 Return NULL_RTX if we failed and the caller should emit a normal call,
4235 otherwise try to get the result in TARGET, if convenient.
4236 RESULT_EQ is true if we can relax the returned value to be either zero
4237 or nonzero, without caring about the sign. */
4239 static rtx
4241 {
4250 /* Diagnose calls where the specified length exceeds the size of either
4251 object. */
4253 {
4258 {
4263 }
4264 }
4272 /* If we don't have POINTER_TYPE, call the function. */
4280 /* Set MEM_SIZE as appropriate. */
4282 {
4285 }
4291 {
4295 }
4297 /* If SRC is a string constant and block move would be done
4298 by pieces, we can avoid loading the string from memory
4299 and only stored the computed constants. */
4311 {
4312 /* Return the value in the proper mode for this function. */
4317 {
4320 }
4323 }
4326 }
4328 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4329 if we failed the caller should emit a normal call, otherwise try to get
4330 the result in TARGET, if convenient. */
4332 static rtx
4334 {
4341 {
4351 /* If we don't have POINTER_TYPE, call the function. */
4355 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4362 /* Try to call cmpstrsi. */
4367 /* Try to determine at least one length and call cmpstrnsi. */
4369 {
4370 tree len;
4371 rtx arg3_rtx;
4381 /* If we don't have a constant length for the first, use the length
4382 of the second, if we know it. We don't require a constant for
4383 this case; some cost analysis could be done if both are available
4384 but neither is constant. For now, assume they're equally cheap,
4385 unless one has side effects. If both strings have constant lengths,
4386 use the smaller. */
4402 else
4405 /* If both arguments have side effects, we cannot optimize. */
4407 {
4409 result = expand_cmpstrn_or_cmpmem
4412 }
4413 }
4416 {
4417 /* Return the value in the proper mode for this function. */
4425 }
4427 /* Expand the library call ourselves using a stabilized argument
4428 list to avoid re-evaluating the function's arguments twice. */
4434 }
4436 }
4438 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4439 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4440 the result in TARGET, if convenient. */
4442 static rtx
4444 ATTRIBUTE_UNUSED machine_mode mode)
4445 {
4452 /* If c_strlen can determine an expression for one of the string
4453 lengths, and it doesn't have side effects, then emit cmpstrnsi
4454 using length MIN(strlen(string)+1, arg3). */
4457 {
4460 rtx result;
4479 /* If we don't have a constant length for the first, use the length
4480 of the second, if we know it. If neither string is constant length,
4481 use the given length argument. We don't require a constant for
4482 this case; some cost analysis could be done if both are available
4483 but neither is constant. For now, assume they're equally cheap,
4484 unless one has side effects. If both strings have constant lengths,
4485 use the smaller. */
4503 else
4506 /* If we are not using the given length, we must incorporate it here.
4507 The actual new length parameter will be MIN(len,arg3) in this case. */
4517 {
4518 /* Return the value in the proper mode for this function. */
4526 }
4528 /* Expand the library call ourselves using a stabilized argument
4529 list to avoid re-evaluating the function's arguments twice. */
4536 }
4538 }
4540 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4541 if that's convenient. */
4543 rtx
4545 {
4546 rtx val;
4549 /* Don't do __builtin_saveregs more than once in a function.
4550 Save the result of the first call and reuse it. */
4554 /* When this function is called, it means that registers must be
4555 saved on entry to this function. So we migrate the call to the
4556 first insn of this function. */
4560 /* Do whatever the machine needs done in this case. */
4568 /* Put the insns after the NOTE that starts the function. If this
4569 is inside a start_sequence, make the outer-level insn chain current, so
4570 the code is placed at the start of the function. */
4576 }
4578 /* Expand a call to __builtin_next_arg. */
4580 static rtx
4582 {
4583 /* Checking arguments is already done in fold_builtin_next_arg
4584 that must be called before this function. */
4589 }
4591 /* Make it easier for the backends by protecting the valist argument
4592 from multiple evaluations. */
4594 static tree
4596 {
4599 /* The current way of determining the type of valist is completely
4600 bogus. We should have the information on the va builtin instead. */
4605 {
4609 /* For this case, the backends will be expecting a pointer to
4610 vatype, but it's possible we've actually been given an array
4611 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4612 So fix it. */
4614 {
4617 }
4618 }
4619 else
4620 {
4624 {
4630 }
4636 }
4639 }
4641 /* The "standard" definition of va_list is void*. */
4643 tree
4645 {
4647 }
4649 /* The "standard" abi va_list is va_list_type_node. */
4651 tree
4653 {
4655 }
4657 /* The "standard" type of va_list is va_list_type_node. */
4659 tree
4661 {
4668 {
4669 /* If va_list is an array type, the argument may have decayed
4670 to a pointer type, e.g. by being passed to another function.
4671 In that case, unwrap both types so that we can compare the
4672 underlying records. */
4675 {
4678 }
4679 }
4684 }
4686 /* The "standard" implementation of va_start: just assign `nextarg' to
4687 the variable. */
4689 void
4691 {
4695 /* We do not have any valid bounds for the pointer, so
4696 just store zero bounds for it. */
4700 nextarg));
4701 }
4703 /* Expand EXP, a call to __builtin_va_start. */
4705 static rtx
4707 {
4708 rtx nextarg;
4709 tree valist;
4713 {
4716 }
4726 else
4730 }
4732 /* Expand EXP, a call to __builtin_va_end. */
4734 static rtx
4736 {
4739 /* Evaluate for side effects, if needed. I hate macros that don't
4740 do that. */
4745 }
4747 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4748 builtin rather than just as an assignment in stdarg.h because of the
4749 nastiness of array-type va_list types. */
4751 static rtx
4753 {
4766 {
4770 }
4771 else
4772 {
4775 /* Evaluate to pointers. */
4784 /* "Dereference" to BLKmode memories. */
4792 /* Copy. */
4794 }
4797 }
4799 /* Expand a call to one of the builtin functions __builtin_frame_address or
4800 __builtin_return_address. */
4802 static rtx
4804 {
4805 /* The argument must be a nonnegative integer constant.
4806 It counts the number of frames to scan up the stack.
4807 The value is either the frame pointer value or the return
4808 address saved in that frame. */
4810 /* Warning about missing arg was already issued. */
4813 {
4816 }
4817 else
4818 {
4819 /* Number of frames to scan up the stack. */
4824 /* Some ports cannot access arbitrary stack frames. */
4826 {
4829 }
4832 {
4833 /* Warn since no effort is made to ensure that any frame
4834 beyond the current one exists or can be safely reached. */
4837 }
4839 /* For __builtin_frame_address, return what we've got. */
4847 }
4848 }
4850 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
4851 failed and the caller should emit a normal call. */
4853 static rtx
4855 {
4856 rtx op0;
4857 rtx result;
4863 bool valid_arglist
4864 = (alloca_with_align
4873 {
4874 /* -Walloca-larger-than and -Wvla-larger-than settings override
4875 the more general -Walloc-size-larger-than so unless either of
4876 the former options is specified check the alloca arguments for
4877 overflow. */
4881 }
4883 /* Compute the argument. */
4886 /* Compute the alignment. */
4887 align = (alloca_with_align
4891 /* Allocate the desired space. If the allocation stems from the declaration
4892 of a variable-sized object, it cannot accumulate. */
4897 }
4899 /* Emit a call to __asan_allocas_unpoison call in EXP. Replace second argument
4900 of the call with virtual_stack_dynamic_rtx because in asan pass we emit a
4901 dummy value into second parameter relying on this function to perform the
4902 change. See motivation for this in comment to handle_builtin_stack_restore
4903 function. */
4905 static rtx
4907 {
4915 }
4917 /* Expand a call to bswap builtin in EXP.
4918 Return NULL_RTX if a normal call should be emitted rather than expanding the
4919 function in-line. If convenient, the result should be placed in TARGET.
4920 SUBTARGET may be used as the target for computing one of EXP's operands. */
4922 static rtx
4924 rtx subtarget)
4925 {
4926 tree arg;
4927 rtx op0;
4945 }
4947 /* Expand a call to a unary builtin in EXP.
4948 Return NULL_RTX if a normal call should be emitted rather than expanding the
4949 function in-line. If convenient, the result should be placed in TARGET.
4950 SUBTARGET may be used as the target for computing one of EXP's operands. */
4952 static rtx
4955 {
4956 rtx op0;
4961 /* Compute the argument. */
4963 (subtarget
4967 /* Compute op, into TARGET if possible.
4968 Set TARGET to wherever the result comes back. */
4974 }
4976 /* Expand a call to __builtin_expect. We just return our argument
4977 as the builtin_expect semantic should've been already executed by
4978 tree branch prediction pass. */
4980 static rtx
4982 {
4983 tree arg;
4990 /* When guessing was done, the hints should be already stripped away. */
4994 }
4996 /* Expand a call to __builtin_assume_aligned. We just return our first
4997 argument as the builtin_assume_aligned semantic should've been already
4998 executed by CCP. */
5000 static rtx
5002 {
5006 EXPAND_NORMAL);
5011 }
5013 void
5015 {
5017 {
5019 /* For trap insns when not accumulating outgoing args force
5020 REG_ARGS_SIZE note to prevent crossjumping of calls with
5021 different args sizes. */
5024 }
5025 else
5026 {
5030 }
5033 }
5035 /* Expand a call to __builtin_unreachable. We do nothing except emit
5036 a barrier saying that control flow will not pass here.
5038 It is the responsibility of the program being compiled to ensure
5039 that control flow does never reach __builtin_unreachable. */
5040 static void
5042 {
5044 }
5046 /* Expand EXP, a call to fabs, fabsf or fabsl.
5047 Return NULL_RTX if a normal call should be emitted rather than expanding
5048 the function inline. If convenient, the result should be placed
5049 in TARGET. SUBTARGET may be used as the target for computing
5050 the operand. */
5052 static rtx
5054 {
5055 machine_mode mode;
5056 tree arg;
5057 rtx op0;
5067 }
5069 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5070 Return NULL is a normal call should be emitted rather than expanding the
5071 function inline. If convenient, the result should be placed in TARGET.
5072 SUBTARGET may be used as the target for computing the operand. */
5074 static rtx
5076 {
5078 tree arg;
5090 }
5092 /* Expand a call to __builtin___clear_cache. */
5094 static rtx
5096 {
5098 {
5099 #ifdef CLEAR_INSN_CACHE
5100 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5101 does something. Just do the default expansion to a call to
5102 __clear_cache(). */
5104 #else
5105 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5106 does nothing. There is no need to call it. Do nothing. */
5109 }
5111 /* We have a "clear_cache" insn, and it will handle everything. */
5115 /* We must not expand to a library call. If we did, any
5116 fallback library function in libgcc that might contain a call to
5117 __builtin___clear_cache() would recurse infinitely. */
5119 {
5122 }
5125 {
5138 }
5140 }
5142 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5144 static rtx
5146 {
5149 /* If we don't need too much alignment, we'll have been guaranteed
5150 proper alignment by get_trampoline_type. */
5154 /* Round address up to desired boundary. */
5165 }
5167 static rtx
5169 {
5185 /* If ONSTACK, the TRAMP argument should be the address of a field
5186 within the local function's FRAME decl. Either way, let's see if
5187 we can fill in the MEM_ATTRs for this memory. */
5191 /* Creator of a heap trampoline is responsible for making sure the
5192 address is aligned to at least STACK_BOUNDARY. Normally malloc
5193 will ensure this anyhow. */
5196 {
5200 }
5202 /* The FUNC argument should be the address of the nested function.
5203 Extract the actual function decl to pass to the hook. */
5210 /* Generate insns to initialize the trampoline. */
5214 {
5220 }
5223 }
5225 static rtx
5227 {
5228 rtx tramp;
5239 }
5241 /* Expand a call to the builtin descriptor initialization routine.
5242 A descriptor is made up of a couple of pointers to the static
5243 chain and the code entry in this order. */
5245 static rtx
5247 {
5252 VOID_TYPE))
5266 /* Generate insns to initialize the descriptor. */
5272 }
5274 /* Expand a call to the builtin descriptor adjustment routine. */
5276 static rtx
5278 {
5279 rtx tramp;
5286 /* Unalign the descriptor to allow runtime identification. */
5291 }
5293 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5294 function. The function first checks whether the back end provides
5295 an insn to implement signbit for the respective mode. If not, it
5296 checks whether the floating point format of the value is such that
5297 the sign bit can be extracted. If that is not the case, error out.
5298 EXP is the expression that is a call to the builtin function; if
5299 convenient, the result should be placed in TARGET. */
5300 static rtx
5302 {
5304 scalar_float_mode fmode;
5306 tree arg;
5309 rtx temp;
5322 /* Expand the argument yielding a RTX expression. */
5325 /* Check if the back end provides an insn that handles signbit for the
5326 argument's mode. */
5329 {
5335 }
5337 /* For floating point formats without a sign bit, implement signbit
5338 as "ARG < 0.0". */
5341 {
5342 /* But we can't do this if the format supports signed zero. */
5348 }
5351 {
5354 }
5355 else
5356 {
5358 /* Handle targets with different FP word orders. */
5361 else
5365 }
5367 /* Force the intermediate word_mode (or narrower) result into a
5368 register. This avoids attempting to create paradoxical SUBREGs
5369 of floating point modes below. */
5372 /* If the bitpos is within the "result mode" lowpart, the operation
5373 can be implement with a single bitwise AND. Otherwise, we need
5374 a right shift and an AND. */
5377 {
5385 }
5386 else
5387 {
5388 /* Perform a logical right shift to place the signbit in the least
5389 significant bit, then truncate the result to the desired mode
5390 and mask just this bit. */
5395 }
5398 }
5400 /* Expand fork or exec calls. TARGET is the desired target of the
5401 call. EXP is the call. FN is the
5402 identificator of the actual function. IGNORE is nonzero if the
5403 value is to be ignored. */
5405 static rtx
5407 {
5409 tree call;
5411 /* If we are not profiling, just call the function. */
5415 /* Otherwise call the wrapper. This should be equivalent for the rest of
5416 compiler, so the code does not diverge, and the wrapper may run the
5417 code necessary for keeping the profiling sane. */
5420 {
5451 }
5463 }
5466 \f
5467 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5468 the pointer in these functions is void*, the tree optimizers may remove
5469 casts. The mode computed in expand_builtin isn't reliable either, due
5470 to __sync_bool_compare_and_swap.
5472 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5473 group of builtins. This gives us log2 of the mode size. */
5477 {
5478 /* The size is not negotiable, so ask not to get BLKmode in return
5479 if the target indicates that a smaller size would be better. */
5481 }
5483 /* Expand the memory expression LOC and return the appropriate memory operand
5484 for the builtin_sync operations. */
5486 static rtx
5488 {
5494 /* Note that we explicitly do not want any alias information for this
5495 memory, so that we kill all other live memories. Otherwise we don't
5496 satisfy the full barrier semantics of the intrinsic. */
5499 /* The alignment needs to be at least according to that of the mode. */
5506 }
5508 /* Make sure an argument is in the right mode.
5509 EXP is the tree argument.
5510 MODE is the mode it should be in. */
5512 static rtx
5514 {
5515 rtx val;
5516 machine_mode old_mode;
5519 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5520 of CONST_INTs, where we know the old_mode only from the call argument. */
5527 }
5530 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5531 EXP is the CALL_EXPR. CODE is the rtx code
5532 that corresponds to the arithmetic or logical operation from the name;
5533 an exception here is that NOT actually means NAND. TARGET is an optional
5534 place for us to store the results; AFTER is true if this is the
5535 fetch_and_xxx form. */
5537 static rtx
5540 rtx target)
5541 {
5546 {
5553 {
5582 }
5583 }
5585 /* Expand the operands. */
5590 after);
5591 }
5593 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5594 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5595 true if this is the boolean form. TARGET is a place for us to store the
5596 results; this is NOT optional if IS_BOOL is true. */
5598 static rtx
5601 {
5605 /* Expand the operands. */
5612 {
5615 else
5617 }
5620 MEMMODEL_SYNC_SEQ_CST))
5624 }
5626 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5627 general form is actually an atomic exchange, and some targets only
5628 support a reduced form with the second argument being a constant 1.
5629 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5630 the results. */
5632 static rtx
5634 rtx target)
5635 {
5638 /* Expand the operands. */
5643 }
5645 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5647 static void
5649 {
5650 rtx mem;
5652 /* Expand the operands. */
5656 }
5658 /* Given an integer representing an ``enum memmodel'', verify its
5659 correctness and return the memory model enum. */
5661 static enum memmodel
5663 {
5664 rtx op;
5666 source_location loc
5669 /* If the parameter is not a constant, it's a run time value so we'll just
5670 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5680 {
5684 }
5686 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5688 {
5692 }
5694 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5695 be conservative and promote consume to acquire. */
5700 }
5702 /* Expand the __atomic_exchange intrinsic:
5703 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5704 EXP is the CALL_EXPR.
5705 TARGET is an optional place for us to store the results. */
5707 static rtx
5709 {
5718 /* Expand the operands. */
5723 }
5725 /* Expand the __atomic_compare_exchange intrinsic:
5726 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5727 TYPE desired, BOOL weak,
5728 enum memmodel success,
5729 enum memmodel failure)
5730 EXP is the CALL_EXPR.
5731 TARGET is an optional place for us to store the results. */
5733 static rtx
5735 rtx target)
5736 {
5740 tree weak;
5742 source_location loc
5749 {
5751 "failure memory model cannot be stronger than success "
5754 }
5757 {
5759 "invalid failure memory model for "
5763 }
5769 /* Expand the operands. */
5785 /* Lest the rtl backend create a race condition with an imporoper store
5786 to memory, always create a new pseudo for OLDVAL. */
5793 /* Conditionally store back to EXPECT, lest we create a race condition
5794 with an improper store to memory. */
5795 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5796 the normal case where EXPECT is totally private, i.e. a register. At
5797 which point the store can be unconditional. */
5805 }
5807 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5808 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5809 call. The weak parameter must be dropped to match the expected parameter
5810 list and the expected argument changed from value to pointer to memory
5811 slot. */
5813 static void
5815 {
5831 /* Skip the boolean weak parameter. */
5834 built_in_function fncode
5839 fndecl);
5844 {
5851 }
5852 }
5854 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
5856 void
5858 {
5864 tree lhs;
5866 source_location loc
5873 {
5875 "failure memory model cannot be stronger than success "
5878 }
5881 {
5883 "invalid failure memory model for "
5887 }
5890 {
5893 }
5895 /* Expand the operands. */
5908 {
5911 }
5915 {
5921 }
5922 }
5924 /* Expand the __atomic_load intrinsic:
5925 TYPE __atomic_load (TYPE *object, enum memmodel)
5926 EXP is the CALL_EXPR.
5927 TARGET is an optional place for us to store the results. */
5929 static rtx
5931 {
5932 rtx mem;
5937 {
5938 source_location loc
5943 }
5948 /* Expand the operand. */
5952 }
5955 /* Expand the __atomic_store intrinsic:
5956 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
5957 EXP is the CALL_EXPR.
5958 TARGET is an optional place for us to store the results. */
5960 static rtx
5962 {
5969 {
5970 source_location loc
5975 }
5980 /* Expand the operands. */
5985 }
5987 /* Expand the __atomic_fetch_XXX intrinsic:
5988 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
5989 EXP is the CALL_EXPR.
5990 TARGET is an optional place for us to store the results.
5991 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
5992 FETCH_AFTER is true if returning the result of the operation.
5993 FETCH_AFTER is false if returning the value before the operation.
5994 IGNORE is true if the result is not used.
5995 EXT_CALL is the correct builtin for an external call if this cannot be
5996 resolved to an instruction sequence. */
5998 static rtx
6002 {
6005 tree fndecl;
6006 tree addr;
6010 /* Expand the operands. */
6014 /* Only try generating instructions if inlining is turned on. */
6016 {
6020 }
6022 /* Return if a different routine isn't needed for the library call. */
6026 /* Change the call to the specified function. */
6034 /* If we will emit code after the call, the call can not be a tail call.
6035 If it is emitted as a tail call, a barrier is emitted after it, and
6036 then all trailing code is removed. */
6040 /* Expand the call here so we can emit trailing code. */
6043 /* Replace the original function just in case it matters. */
6046 /* Then issue the arithmetic correction to return the right result. */
6048 {
6050 {
6052 OPTAB_LIB_WIDEN);
6054 }
6055 else
6057 OPTAB_LIB_WIDEN);
6058 }
6060 }
6062 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6064 void
6066 {
6074 optab optab;
6086 {
6101 }
6104 {
6111 }
6133 {
6138 }
6139 else
6141 OPTAB_DIRECT);
6144 }
6146 /* Expand an atomic clear operation.
6147 void _atomic_clear (BOOL *obj, enum memmodel)
6148 EXP is the call expression. */
6150 static rtx
6152 {
6153 machine_mode mode;
6162 {
6163 source_location loc
6168 }
6170 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6171 Failing that, a store is issued by __atomic_store. The only way this can
6172 fail is if the bool type is larger than a word size. Unlikely, but
6173 handle it anyway for completeness. Assume a single threaded model since
6174 there is no atomic support in this case, and no barriers are required. */
6179 }
6181 /* Expand an atomic test_and_set operation.
6182 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6183 EXP is the call expression. */
6185 static rtx
6187 {
6188 rtx mem;
6190 machine_mode mode;
6197 }
6200 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6201 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6203 static tree
6205 {
6207 machine_mode mode;
6218 {
6221 /* Either this argument is null, or it's a fake pointer encoding
6222 the alignment of the object. */
6228 else
6230 }
6231 else
6232 {
6235 /* This function is usually invoked and folded immediately by the front
6236 end before anything else has a chance to look at it. The pointer
6237 parameter at this point is usually cast to a void *, so check for that
6238 and look past the cast. */
6248 /* Get the underlying type of the object. */
6251 }
6253 /* If the object has smaller alignment, the lock free routines cannot
6254 be used. */
6258 /* Check if a compare_and_swap pattern exists for the mode which represents
6259 the required size. The pattern is not allowed to fail, so the existence
6260 of the pattern indicates support is present. Also require that an
6261 atomic load exists for the required size. */
6264 else
6266 }
6268 /* Return true if the parameters to call EXP represent an object which will
6269 always generate lock free instructions. The first argument represents the
6270 size of the object, and the second parameter is a pointer to the object
6271 itself. If NULL is passed for the object, then the result is based on
6272 typical alignment for an object of the specified size. Otherwise return
6273 false. */
6275 static rtx
6277 {
6278 tree size;
6283 {
6286 }
6292 }
6294 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6295 is lock free on this architecture. */
6297 static tree
6299 {
6303 /* If it isn't always lock free, don't generate a result. */
6308 }
6310 /* Return true if the parameters to call EXP represent an object which will
6311 always generate lock free instructions. The first argument represents the
6312 size of the object, and the second parameter is a pointer to the object
6313 itself. If NULL is passed for the object, then the result is based on
6314 typical alignment for an object of the specified size. Otherwise return
6315 NULL*/
6317 static rtx
6319 {
6320 tree size;
6325 {
6328 }
6333 /* If the value is known at compile time, return the RTX for it. */
6339 }
6341 /* Expand the __atomic_thread_fence intrinsic:
6342 void __atomic_thread_fence (enum memmodel)
6343 EXP is the CALL_EXPR. */
6345 static void
6347 {
6350 }
6352 /* Expand the __atomic_signal_fence intrinsic:
6353 void __atomic_signal_fence (enum memmodel)
6354 EXP is the CALL_EXPR. */
6356 static void
6358 {
6361 }
6363 /* Expand the __sync_synchronize intrinsic. */
6365 static void
6367 {
6369 }
6371 static rtx
6373 {
6379 {
6381 /* If the target is not sutitable then create a new target. */
6389 }
6392 }
6394 static void
6396 {
6402 {
6409 }
6411 }
6413 \f
6414 /* Emit code to restore the current value of stack. */
6416 static void
6418 {
6430 }
6432 /* Emit code to save the current value of stack. */
6434 static rtx
6436 {
6441 }
6444 /* Expand an expression EXP that calls a built-in function,
6445 with result going to TARGET if that's convenient
6446 (and in mode MODE if that's convenient).
6447 SUBTARGET may be used as the target for computing one of EXP's operands.
6448 IGNORE is nonzero if the value is to be ignored. */
6450 rtx
6453 {
6462 /* When ASan is enabled, we don't want to expand some memory/string
6463 builtins and rely on libsanitizer's hooks. This allows us to avoid
6464 redundant checks and be sure, that possible overflow will be detected
6465 by ASan. */
6470 /* When not optimizing, generate calls to library functions for a certain
6471 set of builtins. */
6498 /* The built-in function expanders test for target == const0_rtx
6499 to determine whether the function's result will be ignored. */
6503 /* If the result of a pure or const built-in function is ignored, and
6504 none of its arguments are volatile, we can avoid expanding the
6505 built-in call and just evaluate the arguments for side-effects. */
6509 {
6511 tree arg;
6512 call_expr_arg_iterator iter;
6516 {
6519 }
6522 {
6526 }
6527 }
6529 /* expand_builtin_with_bounds is supposed to be used for
6530 instrumented builtin calls. */
6534 {
6552 /* Just do a normal library call if we were unable to fold
6553 the values. */
6629 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6630 FUNCTION with a copy of the parameters described by
6631 ARGUMENTS, and ARGSIZE. It returns a block of memory
6632 allocated on the stack into which is stored all the registers
6633 that might possibly be used for returning the result of a
6634 function. ARGUMENTS is the value returned by
6635 __builtin_apply_args. ARGSIZE is the number of bytes of
6636 arguments that must be copied. ??? How should this value be
6637 computed? We'll also need a safe worst case value for varargs
6638 functions. */
6645 else
6646 {
6654 }
6656 /* __builtin_return (RESULT) causes the function to return the
6657 value described by RESULT. RESULT is address of the block of
6658 memory returned by __builtin_apply. */
6668 /* All valid uses of __builtin_va_arg_pack () are removed during
6669 inlining. */
6674 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6675 inlining. */
6679 /* Return the address of the first anonymous stack arg. */
6701 /* Returns the address of the area where the structure is returned.
6702 0 otherwise. */
6708 else
6875 {
6878 }
6882 /* This should have been lowered to the builtins below. */
6886 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6887 and the receiver label. */
6889 {
6895 /* This is copied from the handling of non-local gotos. */
6897 nonlocal_goto_handler_labels
6899 nonlocal_goto_handler_labels);
6900 /* ??? Do not let expand_label treat us as such since we would
6901 not want to be both on the list of non-local labels and on
6902 the list of forced labels. */
6905 }
6909 /* __builtin_setjmp_receiver is passed the receiver label. */
6911 {
6917 }
6920 /* __builtin_longjmp is passed a pointer to an array of five words.
6921 It's similar to the C library longjmp function but works with
6922 __builtin_setjmp above. */
6925 {
6931 {
6934 }
6938 }
6947 /* This updates the setjmp buffer that is its argument with the value
6948 of the current stack pointer. */
6951 {
6952 rtx buf_addr
6957 }
6977 /* Various hooks for the DWARF 2 __throw routine. */
6983 #ifdef DWARF2_UNWIND_INFO
6989 #endif
7189 mode = get_builtin_sync_mode
7201 mode = get_builtin_sync_mode
7248 {
7252 mode =
7258 /* If this is turned into an external library call, the weak parameter
7259 must be dropped to match the expected parameter list. */
7264 /* Skip the boolean weak parameter. */
7269 }
7298 {
7308 }
7314 {
7324 }
7330 {
7340 }
7346 {
7356 }
7362 {
7372 }
7378 {
7388 }
7543 /* We allow user CHKP builtins if Pointer Bounds
7544 Checker is off. */
7546 {
7557 else
7559 }
7560 /* FALLTHROUGH */
7572 /* Software implementation of Pointer Bounds Checker is NYI.
7573 Target support is required. */
7578 /* Do library call, if we failed to expand the builtin when
7579 folding. */
7584 }
7586 /* The switch statement above can drop through to cause the function
7587 to be called normally. */
7589 }
7591 /* Similar to expand_builtin but is used for instrumented calls. */
7593 rtx
7595 rtx subtarget ATTRIBUTE_UNUSED,
7597 {
7610 {
7631 }
7633 /* The switch statement above can drop through to cause the function
7634 to be called normally. */
7636 }
7638 /* Determine whether a tree node represents a call to a built-in
7639 function. If the tree T is a call to a built-in function with
7640 the right number of arguments of the appropriate types, return
7641 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7642 Otherwise the return value is END_BUILTINS. */
7644 enum built_in_function
7646 {
7649 const_call_expr_arg_iterator iter;
7665 {
7666 /* If a function doesn't take a variable number of arguments,
7667 the last element in the list will have type `void'. */
7670 {
7674 }
7683 {
7686 }
7688 {
7691 }
7693 {
7696 }
7698 {
7701 }
7702 else
7704 }
7706 /* Variable-length argument list. */
7708 }
7710 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7711 evaluate to a constant. */
7713 static tree
7715 {
7716 /* We return 1 for a numeric type that's known to be a constant
7717 value at compile-time or for an aggregate type that's a
7718 literal constant. */
7721 /* If we know this is a constant, emit the constant of one. */
7727 {
7734 }
7736 /* If this expression has side effects, show we don't know it to be a
7737 constant. Likewise if it's a pointer or aggregate type since in
7738 those case we only want literals, since those are only optimized
7739 when generating RTL, not later.
7740 And finally, if we are compiling an initializer, not code, we
7741 need to return a definite result now; there's not going to be any
7742 more optimization done. */
7747 || folding_initializer
7752 }
7754 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7755 return it as a truthvalue. */
7757 static tree
7759 tree predictor)
7760 {
7772 predictor);
7776 }
7778 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7779 NULL_TREE if no simplification is possible. */
7781 tree
7783 {
7787 /* Distribute the expected value over short-circuiting operators.
7788 See through the cast from truthvalue_type_node to long. */
7795 /* If this is a builtin_expect within a builtin_expect keep the
7796 inner one. See through a comparison against a constant. It
7797 might have been added to create a thruthvalue. */
7813 {
7822 }
7824 /* If the argument isn't invariant then there's nothing else we can do. */
7828 /* If we expect that a comparison against the argument will fold to
7829 a constant return the constant. In practice, this means a true
7830 constant or the address of a non-weak symbol. */
7834 {
7835 do
7836 {
7838 }
7843 }
7845 /* Otherwise, ARG0 already has the proper type for the return value. */
7847 }
7849 /* Fold a call to __builtin_classify_type with argument ARG. */
7851 static tree
7853 {
7858 }
7860 /* Fold a call to __builtin_strlen with argument ARG. */
7862 static tree
7864 {
7867 else
7868 {
7875 }
7876 }
7878 /* Fold a call to __builtin_inf or __builtin_huge_val. */
7880 static tree
7882 {
7883 REAL_VALUE_TYPE real;
7885 /* __builtin_inff is intended to be usable to define INFINITY on all
7886 targets. If an infinity is not available, INFINITY expands "to a
7887 positive constant of type float that overflows at translation
7888 time", footnote "In this case, using INFINITY will violate the
7889 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
7890 Thus we pedwarn to ensure this constraint violation is
7891 diagnosed. */
7897 }
7899 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
7900 NULL_TREE if no simplification can be made. */
7902 static tree
7905 {
7906 tree type;
7916 /* Calculate the result when the argument is a constant. */
7921 /* Canonicalize sincos to cexpi. */
7923 {
7926 }
7928 {
7935 }
7944 }
7946 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
7947 Return NULL_TREE if no simplification can be made. */
7949 static tree
7951 {
7957 /* If the LEN parameter is zero, return zero. */
7962 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7966 /* If len parameter is one, return an expression corresponding to
7967 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
7969 {
7971 tree cst_uchar_ptr_node
7974 tree ind1
7978 cst_uchar_ptr_node,
7979 arg1)));
7980 tree ind2
7984 cst_uchar_ptr_node,
7985 arg2)));
7987 }
7990 }
7992 /* Fold a call to builtin isascii with argument ARG. */
7994 static tree
7996 {
7999 else
8000 {
8001 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8007 }
8008 }
8010 /* Fold a call to builtin toascii with argument ARG. */
8012 static tree
8014 {
8018 /* Transform toascii(c) -> (c & 0x7f). */
8021 }
8023 /* Fold a call to builtin isdigit with argument ARG. */
8025 static tree
8027 {
8030 else
8031 {
8032 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8033 /* According to the C standard, isdigit is unaffected by locale.
8034 However, it definitely is affected by the target character set. */
8035 unsigned HOST_WIDE_INT target_digit0
8046 }
8047 }
8049 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8051 static tree
8053 {
8059 }
8061 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8063 static tree
8065 {
8071 }
8073 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
8075 static tree
8077 {
8078 /* ??? Only expand to FMA_EXPR if it's directly supported. */
8086 }
8088 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8090 static tree
8092 {
8095 {
8099 {
8104 }
8105 }
8108 }
8110 /* Fold a call to builtin frexp, we can assume the base is 2. */
8112 static tree
8114 {
8125 /* Proceed if a valid pointer type was passed in. */
8127 {
8132 {
8134 /* For +-0, return (*exp = 0, +-0). */
8140 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8143 {
8144 /* Since the frexp function always expects base 2, and in
8145 GCC normalized significands are already in the range
8146 [0.5, 1.0), we have exactly what frexp wants. */
8151 }
8155 }
8157 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8161 }
8164 }
8166 /* Fold a call to builtin modf. */
8168 static tree
8170 {
8181 /* Proceed if a valid pointer type was passed in. */
8183 {
8188 {
8191 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8195 /* For +-Inf, return (*arg1 = arg0, +-0). */
8201 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8204 /* If the original number was negative and already
8205 integral, then the fractional part is -0.0. */
8209 }
8211 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8217 }
8220 }
8222 /* Given a location LOC, an interclass builtin function decl FNDECL
8223 and its single argument ARG, return an folded expression computing
8224 the same, or NULL_TREE if we either couldn't or didn't want to fold
8225 (the latter happen if there's an RTL instruction available). */
8227 static tree
8229 {
8230 machine_mode mode;
8242 /* If there is no optab, try generic code. */
8244 {
8245 tree result;
8248 {
8249 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8252 REAL_VALUE_TYPE r;
8256 {
8257 /* NaN and Inf are encoded in the high-order double value
8258 only. The low-order value is not significant. */
8262 }
8269 }
8272 {
8273 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8276 REAL_VALUE_TYPE r;
8280 {
8281 /* NaN and Inf are encoded in the high-order double value
8282 only. The low-order value is not significant. */
8286 }
8292 /*result = fold_build2_loc (loc, UNGT_EXPR,
8293 TREE_TYPE (TREE_TYPE (fndecl)),
8294 fold_build1_loc (loc, ABS_EXPR, type, arg),
8295 build_real (type, r));
8296 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8297 TREE_TYPE (TREE_TYPE (fndecl)),
8298 result);*/
8300 }
8302 {
8303 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8304 islessequal(fabs(x),DBL_MAX). */
8314 {
8315 /* Use double to test the normal range of IBM extended
8316 precision. Emin for IBM extended precision is
8317 different to emin for IEEE double, being 53 higher
8318 since the low double exponent is at least 53 lower
8319 than the high double exponent. */
8323 }
8335 {
8336 /* Testing the high end of the range is done just using
8337 the high double, using the same test as isfinite().
8338 For the subnormal end of the range we first test the
8339 high double, then if its magnitude is equal to the
8340 limit of 0x1p-969, we test whether the low double is
8341 non-zero and opposite sign to the high double. */
8357 integer_type_node,
8363 }
8364 else
8365 {
8366 tree const isge_fn
8369 }
8373 }
8376 }
8379 }
8381 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8382 ARG is the argument for the call. */
8384 static tree
8386 {
8393 {
8401 {
8402 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8403 /* In a boolean context, GCC will fold the inner COND_EXPR to
8404 1. So e.g. "if (isinf_sign(x))" would be folded to just
8405 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8413 {
8426 integer_zero_node);
8427 }
8430 }
8443 {
8446 {
8447 /* NaN and Inf are encoded in the high-order double value
8448 only. The low-order value is not significant. */
8450 }
8451 }
8457 }
8458 }
8460 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8461 This builtin will generate code to return the appropriate floating
8462 point classification depending on the value of the floating point
8463 number passed in. The possible return values must be supplied as
8464 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8465 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8466 one floating point argument which is "type generic". */
8468 static tree
8470 {
8473 machine_mode mode;
8474 REAL_VALUE_TYPE r;
8477 /* Verify the required arguments in the original call. */
8497 /* fpclassify(x) ->
8498 isnan(x) ? FP_NAN :
8499 (fabs(x) == Inf ? FP_INFINITE :
8500 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8501 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8515 {
8521 }
8524 {
8527 }
8530 }
8532 /* Fold a call to an unordered comparison function such as
8533 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8534 being called and ARG0 and ARG1 are the arguments for the call.
8535 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8536 the opposite of the desired result. UNORDERED_CODE is used
8537 for modes that can hold NaNs and ORDERED_CODE is used for
8538 the rest. */
8540 static tree
8544 {
8558 /* Choose the wider of two real types. */
8570 {
8574 }
8579 }
8581 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8582 arithmetics if it can never overflow, or into internal functions that
8583 return both result of arithmetics and overflowed boolean flag in
8584 a complex integer result, or some other check for overflow.
8585 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8586 checking part of that. */
8588 static tree
8591 {
8593 /* The code of the expression corresponding to the type-generic
8594 built-in, or ERROR_MARK for the type-specific ones. */
8599 {
8602 /* FALLTHRU */
8605 /* FALLTHRU */
8616 /* FALLTHRU */
8619 /* FALLTHRU */
8630 /* FALLTHRU */
8633 /* FALLTHRU */
8644 }
8646 /* For the "generic" overloads, the first two arguments can have different
8647 types and the last argument determines the target type to use to check
8648 for overflow. The arguments of the other overloads all have the same
8649 type. */
8652 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8653 arguments are constant, attempt to fold the built-in call into a constant
8654 expression indicating whether or not it detected an overflow. */
8658 /* Perform the computation in the target type and check for overflow. */
8662 arg2);
8676 tree store
8679 }
8681 /* Fold a call to __builtin_FILE to a constant string. */
8685 {
8690 }
8692 /* Fold a call to __builtin_FUNCTION to a constant string. */
8696 {
8703 }
8705 /* Fold a call to __builtin_LINE to an integer constant. */
8709 {
8711 }
8713 /* Fold a call to built-in function FNDECL with 0 arguments.
8714 This function returns NULL_TREE if no simplification was possible. */
8716 static tree
8718 {
8722 {
8748 }
8750 }
8752 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8753 This function returns NULL_TREE if no simplification was possible. */
8755 static tree
8757 {
8768 {
8770 {
8773 /* Gimplification will pull the CALL_EXPR for the builtin out of
8774 an if condition. When not optimizing, we'll not CSE it back.
8775 To avoid link error types of regressions, return false now. */
8780 }
8836 {
8841 }
8847 {
8852 }
8873 }
8877 }
8879 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
8880 This function returns NULL_TREE if no simplification was possible. */
8882 static tree
8884 {
8896 {
8940 NOP_EXPR);
8942 /* We do the folding for va_start in the expander. */
8957 }
8959 }
8961 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
8962 and ARG2.
8963 This function returns NULL_TREE if no simplification was possible. */
8965 static tree
8968 {
8982 {
9031 }
9033 }
9035 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9036 arguments. IGNORE is true if the result of the
9037 function call is ignored. This function returns NULL_TREE if no
9038 simplification was possible. */
9040 tree
9042 {
9046 {
9062 }
9064 {
9069 }
9071 }
9073 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9074 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9075 of arguments in ARGS to be omitted. OLDNARGS is the number of
9076 elements in ARGS. */
9078 static tree
9081 {
9086 {
9094 }
9095 else
9099 }
9101 /* Return true if FNDECL shouldn't be folded right now.
9102 If a built-in function has an inline attribute always_inline
9103 wrapper, defer folding it after always_inline functions have
9104 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9105 might not be performed. */
9107 bool
9109 {
9112 && cfun
9115 }
9117 /* A wrapper function for builtin folding that prevents warnings for
9118 "statement without effect" and the like, caused by removing the
9119 call node earlier than the warning is generated. */
9121 tree
9123 {
9129 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9130 yet. Defer folding until we see all the arguments
9131 (after inlining). */
9133 {
9136 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9137 instead last argument is __builtin_va_arg_pack (). Defer folding
9138 even in that case, until arguments are finalized. */
9140 {
9147 }
9155 else
9156 {
9161 }
9162 }
9164 }
9166 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9167 N arguments are passed in the array ARGARRAY. Return a folded
9168 expression or NULL_TREE if no simplification was possible. */
9170 tree
9172 tree fn,
9175 {
9182 {
9183 /* If last argument is __builtin_va_arg_pack (), arguments to this
9184 function are not finalized yet. Defer folding until they are. */
9186 {
9193 }
9198 else
9200 }
9203 }
9205 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9206 along with N new arguments specified as the "..." parameters. SKIP
9207 is the number of arguments in EXP to be omitted. This function is used
9208 to do varargs-to-varargs transformations. */
9210 static tree
9212 {
9214 tree t;
9222 }
9224 /* Validate a single argument ARG against a tree code CODE representing
9225 a type. Return true when argument is valid. */
9227 static bool
9229 {
9237 }
9239 /* This function validates the types of a function call argument list
9240 against a specified list of tree_codes. If the last specifier is a 0,
9241 that represents an ellipses, otherwise the last specifier must be a
9242 VOID_TYPE.
9244 This is the GIMPLE version of validate_arglist. Eventually we want to
9245 completely convert builtins.c to work from GIMPLEs and the tree based
9246 validate_arglist will then be removed. */
9248 bool
9250 {
9254 const_tree arg;
9260 do
9261 {
9264 {
9266 /* This signifies an ellipses, any further arguments are all ok. */
9270 /* This signifies an endlink, if no arguments remain, return
9271 true, otherwise return false. */
9275 /* If no parameters remain or the parameter's code does not
9276 match the specified code, return false. Otherwise continue
9277 checking any remaining arguments. */
9282 }
9283 }
9286 /* We need gotos here since we can only have one VA_CLOSE in a
9287 function. */
9288 end: ;
9292 }
9294 /* Default target-specific builtin expander that does nothing. */
9296 rtx
9298 rtx target ATTRIBUTE_UNUSED,
9299 rtx subtarget ATTRIBUTE_UNUSED,
9300 machine_mode mode ATTRIBUTE_UNUSED,
9302 {
9304 }
9306 /* Returns true is EXP represents data that would potentially reside
9307 in a readonly section. */
9309 bool
9311 {
9321 /* Make sure we call decl_readonly_section only for trees it
9322 can handle (since it returns true for everything it doesn't
9323 understand). */
9328 else
9330 }
9332 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9333 to the call, and TYPE is its return type.
9335 Return NULL_TREE if no simplification was possible, otherwise return the
9336 simplified form of the call as a tree.
9338 The simplified form may be a constant or other expression which
9339 computes the same value, but in a more efficient manner (including
9340 calls to other builtin functions).
9342 The call may contain arguments which need to be evaluated, but
9343 which are not useful to determine the result of the call. In
9344 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9345 COMPOUND_EXPR will be an argument which must be evaluated.
9346 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9347 COMPOUND_EXPR in the chain will contain the tree for the simplified
9348 form of the builtin function call. */
9350 static tree
9352 {
9356 else
9357 {
9358 tree fn;
9367 {
9369 tree tem;
9374 /* Return an offset into the constant string argument. */
9377 }
9380 /* strpbrk(x, "") == NULL.
9381 Evaluate and ignore s1 in case it had side-effects. */
9391 /* New argument list transforming strpbrk(s1, s2) to
9392 strchr(s1, s2[0]). */
9395 }
9396 }
9398 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9399 to the call.
9401 Return NULL_TREE if no simplification was possible, otherwise return the
9402 simplified form of the call as a tree.
9404 The simplified form may be a constant or other expression which
9405 computes the same value, but in a more efficient manner (including
9406 calls to other builtin functions).
9408 The call may contain arguments which need to be evaluated, but
9409 which are not useful to determine the result of the call. In
9410 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9411 COMPOUND_EXPR will be an argument which must be evaluated.
9412 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9413 COMPOUND_EXPR in the chain will contain the tree for the simplified
9414 form of the builtin function call. */
9416 static tree
9418 {
9422 else
9423 {
9426 /* If either argument is "", return NULL_TREE. */
9428 /* Evaluate and ignore both arguments in case either one has
9429 side-effects. */
9433 }
9434 }
9436 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9437 to the call.
9439 Return NULL_TREE if no simplification was possible, otherwise return the
9440 simplified form of the call as a tree.
9442 The simplified form may be a constant or other expression which
9443 computes the same value, but in a more efficient manner (including
9444 calls to other builtin functions).
9446 The call may contain arguments which need to be evaluated, but
9447 which are not useful to determine the result of the call. In
9448 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9449 COMPOUND_EXPR will be an argument which must be evaluated.
9450 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9451 COMPOUND_EXPR in the chain will contain the tree for the simplified
9452 form of the builtin function call. */
9454 static tree
9456 {
9460 else
9461 {
9462 /* If the first argument is "", return NULL_TREE. */
9465 {
9466 /* Evaluate and ignore argument s2 in case it has
9467 side-effects. */
9470 }
9472 /* If the second argument is "", return __builtin_strlen(s1). */
9475 {
9478 /* If the replacement _DECL isn't initialized, don't do the
9479 transformation. */
9484 }
9486 }
9487 }
9489 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9490 produced. False otherwise. This is done so that we don't output the error
9491 or warning twice or three times. */
9493 bool
9495 {
9498 tree arg;
9499 /* There is good chance the current input_location points inside the
9500 definition of the va_start macro (perhaps on the token for
9501 builtin) in a system header, so warnings will not be emitted.
9502 Use the location in real source code. */
9503 source_location current_location =
9505 NULL);
9508 {
9511 }
9514 {
9516 {
9519 }
9521 }
9522 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9523 when we checked the arguments and if needed issued a warning. */
9524 else
9525 {
9527 {
9528 /* Evidently an out of date version of <stdarg.h>; can't validate
9529 va_start's second argument, but can still work as intended. */
9531 OPT_Wvarargs,
9534 }
9536 {
9539 }
9541 }
9546 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9547 or __builtin_next_arg (0) the first time we see it, after checking
9548 the arguments and if needed issuing a warning. */
9550 {
9553 /* Strip off all nops for the sake of the comparison. This
9554 is not quite the same as STRIP_NOPS. It does more.
9555 We must also strip off INDIRECT_EXPR for C++ reference
9556 parameters. */
9561 {
9562 /* FIXME: Sometimes with the tree optimizers we can get the
9563 not the last argument even though the user used the last
9564 argument. We just warn and set the arg to be the last
9565 argument so that we will get wrong-code because of
9566 it. */
9568 OPT_Wvarargs,
9570 }
9572 /* Undefined by C99 7.15.1.4p4 (va_start):
9573 "If the parameter parmN is declared with the register storage
9574 class, with a function or array type, or with a type that is
9575 not compatible with the type that results after application of
9576 the default argument promotions, the behavior is undefined."
9577 */
9579 {
9581 OPT_Wvarargs,
9582 "undefined behavior when second parameter of "
9584 }
9586 /* We want to verify the second parameter just once before the tree
9587 optimizers are run and then avoid keeping it in the tree,
9588 as otherwise we could warn even for correct code like:
9589 void foo (int i, ...)
9590 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9593 else
9595 }
9597 }
9600 /* Expand a call EXP to __builtin_object_size. */
9602 static rtx
9604 {
9605 tree ost;
9610 {
9615 }
9623 {
9628 }
9633 }
9635 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9636 FCODE is the BUILT_IN_* to use.
9637 Return NULL_RTX if we failed; the caller should emit a normal call,
9638 otherwise try to get the result in TARGET, if convenient (and in
9639 mode MODE if that's convenient). */
9641 static rtx
9644 {
9648 POINTER_TYPE,
9649 fcode == BUILT_IN_MEMSET_CHK
9667 {
9668 /* Avoid transforming the checking call to an ordinary one when
9669 an overflow has been detected or when the call couldn't be
9670 validated because the size is not constant. */
9675 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9676 mem{cpy,pcpy,move,set} is available. */
9678 {
9693 }
9702 }
9705 else
9706 {
9709 /* If DEST is not a pointer type, call the normal function. */
9713 /* If SRC and DEST are the same (and not volatile), do nothing. */
9715 {
9716 tree expr;
9719 {
9720 /* Evaluate and ignore LEN in case it has side-effects. */
9723 }
9727 }
9729 /* __memmove_chk special case. */
9731 {
9737 /* If src is categorized for a readonly section we can use
9738 normal __memcpy_chk. */
9740 {
9749 }
9750 }
9752 }
9753 }
9755 /* Emit warning if a buffer overflow is detected at compile time. */
9757 static void
9759 {
9760 /* The source string. */
9762 /* The size of the destination object. */
9764 /* The string that is being concatenated with (as in __strcat_chk)
9765 or null if it isn't. */
9767 /* The maximum length of the source sequence in a bounded operation
9768 (such as __strncat_chk) or null if the operation isn't bounded
9769 (such as __strcat_chk). */
9773 {
9781 /* For __strcat_chk the warning will be emitted only if overflowing
9782 by at least strlen (dest) + 1 bytes. */
9809 }
9812 {
9813 /* Check __strncat_chk. There is no way to determine the length
9814 of the string to which the source string is being appended so
9815 just warn when the length of the source string is not known. */
9818 }
9822 }
9824 /* Emit warning if a buffer overflow is detected at compile time
9825 in __sprintf_chk/__vsprintf_chk calls. */
9827 static void
9829 {
9834 /* Verify the required arguments in the original call. */
9844 /* Check whether the format is a literal string constant. */
9852 /* If the format doesn't contain % args or %%, we know its size. */
9855 /* If the format is "%s" and first ... argument is a string literal,
9856 we know it too. */
9859 {
9860 tree arg;
9871 }
9872 else
9875 /* Add one for the terminating nul. */
9879 }
9881 /* Emit warning if a free is called with address of a variable. */
9883 static void
9885 {
9899 else
9902 }
9904 /* Fold a call to __builtin_object_size with arguments PTR and OST,
9905 if possible. */
9907 static tree
9909 {
9926 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
9927 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
9928 and (size_t) 0 for types 2 and 3. */
9933 {
9937 }
9939 {
9940 /* If object size is not known yet, delay folding until
9941 later. Maybe subsequent passes will help determining
9942 it. */
9946 }
9949 }
9951 /* Builtins with folding operations that operate on "..." arguments
9952 need special handling; we need to store the arguments in a convenient
9953 data structure before attempting any folding. Fortunately there are
9954 only a few builtins that fall into this category. FNDECL is the
9955 function, EXP is the CALL_EXPR for the call. */
9957 static tree
9959 {
9964 {
9971 }
9973 {
9978 }
9980 }
9982 /* Initialize format string characters in the target charset. */
9984 bool
9986 {
9989 {
10012 }
10014 }
10016 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10017 and no overflow/underflow occurred. INEXACT is true if M was not
10018 exactly calculated. TYPE is the tree type for the result. This
10019 function assumes that you cleared the MPFR flags and then
10020 calculated M to see if anything subsequently set a flag prior to
10021 entering this function. Return NULL_TREE if any checks fail. */
10023 static tree
10025 {
10026 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10027 overflow/underflow occurred. If -frounding-math, proceed iff the
10028 result of calling FUNC was exact. */
10031 {
10032 REAL_VALUE_TYPE rr;
10035 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10036 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10037 but the mpft_t is not, then we underflowed in the
10038 conversion. */
10041 {
10042 REAL_VALUE_TYPE rmode;
10045 /* Proceed iff the specified mode can hold the value. */
10048 }
10049 }
10051 }
10053 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10054 number and no overflow/underflow occurred. INEXACT is true if M
10055 was not exactly calculated. TYPE is the tree type for the result.
10056 This function assumes that you cleared the MPFR flags and then
10057 calculated M to see if anything subsequently set a flag prior to
10058 entering this function. Return NULL_TREE if any checks fail, if
10059 FORCE_CONVERT is true, then bypass the checks. */
10061 static tree
10063 {
10064 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10065 overflow/underflow occurred. If -frounding-math, proceed iff the
10066 result of calling FUNC was exact. */
10071 {
10076 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10077 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10078 but the mpft_t is not, then we underflowed in the
10079 conversion. */
10084 {
10089 /* Proceed iff the specified mode can hold the value. */
10095 }
10096 }
10098 }
10100 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10101 the pointer *(ARG_QUO) and return the result. The type is taken
10102 from the type of ARG0 and is used for setting the precision of the
10103 calculation and results. */
10105 static tree
10107 {
10114 /* To proceed, MPFR must exactly represent the target floating point
10115 format, which only happens when the target base equals two. */
10119 {
10124 {
10128 tree result_rem;
10137 /* Remquo is independent of the rounding mode, so pass
10138 inexact=0 to do_mpfr_ckconv(). */
10142 {
10143 /* MPFR calculates quo in the host's long so it may
10144 return more bits in quo than the target int can hold
10145 if sizeof(host long) > sizeof(target int). This can
10146 happen even for native compilers in LP64 mode. In
10147 these cases, modulo the quo value with the largest
10148 number that the target int can hold while leaving one
10149 bit for the sign. */
10153 /* Dereference the quo pointer argument. */
10155 /* Proceed iff a valid pointer type was passed in. */
10157 {
10158 /* Set the value. */
10159 tree result_quo
10162 integer_quo));
10164 /* Combine the quo assignment with the rem. */
10167 }
10168 }
10169 }
10170 }
10172 }
10174 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10175 resulting value as a tree with type TYPE. The mpfr precision is
10176 set to the precision of TYPE. We assume that this mpfr function
10177 returns zero if the result could be calculated exactly within the
10178 requested precision. In addition, the integer pointer represented
10179 by ARG_SG will be dereferenced and set to the appropriate signgam
10180 (-1,1) value. */
10182 static tree
10184 {
10189 /* To proceed, MPFR must exactly represent the target floating point
10190 format, which only happens when the target base equals two. Also
10191 verify ARG is a constant and that ARG_SG is an int pointer. */
10196 {
10199 /* In addition to NaN and Inf, the argument cannot be zero or a
10200 negative integer. */
10204 {
10209 mpfr_t m;
10210 tree result_lg;
10219 {
10220 tree result_sg;
10222 /* Dereference the arg_sg pointer argument. */
10224 /* Assign the signgam value into *arg_sg. */
10229 /* Combine the signgam assignment with the lgamma result. */
10232 }
10233 }
10234 }
10237 }
10239 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10240 mpc function FUNC on it and return the resulting value as a tree
10241 with type TYPE. The mpfr precision is set to the precision of
10242 TYPE. We assume that function FUNC returns zero if the result
10243 could be calculated exactly within the requested precision. If
10244 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10245 in the arguments and/or results. */
10247 tree
10250 {
10256 /* To proceed, MPFR must exactly represent the target floating point
10257 format, which only happens when the target base equals two. */
10263 {
10272 {
10292 }
10293 }
10296 }
10298 /* A wrapper function for builtin folding that prevents warnings for
10299 "statement without effect" and the like, caused by removing the
10300 call node earlier than the warning is generated. */
10302 tree
10304 {
10312 {
10321 {
10323 }
10324 else
10325 {
10328 {
10329 /* Propagate location information from original call to
10330 expansion of builtin. Otherwise things like
10331 maybe_emit_chk_warning, that operate on the expansion
10332 of a builtin, will use the wrong location information. */
10334 {
10342 }
10344 }
10345 }
10346 }
10348 }
10350 /* Look up the function in builtin_decl that corresponds to DECL
10351 and set ASMSPEC as its user assembler name. DECL must be a
10352 function decl that declares a builtin. */
10354 void
10356 {
10366 {
10370 }
10371 }
10373 /* Return true if DECL is a builtin that expands to a constant or similarly
10374 simple code. */
10375 bool
10377 {
10380 {
10381 /* Builtins that expand to constants. */
10386 /* Simple register moves or loads from stack. */
10397 /* Exception state returns or moves registers around. */
10405 }
10408 }
10410 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10411 most probably expanded inline into reasonably simple code. This is a
10412 superset of is_simple_builtin. */
10413 bool
10415 {
10422 {
10491 }
10494 }
10496 /* Return true if T is a constant and the value cast to a target char
10497 can be represented by a host char.
10498 Store the casted char constant in *P if so. */
10500 bool
10502 {
10508 }