| blob | 91658e84761b2f6573aa57cfaf920c66dca3b14d |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2018 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* Legacy warning! Please add no further builtin simplifications here
21 (apart from pure constant folding) - builtin simplifications should go
22 to match.pd or gimple-fold.c instead. */
76 #if SWITCHABLE_TARGET
78 #endif
80 /* Define the names of the builtin function types and codes. */
84 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
86 {
88 };
90 /* Setup an array of builtin_info_type, make sure each element decl is
91 initialized to NULL_TREE. */
94 /* Non-zero if __builtin_constant_p should be folded right away. */
194 /* Return true if NAME starts with __builtin_ or __sync_. */
196 static bool
198 {
206 }
209 /* Return true if DECL is a function symbol representing a built-in. */
211 bool
213 {
215 }
217 /* Return true if NODE should be considered for inline expansion regardless
218 of the optimization level. This means whenever a function is invoked with
219 its "internal" name, which normally contains the prefix "__builtin". */
221 bool
223 {
224 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
225 we want the name used to call the function, not the name it
226 will have. */
229 }
231 /* Compute values M and N such that M divides (address of EXP - N) and such
232 that N < M. If these numbers can be determined, store M in alignp and N in
233 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
234 *alignp and any bit-offset to *bitposp.
236 Note that the address (and thus the alignment) computed here is based
237 on the address to which a symbol resolves, whereas DECL_ALIGN is based
238 on the address at which an object is actually located. These two
239 addresses are not always the same. For example, on ARM targets,
240 the address &foo of a Thumb function foo() has the lowest bit set,
241 whereas foo() itself starts on an even address.
243 If ADDR_P is true we are taking the address of the memory reference EXP
244 and thus cannot rely on the access taking place. */
246 static bool
249 {
251 tree offset;
252 machine_mode mode;
257 /* Get the innermost object and the constant (bitpos) and possibly
258 variable (offset) offset of the access. */
262 /* Extract alignment information from the innermost object and
263 possibly adjust bitpos and offset. */
265 {
266 /* Function addresses can encode extra information besides their
267 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
268 allows the low bit to be used as a virtual bit, we know
269 that the address itself must be at least 2-byte aligned. */
272 }
274 ;
276 {
277 /* The alignment of a CONST_DECL is determined by its initializer. */
284 }
286 {
289 }
293 {
299 /* If the address is explicitely aligned, handle that. */
302 {
307 }
309 known_alignment
313 /* Re-apply explicit alignment to the bitpos. */
316 /* The alignment of the pointer operand in a TARGET_MEM_REF
317 has to take the variable offset parts into account. */
319 {
321 {
326 }
330 }
332 /* When EXP is an actual memory reference then we can use
333 TYPE_ALIGN of a pointer indirection to derive alignment.
334 Do so only if get_pointer_alignment_1 did not reveal absolute
335 alignment knowledge and if using that alignment would
336 improve the situation. */
342 else
343 {
344 /* Else adjust bitpos accordingly. */
349 }
350 }
352 {
353 /* STRING_CST are the only constant objects we allow to be not
354 wrapped inside a CONST_DECL. */
360 }
362 /* If there is a non-constant offset part extract the maximum
363 alignment that can prevail. */
365 {
368 {
372 }
373 }
375 /* Account for the alignment of runtime coefficients, so that the constant
376 bitpos is guaranteed to be accurate. */
379 {
382 }
387 }
389 /* For a memory reference expression EXP compute values M and N such that M
390 divides (&EXP - N) and such that N < M. If these numbers can be determined,
391 store M in alignp and N in *BITPOSP and return true. Otherwise return false
392 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
394 bool
397 {
399 }
401 /* Return the alignment in bits of EXP, an object. */
403 unsigned int
405 {
411 /* align and bitpos now specify known low bits of the pointer.
412 ptr & (align - 1) == bitpos. */
417 }
419 /* For a pointer valued expression EXP compute values M and N such that M
420 divides (EXP - N) and such that N < M. If these numbers can be determined,
421 store M in alignp and N in *BITPOSP and return true. Return false if
422 the results are just a conservative approximation.
424 If EXP is not a pointer, false is returned too. */
426 bool
429 {
436 {
443 else
444 {
447 {
451 }
452 }
456 }
459 {
464 {
467 /* Make sure to return a sensible alignment when the multiplication
468 by BITS_PER_UNIT overflowed. */
471 /* We cannot really tell whether this result is an approximation. */
473 }
474 else
475 {
479 }
480 }
482 {
487 }
492 }
494 /* Return the alignment in bits of EXP, a pointer valued expression.
495 The alignment returned is, by default, the alignment of the thing that
496 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
498 Otherwise, look at the expression to see if we can do better, i.e., if the
499 expression is actually pointing at an object whose alignment is tighter. */
501 unsigned int
503 {
509 /* align and bitpos now specify known low bits of the pointer.
510 ptr & (align - 1) == bitpos. */
516 }
518 /* Return the number of non-zero elements in the sequence
519 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
520 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
522 static unsigned
524 {
530 {
531 /* Optimize the common case of plain char. */
533 {
537 }
538 }
539 else
540 {
542 {
546 }
547 }
549 }
551 /* Compute the length of a null-terminated character string or wide
552 character string handling character sizes of 1, 2, and 4 bytes.
553 TREE_STRING_LENGTH is not the right way because it evaluates to
554 the size of the character array in bytes (as opposed to characters)
555 and because it can contain a zero byte in the middle.
557 ONLY_VALUE should be nonzero if the result is not going to be emitted
558 into the instruction stream and zero if it is going to be expanded.
559 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
560 is returned, otherwise NULL, since
561 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
562 evaluate the side-effects.
564 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
565 accesses. Note that this implies the result is not going to be emitted
566 into the instruction stream.
568 The value returned is of type `ssizetype'.
570 Unfortunately, string_constant can't access the values of const char
571 arrays with initializers, so neither can we do so here. */
573 tree
575 {
579 {
586 }
594 /* Offset from the beginning of the string in bytes. */
595 tree byteoff;
600 /* Determine the size of the string element. */
601 unsigned eltsize
604 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
605 length of SRC. */
608 /* PTR can point to the byte representation of any string type, including
609 char* and wchar_t*. */
613 {
614 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
615 compute the offset to the following null if we don't know where to
616 start searching for it. */
618 {
619 /* Return when an embedded null character is found. */
621 }
626 /* We don't know the starting offset, but we do know that the string
627 has no internal zero bytes. We can assume that the offset falls
628 within the bounds of the string; otherwise, the programmer deserves
629 what he gets. Subtract the offset from the length of the string,
630 and return that. This would perhaps not be valid if we were dealing
631 with named arrays in addition to literal string constants. */
634 }
636 /* Offset from the beginning of the string in elements. */
637 HOST_WIDE_INT eltoff;
639 /* We have a known offset into the string. Start searching there for
640 a null character if we can represent it as a single HOST_WIDE_INT. */
645 else
648 /* If the offset is known to be out of bounds, warn, and call strlen at
649 runtime. */
651 {
652 /* Suppress multiple warnings for propagated constant strings. */
655 {
658 eltoff);
660 }
662 }
664 /* Use strlen to search for the first zero byte. Since any strings
665 constructed with build_string will have nulls appended, we win even
666 if we get handed something like (char[4])"abcd".
668 Since ELTOFF is our starting index into the string, no further
669 calculation is needed. */
674 }
676 /* Return a constant integer corresponding to target reading
677 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
679 static rtx
681 {
682 HOST_WIDE_INT ch;
696 {
708 }
712 }
714 /* Cast a target constant CST to target CHAR and if that value fits into
715 host char type, return zero and put that value into variable pointed to by
716 P. */
718 static int
720 {
727 /* Do not care if it fits or not right here. */
742 }
744 /* Similar to save_expr, but assumes that arbitrary code is not executed
745 in between the multiple evaluations. In particular, we assume that a
746 non-addressable local variable will not be modified. */
748 static tree
750 {
758 }
760 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
761 times to get the address of either a higher stack frame, or a return
762 address located within it (depending on FNDECL_CODE). */
764 static rtx
766 {
770 {
771 /* For a zero count with __builtin_return_address, we don't care what
772 frame address we return, because target-specific definitions will
773 override us. Therefore frame pointer elimination is OK, and using
774 the soft frame pointer is OK.
776 For a nonzero count, or a zero count with __builtin_frame_address,
777 we require a stable offset from the current frame pointer to the
778 previous one, so we must use the hard frame pointer, and
779 we must disable frame pointer elimination. */
782 else
783 {
786 /* Tell reload not to eliminate the frame pointer. */
788 }
789 }
794 /* On the SPARC, the return address is not in the frame, it is in a
795 register. There is no way to access it off of the current frame
796 pointer, but it can be accessed off the previous frame pointer by
797 reading the value from the register window save area. */
799 count--;
801 /* Scan back COUNT frames to the specified frame. */
803 {
804 /* Assume the dynamic chain pointer is in the word that the
805 frame address points to, unless otherwise specified. */
810 }
812 /* For __builtin_frame_address, return what we've got. But, on
813 the SPARC for example, we may have to add a bias. */
817 /* For __builtin_return_address, get the return address from that frame. */
818 #ifdef RETURN_ADDR_RTX
820 #else
824 #endif
826 }
828 /* Alias set used for setjmp buffer. */
831 /* Construct the leading half of a __builtin_setjmp call. Control will
832 return to RECEIVER_LABEL. This is also called directly by the SJLJ
833 exception handling code. */
835 void
837 {
839 rtx stack_save;
840 rtx mem;
849 /* We store the frame pointer and the address of receiver_label in
850 the buffer and use the rest of it for the stack save area, which
851 is machine-dependent. */
870 /* If there is further processing to do, do it. */
874 /* We have a nonlocal label. */
876 }
878 /* Construct the trailing part of a __builtin_setjmp call. This is
879 also called directly by the SJLJ exception handling code.
880 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
882 void
884 {
885 rtx chain;
887 /* Mark the FP as used when we get here, so we have to make sure it's
888 marked as used by this function. */
891 /* Mark the static chain as clobbered here so life information
892 doesn't get messed up for it. */
897 /* Now put in the code to restore the frame pointer, and argument
898 pointer, if needed. */
900 {
901 /* First adjust our frame pointer to its actual value. It was
902 previously set to the start of the virtual area corresponding to
903 the stacked variables when we branched here and now needs to be
904 adjusted to the actual hardware fp value.
906 Assignments to virtual registers are converted by
907 instantiate_virtual_regs into the corresponding assignment
908 to the underlying register (fp in this case) that makes
909 the original assignment true.
910 So the following insn will actually be decrementing fp by
911 TARGET_STARTING_FRAME_OFFSET. */
914 /* Restoring the frame pointer also modifies the hard frame pointer.
915 Mark it used (so that the previous assignment remains live once
916 the frame pointer is eliminated) and clobbered (to represent the
917 implicit update from the assignment). */
920 }
923 {
924 /* If the argument pointer can be eliminated in favor of the
925 frame pointer, we don't need to restore it. We assume here
926 that if such an elimination is present, it can always be used.
927 This is the case on all known machines; if we don't make this
928 assumption, we do unnecessary saving on many machines. */
938 {
939 /* Now restore our arg pointer from the address at which it
940 was saved in our stack frame. */
943 }
944 }
950 else
953 /* We must not allow the code we just generated to be reordered by
954 scheduling. Specifically, the update of the frame pointer must
955 happen immediately, not later. */
957 }
959 /* __builtin_longjmp is passed a pointer to an array of five words (not
960 all will be used on all machines). It operates similarly to the C
961 library function of the same name, but is more efficient. Much of
962 the code below is copied from the handling of non-local gotos. */
964 static void
966 {
971 /* DRAP is needed for stack realign if longjmp is expanded to current
972 function */
983 /* We require that the user must pass a second argument of 1, because
984 that is what builtin_setjmp will return. */
990 else
991 {
1002 /* Pick up FP, label, and SP from the block and jump. This code is
1003 from expand_goto in stmt.c; see there for detailed comments. */
1005 /* We have to pass a value to the nonlocal_goto pattern that will
1006 get copied into the static_chain pointer, but it does not matter
1007 what that value is, because builtin_setjmp does not use it. */
1009 else
1010 {
1022 }
1023 }
1025 /* Search backwards and mark the jump insn as a non-local goto.
1026 Note that this precludes the use of __builtin_longjmp to a
1027 __builtin_setjmp target in the same function. However, we've
1028 already cautioned the user that these functions are for
1029 internal exception handling use only. */
1031 {
1035 {
1038 }
1041 }
1042 }
1046 {
1048 }
1050 /* This function validates the types of a function call argument list
1051 against a specified list of tree_codes. If the last specifier is a 0,
1052 that represents an ellipsis, otherwise the last specifier must be a
1053 VOID_TYPE. */
1055 static bool
1057 {
1061 const_call_expr_arg_iterator iter;
1062 const_tree arg;
1067 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1072 {
1076 {
1078 /* This signifies an ellipses, any further arguments are all ok. */
1082 /* This signifies an endlink, if no arguments remain, return
1083 true, otherwise return false. */
1087 /* The actual argument must be nonnull when either the whole
1088 called function has been declared nonnull, or when the formal
1089 argument corresponding to the actual argument has been. */
1092 {
1097 }
1098 /* FALLTHRU */
1100 /* If no parameters remain or the parameter's code does not
1101 match the specified code, return false. Otherwise continue
1102 checking any remaining arguments. */
1107 }
1108 }
1110 /* We need gotos here since we can only have one VA_CLOSE in a
1111 function. */
1112 end: ;
1118 }
1120 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1121 and the address of the save area. */
1123 static rtx
1125 {
1140 /* Copy the address of the save location to a register just in case it was
1141 based on the frame pointer. */
1150 /* ??? We no longer need to pass the static chain value, afaik. */
1153 else
1154 {
1160 /* Restore frame pointer for containing function. */
1164 /* USE of hard_frame_pointer_rtx added for consistency;
1165 not clear if really needed. */
1169 /* If the architecture is using a GP register, we must
1170 conservatively assume that the target function makes use of it.
1171 The prologue of functions with nonlocal gotos must therefore
1172 initialize the GP register to the appropriate value, and we
1173 must then make sure that this value is live at the point
1174 of the jump. (Note that this doesn't necessarily apply
1175 to targets with a nonlocal_goto pattern; they are free
1176 to implement it in their own way. Note also that this is
1177 a no-op if the GP register is a global invariant.) */
1183 }
1185 /* Search backwards to the jump insn and mark it as a
1186 non-local goto. */
1188 {
1190 {
1193 }
1196 }
1199 }
1201 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1202 (not all will be used on all machines) that was passed to __builtin_setjmp.
1203 It updates the stack pointer in that block to the current value. This is
1204 also called directly by the SJLJ exception handling code. */
1206 void
1208 {
1211 rtx stack_save
1213 memory_address
1219 }
1221 /* Expand a call to __builtin_prefetch. For a target that does not support
1222 data prefetch, evaluate the memory address argument in case it has side
1223 effects. */
1225 static void
1227 {
1237 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1238 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1239 locality). */
1243 else
1247 else
1250 /* Argument 0 is an address. */
1253 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1255 {
1258 }
1260 /* Argument 1 must be either zero or one. */
1262 {
1266 }
1268 /* Argument 2 (locality) must be a compile-time constant int. */
1270 {
1273 }
1275 /* Argument 2 must be 0, 1, 2, or 3. */
1277 {
1280 }
1283 {
1291 }
1293 /* Don't do anything with direct references to volatile memory, but
1294 generate code to handle other side effects. */
1297 }
1299 /* Get a MEM rtx for expression EXP which is the address of an operand
1300 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1301 the maximum length of the block of memory that might be accessed or
1302 NULL if unknown. */
1304 static rtx
1306 {
1310 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1311 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1318 /* Get an expression we can use to find the attributes to assign to MEM.
1319 First remove any nops. */
1324 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1325 (as builtin stringops may alias with anything). */
1332 /* If the MEM_REF has no acceptable address, try to get the base object
1333 from the original address we got, and build an all-aliasing
1334 unknown-sized access to that one. */
1340 {
1345 size_zero_node,
1346 NULL)),
1349 }
1352 }
1353 \f
1354 /* Built-in functions to perform an untyped call and return. */
1356 #define apply_args_mode \
1357 (this_target_builtins->x_apply_args_mode)
1358 #define apply_result_mode \
1359 (this_target_builtins->x_apply_result_mode)
1361 /* Return the size required for the block returned by __builtin_apply_args,
1362 and initialize apply_args_mode. */
1364 static int
1366 {
1371 /* The values computed by this function never change. */
1373 {
1374 /* The first value is the incoming arg-pointer. */
1377 /* The second value is the structure value address unless this is
1378 passed as an "invisible" first argument. */
1384 {
1394 }
1395 else
1396 {
1398 }
1399 }
1401 }
1403 /* Return the size required for the block returned by __builtin_apply,
1404 and initialize apply_result_mode. */
1406 static int
1408 {
1412 /* The values computed by this function never change. */
1414 {
1419 {
1429 }
1430 else
1433 /* Allow targets that use untyped_call and untyped_return to override
1434 the size so that machine-specific information can be stored here. */
1435 #ifdef APPLY_RESULT_SIZE
1437 #endif
1438 }
1440 }
1442 /* Create a vector describing the result block RESULT. If SAVEP is true,
1443 the result block is used to save the values; otherwise it is used to
1444 restore the values. */
1446 static rtx
1448 {
1450 fixed_size_mode mode;
1457 {
1467 }
1469 }
1471 /* Save the state required to perform an untyped call with the same
1472 arguments as were passed to the current function. */
1474 static rtx
1476 {
1479 fixed_size_mode mode;
1480 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1482 /* Create a block where the arg-pointer, structure value address,
1483 and argument registers can be saved. */
1486 /* Walk past the arg-pointer and structure value address. */
1491 /* Save each register used in calling a function to the block. */
1494 {
1503 }
1505 /* Save the arg pointer to the block. */
1507 /* We need the pointer as the caller actually passed them to us, not
1508 as we might have pretended they were passed. Make sure it's a valid
1509 operand, as emit_move_insn isn't expected to handle a PLUS. */
1511 tem
1514 NULL_RTX);
1519 /* Save the structure value address unless this is passed as an
1520 "invisible" first argument. */
1522 {
1526 }
1528 /* Return the address of the block. */
1530 }
1532 /* __builtin_apply_args returns block of memory allocated on
1533 the stack into which is stored the arg pointer, structure
1534 value address, static chain, and all the registers that might
1535 possibly be used in performing a function call. The code is
1536 moved to the start of the function so the incoming values are
1537 saved. */
1539 static rtx
1541 {
1542 /* Don't do __builtin_apply_args more than once in a function.
1543 Save the result of the first call and reuse it. */
1546 {
1547 /* When this function is called, it means that registers must be
1548 saved on entry to this function. So we migrate the
1549 call to the first insn of this function. */
1550 rtx temp;
1559 /* Put the insns after the NOTE that starts the function.
1560 If this is inside a start_sequence, make the outer-level insn
1561 chain current, so the code is placed at the start of the
1562 function. If internal_arg_pointer is a non-virtual pseudo,
1563 it needs to be placed after the function that initializes
1564 that pseudo. */
1569 else
1573 }
1574 }
1576 /* Perform an untyped call and save the state required to perform an
1577 untyped return of whatever value was returned by the given function. */
1579 static rtx
1581 {
1583 fixed_size_mode mode;
1592 /* Create a block where the return registers can be saved. */
1595 /* Fetch the arg pointer from the ARGUMENTS block. */
1602 /* Push a new argument block and copy the arguments. Do not allow
1603 the (potential) memcpy call below to interfere with our stack
1604 manipulations. */
1606 NO_DEFER_POP;
1608 /* Save the stack with nonlocal if available. */
1611 else
1614 /* Allocate a block of memory onto the stack and copy the memory
1615 arguments to the outgoing arguments address. We can pass TRUE
1616 as the 4th argument because we just saved the stack pointer
1617 and will restore it right after the call. */
1620 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1621 may have already set current_function_calls_alloca to true.
1622 current_function_calls_alloca won't be set if argsize is zero,
1623 so we have to guarantee need_drap is true here. */
1629 {
1632 else
1634 }
1641 /* Refer to the argument block. */
1646 /* Walk past the arg-pointer and structure value address. */
1651 /* Restore each of the registers previously saved. Make USE insns
1652 for each of these registers for use in making the call. */
1655 {
1663 }
1665 /* Restore the structure value address unless this is passed as an
1666 "invisible" first argument. */
1669 {
1676 }
1678 /* All arguments and registers used for the call are set up by now! */
1681 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1682 and we don't want to load it into a register as an optimization,
1683 because prepare_call_address already did it if it should be done. */
1687 /* Generate the actual call instruction and save the return value. */
1689 {
1693 }
1695 {
1698 /* Locate the unique return register. It is not possible to
1699 express a call that sets more than one return register using
1700 call_value; use untyped_call for that. In fact, untyped_call
1701 only needs to save the return registers in the given block. */
1704 {
1708 }
1715 }
1716 else
1719 /* Find the CALL insn we just emitted, and attach the register usage
1720 information. */
1724 /* Restore the stack. */
1727 else
1731 OK_DEFER_POP;
1733 /* Return the address of the result block. */
1736 }
1738 /* Perform an untyped return. */
1740 static void
1742 {
1744 fixed_size_mode mode;
1745 rtx reg;
1754 {
1759 }
1761 /* Restore the return value and note that each value is used. */
1765 {
1777 }
1779 /* Put the USE insns before the return. */
1782 /* Return whatever values was restored by jumping directly to the end
1783 of the function. */
1785 }
1787 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1789 static enum type_class
1791 {
1793 {
1812 }
1813 }
1815 /* Expand a call EXP to __builtin_classify_type. */
1817 static rtx
1819 {
1823 }
1825 /* This helper macro, meant to be used in mathfn_built_in below, determines
1826 which among a set of builtin math functions is appropriate for a given type
1827 mode. The `F' (float) and `L' (long double) are automatically generated
1828 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1829 types, there are additional types that are considered with 'F32', 'F64',
1830 'F128', etc. suffixes. */
1831 #define CASE_MATHFN(MATHFN) \
1832 CASE_CFN_##MATHFN: \
1833 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1834 fcodel = BUILT_IN_##MATHFN##L ; break;
1835 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1836 types. */
1837 #define CASE_MATHFN_FLOATN(MATHFN) \
1838 CASE_CFN_##MATHFN: \
1839 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1840 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1841 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1842 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1843 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1844 break;
1845 /* Similar to above, but appends _R after any F/L suffix. */
1846 #define CASE_MATHFN_REENT(MATHFN) \
1847 case CFN_BUILT_IN_##MATHFN##_R: \
1848 case CFN_BUILT_IN_##MATHFN##F_R: \
1849 case CFN_BUILT_IN_##MATHFN##L_R: \
1850 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1851 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1853 /* Return a function equivalent to FN but operating on floating-point
1854 values of type TYPE, or END_BUILTINS if no such function exists.
1855 This is purely an operation on function codes; it does not guarantee
1856 that the target actually has an implementation of the function. */
1858 static built_in_function
1860 {
1861 tree mtype;
1872 {
1963 }
1986 else
1988 }
1990 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1991 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1992 otherwise use the explicit declaration. If we can't do the conversion,
1993 return null. */
1995 static tree
1997 {
2006 }
2008 /* Like mathfn_built_in_1, but always use the implicit array. */
2010 tree
2012 {
2014 }
2016 /* Like mathfn_built_in_1, but take a built_in_function and
2017 always use the implicit array. */
2019 tree
2021 {
2023 }
2025 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2026 return its code, otherwise return IFN_LAST. Note that this function
2027 only tests whether the function is defined in internals.def, not whether
2028 it is actually available on the target. */
2030 internal_fn
2032 {
2036 {
2037 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2038 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2039 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2040 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2041 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2042 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2043 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2060 }
2061 }
2063 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2064 on the current target by a call to an internal function, return the
2065 code of that internal function, otherwise return IFN_LAST. The caller
2066 is responsible for ensuring that any side-effects of the built-in
2067 call are dealt with correctly. E.g. if CALL sets errno, the caller
2068 must decide that the errno result isn't needed or make it available
2069 in some other way. */
2071 internal_fn
2073 {
2075 {
2078 {
2083 }
2084 }
2086 }
2088 /* Expand a call to the builtin trinary math functions (fma).
2089 Return NULL_RTX if a normal call should be emitted rather than expanding the
2090 function in-line. EXP is the expression that is a call to the builtin
2091 function; if convenient, the result should be placed in TARGET.
2092 SUBTARGET may be used as the target for computing one of EXP's
2093 operands. */
2095 static rtx
2097 {
2098 optab builtin_optab;
2103 machine_mode mode;
2113 {
2119 }
2121 /* Make a suitable register to place result in. */
2124 /* Before working hard, check whether the instruction is available. */
2130 /* Always stabilize the argument list. */
2141 /* Compute into RESULT.
2142 Set RESULT to wherever the result comes back. */
2146 /* If we were unable to expand via the builtin, stop the sequence
2147 (without outputting the insns) and call to the library function
2148 with the stabilized argument list. */
2150 {
2153 }
2155 /* Output the entire sequence. */
2161 }
2163 /* Expand a call to the builtin sin and cos math functions.
2164 Return NULL_RTX if a normal call should be emitted rather than expanding the
2165 function in-line. EXP is the expression that is a call to the builtin
2166 function; if convenient, the result should be placed in TARGET.
2167 SUBTARGET may be used as the target for computing one of EXP's
2168 operands. */
2170 static rtx
2172 {
2173 optab builtin_optab;
2174 rtx op0;
2177 machine_mode mode;
2178 tree arg;
2186 {
2192 }
2194 /* Make a suitable register to place result in. */
2197 /* Check if sincos insn is available, otherwise fallback
2198 to sin or cos insn. */
2201 {
2208 }
2210 /* Before working hard, check whether the instruction is available. */
2212 {
2215 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2216 need to expand the argument again. This way, we will not perform
2217 side-effects more the once. */
2224 /* Compute into RESULT.
2225 Set RESULT to wherever the result comes back. */
2227 {
2231 {
2240 }
2242 }
2243 else
2247 {
2248 /* Output the entire sequence. */
2253 }
2255 /* If we were unable to expand via the builtin, stop the sequence
2256 (without outputting the insns) and call to the library function
2257 with the stabilized argument list. */
2259 }
2262 }
2264 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2265 return an RTL instruction code that implements the functionality.
2266 If that isn't possible or available return CODE_FOR_nothing. */
2268 static enum insn_code
2270 {
2273 machine_mode mode;
2276 {
2290 /* These builtins have no optabs (yet). */
2294 }
2296 /* There's no easy way to detect the case we need to set EDOM. */
2300 /* Optab mode depends on the mode of the input argument. */
2306 }
2308 /* Expand a call to one of the builtin math functions that operate on
2309 floating point argument and output an integer result (ilogb, isinf,
2310 isnan, etc).
2311 Return 0 if a normal call should be emitted rather than expanding the
2312 function in-line. EXP is the expression that is a call to the builtin
2313 function; if convenient, the result should be placed in TARGET. */
2315 static rtx
2317 {
2319 rtx op0;
2321 machine_mode mode;
2322 tree arg;
2332 {
2337 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2338 need to expand the argument again. This way, we will not perform
2339 side-effects more the once. */
2354 }
2357 }
2359 /* Expand a call to the builtin sincos math function.
2360 Return NULL_RTX if a normal call should be emitted rather than expanding the
2361 function in-line. EXP is the expression that is a call to the builtin
2362 function. */
2364 static rtx
2366 {
2368 machine_mode mode;
2382 /* Make a suitable register to place result in. */
2385 /* Check if sincos insn is available, otherwise emit the call. */
2400 /* Compute into target1 and target2.
2401 Set TARGET to wherever the result comes back. */
2405 /* Move target1 and target2 to the memory locations indicated
2406 by op1 and op2. */
2411 }
2413 /* Expand a call to the internal cexpi builtin to the sincos math function.
2414 EXP is the expression that is a call to the builtin function; if convenient,
2415 the result should be placed in TARGET. */
2417 static rtx
2419 {
2422 machine_mode mode;
2433 /* Try expanding via a sincos optab, fall back to emitting a libcall
2434 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2435 is only generated from sincos, cexp or if we have either of them. */
2437 {
2443 /* Compute into op1 and op2. */
2445 }
2447 {
2458 else
2468 /* Make sure not to fold the sincos call again. */
2472 }
2473 else
2474 {
2484 else
2487 /* If we don't have a decl for cexp create one. This is the
2488 friendliest fallback if the user calls __builtin_cexpi
2489 without full target C99 function support. */
2491 {
2492 tree fntype;
2504 }
2509 /* Make sure not to fold the cexp call again. */
2513 }
2515 /* Now build the proper return type. */
2520 }
2522 /* Conveniently construct a function call expression. FNDECL names the
2523 function to be called, N is the number of arguments, and the "..."
2524 parameters are the argument expressions. Unlike build_call_exr
2525 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2527 static tree
2529 {
2539 }
2541 /* Expand a call to one of the builtin rounding functions gcc defines
2542 as an extension (lfloor and lceil). As these are gcc extensions we
2543 do not need to worry about setting errno to EDOM.
2544 If expanding via optab fails, lower expression to (int)(floor(x)).
2545 EXP is the expression that is a call to the builtin function;
2546 if convenient, the result should be placed in TARGET. */
2548 static rtx
2550 {
2551 convert_optab builtin_optab;
2556 tree fallback_fndecl;
2557 machine_mode mode;
2558 tree arg;
2566 {
2583 }
2585 /* Make a suitable register to place result in. */
2590 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2591 need to expand the argument again. This way, we will not perform
2592 side-effects more the once. */
2599 /* Compute into TARGET. */
2601 {
2602 /* Output the entire sequence. */
2607 }
2609 /* If we were unable to expand via the builtin, stop the sequence
2610 (without outputting the insns). */
2613 /* Fall back to floating point rounding optab. */
2616 /* For non-C99 targets we may end up without a fallback fndecl here
2617 if the user called __builtin_lfloor directly. In this case emit
2618 a call to the floor/ceil variants nevertheless. This should result
2619 in the best user experience for not full C99 targets. */
2621 {
2622 tree fntype;
2626 {
2659 }
2664 }
2671 /* Truncate the result of floating point optab to integer
2672 via expand_fix (). */
2677 }
2679 /* Expand a call to one of the builtin math functions doing integer
2680 conversion (lrint).
2681 Return 0 if a normal call should be emitted rather than expanding the
2682 function in-line. EXP is the expression that is a call to the builtin
2683 function; if convenient, the result should be placed in TARGET. */
2685 static rtx
2687 {
2688 convert_optab builtin_optab;
2689 rtx op0;
2692 tree arg;
2693 machine_mode mode;
2702 {
2721 }
2723 /* There's no easy way to detect the case we need to set EDOM. */
2727 /* Make a suitable register to place result in. */
2730 /* There's no easy way to detect the case we need to set EDOM. */
2732 {
2735 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2736 need to expand the argument again. This way, we will not perform
2737 side-effects more the once. */
2745 {
2746 /* Output the entire sequence. */
2751 }
2753 /* If we were unable to expand via the builtin, stop the sequence
2754 (without outputting the insns) and call to the library function
2755 with the stabilized argument list. */
2757 }
2760 {
2761 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2762 targets, (int) round (x) should never be transformed into
2763 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2764 a call to lround in the hope that the target provides at least some
2765 C99 functions. This should result in the best user experience for
2766 not full C99 targets. */
2767 tree fallback_fndecl = mathfn_built_in_1
2776 }
2779 }
2781 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2782 a normal call should be emitted rather than expanding the function
2783 in-line. EXP is the expression that is a call to the builtin
2784 function; if convenient, the result should be placed in TARGET. */
2786 static rtx
2788 {
2791 machine_mode mode;
2792 machine_mode mode2;
2801 /* Emit a libcall to libgcc. */
2803 /* Mode of the 2nd argument must match that of an int. */
2821 }
2823 /* Expand expression EXP which is a call to the strlen builtin. Return
2824 NULL_RTX if we failed and the caller should emit a normal call, otherwise
2825 try to get the result in TARGET, if convenient. */
2827 static rtx
2829 machine_mode target_mode)
2830 {
2835 rtx pat;
2836 tree len;
2838 rtx src_reg;
2840 machine_mode insn_mode;
2844 /* If the length can be computed at compile-time, return it. */
2849 /* If the length can be computed at compile-time and is constant
2850 integer, but there are side-effects in src, evaluate
2851 src for side-effects, then return len.
2852 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2853 can be optimized into: i++; x = 3; */
2856 {
2859 }
2863 /* If SRC is not a pointer type, don't do this operation inline. */
2867 /* Bail out if we can't compute strlen in the right mode. */
2869 {
2873 }
2877 /* Make a place to hold the source address. We will not expand
2878 the actual source until we are sure that the expansion will
2879 not fail -- there are trees that cannot be expanded twice. */
2882 /* Mark the beginning of the strlen sequence so we can emit the
2883 source operand later. */
2893 /* Check to see if the argument was declared attribute nonstring
2894 and if so, issue a warning since at this point it's not known
2895 to be nul-terminated. */
2898 /* Now that we are assured of success, expand the source. */
2902 {
2903 #ifdef POINTERS_EXTEND_UNSIGNED
2906 POINTERS_EXTEND_UNSIGNED);
2907 #endif
2909 }
2915 else
2918 /* Return the value in the proper mode for this function. */
2923 else
2927 }
2929 /* Expand call EXP to the strnlen built-in, returning the result
2930 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
2932 static rtx
2934 {
2954 {
2958 "%K%qD specified bound %E "
2969 }
2982 "%K%qD specified bound [%wu, %wu] "
2995 }
2997 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2998 bytes from constant string DATA + OFFSET and return it as target
2999 constant. */
3001 static rtx
3003 scalar_int_mode mode)
3004 {
3012 }
3014 /* LEN specify length of the block of memcpy/memset operation.
3015 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3016 In some cases we can make very likely guess on max size, then we
3017 set it into PROBABLE_MAX_SIZE. */
3019 static void
3024 {
3026 {
3029 }
3030 else
3031 {
3035 /* Determine bounds from the type. */
3038 else
3043 else
3049 {
3054 }
3056 {
3057 /* Anti range 0...N lets us to determine minimal size to N+1. */
3059 {
3062 }
3063 /* Code like
3065 int n;
3066 if (n < 100)
3067 memcpy (a, b, n)
3069 Produce anti range allowing negative values of N. We still
3070 can use the information and make a guess that N is not negative.
3071 */
3074 }
3075 }
3079 }
3081 /* Try to verify that the sizes and lengths of the arguments to a string
3082 manipulation function given by EXP are within valid bounds and that
3083 the operation does not lead to buffer overflow or read past the end.
3084 Arguments other than EXP may be null. When non-null, the arguments
3085 have the following meaning:
3086 DST is the destination of a copy call or NULL otherwise.
3087 SRC is the source of a copy call or NULL otherwise.
3088 DSTWRITE is the number of bytes written into the destination obtained
3089 from the user-supplied size argument to the function (such as in
3090 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3091 MAXREAD is the user-supplied bound on the length of the source sequence
3092 (such as in strncat(d, s, N). It specifies the upper limit on the number
3093 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3094 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3095 expression EXP is a string function call (as opposed to a memory call
3096 like memcpy). As an exception, SRCSTR can also be an integer denoting
3097 the precomputed size of the source string or object (for functions like
3098 memcpy).
3099 DSTSIZE is the size of the destination object specified by the last
3100 argument to the _chk builtins, typically resulting from the expansion
3101 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3102 DSTSIZE).
3104 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3105 SIZE_MAX.
3107 If the call is successfully verified as safe return true, otherwise
3108 return false. */
3110 static bool
3113 {
3116 /* The size of the largest object is half the address space, or
3117 PTRDIFF_MAX. (This is way too permissive.) */
3120 /* Either the length of the source string for string functions or
3121 the size of the source object for raw memory functions. */
3126 /* Set to true when the exact number of bytes written by a string
3127 function like strcpy is not known and the only thing that is
3128 known is that it must be at least one (for the terminating nul). */
3131 {
3132 /* SRCSTR is normally a pointer to string but as a special case
3133 it can be an integer denoting the length of a string. */
3135 {
3136 /* Try to determine the range of lengths the source string
3137 refers to. If it can be determined and is less than
3138 the upper bound given by MAXREAD add one to it for
3139 the terminating nul. Otherwise, set it to one for
3140 the same reason, or to MAXREAD as appropriate. */
3143 {
3146 else
3157 }
3158 else
3159 {
3162 }
3163 }
3164 else
3166 }
3169 {
3170 /* When the only available piece of data is the object size
3171 there is nothing to do. */
3175 /* Otherwise, when the length of the source sequence is known
3176 (as with strlen), set DSTWRITE to it. */
3179 }
3189 /* First check the number of bytes to be written against the maximum
3190 object size. */
3192 {
3202 "%K%qD specified size %E "
3205 else
3207 "%K%qD specified size between %E and %E "
3215 }
3217 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3218 constant, and in range of unsigned HOST_WIDE_INT. */
3221 /* Next check the number of bytes to be written against the destination
3222 object size. */
3224 {
3230 {
3238 {
3239 /* This is a call to strcpy with a destination of 0 size
3240 and a source of unknown length. The call will write
3241 at least one byte past the end of the destination. */
3243 "%K%qD writing %E or more bytes into a region "
3246 }
3249 "%K%qD writing %E byte into a region "
3251 "%K%qD writing %E bytes into a region "
3255 {
3256 /* Avoid printing the upper bound if it's invalid. */
3258 "%K%qD writing %E or more bytes into a region "
3261 }
3262 else
3264 "%K%qD writing between %E and %E bytes into "
3267 dstsize);
3269 /* Return error when an overflow has been detected. */
3271 }
3272 }
3274 /* Check the maximum length of the source sequence against the size
3275 of the destination object if known, or against the maximum size
3276 of an object. */
3278 {
3281 /* Use the lower end for MAXREAD from now on. */
3286 {
3291 {
3295 /* Warn about crazy big sizes first since that's more
3296 likely to be meaningful than saying that the bound
3297 is greater than the object size if both are big. */
3300 "%K%qD specified bound %E "
3304 else
3306 "%K%qD specified bound between %E and %E "
3312 }
3315 {
3321 "%K%qD specified bound %E "
3325 else
3327 "%K%qD specified bound between %E and %E "
3332 }
3333 }
3334 }
3336 /* Check for reading past the end of SRC. */
3341 {
3353 {
3354 /* Avoid printing the upper bound if it's invalid. */
3356 "%K%qD reading %E or more bytes from a region "
3359 }
3360 else
3362 "%K%qD reading between %E and %E bytes from a region "
3366 }
3369 }
3371 /* Helper to compute the size of the object referenced by the DEST
3372 expression which must have pointer type, using Object Size type
3373 OSTYPE (only the least significant 2 bits are used). Return
3374 an estimate of the size of the object if successful or NULL when
3375 the size cannot be determined. When the referenced object involves
3376 a non-constant offset in some range the returned value represents
3377 the largest size given the smallest non-negative offset in the
3378 range. The function is intended for diagnostics and should not
3379 be used to influence code generation or optimization. */
3381 tree
3383 {
3386 /* Only the two least significant bits are meaningful. */
3393 {
3402 {
3403 /* compute_builtin_object_size fails for addresses with
3404 non-constant offsets. Try to determine the range of
3405 such an offset here and use it to adjust the constant
3406 size. */
3409 {
3411 {
3415 /* Ignore negative offsets for now. For others,
3416 use the lower bound as the most optimistic
3417 estimate of the (remaining) size. */
3419 ;
3423 else
3425 }
3426 }
3429 {
3434 {
3436 {
3439 /* Ignore negative offsets for now. For others,
3440 use the lower bound as the most optimistic
3441 estimate of the (remaining)size. */
3443 ;
3447 else
3449 }
3450 }
3451 }
3452 }
3455 }
3457 /* Unless computing the largest size (for memcpy and other raw memory
3458 functions), try to determine the size of the object from its type. */
3473 {
3474 /* Return the constant size unless it's zero (that's a zero-length
3475 array likely at the end of a struct). */
3480 }
3483 }
3485 /* Helper to determine and check the sizes of the source and the destination
3486 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3487 call expression, DEST is the destination argument, SRC is the source
3488 argument or null, and LEN is the number of bytes. Use Object Size type-0
3489 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3490 (no overflow or invalid sizes), false otherwise. */
3492 static bool
3494 {
3495 /* For functions like memset and memcpy that operate on raw memory
3496 try to determine the size of the largest source and destination
3497 object using type-0 Object Size regardless of the object size
3498 type specified by the option. */
3504 }
3506 /* Validate memchr arguments without performing any expansion.
3507 Return NULL_RTX. */
3509 static rtx
3511 {
3519 /* Diagnose calls where the specified length exceeds the size
3520 of the object. */
3522 {
3526 }
3529 }
3531 /* Expand a call EXP to the memcpy builtin.
3532 Return NULL_RTX if we failed, the caller should emit a normal call,
3533 otherwise try to get the result in TARGET, if convenient (and in
3534 mode MODE if that's convenient). */
3536 static rtx
3538 {
3551 }
3553 /* Check a call EXP to the memmove built-in for validity.
3554 Return NULL_RTX on both success and failure. */
3556 static rtx
3558 {
3570 }
3572 /* Expand a call EXP to the mempcpy builtin.
3573 Return NULL_RTX if we failed; the caller should emit a normal call,
3574 otherwise try to get the result in TARGET, if convenient (and in
3575 mode MODE if that's convenient). If ENDP is 0 return the
3576 destination pointer, if ENDP is 1 return the end pointer ala
3577 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3578 stpcpy. */
3580 static rtx
3582 {
3591 /* Policy does not generally allow using compute_objsize (which
3592 is used internally by check_memop_size) to change code generation
3593 or drive optimization decisions.
3595 In this instance it is safe because the code we generate has
3596 the same semantics regardless of the return value of
3597 check_memop_sizes. Exactly the same amount of data is copied
3598 and the return value is exactly the same in both cases.
3600 Furthermore, check_memop_size always uses mode 0 for the call to
3601 compute_objsize, so the imprecise nature of compute_objsize is
3602 avoided. */
3604 /* Avoid expanding mempcpy into memcpy when the call is determined
3605 to overflow the buffer. This also prevents the same overflow
3606 from being diagnosed again when expanding memcpy. */
3612 }
3614 /* Helper function to do the actual work for expand of memory copy family
3615 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3616 of memory from SRC to DEST and assign to TARGET if convenient.
3617 If ENDP is 0 return the
3618 destination pointer, if ENDP is 1 return the end pointer ala
3619 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3620 stpcpy. */
3622 static rtx
3625 {
3636 /* If DEST is not a pointer type, call the normal function. */
3640 /* If either SRC is not a pointer type, don't do this
3641 operation in-line. */
3658 /* If SRC is a string constant and block move would be done
3659 by pieces, we can avoid loading the string from memory
3660 and only stored the computed constants. */
3667 {
3669 builtin_memcpy_read_str,
3675 }
3680 /* Copy word part most expediently. */
3693 {
3696 }
3699 {
3701 /* stpcpy pointer to last byte. */
3704 }
3707 }
3709 static rtx
3712 {
3714 endp);
3715 }
3717 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3718 we failed, the caller should emit a normal call, otherwise try to
3719 get the result in TARGET, if convenient. If ENDP is 0 return the
3720 destination pointer, if ENDP is 1 return the end pointer ala
3721 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3722 stpcpy. */
3724 static rtx
3726 {
3728 rtx dest_mem;
3729 rtx src_mem;
3737 {
3740 }
3749 {
3751 /* movstr is supposed to set end to the address of the NUL
3752 terminator. If the caller requested a mempcpy-like return value,
3753 adjust it. */
3755 {
3759 }
3760 }
3762 }
3764 /* Do some very basic size validation of a call to the strcpy builtin
3765 given by EXP. Return NULL_RTX to have the built-in expand to a call
3766 to the library function. */
3768 static rtx
3770 {
3778 /* There is no way here to determine the length of the string in
3779 the destination to which the SRC string is being appended so
3780 just diagnose cases when the souce string is longer than
3781 the destination object. */
3786 destsize);
3789 }
3791 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3792 NULL_RTX if we failed the caller should emit a normal call, otherwise
3793 try to get the result in TARGET, if convenient (and in mode MODE if that's
3794 convenient). */
3796 static rtx
3798 {
3806 {
3810 }
3813 {
3814 /* Check to see if the argument was declared attribute nonstring
3815 and if so, issue a warning since at this point it's not known
3816 to be nul-terminated. */
3820 }
3823 }
3825 /* Helper function to do the actual work for expand_builtin_strcpy. The
3826 arguments to the builtin_strcpy call DEST and SRC are broken out
3827 so that this can also be called without constructing an actual CALL_EXPR.
3828 The other arguments and return value are the same as for
3829 expand_builtin_strcpy. */
3831 static rtx
3833 {
3835 }
3837 /* Expand a call EXP to the stpcpy builtin.
3838 Return NULL_RTX if we failed the caller should emit a normal call,
3839 otherwise try to get the result in TARGET, if convenient (and in
3840 mode MODE if that's convenient). */
3842 static rtx
3844 {
3855 {
3859 }
3861 /* If return value is ignored, transform stpcpy into strcpy. */
3863 {
3867 }
3868 else
3869 {
3871 rtx ret;
3873 /* Ensure we get an actual string whose length can be evaluated at
3874 compile-time, not an expression containing a string. This is
3875 because the latter will potentially produce pessimized code
3876 when used to produce the return value. */
3888 {
3892 {
3896 {
3898 {
3901 else
3903 }
3912 }
3913 }
3914 }
3917 }
3918 }
3920 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
3921 arguments while being careful to avoid duplicate warnings (which could
3922 be issued if the expander were to expand the call, resulting in it
3923 being emitted in expand_call(). */
3925 static rtx
3927 {
3929 {
3930 /* The call has been successfully expanded. Check for nonstring
3931 arguments and issue warnings as appropriate. */
3934 }
3937 }
3939 /* Check a call EXP to the stpncpy built-in for validity.
3940 Return NULL_RTX on both success and failure. */
3942 static rtx
3944 {
3950 /* The source and destination of the call. */
3954 /* The exact number of bytes to write (not the maximum). */
3957 /* The size of the destination object. */
3963 }
3965 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3966 bytes from constant string DATA + OFFSET and return it as target
3967 constant. */
3969 rtx
3971 scalar_int_mode mode)
3972 {
3979 }
3981 /* Helper to check the sizes of sequences and the destination of calls
3982 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3983 success (no overflow or invalid sizes), false otherwise. */
3985 static bool
3987 {
3992 /* Try to determine the range of lengths that the source expression
3993 refers to. */
3997 /* Try to verify that the destination is big enough for the shortest
3998 string. */
4001 {
4002 /* If it hasn't been provided by __strncat_chk, try to determine
4003 the size of the destination object into which the source is
4004 being copied. */
4006 }
4008 /* Add one for the terminating nul. */
4011 size_one_node)
4014 /* The strncat function copies at most MAXREAD bytes and always appends
4015 the terminating nul so the specified upper bound should never be equal
4016 to (or greater than) the size of the destination. */
4019 {
4028 }
4036 /* The number of bytes to write is LEN but check_access will also
4037 check SRCLEN if LEN's value isn't known. */
4039 objsize);
4040 }
4042 /* Similar to expand_builtin_strcat, do some very basic size validation
4043 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4044 the built-in expand to a call to the library function. */
4046 static rtx
4048 {
4056 /* The upper bound on the number of bytes to write. */
4058 /* The length of the source sequence. */
4061 /* Try to determine the range of lengths that the source expression
4062 refers to. */
4066 else
4069 /* Try to verify that the destination is big enough for the shortest
4070 string. First try to determine the size of the destination object
4071 into which the source is being copied. */
4074 /* Add one for the terminating nul. */
4077 size_one_node)
4080 /* The strncat function copies at most MAXREAD bytes and always appends
4081 the terminating nul so the specified upper bound should never be equal
4082 to (or greater than) the size of the destination. */
4085 {
4094 }
4102 /* The number of bytes to write is SRCLEN. */
4106 }
4108 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4109 NULL_RTX if we failed the caller should emit a normal call. */
4111 static rtx
4113 {
4118 {
4121 /* The number of bytes to write (not the maximum). */
4123 /* The length of the source sequence. */
4127 {
4131 /* The number of bytes to write is LEN but check_access will also
4132 check SLEN if LEN's value isn't known. */
4134 destsize);
4135 }
4137 /* We must be passed a constant len and src parameter. */
4143 /* We're required to pad with trailing zeros if the requested
4144 len is greater than strlen(s2)+1. In that case try to
4145 use store_by_pieces, if it fails, punt. */
4147 {
4150 rtx dest_mem;
4154 builtin_strncpy_read_str,
4161 builtin_strncpy_read_str,
4166 }
4167 }
4169 }
4171 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4172 bytes from constant string DATA + OFFSET and return it as target
4173 constant. */
4175 rtx
4177 scalar_int_mode mode)
4178 {
4185 }
4187 /* Callback routine for store_by_pieces. Return the RTL of a register
4188 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4189 char value given in the RTL register data. For example, if mode is
4190 4 bytes wide, return the RTL for 0x01010101*data. */
4192 static rtx
4194 scalar_int_mode mode)
4195 {
4211 }
4213 /* Expand expression EXP, which is a call to the memset builtin. Return
4214 NULL_RTX if we failed the caller should emit a normal call, otherwise
4215 try to get the result in TARGET, if convenient (and in mode MODE if that's
4216 convenient). */
4218 static rtx
4220 {
4232 }
4234 /* Helper function to do the actual work for expand_builtin_memset. The
4235 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4236 so that this can also be called without constructing an actual CALL_EXPR.
4237 The other arguments and return value are the same as for
4238 expand_builtin_memset. */
4240 static rtx
4243 {
4246 machine_mode val_mode;
4258 /* If DEST is not a pointer type, don't do this operation in-line. */
4269 /* If the LEN parameter is zero, return DEST. */
4271 {
4272 /* Evaluate and ignore VAL in case it has side-effects. */
4275 }
4277 /* Stabilize the arguments in case we fail. */
4289 {
4290 rtx val_rtx;
4295 /* Assume that we can memset by pieces if we can store
4296 * the coefficients by pieces (in the required modes).
4297 * We can't pass builtin_memset_gen_str as that emits RTL. */
4303 {
4308 }
4312 probable_max_size))
4318 }
4324 {
4335 probable_max_size))
4341 }
4349 probable_max_size);
4352 {
4355 }
4359 do_libcall:
4368 else
4373 }
4375 /* Expand expression EXP, which is a call to the bzero builtin. Return
4376 NULL_RTX if we failed the caller should emit a normal call. */
4378 static rtx
4380 {
4389 /* New argument list transforming bzero(ptr x, int y) to
4390 memset(ptr x, int 0, size_t y). This is done this way
4391 so that if it isn't expanded inline, we fallback to
4392 calling bzero instead of memset. */
4400 }
4402 /* Try to expand cmpstr operation ICODE with the given operands.
4403 Return the result rtx on success, otherwise return null. */
4405 static rtx
4407 HOST_WIDE_INT align)
4408 {
4422 }
4424 /* Expand expression EXP, which is a call to the memcmp built-in function.
4425 Return NULL_RTX if we failed and the caller should emit a normal call,
4426 otherwise try to get the result in TARGET, if convenient.
4427 RESULT_EQ is true if we can relax the returned value to be either zero
4428 or nonzero, without caring about the sign. */
4430 static rtx
4432 {
4441 /* Diagnose calls where the specified length exceeds the size of either
4442 object. */
4444 {
4448 {
4452 }
4453 }
4461 /* If we don't have POINTER_TYPE, call the function. */
4469 /* Set MEM_SIZE as appropriate. */
4471 {
4474 }
4480 {
4484 }
4486 /* If SRC is a string constant and block move would be done
4487 by pieces, we can avoid loading the string from memory
4488 and only stored the computed constants. */
4500 {
4501 /* Return the value in the proper mode for this function. */
4506 {
4509 }
4512 }
4515 }
4517 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4518 if we failed the caller should emit a normal call, otherwise try to get
4519 the result in TARGET, if convenient. */
4521 static rtx
4523 {
4538 /* If we don't have POINTER_TYPE, call the function. */
4542 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4550 /* Try to call cmpstrsi. */
4555 /* Try to determine at least one length and call cmpstrnsi. */
4557 {
4558 tree len;
4559 rtx arg3_rtx;
4569 /* If we don't have a constant length for the first, use the length
4570 of the second, if we know it. We don't require a constant for
4571 this case; some cost analysis could be done if both are available
4572 but neither is constant. For now, assume they're equally cheap,
4573 unless one has side effects. If both strings have constant lengths,
4574 use the smaller. */
4590 else
4593 /* If both arguments have side effects, we cannot optimize. */
4595 {
4597 result = expand_cmpstrn_or_cmpmem
4600 }
4601 }
4605 {
4606 /* Check to see if the argument was declared attribute nonstring
4607 and if so, issue a warning since at this point it's not known
4608 to be nul-terminated. */
4611 /* Return the value in the proper mode for this function. */
4619 }
4621 /* Expand the library call ourselves using a stabilized argument
4622 list to avoid re-evaluating the function's arguments twice. */
4627 }
4629 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4630 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4631 the result in TARGET, if convenient. */
4633 static rtx
4635 ATTRIBUTE_UNUSED machine_mode mode)
4636 {
4641 /* If c_strlen can determine an expression for one of the string
4642 lengths, and it doesn't have side effects, then emit cmpstrnsi
4643 using length MIN(strlen(string)+1, arg3). */
4648 tree len;
4669 /* If we don't have a constant length for the first, use the length
4670 of the second, if we know it. If neither string is constant length,
4671 use the given length argument. We don't require a constant for
4672 this case; some cost analysis could be done if both are available
4673 but neither is constant. For now, assume they're equally cheap,
4674 unless one has side effects. If both strings have constant lengths,
4675 use the smaller. */
4693 else
4696 /* If we are not using the given length, we must incorporate it here.
4697 The actual new length parameter will be MIN(len,arg3) in this case. */
4709 {
4710 /* Check to see if the argument was declared attribute nonstring
4711 and if so, issue a warning since at this point it's not known
4712 to be nul-terminated. */
4715 /* Return the value in the proper mode for this function. */
4723 }
4725 /* Expand the library call ourselves using a stabilized argument
4726 list to avoid re-evaluating the function's arguments twice. */
4731 }
4733 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4734 if that's convenient. */
4736 rtx
4738 {
4739 rtx val;
4742 /* Don't do __builtin_saveregs more than once in a function.
4743 Save the result of the first call and reuse it. */
4747 /* When this function is called, it means that registers must be
4748 saved on entry to this function. So we migrate the call to the
4749 first insn of this function. */
4753 /* Do whatever the machine needs done in this case. */
4761 /* Put the insns after the NOTE that starts the function. If this
4762 is inside a start_sequence, make the outer-level insn chain current, so
4763 the code is placed at the start of the function. */
4769 }
4771 /* Expand a call to __builtin_next_arg. */
4773 static rtx
4775 {
4776 /* Checking arguments is already done in fold_builtin_next_arg
4777 that must be called before this function. */
4782 }
4784 /* Make it easier for the backends by protecting the valist argument
4785 from multiple evaluations. */
4787 static tree
4789 {
4792 /* The current way of determining the type of valist is completely
4793 bogus. We should have the information on the va builtin instead. */
4798 {
4802 /* For this case, the backends will be expecting a pointer to
4803 vatype, but it's possible we've actually been given an array
4804 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4805 So fix it. */
4807 {
4810 }
4811 }
4812 else
4813 {
4817 {
4823 }
4829 }
4832 }
4834 /* The "standard" definition of va_list is void*. */
4836 tree
4838 {
4840 }
4842 /* The "standard" abi va_list is va_list_type_node. */
4844 tree
4846 {
4848 }
4850 /* The "standard" type of va_list is va_list_type_node. */
4852 tree
4854 {
4861 {
4862 /* If va_list is an array type, the argument may have decayed
4863 to a pointer type, e.g. by being passed to another function.
4864 In that case, unwrap both types so that we can compare the
4865 underlying records. */
4868 {
4871 }
4872 }
4877 }
4879 /* The "standard" implementation of va_start: just assign `nextarg' to
4880 the variable. */
4882 void
4884 {
4887 }
4889 /* Expand EXP, a call to __builtin_va_start. */
4891 static rtx
4893 {
4894 rtx nextarg;
4895 tree valist;
4899 {
4902 }
4912 else
4916 }
4918 /* Expand EXP, a call to __builtin_va_end. */
4920 static rtx
4922 {
4925 /* Evaluate for side effects, if needed. I hate macros that don't
4926 do that. */
4931 }
4933 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4934 builtin rather than just as an assignment in stdarg.h because of the
4935 nastiness of array-type va_list types. */
4937 static rtx
4939 {
4952 {
4956 }
4957 else
4958 {
4961 /* Evaluate to pointers. */
4970 /* "Dereference" to BLKmode memories. */
4978 /* Copy. */
4980 }
4983 }
4985 /* Expand a call to one of the builtin functions __builtin_frame_address or
4986 __builtin_return_address. */
4988 static rtx
4990 {
4991 /* The argument must be a nonnegative integer constant.
4992 It counts the number of frames to scan up the stack.
4993 The value is either the frame pointer value or the return
4994 address saved in that frame. */
4996 /* Warning about missing arg was already issued. */
4999 {
5002 }
5003 else
5004 {
5005 /* Number of frames to scan up the stack. */
5010 /* Some ports cannot access arbitrary stack frames. */
5012 {
5015 }
5018 {
5019 /* Warn since no effort is made to ensure that any frame
5020 beyond the current one exists or can be safely reached. */
5023 }
5025 /* For __builtin_frame_address, return what we've got. */
5033 }
5034 }
5036 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5037 failed and the caller should emit a normal call. */
5039 static rtx
5041 {
5042 rtx op0;
5043 rtx result;
5046 HOST_WIDE_INT max_size;
5049 bool valid_arglist
5052 VOID_TYPE)
5062 {
5063 /* -Walloca-larger-than and -Wvla-larger-than settings override
5064 the more general -Walloc-size-larger-than so unless either of
5065 the former options is specified check the alloca arguments for
5066 overflow. */
5070 }
5072 /* Compute the argument. */
5075 /* Compute the alignment. */
5077 ? BIGGEST_ALIGNMENT
5080 /* Compute the maximum size. */
5085 /* Allocate the desired space. If the allocation stems from the declaration
5086 of a variable-sized object, it cannot accumulate. */
5087 result
5092 }
5094 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5095 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5096 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5097 handle_builtin_stack_restore function. */
5099 static rtx
5101 {
5108 OPTAB_LIB_WIDEN);
5111 OPTAB_LIB_WIDEN);
5116 }
5118 /* Expand a call to bswap builtin in EXP.
5119 Return NULL_RTX if a normal call should be emitted rather than expanding the
5120 function in-line. If convenient, the result should be placed in TARGET.
5121 SUBTARGET may be used as the target for computing one of EXP's operands. */
5123 static rtx
5125 rtx subtarget)
5126 {
5127 tree arg;
5128 rtx op0;
5146 }
5148 /* Expand a call to a unary builtin in EXP.
5149 Return NULL_RTX if a normal call should be emitted rather than expanding the
5150 function in-line. If convenient, the result should be placed in TARGET.
5151 SUBTARGET may be used as the target for computing one of EXP's operands. */
5153 static rtx
5156 {
5157 rtx op0;
5162 /* Compute the argument. */
5164 (subtarget
5168 /* Compute op, into TARGET if possible.
5169 Set TARGET to wherever the result comes back. */
5175 }
5177 /* Expand a call to __builtin_expect. We just return our argument
5178 as the builtin_expect semantic should've been already executed by
5179 tree branch prediction pass. */
5181 static rtx
5183 {
5184 tree arg;
5191 /* When guessing was done, the hints should be already stripped away. */
5195 }
5197 /* Expand a call to __builtin_assume_aligned. We just return our first
5198 argument as the builtin_assume_aligned semantic should've been already
5199 executed by CCP. */
5201 static rtx
5203 {
5207 EXPAND_NORMAL);
5212 }
5214 void
5216 {
5218 {
5220 /* For trap insns when not accumulating outgoing args force
5221 REG_ARGS_SIZE note to prevent crossjumping of calls with
5222 different args sizes. */
5225 }
5226 else
5227 {
5231 }
5234 }
5236 /* Expand a call to __builtin_unreachable. We do nothing except emit
5237 a barrier saying that control flow will not pass here.
5239 It is the responsibility of the program being compiled to ensure
5240 that control flow does never reach __builtin_unreachable. */
5241 static void
5243 {
5245 }
5247 /* Expand EXP, a call to fabs, fabsf or fabsl.
5248 Return NULL_RTX if a normal call should be emitted rather than expanding
5249 the function inline. If convenient, the result should be placed
5250 in TARGET. SUBTARGET may be used as the target for computing
5251 the operand. */
5253 static rtx
5255 {
5256 machine_mode mode;
5257 tree arg;
5258 rtx op0;
5268 }
5270 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5271 Return NULL is a normal call should be emitted rather than expanding the
5272 function inline. If convenient, the result should be placed in TARGET.
5273 SUBTARGET may be used as the target for computing the operand. */
5275 static rtx
5277 {
5279 tree arg;
5291 }
5293 /* Expand a call to __builtin___clear_cache. */
5295 static rtx
5297 {
5299 {
5300 #ifdef CLEAR_INSN_CACHE
5301 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5302 does something. Just do the default expansion to a call to
5303 __clear_cache(). */
5305 #else
5306 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5307 does nothing. There is no need to call it. Do nothing. */
5310 }
5312 /* We have a "clear_cache" insn, and it will handle everything. */
5316 /* We must not expand to a library call. If we did, any
5317 fallback library function in libgcc that might contain a call to
5318 __builtin___clear_cache() would recurse infinitely. */
5320 {
5323 }
5326 {
5339 }
5341 }
5343 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5345 static rtx
5347 {
5350 /* If we don't need too much alignment, we'll have been guaranteed
5351 proper alignment by get_trampoline_type. */
5355 /* Round address up to desired boundary. */
5366 }
5368 static rtx
5370 {
5386 /* If ONSTACK, the TRAMP argument should be the address of a field
5387 within the local function's FRAME decl. Either way, let's see if
5388 we can fill in the MEM_ATTRs for this memory. */
5392 /* Creator of a heap trampoline is responsible for making sure the
5393 address is aligned to at least STACK_BOUNDARY. Normally malloc
5394 will ensure this anyhow. */
5397 {
5401 }
5403 /* The FUNC argument should be the address of the nested function.
5404 Extract the actual function decl to pass to the hook. */
5411 /* Generate insns to initialize the trampoline. */
5415 {
5421 }
5424 }
5426 static rtx
5428 {
5429 rtx tramp;
5440 }
5442 /* Expand a call to the builtin descriptor initialization routine.
5443 A descriptor is made up of a couple of pointers to the static
5444 chain and the code entry in this order. */
5446 static rtx
5448 {
5453 VOID_TYPE))
5467 /* Generate insns to initialize the descriptor. */
5473 }
5475 /* Expand a call to the builtin descriptor adjustment routine. */
5477 static rtx
5479 {
5480 rtx tramp;
5487 /* Unalign the descriptor to allow runtime identification. */
5492 }
5494 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5495 function. The function first checks whether the back end provides
5496 an insn to implement signbit for the respective mode. If not, it
5497 checks whether the floating point format of the value is such that
5498 the sign bit can be extracted. If that is not the case, error out.
5499 EXP is the expression that is a call to the builtin function; if
5500 convenient, the result should be placed in TARGET. */
5501 static rtx
5503 {
5505 scalar_float_mode fmode;
5507 tree arg;
5510 rtx temp;
5523 /* Expand the argument yielding a RTX expression. */
5526 /* Check if the back end provides an insn that handles signbit for the
5527 argument's mode. */
5530 {
5536 }
5538 /* For floating point formats without a sign bit, implement signbit
5539 as "ARG < 0.0". */
5542 {
5543 /* But we can't do this if the format supports signed zero. */
5549 }
5552 {
5555 }
5556 else
5557 {
5559 /* Handle targets with different FP word orders. */
5562 else
5566 }
5568 /* Force the intermediate word_mode (or narrower) result into a
5569 register. This avoids attempting to create paradoxical SUBREGs
5570 of floating point modes below. */
5573 /* If the bitpos is within the "result mode" lowpart, the operation
5574 can be implement with a single bitwise AND. Otherwise, we need
5575 a right shift and an AND. */
5578 {
5586 }
5587 else
5588 {
5589 /* Perform a logical right shift to place the signbit in the least
5590 significant bit, then truncate the result to the desired mode
5591 and mask just this bit. */
5596 }
5599 }
5601 /* Expand fork or exec calls. TARGET is the desired target of the
5602 call. EXP is the call. FN is the
5603 identificator of the actual function. IGNORE is nonzero if the
5604 value is to be ignored. */
5606 static rtx
5608 {
5610 tree call;
5612 /* If we are not profiling, just call the function. */
5616 /* Otherwise call the wrapper. This should be equivalent for the rest of
5617 compiler, so the code does not diverge, and the wrapper may run the
5618 code necessary for keeping the profiling sane. */
5621 {
5652 }
5664 }
5667 \f
5668 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5669 the pointer in these functions is void*, the tree optimizers may remove
5670 casts. The mode computed in expand_builtin isn't reliable either, due
5671 to __sync_bool_compare_and_swap.
5673 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5674 group of builtins. This gives us log2 of the mode size. */
5678 {
5679 /* The size is not negotiable, so ask not to get BLKmode in return
5680 if the target indicates that a smaller size would be better. */
5682 }
5684 /* Expand the memory expression LOC and return the appropriate memory operand
5685 for the builtin_sync operations. */
5687 static rtx
5689 {
5695 /* Note that we explicitly do not want any alias information for this
5696 memory, so that we kill all other live memories. Otherwise we don't
5697 satisfy the full barrier semantics of the intrinsic. */
5700 /* The alignment needs to be at least according to that of the mode. */
5707 }
5709 /* Make sure an argument is in the right mode.
5710 EXP is the tree argument.
5711 MODE is the mode it should be in. */
5713 static rtx
5715 {
5716 rtx val;
5717 machine_mode old_mode;
5720 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5721 of CONST_INTs, where we know the old_mode only from the call argument. */
5728 }
5731 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5732 EXP is the CALL_EXPR. CODE is the rtx code
5733 that corresponds to the arithmetic or logical operation from the name;
5734 an exception here is that NOT actually means NAND. TARGET is an optional
5735 place for us to store the results; AFTER is true if this is the
5736 fetch_and_xxx form. */
5738 static rtx
5741 rtx target)
5742 {
5747 {
5754 {
5783 }
5784 }
5786 /* Expand the operands. */
5791 after);
5792 }
5794 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5795 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5796 true if this is the boolean form. TARGET is a place for us to store the
5797 results; this is NOT optional if IS_BOOL is true. */
5799 static rtx
5802 {
5806 /* Expand the operands. */
5813 {
5816 else
5818 }
5821 MEMMODEL_SYNC_SEQ_CST))
5825 }
5827 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5828 general form is actually an atomic exchange, and some targets only
5829 support a reduced form with the second argument being a constant 1.
5830 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5831 the results. */
5833 static rtx
5835 rtx target)
5836 {
5839 /* Expand the operands. */
5844 }
5846 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5848 static void
5850 {
5851 rtx mem;
5853 /* Expand the operands. */
5857 }
5859 /* Given an integer representing an ``enum memmodel'', verify its
5860 correctness and return the memory model enum. */
5862 static enum memmodel
5864 {
5865 rtx op;
5867 source_location loc
5870 /* If the parameter is not a constant, it's a run time value so we'll just
5871 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5881 {
5885 }
5887 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5889 {
5893 }
5895 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5896 be conservative and promote consume to acquire. */
5901 }
5903 /* Expand the __atomic_exchange intrinsic:
5904 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5905 EXP is the CALL_EXPR.
5906 TARGET is an optional place for us to store the results. */
5908 static rtx
5910 {
5919 /* Expand the operands. */
5924 }
5926 /* Expand the __atomic_compare_exchange intrinsic:
5927 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5928 TYPE desired, BOOL weak,
5929 enum memmodel success,
5930 enum memmodel failure)
5931 EXP is the CALL_EXPR.
5932 TARGET is an optional place for us to store the results. */
5934 static rtx
5936 rtx target)
5937 {
5941 tree weak;
5943 source_location loc
5950 {
5952 "failure memory model cannot be stronger than success "
5955 }
5958 {
5960 "invalid failure memory model for "
5964 }
5970 /* Expand the operands. */
5986 /* Lest the rtl backend create a race condition with an imporoper store
5987 to memory, always create a new pseudo for OLDVAL. */
5994 /* Conditionally store back to EXPECT, lest we create a race condition
5995 with an improper store to memory. */
5996 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5997 the normal case where EXPECT is totally private, i.e. a register. At
5998 which point the store can be unconditional. */
6006 }
6008 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6009 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6010 call. The weak parameter must be dropped to match the expected parameter
6011 list and the expected argument changed from value to pointer to memory
6012 slot. */
6014 static void
6016 {
6032 /* Skip the boolean weak parameter. */
6035 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6038 built_in_function fncode
6043 fndecl);
6048 {
6055 }
6056 }
6058 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6060 void
6062 {
6068 tree lhs;
6070 source_location loc
6077 {
6079 "failure memory model cannot be stronger than success "
6082 }
6085 {
6087 "invalid failure memory model for "
6091 }
6094 {
6097 }
6099 /* Expand the operands. */
6112 {
6115 }
6119 {
6125 }
6126 }
6128 /* Expand the __atomic_load intrinsic:
6129 TYPE __atomic_load (TYPE *object, enum memmodel)
6130 EXP is the CALL_EXPR.
6131 TARGET is an optional place for us to store the results. */
6133 static rtx
6135 {
6136 rtx mem;
6141 {
6142 source_location loc
6147 }
6152 /* Expand the operand. */
6156 }
6159 /* Expand the __atomic_store intrinsic:
6160 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6161 EXP is the CALL_EXPR.
6162 TARGET is an optional place for us to store the results. */
6164 static rtx
6166 {
6173 {
6174 source_location loc
6179 }
6184 /* Expand the operands. */
6189 }
6191 /* Expand the __atomic_fetch_XXX intrinsic:
6192 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6193 EXP is the CALL_EXPR.
6194 TARGET is an optional place for us to store the results.
6195 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6196 FETCH_AFTER is true if returning the result of the operation.
6197 FETCH_AFTER is false if returning the value before the operation.
6198 IGNORE is true if the result is not used.
6199 EXT_CALL is the correct builtin for an external call if this cannot be
6200 resolved to an instruction sequence. */
6202 static rtx
6206 {
6209 tree fndecl;
6210 tree addr;
6214 /* Expand the operands. */
6218 /* Only try generating instructions if inlining is turned on. */
6220 {
6224 }
6226 /* Return if a different routine isn't needed for the library call. */
6230 /* Change the call to the specified function. */
6238 /* If we will emit code after the call, the call can not be a tail call.
6239 If it is emitted as a tail call, a barrier is emitted after it, and
6240 then all trailing code is removed. */
6244 /* Expand the call here so we can emit trailing code. */
6247 /* Replace the original function just in case it matters. */
6250 /* Then issue the arithmetic correction to return the right result. */
6252 {
6254 {
6256 OPTAB_LIB_WIDEN);
6258 }
6259 else
6261 OPTAB_LIB_WIDEN);
6262 }
6264 }
6266 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6268 void
6270 {
6278 optab optab;
6290 {
6305 }
6308 {
6315 }
6337 {
6342 }
6343 else
6345 OPTAB_DIRECT);
6348 }
6350 /* Expand an atomic clear operation.
6351 void _atomic_clear (BOOL *obj, enum memmodel)
6352 EXP is the call expression. */
6354 static rtx
6356 {
6357 machine_mode mode;
6366 {
6367 source_location loc
6372 }
6374 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6375 Failing that, a store is issued by __atomic_store. The only way this can
6376 fail is if the bool type is larger than a word size. Unlikely, but
6377 handle it anyway for completeness. Assume a single threaded model since
6378 there is no atomic support in this case, and no barriers are required. */
6383 }
6385 /* Expand an atomic test_and_set operation.
6386 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6387 EXP is the call expression. */
6389 static rtx
6391 {
6392 rtx mem;
6394 machine_mode mode;
6401 }
6404 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6405 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6407 static tree
6409 {
6411 machine_mode mode;
6417 /* We need a corresponding integer mode for the access to be lock-free. */
6425 {
6428 /* Either this argument is null, or it's a fake pointer encoding
6429 the alignment of the object. */
6435 else
6437 }
6438 else
6439 {
6442 /* This function is usually invoked and folded immediately by the front
6443 end before anything else has a chance to look at it. The pointer
6444 parameter at this point is usually cast to a void *, so check for that
6445 and look past the cast. */
6455 /* Get the underlying type of the object. */
6458 }
6460 /* If the object has smaller alignment, the lock free routines cannot
6461 be used. */
6465 /* Check if a compare_and_swap pattern exists for the mode which represents
6466 the required size. The pattern is not allowed to fail, so the existence
6467 of the pattern indicates support is present. Also require that an
6468 atomic load exists for the required size. */
6471 else
6473 }
6475 /* Return true if the parameters to call EXP represent an object which will
6476 always generate lock free instructions. The first argument represents the
6477 size of the object, and the second parameter is a pointer to the object
6478 itself. If NULL is passed for the object, then the result is based on
6479 typical alignment for an object of the specified size. Otherwise return
6480 false. */
6482 static rtx
6484 {
6485 tree size;
6490 {
6493 }
6499 }
6501 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6502 is lock free on this architecture. */
6504 static tree
6506 {
6510 /* If it isn't always lock free, don't generate a result. */
6515 }
6517 /* Return true if the parameters to call EXP represent an object which will
6518 always generate lock free instructions. The first argument represents the
6519 size of the object, and the second parameter is a pointer to the object
6520 itself. If NULL is passed for the object, then the result is based on
6521 typical alignment for an object of the specified size. Otherwise return
6522 NULL*/
6524 static rtx
6526 {
6527 tree size;
6532 {
6535 }
6540 /* If the value is known at compile time, return the RTX for it. */
6546 }
6548 /* Expand the __atomic_thread_fence intrinsic:
6549 void __atomic_thread_fence (enum memmodel)
6550 EXP is the CALL_EXPR. */
6552 static void
6554 {
6557 }
6559 /* Expand the __atomic_signal_fence intrinsic:
6560 void __atomic_signal_fence (enum memmodel)
6561 EXP is the CALL_EXPR. */
6563 static void
6565 {
6568 }
6570 /* Expand the __sync_synchronize intrinsic. */
6572 static void
6574 {
6576 }
6578 static rtx
6580 {
6586 {
6588 /* If the target is not sutitable then create a new target. */
6596 }
6599 }
6601 static void
6603 {
6609 {
6616 }
6618 }
6620 \f
6621 /* Emit code to restore the current value of stack. */
6623 static void
6625 {
6637 }
6639 /* Emit code to save the current value of stack. */
6641 static rtx
6643 {
6648 }
6650 /* Emit code to get the openacc gang, worker or vector id or size. */
6652 static rtx
6654 {
6656 rtx fallback_retval;
6659 {
6672 }
6675 {
6678 }
6682 {
6685 }
6689 {
6697 }
6706 {
6709 }
6717 }
6719 /* Expand an expression EXP that calls a built-in function,
6720 with result going to TARGET if that's convenient
6721 (and in mode MODE if that's convenient).
6722 SUBTARGET may be used as the target for computing one of EXP's operands.
6723 IGNORE is nonzero if the value is to be ignored. */
6725 rtx
6728 {
6737 /* When ASan is enabled, we don't want to expand some memory/string
6738 builtins and rely on libsanitizer's hooks. This allows us to avoid
6739 redundant checks and be sure, that possible overflow will be detected
6740 by ASan. */
6745 /* When not optimizing, generate calls to library functions for a certain
6746 set of builtins. */
6760 /* The built-in function expanders test for target == const0_rtx
6761 to determine whether the function's result will be ignored. */
6765 /* If the result of a pure or const built-in function is ignored, and
6766 none of its arguments are volatile, we can avoid expanding the
6767 built-in call and just evaluate the arguments for side-effects. */
6771 {
6773 tree arg;
6774 call_expr_arg_iterator iter;
6778 {
6781 }
6784 {
6788 }
6789 }
6792 {
6810 /* Just do a normal library call if we were unable to fold
6811 the values. */
6888 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6889 FUNCTION with a copy of the parameters described by
6890 ARGUMENTS, and ARGSIZE. It returns a block of memory
6891 allocated on the stack into which is stored all the registers
6892 that might possibly be used for returning the result of a
6893 function. ARGUMENTS is the value returned by
6894 __builtin_apply_args. ARGSIZE is the number of bytes of
6895 arguments that must be copied. ??? How should this value be
6896 computed? We'll also need a safe worst case value for varargs
6897 functions. */
6904 else
6905 {
6913 }
6915 /* __builtin_return (RESULT) causes the function to return the
6916 value described by RESULT. RESULT is address of the block of
6917 memory returned by __builtin_apply. */
6927 /* All valid uses of __builtin_va_arg_pack () are removed during
6928 inlining. */
6933 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6934 inlining. */
6938 /* Return the address of the first anonymous stack arg. */
6960 /* Returns the address of the area where the structure is returned.
6961 0 otherwise. */
6967 else
6970 CASE_BUILT_IN_ALLOCA:
7120 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7121 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7122 when changing it to a strcmp call. */
7128 /* Change this call back to a BUILT_IN_STRCMP. */
7132 /* Delete the last parameter. */
7139 /* FALLTHROUGH */
7147 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7148 back to a BUILT_IN_STRNCMP. */
7154 /* Change it back to a BUILT_IN_STRNCMP. */
7157 /* FALLTHROUGH */
7172 {
7175 }
7179 /* This should have been lowered to the builtins below. */
7183 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7184 and the receiver label. */
7186 {
7192 /* This is copied from the handling of non-local gotos. */
7194 nonlocal_goto_handler_labels
7196 nonlocal_goto_handler_labels);
7197 /* ??? Do not let expand_label treat us as such since we would
7198 not want to be both on the list of non-local labels and on
7199 the list of forced labels. */
7202 }
7206 /* __builtin_setjmp_receiver is passed the receiver label. */
7208 {
7214 }
7217 /* __builtin_longjmp is passed a pointer to an array of five words.
7218 It's similar to the C library longjmp function but works with
7219 __builtin_setjmp above. */
7222 {
7228 {
7231 }
7235 }
7244 /* This updates the setjmp buffer that is its argument with the value
7245 of the current stack pointer. */
7248 {
7249 rtx buf_addr
7254 }
7274 /* Various hooks for the DWARF 2 __throw routine. */
7280 #ifdef DWARF2_UNWIND_INFO
7286 #endif
7486 mode = get_builtin_sync_mode
7498 mode = get_builtin_sync_mode
7545 {
7549 mode =
7555 /* If this is turned into an external library call, the weak parameter
7556 must be dropped to match the expected parameter list. */
7561 /* Skip the boolean weak parameter. */
7566 }
7595 {
7605 }
7611 {
7621 }
7627 {
7637 }
7643 {
7653 }
7659 {
7669 }
7675 {
7685 }
7822 /* Do library call, if we failed to expand the builtin when
7823 folding. */
7832 }
7834 /* The switch statement above can drop through to cause the function
7835 to be called normally. */
7837 }
7839 /* Determine whether a tree node represents a call to a built-in
7840 function. If the tree T is a call to a built-in function with
7841 the right number of arguments of the appropriate types, return
7842 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7843 Otherwise the return value is END_BUILTINS. */
7845 enum built_in_function
7847 {
7850 const_call_expr_arg_iterator iter;
7865 {
7866 /* If a function doesn't take a variable number of arguments,
7867 the last element in the list will have type `void'. */
7870 {
7874 }
7883 {
7886 }
7888 {
7891 }
7893 {
7896 }
7898 {
7901 }
7902 else
7904 }
7906 /* Variable-length argument list. */
7908 }
7910 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7911 evaluate to a constant. */
7913 static tree
7915 {
7916 /* We return 1 for a numeric type that's known to be a constant
7917 value at compile-time or for an aggregate type that's a
7918 literal constant. */
7921 /* If we know this is a constant, emit the constant of one. */
7927 {
7934 }
7936 /* If this expression has side effects, show we don't know it to be a
7937 constant. Likewise if it's a pointer or aggregate type since in
7938 those case we only want literals, since those are only optimized
7939 when generating RTL, not later.
7940 And finally, if we are compiling an initializer, not code, we
7941 need to return a definite result now; there's not going to be any
7942 more optimization done. */
7947 || folding_initializer
7952 }
7954 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7955 return it as a truthvalue. */
7957 static tree
7959 tree predictor)
7960 {
7972 predictor);
7976 }
7978 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7979 NULL_TREE if no simplification is possible. */
7981 tree
7983 {
7987 /* Distribute the expected value over short-circuiting operators.
7988 See through the cast from truthvalue_type_node to long. */
7995 /* If this is a builtin_expect within a builtin_expect keep the
7996 inner one. See through a comparison against a constant. It
7997 might have been added to create a thruthvalue. */
8013 {
8023 }
8025 /* If the argument isn't invariant then there's nothing else we can do. */
8029 /* If we expect that a comparison against the argument will fold to
8030 a constant return the constant. In practice, this means a true
8031 constant or the address of a non-weak symbol. */
8035 {
8036 do
8037 {
8039 }
8044 }
8046 /* Otherwise, ARG0 already has the proper type for the return value. */
8048 }
8050 /* Fold a call to __builtin_classify_type with argument ARG. */
8052 static tree
8054 {
8059 }
8061 /* Fold a call to __builtin_strlen with argument ARG. */
8063 static tree
8065 {
8068 else
8069 {
8076 }
8077 }
8079 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8081 static tree
8083 {
8084 REAL_VALUE_TYPE real;
8086 /* __builtin_inff is intended to be usable to define INFINITY on all
8087 targets. If an infinity is not available, INFINITY expands "to a
8088 positive constant of type float that overflows at translation
8089 time", footnote "In this case, using INFINITY will violate the
8090 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8091 Thus we pedwarn to ensure this constraint violation is
8092 diagnosed. */
8098 }
8100 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8101 NULL_TREE if no simplification can be made. */
8103 static tree
8106 {
8107 tree type;
8117 /* Calculate the result when the argument is a constant. */
8122 /* Canonicalize sincos to cexpi. */
8124 {
8127 }
8129 {
8136 }
8148 }
8150 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8151 Return NULL_TREE if no simplification can be made. */
8153 static tree
8155 {
8161 /* If the LEN parameter is zero, return zero. */
8166 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8170 /* If len parameter is one, return an expression corresponding to
8171 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8173 {
8175 tree cst_uchar_ptr_node
8178 tree ind1
8182 cst_uchar_ptr_node,
8183 arg1)));
8184 tree ind2
8188 cst_uchar_ptr_node,
8189 arg2)));
8191 }
8194 }
8196 /* Fold a call to builtin isascii with argument ARG. */
8198 static tree
8200 {
8203 else
8204 {
8205 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8211 }
8212 }
8214 /* Fold a call to builtin toascii with argument ARG. */
8216 static tree
8218 {
8222 /* Transform toascii(c) -> (c & 0x7f). */
8225 }
8227 /* Fold a call to builtin isdigit with argument ARG. */
8229 static tree
8231 {
8234 else
8235 {
8236 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8237 /* According to the C standard, isdigit is unaffected by locale.
8238 However, it definitely is affected by the target character set. */
8239 unsigned HOST_WIDE_INT target_digit0
8250 }
8251 }
8253 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8255 static tree
8257 {
8263 }
8265 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8267 static tree
8269 {
8275 }
8277 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8279 static tree
8281 {
8284 {
8288 {
8293 }
8294 }
8297 }
8299 /* Fold a call to builtin frexp, we can assume the base is 2. */
8301 static tree
8303 {
8314 /* Proceed if a valid pointer type was passed in. */
8316 {
8321 {
8323 /* For +-0, return (*exp = 0, +-0). */
8329 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8332 {
8333 /* Since the frexp function always expects base 2, and in
8334 GCC normalized significands are already in the range
8335 [0.5, 1.0), we have exactly what frexp wants. */
8340 }
8344 }
8346 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8350 }
8353 }
8355 /* Fold a call to builtin modf. */
8357 static tree
8359 {
8370 /* Proceed if a valid pointer type was passed in. */
8372 {
8377 {
8380 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8384 /* For +-Inf, return (*arg1 = arg0, +-0). */
8390 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8393 /* If the original number was negative and already
8394 integral, then the fractional part is -0.0. */
8398 }
8400 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8406 }
8409 }
8411 /* Given a location LOC, an interclass builtin function decl FNDECL
8412 and its single argument ARG, return an folded expression computing
8413 the same, or NULL_TREE if we either couldn't or didn't want to fold
8414 (the latter happen if there's an RTL instruction available). */
8416 static tree
8418 {
8419 machine_mode mode;
8431 /* If there is no optab, try generic code. */
8433 {
8434 tree result;
8437 {
8438 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8441 REAL_VALUE_TYPE r;
8445 {
8446 /* NaN and Inf are encoded in the high-order double value
8447 only. The low-order value is not significant. */
8451 }
8458 }
8461 {
8462 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8465 REAL_VALUE_TYPE r;
8469 {
8470 /* NaN and Inf are encoded in the high-order double value
8471 only. The low-order value is not significant. */
8475 }
8481 /*result = fold_build2_loc (loc, UNGT_EXPR,
8482 TREE_TYPE (TREE_TYPE (fndecl)),
8483 fold_build1_loc (loc, ABS_EXPR, type, arg),
8484 build_real (type, r));
8485 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8486 TREE_TYPE (TREE_TYPE (fndecl)),
8487 result);*/
8489 }
8491 {
8492 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8493 islessequal(fabs(x),DBL_MAX). */
8503 {
8504 /* Use double to test the normal range of IBM extended
8505 precision. Emin for IBM extended precision is
8506 different to emin for IEEE double, being 53 higher
8507 since the low double exponent is at least 53 lower
8508 than the high double exponent. */
8512 }
8524 {
8525 /* Testing the high end of the range is done just using
8526 the high double, using the same test as isfinite().
8527 For the subnormal end of the range we first test the
8528 high double, then if its magnitude is equal to the
8529 limit of 0x1p-969, we test whether the low double is
8530 non-zero and opposite sign to the high double. */
8546 integer_type_node,
8552 }
8553 else
8554 {
8555 tree const isge_fn
8558 }
8562 }
8565 }
8568 }
8570 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8571 ARG is the argument for the call. */
8573 static tree
8575 {
8582 {
8590 {
8591 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8592 /* In a boolean context, GCC will fold the inner COND_EXPR to
8593 1. So e.g. "if (isinf_sign(x))" would be folded to just
8594 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8602 {
8615 integer_zero_node);
8616 }
8619 }
8632 {
8635 {
8636 /* NaN and Inf are encoded in the high-order double value
8637 only. The low-order value is not significant. */
8639 }
8640 }
8646 }
8647 }
8649 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8650 This builtin will generate code to return the appropriate floating
8651 point classification depending on the value of the floating point
8652 number passed in. The possible return values must be supplied as
8653 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8654 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8655 one floating point argument which is "type generic". */
8657 static tree
8659 {
8662 machine_mode mode;
8663 REAL_VALUE_TYPE r;
8666 /* Verify the required arguments in the original call. */
8686 /* fpclassify(x) ->
8687 isnan(x) ? FP_NAN :
8688 (fabs(x) == Inf ? FP_INFINITE :
8689 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8690 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8704 {
8710 }
8713 {
8716 }
8719 }
8721 /* Fold a call to an unordered comparison function such as
8722 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8723 being called and ARG0 and ARG1 are the arguments for the call.
8724 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8725 the opposite of the desired result. UNORDERED_CODE is used
8726 for modes that can hold NaNs and ORDERED_CODE is used for
8727 the rest. */
8729 static tree
8733 {
8747 /* Choose the wider of two real types. */
8759 {
8763 }
8768 }
8770 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8771 arithmetics if it can never overflow, or into internal functions that
8772 return both result of arithmetics and overflowed boolean flag in
8773 a complex integer result, or some other check for overflow.
8774 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8775 checking part of that. */
8777 static tree
8780 {
8782 /* The code of the expression corresponding to the type-generic
8783 built-in, or ERROR_MARK for the type-specific ones. */
8788 {
8791 /* FALLTHRU */
8794 /* FALLTHRU */
8805 /* FALLTHRU */
8808 /* FALLTHRU */
8819 /* FALLTHRU */
8822 /* FALLTHRU */
8833 }
8835 /* For the "generic" overloads, the first two arguments can have different
8836 types and the last argument determines the target type to use to check
8837 for overflow. The arguments of the other overloads all have the same
8838 type. */
8841 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8842 arguments are constant, attempt to fold the built-in call into a constant
8843 expression indicating whether or not it detected an overflow. */
8847 /* Perform the computation in the target type and check for overflow. */
8851 arg2);
8865 tree store
8868 }
8870 /* Fold a call to __builtin_FILE to a constant string. */
8874 {
8876 {
8877 /* The documentation says this builtin is equivalent to the preprocessor
8878 __FILE__ macro so it appears appropriate to use the same file prefix
8879 mappings. */
8882 }
8885 }
8887 /* Fold a call to __builtin_FUNCTION to a constant string. */
8891 {
8898 }
8900 /* Fold a call to __builtin_LINE to an integer constant. */
8904 {
8906 }
8908 /* Fold a call to built-in function FNDECL with 0 arguments.
8909 This function returns NULL_TREE if no simplification was possible. */
8911 static tree
8913 {
8917 {
8943 }
8945 }
8947 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8948 This function returns NULL_TREE if no simplification was possible. */
8950 static tree
8952 {
8963 {
8965 {
8968 /* Gimplification will pull the CALL_EXPR for the builtin out of
8969 an if condition. When not optimizing, we'll not CSE it back.
8970 To avoid link error types of regressions, return false now. */
8975 }
9031 {
9036 }
9042 {
9047 }
9068 }
9072 }
9074 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9075 This function returns NULL_TREE if no simplification was possible. */
9077 static tree
9079 {
9091 {
9135 NOP_EXPR);
9137 /* We do the folding for va_start in the expander. */
9152 }
9154 }
9156 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9157 and ARG2.
9158 This function returns NULL_TREE if no simplification was possible. */
9160 static tree
9163 {
9177 {
9223 }
9225 }
9227 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9228 arguments. IGNORE is true if the result of the
9229 function call is ignored. This function returns NULL_TREE if no
9230 simplification was possible. */
9232 tree
9234 {
9238 {
9254 }
9256 {
9260 }
9262 }
9264 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9265 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9266 of arguments in ARGS to be omitted. OLDNARGS is the number of
9267 elements in ARGS. */
9269 static tree
9272 {
9277 {
9285 }
9286 else
9290 }
9292 /* Return true if FNDECL shouldn't be folded right now.
9293 If a built-in function has an inline attribute always_inline
9294 wrapper, defer folding it after always_inline functions have
9295 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9296 might not be performed. */
9298 bool
9300 {
9303 && cfun
9306 }
9308 /* A wrapper function for builtin folding that prevents warnings for
9309 "statement without effect" and the like, caused by removing the
9310 call node earlier than the warning is generated. */
9312 tree
9314 {
9320 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9321 yet. Defer folding until we see all the arguments
9322 (after inlining). */
9324 {
9327 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9328 instead last argument is __builtin_va_arg_pack (). Defer folding
9329 even in that case, until arguments are finalized. */
9331 {
9338 }
9346 else
9347 {
9352 }
9353 }
9355 }
9357 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9358 N arguments are passed in the array ARGARRAY. Return a folded
9359 expression or NULL_TREE if no simplification was possible. */
9361 tree
9363 tree fn,
9366 {
9373 {
9374 /* If last argument is __builtin_va_arg_pack (), arguments to this
9375 function are not finalized yet. Defer folding until they are. */
9377 {
9384 }
9389 else
9391 }
9394 }
9396 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9397 along with N new arguments specified as the "..." parameters. SKIP
9398 is the number of arguments in EXP to be omitted. This function is used
9399 to do varargs-to-varargs transformations. */
9401 static tree
9403 {
9405 tree t;
9413 }
9415 /* Validate a single argument ARG against a tree code CODE representing
9416 a type. Return true when argument is valid. */
9418 static bool
9420 {
9428 }
9430 /* This function validates the types of a function call argument list
9431 against a specified list of tree_codes. If the last specifier is a 0,
9432 that represents an ellipses, otherwise the last specifier must be a
9433 VOID_TYPE.
9435 This is the GIMPLE version of validate_arglist. Eventually we want to
9436 completely convert builtins.c to work from GIMPLEs and the tree based
9437 validate_arglist will then be removed. */
9439 bool
9441 {
9445 const_tree arg;
9451 do
9452 {
9455 {
9457 /* This signifies an ellipses, any further arguments are all ok. */
9461 /* This signifies an endlink, if no arguments remain, return
9462 true, otherwise return false. */
9466 /* If no parameters remain or the parameter's code does not
9467 match the specified code, return false. Otherwise continue
9468 checking any remaining arguments. */
9473 }
9474 }
9477 /* We need gotos here since we can only have one VA_CLOSE in a
9478 function. */
9479 end: ;
9483 }
9485 /* Default target-specific builtin expander that does nothing. */
9487 rtx
9489 rtx target ATTRIBUTE_UNUSED,
9490 rtx subtarget ATTRIBUTE_UNUSED,
9491 machine_mode mode ATTRIBUTE_UNUSED,
9493 {
9495 }
9497 /* Returns true is EXP represents data that would potentially reside
9498 in a readonly section. */
9500 bool
9502 {
9512 /* Make sure we call decl_readonly_section only for trees it
9513 can handle (since it returns true for everything it doesn't
9514 understand). */
9519 else
9521 }
9523 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9524 to the call, and TYPE is its return type.
9526 Return NULL_TREE if no simplification was possible, otherwise return the
9527 simplified form of the call as a tree.
9529 The simplified form may be a constant or other expression which
9530 computes the same value, but in a more efficient manner (including
9531 calls to other builtin functions).
9533 The call may contain arguments which need to be evaluated, but
9534 which are not useful to determine the result of the call. In
9535 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9536 COMPOUND_EXPR will be an argument which must be evaluated.
9537 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9538 COMPOUND_EXPR in the chain will contain the tree for the simplified
9539 form of the builtin function call. */
9541 static tree
9543 {
9547 else
9548 {
9549 tree fn;
9558 {
9560 tree tem;
9565 /* Return an offset into the constant string argument. */
9568 }
9571 /* strpbrk(x, "") == NULL.
9572 Evaluate and ignore s1 in case it had side-effects. */
9582 /* New argument list transforming strpbrk(s1, s2) to
9583 strchr(s1, s2[0]). */
9586 }
9587 }
9589 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9590 to the call.
9592 Return NULL_TREE if no simplification was possible, otherwise return the
9593 simplified form of the call as a tree.
9595 The simplified form may be a constant or other expression which
9596 computes the same value, but in a more efficient manner (including
9597 calls to other builtin functions).
9599 The call may contain arguments which need to be evaluated, but
9600 which are not useful to determine the result of the call. In
9601 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9602 COMPOUND_EXPR will be an argument which must be evaluated.
9603 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9604 COMPOUND_EXPR in the chain will contain the tree for the simplified
9605 form of the builtin function call. */
9607 static tree
9609 {
9613 else
9614 {
9617 /* If either argument is "", return NULL_TREE. */
9619 /* Evaluate and ignore both arguments in case either one has
9620 side-effects. */
9624 }
9625 }
9627 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9628 to the call.
9630 Return NULL_TREE if no simplification was possible, otherwise return the
9631 simplified form of the call as a tree.
9633 The simplified form may be a constant or other expression which
9634 computes the same value, but in a more efficient manner (including
9635 calls to other builtin functions).
9637 The call may contain arguments which need to be evaluated, but
9638 which are not useful to determine the result of the call. In
9639 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9640 COMPOUND_EXPR will be an argument which must be evaluated.
9641 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9642 COMPOUND_EXPR in the chain will contain the tree for the simplified
9643 form of the builtin function call. */
9645 static tree
9647 {
9651 else
9652 {
9653 /* If the first argument is "", return NULL_TREE. */
9656 {
9657 /* Evaluate and ignore argument s2 in case it has
9658 side-effects. */
9661 }
9663 /* If the second argument is "", return __builtin_strlen(s1). */
9666 {
9669 /* If the replacement _DECL isn't initialized, don't do the
9670 transformation. */
9675 }
9677 }
9678 }
9680 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9681 produced. False otherwise. This is done so that we don't output the error
9682 or warning twice or three times. */
9684 bool
9686 {
9689 tree arg;
9690 /* There is good chance the current input_location points inside the
9691 definition of the va_start macro (perhaps on the token for
9692 builtin) in a system header, so warnings will not be emitted.
9693 Use the location in real source code. */
9694 source_location current_location =
9696 NULL);
9699 {
9702 }
9705 {
9707 {
9710 }
9712 }
9713 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9714 when we checked the arguments and if needed issued a warning. */
9715 else
9716 {
9718 {
9719 /* Evidently an out of date version of <stdarg.h>; can't validate
9720 va_start's second argument, but can still work as intended. */
9722 OPT_Wvarargs,
9725 }
9727 {
9730 }
9732 }
9737 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9738 or __builtin_next_arg (0) the first time we see it, after checking
9739 the arguments and if needed issuing a warning. */
9741 {
9744 /* Strip off all nops for the sake of the comparison. This
9745 is not quite the same as STRIP_NOPS. It does more.
9746 We must also strip off INDIRECT_EXPR for C++ reference
9747 parameters. */
9752 {
9753 /* FIXME: Sometimes with the tree optimizers we can get the
9754 not the last argument even though the user used the last
9755 argument. We just warn and set the arg to be the last
9756 argument so that we will get wrong-code because of
9757 it. */
9759 OPT_Wvarargs,
9761 }
9763 /* Undefined by C99 7.15.1.4p4 (va_start):
9764 "If the parameter parmN is declared with the register storage
9765 class, with a function or array type, or with a type that is
9766 not compatible with the type that results after application of
9767 the default argument promotions, the behavior is undefined."
9768 */
9770 {
9772 OPT_Wvarargs,
9773 "undefined behavior when second parameter of "
9775 }
9777 /* We want to verify the second parameter just once before the tree
9778 optimizers are run and then avoid keeping it in the tree,
9779 as otherwise we could warn even for correct code like:
9780 void foo (int i, ...)
9781 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9784 else
9786 }
9788 }
9791 /* Expand a call EXP to __builtin_object_size. */
9793 static rtx
9795 {
9796 tree ost;
9801 {
9806 }
9814 {
9819 }
9824 }
9826 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9827 FCODE is the BUILT_IN_* to use.
9828 Return NULL_RTX if we failed; the caller should emit a normal call,
9829 otherwise try to get the result in TARGET, if convenient (and in
9830 mode MODE if that's convenient). */
9832 static rtx
9835 {
9837 POINTER_TYPE,
9838 fcode == BUILT_IN_MEMSET_CHK
9855 {
9856 /* Avoid transforming the checking call to an ordinary one when
9857 an overflow has been detected or when the call couldn't be
9858 validated because the size is not constant. */
9863 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9864 mem{cpy,pcpy,move,set} is available. */
9866 {
9881 }
9890 }
9893 else
9894 {
9897 /* If DEST is not a pointer type, call the normal function. */
9901 /* If SRC and DEST are the same (and not volatile), do nothing. */
9903 {
9904 tree expr;
9907 {
9908 /* Evaluate and ignore LEN in case it has side-effects. */
9911 }
9915 }
9917 /* __memmove_chk special case. */
9919 {
9925 /* If src is categorized for a readonly section we can use
9926 normal __memcpy_chk. */
9928 {
9937 }
9938 }
9940 }
9941 }
9943 /* Emit warning if a buffer overflow is detected at compile time. */
9945 static void
9947 {
9948 /* The source string. */
9950 /* The size of the destination object. */
9952 /* The string that is being concatenated with (as in __strcat_chk)
9953 or null if it isn't. */
9955 /* The maximum length of the source sequence in a bounded operation
9956 (such as __strncat_chk) or null if the operation isn't bounded
9957 (such as __strcat_chk). */
9959 /* The exact size of the access (such as in __strncpy_chk). */
9963 {
9971 /* For __strcat_chk the warning will be emitted only if overflowing
9972 by at least strlen (dest) + 1 bytes. */
9999 }
10002 {
10003 /* Check __strncat_chk. There is no way to determine the length
10004 of the string to which the source string is being appended so
10005 just warn when the length of the source string is not known. */
10008 }
10010 /* The destination argument is the first one for all built-ins above. */
10014 }
10016 /* Emit warning if a buffer overflow is detected at compile time
10017 in __sprintf_chk/__vsprintf_chk calls. */
10019 static void
10021 {
10026 /* Verify the required arguments in the original call. */
10036 /* Check whether the format is a literal string constant. */
10044 /* If the format doesn't contain % args or %%, we know its size. */
10047 /* If the format is "%s" and first ... argument is a string literal,
10048 we know it too. */
10051 {
10052 tree arg;
10063 }
10064 else
10067 /* Add one for the terminating nul. */
10072 }
10074 /* Emit warning if a free is called with address of a variable. */
10076 static void
10078 {
10092 else
10095 }
10097 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10098 if possible. */
10100 static tree
10102 {
10119 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10120 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10121 and (size_t) 0 for types 2 and 3. */
10126 {
10130 }
10132 {
10133 /* If object size is not known yet, delay folding until
10134 later. Maybe subsequent passes will help determining
10135 it. */
10139 }
10142 }
10144 /* Builtins with folding operations that operate on "..." arguments
10145 need special handling; we need to store the arguments in a convenient
10146 data structure before attempting any folding. Fortunately there are
10147 only a few builtins that fall into this category. FNDECL is the
10148 function, EXP is the CALL_EXPR for the call. */
10150 static tree
10152 {
10157 {
10164 }
10166 {
10171 }
10173 }
10175 /* Initialize format string characters in the target charset. */
10177 bool
10179 {
10182 {
10205 }
10207 }
10209 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10210 and no overflow/underflow occurred. INEXACT is true if M was not
10211 exactly calculated. TYPE is the tree type for the result. This
10212 function assumes that you cleared the MPFR flags and then
10213 calculated M to see if anything subsequently set a flag prior to
10214 entering this function. Return NULL_TREE if any checks fail. */
10216 static tree
10218 {
10219 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10220 overflow/underflow occurred. If -frounding-math, proceed iff the
10221 result of calling FUNC was exact. */
10224 {
10225 REAL_VALUE_TYPE rr;
10228 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10229 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10230 but the mpft_t is not, then we underflowed in the
10231 conversion. */
10234 {
10235 REAL_VALUE_TYPE rmode;
10238 /* Proceed iff the specified mode can hold the value. */
10241 }
10242 }
10244 }
10246 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10247 number and no overflow/underflow occurred. INEXACT is true if M
10248 was not exactly calculated. TYPE is the tree type for the result.
10249 This function assumes that you cleared the MPFR flags and then
10250 calculated M to see if anything subsequently set a flag prior to
10251 entering this function. Return NULL_TREE if any checks fail, if
10252 FORCE_CONVERT is true, then bypass the checks. */
10254 static tree
10256 {
10257 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10258 overflow/underflow occurred. If -frounding-math, proceed iff the
10259 result of calling FUNC was exact. */
10264 {
10269 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10270 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10271 but the mpft_t is not, then we underflowed in the
10272 conversion. */
10277 {
10282 /* Proceed iff the specified mode can hold the value. */
10288 }
10289 }
10291 }
10293 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10294 the pointer *(ARG_QUO) and return the result. The type is taken
10295 from the type of ARG0 and is used for setting the precision of the
10296 calculation and results. */
10298 static tree
10300 {
10307 /* To proceed, MPFR must exactly represent the target floating point
10308 format, which only happens when the target base equals two. */
10312 {
10317 {
10321 tree result_rem;
10330 /* Remquo is independent of the rounding mode, so pass
10331 inexact=0 to do_mpfr_ckconv(). */
10335 {
10336 /* MPFR calculates quo in the host's long so it may
10337 return more bits in quo than the target int can hold
10338 if sizeof(host long) > sizeof(target int). This can
10339 happen even for native compilers in LP64 mode. In
10340 these cases, modulo the quo value with the largest
10341 number that the target int can hold while leaving one
10342 bit for the sign. */
10346 /* Dereference the quo pointer argument. */
10348 /* Proceed iff a valid pointer type was passed in. */
10350 {
10351 /* Set the value. */
10352 tree result_quo
10355 integer_quo));
10357 /* Combine the quo assignment with the rem. */
10360 }
10361 }
10362 }
10363 }
10365 }
10367 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10368 resulting value as a tree with type TYPE. The mpfr precision is
10369 set to the precision of TYPE. We assume that this mpfr function
10370 returns zero if the result could be calculated exactly within the
10371 requested precision. In addition, the integer pointer represented
10372 by ARG_SG will be dereferenced and set to the appropriate signgam
10373 (-1,1) value. */
10375 static tree
10377 {
10382 /* To proceed, MPFR must exactly represent the target floating point
10383 format, which only happens when the target base equals two. Also
10384 verify ARG is a constant and that ARG_SG is an int pointer. */
10389 {
10392 /* In addition to NaN and Inf, the argument cannot be zero or a
10393 negative integer. */
10397 {
10402 mpfr_t m;
10403 tree result_lg;
10412 {
10413 tree result_sg;
10415 /* Dereference the arg_sg pointer argument. */
10417 /* Assign the signgam value into *arg_sg. */
10422 /* Combine the signgam assignment with the lgamma result. */
10425 }
10426 }
10427 }
10430 }
10432 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10433 mpc function FUNC on it and return the resulting value as a tree
10434 with type TYPE. The mpfr precision is set to the precision of
10435 TYPE. We assume that function FUNC returns zero if the result
10436 could be calculated exactly within the requested precision. If
10437 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10438 in the arguments and/or results. */
10440 tree
10443 {
10449 /* To proceed, MPFR must exactly represent the target floating point
10450 format, which only happens when the target base equals two. */
10456 {
10465 {
10485 }
10486 }
10489 }
10491 /* A wrapper function for builtin folding that prevents warnings for
10492 "statement without effect" and the like, caused by removing the
10493 call node earlier than the warning is generated. */
10495 tree
10497 {
10505 {
10514 {
10516 }
10517 else
10518 {
10521 {
10522 /* Propagate location information from original call to
10523 expansion of builtin. Otherwise things like
10524 maybe_emit_chk_warning, that operate on the expansion
10525 of a builtin, will use the wrong location information. */
10527 {
10535 }
10537 }
10538 }
10539 }
10541 }
10543 /* Look up the function in builtin_decl that corresponds to DECL
10544 and set ASMSPEC as its user assembler name. DECL must be a
10545 function decl that declares a builtin. */
10547 void
10549 {
10559 {
10563 }
10564 }
10566 /* Return true if DECL is a builtin that expands to a constant or similarly
10567 simple code. */
10568 bool
10570 {
10573 {
10574 /* Builtins that expand to constants. */
10579 /* Simple register moves or loads from stack. */
10590 /* Exception state returns or moves registers around. */
10598 }
10601 }
10603 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10604 most probably expanded inline into reasonably simple code. This is a
10605 superset of is_simple_builtin. */
10606 bool
10608 {
10615 {
10617 CASE_BUILT_IN_ALLOCA:
10683 }
10686 }
10688 /* Return true if T is a constant and the value cast to a target char
10689 can be represented by a host char.
10690 Store the casted char constant in *P if so. */
10692 bool
10694 {
10700 }
10702 /* Return the maximum object size. */
10704 tree
10706 {
10707 /* To do: Make this a configurable parameter. */
10709 }