| blob | 669e548706f537fa9a92c5f47f30fc3c6ee38176 |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2018 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* Legacy warning! Please add no further builtin simplifications here
21 (apart from pure constant folding) - builtin simplifications should go
22 to match.pd or gimple-fold.c instead. */
77 #if SWITCHABLE_TARGET
79 #endif
81 /* Define the names of the builtin function types and codes. */
85 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
87 {
89 };
91 /* Setup an array of builtin_info_type, make sure each element decl is
92 initialized to NULL_TREE. */
95 /* Non-zero if __builtin_constant_p should be folded right away. */
130 memop_ret retmode);
198 /* Return true if NAME starts with __builtin_ or __sync_. */
200 static bool
202 {
210 }
212 /* Return true if NODE should be considered for inline expansion regardless
213 of the optimization level. This means whenever a function is invoked with
214 its "internal" name, which normally contains the prefix "__builtin". */
216 bool
218 {
219 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
220 we want the name used to call the function, not the name it
221 will have. */
224 }
226 /* Compute values M and N such that M divides (address of EXP - N) and such
227 that N < M. If these numbers can be determined, store M in alignp and N in
228 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
229 *alignp and any bit-offset to *bitposp.
231 Note that the address (and thus the alignment) computed here is based
232 on the address to which a symbol resolves, whereas DECL_ALIGN is based
233 on the address at which an object is actually located. These two
234 addresses are not always the same. For example, on ARM targets,
235 the address &foo of a Thumb function foo() has the lowest bit set,
236 whereas foo() itself starts on an even address.
238 If ADDR_P is true we are taking the address of the memory reference EXP
239 and thus cannot rely on the access taking place. */
241 static bool
244 {
246 tree offset;
247 machine_mode mode;
252 /* Get the innermost object and the constant (bitpos) and possibly
253 variable (offset) offset of the access. */
257 /* Extract alignment information from the innermost object and
258 possibly adjust bitpos and offset. */
260 {
261 /* Function addresses can encode extra information besides their
262 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
263 allows the low bit to be used as a virtual bit, we know
264 that the address itself must be at least 2-byte aligned. */
267 }
269 ;
271 {
272 /* The alignment of a CONST_DECL is determined by its initializer. */
279 }
281 {
284 }
288 {
294 /* If the address is explicitely aligned, handle that. */
297 {
302 }
304 known_alignment
308 /* Re-apply explicit alignment to the bitpos. */
311 /* The alignment of the pointer operand in a TARGET_MEM_REF
312 has to take the variable offset parts into account. */
314 {
316 {
321 }
325 }
327 /* When EXP is an actual memory reference then we can use
328 TYPE_ALIGN of a pointer indirection to derive alignment.
329 Do so only if get_pointer_alignment_1 did not reveal absolute
330 alignment knowledge and if using that alignment would
331 improve the situation. */
337 else
338 {
339 /* Else adjust bitpos accordingly. */
344 }
345 }
347 {
348 /* STRING_CST are the only constant objects we allow to be not
349 wrapped inside a CONST_DECL. */
355 }
357 /* If there is a non-constant offset part extract the maximum
358 alignment that can prevail. */
360 {
363 {
367 }
368 }
370 /* Account for the alignment of runtime coefficients, so that the constant
371 bitpos is guaranteed to be accurate. */
374 {
377 }
382 }
384 /* For a memory reference expression EXP compute values M and N such that M
385 divides (&EXP - N) and such that N < M. If these numbers can be determined,
386 store M in alignp and N in *BITPOSP and return true. Otherwise return false
387 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
389 bool
392 {
394 }
396 /* Return the alignment in bits of EXP, an object. */
398 unsigned int
400 {
406 /* align and bitpos now specify known low bits of the pointer.
407 ptr & (align - 1) == bitpos. */
412 }
414 /* For a pointer valued expression EXP compute values M and N such that M
415 divides (EXP - N) and such that N < M. If these numbers can be determined,
416 store M in alignp and N in *BITPOSP and return true. Return false if
417 the results are just a conservative approximation.
419 If EXP is not a pointer, false is returned too. */
421 bool
424 {
431 {
438 else
439 {
442 {
446 }
447 }
451 }
454 {
459 {
462 /* Make sure to return a sensible alignment when the multiplication
463 by BITS_PER_UNIT overflowed. */
466 /* We cannot really tell whether this result is an approximation. */
468 }
469 else
470 {
474 }
475 }
477 {
482 }
487 }
489 /* Return the alignment in bits of EXP, a pointer valued expression.
490 The alignment returned is, by default, the alignment of the thing that
491 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
493 Otherwise, look at the expression to see if we can do better, i.e., if the
494 expression is actually pointing at an object whose alignment is tighter. */
496 unsigned int
498 {
504 /* align and bitpos now specify known low bits of the pointer.
505 ptr & (align - 1) == bitpos. */
511 }
513 /* Return the number of leading non-zero elements in the sequence
514 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
515 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
517 unsigned
519 {
525 {
526 /* Optimize the common case of plain char. */
528 {
532 }
533 }
534 else
535 {
537 {
541 }
542 }
544 }
546 /* For a call at LOC to a function FN that expects a string in the argument
547 ARG, issue a diagnostic due to it being a called with an argument
548 declared at NONSTR that is a character array with no terminating NUL. */
550 void
552 {
560 {
564 }
565 }
567 /* If EXP refers to an unterminated constant character array return
568 the declaration of the object of which the array is a member or
569 element and if SIZE is not null, set *SIZE to the size of
570 the unterminated array and set *EXACT if the size is exact or
571 clear it otherwise. Otherwise return null. */
573 tree
575 {
576 /* C_STRLEN will return NULL and set DECL in the info
577 structure if EXP references a unterminated array. */
578 c_strlen_data data;
582 {
584 {
587 {
588 /* Constant offsets are already accounted for in data.len, but
589 not in a SSA_NAME + CST expression. */
594 {
595 /* Subtract the offset from the size of the array. */
600 }
601 else
603 }
604 else
608 }
610 }
613 }
615 /* Compute the length of a null-terminated character string or wide
616 character string handling character sizes of 1, 2, and 4 bytes.
617 TREE_STRING_LENGTH is not the right way because it evaluates to
618 the size of the character array in bytes (as opposed to characters)
619 and because it can contain a zero byte in the middle.
621 ONLY_VALUE should be nonzero if the result is not going to be emitted
622 into the instruction stream and zero if it is going to be expanded.
623 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
624 is returned, otherwise NULL, since
625 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
626 evaluate the side-effects.
628 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
629 accesses. Note that this implies the result is not going to be emitted
630 into the instruction stream.
632 Additional information about the string accessed may be recorded
633 in DATA. For example, if SRC references an unterminated string,
634 then the declaration will be stored in the DECL field. If the
635 length of the unterminated string can be determined, it'll be
636 stored in the LEN field. Note this length could well be different
637 than what a C strlen call would return.
639 ELTSIZE is 1 for normal single byte character strings, and 2 or
640 4 for wide characer strings. ELTSIZE is by default 1.
642 The value returned is of type `ssizetype'. */
644 tree
646 {
647 /* If we were not passed a DATA pointer, then get one to a local
648 structure. That avoids having to check DATA for NULL before
649 each time we want to use it. */
650 c_strlen_data local_strlen_data;
659 {
666 }
674 /* Offset from the beginning of the string in bytes. */
675 tree byteoff;
676 tree memsize;
677 tree decl;
682 /* Determine the size of the string element. */
686 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
687 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
688 in case the latter is less than the size of the array, such as when
689 SRC refers to a short string literal used to initialize a large array.
690 In that case, the elements of the array after the terminating NUL are
691 all NUL. */
700 /* PTR can point to the byte representation of any string type, including
701 char* and wchar_t*. */
705 {
706 /* The code below works only for single byte character types. */
710 /* If the string has an internal NUL character followed by any
711 non-NUL characters (e.g., "foo\0bar"), we can't compute
712 the offset to the following NUL if we don't know where to
713 start searching for it. */
716 /* Return when an embedded null character is found or none at all.
717 In the latter case, set the DECL/LEN field in the DATA structure
718 so that callers may examine them. */
722 {
727 }
729 /* For empty strings the result should be zero. */
733 /* We don't know the starting offset, but we do know that the string
734 has no internal zero bytes. If the offset falls within the bounds
735 of the string subtract the offset from the length of the string,
736 and return that. Otherwise the length is zero. Take care to
737 use SAVE_EXPR in case the OFFSET has side-effects. */
744 offsave);
748 }
750 /* Offset from the beginning of the string in elements. */
751 HOST_WIDE_INT eltoff;
753 /* We have a known offset into the string. Start searching there for
754 a null character if we can represent it as a single HOST_WIDE_INT. */
759 else
762 /* If the offset is known to be out of bounds, warn, and call strlen at
763 runtime. */
765 {
766 /* Suppress multiple warnings for propagated constant strings. */
769 {
772 eltoff);
774 }
776 }
778 /* If eltoff is larger than strelts but less than maxelts the
779 string length is zero, since the excess memory will be zero. */
783 /* Use strlen to search for the first zero byte. Since any strings
784 constructed with build_string will have nulls appended, we win even
785 if we get handed something like (char[4])"abcd".
787 Since ELTOFF is our starting index into the string, no further
788 calculation is needed. */
792 /* Don't know what to return if there was no zero termination.
793 Ideally this would turn into a gcc_checking_assert over time.
794 Set DECL/LEN so callers can examine them. */
796 {
801 }
804 }
806 /* Return a constant integer corresponding to target reading
807 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
809 static rtx
811 {
812 HOST_WIDE_INT ch;
826 {
838 }
842 }
844 /* Cast a target constant CST to target CHAR and if that value fits into
845 host char type, return zero and put that value into variable pointed to by
846 P. */
848 static int
850 {
857 /* Do not care if it fits or not right here. */
872 }
874 /* Similar to save_expr, but assumes that arbitrary code is not executed
875 in between the multiple evaluations. In particular, we assume that a
876 non-addressable local variable will not be modified. */
878 static tree
880 {
888 }
890 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
891 times to get the address of either a higher stack frame, or a return
892 address located within it (depending on FNDECL_CODE). */
894 static rtx
896 {
900 {
901 /* For a zero count with __builtin_return_address, we don't care what
902 frame address we return, because target-specific definitions will
903 override us. Therefore frame pointer elimination is OK, and using
904 the soft frame pointer is OK.
906 For a nonzero count, or a zero count with __builtin_frame_address,
907 we require a stable offset from the current frame pointer to the
908 previous one, so we must use the hard frame pointer, and
909 we must disable frame pointer elimination. */
912 else
913 {
916 /* Tell reload not to eliminate the frame pointer. */
918 }
919 }
924 /* On the SPARC, the return address is not in the frame, it is in a
925 register. There is no way to access it off of the current frame
926 pointer, but it can be accessed off the previous frame pointer by
927 reading the value from the register window save area. */
929 count--;
931 /* Scan back COUNT frames to the specified frame. */
933 {
934 /* Assume the dynamic chain pointer is in the word that the
935 frame address points to, unless otherwise specified. */
940 }
942 /* For __builtin_frame_address, return what we've got. But, on
943 the SPARC for example, we may have to add a bias. */
947 /* For __builtin_return_address, get the return address from that frame. */
948 #ifdef RETURN_ADDR_RTX
950 #else
954 #endif
956 }
958 /* Alias set used for setjmp buffer. */
961 /* Construct the leading half of a __builtin_setjmp call. Control will
962 return to RECEIVER_LABEL. This is also called directly by the SJLJ
963 exception handling code. */
965 void
967 {
969 rtx stack_save;
970 rtx mem;
979 /* We store the frame pointer and the address of receiver_label in
980 the buffer and use the rest of it for the stack save area, which
981 is machine-dependent. */
1000 /* If there is further processing to do, do it. */
1004 /* We have a nonlocal label. */
1006 }
1008 /* Construct the trailing part of a __builtin_setjmp call. This is
1009 also called directly by the SJLJ exception handling code.
1010 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
1012 void
1014 {
1015 rtx chain;
1017 /* Mark the FP as used when we get here, so we have to make sure it's
1018 marked as used by this function. */
1021 /* Mark the static chain as clobbered here so life information
1022 doesn't get messed up for it. */
1027 /* Now put in the code to restore the frame pointer, and argument
1028 pointer, if needed. */
1030 {
1031 /* First adjust our frame pointer to its actual value. It was
1032 previously set to the start of the virtual area corresponding to
1033 the stacked variables when we branched here and now needs to be
1034 adjusted to the actual hardware fp value.
1036 Assignments to virtual registers are converted by
1037 instantiate_virtual_regs into the corresponding assignment
1038 to the underlying register (fp in this case) that makes
1039 the original assignment true.
1040 So the following insn will actually be decrementing fp by
1041 TARGET_STARTING_FRAME_OFFSET. */
1044 /* Restoring the frame pointer also modifies the hard frame pointer.
1045 Mark it used (so that the previous assignment remains live once
1046 the frame pointer is eliminated) and clobbered (to represent the
1047 implicit update from the assignment). */
1050 }
1053 {
1054 /* If the argument pointer can be eliminated in favor of the
1055 frame pointer, we don't need to restore it. We assume here
1056 that if such an elimination is present, it can always be used.
1057 This is the case on all known machines; if we don't make this
1058 assumption, we do unnecessary saving on many machines. */
1068 {
1069 /* Now restore our arg pointer from the address at which it
1070 was saved in our stack frame. */
1073 }
1074 }
1080 else
1083 /* We must not allow the code we just generated to be reordered by
1084 scheduling. Specifically, the update of the frame pointer must
1085 happen immediately, not later. */
1087 }
1089 /* __builtin_longjmp is passed a pointer to an array of five words (not
1090 all will be used on all machines). It operates similarly to the C
1091 library function of the same name, but is more efficient. Much of
1092 the code below is copied from the handling of non-local gotos. */
1094 static void
1096 {
1101 /* DRAP is needed for stack realign if longjmp is expanded to current
1102 function */
1113 /* We require that the user must pass a second argument of 1, because
1114 that is what builtin_setjmp will return. */
1120 else
1121 {
1132 /* Pick up FP, label, and SP from the block and jump. This code is
1133 from expand_goto in stmt.c; see there for detailed comments. */
1135 /* We have to pass a value to the nonlocal_goto pattern that will
1136 get copied into the static_chain pointer, but it does not matter
1137 what that value is, because builtin_setjmp does not use it. */
1139 else
1140 {
1146 /* Restore the frame pointer and stack pointer. We must use a
1147 temporary since the setjmp buffer may be a local. */
1155 }
1156 }
1158 /* Search backwards and mark the jump insn as a non-local goto.
1159 Note that this precludes the use of __builtin_longjmp to a
1160 __builtin_setjmp target in the same function. However, we've
1161 already cautioned the user that these functions are for
1162 internal exception handling use only. */
1164 {
1168 {
1171 }
1174 }
1175 }
1179 {
1181 }
1183 /* This function validates the types of a function call argument list
1184 against a specified list of tree_codes. If the last specifier is a 0,
1185 that represents an ellipsis, otherwise the last specifier must be a
1186 VOID_TYPE. */
1188 static bool
1190 {
1194 const_call_expr_arg_iterator iter;
1195 const_tree arg;
1200 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1205 {
1209 {
1211 /* This signifies an ellipses, any further arguments are all ok. */
1215 /* This signifies an endlink, if no arguments remain, return
1216 true, otherwise return false. */
1220 /* The actual argument must be nonnull when either the whole
1221 called function has been declared nonnull, or when the formal
1222 argument corresponding to the actual argument has been. */
1225 {
1230 }
1231 /* FALLTHRU */
1233 /* If no parameters remain or the parameter's code does not
1234 match the specified code, return false. Otherwise continue
1235 checking any remaining arguments. */
1240 }
1241 }
1243 /* We need gotos here since we can only have one VA_CLOSE in a
1244 function. */
1245 end: ;
1251 }
1253 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1254 and the address of the save area. */
1256 static rtx
1258 {
1273 /* Copy the address of the save location to a register just in case it was
1274 based on the frame pointer. */
1283 /* ??? We no longer need to pass the static chain value, afaik. */
1286 else
1287 {
1293 /* Restore the frame pointer and stack pointer. We must use a
1294 temporary since the setjmp buffer may be a local. */
1299 /* USE of hard_frame_pointer_rtx added for consistency;
1300 not clear if really needed. */
1304 /* If the architecture is using a GP register, we must
1305 conservatively assume that the target function makes use of it.
1306 The prologue of functions with nonlocal gotos must therefore
1307 initialize the GP register to the appropriate value, and we
1308 must then make sure that this value is live at the point
1309 of the jump. (Note that this doesn't necessarily apply
1310 to targets with a nonlocal_goto pattern; they are free
1311 to implement it in their own way. Note also that this is
1312 a no-op if the GP register is a global invariant.) */
1318 }
1320 /* Search backwards to the jump insn and mark it as a
1321 non-local goto. */
1323 {
1325 {
1328 }
1331 }
1334 }
1336 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1337 (not all will be used on all machines) that was passed to __builtin_setjmp.
1338 It updates the stack pointer in that block to the current value. This is
1339 also called directly by the SJLJ exception handling code. */
1341 void
1343 {
1346 rtx stack_save
1348 memory_address
1354 }
1356 /* Expand a call to __builtin_prefetch. For a target that does not support
1357 data prefetch, evaluate the memory address argument in case it has side
1358 effects. */
1360 static void
1362 {
1372 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1373 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1374 locality). */
1378 else
1382 else
1385 /* Argument 0 is an address. */
1388 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1390 {
1393 }
1395 /* Argument 1 must be either zero or one. */
1397 {
1401 }
1403 /* Argument 2 (locality) must be a compile-time constant int. */
1405 {
1408 }
1410 /* Argument 2 must be 0, 1, 2, or 3. */
1412 {
1415 }
1418 {
1426 }
1428 /* Don't do anything with direct references to volatile memory, but
1429 generate code to handle other side effects. */
1432 }
1434 /* Get a MEM rtx for expression EXP which is the address of an operand
1435 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1436 the maximum length of the block of memory that might be accessed or
1437 NULL if unknown. */
1439 static rtx
1441 {
1445 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1446 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1453 /* Get an expression we can use to find the attributes to assign to MEM.
1454 First remove any nops. */
1459 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1460 (as builtin stringops may alias with anything). */
1467 /* If the MEM_REF has no acceptable address, try to get the base object
1468 from the original address we got, and build an all-aliasing
1469 unknown-sized access to that one. */
1475 {
1480 size_zero_node,
1481 NULL)),
1484 }
1487 }
1488 \f
1489 /* Built-in functions to perform an untyped call and return. */
1491 #define apply_args_mode \
1492 (this_target_builtins->x_apply_args_mode)
1493 #define apply_result_mode \
1494 (this_target_builtins->x_apply_result_mode)
1496 /* Return the size required for the block returned by __builtin_apply_args,
1497 and initialize apply_args_mode. */
1499 static int
1501 {
1506 /* The values computed by this function never change. */
1508 {
1509 /* The first value is the incoming arg-pointer. */
1512 /* The second value is the structure value address unless this is
1513 passed as an "invisible" first argument. */
1519 {
1529 }
1530 else
1531 {
1533 }
1534 }
1536 }
1538 /* Return the size required for the block returned by __builtin_apply,
1539 and initialize apply_result_mode. */
1541 static int
1543 {
1547 /* The values computed by this function never change. */
1549 {
1554 {
1564 }
1565 else
1568 /* Allow targets that use untyped_call and untyped_return to override
1569 the size so that machine-specific information can be stored here. */
1570 #ifdef APPLY_RESULT_SIZE
1572 #endif
1573 }
1575 }
1577 /* Create a vector describing the result block RESULT. If SAVEP is true,
1578 the result block is used to save the values; otherwise it is used to
1579 restore the values. */
1581 static rtx
1583 {
1585 fixed_size_mode mode;
1592 {
1602 }
1604 }
1606 /* Save the state required to perform an untyped call with the same
1607 arguments as were passed to the current function. */
1609 static rtx
1611 {
1614 fixed_size_mode mode;
1615 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1617 /* Create a block where the arg-pointer, structure value address,
1618 and argument registers can be saved. */
1621 /* Walk past the arg-pointer and structure value address. */
1626 /* Save each register used in calling a function to the block. */
1629 {
1638 }
1640 /* Save the arg pointer to the block. */
1642 /* We need the pointer as the caller actually passed them to us, not
1643 as we might have pretended they were passed. Make sure it's a valid
1644 operand, as emit_move_insn isn't expected to handle a PLUS. */
1646 tem
1649 NULL_RTX);
1654 /* Save the structure value address unless this is passed as an
1655 "invisible" first argument. */
1657 {
1661 }
1663 /* Return the address of the block. */
1665 }
1667 /* __builtin_apply_args returns block of memory allocated on
1668 the stack into which is stored the arg pointer, structure
1669 value address, static chain, and all the registers that might
1670 possibly be used in performing a function call. The code is
1671 moved to the start of the function so the incoming values are
1672 saved. */
1674 static rtx
1676 {
1677 /* Don't do __builtin_apply_args more than once in a function.
1678 Save the result of the first call and reuse it. */
1681 {
1682 /* When this function is called, it means that registers must be
1683 saved on entry to this function. So we migrate the
1684 call to the first insn of this function. */
1685 rtx temp;
1694 /* Put the insns after the NOTE that starts the function.
1695 If this is inside a start_sequence, make the outer-level insn
1696 chain current, so the code is placed at the start of the
1697 function. If internal_arg_pointer is a non-virtual pseudo,
1698 it needs to be placed after the function that initializes
1699 that pseudo. */
1704 else
1708 }
1709 }
1711 /* Perform an untyped call and save the state required to perform an
1712 untyped return of whatever value was returned by the given function. */
1714 static rtx
1716 {
1718 fixed_size_mode mode;
1727 /* Create a block where the return registers can be saved. */
1730 /* Fetch the arg pointer from the ARGUMENTS block. */
1737 /* Push a new argument block and copy the arguments. Do not allow
1738 the (potential) memcpy call below to interfere with our stack
1739 manipulations. */
1741 NO_DEFER_POP;
1743 /* Save the stack with nonlocal if available. */
1746 else
1749 /* Allocate a block of memory onto the stack and copy the memory
1750 arguments to the outgoing arguments address. We can pass TRUE
1751 as the 4th argument because we just saved the stack pointer
1752 and will restore it right after the call. */
1755 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1756 may have already set current_function_calls_alloca to true.
1757 current_function_calls_alloca won't be set if argsize is zero,
1758 so we have to guarantee need_drap is true here. */
1764 {
1767 else
1769 }
1776 /* Refer to the argument block. */
1781 /* Walk past the arg-pointer and structure value address. */
1786 /* Restore each of the registers previously saved. Make USE insns
1787 for each of these registers for use in making the call. */
1790 {
1798 }
1800 /* Restore the structure value address unless this is passed as an
1801 "invisible" first argument. */
1804 {
1811 }
1813 /* All arguments and registers used for the call are set up by now! */
1816 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1817 and we don't want to load it into a register as an optimization,
1818 because prepare_call_address already did it if it should be done. */
1822 /* Generate the actual call instruction and save the return value. */
1824 {
1828 }
1830 {
1833 /* Locate the unique return register. It is not possible to
1834 express a call that sets more than one return register using
1835 call_value; use untyped_call for that. In fact, untyped_call
1836 only needs to save the return registers in the given block. */
1839 {
1843 }
1850 }
1851 else
1854 /* Find the CALL insn we just emitted, and attach the register usage
1855 information. */
1859 /* Restore the stack. */
1862 else
1866 OK_DEFER_POP;
1868 /* Return the address of the result block. */
1871 }
1873 /* Perform an untyped return. */
1875 static void
1877 {
1879 fixed_size_mode mode;
1880 rtx reg;
1889 {
1894 }
1896 /* Restore the return value and note that each value is used. */
1900 {
1912 }
1914 /* Put the USE insns before the return. */
1917 /* Return whatever values was restored by jumping directly to the end
1918 of the function. */
1920 }
1922 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1924 static enum type_class
1926 {
1928 {
1947 }
1948 }
1950 /* Expand a call EXP to __builtin_classify_type. */
1952 static rtx
1954 {
1958 }
1960 /* This helper macro, meant to be used in mathfn_built_in below, determines
1961 which among a set of builtin math functions is appropriate for a given type
1962 mode. The `F' (float) and `L' (long double) are automatically generated
1963 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1964 types, there are additional types that are considered with 'F32', 'F64',
1965 'F128', etc. suffixes. */
1966 #define CASE_MATHFN(MATHFN) \
1967 CASE_CFN_##MATHFN: \
1968 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1969 fcodel = BUILT_IN_##MATHFN##L ; break;
1970 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1971 types. */
1972 #define CASE_MATHFN_FLOATN(MATHFN) \
1973 CASE_CFN_##MATHFN: \
1974 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1975 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1976 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1977 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1978 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1979 break;
1980 /* Similar to above, but appends _R after any F/L suffix. */
1981 #define CASE_MATHFN_REENT(MATHFN) \
1982 case CFN_BUILT_IN_##MATHFN##_R: \
1983 case CFN_BUILT_IN_##MATHFN##F_R: \
1984 case CFN_BUILT_IN_##MATHFN##L_R: \
1985 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1986 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1988 /* Return a function equivalent to FN but operating on floating-point
1989 values of type TYPE, or END_BUILTINS if no such function exists.
1990 This is purely an operation on function codes; it does not guarantee
1991 that the target actually has an implementation of the function. */
1993 static built_in_function
1995 {
1996 tree mtype;
2007 {
2098 }
2121 else
2123 }
2125 /* Return mathematic function equivalent to FN but operating directly on TYPE,
2126 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2127 otherwise use the explicit declaration. If we can't do the conversion,
2128 return null. */
2130 static tree
2132 {
2141 }
2143 /* Like mathfn_built_in_1, but always use the implicit array. */
2145 tree
2147 {
2149 }
2151 /* Like mathfn_built_in_1, but take a built_in_function and
2152 always use the implicit array. */
2154 tree
2156 {
2158 }
2160 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2161 return its code, otherwise return IFN_LAST. Note that this function
2162 only tests whether the function is defined in internals.def, not whether
2163 it is actually available on the target. */
2165 internal_fn
2167 {
2171 {
2172 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2173 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2174 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2175 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2176 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2177 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2178 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2195 }
2196 }
2198 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2199 on the current target by a call to an internal function, return the
2200 code of that internal function, otherwise return IFN_LAST. The caller
2201 is responsible for ensuring that any side-effects of the built-in
2202 call are dealt with correctly. E.g. if CALL sets errno, the caller
2203 must decide that the errno result isn't needed or make it available
2204 in some other way. */
2206 internal_fn
2208 {
2210 {
2213 {
2218 }
2219 }
2221 }
2223 /* Expand a call to the builtin trinary math functions (fma).
2224 Return NULL_RTX if a normal call should be emitted rather than expanding the
2225 function in-line. EXP is the expression that is a call to the builtin
2226 function; if convenient, the result should be placed in TARGET.
2227 SUBTARGET may be used as the target for computing one of EXP's
2228 operands. */
2230 static rtx
2232 {
2233 optab builtin_optab;
2238 machine_mode mode;
2248 {
2254 }
2256 /* Make a suitable register to place result in. */
2259 /* Before working hard, check whether the instruction is available. */
2265 /* Always stabilize the argument list. */
2276 /* Compute into RESULT.
2277 Set RESULT to wherever the result comes back. */
2281 /* If we were unable to expand via the builtin, stop the sequence
2282 (without outputting the insns) and call to the library function
2283 with the stabilized argument list. */
2285 {
2288 }
2290 /* Output the entire sequence. */
2296 }
2298 /* Expand a call to the builtin sin and cos math functions.
2299 Return NULL_RTX if a normal call should be emitted rather than expanding the
2300 function in-line. EXP is the expression that is a call to the builtin
2301 function; if convenient, the result should be placed in TARGET.
2302 SUBTARGET may be used as the target for computing one of EXP's
2303 operands. */
2305 static rtx
2307 {
2308 optab builtin_optab;
2309 rtx op0;
2312 machine_mode mode;
2313 tree arg;
2321 {
2327 }
2329 /* Make a suitable register to place result in. */
2332 /* Check if sincos insn is available, otherwise fallback
2333 to sin or cos insn. */
2336 {
2343 }
2345 /* Before working hard, check whether the instruction is available. */
2347 {
2350 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2351 need to expand the argument again. This way, we will not perform
2352 side-effects more the once. */
2359 /* Compute into RESULT.
2360 Set RESULT to wherever the result comes back. */
2362 {
2366 {
2375 }
2377 }
2378 else
2382 {
2383 /* Output the entire sequence. */
2388 }
2390 /* If we were unable to expand via the builtin, stop the sequence
2391 (without outputting the insns) and call to the library function
2392 with the stabilized argument list. */
2394 }
2397 }
2399 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2400 return an RTL instruction code that implements the functionality.
2401 If that isn't possible or available return CODE_FOR_nothing. */
2403 static enum insn_code
2405 {
2408 machine_mode mode;
2411 {
2425 /* These builtins have no optabs (yet). */
2429 }
2431 /* There's no easy way to detect the case we need to set EDOM. */
2435 /* Optab mode depends on the mode of the input argument. */
2441 }
2443 /* Expand a call to one of the builtin math functions that operate on
2444 floating point argument and output an integer result (ilogb, isinf,
2445 isnan, etc).
2446 Return 0 if a normal call should be emitted rather than expanding the
2447 function in-line. EXP is the expression that is a call to the builtin
2448 function; if convenient, the result should be placed in TARGET. */
2450 static rtx
2452 {
2454 rtx op0;
2456 machine_mode mode;
2457 tree arg;
2467 {
2472 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2473 need to expand the argument again. This way, we will not perform
2474 side-effects more the once. */
2489 }
2492 }
2494 /* Expand a call to the builtin sincos math function.
2495 Return NULL_RTX if a normal call should be emitted rather than expanding the
2496 function in-line. EXP is the expression that is a call to the builtin
2497 function. */
2499 static rtx
2501 {
2503 machine_mode mode;
2517 /* Make a suitable register to place result in. */
2520 /* Check if sincos insn is available, otherwise emit the call. */
2535 /* Compute into target1 and target2.
2536 Set TARGET to wherever the result comes back. */
2540 /* Move target1 and target2 to the memory locations indicated
2541 by op1 and op2. */
2546 }
2548 /* Expand a call to the internal cexpi builtin to the sincos math function.
2549 EXP is the expression that is a call to the builtin function; if convenient,
2550 the result should be placed in TARGET. */
2552 static rtx
2554 {
2557 machine_mode mode;
2568 /* Try expanding via a sincos optab, fall back to emitting a libcall
2569 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2570 is only generated from sincos, cexp or if we have either of them. */
2572 {
2578 /* Compute into op1 and op2. */
2580 }
2582 {
2593 else
2603 /* Make sure not to fold the sincos call again. */
2607 }
2608 else
2609 {
2619 else
2622 /* If we don't have a decl for cexp create one. This is the
2623 friendliest fallback if the user calls __builtin_cexpi
2624 without full target C99 function support. */
2626 {
2627 tree fntype;
2639 }
2644 /* Make sure not to fold the cexp call again. */
2648 }
2650 /* Now build the proper return type. */
2655 }
2657 /* Conveniently construct a function call expression. FNDECL names the
2658 function to be called, N is the number of arguments, and the "..."
2659 parameters are the argument expressions. Unlike build_call_exr
2660 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2662 static tree
2664 {
2674 }
2676 /* Expand a call to one of the builtin rounding functions gcc defines
2677 as an extension (lfloor and lceil). As these are gcc extensions we
2678 do not need to worry about setting errno to EDOM.
2679 If expanding via optab fails, lower expression to (int)(floor(x)).
2680 EXP is the expression that is a call to the builtin function;
2681 if convenient, the result should be placed in TARGET. */
2683 static rtx
2685 {
2686 convert_optab builtin_optab;
2691 tree fallback_fndecl;
2692 machine_mode mode;
2693 tree arg;
2701 {
2718 }
2720 /* Make a suitable register to place result in. */
2725 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2726 need to expand the argument again. This way, we will not perform
2727 side-effects more the once. */
2734 /* Compute into TARGET. */
2736 {
2737 /* Output the entire sequence. */
2742 }
2744 /* If we were unable to expand via the builtin, stop the sequence
2745 (without outputting the insns). */
2748 /* Fall back to floating point rounding optab. */
2751 /* For non-C99 targets we may end up without a fallback fndecl here
2752 if the user called __builtin_lfloor directly. In this case emit
2753 a call to the floor/ceil variants nevertheless. This should result
2754 in the best user experience for not full C99 targets. */
2756 {
2757 tree fntype;
2761 {
2794 }
2799 }
2806 /* Truncate the result of floating point optab to integer
2807 via expand_fix (). */
2812 }
2814 /* Expand a call to one of the builtin math functions doing integer
2815 conversion (lrint).
2816 Return 0 if a normal call should be emitted rather than expanding the
2817 function in-line. EXP is the expression that is a call to the builtin
2818 function; if convenient, the result should be placed in TARGET. */
2820 static rtx
2822 {
2823 convert_optab builtin_optab;
2824 rtx op0;
2827 tree arg;
2828 machine_mode mode;
2837 {
2856 }
2858 /* There's no easy way to detect the case we need to set EDOM. */
2862 /* Make a suitable register to place result in. */
2865 /* There's no easy way to detect the case we need to set EDOM. */
2867 {
2870 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2871 need to expand the argument again. This way, we will not perform
2872 side-effects more the once. */
2880 {
2881 /* Output the entire sequence. */
2886 }
2888 /* If we were unable to expand via the builtin, stop the sequence
2889 (without outputting the insns) and call to the library function
2890 with the stabilized argument list. */
2892 }
2895 {
2896 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2897 targets, (int) round (x) should never be transformed into
2898 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2899 a call to lround in the hope that the target provides at least some
2900 C99 functions. This should result in the best user experience for
2901 not full C99 targets. */
2902 tree fallback_fndecl = mathfn_built_in_1
2911 }
2914 }
2916 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2917 a normal call should be emitted rather than expanding the function
2918 in-line. EXP is the expression that is a call to the builtin
2919 function; if convenient, the result should be placed in TARGET. */
2921 static rtx
2923 {
2926 machine_mode mode;
2927 machine_mode mode2;
2936 /* Emit a libcall to libgcc. */
2938 /* Mode of the 2nd argument must match that of an int. */
2956 }
2958 /* Expand expression EXP which is a call to the strlen builtin. Return
2959 NULL_RTX if we failed and the caller should emit a normal call, otherwise
2960 try to get the result in TARGET, if convenient. */
2962 static rtx
2964 machine_mode target_mode)
2965 {
2970 rtx pat;
2971 tree len;
2973 rtx src_reg;
2975 machine_mode insn_mode;
2979 /* If the length can be computed at compile-time, return it. */
2984 /* If the length can be computed at compile-time and is constant
2985 integer, but there are side-effects in src, evaluate
2986 src for side-effects, then return len.
2987 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2988 can be optimized into: i++; x = 3; */
2991 {
2994 }
2998 /* If SRC is not a pointer type, don't do this operation inline. */
3002 /* Bail out if we can't compute strlen in the right mode. */
3004 {
3008 }
3012 /* Make a place to hold the source address. We will not expand
3013 the actual source until we are sure that the expansion will
3014 not fail -- there are trees that cannot be expanded twice. */
3017 /* Mark the beginning of the strlen sequence so we can emit the
3018 source operand later. */
3028 /* Check to see if the argument was declared attribute nonstring
3029 and if so, issue a warning since at this point it's not known
3030 to be nul-terminated. */
3033 /* Now that we are assured of success, expand the source. */
3037 {
3038 #ifdef POINTERS_EXTEND_UNSIGNED
3041 POINTERS_EXTEND_UNSIGNED);
3042 #endif
3044 }
3050 else
3053 /* Return the value in the proper mode for this function. */
3058 else
3062 }
3064 /* Expand call EXP to the strnlen built-in, returning the result
3065 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
3067 static rtx
3069 {
3086 /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
3087 so these conversions aren't necessary. */
3088 c_strlen_data data;
3095 {
3099 "%K%qD specified bound %E "
3106 {
3107 /* Clear EXACT if LEN may be less than SRC suggests,
3108 such as in
3109 strnlen (&a[i], sizeof a)
3110 where the value of i is unknown. Unless i's value is
3111 zero, the call is unsafe because the bound is greater. */
3115 }
3121 {
3122 location_t warnloc
3126 exact
3132 {
3137 }
3138 }
3145 }
3158 "%K%qD specified bound [%wu, %wu] "
3165 {
3169 }
3175 {
3176 location_t warnloc
3180 exact
3186 {
3190 }
3191 }
3201 }
3203 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3204 bytes from constant string DATA + OFFSET and return it as target
3205 constant. */
3207 static rtx
3209 scalar_int_mode mode)
3210 {
3218 }
3220 /* LEN specify length of the block of memcpy/memset operation.
3221 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3222 In some cases we can make very likely guess on max size, then we
3223 set it into PROBABLE_MAX_SIZE. */
3225 static void
3230 {
3232 {
3235 }
3236 else
3237 {
3241 /* Determine bounds from the type. */
3244 else
3249 else
3255 {
3260 }
3262 {
3263 /* Anti range 0...N lets us to determine minimal size to N+1. */
3265 {
3268 }
3269 /* Code like
3271 int n;
3272 if (n < 100)
3273 memcpy (a, b, n)
3275 Produce anti range allowing negative values of N. We still
3276 can use the information and make a guess that N is not negative.
3277 */
3280 }
3281 }
3285 }
3287 /* Try to verify that the sizes and lengths of the arguments to a string
3288 manipulation function given by EXP are within valid bounds and that
3289 the operation does not lead to buffer overflow or read past the end.
3290 Arguments other than EXP may be null. When non-null, the arguments
3291 have the following meaning:
3292 DST is the destination of a copy call or NULL otherwise.
3293 SRC is the source of a copy call or NULL otherwise.
3294 DSTWRITE is the number of bytes written into the destination obtained
3295 from the user-supplied size argument to the function (such as in
3296 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3297 MAXREAD is the user-supplied bound on the length of the source sequence
3298 (such as in strncat(d, s, N). It specifies the upper limit on the number
3299 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3300 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3301 expression EXP is a string function call (as opposed to a memory call
3302 like memcpy). As an exception, SRCSTR can also be an integer denoting
3303 the precomputed size of the source string or object (for functions like
3304 memcpy).
3305 DSTSIZE is the size of the destination object specified by the last
3306 argument to the _chk builtins, typically resulting from the expansion
3307 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3308 DSTSIZE).
3310 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3311 SIZE_MAX.
3313 If the call is successfully verified as safe return true, otherwise
3314 return false. */
3316 static bool
3319 {
3322 /* The size of the largest object is half the address space, or
3323 PTRDIFF_MAX. (This is way too permissive.) */
3326 /* Either the length of the source string for string functions or
3327 the size of the source object for raw memory functions. */
3332 /* Set to true when the exact number of bytes written by a string
3333 function like strcpy is not known and the only thing that is
3334 known is that it must be at least one (for the terminating nul). */
3337 {
3338 /* SRCSTR is normally a pointer to string but as a special case
3339 it can be an integer denoting the length of a string. */
3341 {
3342 /* Try to determine the range of lengths the source string
3343 refers to. If it can be determined and is less than
3344 the upper bound given by MAXREAD add one to it for
3345 the terminating nul. Otherwise, set it to one for
3346 the same reason, or to MAXREAD as appropriate. */
3349 {
3352 else
3363 }
3364 else
3365 {
3368 }
3369 }
3370 else
3372 }
3375 {
3376 /* When the only available piece of data is the object size
3377 there is nothing to do. */
3381 /* Otherwise, when the length of the source sequence is known
3382 (as with strlen), set DSTWRITE to it. */
3385 }
3395 /* First check the number of bytes to be written against the maximum
3396 object size. */
3400 {
3410 "%K%qD specified size %E "
3413 else
3415 "%K%qD specified size between %E and %E "
3423 }
3425 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3426 constant, and in range of unsigned HOST_WIDE_INT. */
3429 /* Next check the number of bytes to be written against the destination
3430 object size. */
3432 {
3437 || (dstwrite
3440 {
3448 {
3449 /* This is a call to strcpy with a destination of 0 size
3450 and a source of unknown length. The call will write
3451 at least one byte past the end of the destination. */
3453 "%K%qD writing %E or more bytes into a region "
3456 }
3459 "%K%qD writing %E byte into a region "
3461 "%K%qD writing %E bytes into a region "
3465 {
3466 /* Avoid printing the upper bound if it's invalid. */
3468 "%K%qD writing %E or more bytes into a region "
3471 }
3472 else
3474 "%K%qD writing between %E and %E bytes into "
3477 dstsize);
3479 /* Return error when an overflow has been detected. */
3481 }
3482 }
3484 /* Check the maximum length of the source sequence against the size
3485 of the destination object if known, or against the maximum size
3486 of an object. */
3488 {
3491 /* Use the lower end for MAXREAD from now on. */
3496 {
3501 {
3505 /* Warn about crazy big sizes first since that's more
3506 likely to be meaningful than saying that the bound
3507 is greater than the object size if both are big. */
3510 "%K%qD specified bound %E "
3514 else
3516 "%K%qD specified bound between %E and %E "
3522 }
3525 {
3531 "%K%qD specified bound %E "
3535 else
3537 "%K%qD specified bound between %E and %E "
3542 }
3543 }
3544 }
3546 /* Check for reading past the end of SRC. */
3551 {
3563 {
3564 /* Avoid printing the upper bound if it's invalid. */
3566 "%K%qD reading %E or more bytes from a region "
3569 }
3570 else
3572 "%K%qD reading between %E and %E bytes from a region "
3576 }
3579 }
3581 /* Helper to compute the size of the object referenced by the DEST
3582 expression which must have pointer type, using Object Size type
3583 OSTYPE (only the least significant 2 bits are used). Return
3584 an estimate of the size of the object if successful or NULL when
3585 the size cannot be determined. When the referenced object involves
3586 a non-constant offset in some range the returned value represents
3587 the largest size given the smallest non-negative offset in the
3588 range. The function is intended for diagnostics and should not
3589 be used to influence code generation or optimization. */
3591 tree
3593 {
3596 /* Only the two least significant bits are meaningful. */
3603 {
3612 {
3613 /* compute_builtin_object_size fails for addresses with
3614 non-constant offsets. Try to determine the range of
3615 such an offset here and use it to adjust the constant
3616 size. */
3619 {
3621 {
3625 /* Ignore negative offsets for now. For others,
3626 use the lower bound as the most optimistic
3627 estimate of the (remaining) size. */
3629 ;
3633 else
3635 }
3636 }
3639 {
3644 {
3646 {
3649 /* Ignore negative offsets for now. For others,
3650 use the lower bound as the most optimistic
3651 estimate of the (remaining)size. */
3653 ;
3657 else
3659 }
3660 }
3661 }
3662 }
3665 }
3667 /* Unless computing the largest size (for memcpy and other raw memory
3668 functions), try to determine the size of the object from its type. */
3683 {
3684 /* Return the constant size unless it's zero (that's a zero-length
3685 array likely at the end of a struct). */
3690 }
3693 }
3695 /* Helper to determine and check the sizes of the source and the destination
3696 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3697 call expression, DEST is the destination argument, SRC is the source
3698 argument or null, and LEN is the number of bytes. Use Object Size type-0
3699 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3700 (no overflow or invalid sizes), false otherwise. */
3702 static bool
3704 {
3705 /* For functions like memset and memcpy that operate on raw memory
3706 try to determine the size of the largest source and destination
3707 object using type-0 Object Size regardless of the object size
3708 type specified by the option. */
3714 }
3716 /* Validate memchr arguments without performing any expansion.
3717 Return NULL_RTX. */
3719 static rtx
3721 {
3729 /* Diagnose calls where the specified length exceeds the size
3730 of the object. */
3732 {
3736 }
3739 }
3741 /* Expand a call EXP to the memcpy builtin.
3742 Return NULL_RTX if we failed, the caller should emit a normal call,
3743 otherwise try to get the result in TARGET, if convenient (and in
3744 mode MODE if that's convenient). */
3746 static rtx
3748 {
3761 }
3763 /* Check a call EXP to the memmove built-in for validity.
3764 Return NULL_RTX on both success and failure. */
3766 static rtx
3768 {
3780 }
3782 /* Expand a call EXP to the mempcpy builtin.
3783 Return NULL_RTX if we failed; the caller should emit a normal call,
3784 otherwise try to get the result in TARGET, if convenient (and in
3785 mode MODE if that's convenient). */
3787 static rtx
3789 {
3798 /* Policy does not generally allow using compute_objsize (which
3799 is used internally by check_memop_size) to change code generation
3800 or drive optimization decisions.
3802 In this instance it is safe because the code we generate has
3803 the same semantics regardless of the return value of
3804 check_memop_sizes. Exactly the same amount of data is copied
3805 and the return value is exactly the same in both cases.
3807 Furthermore, check_memop_size always uses mode 0 for the call to
3808 compute_objsize, so the imprecise nature of compute_objsize is
3809 avoided. */
3811 /* Avoid expanding mempcpy into memcpy when the call is determined
3812 to overflow the buffer. This also prevents the same overflow
3813 from being diagnosed again when expanding memcpy. */
3819 }
3821 /* Helper function to do the actual work for expand of memory copy family
3822 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3823 of memory from SRC to DEST and assign to TARGET if convenient. Return
3824 value is based on RETMODE argument. */
3826 static rtx
3829 {
3840 /* If DEST is not a pointer type, call the normal function. */
3844 /* If either SRC is not a pointer type, don't do this
3845 operation in-line. */
3862 /* If SRC is a string constant and block move would be done
3863 by pieces, we can avoid loading the string from memory
3864 and only stored the computed constants. */
3871 {
3873 builtin_memcpy_read_str,
3879 }
3884 /* Copy word part most expediently. */
3898 {
3901 }
3904 {
3906 /* stpcpy pointer to last byte. */
3909 }
3912 }
3914 static rtx
3917 {
3919 retmode);
3920 }
3922 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3923 we failed, the caller should emit a normal call, otherwise try to
3924 get the result in TARGET, if convenient.
3925 Return value is based on RETMODE argument. */
3927 static rtx
3929 {
3931 rtx dest_mem;
3932 rtx src_mem;
3940 {
3943 }
3952 {
3954 /* movstr is supposed to set end to the address of the NUL
3955 terminator. If the caller requested a mempcpy-like return value,
3956 adjust it. */
3958 {
3962 }
3963 }
3965 }
3967 /* Do some very basic size validation of a call to the strcpy builtin
3968 given by EXP. Return NULL_RTX to have the built-in expand to a call
3969 to the library function. */
3971 static rtx
3973 {
3981 /* There is no way here to determine the length of the string in
3982 the destination to which the SRC string is being appended so
3983 just diagnose cases when the souce string is longer than
3984 the destination object. */
3989 destsize);
3992 }
3994 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3995 NULL_RTX if we failed the caller should emit a normal call, otherwise
3996 try to get the result in TARGET, if convenient (and in mode MODE if that's
3997 convenient). */
3999 static rtx
4001 {
4009 {
4013 }
4016 {
4017 /* Check to see if the argument was declared attribute nonstring
4018 and if so, issue a warning since at this point it's not known
4019 to be nul-terminated. */
4023 }
4026 }
4028 /* Helper function to do the actual work for expand_builtin_strcpy. The
4029 arguments to the builtin_strcpy call DEST and SRC are broken out
4030 so that this can also be called without constructing an actual CALL_EXPR.
4031 The other arguments and return value are the same as for
4032 expand_builtin_strcpy. */
4034 static rtx
4036 {
4037 /* Detect strcpy calls with unterminated arrays.. */
4039 {
4040 /* NONSTR refers to the non-nul terminated constant array. */
4044 }
4047 }
4049 /* Expand a call EXP to the stpcpy builtin.
4050 Return NULL_RTX if we failed the caller should emit a normal call,
4051 otherwise try to get the result in TARGET, if convenient (and in
4052 mode MODE if that's convenient). */
4054 static rtx
4056 {
4067 {
4071 }
4073 /* If return value is ignored, transform stpcpy into strcpy. */
4075 {
4079 }
4080 else
4081 {
4083 rtx ret;
4085 /* Ensure we get an actual string whose length can be evaluated at
4086 compile-time, not an expression containing a string. This is
4087 because the latter will potentially produce pessimized code
4088 when used to produce the return value. */
4089 c_strlen_data data;
4108 {
4112 {
4116 {
4118 {
4121 else
4123 }
4132 }
4133 }
4134 }
4138 }
4139 }
4141 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
4142 arguments while being careful to avoid duplicate warnings (which could
4143 be issued if the expander were to expand the call, resulting in it
4144 being emitted in expand_call(). */
4146 static rtx
4148 {
4150 {
4151 /* The call has been successfully expanded. Check for nonstring
4152 arguments and issue warnings as appropriate. */
4155 }
4158 }
4160 /* Check a call EXP to the stpncpy built-in for validity.
4161 Return NULL_RTX on both success and failure. */
4163 static rtx
4165 {
4171 /* The source and destination of the call. */
4175 /* The exact number of bytes to write (not the maximum). */
4178 /* The size of the destination object. */
4184 }
4186 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4187 bytes from constant string DATA + OFFSET and return it as target
4188 constant. */
4190 rtx
4192 scalar_int_mode mode)
4193 {
4200 }
4202 /* Helper to check the sizes of sequences and the destination of calls
4203 to __builtin_strncat and __builtin___strncat_chk. Returns true on
4204 success (no overflow or invalid sizes), false otherwise. */
4206 static bool
4208 {
4213 /* Try to determine the range of lengths that the source expression
4214 refers to. */
4218 /* Try to verify that the destination is big enough for the shortest
4219 string. */
4222 {
4223 /* If it hasn't been provided by __strncat_chk, try to determine
4224 the size of the destination object into which the source is
4225 being copied. */
4227 }
4229 /* Add one for the terminating nul. */
4232 size_one_node)
4235 /* The strncat function copies at most MAXREAD bytes and always appends
4236 the terminating nul so the specified upper bound should never be equal
4237 to (or greater than) the size of the destination. */
4240 {
4249 }
4257 /* The number of bytes to write is LEN but check_access will also
4258 check SRCLEN if LEN's value isn't known. */
4260 objsize);
4261 }
4263 /* Similar to expand_builtin_strcat, do some very basic size validation
4264 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4265 the built-in expand to a call to the library function. */
4267 static rtx
4269 {
4277 /* The upper bound on the number of bytes to write. */
4279 /* The length of the source sequence. */
4282 /* Try to determine the range of lengths that the source expression
4283 refers to. */
4287 else
4290 /* Try to verify that the destination is big enough for the shortest
4291 string. First try to determine the size of the destination object
4292 into which the source is being copied. */
4295 /* Add one for the terminating nul. */
4298 size_one_node)
4301 /* The strncat function copies at most MAXREAD bytes and always appends
4302 the terminating nul so the specified upper bound should never be equal
4303 to (or greater than) the size of the destination. */
4306 {
4315 }
4323 /* The number of bytes to write is SRCLEN. */
4327 }
4329 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4330 NULL_RTX if we failed the caller should emit a normal call. */
4332 static rtx
4334 {
4339 {
4342 /* The number of bytes to write (not the maximum). */
4344 /* The length of the source sequence. */
4348 {
4352 /* The number of bytes to write is LEN but check_access will also
4353 check SLEN if LEN's value isn't known. */
4355 destsize);
4356 }
4358 /* We must be passed a constant len and src parameter. */
4364 /* We're required to pad with trailing zeros if the requested
4365 len is greater than strlen(s2)+1. In that case try to
4366 use store_by_pieces, if it fails, punt. */
4368 {
4371 rtx dest_mem;
4375 builtin_strncpy_read_str,
4382 builtin_strncpy_read_str,
4384 RETURN_BEGIN);
4388 }
4389 }
4391 }
4393 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4394 bytes from constant string DATA + OFFSET and return it as target
4395 constant. */
4397 rtx
4399 scalar_int_mode mode)
4400 {
4407 }
4409 /* Callback routine for store_by_pieces. Return the RTL of a register
4410 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4411 char value given in the RTL register data. For example, if mode is
4412 4 bytes wide, return the RTL for 0x01010101*data. */
4414 static rtx
4416 scalar_int_mode mode)
4417 {
4433 }
4435 /* Expand expression EXP, which is a call to the memset builtin. Return
4436 NULL_RTX if we failed the caller should emit a normal call, otherwise
4437 try to get the result in TARGET, if convenient (and in mode MODE if that's
4438 convenient). */
4440 static rtx
4442 {
4454 }
4456 /* Helper function to do the actual work for expand_builtin_memset. The
4457 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4458 so that this can also be called without constructing an actual CALL_EXPR.
4459 The other arguments and return value are the same as for
4460 expand_builtin_memset. */
4462 static rtx
4465 {
4468 machine_mode val_mode;
4480 /* If DEST is not a pointer type, don't do this operation in-line. */
4491 /* If the LEN parameter is zero, return DEST. */
4493 {
4494 /* Evaluate and ignore VAL in case it has side-effects. */
4497 }
4499 /* Stabilize the arguments in case we fail. */
4511 {
4512 rtx val_rtx;
4517 /* Assume that we can memset by pieces if we can store
4518 * the coefficients by pieces (in the required modes).
4519 * We can't pass builtin_memset_gen_str as that emits RTL. */
4525 {
4530 }
4534 probable_max_size))
4540 }
4546 {
4553 RETURN_BEGIN);
4558 probable_max_size))
4564 }
4572 probable_max_size);
4575 {
4578 }
4582 do_libcall:
4591 else
4596 }
4598 /* Expand expression EXP, which is a call to the bzero builtin. Return
4599 NULL_RTX if we failed the caller should emit a normal call. */
4601 static rtx
4603 {
4612 /* New argument list transforming bzero(ptr x, int y) to
4613 memset(ptr x, int 0, size_t y). This is done this way
4614 so that if it isn't expanded inline, we fallback to
4615 calling bzero instead of memset. */
4623 }
4625 /* Try to expand cmpstr operation ICODE with the given operands.
4626 Return the result rtx on success, otherwise return null. */
4628 static rtx
4630 HOST_WIDE_INT align)
4631 {
4645 }
4647 /* Expand expression EXP, which is a call to the memcmp built-in function.
4648 Return NULL_RTX if we failed and the caller should emit a normal call,
4649 otherwise try to get the result in TARGET, if convenient.
4650 RESULT_EQ is true if we can relax the returned value to be either zero
4651 or nonzero, without caring about the sign. */
4653 static rtx
4655 {
4666 /* Diagnose calls where the specified length exceeds the size of either
4667 object. */
4673 {
4678 }
4680 /* If the specified length exceeds the size of either object,
4681 call the function. */
4685 /* Due to the performance benefit, always inline the calls first
4686 when result_eq is false. */
4690 {
4694 }
4702 /* If we don't have POINTER_TYPE, call the function. */
4710 /* Set MEM_SIZE as appropriate. */
4712 {
4715 }
4721 {
4725 }
4727 /* If SRC is a string constant and block move would be done
4728 by pieces, we can avoid loading the string from memory
4729 and only stored the computed constants. */
4741 {
4742 /* Return the value in the proper mode for this function. */
4747 {
4750 }
4753 }
4756 }
4758 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4759 if we failed the caller should emit a normal call, otherwise try to get
4760 the result in TARGET, if convenient. */
4762 static rtx
4764 {
4768 /* Due to the performance benefit, always inline the calls first. */
4785 /* If we don't have POINTER_TYPE, call the function. */
4789 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4796 /* Try to call cmpstrsi. */
4801 /* Try to determine at least one length and call cmpstrnsi. */
4803 {
4804 tree len;
4805 rtx arg3_rtx;
4815 /* If we don't have a constant length for the first, use the length
4816 of the second, if we know it. We don't require a constant for
4817 this case; some cost analysis could be done if both are available
4818 but neither is constant. For now, assume they're equally cheap,
4819 unless one has side effects. If both strings have constant lengths,
4820 use the smaller. */
4836 else
4839 /* If both arguments have side effects, we cannot optimize. */
4841 {
4843 result = expand_cmpstrn_or_cmpmem
4846 }
4847 }
4851 {
4852 /* Check to see if the argument was declared attribute nonstring
4853 and if so, issue a warning since at this point it's not known
4854 to be nul-terminated. */
4857 /* Return the value in the proper mode for this function. */
4865 }
4867 /* Expand the library call ourselves using a stabilized argument
4868 list to avoid re-evaluating the function's arguments twice. */
4873 }
4875 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4876 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4877 the result in TARGET, if convenient. */
4879 static rtx
4881 ATTRIBUTE_UNUSED machine_mode mode)
4882 {
4887 /* Due to the performance benefit, always inline the calls first. */
4893 /* If c_strlen can determine an expression for one of the string
4894 lengths, and it doesn't have side effects, then emit cmpstrnsi
4895 using length MIN(strlen(string)+1, arg3). */
4900 tree len;
4921 /* If we don't have a constant length for the first, use the length
4922 of the second, if we know it. If neither string is constant length,
4923 use the given length argument. We don't require a constant for
4924 this case; some cost analysis could be done if both are available
4925 but neither is constant. For now, assume they're equally cheap,
4926 unless one has side effects. If both strings have constant lengths,
4927 use the smaller. */
4945 else
4948 /* If we are not using the given length, we must incorporate it here.
4949 The actual new length parameter will be MIN(len,arg3) in this case. */
4951 {
4954 }
4964 {
4965 /* Check to see if the argument was declared attribute nonstring
4966 and if so, issue a warning since at this point it's not known
4967 to be nul-terminated. */
4970 /* Return the value in the proper mode for this function. */
4978 }
4980 /* Expand the library call ourselves using a stabilized argument
4981 list to avoid re-evaluating the function's arguments twice. */
4986 }
4988 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4989 if that's convenient. */
4991 rtx
4993 {
4994 rtx val;
4997 /* Don't do __builtin_saveregs more than once in a function.
4998 Save the result of the first call and reuse it. */
5002 /* When this function is called, it means that registers must be
5003 saved on entry to this function. So we migrate the call to the
5004 first insn of this function. */
5008 /* Do whatever the machine needs done in this case. */
5016 /* Put the insns after the NOTE that starts the function. If this
5017 is inside a start_sequence, make the outer-level insn chain current, so
5018 the code is placed at the start of the function. */
5024 }
5026 /* Expand a call to __builtin_next_arg. */
5028 static rtx
5030 {
5031 /* Checking arguments is already done in fold_builtin_next_arg
5032 that must be called before this function. */
5037 }
5039 /* Make it easier for the backends by protecting the valist argument
5040 from multiple evaluations. */
5042 static tree
5044 {
5047 /* The current way of determining the type of valist is completely
5048 bogus. We should have the information on the va builtin instead. */
5053 {
5057 /* For this case, the backends will be expecting a pointer to
5058 vatype, but it's possible we've actually been given an array
5059 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
5060 So fix it. */
5062 {
5065 }
5066 }
5067 else
5068 {
5072 {
5078 }
5084 }
5087 }
5089 /* The "standard" definition of va_list is void*. */
5091 tree
5093 {
5095 }
5097 /* The "standard" abi va_list is va_list_type_node. */
5099 tree
5101 {
5103 }
5105 /* The "standard" type of va_list is va_list_type_node. */
5107 tree
5109 {
5116 {
5117 /* If va_list is an array type, the argument may have decayed
5118 to a pointer type, e.g. by being passed to another function.
5119 In that case, unwrap both types so that we can compare the
5120 underlying records. */
5123 {
5126 }
5127 }
5132 }
5134 /* The "standard" implementation of va_start: just assign `nextarg' to
5135 the variable. */
5137 void
5139 {
5142 }
5144 /* Expand EXP, a call to __builtin_va_start. */
5146 static rtx
5148 {
5149 rtx nextarg;
5150 tree valist;
5154 {
5157 }
5167 else
5171 }
5173 /* Expand EXP, a call to __builtin_va_end. */
5175 static rtx
5177 {
5180 /* Evaluate for side effects, if needed. I hate macros that don't
5181 do that. */
5186 }
5188 /* Expand EXP, a call to __builtin_va_copy. We do this as a
5189 builtin rather than just as an assignment in stdarg.h because of the
5190 nastiness of array-type va_list types. */
5192 static rtx
5194 {
5207 {
5211 }
5212 else
5213 {
5216 /* Evaluate to pointers. */
5225 /* "Dereference" to BLKmode memories. */
5233 /* Copy. */
5235 }
5238 }
5240 /* Expand a call to one of the builtin functions __builtin_frame_address or
5241 __builtin_return_address. */
5243 static rtx
5245 {
5246 /* The argument must be a nonnegative integer constant.
5247 It counts the number of frames to scan up the stack.
5248 The value is either the frame pointer value or the return
5249 address saved in that frame. */
5251 /* Warning about missing arg was already issued. */
5254 {
5257 }
5258 else
5259 {
5260 /* Number of frames to scan up the stack. */
5265 /* Some ports cannot access arbitrary stack frames. */
5267 {
5270 }
5273 {
5274 /* Warn since no effort is made to ensure that any frame
5275 beyond the current one exists or can be safely reached. */
5278 }
5280 /* For __builtin_frame_address, return what we've got. */
5288 }
5289 }
5291 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5292 failed and the caller should emit a normal call. */
5294 static rtx
5296 {
5297 rtx op0;
5298 rtx result;
5301 HOST_WIDE_INT max_size;
5304 bool valid_arglist
5307 VOID_TYPE)
5318 || (!alloca_for_var
5321 ))
5322 {
5323 /* -Walloca-larger-than and -Wvla-larger-than settings of
5324 less than HOST_WIDE_INT_MAX override the more general
5325 -Walloc-size-larger-than so unless either of the former
5326 options is smaller than the last one (wchich would imply
5327 that the call was already checked), check the alloca
5328 arguments for overflow. */
5332 }
5334 /* Compute the argument. */
5337 /* Compute the alignment. */
5339 ? BIGGEST_ALIGNMENT
5342 /* Compute the maximum size. */
5347 /* Allocate the desired space. If the allocation stems from the declaration
5348 of a variable-sized object, it cannot accumulate. */
5349 result
5354 }
5356 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5357 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5358 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5359 handle_builtin_stack_restore function. */
5361 static rtx
5363 {
5370 OPTAB_LIB_WIDEN);
5373 OPTAB_LIB_WIDEN);
5378 }
5380 /* Expand a call to bswap builtin in EXP.
5381 Return NULL_RTX if a normal call should be emitted rather than expanding the
5382 function in-line. If convenient, the result should be placed in TARGET.
5383 SUBTARGET may be used as the target for computing one of EXP's operands. */
5385 static rtx
5387 rtx subtarget)
5388 {
5389 tree arg;
5390 rtx op0;
5408 }
5410 /* Expand a call to a unary builtin in EXP.
5411 Return NULL_RTX if a normal call should be emitted rather than expanding the
5412 function in-line. If convenient, the result should be placed in TARGET.
5413 SUBTARGET may be used as the target for computing one of EXP's operands. */
5415 static rtx
5418 {
5419 rtx op0;
5424 /* Compute the argument. */
5426 (subtarget
5430 /* Compute op, into TARGET if possible.
5431 Set TARGET to wherever the result comes back. */
5437 }
5439 /* Expand a call to __builtin_expect. We just return our argument
5440 as the builtin_expect semantic should've been already executed by
5441 tree branch prediction pass. */
5443 static rtx
5445 {
5446 tree arg;
5453 /* When guessing was done, the hints should be already stripped away. */
5457 }
5459 /* Expand a call to __builtin_expect_with_probability. We just return our
5460 argument as the builtin_expect semantic should've been already executed by
5461 tree branch prediction pass. */
5463 static rtx
5465 {
5466 tree arg;
5473 /* When guessing was done, the hints should be already stripped away. */
5477 }
5480 /* Expand a call to __builtin_assume_aligned. We just return our first
5481 argument as the builtin_assume_aligned semantic should've been already
5482 executed by CCP. */
5484 static rtx
5486 {
5490 EXPAND_NORMAL);
5495 }
5497 void
5499 {
5501 {
5503 /* For trap insns when not accumulating outgoing args force
5504 REG_ARGS_SIZE note to prevent crossjumping of calls with
5505 different args sizes. */
5508 }
5509 else
5510 {
5514 }
5517 }
5519 /* Expand a call to __builtin_unreachable. We do nothing except emit
5520 a barrier saying that control flow will not pass here.
5522 It is the responsibility of the program being compiled to ensure
5523 that control flow does never reach __builtin_unreachable. */
5524 static void
5526 {
5528 }
5530 /* Expand EXP, a call to fabs, fabsf or fabsl.
5531 Return NULL_RTX if a normal call should be emitted rather than expanding
5532 the function inline. If convenient, the result should be placed
5533 in TARGET. SUBTARGET may be used as the target for computing
5534 the operand. */
5536 static rtx
5538 {
5539 machine_mode mode;
5540 tree arg;
5541 rtx op0;
5551 }
5553 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5554 Return NULL is a normal call should be emitted rather than expanding the
5555 function inline. If convenient, the result should be placed in TARGET.
5556 SUBTARGET may be used as the target for computing the operand. */
5558 static rtx
5560 {
5562 tree arg;
5574 }
5576 /* Expand a call to __builtin___clear_cache. */
5578 static rtx
5580 {
5582 {
5583 #ifdef CLEAR_INSN_CACHE
5584 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5585 does something. Just do the default expansion to a call to
5586 __clear_cache(). */
5588 #else
5589 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5590 does nothing. There is no need to call it. Do nothing. */
5593 }
5595 /* We have a "clear_cache" insn, and it will handle everything. */
5599 /* We must not expand to a library call. If we did, any
5600 fallback library function in libgcc that might contain a call to
5601 __builtin___clear_cache() would recurse infinitely. */
5603 {
5606 }
5609 {
5622 }
5624 }
5626 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5628 static rtx
5630 {
5633 /* If we don't need too much alignment, we'll have been guaranteed
5634 proper alignment by get_trampoline_type. */
5638 /* Round address up to desired boundary. */
5649 }
5651 static rtx
5653 {
5669 /* If ONSTACK, the TRAMP argument should be the address of a field
5670 within the local function's FRAME decl. Either way, let's see if
5671 we can fill in the MEM_ATTRs for this memory. */
5675 /* Creator of a heap trampoline is responsible for making sure the
5676 address is aligned to at least STACK_BOUNDARY. Normally malloc
5677 will ensure this anyhow. */
5680 {
5684 }
5686 /* The FUNC argument should be the address of the nested function.
5687 Extract the actual function decl to pass to the hook. */
5694 /* Generate insns to initialize the trampoline. */
5698 {
5704 }
5707 }
5709 static rtx
5711 {
5712 rtx tramp;
5723 }
5725 /* Expand a call to the builtin descriptor initialization routine.
5726 A descriptor is made up of a couple of pointers to the static
5727 chain and the code entry in this order. */
5729 static rtx
5731 {
5736 VOID_TYPE))
5750 /* Generate insns to initialize the descriptor. */
5756 }
5758 /* Expand a call to the builtin descriptor adjustment routine. */
5760 static rtx
5762 {
5763 rtx tramp;
5770 /* Unalign the descriptor to allow runtime identification. */
5775 }
5777 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5778 function. The function first checks whether the back end provides
5779 an insn to implement signbit for the respective mode. If not, it
5780 checks whether the floating point format of the value is such that
5781 the sign bit can be extracted. If that is not the case, error out.
5782 EXP is the expression that is a call to the builtin function; if
5783 convenient, the result should be placed in TARGET. */
5784 static rtx
5786 {
5788 scalar_float_mode fmode;
5790 tree arg;
5793 rtx temp;
5806 /* Expand the argument yielding a RTX expression. */
5809 /* Check if the back end provides an insn that handles signbit for the
5810 argument's mode. */
5813 {
5819 }
5821 /* For floating point formats without a sign bit, implement signbit
5822 as "ARG < 0.0". */
5825 {
5826 /* But we can't do this if the format supports signed zero. */
5832 }
5835 {
5838 }
5839 else
5840 {
5842 /* Handle targets with different FP word orders. */
5845 else
5849 }
5851 /* Force the intermediate word_mode (or narrower) result into a
5852 register. This avoids attempting to create paradoxical SUBREGs
5853 of floating point modes below. */
5856 /* If the bitpos is within the "result mode" lowpart, the operation
5857 can be implement with a single bitwise AND. Otherwise, we need
5858 a right shift and an AND. */
5861 {
5869 }
5870 else
5871 {
5872 /* Perform a logical right shift to place the signbit in the least
5873 significant bit, then truncate the result to the desired mode
5874 and mask just this bit. */
5879 }
5882 }
5884 /* Expand fork or exec calls. TARGET is the desired target of the
5885 call. EXP is the call. FN is the
5886 identificator of the actual function. IGNORE is nonzero if the
5887 value is to be ignored. */
5889 static rtx
5891 {
5893 tree call;
5895 /* If we are not profiling, just call the function. */
5899 /* Otherwise call the wrapper. This should be equivalent for the rest of
5900 compiler, so the code does not diverge, and the wrapper may run the
5901 code necessary for keeping the profiling sane. */
5904 {
5935 }
5947 }
5950 \f
5951 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5952 the pointer in these functions is void*, the tree optimizers may remove
5953 casts. The mode computed in expand_builtin isn't reliable either, due
5954 to __sync_bool_compare_and_swap.
5956 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5957 group of builtins. This gives us log2 of the mode size. */
5961 {
5962 /* The size is not negotiable, so ask not to get BLKmode in return
5963 if the target indicates that a smaller size would be better. */
5965 }
5967 /* Expand the memory expression LOC and return the appropriate memory operand
5968 for the builtin_sync operations. */
5970 static rtx
5972 {
5982 /* Note that we explicitly do not want any alias information for this
5983 memory, so that we kill all other live memories. Otherwise we don't
5984 satisfy the full barrier semantics of the intrinsic. */
5991 /* The alignment needs to be at least according to that of the mode. */
5998 }
6000 /* Make sure an argument is in the right mode.
6001 EXP is the tree argument.
6002 MODE is the mode it should be in. */
6004 static rtx
6006 {
6007 rtx val;
6008 machine_mode old_mode;
6011 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
6012 of CONST_INTs, where we know the old_mode only from the call argument. */
6019 }
6022 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
6023 EXP is the CALL_EXPR. CODE is the rtx code
6024 that corresponds to the arithmetic or logical operation from the name;
6025 an exception here is that NOT actually means NAND. TARGET is an optional
6026 place for us to store the results; AFTER is true if this is the
6027 fetch_and_xxx form. */
6029 static rtx
6032 rtx target)
6033 {
6038 {
6045 {
6074 }
6075 }
6077 /* Expand the operands. */
6082 after);
6083 }
6085 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
6086 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
6087 true if this is the boolean form. TARGET is a place for us to store the
6088 results; this is NOT optional if IS_BOOL is true. */
6090 static rtx
6093 {
6097 /* Expand the operands. */
6104 {
6107 else
6109 }
6112 MEMMODEL_SYNC_SEQ_CST))
6116 }
6118 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
6119 general form is actually an atomic exchange, and some targets only
6120 support a reduced form with the second argument being a constant 1.
6121 EXP is the CALL_EXPR; TARGET is an optional place for us to store
6122 the results. */
6124 static rtx
6126 rtx target)
6127 {
6130 /* Expand the operands. */
6135 }
6137 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
6139 static void
6141 {
6142 rtx mem;
6144 /* Expand the operands. */
6148 }
6150 /* Given an integer representing an ``enum memmodel'', verify its
6151 correctness and return the memory model enum. */
6153 static enum memmodel
6155 {
6156 rtx op;
6158 location_t loc
6161 /* If the parameter is not a constant, it's a run time value so we'll just
6162 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
6172 {
6176 }
6178 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
6180 {
6184 }
6186 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
6187 be conservative and promote consume to acquire. */
6192 }
6194 /* Expand the __atomic_exchange intrinsic:
6195 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
6196 EXP is the CALL_EXPR.
6197 TARGET is an optional place for us to store the results. */
6199 static rtx
6201 {
6210 /* Expand the operands. */
6215 }
6217 /* Expand the __atomic_compare_exchange intrinsic:
6218 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
6219 TYPE desired, BOOL weak,
6220 enum memmodel success,
6221 enum memmodel failure)
6222 EXP is the CALL_EXPR.
6223 TARGET is an optional place for us to store the results. */
6225 static rtx
6227 rtx target)
6228 {
6232 tree weak;
6234 location_t loc
6241 {
6243 "failure memory model cannot be stronger than success "
6246 }
6249 {
6251 "invalid failure memory model for "
6255 }
6261 /* Expand the operands. */
6277 /* Lest the rtl backend create a race condition with an imporoper store
6278 to memory, always create a new pseudo for OLDVAL. */
6285 /* Conditionally store back to EXPECT, lest we create a race condition
6286 with an improper store to memory. */
6287 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6288 the normal case where EXPECT is totally private, i.e. a register. At
6289 which point the store can be unconditional. */
6297 }
6299 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6300 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6301 call. The weak parameter must be dropped to match the expected parameter
6302 list and the expected argument changed from value to pointer to memory
6303 slot. */
6305 static void
6307 {
6323 /* Skip the boolean weak parameter. */
6326 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6329 built_in_function fncode
6334 fndecl);
6339 {
6346 }
6347 }
6349 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6351 void
6353 {
6359 tree lhs;
6361 location_t loc
6368 {
6370 "failure memory model cannot be stronger than success "
6373 }
6376 {
6378 "invalid failure memory model for "
6382 }
6385 {
6388 }
6390 /* Expand the operands. */
6403 {
6406 }
6410 {
6416 }
6417 }
6419 /* Expand the __atomic_load intrinsic:
6420 TYPE __atomic_load (TYPE *object, enum memmodel)
6421 EXP is the CALL_EXPR.
6422 TARGET is an optional place for us to store the results. */
6424 static rtx
6426 {
6427 rtx mem;
6432 {
6433 location_t loc
6438 }
6443 /* Expand the operand. */
6447 }
6450 /* Expand the __atomic_store intrinsic:
6451 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6452 EXP is the CALL_EXPR.
6453 TARGET is an optional place for us to store the results. */
6455 static rtx
6457 {
6464 {
6465 location_t loc
6470 }
6475 /* Expand the operands. */
6480 }
6482 /* Expand the __atomic_fetch_XXX intrinsic:
6483 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6484 EXP is the CALL_EXPR.
6485 TARGET is an optional place for us to store the results.
6486 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6487 FETCH_AFTER is true if returning the result of the operation.
6488 FETCH_AFTER is false if returning the value before the operation.
6489 IGNORE is true if the result is not used.
6490 EXT_CALL is the correct builtin for an external call if this cannot be
6491 resolved to an instruction sequence. */
6493 static rtx
6497 {
6500 tree fndecl;
6501 tree addr;
6505 /* Expand the operands. */
6509 /* Only try generating instructions if inlining is turned on. */
6511 {
6515 }
6517 /* Return if a different routine isn't needed for the library call. */
6521 /* Change the call to the specified function. */
6529 /* If we will emit code after the call, the call can not be a tail call.
6530 If it is emitted as a tail call, a barrier is emitted after it, and
6531 then all trailing code is removed. */
6535 /* Expand the call here so we can emit trailing code. */
6538 /* Replace the original function just in case it matters. */
6541 /* Then issue the arithmetic correction to return the right result. */
6543 {
6545 {
6547 OPTAB_LIB_WIDEN);
6549 }
6550 else
6552 OPTAB_LIB_WIDEN);
6553 }
6555 }
6557 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6559 void
6561 {
6569 optab optab;
6581 {
6596 }
6599 {
6606 }
6628 {
6633 }
6634 else
6636 OPTAB_DIRECT);
6639 }
6641 /* Expand an atomic clear operation.
6642 void _atomic_clear (BOOL *obj, enum memmodel)
6643 EXP is the call expression. */
6645 static rtx
6647 {
6648 machine_mode mode;
6657 {
6658 location_t loc
6663 }
6665 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6666 Failing that, a store is issued by __atomic_store. The only way this can
6667 fail is if the bool type is larger than a word size. Unlikely, but
6668 handle it anyway for completeness. Assume a single threaded model since
6669 there is no atomic support in this case, and no barriers are required. */
6674 }
6676 /* Expand an atomic test_and_set operation.
6677 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6678 EXP is the call expression. */
6680 static rtx
6682 {
6683 rtx mem;
6685 machine_mode mode;
6692 }
6695 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6696 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6698 static tree
6700 {
6702 machine_mode mode;
6708 /* We need a corresponding integer mode for the access to be lock-free. */
6716 {
6719 /* Either this argument is null, or it's a fake pointer encoding
6720 the alignment of the object. */
6726 else
6728 }
6729 else
6730 {
6733 /* This function is usually invoked and folded immediately by the front
6734 end before anything else has a chance to look at it. The pointer
6735 parameter at this point is usually cast to a void *, so check for that
6736 and look past the cast. */
6746 /* Get the underlying type of the object. */
6749 }
6751 /* If the object has smaller alignment, the lock free routines cannot
6752 be used. */
6756 /* Check if a compare_and_swap pattern exists for the mode which represents
6757 the required size. The pattern is not allowed to fail, so the existence
6758 of the pattern indicates support is present. Also require that an
6759 atomic load exists for the required size. */
6762 else
6764 }
6766 /* Return true if the parameters to call EXP represent an object which will
6767 always generate lock free instructions. The first argument represents the
6768 size of the object, and the second parameter is a pointer to the object
6769 itself. If NULL is passed for the object, then the result is based on
6770 typical alignment for an object of the specified size. Otherwise return
6771 false. */
6773 static rtx
6775 {
6776 tree size;
6781 {
6784 }
6790 }
6792 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6793 is lock free on this architecture. */
6795 static tree
6797 {
6801 /* If it isn't always lock free, don't generate a result. */
6806 }
6808 /* Return true if the parameters to call EXP represent an object which will
6809 always generate lock free instructions. The first argument represents the
6810 size of the object, and the second parameter is a pointer to the object
6811 itself. If NULL is passed for the object, then the result is based on
6812 typical alignment for an object of the specified size. Otherwise return
6813 NULL*/
6815 static rtx
6817 {
6818 tree size;
6823 {
6826 }
6831 /* If the value is known at compile time, return the RTX for it. */
6837 }
6839 /* Expand the __atomic_thread_fence intrinsic:
6840 void __atomic_thread_fence (enum memmodel)
6841 EXP is the CALL_EXPR. */
6843 static void
6845 {
6848 }
6850 /* Expand the __atomic_signal_fence intrinsic:
6851 void __atomic_signal_fence (enum memmodel)
6852 EXP is the CALL_EXPR. */
6854 static void
6856 {
6859 }
6861 /* Expand the __sync_synchronize intrinsic. */
6863 static void
6865 {
6867 }
6869 static rtx
6871 {
6877 {
6879 /* If the target is not sutitable then create a new target. */
6887 }
6890 }
6892 static void
6894 {
6900 {
6907 }
6909 }
6911 \f
6912 /* Emit code to restore the current value of stack. */
6914 static void
6916 {
6928 }
6930 /* Emit code to save the current value of stack. */
6932 static rtx
6934 {
6939 }
6941 /* Emit code to get the openacc gang, worker or vector id or size. */
6943 static rtx
6945 {
6947 rtx fallback_retval;
6950 {
6963 }
6966 {
6969 }
6973 {
6976 }
6980 {
6988 }
6997 {
7000 }
7008 }
7010 /* Expand a string compare operation using a sequence of char comparison
7011 to get rid of the calling overhead, with result going to TARGET if
7012 that's convenient.
7014 VAR_STR is the variable string source;
7015 CONST_STR is the constant string source;
7016 LENGTH is the number of chars to compare;
7017 CONST_STR_N indicates which source string is the constant string;
7018 IS_MEMCMP indicates whether it's a memcmp or strcmp.
7020 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
7022 target = (int) (unsigned char) var_str[0]
7023 - (int) (unsigned char) const_str[0];
7024 if (target != 0)
7025 goto ne_label;
7026 ...
7027 target = (int) (unsigned char) var_str[length - 2]
7028 - (int) (unsigned char) const_str[length - 2];
7029 if (target != 0)
7030 goto ne_label;
7031 target = (int) (unsigned char) var_str[length - 1]
7032 - (int) (unsigned char) const_str[length - 1];
7033 ne_label:
7034 */
7036 static rtx
7040 {
7042 rtx var_rtx_array
7049 scalar_int_mode unit_mode
7055 {
7056 var_rtx
7070 }
7078 }
7080 /* Inline expansion a call to str(n)cmp, with result going to
7081 TARGET if that's convenient.
7082 If the call is not been inlined, return NULL_RTX. */
7083 static rtx
7085 {
7091 /* Do NOT apply this inlining expansion when optimizing for size or
7092 optimization level below 2. */
7100 /* On a target where the type of the call (int) has same or narrower presicion
7101 than unsigned char, give up the inlining expansion. */
7117 /* If neither strings is constant string, the call is not qualify. */
7121 /* For strncmp, if the length is not a const, not qualify. */
7132 else
7141 /* If the length of the comparision is larger than the threshold,
7142 do nothing. */
7149 /* Now, start inline expansion the call. */
7153 }
7155 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
7156 represents the size of the first argument to that call, or VOIDmode
7157 if the argument is a pointer. IGNORE will be true if the result
7158 isn't used. */
7159 static rtx
7162 {
7169 {
7172 }
7176 /* An optional second argument can be used as a failsafe value on
7177 some machines. If it isn't present, then the failsafe value is
7178 assumed to be 0. */
7180 {
7183 }
7184 else
7187 /* If the result isn't used, the behavior is undefined. It would be
7188 nice to emit a warning here, but path splitting means this might
7189 happen with legitimate code. So simply drop the builtin
7190 expansion in that case; we've handled any side-effects above. */
7194 /* If we don't have a suitable target, create one to hold the result. */
7202 }
7204 /* Expand an expression EXP that calls a built-in function,
7205 with result going to TARGET if that's convenient
7206 (and in mode MODE if that's convenient).
7207 SUBTARGET may be used as the target for computing one of EXP's operands.
7208 IGNORE is nonzero if the value is to be ignored. */
7210 rtx
7213 {
7222 /* When ASan is enabled, we don't want to expand some memory/string
7223 builtins and rely on libsanitizer's hooks. This allows us to avoid
7224 redundant checks and be sure, that possible overflow will be detected
7225 by ASan. */
7230 /* When not optimizing, generate calls to library functions for a certain
7231 set of builtins. */
7245 /* The built-in function expanders test for target == const0_rtx
7246 to determine whether the function's result will be ignored. */
7250 /* If the result of a pure or const built-in function is ignored, and
7251 none of its arguments are volatile, we can avoid expanding the
7252 built-in call and just evaluate the arguments for side-effects. */
7256 {
7258 tree arg;
7259 call_expr_arg_iterator iter;
7263 {
7266 }
7269 {
7273 }
7274 }
7277 {
7295 /* Just do a normal library call if we were unable to fold
7296 the values. */
7373 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7374 FUNCTION with a copy of the parameters described by
7375 ARGUMENTS, and ARGSIZE. It returns a block of memory
7376 allocated on the stack into which is stored all the registers
7377 that might possibly be used for returning the result of a
7378 function. ARGUMENTS is the value returned by
7379 __builtin_apply_args. ARGSIZE is the number of bytes of
7380 arguments that must be copied. ??? How should this value be
7381 computed? We'll also need a safe worst case value for varargs
7382 functions. */
7389 else
7390 {
7398 }
7400 /* __builtin_return (RESULT) causes the function to return the
7401 value described by RESULT. RESULT is address of the block of
7402 memory returned by __builtin_apply. */
7412 /* All valid uses of __builtin_va_arg_pack () are removed during
7413 inlining. */
7418 /* All valid uses of __builtin_va_arg_pack_len () are removed during
7419 inlining. */
7423 /* Return the address of the first anonymous stack arg. */
7445 /* Returns the address of the area where the structure is returned.
7446 0 otherwise. */
7452 else
7455 CASE_BUILT_IN_ALLOCA:
7605 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7606 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7607 when changing it to a strcmp call. */
7613 /* Change this call back to a BUILT_IN_STRCMP. */
7617 /* Delete the last parameter. */
7624 /* FALLTHROUGH */
7632 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7633 back to a BUILT_IN_STRNCMP. */
7639 /* Change it back to a BUILT_IN_STRNCMP. */
7642 /* FALLTHROUGH */
7657 {
7660 }
7664 /* This should have been lowered to the builtins below. */
7668 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7669 and the receiver label. */
7671 {
7677 /* This is copied from the handling of non-local gotos. */
7679 nonlocal_goto_handler_labels
7681 nonlocal_goto_handler_labels);
7682 /* ??? Do not let expand_label treat us as such since we would
7683 not want to be both on the list of non-local labels and on
7684 the list of forced labels. */
7687 }
7691 /* __builtin_setjmp_receiver is passed the receiver label. */
7693 {
7699 }
7702 /* __builtin_longjmp is passed a pointer to an array of five words.
7703 It's similar to the C library longjmp function but works with
7704 __builtin_setjmp above. */
7707 {
7713 {
7716 }
7720 }
7729 /* This updates the setjmp buffer that is its argument with the value
7730 of the current stack pointer. */
7733 {
7734 rtx buf_addr
7739 }
7759 /* Various hooks for the DWARF 2 __throw routine. */
7765 #ifdef DWARF2_UNWIND_INFO
7771 #endif
7973 mode = get_builtin_sync_mode
7985 mode = get_builtin_sync_mode
8032 {
8036 mode =
8042 /* If this is turned into an external library call, the weak parameter
8043 must be dropped to match the expected parameter list. */
8048 /* Skip the boolean weak parameter. */
8053 }
8082 {
8092 }
8098 {
8108 }
8114 {
8124 }
8130 {
8140 }
8146 {
8156 }
8162 {
8172 }
8309 /* Do library call, if we failed to expand the builtin when
8310 folding. */
8330 }
8332 /* The switch statement above can drop through to cause the function
8333 to be called normally. */
8335 }
8337 /* Determine whether a tree node represents a call to a built-in
8338 function. If the tree T is a call to a built-in function with
8339 the right number of arguments of the appropriate types, return
8340 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8341 Otherwise the return value is END_BUILTINS. */
8343 enum built_in_function
8345 {
8348 const_call_expr_arg_iterator iter;
8360 {
8361 /* If a function doesn't take a variable number of arguments,
8362 the last element in the list will have type `void'. */
8365 {
8369 }
8378 {
8381 }
8383 {
8386 }
8388 {
8391 }
8393 {
8396 }
8397 else
8399 }
8401 /* Variable-length argument list. */
8403 }
8405 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
8406 evaluate to a constant. */
8408 static tree
8410 {
8411 /* We return 1 for a numeric type that's known to be a constant
8412 value at compile-time or for an aggregate type that's a
8413 literal constant. */
8416 /* If we know this is a constant, emit the constant of one. */
8422 {
8429 }
8431 /* If this expression has side effects, show we don't know it to be a
8432 constant. Likewise if it's a pointer or aggregate type since in
8433 those case we only want literals, since those are only optimized
8434 when generating RTL, not later.
8435 And finally, if we are compiling an initializer, not code, we
8436 need to return a definite result now; there's not going to be any
8437 more optimization done. */
8442 || folding_initializer
8447 }
8449 /* Create builtin_expect or builtin_expect_with_probability
8450 with PRED and EXPECTED as its arguments and return it as a truthvalue.
8451 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
8452 builtin_expect_with_probability instead uses third argument as PROBABILITY
8453 value. */
8455 static tree
8458 {
8473 else
8475 predictor);
8479 }
8481 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
8482 NULL_TREE if no simplification is possible. */
8484 tree
8486 tree arg3)
8487 {
8491 /* Distribute the expected value over short-circuiting operators.
8492 See through the cast from truthvalue_type_node to long. */
8499 /* If this is a builtin_expect within a builtin_expect keep the
8500 inner one. See through a comparison against a constant. It
8501 might have been added to create a thruthvalue. */
8517 {
8527 }
8529 /* If the argument isn't invariant then there's nothing else we can do. */
8533 /* If we expect that a comparison against the argument will fold to
8534 a constant return the constant. In practice, this means a true
8535 constant or the address of a non-weak symbol. */
8539 {
8540 do
8541 {
8543 }
8548 }
8550 /* Otherwise, ARG0 already has the proper type for the return value. */
8552 }
8554 /* Fold a call to __builtin_classify_type with argument ARG. */
8556 static tree
8558 {
8563 }
8565 /* Fold a call to __builtin_strlen with argument ARG. */
8567 static tree
8569 {
8572 else
8573 {
8574 c_strlen_data data;
8585 {
8591 }
8594 }
8595 }
8597 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8599 static tree
8601 {
8602 REAL_VALUE_TYPE real;
8604 /* __builtin_inff is intended to be usable to define INFINITY on all
8605 targets. If an infinity is not available, INFINITY expands "to a
8606 positive constant of type float that overflows at translation
8607 time", footnote "In this case, using INFINITY will violate the
8608 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8609 Thus we pedwarn to ensure this constraint violation is
8610 diagnosed. */
8616 }
8618 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8619 NULL_TREE if no simplification can be made. */
8621 static tree
8624 {
8625 tree type;
8635 /* Calculate the result when the argument is a constant. */
8640 /* Canonicalize sincos to cexpi. */
8642 {
8645 }
8647 {
8654 }
8666 }
8668 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8669 Return NULL_TREE if no simplification can be made. */
8671 static tree
8673 {
8679 /* If the LEN parameter is zero, return zero. */
8684 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8688 /* If len parameter is one, return an expression corresponding to
8689 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8691 {
8693 tree cst_uchar_ptr_node
8696 tree ind1
8700 cst_uchar_ptr_node,
8701 arg1)));
8702 tree ind2
8706 cst_uchar_ptr_node,
8707 arg2)));
8709 }
8712 }
8714 /* Fold a call to builtin isascii with argument ARG. */
8716 static tree
8718 {
8721 else
8722 {
8723 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8729 }
8730 }
8732 /* Fold a call to builtin toascii with argument ARG. */
8734 static tree
8736 {
8740 /* Transform toascii(c) -> (c & 0x7f). */
8743 }
8745 /* Fold a call to builtin isdigit with argument ARG. */
8747 static tree
8749 {
8752 else
8753 {
8754 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8755 /* According to the C standard, isdigit is unaffected by locale.
8756 However, it definitely is affected by the target character set. */
8757 unsigned HOST_WIDE_INT target_digit0
8768 }
8769 }
8771 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8773 static tree
8775 {
8781 }
8783 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8785 static tree
8787 {
8793 }
8795 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8797 static tree
8799 {
8802 {
8806 {
8811 }
8812 }
8815 }
8817 /* Fold a call to builtin frexp, we can assume the base is 2. */
8819 static tree
8821 {
8832 /* Proceed if a valid pointer type was passed in. */
8834 {
8839 {
8841 /* For +-0, return (*exp = 0, +-0). */
8847 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8850 {
8851 /* Since the frexp function always expects base 2, and in
8852 GCC normalized significands are already in the range
8853 [0.5, 1.0), we have exactly what frexp wants. */
8858 }
8862 }
8864 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8868 }
8871 }
8873 /* Fold a call to builtin modf. */
8875 static tree
8877 {
8888 /* Proceed if a valid pointer type was passed in. */
8890 {
8895 {
8898 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8902 /* For +-Inf, return (*arg1 = arg0, +-0). */
8908 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8911 /* If the original number was negative and already
8912 integral, then the fractional part is -0.0. */
8916 }
8918 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8924 }
8927 }
8929 /* Given a location LOC, an interclass builtin function decl FNDECL
8930 and its single argument ARG, return an folded expression computing
8931 the same, or NULL_TREE if we either couldn't or didn't want to fold
8932 (the latter happen if there's an RTL instruction available). */
8934 static tree
8936 {
8937 machine_mode mode;
8949 /* If there is no optab, try generic code. */
8951 {
8952 tree result;
8955 {
8956 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8959 REAL_VALUE_TYPE r;
8963 {
8964 /* NaN and Inf are encoded in the high-order double value
8965 only. The low-order value is not significant. */
8969 }
8976 }
8979 {
8980 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8983 REAL_VALUE_TYPE r;
8987 {
8988 /* NaN and Inf are encoded in the high-order double value
8989 only. The low-order value is not significant. */
8993 }
8999 /*result = fold_build2_loc (loc, UNGT_EXPR,
9000 TREE_TYPE (TREE_TYPE (fndecl)),
9001 fold_build1_loc (loc, ABS_EXPR, type, arg),
9002 build_real (type, r));
9003 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9004 TREE_TYPE (TREE_TYPE (fndecl)),
9005 result);*/
9007 }
9009 {
9010 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9011 islessequal(fabs(x),DBL_MAX). */
9021 {
9022 /* Use double to test the normal range of IBM extended
9023 precision. Emin for IBM extended precision is
9024 different to emin for IEEE double, being 53 higher
9025 since the low double exponent is at least 53 lower
9026 than the high double exponent. */
9030 }
9042 {
9043 /* Testing the high end of the range is done just using
9044 the high double, using the same test as isfinite().
9045 For the subnormal end of the range we first test the
9046 high double, then if its magnitude is equal to the
9047 limit of 0x1p-969, we test whether the low double is
9048 non-zero and opposite sign to the high double. */
9064 integer_type_node,
9070 }
9071 else
9072 {
9073 tree const isge_fn
9076 }
9080 }
9083 }
9086 }
9088 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9089 ARG is the argument for the call. */
9091 static tree
9093 {
9100 {
9108 {
9109 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9110 /* In a boolean context, GCC will fold the inner COND_EXPR to
9111 1. So e.g. "if (isinf_sign(x))" would be folded to just
9112 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9120 {
9133 integer_zero_node);
9134 }
9137 }
9150 {
9153 {
9154 /* NaN and Inf are encoded in the high-order double value
9155 only. The low-order value is not significant. */
9157 }
9158 }
9164 }
9165 }
9167 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9168 This builtin will generate code to return the appropriate floating
9169 point classification depending on the value of the floating point
9170 number passed in. The possible return values must be supplied as
9171 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9172 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9173 one floating point argument which is "type generic". */
9175 static tree
9177 {
9180 machine_mode mode;
9181 REAL_VALUE_TYPE r;
9184 /* Verify the required arguments in the original call. */
9204 /* fpclassify(x) ->
9205 isnan(x) ? FP_NAN :
9206 (fabs(x) == Inf ? FP_INFINITE :
9207 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9208 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9222 {
9228 }
9231 {
9234 }
9237 }
9239 /* Fold a call to an unordered comparison function such as
9240 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9241 being called and ARG0 and ARG1 are the arguments for the call.
9242 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9243 the opposite of the desired result. UNORDERED_CODE is used
9244 for modes that can hold NaNs and ORDERED_CODE is used for
9245 the rest. */
9247 static tree
9251 {
9265 /* Choose the wider of two real types. */
9277 {
9281 }
9286 }
9288 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9289 arithmetics if it can never overflow, or into internal functions that
9290 return both result of arithmetics and overflowed boolean flag in
9291 a complex integer result, or some other check for overflow.
9292 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9293 checking part of that. */
9295 static tree
9298 {
9300 /* The code of the expression corresponding to the type-generic
9301 built-in, or ERROR_MARK for the type-specific ones. */
9306 {
9309 /* FALLTHRU */
9312 /* FALLTHRU */
9323 /* FALLTHRU */
9326 /* FALLTHRU */
9337 /* FALLTHRU */
9340 /* FALLTHRU */
9351 }
9353 /* For the "generic" overloads, the first two arguments can have different
9354 types and the last argument determines the target type to use to check
9355 for overflow. The arguments of the other overloads all have the same
9356 type. */
9359 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
9360 arguments are constant, attempt to fold the built-in call into a constant
9361 expression indicating whether or not it detected an overflow. */
9365 /* Perform the computation in the target type and check for overflow. */
9369 arg2);
9383 tree store
9386 }
9388 /* Fold a call to __builtin_FILE to a constant string. */
9392 {
9394 {
9395 /* The documentation says this builtin is equivalent to the preprocessor
9396 __FILE__ macro so it appears appropriate to use the same file prefix
9397 mappings. */
9400 }
9403 }
9405 /* Fold a call to __builtin_FUNCTION to a constant string. */
9409 {
9416 }
9418 /* Fold a call to __builtin_LINE to an integer constant. */
9422 {
9424 }
9426 /* Fold a call to built-in function FNDECL with 0 arguments.
9427 This function returns NULL_TREE if no simplification was possible. */
9429 static tree
9431 {
9435 {
9461 }
9463 }
9465 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9466 This function returns NULL_TREE if no simplification was possible. */
9468 static tree
9470 {
9481 {
9483 {
9486 /* Gimplification will pull the CALL_EXPR for the builtin out of
9487 an if condition. When not optimizing, we'll not CSE it back.
9488 To avoid link error types of regressions, return false now. */
9493 }
9549 {
9554 }
9560 {
9565 }
9586 }
9590 }
9592 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9593 This function returns NULL_TREE if no simplification was possible. */
9595 static tree
9597 {
9609 {
9653 NOP_EXPR);
9655 /* We do the folding for va_start in the expander. */
9670 }
9672 }
9674 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9675 and ARG2.
9676 This function returns NULL_TREE if no simplification was possible. */
9678 static tree
9681 {
9695 {
9744 }
9746 }
9748 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9749 arguments. IGNORE is true if the result of the
9750 function call is ignored. This function returns NULL_TREE if no
9751 simplification was possible. */
9753 tree
9755 {
9759 {
9775 }
9777 {
9781 }
9783 }
9785 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9786 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9787 of arguments in ARGS to be omitted. OLDNARGS is the number of
9788 elements in ARGS. */
9790 static tree
9793 {
9798 {
9806 }
9807 else
9811 }
9813 /* Return true if FNDECL shouldn't be folded right now.
9814 If a built-in function has an inline attribute always_inline
9815 wrapper, defer folding it after always_inline functions have
9816 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9817 might not be performed. */
9819 bool
9821 {
9824 && cfun
9827 }
9829 /* A wrapper function for builtin folding that prevents warnings for
9830 "statement without effect" and the like, caused by removing the
9831 call node earlier than the warning is generated. */
9833 tree
9835 {
9839 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9840 yet. Defer folding until we see all the arguments
9841 (after inlining). */
9843 {
9846 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9847 instead last argument is __builtin_va_arg_pack (). Defer folding
9848 even in that case, until arguments are finalized. */
9850 {
9854 }
9862 else
9863 {
9868 }
9869 }
9871 }
9873 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9874 N arguments are passed in the array ARGARRAY. Return a folded
9875 expression or NULL_TREE if no simplification was possible. */
9877 tree
9879 tree fn,
9882 {
9889 {
9890 /* If last argument is __builtin_va_arg_pack (), arguments to this
9891 function are not finalized yet. Defer folding until they are. */
9893 {
9897 }
9902 else
9904 }
9907 }
9909 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9910 along with N new arguments specified as the "..." parameters. SKIP
9911 is the number of arguments in EXP to be omitted. This function is used
9912 to do varargs-to-varargs transformations. */
9914 static tree
9916 {
9918 tree t;
9926 }
9928 /* Validate a single argument ARG against a tree code CODE representing
9929 a type. Return true when argument is valid. */
9931 static bool
9933 {
9941 }
9943 /* This function validates the types of a function call argument list
9944 against a specified list of tree_codes. If the last specifier is a 0,
9945 that represents an ellipses, otherwise the last specifier must be a
9946 VOID_TYPE.
9948 This is the GIMPLE version of validate_arglist. Eventually we want to
9949 completely convert builtins.c to work from GIMPLEs and the tree based
9950 validate_arglist will then be removed. */
9952 bool
9954 {
9958 const_tree arg;
9964 do
9965 {
9968 {
9970 /* This signifies an ellipses, any further arguments are all ok. */
9974 /* This signifies an endlink, if no arguments remain, return
9975 true, otherwise return false. */
9979 /* If no parameters remain or the parameter's code does not
9980 match the specified code, return false. Otherwise continue
9981 checking any remaining arguments. */
9986 }
9987 }
9990 /* We need gotos here since we can only have one VA_CLOSE in a
9991 function. */
9992 end: ;
9996 }
9998 /* Default target-specific builtin expander that does nothing. */
10000 rtx
10002 rtx target ATTRIBUTE_UNUSED,
10003 rtx subtarget ATTRIBUTE_UNUSED,
10004 machine_mode mode ATTRIBUTE_UNUSED,
10006 {
10008 }
10010 /* Returns true is EXP represents data that would potentially reside
10011 in a readonly section. */
10013 bool
10015 {
10025 /* Make sure we call decl_readonly_section only for trees it
10026 can handle (since it returns true for everything it doesn't
10027 understand). */
10032 else
10034 }
10036 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
10037 to the call, and TYPE is its return type.
10039 Return NULL_TREE if no simplification was possible, otherwise return the
10040 simplified form of the call as a tree.
10042 The simplified form may be a constant or other expression which
10043 computes the same value, but in a more efficient manner (including
10044 calls to other builtin functions).
10046 The call may contain arguments which need to be evaluated, but
10047 which are not useful to determine the result of the call. In
10048 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10049 COMPOUND_EXPR will be an argument which must be evaluated.
10050 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10051 COMPOUND_EXPR in the chain will contain the tree for the simplified
10052 form of the builtin function call. */
10054 static tree
10056 {
10060 else
10061 {
10062 tree fn;
10071 {
10073 tree tem;
10078 /* Return an offset into the constant string argument. */
10081 }
10084 /* strpbrk(x, "") == NULL.
10085 Evaluate and ignore s1 in case it had side-effects. */
10095 /* New argument list transforming strpbrk(s1, s2) to
10096 strchr(s1, s2[0]). */
10099 }
10100 }
10102 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
10103 to the call.
10105 Return NULL_TREE if no simplification was possible, otherwise return the
10106 simplified form of the call as a tree.
10108 The simplified form may be a constant or other expression which
10109 computes the same value, but in a more efficient manner (including
10110 calls to other builtin functions).
10112 The call may contain arguments which need to be evaluated, but
10113 which are not useful to determine the result of the call. In
10114 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10115 COMPOUND_EXPR will be an argument which must be evaluated.
10116 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10117 COMPOUND_EXPR in the chain will contain the tree for the simplified
10118 form of the builtin function call. */
10120 static tree
10122 {
10126 else
10127 {
10130 /* If either argument is "", return NULL_TREE. */
10132 /* Evaluate and ignore both arguments in case either one has
10133 side-effects. */
10137 }
10138 }
10140 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
10141 to the call.
10143 Return NULL_TREE if no simplification was possible, otherwise return the
10144 simplified form of the call as a tree.
10146 The simplified form may be a constant or other expression which
10147 computes the same value, but in a more efficient manner (including
10148 calls to other builtin functions).
10150 The call may contain arguments which need to be evaluated, but
10151 which are not useful to determine the result of the call. In
10152 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10153 COMPOUND_EXPR will be an argument which must be evaluated.
10154 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10155 COMPOUND_EXPR in the chain will contain the tree for the simplified
10156 form of the builtin function call. */
10158 static tree
10160 {
10164 else
10165 {
10166 /* If the first argument is "", return NULL_TREE. */
10169 {
10170 /* Evaluate and ignore argument s2 in case it has
10171 side-effects. */
10174 }
10176 /* If the second argument is "", return __builtin_strlen(s1). */
10179 {
10182 /* If the replacement _DECL isn't initialized, don't do the
10183 transformation. */
10188 }
10190 }
10191 }
10193 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
10194 produced. False otherwise. This is done so that we don't output the error
10195 or warning twice or three times. */
10197 bool
10199 {
10202 tree arg;
10203 /* There is good chance the current input_location points inside the
10204 definition of the va_start macro (perhaps on the token for
10205 builtin) in a system header, so warnings will not be emitted.
10206 Use the location in real source code. */
10207 location_t current_location =
10209 NULL);
10212 {
10215 }
10218 {
10220 {
10223 }
10225 }
10226 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
10227 when we checked the arguments and if needed issued a warning. */
10228 else
10229 {
10231 {
10232 /* Evidently an out of date version of <stdarg.h>; can't validate
10233 va_start's second argument, but can still work as intended. */
10235 OPT_Wvarargs,
10238 }
10240 {
10243 }
10245 }
10250 /* We destructively modify the call to be __builtin_va_start (ap, 0)
10251 or __builtin_next_arg (0) the first time we see it, after checking
10252 the arguments and if needed issuing a warning. */
10254 {
10257 /* Strip off all nops for the sake of the comparison. This
10258 is not quite the same as STRIP_NOPS. It does more.
10259 We must also strip off INDIRECT_EXPR for C++ reference
10260 parameters. */
10265 {
10266 /* FIXME: Sometimes with the tree optimizers we can get the
10267 not the last argument even though the user used the last
10268 argument. We just warn and set the arg to be the last
10269 argument so that we will get wrong-code because of
10270 it. */
10272 OPT_Wvarargs,
10274 }
10276 /* Undefined by C99 7.15.1.4p4 (va_start):
10277 "If the parameter parmN is declared with the register storage
10278 class, with a function or array type, or with a type that is
10279 not compatible with the type that results after application of
10280 the default argument promotions, the behavior is undefined."
10281 */
10283 {
10285 OPT_Wvarargs,
10286 "undefined behavior when second parameter of "
10288 }
10290 /* We want to verify the second parameter just once before the tree
10291 optimizers are run and then avoid keeping it in the tree,
10292 as otherwise we could warn even for correct code like:
10293 void foo (int i, ...)
10294 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
10297 else
10299 }
10301 }
10304 /* Expand a call EXP to __builtin_object_size. */
10306 static rtx
10308 {
10309 tree ost;
10314 {
10319 }
10327 {
10332 }
10337 }
10339 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10340 FCODE is the BUILT_IN_* to use.
10341 Return NULL_RTX if we failed; the caller should emit a normal call,
10342 otherwise try to get the result in TARGET, if convenient (and in
10343 mode MODE if that's convenient). */
10345 static rtx
10348 {
10350 POINTER_TYPE,
10351 fcode == BUILT_IN_MEMSET_CHK
10368 {
10369 /* Avoid transforming the checking call to an ordinary one when
10370 an overflow has been detected or when the call couldn't be
10371 validated because the size is not constant. */
10376 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10377 mem{cpy,pcpy,move,set} is available. */
10379 {
10394 }
10403 }
10406 else
10407 {
10410 /* If DEST is not a pointer type, call the normal function. */
10414 /* If SRC and DEST are the same (and not volatile), do nothing. */
10416 {
10417 tree expr;
10420 {
10421 /* Evaluate and ignore LEN in case it has side-effects. */
10424 }
10428 }
10430 /* __memmove_chk special case. */
10432 {
10438 /* If src is categorized for a readonly section we can use
10439 normal __memcpy_chk. */
10441 {
10450 }
10451 }
10453 }
10454 }
10456 /* Emit warning if a buffer overflow is detected at compile time. */
10458 static void
10460 {
10461 /* The source string. */
10463 /* The size of the destination object. */
10465 /* The string that is being concatenated with (as in __strcat_chk)
10466 or null if it isn't. */
10468 /* The maximum length of the source sequence in a bounded operation
10469 (such as __strncat_chk) or null if the operation isn't bounded
10470 (such as __strcat_chk). */
10472 /* The exact size of the access (such as in __strncpy_chk). */
10476 {
10484 /* For __strcat_chk the warning will be emitted only if overflowing
10485 by at least strlen (dest) + 1 bytes. */
10512 }
10515 {
10516 /* Check __strncat_chk. There is no way to determine the length
10517 of the string to which the source string is being appended so
10518 just warn when the length of the source string is not known. */
10521 }
10523 /* The destination argument is the first one for all built-ins above. */
10527 }
10529 /* Emit warning if a buffer overflow is detected at compile time
10530 in __sprintf_chk/__vsprintf_chk calls. */
10532 static void
10534 {
10539 /* Verify the required arguments in the original call. */
10549 /* Check whether the format is a literal string constant. */
10557 /* If the format doesn't contain % args or %%, we know its size. */
10560 /* If the format is "%s" and first ... argument is a string literal,
10561 we know it too. */
10564 {
10565 tree arg;
10576 }
10577 else
10580 /* Add one for the terminating nul. */
10585 }
10587 /* Emit warning if a free is called with address of a variable. */
10589 static void
10591 {
10605 else
10608 }
10610 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10611 if possible. */
10613 static tree
10615 {
10632 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10633 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10634 and (size_t) 0 for types 2 and 3. */
10639 {
10643 }
10645 {
10646 /* If object size is not known yet, delay folding until
10647 later. Maybe subsequent passes will help determining
10648 it. */
10652 }
10655 }
10657 /* Builtins with folding operations that operate on "..." arguments
10658 need special handling; we need to store the arguments in a convenient
10659 data structure before attempting any folding. Fortunately there are
10660 only a few builtins that fall into this category. FNDECL is the
10661 function, EXP is the CALL_EXPR for the call. */
10663 static tree
10665 {
10670 {
10677 }
10679 {
10684 }
10686 }
10688 /* Initialize format string characters in the target charset. */
10690 bool
10692 {
10695 {
10718 }
10720 }
10722 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10723 and no overflow/underflow occurred. INEXACT is true if M was not
10724 exactly calculated. TYPE is the tree type for the result. This
10725 function assumes that you cleared the MPFR flags and then
10726 calculated M to see if anything subsequently set a flag prior to
10727 entering this function. Return NULL_TREE if any checks fail. */
10729 static tree
10731 {
10732 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10733 overflow/underflow occurred. If -frounding-math, proceed iff the
10734 result of calling FUNC was exact. */
10737 {
10738 REAL_VALUE_TYPE rr;
10741 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10742 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10743 but the mpft_t is not, then we underflowed in the
10744 conversion. */
10747 {
10748 REAL_VALUE_TYPE rmode;
10751 /* Proceed iff the specified mode can hold the value. */
10754 }
10755 }
10757 }
10759 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10760 number and no overflow/underflow occurred. INEXACT is true if M
10761 was not exactly calculated. TYPE is the tree type for the result.
10762 This function assumes that you cleared the MPFR flags and then
10763 calculated M to see if anything subsequently set a flag prior to
10764 entering this function. Return NULL_TREE if any checks fail, if
10765 FORCE_CONVERT is true, then bypass the checks. */
10767 static tree
10769 {
10770 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10771 overflow/underflow occurred. If -frounding-math, proceed iff the
10772 result of calling FUNC was exact. */
10777 {
10782 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10783 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10784 but the mpft_t is not, then we underflowed in the
10785 conversion. */
10790 {
10795 /* Proceed iff the specified mode can hold the value. */
10801 }
10802 }
10804 }
10806 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10807 the pointer *(ARG_QUO) and return the result. The type is taken
10808 from the type of ARG0 and is used for setting the precision of the
10809 calculation and results. */
10811 static tree
10813 {
10820 /* To proceed, MPFR must exactly represent the target floating point
10821 format, which only happens when the target base equals two. */
10825 {
10830 {
10834 tree result_rem;
10843 /* Remquo is independent of the rounding mode, so pass
10844 inexact=0 to do_mpfr_ckconv(). */
10848 {
10849 /* MPFR calculates quo in the host's long so it may
10850 return more bits in quo than the target int can hold
10851 if sizeof(host long) > sizeof(target int). This can
10852 happen even for native compilers in LP64 mode. In
10853 these cases, modulo the quo value with the largest
10854 number that the target int can hold while leaving one
10855 bit for the sign. */
10859 /* Dereference the quo pointer argument. */
10861 /* Proceed iff a valid pointer type was passed in. */
10863 {
10864 /* Set the value. */
10865 tree result_quo
10868 integer_quo));
10870 /* Combine the quo assignment with the rem. */
10873 }
10874 }
10875 }
10876 }
10878 }
10880 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10881 resulting value as a tree with type TYPE. The mpfr precision is
10882 set to the precision of TYPE. We assume that this mpfr function
10883 returns zero if the result could be calculated exactly within the
10884 requested precision. In addition, the integer pointer represented
10885 by ARG_SG will be dereferenced and set to the appropriate signgam
10886 (-1,1) value. */
10888 static tree
10890 {
10895 /* To proceed, MPFR must exactly represent the target floating point
10896 format, which only happens when the target base equals two. Also
10897 verify ARG is a constant and that ARG_SG is an int pointer. */
10902 {
10905 /* In addition to NaN and Inf, the argument cannot be zero or a
10906 negative integer. */
10910 {
10915 mpfr_t m;
10916 tree result_lg;
10925 {
10926 tree result_sg;
10928 /* Dereference the arg_sg pointer argument. */
10930 /* Assign the signgam value into *arg_sg. */
10935 /* Combine the signgam assignment with the lgamma result. */
10938 }
10939 }
10940 }
10943 }
10945 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10946 mpc function FUNC on it and return the resulting value as a tree
10947 with type TYPE. The mpfr precision is set to the precision of
10948 TYPE. We assume that function FUNC returns zero if the result
10949 could be calculated exactly within the requested precision. If
10950 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10951 in the arguments and/or results. */
10953 tree
10956 {
10962 /* To proceed, MPFR must exactly represent the target floating point
10963 format, which only happens when the target base equals two. */
10969 {
10978 {
10998 }
10999 }
11002 }
11004 /* A wrapper function for builtin folding that prevents warnings for
11005 "statement without effect" and the like, caused by removing the
11006 call node earlier than the warning is generated. */
11008 tree
11010 {
11016 {
11025 {
11027 }
11028 else
11029 {
11032 {
11033 /* Propagate location information from original call to
11034 expansion of builtin. Otherwise things like
11035 maybe_emit_chk_warning, that operate on the expansion
11036 of a builtin, will use the wrong location information. */
11038 {
11046 }
11048 }
11049 }
11050 }
11052 }
11054 /* Look up the function in builtin_decl that corresponds to DECL
11055 and set ASMSPEC as its user assembler name. DECL must be a
11056 function decl that declares a builtin. */
11058 void
11060 {
11069 {
11073 }
11074 }
11076 /* Return true if DECL is a builtin that expands to a constant or similarly
11077 simple code. */
11078 bool
11080 {
11083 {
11084 /* Builtins that expand to constants. */
11089 /* Simple register moves or loads from stack. */
11100 /* Exception state returns or moves registers around. */
11108 }
11111 }
11113 /* Return true if DECL is a builtin that is not expensive, i.e., they are
11114 most probably expanded inline into reasonably simple code. This is a
11115 superset of is_simple_builtin. */
11116 bool
11118 {
11125 {
11127 CASE_BUILT_IN_ALLOCA:
11193 }
11196 }
11198 /* Return true if T is a constant and the value cast to a target char
11199 can be represented by a host char.
11200 Store the casted char constant in *P if so. */
11202 bool
11204 {
11210 }
11212 /* Return the maximum object size. */
11214 tree
11216 {
11217 /* To do: Make this a configurable parameter. */
11219 }