| blob | 3f32754c4d35fc34af7c53156d2a356f69a94a8f |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2019 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. */
129 memop_ret retmode);
197 /* Return true if NAME starts with __builtin_ or __sync_. */
199 static bool
201 {
209 }
211 /* Return true if NODE should be considered for inline expansion regardless
212 of the optimization level. This means whenever a function is invoked with
213 its "internal" name, which normally contains the prefix "__builtin". */
215 bool
217 {
218 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
219 we want the name used to call the function, not the name it
220 will have. */
223 }
225 /* Compute values M and N such that M divides (address of EXP - N) and such
226 that N < M. If these numbers can be determined, store M in alignp and N in
227 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
228 *alignp and any bit-offset to *bitposp.
230 Note that the address (and thus the alignment) computed here is based
231 on the address to which a symbol resolves, whereas DECL_ALIGN is based
232 on the address at which an object is actually located. These two
233 addresses are not always the same. For example, on ARM targets,
234 the address &foo of a Thumb function foo() has the lowest bit set,
235 whereas foo() itself starts on an even address.
237 If ADDR_P is true we are taking the address of the memory reference EXP
238 and thus cannot rely on the access taking place. */
240 static bool
243 {
245 tree offset;
246 machine_mode mode;
251 /* Get the innermost object and the constant (bitpos) and possibly
252 variable (offset) offset of the access. */
256 /* Extract alignment information from the innermost object and
257 possibly adjust bitpos and offset. */
259 {
260 /* Function addresses can encode extra information besides their
261 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
262 allows the low bit to be used as a virtual bit, we know
263 that the address itself must be at least 2-byte aligned. */
266 }
268 ;
270 {
271 /* The alignment of a CONST_DECL is determined by its initializer. */
278 }
280 {
283 }
287 {
293 /* If the address is explicitely aligned, handle that. */
296 {
301 }
303 known_alignment
307 /* Re-apply explicit alignment to the bitpos. */
310 /* The alignment of the pointer operand in a TARGET_MEM_REF
311 has to take the variable offset parts into account. */
313 {
315 {
320 }
324 }
326 /* When EXP is an actual memory reference then we can use
327 TYPE_ALIGN of a pointer indirection to derive alignment.
328 Do so only if get_pointer_alignment_1 did not reveal absolute
329 alignment knowledge and if using that alignment would
330 improve the situation. */
336 else
337 {
338 /* Else adjust bitpos accordingly. */
343 }
344 }
346 {
347 /* STRING_CST are the only constant objects we allow to be not
348 wrapped inside a CONST_DECL. */
354 }
356 /* If there is a non-constant offset part extract the maximum
357 alignment that can prevail. */
359 {
362 {
366 }
367 }
369 /* Account for the alignment of runtime coefficients, so that the constant
370 bitpos is guaranteed to be accurate. */
373 {
376 }
381 }
383 /* For a memory reference expression EXP compute values M and N such that M
384 divides (&EXP - N) and such that N < M. If these numbers can be determined,
385 store M in alignp and N in *BITPOSP and return true. Otherwise return false
386 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
388 bool
391 {
393 }
395 /* Return the alignment in bits of EXP, an object. */
397 unsigned int
399 {
405 /* align and bitpos now specify known low bits of the pointer.
406 ptr & (align - 1) == bitpos. */
411 }
413 /* For a pointer valued expression EXP compute values M and N such that M
414 divides (EXP - N) and such that N < M. If these numbers can be determined,
415 store M in alignp and N in *BITPOSP and return true. Return false if
416 the results are just a conservative approximation.
418 If EXP is not a pointer, false is returned too. */
420 bool
423 {
430 {
437 else
438 {
441 {
445 }
446 }
450 }
453 {
458 {
461 /* Make sure to return a sensible alignment when the multiplication
462 by BITS_PER_UNIT overflowed. */
465 /* We cannot really tell whether this result is an approximation. */
467 }
468 else
469 {
473 }
474 }
476 {
481 }
486 }
488 /* Return the alignment in bits of EXP, a pointer valued expression.
489 The alignment returned is, by default, the alignment of the thing that
490 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
492 Otherwise, look at the expression to see if we can do better, i.e., if the
493 expression is actually pointing at an object whose alignment is tighter. */
495 unsigned int
497 {
503 /* align and bitpos now specify known low bits of the pointer.
504 ptr & (align - 1) == bitpos. */
510 }
512 /* Return the number of leading non-zero elements in the sequence
513 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
514 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
516 unsigned
518 {
524 {
525 /* Optimize the common case of plain char. */
527 {
531 }
532 }
533 else
534 {
536 {
540 }
541 }
543 }
545 /* For a call at LOC to a function FN that expects a string in the argument
546 ARG, issue a diagnostic due to it being a called with an argument
547 declared at NONSTR that is a character array with no terminating NUL. */
549 void
551 {
559 {
563 }
564 }
566 /* If EXP refers to an unterminated constant character array return
567 the declaration of the object of which the array is a member or
568 element and if SIZE is not null, set *SIZE to the size of
569 the unterminated array and set *EXACT if the size is exact or
570 clear it otherwise. Otherwise return null. */
572 tree
574 {
575 /* C_STRLEN will return NULL and set DECL in the info
576 structure if EXP references a unterminated array. */
577 c_strlen_data lendata = { };
580 {
582 {
585 {
586 /* Constant offsets are already accounted for in LENDATA.MINLEN,
587 but not in a SSA_NAME + CST expression. */
592 {
593 /* Subtract the offset from the size of the array. */
598 }
599 else
601 }
602 else
606 }
608 }
611 }
613 /* Compute the length of a null-terminated character string or wide
614 character string handling character sizes of 1, 2, and 4 bytes.
615 TREE_STRING_LENGTH is not the right way because it evaluates to
616 the size of the character array in bytes (as opposed to characters)
617 and because it can contain a zero byte in the middle.
619 ONLY_VALUE should be nonzero if the result is not going to be emitted
620 into the instruction stream and zero if it is going to be expanded.
621 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
622 is returned, otherwise NULL, since
623 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
624 evaluate the side-effects.
626 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
627 accesses. Note that this implies the result is not going to be emitted
628 into the instruction stream.
630 Additional information about the string accessed may be recorded
631 in DATA. For example, if SRC references an unterminated string,
632 then the declaration will be stored in the DECL field. If the
633 length of the unterminated string can be determined, it'll be
634 stored in the LEN field. Note this length could well be different
635 than what a C strlen call would return.
637 ELTSIZE is 1 for normal single byte character strings, and 2 or
638 4 for wide characer strings. ELTSIZE is by default 1.
640 The value returned is of type `ssizetype'. */
642 tree
644 {
645 /* If we were not passed a DATA pointer, then get one to a local
646 structure. That avoids having to check DATA for NULL before
647 each time we want to use it. */
648 c_strlen_data local_strlen_data = { };
656 {
663 }
671 /* Offset from the beginning of the string in bytes. */
672 tree byteoff;
673 tree memsize;
674 tree decl;
679 /* Determine the size of the string element. */
683 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
684 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
685 in case the latter is less than the size of the array, such as when
686 SRC refers to a short string literal used to initialize a large array.
687 In that case, the elements of the array after the terminating NUL are
688 all NUL. */
697 /* PTR can point to the byte representation of any string type, including
698 char* and wchar_t*. */
702 {
703 /* The code below works only for single byte character types. */
707 /* If the string has an internal NUL character followed by any
708 non-NUL characters (e.g., "foo\0bar"), we can't compute
709 the offset to the following NUL if we don't know where to
710 start searching for it. */
713 /* Return when an embedded null character is found or none at all.
714 In the latter case, set the DECL/LEN field in the DATA structure
715 so that callers may examine them. */
719 {
724 }
726 /* For empty strings the result should be zero. */
730 /* We don't know the starting offset, but we do know that the string
731 has no internal zero bytes. If the offset falls within the bounds
732 of the string subtract the offset from the length of the string,
733 and return that. Otherwise the length is zero. Take care to
734 use SAVE_EXPR in case the OFFSET has side-effects. */
741 offsave);
745 }
747 /* Offset from the beginning of the string in elements. */
748 HOST_WIDE_INT eltoff;
750 /* We have a known offset into the string. Start searching there for
751 a null character if we can represent it as a single HOST_WIDE_INT. */
756 else
759 /* If the offset is known to be out of bounds, warn, and call strlen at
760 runtime. */
762 {
763 /* Suppress multiple warnings for propagated constant strings. */
768 eltoff))
771 }
773 /* If eltoff is larger than strelts but less than maxelts the
774 string length is zero, since the excess memory will be zero. */
778 /* Use strlen to search for the first zero byte. Since any strings
779 constructed with build_string will have nulls appended, we win even
780 if we get handed something like (char[4])"abcd".
782 Since ELTOFF is our starting index into the string, no further
783 calculation is needed. */
787 /* Don't know what to return if there was no zero termination.
788 Ideally this would turn into a gcc_checking_assert over time.
789 Set DECL/LEN so callers can examine them. */
791 {
796 }
799 }
801 /* Return a constant integer corresponding to target reading
802 GET_MODE_BITSIZE (MODE) bits from string constant STR. If
803 NULL_TERMINATED_P, reading stops after '\0' character, all further ones
804 are assumed to be zero, otherwise it reads as many characters
805 as needed. */
807 rtx
810 {
811 HOST_WIDE_INT ch;
825 {
837 }
841 }
843 /* Cast a target constant CST to target CHAR and if that value fits into
844 host char type, return zero and put that value into variable pointed to by
845 P. */
847 static int
849 {
856 /* Do not care if it fits or not right here. */
871 }
873 /* Similar to save_expr, but assumes that arbitrary code is not executed
874 in between the multiple evaluations. In particular, we assume that a
875 non-addressable local variable will not be modified. */
877 static tree
879 {
887 }
889 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
890 times to get the address of either a higher stack frame, or a return
891 address located within it (depending on FNDECL_CODE). */
893 static rtx
895 {
899 {
900 /* For a zero count with __builtin_return_address, we don't care what
901 frame address we return, because target-specific definitions will
902 override us. Therefore frame pointer elimination is OK, and using
903 the soft frame pointer is OK.
905 For a nonzero count, or a zero count with __builtin_frame_address,
906 we require a stable offset from the current frame pointer to the
907 previous one, so we must use the hard frame pointer, and
908 we must disable frame pointer elimination. */
911 else
912 {
915 /* Tell reload not to eliminate the frame pointer. */
917 }
918 }
923 /* On the SPARC, the return address is not in the frame, it is in a
924 register. There is no way to access it off of the current frame
925 pointer, but it can be accessed off the previous frame pointer by
926 reading the value from the register window save area. */
928 count--;
930 /* Scan back COUNT frames to the specified frame. */
932 {
933 /* Assume the dynamic chain pointer is in the word that the
934 frame address points to, unless otherwise specified. */
939 }
941 /* For __builtin_frame_address, return what we've got. But, on
942 the SPARC for example, we may have to add a bias. */
946 /* For __builtin_return_address, get the return address from that frame. */
947 #ifdef RETURN_ADDR_RTX
949 #else
953 #endif
955 }
957 /* Alias set used for setjmp buffer. */
960 /* Construct the leading half of a __builtin_setjmp call. Control will
961 return to RECEIVER_LABEL. This is also called directly by the SJLJ
962 exception handling code. */
964 void
966 {
968 rtx stack_save;
969 rtx mem;
978 /* We store the frame pointer and the address of receiver_label in
979 the buffer and use the rest of it for the stack save area, which
980 is machine-dependent. */
999 /* If there is further processing to do, do it. */
1003 /* We have a nonlocal label. */
1005 }
1007 /* Construct the trailing part of a __builtin_setjmp call. This is
1008 also called directly by the SJLJ exception handling code.
1009 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
1011 void
1013 {
1014 rtx chain;
1016 /* Mark the FP as used when we get here, so we have to make sure it's
1017 marked as used by this function. */
1020 /* Mark the static chain as clobbered here so life information
1021 doesn't get messed up for it. */
1026 /* Now put in the code to restore the frame pointer, and argument
1027 pointer, if needed. */
1029 {
1030 /* First adjust our frame pointer to its actual value. It was
1031 previously set to the start of the virtual area corresponding to
1032 the stacked variables when we branched here and now needs to be
1033 adjusted to the actual hardware fp value.
1035 Assignments to virtual registers are converted by
1036 instantiate_virtual_regs into the corresponding assignment
1037 to the underlying register (fp in this case) that makes
1038 the original assignment true.
1039 So the following insn will actually be decrementing fp by
1040 TARGET_STARTING_FRAME_OFFSET. */
1043 /* Restoring the frame pointer also modifies the hard frame pointer.
1044 Mark it used (so that the previous assignment remains live once
1045 the frame pointer is eliminated) and clobbered (to represent the
1046 implicit update from the assignment). */
1049 }
1052 {
1053 /* If the argument pointer can be eliminated in favor of the
1054 frame pointer, we don't need to restore it. We assume here
1055 that if such an elimination is present, it can always be used.
1056 This is the case on all known machines; if we don't make this
1057 assumption, we do unnecessary saving on many machines. */
1067 {
1068 /* Now restore our arg pointer from the address at which it
1069 was saved in our stack frame. */
1072 }
1073 }
1079 else
1082 /* We must not allow the code we just generated to be reordered by
1083 scheduling. Specifically, the update of the frame pointer must
1084 happen immediately, not later. */
1086 }
1088 /* __builtin_longjmp is passed a pointer to an array of five words (not
1089 all will be used on all machines). It operates similarly to the C
1090 library function of the same name, but is more efficient. Much of
1091 the code below is copied from the handling of non-local gotos. */
1093 static void
1095 {
1100 /* DRAP is needed for stack realign if longjmp is expanded to current
1101 function */
1112 /* We require that the user must pass a second argument of 1, because
1113 that is what builtin_setjmp will return. */
1119 else
1120 {
1131 /* Pick up FP, label, and SP from the block and jump. This code is
1132 from expand_goto in stmt.c; see there for detailed comments. */
1134 /* We have to pass a value to the nonlocal_goto pattern that will
1135 get copied into the static_chain pointer, but it does not matter
1136 what that value is, because builtin_setjmp does not use it. */
1138 else
1139 {
1145 /* Restore the frame pointer and stack pointer. We must use a
1146 temporary since the setjmp buffer may be a local. */
1154 }
1155 }
1157 /* Search backwards and mark the jump insn as a non-local goto.
1158 Note that this precludes the use of __builtin_longjmp to a
1159 __builtin_setjmp target in the same function. However, we've
1160 already cautioned the user that these functions are for
1161 internal exception handling use only. */
1163 {
1167 {
1170 }
1173 }
1174 }
1178 {
1180 }
1182 /* This function validates the types of a function call argument list
1183 against a specified list of tree_codes. If the last specifier is a 0,
1184 that represents an ellipsis, otherwise the last specifier must be a
1185 VOID_TYPE. */
1187 static bool
1189 {
1193 const_call_expr_arg_iterator iter;
1194 const_tree arg;
1199 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1204 {
1208 {
1210 /* This signifies an ellipses, any further arguments are all ok. */
1214 /* This signifies an endlink, if no arguments remain, return
1215 true, otherwise return false. */
1219 /* The actual argument must be nonnull when either the whole
1220 called function has been declared nonnull, or when the formal
1221 argument corresponding to the actual argument has been. */
1224 {
1229 }
1230 /* FALLTHRU */
1232 /* If no parameters remain or the parameter's code does not
1233 match the specified code, return false. Otherwise continue
1234 checking any remaining arguments. */
1239 }
1240 }
1242 /* We need gotos here since we can only have one VA_CLOSE in a
1243 function. */
1244 end: ;
1250 }
1252 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1253 and the address of the save area. */
1255 static rtx
1257 {
1272 /* Copy the address of the save location to a register just in case it was
1273 based on the frame pointer. */
1282 /* ??? We no longer need to pass the static chain value, afaik. */
1285 else
1286 {
1292 /* Restore the frame pointer and stack pointer. We must use a
1293 temporary since the setjmp buffer may be a local. */
1298 /* USE of hard_frame_pointer_rtx added for consistency;
1299 not clear if really needed. */
1303 /* If the architecture is using a GP register, we must
1304 conservatively assume that the target function makes use of it.
1305 The prologue of functions with nonlocal gotos must therefore
1306 initialize the GP register to the appropriate value, and we
1307 must then make sure that this value is live at the point
1308 of the jump. (Note that this doesn't necessarily apply
1309 to targets with a nonlocal_goto pattern; they are free
1310 to implement it in their own way. Note also that this is
1311 a no-op if the GP register is a global invariant.) */
1317 }
1319 /* Search backwards to the jump insn and mark it as a
1320 non-local goto. */
1322 {
1324 {
1327 }
1330 }
1333 }
1335 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1336 (not all will be used on all machines) that was passed to __builtin_setjmp.
1337 It updates the stack pointer in that block to the current value. This is
1338 also called directly by the SJLJ exception handling code. */
1340 void
1342 {
1345 rtx stack_save
1347 memory_address
1353 }
1355 /* Expand a call to __builtin_prefetch. For a target that does not support
1356 data prefetch, evaluate the memory address argument in case it has side
1357 effects. */
1359 static void
1361 {
1371 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1372 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1373 locality). */
1377 else
1381 else
1384 /* Argument 0 is an address. */
1387 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1389 {
1392 }
1394 /* Argument 1 must be either zero or one. */
1396 {
1400 }
1402 /* Argument 2 (locality) must be a compile-time constant int. */
1404 {
1407 }
1409 /* Argument 2 must be 0, 1, 2, or 3. */
1411 {
1414 }
1417 {
1425 }
1427 /* Don't do anything with direct references to volatile memory, but
1428 generate code to handle other side effects. */
1431 }
1433 /* Get a MEM rtx for expression EXP which is the address of an operand
1434 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1435 the maximum length of the block of memory that might be accessed or
1436 NULL if unknown. */
1438 static rtx
1440 {
1444 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1445 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1452 /* Get an expression we can use to find the attributes to assign to MEM.
1453 First remove any nops. */
1458 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1459 (as builtin stringops may alias with anything). */
1466 /* If the MEM_REF has no acceptable address, try to get the base object
1467 from the original address we got, and build an all-aliasing
1468 unknown-sized access to that one. */
1474 {
1479 size_zero_node,
1480 NULL)),
1483 }
1486 }
1487 \f
1488 /* Built-in functions to perform an untyped call and return. */
1490 #define apply_args_mode \
1491 (this_target_builtins->x_apply_args_mode)
1492 #define apply_result_mode \
1493 (this_target_builtins->x_apply_result_mode)
1495 /* Return the size required for the block returned by __builtin_apply_args,
1496 and initialize apply_args_mode. */
1498 static int
1500 {
1505 /* The values computed by this function never change. */
1507 {
1508 /* The first value is the incoming arg-pointer. */
1511 /* The second value is the structure value address unless this is
1512 passed as an "invisible" first argument. */
1518 {
1528 }
1529 else
1530 {
1532 }
1533 }
1535 }
1537 /* Return the size required for the block returned by __builtin_apply,
1538 and initialize apply_result_mode. */
1540 static int
1542 {
1546 /* The values computed by this function never change. */
1548 {
1553 {
1563 }
1564 else
1567 /* Allow targets that use untyped_call and untyped_return to override
1568 the size so that machine-specific information can be stored here. */
1569 #ifdef APPLY_RESULT_SIZE
1571 #endif
1572 }
1574 }
1576 /* Create a vector describing the result block RESULT. If SAVEP is true,
1577 the result block is used to save the values; otherwise it is used to
1578 restore the values. */
1580 static rtx
1582 {
1584 fixed_size_mode mode;
1591 {
1601 }
1603 }
1605 /* Save the state required to perform an untyped call with the same
1606 arguments as were passed to the current function. */
1608 static rtx
1610 {
1613 fixed_size_mode mode;
1614 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1616 /* Create a block where the arg-pointer, structure value address,
1617 and argument registers can be saved. */
1620 /* Walk past the arg-pointer and structure value address. */
1625 /* Save each register used in calling a function to the block. */
1628 {
1637 }
1639 /* Save the arg pointer to the block. */
1641 /* We need the pointer as the caller actually passed them to us, not
1642 as we might have pretended they were passed. Make sure it's a valid
1643 operand, as emit_move_insn isn't expected to handle a PLUS. */
1645 tem
1648 NULL_RTX);
1653 /* Save the structure value address unless this is passed as an
1654 "invisible" first argument. */
1656 {
1660 }
1662 /* Return the address of the block. */
1664 }
1666 /* __builtin_apply_args returns block of memory allocated on
1667 the stack into which is stored the arg pointer, structure
1668 value address, static chain, and all the registers that might
1669 possibly be used in performing a function call. The code is
1670 moved to the start of the function so the incoming values are
1671 saved. */
1673 static rtx
1675 {
1676 /* Don't do __builtin_apply_args more than once in a function.
1677 Save the result of the first call and reuse it. */
1680 {
1681 /* When this function is called, it means that registers must be
1682 saved on entry to this function. So we migrate the
1683 call to the first insn of this function. */
1684 rtx temp;
1693 /* Put the insns after the NOTE that starts the function.
1694 If this is inside a start_sequence, make the outer-level insn
1695 chain current, so the code is placed at the start of the
1696 function. If internal_arg_pointer is a non-virtual pseudo,
1697 it needs to be placed after the function that initializes
1698 that pseudo. */
1703 else
1707 }
1708 }
1710 /* Perform an untyped call and save the state required to perform an
1711 untyped return of whatever value was returned by the given function. */
1713 static rtx
1715 {
1717 fixed_size_mode mode;
1726 /* Create a block where the return registers can be saved. */
1729 /* Fetch the arg pointer from the ARGUMENTS block. */
1736 /* Push a new argument block and copy the arguments. Do not allow
1737 the (potential) memcpy call below to interfere with our stack
1738 manipulations. */
1740 NO_DEFER_POP;
1742 /* Save the stack with nonlocal if available. */
1745 else
1748 /* Allocate a block of memory onto the stack and copy the memory
1749 arguments to the outgoing arguments address. We can pass TRUE
1750 as the 4th argument because we just saved the stack pointer
1751 and will restore it right after the call. */
1754 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1755 may have already set current_function_calls_alloca to true.
1756 current_function_calls_alloca won't be set if argsize is zero,
1757 so we have to guarantee need_drap is true here. */
1763 {
1766 else
1768 }
1775 /* Refer to the argument block. */
1780 /* Walk past the arg-pointer and structure value address. */
1785 /* Restore each of the registers previously saved. Make USE insns
1786 for each of these registers for use in making the call. */
1789 {
1797 }
1799 /* Restore the structure value address unless this is passed as an
1800 "invisible" first argument. */
1803 {
1810 }
1812 /* All arguments and registers used for the call are set up by now! */
1815 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1816 and we don't want to load it into a register as an optimization,
1817 because prepare_call_address already did it if it should be done. */
1821 /* Generate the actual call instruction and save the return value. */
1823 {
1827 }
1829 {
1832 /* Locate the unique return register. It is not possible to
1833 express a call that sets more than one return register using
1834 call_value; use untyped_call for that. In fact, untyped_call
1835 only needs to save the return registers in the given block. */
1838 {
1842 }
1849 }
1850 else
1853 /* Find the CALL insn we just emitted, and attach the register usage
1854 information. */
1858 /* Restore the stack. */
1861 else
1865 OK_DEFER_POP;
1867 /* Return the address of the result block. */
1870 }
1872 /* Perform an untyped return. */
1874 static void
1876 {
1878 fixed_size_mode mode;
1879 rtx reg;
1888 {
1893 }
1895 /* Restore the return value and note that each value is used. */
1899 {
1911 }
1913 /* Put the USE insns before the return. */
1916 /* Return whatever values was restored by jumping directly to the end
1917 of the function. */
1919 }
1921 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1923 static enum type_class
1925 {
1927 {
1946 }
1947 }
1949 /* Expand a call EXP to __builtin_classify_type. */
1951 static rtx
1953 {
1957 }
1959 /* This helper macro, meant to be used in mathfn_built_in below, determines
1960 which among a set of builtin math functions is appropriate for a given type
1961 mode. The `F' (float) and `L' (long double) are automatically generated
1962 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1963 types, there are additional types that are considered with 'F32', 'F64',
1964 'F128', etc. suffixes. */
1965 #define CASE_MATHFN(MATHFN) \
1966 CASE_CFN_##MATHFN: \
1967 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1968 fcodel = BUILT_IN_##MATHFN##L ; break;
1969 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1970 types. */
1971 #define CASE_MATHFN_FLOATN(MATHFN) \
1972 CASE_CFN_##MATHFN: \
1973 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1974 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1975 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1976 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1977 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1978 break;
1979 /* Similar to above, but appends _R after any F/L suffix. */
1980 #define CASE_MATHFN_REENT(MATHFN) \
1981 case CFN_BUILT_IN_##MATHFN##_R: \
1982 case CFN_BUILT_IN_##MATHFN##F_R: \
1983 case CFN_BUILT_IN_##MATHFN##L_R: \
1984 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1985 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1987 /* Return a function equivalent to FN but operating on floating-point
1988 values of type TYPE, or END_BUILTINS if no such function exists.
1989 This is purely an operation on function codes; it does not guarantee
1990 that the target actually has an implementation of the function. */
1992 static built_in_function
1994 {
1995 tree mtype;
2006 {
2097 }
2120 else
2122 }
2124 /* Return mathematic function equivalent to FN but operating directly on TYPE,
2125 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2126 otherwise use the explicit declaration. If we can't do the conversion,
2127 return null. */
2129 static tree
2131 {
2140 }
2142 /* Like mathfn_built_in_1, but always use the implicit array. */
2144 tree
2146 {
2148 }
2150 /* Like mathfn_built_in_1, but take a built_in_function and
2151 always use the implicit array. */
2153 tree
2155 {
2157 }
2159 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2160 return its code, otherwise return IFN_LAST. Note that this function
2161 only tests whether the function is defined in internals.def, not whether
2162 it is actually available on the target. */
2164 internal_fn
2166 {
2170 {
2171 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2172 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2173 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2174 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2175 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2176 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2177 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2194 }
2195 }
2197 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2198 on the current target by a call to an internal function, return the
2199 code of that internal function, otherwise return IFN_LAST. The caller
2200 is responsible for ensuring that any side-effects of the built-in
2201 call are dealt with correctly. E.g. if CALL sets errno, the caller
2202 must decide that the errno result isn't needed or make it available
2203 in some other way. */
2205 internal_fn
2207 {
2209 {
2212 {
2217 }
2218 }
2220 }
2222 /* Expand a call to the builtin trinary math functions (fma).
2223 Return NULL_RTX if a normal call should be emitted rather than expanding the
2224 function in-line. EXP is the expression that is a call to the builtin
2225 function; if convenient, the result should be placed in TARGET.
2226 SUBTARGET may be used as the target for computing one of EXP's
2227 operands. */
2229 static rtx
2231 {
2232 optab builtin_optab;
2237 machine_mode mode;
2247 {
2253 }
2255 /* Make a suitable register to place result in. */
2258 /* Before working hard, check whether the instruction is available. */
2264 /* Always stabilize the argument list. */
2275 /* Compute into RESULT.
2276 Set RESULT to wherever the result comes back. */
2280 /* If we were unable to expand via the builtin, stop the sequence
2281 (without outputting the insns) and call to the library function
2282 with the stabilized argument list. */
2284 {
2287 }
2289 /* Output the entire sequence. */
2295 }
2297 /* Expand a call to the builtin sin and cos math functions.
2298 Return NULL_RTX if a normal call should be emitted rather than expanding the
2299 function in-line. EXP is the expression that is a call to the builtin
2300 function; if convenient, the result should be placed in TARGET.
2301 SUBTARGET may be used as the target for computing one of EXP's
2302 operands. */
2304 static rtx
2306 {
2307 optab builtin_optab;
2308 rtx op0;
2311 machine_mode mode;
2312 tree arg;
2320 {
2326 }
2328 /* Make a suitable register to place result in. */
2331 /* Check if sincos insn is available, otherwise fallback
2332 to sin or cos insn. */
2335 {
2342 }
2344 /* Before working hard, check whether the instruction is available. */
2346 {
2349 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2350 need to expand the argument again. This way, we will not perform
2351 side-effects more the once. */
2358 /* Compute into RESULT.
2359 Set RESULT to wherever the result comes back. */
2361 {
2365 {
2374 }
2376 }
2377 else
2381 {
2382 /* Output the entire sequence. */
2387 }
2389 /* If we were unable to expand via the builtin, stop the sequence
2390 (without outputting the insns) and call to the library function
2391 with the stabilized argument list. */
2393 }
2396 }
2398 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2399 return an RTL instruction code that implements the functionality.
2400 If that isn't possible or available return CODE_FOR_nothing. */
2402 static enum insn_code
2404 {
2407 machine_mode mode;
2410 {
2424 /* These builtins have no optabs (yet). */
2428 }
2430 /* There's no easy way to detect the case we need to set EDOM. */
2434 /* Optab mode depends on the mode of the input argument. */
2440 }
2442 /* Expand a call to one of the builtin math functions that operate on
2443 floating point argument and output an integer result (ilogb, isinf,
2444 isnan, etc).
2445 Return 0 if a normal call should be emitted rather than expanding the
2446 function in-line. EXP is the expression that is a call to the builtin
2447 function; if convenient, the result should be placed in TARGET. */
2449 static rtx
2451 {
2453 rtx op0;
2455 machine_mode mode;
2456 tree arg;
2466 {
2471 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2472 need to expand the argument again. This way, we will not perform
2473 side-effects more the once. */
2488 }
2491 }
2493 /* Expand a call to the builtin sincos math function.
2494 Return NULL_RTX if a normal call should be emitted rather than expanding the
2495 function in-line. EXP is the expression that is a call to the builtin
2496 function. */
2498 static rtx
2500 {
2502 machine_mode mode;
2516 /* Make a suitable register to place result in. */
2519 /* Check if sincos insn is available, otherwise emit the call. */
2534 /* Compute into target1 and target2.
2535 Set TARGET to wherever the result comes back. */
2539 /* Move target1 and target2 to the memory locations indicated
2540 by op1 and op2. */
2545 }
2547 /* Expand a call to the internal cexpi builtin to the sincos math function.
2548 EXP is the expression that is a call to the builtin function; if convenient,
2549 the result should be placed in TARGET. */
2551 static rtx
2553 {
2556 machine_mode mode;
2567 /* Try expanding via a sincos optab, fall back to emitting a libcall
2568 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2569 is only generated from sincos, cexp or if we have either of them. */
2571 {
2577 /* Compute into op1 and op2. */
2579 }
2581 {
2592 else
2602 /* Make sure not to fold the sincos call again. */
2606 }
2607 else
2608 {
2618 else
2621 /* If we don't have a decl for cexp create one. This is the
2622 friendliest fallback if the user calls __builtin_cexpi
2623 without full target C99 function support. */
2625 {
2626 tree fntype;
2638 }
2643 /* Make sure not to fold the cexp call again. */
2647 }
2649 /* Now build the proper return type. */
2654 }
2656 /* Conveniently construct a function call expression. FNDECL names the
2657 function to be called, N is the number of arguments, and the "..."
2658 parameters are the argument expressions. Unlike build_call_exr
2659 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2661 static tree
2663 {
2673 }
2675 /* Expand a call to one of the builtin rounding functions gcc defines
2676 as an extension (lfloor and lceil). As these are gcc extensions we
2677 do not need to worry about setting errno to EDOM.
2678 If expanding via optab fails, lower expression to (int)(floor(x)).
2679 EXP is the expression that is a call to the builtin function;
2680 if convenient, the result should be placed in TARGET. */
2682 static rtx
2684 {
2685 convert_optab builtin_optab;
2690 tree fallback_fndecl;
2691 machine_mode mode;
2692 tree arg;
2700 {
2717 }
2719 /* Make a suitable register to place result in. */
2724 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2725 need to expand the argument again. This way, we will not perform
2726 side-effects more the once. */
2733 /* Compute into TARGET. */
2735 {
2736 /* Output the entire sequence. */
2741 }
2743 /* If we were unable to expand via the builtin, stop the sequence
2744 (without outputting the insns). */
2747 /* Fall back to floating point rounding optab. */
2750 /* For non-C99 targets we may end up without a fallback fndecl here
2751 if the user called __builtin_lfloor directly. In this case emit
2752 a call to the floor/ceil variants nevertheless. This should result
2753 in the best user experience for not full C99 targets. */
2755 {
2756 tree fntype;
2760 {
2793 }
2798 }
2805 /* Truncate the result of floating point optab to integer
2806 via expand_fix (). */
2811 }
2813 /* Expand a call to one of the builtin math functions doing integer
2814 conversion (lrint).
2815 Return 0 if a normal call should be emitted rather than expanding the
2816 function in-line. EXP is the expression that is a call to the builtin
2817 function; if convenient, the result should be placed in TARGET. */
2819 static rtx
2821 {
2822 convert_optab builtin_optab;
2823 rtx op0;
2826 tree arg;
2827 machine_mode mode;
2836 {
2855 }
2857 /* There's no easy way to detect the case we need to set EDOM. */
2861 /* Make a suitable register to place result in. */
2864 /* There's no easy way to detect the case we need to set EDOM. */
2866 {
2869 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2870 need to expand the argument again. This way, we will not perform
2871 side-effects more the once. */
2879 {
2880 /* Output the entire sequence. */
2885 }
2887 /* If we were unable to expand via the builtin, stop the sequence
2888 (without outputting the insns) and call to the library function
2889 with the stabilized argument list. */
2891 }
2894 {
2895 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2896 targets, (int) round (x) should never be transformed into
2897 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2898 a call to lround in the hope that the target provides at least some
2899 C99 functions. This should result in the best user experience for
2900 not full C99 targets. */
2901 tree fallback_fndecl = mathfn_built_in_1
2910 }
2913 }
2915 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2916 a normal call should be emitted rather than expanding the function
2917 in-line. EXP is the expression that is a call to the builtin
2918 function; if convenient, the result should be placed in TARGET. */
2920 static rtx
2922 {
2925 machine_mode mode;
2926 machine_mode mode2;
2935 /* Emit a libcall to libgcc. */
2937 /* Mode of the 2nd argument must match that of an int. */
2955 }
2957 /* Expand expression EXP which is a call to the strlen builtin. Return
2958 NULL_RTX if we failed and the caller should emit a normal call, otherwise
2959 try to get the result in TARGET, if convenient. */
2961 static rtx
2963 machine_mode target_mode)
2964 {
2969 rtx pat;
2970 tree len;
2972 rtx src_reg;
2974 machine_mode insn_mode;
2978 /* If the length can be computed at compile-time, return it. */
2983 /* If the length can be computed at compile-time and is constant
2984 integer, but there are side-effects in src, evaluate
2985 src for side-effects, then return len.
2986 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2987 can be optimized into: i++; x = 3; */
2990 {
2993 }
2997 /* If SRC is not a pointer type, don't do this operation inline. */
3001 /* Bail out if we can't compute strlen in the right mode. */
3003 {
3007 }
3011 /* Make a place to hold the source address. We will not expand
3012 the actual source until we are sure that the expansion will
3013 not fail -- there are trees that cannot be expanded twice. */
3016 /* Mark the beginning of the strlen sequence so we can emit the
3017 source operand later. */
3027 /* Check to see if the argument was declared attribute nonstring
3028 and if so, issue a warning since at this point it's not known
3029 to be nul-terminated. */
3032 /* Now that we are assured of success, expand the source. */
3036 {
3037 #ifdef POINTERS_EXTEND_UNSIGNED
3040 POINTERS_EXTEND_UNSIGNED);
3041 #endif
3043 }
3049 else
3052 /* Return the value in the proper mode for this function. */
3057 else
3061 }
3063 /* Expand call EXP to the strnlen built-in, returning the result
3064 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
3066 static rtx
3068 {
3085 /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
3086 so these conversions aren't necessary. */
3087 c_strlen_data lendata = { };
3093 {
3097 "%K%qD specified bound %E "
3104 {
3105 /* Clear EXACT if LEN may be less than SRC suggests,
3106 such as in
3107 strnlen (&a[i], sizeof a)
3108 where the value of i is unknown. Unless i's value is
3109 zero, the call is unsafe because the bound is greater. */
3113 }
3119 {
3120 location_t warnloc
3124 exact
3130 {
3135 }
3136 }
3143 }
3156 "%K%qD specified bound [%wu, %wu] "
3163 {
3167 }
3173 {
3174 location_t warnloc
3178 exact
3184 {
3188 }
3189 }
3199 }
3201 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3202 bytes from constant string DATA + OFFSET and return it as target
3203 constant. */
3205 static rtx
3207 scalar_int_mode mode)
3208 {
3216 }
3218 /* LEN specify length of the block of memcpy/memset operation.
3219 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3220 In some cases we can make very likely guess on max size, then we
3221 set it into PROBABLE_MAX_SIZE. */
3223 static void
3228 {
3230 {
3233 }
3234 else
3235 {
3239 /* Determine bounds from the type. */
3242 else
3247 else
3253 {
3258 }
3260 {
3261 /* Anti range 0...N lets us to determine minimal size to N+1. */
3263 {
3266 }
3267 /* Code like
3269 int n;
3270 if (n < 100)
3271 memcpy (a, b, n)
3273 Produce anti range allowing negative values of N. We still
3274 can use the information and make a guess that N is not negative.
3275 */
3278 }
3279 }
3283 }
3285 /* Try to verify that the sizes and lengths of the arguments to a string
3286 manipulation function given by EXP are within valid bounds and that
3287 the operation does not lead to buffer overflow or read past the end.
3288 Arguments other than EXP may be null. When non-null, the arguments
3289 have the following meaning:
3290 DST is the destination of a copy call or NULL otherwise.
3291 SRC is the source of a copy call or NULL otherwise.
3292 DSTWRITE is the number of bytes written into the destination obtained
3293 from the user-supplied size argument to the function (such as in
3294 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3295 MAXREAD is the user-supplied bound on the length of the source sequence
3296 (such as in strncat(d, s, N). It specifies the upper limit on the number
3297 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3298 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3299 expression EXP is a string function call (as opposed to a memory call
3300 like memcpy). As an exception, SRCSTR can also be an integer denoting
3301 the precomputed size of the source string or object (for functions like
3302 memcpy).
3303 DSTSIZE is the size of the destination object specified by the last
3304 argument to the _chk builtins, typically resulting from the expansion
3305 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3306 DSTSIZE).
3308 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3309 SIZE_MAX.
3311 If the call is successfully verified as safe return true, otherwise
3312 return false. */
3314 static bool
3317 {
3320 /* The size of the largest object is half the address space, or
3321 PTRDIFF_MAX. (This is way too permissive.) */
3324 /* Either the length of the source string for string functions or
3325 the size of the source object for raw memory functions. */
3330 /* Set to true when the exact number of bytes written by a string
3331 function like strcpy is not known and the only thing that is
3332 known is that it must be at least one (for the terminating nul). */
3335 {
3336 /* SRCSTR is normally a pointer to string but as a special case
3337 it can be an integer denoting the length of a string. */
3339 {
3340 /* Try to determine the range of lengths the source string
3341 refers to. If it can be determined and is less than
3342 the upper bound given by MAXREAD add one to it for
3343 the terminating nul. Otherwise, set it to one for
3344 the same reason, or to MAXREAD as appropriate. */
3345 c_strlen_data lendata = { };
3350 {
3353 else
3364 }
3365 else
3366 {
3369 }
3370 }
3371 else
3373 }
3376 {
3377 /* When the only available piece of data is the object size
3378 there is nothing to do. */
3382 /* Otherwise, when the length of the source sequence is known
3383 (as with strlen), set DSTWRITE to it. */
3386 }
3396 /* First check the number of bytes to be written against the maximum
3397 object size. */
3401 {
3411 "%K%qD specified size %E "
3414 else
3416 "%K%qD specified size between %E and %E "
3424 }
3426 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3427 constant, and in range of unsigned HOST_WIDE_INT. */
3430 /* Next check the number of bytes to be written against the destination
3431 object size. */
3433 {
3438 || (dstwrite
3441 {
3449 {
3450 /* This is a call to strcpy with a destination of 0 size
3451 and a source of unknown length. The call will write
3452 at least one byte past the end of the destination. */
3454 "%K%qD writing %E or more bytes into a region "
3457 }
3460 "%K%qD writing %E byte into a region "
3462 "%K%qD writing %E bytes into a region "
3466 {
3467 /* Avoid printing the upper bound if it's invalid. */
3469 "%K%qD writing %E or more bytes into a region "
3472 }
3473 else
3475 "%K%qD writing between %E and %E bytes into "
3478 dstsize);
3480 /* Return error when an overflow has been detected. */
3482 }
3483 }
3485 /* Check the maximum length of the source sequence against the size
3486 of the destination object if known, or against the maximum size
3487 of an object. */
3489 {
3492 /* Use the lower end for MAXREAD from now on. */
3497 {
3502 {
3506 /* Warn about crazy big sizes first since that's more
3507 likely to be meaningful than saying that the bound
3508 is greater than the object size if both are big. */
3511 "%K%qD specified bound %E "
3515 else
3517 "%K%qD specified bound between %E and %E "
3523 }
3526 {
3532 "%K%qD specified bound %E "
3536 else
3538 "%K%qD specified bound between %E and %E "
3543 }
3544 }
3545 }
3547 /* Check for reading past the end of SRC. */
3552 {
3564 {
3565 /* Avoid printing the upper bound if it's invalid. */
3567 "%K%qD reading %E or more bytes from a region "
3570 }
3571 else
3573 "%K%qD reading between %E and %E bytes from a region "
3577 }
3580 }
3582 /* Helper to compute the size of the object referenced by the DEST
3583 expression which must have pointer type, using Object Size type
3584 OSTYPE (only the least significant 2 bits are used). Return
3585 an estimate of the size of the object if successful or NULL when
3586 the size cannot be determined. When the referenced object involves
3587 a non-constant offset in some range the returned value represents
3588 the largest size given the smallest non-negative offset in the
3589 range. The function is intended for diagnostics and should not
3590 be used to influence code generation or optimization. */
3592 tree
3594 {
3597 /* Only the two least significant bits are meaningful. */
3604 {
3613 {
3614 /* compute_builtin_object_size fails for addresses with
3615 non-constant offsets. Try to determine the range of
3616 such an offset here and use it to adjust the constant
3617 size. */
3620 {
3622 {
3626 /* Ignore negative offsets for now. For others,
3627 use the lower bound as the most optimistic
3628 estimate of the (remaining) size. */
3630 ;
3634 else
3636 }
3637 }
3640 {
3645 {
3647 {
3650 /* Ignore negative offsets for now. For others,
3651 use the lower bound as the most optimistic
3652 estimate of the (remaining)size. */
3655 ;
3659 else
3661 }
3662 }
3663 }
3664 }
3667 }
3669 /* Unless computing the largest size (for memcpy and other raw memory
3670 functions), try to determine the size of the object from its type. */
3685 {
3686 /* Return the constant size unless it's zero (that's a zero-length
3687 array likely at the end of a struct). */
3692 }
3695 }
3697 /* Helper to determine and check the sizes of the source and the destination
3698 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3699 call expression, DEST is the destination argument, SRC is the source
3700 argument or null, and LEN is the number of bytes. Use Object Size type-0
3701 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3702 (no overflow or invalid sizes), false otherwise. */
3704 static bool
3706 {
3707 /* For functions like memset and memcpy that operate on raw memory
3708 try to determine the size of the largest source and destination
3709 object using type-0 Object Size regardless of the object size
3710 type specified by the option. */
3716 }
3718 /* Validate memchr arguments without performing any expansion.
3719 Return NULL_RTX. */
3721 static rtx
3723 {
3731 /* Diagnose calls where the specified length exceeds the size
3732 of the object. */
3734 {
3738 }
3741 }
3743 /* Expand a call EXP to the memcpy builtin.
3744 Return NULL_RTX if we failed, the caller should emit a normal call,
3745 otherwise try to get the result in TARGET, if convenient (and in
3746 mode MODE if that's convenient). */
3748 static rtx
3750 {
3763 }
3765 /* Check a call EXP to the memmove built-in for validity.
3766 Return NULL_RTX on both success and failure. */
3768 static rtx
3770 {
3782 }
3784 /* Expand a call EXP to the mempcpy builtin.
3785 Return NULL_RTX if we failed; the caller should emit a normal call,
3786 otherwise try to get the result in TARGET, if convenient (and in
3787 mode MODE if that's convenient). */
3789 static rtx
3791 {
3800 /* Policy does not generally allow using compute_objsize (which
3801 is used internally by check_memop_size) to change code generation
3802 or drive optimization decisions.
3804 In this instance it is safe because the code we generate has
3805 the same semantics regardless of the return value of
3806 check_memop_sizes. Exactly the same amount of data is copied
3807 and the return value is exactly the same in both cases.
3809 Furthermore, check_memop_size always uses mode 0 for the call to
3810 compute_objsize, so the imprecise nature of compute_objsize is
3811 avoided. */
3813 /* Avoid expanding mempcpy into memcpy when the call is determined
3814 to overflow the buffer. This also prevents the same overflow
3815 from being diagnosed again when expanding memcpy. */
3821 }
3823 /* Helper function to do the actual work for expand of memory copy family
3824 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3825 of memory from SRC to DEST and assign to TARGET if convenient. Return
3826 value is based on RETMODE argument. */
3828 static rtx
3831 {
3844 /* If DEST is not a pointer type, call the normal function. */
3848 /* If either SRC is not a pointer type, don't do this
3849 operation in-line. */
3866 /* If SRC is a string constant and block move would be done
3867 by pieces, we can avoid loading the string from memory
3868 and only stored the computed constants. */
3875 {
3877 builtin_memcpy_read_str,
3883 }
3888 /* Copy word part most expediently. */
3903 /* Bail out when a mempcpy call would be expanded as libcall and when
3904 we have a target that provides a fast implementation
3905 of mempcpy routine. */
3913 {
3916 }
3919 {
3921 /* stpcpy pointer to last byte. */
3924 }
3927 }
3929 static rtx
3932 {
3934 retmode);
3935 }
3937 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3938 we failed, the caller should emit a normal call, otherwise try to
3939 get the result in TARGET, if convenient.
3940 Return value is based on RETMODE argument. */
3942 static rtx
3944 {
3946 rtx dest_mem;
3947 rtx src_mem;
3955 {
3958 }
3968 {
3970 /* movstr is supposed to set end to the address of the NUL
3971 terminator. If the caller requested a mempcpy-like return value,
3972 adjust it. */
3974 {
3978 }
3979 }
3981 }
3983 /* Do some very basic size validation of a call to the strcpy builtin
3984 given by EXP. Return NULL_RTX to have the built-in expand to a call
3985 to the library function. */
3987 static rtx
3989 {
3997 /* There is no way here to determine the length of the string in
3998 the destination to which the SRC string is being appended so
3999 just diagnose cases when the souce string is longer than
4000 the destination object. */
4005 destsize);
4008 }
4010 /* Expand expression EXP, which is a call to the strcpy builtin. Return
4011 NULL_RTX if we failed the caller should emit a normal call, otherwise
4012 try to get the result in TARGET, if convenient (and in mode MODE if that's
4013 convenient). */
4015 static rtx
4017 {
4025 {
4029 }
4032 {
4033 /* Check to see if the argument was declared attribute nonstring
4034 and if so, issue a warning since at this point it's not known
4035 to be nul-terminated. */
4039 }
4042 }
4044 /* Helper function to do the actual work for expand_builtin_strcpy. The
4045 arguments to the builtin_strcpy call DEST and SRC are broken out
4046 so that this can also be called without constructing an actual CALL_EXPR.
4047 The other arguments and return value are the same as for
4048 expand_builtin_strcpy. */
4050 static rtx
4052 {
4053 /* Detect strcpy calls with unterminated arrays.. */
4055 {
4056 /* NONSTR refers to the non-nul terminated constant array. */
4060 }
4063 }
4065 /* Expand a call EXP to the stpcpy builtin.
4066 Return NULL_RTX if we failed the caller should emit a normal call,
4067 otherwise try to get the result in TARGET, if convenient (and in
4068 mode MODE if that's convenient). */
4070 static rtx
4072 {
4083 {
4087 }
4089 /* If return value is ignored, transform stpcpy into strcpy. */
4091 {
4095 }
4096 else
4097 {
4099 rtx ret;
4101 /* Ensure we get an actual string whose length can be evaluated at
4102 compile-time, not an expression containing a string. This is
4103 because the latter will potentially produce pessimized code
4104 when used to produce the return value. */
4105 c_strlen_data lendata = { };
4123 {
4127 {
4131 {
4133 {
4136 else
4138 }
4147 }
4148 }
4149 }
4153 }
4154 }
4156 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
4157 arguments while being careful to avoid duplicate warnings (which could
4158 be issued if the expander were to expand the call, resulting in it
4159 being emitted in expand_call(). */
4161 static rtx
4163 {
4165 {
4166 /* The call has been successfully expanded. Check for nonstring
4167 arguments and issue warnings as appropriate. */
4170 }
4173 }
4175 /* Check a call EXP to the stpncpy built-in for validity.
4176 Return NULL_RTX on both success and failure. */
4178 static rtx
4180 {
4186 /* The source and destination of the call. */
4190 /* The exact number of bytes to write (not the maximum). */
4193 /* The size of the destination object. */
4199 }
4201 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4202 bytes from constant string DATA + OFFSET and return it as target
4203 constant. */
4205 rtx
4207 scalar_int_mode mode)
4208 {
4215 }
4217 /* Helper to check the sizes of sequences and the destination of calls
4218 to __builtin_strncat and __builtin___strncat_chk. Returns true on
4219 success (no overflow or invalid sizes), false otherwise. */
4221 static bool
4223 {
4228 /* Try to determine the range of lengths that the source expression
4229 refers to. */
4230 c_strlen_data lendata = { };
4233 /* Try to verify that the destination is big enough for the shortest
4234 string. */
4237 {
4238 /* If it hasn't been provided by __strncat_chk, try to determine
4239 the size of the destination object into which the source is
4240 being copied. */
4242 }
4244 /* Add one for the terminating nul. */
4247 size_one_node)
4250 /* The strncat function copies at most MAXREAD bytes and always appends
4251 the terminating nul so the specified upper bound should never be equal
4252 to (or greater than) the size of the destination. */
4255 {
4264 }
4272 /* The number of bytes to write is LEN but check_access will also
4273 check SRCLEN if LEN's value isn't known. */
4275 objsize);
4276 }
4278 /* Similar to expand_builtin_strcat, do some very basic size validation
4279 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4280 the built-in expand to a call to the library function. */
4282 static rtx
4284 {
4292 /* The upper bound on the number of bytes to write. */
4294 /* The length of the source sequence. */
4297 /* Try to determine the range of lengths that the source expression
4298 refers to. Since the lengths are only used for warning and not
4299 for code generation disable strict mode below. */
4302 {
4303 c_strlen_data lendata = { };
4306 }
4308 /* Try to verify that the destination is big enough for the shortest
4309 string. First try to determine the size of the destination object
4310 into which the source is being copied. */
4313 /* Add one for the terminating nul. */
4314 tree srclen = (maxlen
4316 size_one_node)
4319 /* The strncat function copies at most MAXREAD bytes and always appends
4320 the terminating nul so the specified upper bound should never be equal
4321 to (or greater than) the size of the destination. */
4324 {
4333 }
4341 /* The number of bytes to write is SRCLEN. */
4345 }
4347 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4348 NULL_RTX if we failed the caller should emit a normal call. */
4350 static rtx
4352 {
4357 {
4360 /* The number of bytes to write (not the maximum). */
4362 /* The length of the source sequence. */
4366 {
4370 /* The number of bytes to write is LEN but check_access will also
4371 check SLEN if LEN's value isn't known. */
4373 destsize);
4374 }
4376 /* We must be passed a constant len and src parameter. */
4382 /* We're required to pad with trailing zeros if the requested
4383 len is greater than strlen(s2)+1. In that case try to
4384 use store_by_pieces, if it fails, punt. */
4386 {
4389 rtx dest_mem;
4393 builtin_strncpy_read_str,
4400 builtin_strncpy_read_str,
4402 RETURN_BEGIN);
4406 }
4407 }
4409 }
4411 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4412 bytes from constant string DATA + OFFSET and return it as target
4413 constant. */
4415 rtx
4417 scalar_int_mode mode)
4418 {
4425 }
4427 /* Callback routine for store_by_pieces. Return the RTL of a register
4428 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4429 char value given in the RTL register data. For example, if mode is
4430 4 bytes wide, return the RTL for 0x01010101*data. */
4432 static rtx
4434 scalar_int_mode mode)
4435 {
4451 }
4453 /* Expand expression EXP, which is a call to the memset builtin. Return
4454 NULL_RTX if we failed the caller should emit a normal call, otherwise
4455 try to get the result in TARGET, if convenient (and in mode MODE if that's
4456 convenient). */
4458 static rtx
4460 {
4472 }
4474 /* Helper function to do the actual work for expand_builtin_memset. The
4475 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4476 so that this can also be called without constructing an actual CALL_EXPR.
4477 The other arguments and return value are the same as for
4478 expand_builtin_memset. */
4480 static rtx
4483 {
4486 machine_mode val_mode;
4498 /* If DEST is not a pointer type, don't do this operation in-line. */
4509 /* If the LEN parameter is zero, return DEST. */
4511 {
4512 /* Evaluate and ignore VAL in case it has side-effects. */
4515 }
4517 /* Stabilize the arguments in case we fail. */
4529 {
4530 rtx val_rtx;
4535 /* Assume that we can memset by pieces if we can store
4536 * the coefficients by pieces (in the required modes).
4537 * We can't pass builtin_memset_gen_str as that emits RTL. */
4543 {
4548 }
4552 probable_max_size))
4558 }
4564 {
4571 RETURN_BEGIN);
4576 probable_max_size))
4582 }
4590 probable_max_size);
4593 {
4596 }
4600 do_libcall:
4609 else
4614 }
4616 /* Expand expression EXP, which is a call to the bzero builtin. Return
4617 NULL_RTX if we failed the caller should emit a normal call. */
4619 static rtx
4621 {
4630 /* New argument list transforming bzero(ptr x, int y) to
4631 memset(ptr x, int 0, size_t y). This is done this way
4632 so that if it isn't expanded inline, we fallback to
4633 calling bzero instead of memset. */
4641 }
4643 /* Try to expand cmpstr operation ICODE with the given operands.
4644 Return the result rtx on success, otherwise return null. */
4646 static rtx
4648 HOST_WIDE_INT align)
4649 {
4663 }
4665 /* Expand expression EXP, which is a call to the memcmp built-in function.
4666 Return NULL_RTX if we failed and the caller should emit a normal call,
4667 otherwise try to get the result in TARGET, if convenient.
4668 RESULT_EQ is true if we can relax the returned value to be either zero
4669 or nonzero, without caring about the sign. */
4671 static rtx
4673 {
4684 /* Diagnose calls where the specified length exceeds the size of either
4685 object. */
4691 {
4696 }
4698 /* If the specified length exceeds the size of either object,
4699 call the function. */
4703 /* Due to the performance benefit, always inline the calls first
4704 when result_eq is false. */
4708 {
4712 }
4720 /* If we don't have POINTER_TYPE, call the function. */
4728 /* Set MEM_SIZE as appropriate. */
4730 {
4733 }
4739 {
4743 }
4745 /* If SRC is a string constant and block move would be done
4746 by pieces, we can avoid loading the string from memory
4747 and only stored the computed constants. */
4759 {
4760 /* Return the value in the proper mode for this function. */
4765 {
4768 }
4771 }
4774 }
4776 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4777 if we failed the caller should emit a normal call, otherwise try to get
4778 the result in TARGET, if convenient. */
4780 static rtx
4782 {
4786 /* Due to the performance benefit, always inline the calls first. */
4803 /* If we don't have POINTER_TYPE, call the function. */
4807 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4814 /* Try to call cmpstrsi. */
4819 /* Try to determine at least one length and call cmpstrnsi. */
4821 {
4822 tree len;
4823 rtx arg3_rtx;
4833 /* If we don't have a constant length for the first, use the length
4834 of the second, if we know it. We don't require a constant for
4835 this case; some cost analysis could be done if both are available
4836 but neither is constant. For now, assume they're equally cheap,
4837 unless one has side effects. If both strings have constant lengths,
4838 use the smaller. */
4854 else
4857 /* If both arguments have side effects, we cannot optimize. */
4859 {
4861 result = expand_cmpstrn_or_cmpmem
4864 }
4865 }
4869 {
4870 /* Check to see if the argument was declared attribute nonstring
4871 and if so, issue a warning since at this point it's not known
4872 to be nul-terminated. */
4875 /* Return the value in the proper mode for this function. */
4883 }
4885 /* Expand the library call ourselves using a stabilized argument
4886 list to avoid re-evaluating the function's arguments twice. */
4891 }
4893 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4894 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4895 the result in TARGET, if convenient. */
4897 static rtx
4899 ATTRIBUTE_UNUSED machine_mode mode)
4900 {
4905 /* Due to the performance benefit, always inline the calls first. */
4911 /* If c_strlen can determine an expression for one of the string
4912 lengths, and it doesn't have side effects, then emit cmpstrnsi
4913 using length MIN(strlen(string)+1, arg3). */
4918 tree len;
4939 /* If we don't have a constant length for the first, use the length
4940 of the second, if we know it. If neither string is constant length,
4941 use the given length argument. We don't require a constant for
4942 this case; some cost analysis could be done if both are available
4943 but neither is constant. For now, assume they're equally cheap,
4944 unless one has side effects. If both strings have constant lengths,
4945 use the smaller. */
4963 else
4966 /* If we are not using the given length, we must incorporate it here.
4967 The actual new length parameter will be MIN(len,arg3) in this case. */
4969 {
4972 }
4982 {
4983 /* Check to see if the argument was declared attribute nonstring
4984 and if so, issue a warning since at this point it's not known
4985 to be nul-terminated. */
4988 /* Return the value in the proper mode for this function. */
4996 }
4998 /* Expand the library call ourselves using a stabilized argument
4999 list to avoid re-evaluating the function's arguments twice. */
5004 }
5006 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
5007 if that's convenient. */
5009 rtx
5011 {
5012 rtx val;
5015 /* Don't do __builtin_saveregs more than once in a function.
5016 Save the result of the first call and reuse it. */
5020 /* When this function is called, it means that registers must be
5021 saved on entry to this function. So we migrate the call to the
5022 first insn of this function. */
5026 /* Do whatever the machine needs done in this case. */
5034 /* Put the insns after the NOTE that starts the function. If this
5035 is inside a start_sequence, make the outer-level insn chain current, so
5036 the code is placed at the start of the function. */
5042 }
5044 /* Expand a call to __builtin_next_arg. */
5046 static rtx
5048 {
5049 /* Checking arguments is already done in fold_builtin_next_arg
5050 that must be called before this function. */
5055 }
5057 /* Make it easier for the backends by protecting the valist argument
5058 from multiple evaluations. */
5060 static tree
5062 {
5065 /* The current way of determining the type of valist is completely
5066 bogus. We should have the information on the va builtin instead. */
5071 {
5075 /* For this case, the backends will be expecting a pointer to
5076 vatype, but it's possible we've actually been given an array
5077 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
5078 So fix it. */
5080 {
5083 }
5084 }
5085 else
5086 {
5090 {
5096 }
5102 }
5105 }
5107 /* The "standard" definition of va_list is void*. */
5109 tree
5111 {
5113 }
5115 /* The "standard" abi va_list is va_list_type_node. */
5117 tree
5119 {
5121 }
5123 /* The "standard" type of va_list is va_list_type_node. */
5125 tree
5127 {
5134 {
5135 /* If va_list is an array type, the argument may have decayed
5136 to a pointer type, e.g. by being passed to another function.
5137 In that case, unwrap both types so that we can compare the
5138 underlying records. */
5141 {
5144 }
5145 }
5150 }
5152 /* The "standard" implementation of va_start: just assign `nextarg' to
5153 the variable. */
5155 void
5157 {
5160 }
5162 /* Expand EXP, a call to __builtin_va_start. */
5164 static rtx
5166 {
5167 rtx nextarg;
5168 tree valist;
5172 {
5175 }
5185 else
5189 }
5191 /* Expand EXP, a call to __builtin_va_end. */
5193 static rtx
5195 {
5198 /* Evaluate for side effects, if needed. I hate macros that don't
5199 do that. */
5204 }
5206 /* Expand EXP, a call to __builtin_va_copy. We do this as a
5207 builtin rather than just as an assignment in stdarg.h because of the
5208 nastiness of array-type va_list types. */
5210 static rtx
5212 {
5225 {
5229 }
5230 else
5231 {
5234 /* Evaluate to pointers. */
5243 /* "Dereference" to BLKmode memories. */
5251 /* Copy. */
5253 }
5256 }
5258 /* Expand a call to one of the builtin functions __builtin_frame_address or
5259 __builtin_return_address. */
5261 static rtx
5263 {
5264 /* The argument must be a nonnegative integer constant.
5265 It counts the number of frames to scan up the stack.
5266 The value is either the frame pointer value or the return
5267 address saved in that frame. */
5269 /* Warning about missing arg was already issued. */
5272 {
5275 }
5276 else
5277 {
5278 /* Number of frames to scan up the stack. */
5283 /* Some ports cannot access arbitrary stack frames. */
5285 {
5288 }
5291 {
5292 /* Warn since no effort is made to ensure that any frame
5293 beyond the current one exists or can be safely reached. */
5296 }
5298 /* For __builtin_frame_address, return what we've got. */
5306 }
5307 }
5309 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5310 failed and the caller should emit a normal call. */
5312 static rtx
5314 {
5315 rtx op0;
5316 rtx result;
5319 HOST_WIDE_INT max_size;
5322 bool valid_arglist
5325 VOID_TYPE)
5336 || (!alloca_for_var
5339 ))
5340 {
5341 /* -Walloca-larger-than and -Wvla-larger-than settings of
5342 less than HOST_WIDE_INT_MAX override the more general
5343 -Walloc-size-larger-than so unless either of the former
5344 options is smaller than the last one (wchich would imply
5345 that the call was already checked), check the alloca
5346 arguments for overflow. */
5350 }
5352 /* Compute the argument. */
5355 /* Compute the alignment. */
5357 ? BIGGEST_ALIGNMENT
5360 /* Compute the maximum size. */
5365 /* Allocate the desired space. If the allocation stems from the declaration
5366 of a variable-sized object, it cannot accumulate. */
5367 result
5372 }
5374 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5375 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5376 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5377 handle_builtin_stack_restore function. */
5379 static rtx
5381 {
5388 OPTAB_LIB_WIDEN);
5391 OPTAB_LIB_WIDEN);
5396 }
5398 /* Expand a call to bswap builtin in EXP.
5399 Return NULL_RTX if a normal call should be emitted rather than expanding the
5400 function in-line. If convenient, the result should be placed in TARGET.
5401 SUBTARGET may be used as the target for computing one of EXP's operands. */
5403 static rtx
5405 rtx subtarget)
5406 {
5407 tree arg;
5408 rtx op0;
5426 }
5428 /* Expand a call to a unary builtin in EXP.
5429 Return NULL_RTX if a normal call should be emitted rather than expanding the
5430 function in-line. If convenient, the result should be placed in TARGET.
5431 SUBTARGET may be used as the target for computing one of EXP's operands. */
5433 static rtx
5436 {
5437 rtx op0;
5442 /* Compute the argument. */
5444 (subtarget
5448 /* Compute op, into TARGET if possible.
5449 Set TARGET to wherever the result comes back. */
5455 }
5457 /* Expand a call to __builtin_expect. We just return our argument
5458 as the builtin_expect semantic should've been already executed by
5459 tree branch prediction pass. */
5461 static rtx
5463 {
5464 tree arg;
5471 /* When guessing was done, the hints should be already stripped away. */
5475 }
5477 /* Expand a call to __builtin_expect_with_probability. We just return our
5478 argument as the builtin_expect semantic should've been already executed by
5479 tree branch prediction pass. */
5481 static rtx
5483 {
5484 tree arg;
5491 /* When guessing was done, the hints should be already stripped away. */
5495 }
5498 /* Expand a call to __builtin_assume_aligned. We just return our first
5499 argument as the builtin_assume_aligned semantic should've been already
5500 executed by CCP. */
5502 static rtx
5504 {
5508 EXPAND_NORMAL);
5513 }
5515 void
5517 {
5519 {
5521 /* For trap insns when not accumulating outgoing args force
5522 REG_ARGS_SIZE note to prevent crossjumping of calls with
5523 different args sizes. */
5526 }
5527 else
5528 {
5532 }
5535 }
5537 /* Expand a call to __builtin_unreachable. We do nothing except emit
5538 a barrier saying that control flow will not pass here.
5540 It is the responsibility of the program being compiled to ensure
5541 that control flow does never reach __builtin_unreachable. */
5542 static void
5544 {
5546 }
5548 /* Expand EXP, a call to fabs, fabsf or fabsl.
5549 Return NULL_RTX if a normal call should be emitted rather than expanding
5550 the function inline. If convenient, the result should be placed
5551 in TARGET. SUBTARGET may be used as the target for computing
5552 the operand. */
5554 static rtx
5556 {
5557 machine_mode mode;
5558 tree arg;
5559 rtx op0;
5569 }
5571 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5572 Return NULL is a normal call should be emitted rather than expanding the
5573 function inline. If convenient, the result should be placed in TARGET.
5574 SUBTARGET may be used as the target for computing the operand. */
5576 static rtx
5578 {
5580 tree arg;
5592 }
5594 /* Expand a call to __builtin___clear_cache. */
5596 static rtx
5598 {
5600 {
5601 #ifdef CLEAR_INSN_CACHE
5602 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5603 does something. Just do the default expansion to a call to
5604 __clear_cache(). */
5606 #else
5607 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5608 does nothing. There is no need to call it. Do nothing. */
5611 }
5613 /* We have a "clear_cache" insn, and it will handle everything. */
5617 /* We must not expand to a library call. If we did, any
5618 fallback library function in libgcc that might contain a call to
5619 __builtin___clear_cache() would recurse infinitely. */
5621 {
5624 }
5627 {
5640 }
5642 }
5644 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5646 static rtx
5648 {
5651 /* If we don't need too much alignment, we'll have been guaranteed
5652 proper alignment by get_trampoline_type. */
5656 /* Round address up to desired boundary. */
5667 }
5669 static rtx
5671 {
5687 /* If ONSTACK, the TRAMP argument should be the address of a field
5688 within the local function's FRAME decl. Either way, let's see if
5689 we can fill in the MEM_ATTRs for this memory. */
5693 /* Creator of a heap trampoline is responsible for making sure the
5694 address is aligned to at least STACK_BOUNDARY. Normally malloc
5695 will ensure this anyhow. */
5698 {
5702 }
5704 /* The FUNC argument should be the address of the nested function.
5705 Extract the actual function decl to pass to the hook. */
5712 /* Generate insns to initialize the trampoline. */
5716 {
5722 }
5725 }
5727 static rtx
5729 {
5730 rtx tramp;
5741 }
5743 /* Expand a call to the builtin descriptor initialization routine.
5744 A descriptor is made up of a couple of pointers to the static
5745 chain and the code entry in this order. */
5747 static rtx
5749 {
5754 VOID_TYPE))
5768 /* Generate insns to initialize the descriptor. */
5774 }
5776 /* Expand a call to the builtin descriptor adjustment routine. */
5778 static rtx
5780 {
5781 rtx tramp;
5788 /* Unalign the descriptor to allow runtime identification. */
5793 }
5795 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5796 function. The function first checks whether the back end provides
5797 an insn to implement signbit for the respective mode. If not, it
5798 checks whether the floating point format of the value is such that
5799 the sign bit can be extracted. If that is not the case, error out.
5800 EXP is the expression that is a call to the builtin function; if
5801 convenient, the result should be placed in TARGET. */
5802 static rtx
5804 {
5806 scalar_float_mode fmode;
5808 tree arg;
5811 rtx temp;
5824 /* Expand the argument yielding a RTX expression. */
5827 /* Check if the back end provides an insn that handles signbit for the
5828 argument's mode. */
5831 {
5837 }
5839 /* For floating point formats without a sign bit, implement signbit
5840 as "ARG < 0.0". */
5843 {
5844 /* But we can't do this if the format supports signed zero. */
5850 }
5853 {
5856 }
5857 else
5858 {
5860 /* Handle targets with different FP word orders. */
5863 else
5867 }
5869 /* Force the intermediate word_mode (or narrower) result into a
5870 register. This avoids attempting to create paradoxical SUBREGs
5871 of floating point modes below. */
5874 /* If the bitpos is within the "result mode" lowpart, the operation
5875 can be implement with a single bitwise AND. Otherwise, we need
5876 a right shift and an AND. */
5879 {
5887 }
5888 else
5889 {
5890 /* Perform a logical right shift to place the signbit in the least
5891 significant bit, then truncate the result to the desired mode
5892 and mask just this bit. */
5897 }
5900 }
5902 /* Expand fork or exec calls. TARGET is the desired target of the
5903 call. EXP is the call. FN is the
5904 identificator of the actual function. IGNORE is nonzero if the
5905 value is to be ignored. */
5907 static rtx
5909 {
5911 tree call;
5913 /* If we are not profiling, just call the function. */
5917 /* Otherwise call the wrapper. This should be equivalent for the rest of
5918 compiler, so the code does not diverge, and the wrapper may run the
5919 code necessary for keeping the profiling sane. */
5922 {
5953 }
5965 }
5968 \f
5969 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5970 the pointer in these functions is void*, the tree optimizers may remove
5971 casts. The mode computed in expand_builtin isn't reliable either, due
5972 to __sync_bool_compare_and_swap.
5974 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5975 group of builtins. This gives us log2 of the mode size. */
5979 {
5980 /* The size is not negotiable, so ask not to get BLKmode in return
5981 if the target indicates that a smaller size would be better. */
5983 }
5985 /* Expand the memory expression LOC and return the appropriate memory operand
5986 for the builtin_sync operations. */
5988 static rtx
5990 {
6000 /* Note that we explicitly do not want any alias information for this
6001 memory, so that we kill all other live memories. Otherwise we don't
6002 satisfy the full barrier semantics of the intrinsic. */
6009 /* The alignment needs to be at least according to that of the mode. */
6016 }
6018 /* Make sure an argument is in the right mode.
6019 EXP is the tree argument.
6020 MODE is the mode it should be in. */
6022 static rtx
6024 {
6025 rtx val;
6026 machine_mode old_mode;
6029 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
6030 of CONST_INTs, where we know the old_mode only from the call argument. */
6037 }
6040 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
6041 EXP is the CALL_EXPR. CODE is the rtx code
6042 that corresponds to the arithmetic or logical operation from the name;
6043 an exception here is that NOT actually means NAND. TARGET is an optional
6044 place for us to store the results; AFTER is true if this is the
6045 fetch_and_xxx form. */
6047 static rtx
6050 rtx target)
6051 {
6056 {
6063 {
6092 }
6093 }
6095 /* Expand the operands. */
6100 after);
6101 }
6103 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
6104 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
6105 true if this is the boolean form. TARGET is a place for us to store the
6106 results; this is NOT optional if IS_BOOL is true. */
6108 static rtx
6111 {
6115 /* Expand the operands. */
6122 {
6125 else
6127 }
6130 MEMMODEL_SYNC_SEQ_CST))
6134 }
6136 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
6137 general form is actually an atomic exchange, and some targets only
6138 support a reduced form with the second argument being a constant 1.
6139 EXP is the CALL_EXPR; TARGET is an optional place for us to store
6140 the results. */
6142 static rtx
6144 rtx target)
6145 {
6148 /* Expand the operands. */
6153 }
6155 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
6157 static void
6159 {
6160 rtx mem;
6162 /* Expand the operands. */
6166 }
6168 /* Given an integer representing an ``enum memmodel'', verify its
6169 correctness and return the memory model enum. */
6171 static enum memmodel
6173 {
6174 rtx op;
6176 location_t loc
6179 /* If the parameter is not a constant, it's a run time value so we'll just
6180 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
6190 {
6194 }
6196 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
6198 {
6202 }
6204 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
6205 be conservative and promote consume to acquire. */
6210 }
6212 /* Expand the __atomic_exchange intrinsic:
6213 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
6214 EXP is the CALL_EXPR.
6215 TARGET is an optional place for us to store the results. */
6217 static rtx
6219 {
6228 /* Expand the operands. */
6233 }
6235 /* Expand the __atomic_compare_exchange intrinsic:
6236 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
6237 TYPE desired, BOOL weak,
6238 enum memmodel success,
6239 enum memmodel failure)
6240 EXP is the CALL_EXPR.
6241 TARGET is an optional place for us to store the results. */
6243 static rtx
6245 rtx target)
6246 {
6250 tree weak;
6252 location_t loc
6259 {
6261 "failure memory model cannot be stronger than success "
6264 }
6267 {
6269 "invalid failure memory model for "
6273 }
6279 /* Expand the operands. */
6295 /* Lest the rtl backend create a race condition with an imporoper store
6296 to memory, always create a new pseudo for OLDVAL. */
6303 /* Conditionally store back to EXPECT, lest we create a race condition
6304 with an improper store to memory. */
6305 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6306 the normal case where EXPECT is totally private, i.e. a register. At
6307 which point the store can be unconditional. */
6315 }
6317 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6318 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6319 call. The weak parameter must be dropped to match the expected parameter
6320 list and the expected argument changed from value to pointer to memory
6321 slot. */
6323 static void
6325 {
6341 /* Skip the boolean weak parameter. */
6344 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6347 built_in_function fncode
6352 fndecl);
6357 {
6364 }
6365 }
6367 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6369 void
6371 {
6377 tree lhs;
6379 location_t loc
6386 {
6388 "failure memory model cannot be stronger than success "
6391 }
6394 {
6396 "invalid failure memory model for "
6400 }
6403 {
6406 }
6408 /* Expand the operands. */
6421 {
6424 }
6428 {
6434 }
6435 }
6437 /* Expand the __atomic_load intrinsic:
6438 TYPE __atomic_load (TYPE *object, enum memmodel)
6439 EXP is the CALL_EXPR.
6440 TARGET is an optional place for us to store the results. */
6442 static rtx
6444 {
6445 rtx mem;
6450 {
6451 location_t loc
6456 }
6461 /* Expand the operand. */
6465 }
6468 /* Expand the __atomic_store intrinsic:
6469 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6470 EXP is the CALL_EXPR.
6471 TARGET is an optional place for us to store the results. */
6473 static rtx
6475 {
6482 {
6483 location_t loc
6488 }
6493 /* Expand the operands. */
6498 }
6500 /* Expand the __atomic_fetch_XXX intrinsic:
6501 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6502 EXP is the CALL_EXPR.
6503 TARGET is an optional place for us to store the results.
6504 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6505 FETCH_AFTER is true if returning the result of the operation.
6506 FETCH_AFTER is false if returning the value before the operation.
6507 IGNORE is true if the result is not used.
6508 EXT_CALL is the correct builtin for an external call if this cannot be
6509 resolved to an instruction sequence. */
6511 static rtx
6515 {
6518 tree fndecl;
6519 tree addr;
6523 /* Expand the operands. */
6527 /* Only try generating instructions if inlining is turned on. */
6529 {
6533 }
6535 /* Return if a different routine isn't needed for the library call. */
6539 /* Change the call to the specified function. */
6547 /* If we will emit code after the call, the call cannot be a tail call.
6548 If it is emitted as a tail call, a barrier is emitted after it, and
6549 then all trailing code is removed. */
6553 /* Expand the call here so we can emit trailing code. */
6556 /* Replace the original function just in case it matters. */
6559 /* Then issue the arithmetic correction to return the right result. */
6561 {
6563 {
6565 OPTAB_LIB_WIDEN);
6567 }
6568 else
6570 OPTAB_LIB_WIDEN);
6571 }
6573 }
6575 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6577 void
6579 {
6587 optab optab;
6599 {
6614 }
6617 {
6624 }
6646 {
6651 }
6652 else
6654 OPTAB_DIRECT);
6657 }
6659 /* Expand an atomic clear operation.
6660 void _atomic_clear (BOOL *obj, enum memmodel)
6661 EXP is the call expression. */
6663 static rtx
6665 {
6666 machine_mode mode;
6675 {
6676 location_t loc
6681 }
6683 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6684 Failing that, a store is issued by __atomic_store. The only way this can
6685 fail is if the bool type is larger than a word size. Unlikely, but
6686 handle it anyway for completeness. Assume a single threaded model since
6687 there is no atomic support in this case, and no barriers are required. */
6692 }
6694 /* Expand an atomic test_and_set operation.
6695 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6696 EXP is the call expression. */
6698 static rtx
6700 {
6701 rtx mem;
6703 machine_mode mode;
6710 }
6713 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6714 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6716 static tree
6718 {
6720 machine_mode mode;
6726 /* We need a corresponding integer mode for the access to be lock-free. */
6734 {
6737 /* Either this argument is null, or it's a fake pointer encoding
6738 the alignment of the object. */
6744 else
6746 }
6747 else
6748 {
6751 /* This function is usually invoked and folded immediately by the front
6752 end before anything else has a chance to look at it. The pointer
6753 parameter at this point is usually cast to a void *, so check for that
6754 and look past the cast. */
6764 /* Get the underlying type of the object. */
6767 }
6769 /* If the object has smaller alignment, the lock free routines cannot
6770 be used. */
6774 /* Check if a compare_and_swap pattern exists for the mode which represents
6775 the required size. The pattern is not allowed to fail, so the existence
6776 of the pattern indicates support is present. Also require that an
6777 atomic load exists for the required size. */
6780 else
6782 }
6784 /* Return true if the parameters to call EXP represent an object which will
6785 always generate lock free instructions. The first argument represents the
6786 size of the object, and the second parameter is a pointer to the object
6787 itself. If NULL is passed for the object, then the result is based on
6788 typical alignment for an object of the specified size. Otherwise return
6789 false. */
6791 static rtx
6793 {
6794 tree size;
6799 {
6802 }
6808 }
6810 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6811 is lock free on this architecture. */
6813 static tree
6815 {
6819 /* If it isn't always lock free, don't generate a result. */
6824 }
6826 /* Return true if the parameters to call EXP represent an object which will
6827 always generate lock free instructions. The first argument represents the
6828 size of the object, and the second parameter is a pointer to the object
6829 itself. If NULL is passed for the object, then the result is based on
6830 typical alignment for an object of the specified size. Otherwise return
6831 NULL*/
6833 static rtx
6835 {
6836 tree size;
6841 {
6844 }
6849 /* If the value is known at compile time, return the RTX for it. */
6855 }
6857 /* Expand the __atomic_thread_fence intrinsic:
6858 void __atomic_thread_fence (enum memmodel)
6859 EXP is the CALL_EXPR. */
6861 static void
6863 {
6866 }
6868 /* Expand the __atomic_signal_fence intrinsic:
6869 void __atomic_signal_fence (enum memmodel)
6870 EXP is the CALL_EXPR. */
6872 static void
6874 {
6877 }
6879 /* Expand the __sync_synchronize intrinsic. */
6881 static void
6883 {
6885 }
6887 static rtx
6889 {
6895 {
6897 /* If the target is not sutitable then create a new target. */
6905 }
6908 }
6910 static void
6912 {
6918 {
6925 }
6927 }
6929 \f
6930 /* Emit code to restore the current value of stack. */
6932 static void
6934 {
6946 }
6948 /* Emit code to save the current value of stack. */
6950 static rtx
6952 {
6957 }
6959 /* Emit code to get the openacc gang, worker or vector id or size. */
6961 static rtx
6963 {
6965 rtx fallback_retval;
6968 {
6981 }
6984 {
6987 }
6991 {
6994 }
6998 {
7006 }
7015 {
7018 }
7026 }
7028 /* Expand a string compare operation using a sequence of char comparison
7029 to get rid of the calling overhead, with result going to TARGET if
7030 that's convenient.
7032 VAR_STR is the variable string source;
7033 CONST_STR is the constant string source;
7034 LENGTH is the number of chars to compare;
7035 CONST_STR_N indicates which source string is the constant string;
7036 IS_MEMCMP indicates whether it's a memcmp or strcmp.
7038 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
7040 target = (int) (unsigned char) var_str[0]
7041 - (int) (unsigned char) const_str[0];
7042 if (target != 0)
7043 goto ne_label;
7044 ...
7045 target = (int) (unsigned char) var_str[length - 2]
7046 - (int) (unsigned char) const_str[length - 2];
7047 if (target != 0)
7048 goto ne_label;
7049 target = (int) (unsigned char) var_str[length - 1]
7050 - (int) (unsigned char) const_str[length - 1];
7051 ne_label:
7052 */
7054 static rtx
7058 {
7060 rtx var_rtx_array
7067 scalar_int_mode unit_mode
7073 {
7074 var_rtx
7088 }
7096 }
7098 /* Inline expansion a call to str(n)cmp, with result going to
7099 TARGET if that's convenient.
7100 If the call is not been inlined, return NULL_RTX. */
7101 static rtx
7103 {
7109 /* Do NOT apply this inlining expansion when optimizing for size or
7110 optimization level below 2. */
7118 /* On a target where the type of the call (int) has same or narrower presicion
7119 than unsigned char, give up the inlining expansion. */
7135 /* If neither strings is constant string, the call is not qualify. */
7139 /* For strncmp, if the length is not a const, not qualify. */
7150 else
7159 /* If the length of the comparision is larger than the threshold,
7160 do nothing. */
7167 /* Now, start inline expansion the call. */
7171 }
7173 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
7174 represents the size of the first argument to that call, or VOIDmode
7175 if the argument is a pointer. IGNORE will be true if the result
7176 isn't used. */
7177 static rtx
7180 {
7187 {
7190 }
7194 /* An optional second argument can be used as a failsafe value on
7195 some machines. If it isn't present, then the failsafe value is
7196 assumed to be 0. */
7198 {
7201 }
7202 else
7205 /* If the result isn't used, the behavior is undefined. It would be
7206 nice to emit a warning here, but path splitting means this might
7207 happen with legitimate code. So simply drop the builtin
7208 expansion in that case; we've handled any side-effects above. */
7212 /* If we don't have a suitable target, create one to hold the result. */
7220 }
7222 /* Expand an expression EXP that calls a built-in function,
7223 with result going to TARGET if that's convenient
7224 (and in mode MODE if that's convenient).
7225 SUBTARGET may be used as the target for computing one of EXP's operands.
7226 IGNORE is nonzero if the value is to be ignored. */
7228 rtx
7231 {
7240 /* When ASan is enabled, we don't want to expand some memory/string
7241 builtins and rely on libsanitizer's hooks. This allows us to avoid
7242 redundant checks and be sure, that possible overflow will be detected
7243 by ASan. */
7248 /* When not optimizing, generate calls to library functions for a certain
7249 set of builtins. */
7263 /* The built-in function expanders test for target == const0_rtx
7264 to determine whether the function's result will be ignored. */
7268 /* If the result of a pure or const built-in function is ignored, and
7269 none of its arguments are volatile, we can avoid expanding the
7270 built-in call and just evaluate the arguments for side-effects. */
7274 {
7276 tree arg;
7277 call_expr_arg_iterator iter;
7281 {
7284 }
7287 {
7291 }
7292 }
7295 {
7313 /* Just do a normal library call if we were unable to fold
7314 the values. */
7391 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7392 FUNCTION with a copy of the parameters described by
7393 ARGUMENTS, and ARGSIZE. It returns a block of memory
7394 allocated on the stack into which is stored all the registers
7395 that might possibly be used for returning the result of a
7396 function. ARGUMENTS is the value returned by
7397 __builtin_apply_args. ARGSIZE is the number of bytes of
7398 arguments that must be copied. ??? How should this value be
7399 computed? We'll also need a safe worst case value for varargs
7400 functions. */
7407 else
7408 {
7416 }
7418 /* __builtin_return (RESULT) causes the function to return the
7419 value described by RESULT. RESULT is address of the block of
7420 memory returned by __builtin_apply. */
7430 /* All valid uses of __builtin_va_arg_pack () are removed during
7431 inlining. */
7436 /* All valid uses of __builtin_va_arg_pack_len () are removed during
7437 inlining. */
7441 /* Return the address of the first anonymous stack arg. */
7463 /* Returns the address of the area where the structure is returned.
7464 0 otherwise. */
7470 else
7473 CASE_BUILT_IN_ALLOCA:
7623 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7624 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7625 when changing it to a strcmp call. */
7631 /* Change this call back to a BUILT_IN_STRCMP. */
7635 /* Delete the last parameter. */
7642 /* FALLTHROUGH */
7650 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7651 back to a BUILT_IN_STRNCMP. */
7657 /* Change it back to a BUILT_IN_STRNCMP. */
7660 /* FALLTHROUGH */
7675 {
7678 }
7682 /* This should have been lowered to the builtins below. */
7686 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7687 and the receiver label. */
7689 {
7695 /* This is copied from the handling of non-local gotos. */
7697 nonlocal_goto_handler_labels
7699 nonlocal_goto_handler_labels);
7700 /* ??? Do not let expand_label treat us as such since we would
7701 not want to be both on the list of non-local labels and on
7702 the list of forced labels. */
7705 }
7709 /* __builtin_setjmp_receiver is passed the receiver label. */
7711 {
7717 }
7720 /* __builtin_longjmp is passed a pointer to an array of five words.
7721 It's similar to the C library longjmp function but works with
7722 __builtin_setjmp above. */
7725 {
7731 {
7734 }
7738 }
7747 /* This updates the setjmp buffer that is its argument with the value
7748 of the current stack pointer. */
7751 {
7752 rtx buf_addr
7757 }
7777 /* Various hooks for the DWARF 2 __throw routine. */
7783 #ifdef DWARF2_UNWIND_INFO
7789 #endif
7991 mode = get_builtin_sync_mode
8003 mode = get_builtin_sync_mode
8050 {
8054 mode =
8060 /* If this is turned into an external library call, the weak parameter
8061 must be dropped to match the expected parameter list. */
8066 /* Skip the boolean weak parameter. */
8071 }
8100 {
8110 }
8116 {
8126 }
8132 {
8142 }
8148 {
8158 }
8164 {
8174 }
8180 {
8190 }
8327 /* Do library call, if we failed to expand the builtin when
8328 folding. */
8348 }
8350 /* The switch statement above can drop through to cause the function
8351 to be called normally. */
8353 }
8355 /* Determine whether a tree node represents a call to a built-in
8356 function. If the tree T is a call to a built-in function with
8357 the right number of arguments of the appropriate types, return
8358 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8359 Otherwise the return value is END_BUILTINS. */
8361 enum built_in_function
8363 {
8366 const_call_expr_arg_iterator iter;
8378 {
8379 /* If a function doesn't take a variable number of arguments,
8380 the last element in the list will have type `void'. */
8383 {
8387 }
8396 {
8399 }
8401 {
8404 }
8406 {
8409 }
8411 {
8414 }
8415 else
8417 }
8419 /* Variable-length argument list. */
8421 }
8423 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
8424 evaluate to a constant. */
8426 static tree
8428 {
8429 /* We return 1 for a numeric type that's known to be a constant
8430 value at compile-time or for an aggregate type that's a
8431 literal constant. */
8434 /* If we know this is a constant, emit the constant of one. */
8440 {
8447 }
8449 /* If this expression has side effects, show we don't know it to be a
8450 constant. Likewise if it's a pointer or aggregate type since in
8451 those case we only want literals, since those are only optimized
8452 when generating RTL, not later.
8453 And finally, if we are compiling an initializer, not code, we
8454 need to return a definite result now; there's not going to be any
8455 more optimization done. */
8460 || folding_initializer
8465 }
8467 /* Create builtin_expect or builtin_expect_with_probability
8468 with PRED and EXPECTED as its arguments and return it as a truthvalue.
8469 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
8470 builtin_expect_with_probability instead uses third argument as PROBABILITY
8471 value. */
8473 static tree
8476 {
8491 else
8493 predictor);
8497 }
8499 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
8500 NULL_TREE if no simplification is possible. */
8502 tree
8504 tree arg3)
8505 {
8509 /* Distribute the expected value over short-circuiting operators.
8510 See through the cast from truthvalue_type_node to long. */
8517 /* If this is a builtin_expect within a builtin_expect keep the
8518 inner one. See through a comparison against a constant. It
8519 might have been added to create a thruthvalue. */
8535 {
8545 }
8547 /* If the argument isn't invariant then there's nothing else we can do. */
8551 /* If we expect that a comparison against the argument will fold to
8552 a constant return the constant. In practice, this means a true
8553 constant or the address of a non-weak symbol. */
8557 {
8558 do
8559 {
8561 }
8566 }
8568 /* Otherwise, ARG0 already has the proper type for the return value. */
8570 }
8572 /* Fold a call to __builtin_classify_type with argument ARG. */
8574 static tree
8576 {
8581 }
8583 /* Fold a call to __builtin_strlen with argument ARG. */
8585 static tree
8587 {
8590 else
8591 {
8592 c_strlen_data lendata = { };
8602 {
8608 }
8611 }
8612 }
8614 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8616 static tree
8618 {
8619 REAL_VALUE_TYPE real;
8621 /* __builtin_inff is intended to be usable to define INFINITY on all
8622 targets. If an infinity is not available, INFINITY expands "to a
8623 positive constant of type float that overflows at translation
8624 time", footnote "In this case, using INFINITY will violate the
8625 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8626 Thus we pedwarn to ensure this constraint violation is
8627 diagnosed. */
8633 }
8635 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8636 NULL_TREE if no simplification can be made. */
8638 static tree
8641 {
8642 tree type;
8652 /* Calculate the result when the argument is a constant. */
8657 /* Canonicalize sincos to cexpi. */
8659 {
8662 }
8664 {
8671 }
8683 }
8685 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8686 Return NULL_TREE if no simplification can be made. */
8688 static tree
8690 {
8696 /* If the LEN parameter is zero, return zero. */
8701 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8705 /* If len parameter is one, return an expression corresponding to
8706 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8708 {
8710 tree cst_uchar_ptr_node
8713 tree ind1
8717 cst_uchar_ptr_node,
8718 arg1)));
8719 tree ind2
8723 cst_uchar_ptr_node,
8724 arg2)));
8726 }
8729 }
8731 /* Fold a call to builtin isascii with argument ARG. */
8733 static tree
8735 {
8738 else
8739 {
8740 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8746 }
8747 }
8749 /* Fold a call to builtin toascii with argument ARG. */
8751 static tree
8753 {
8757 /* Transform toascii(c) -> (c & 0x7f). */
8760 }
8762 /* Fold a call to builtin isdigit with argument ARG. */
8764 static tree
8766 {
8769 else
8770 {
8771 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8772 /* According to the C standard, isdigit is unaffected by locale.
8773 However, it definitely is affected by the target character set. */
8774 unsigned HOST_WIDE_INT target_digit0
8785 }
8786 }
8788 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8790 static tree
8792 {
8798 }
8800 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8802 static tree
8804 {
8810 }
8812 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8814 static tree
8816 {
8819 {
8823 {
8828 }
8829 }
8832 }
8834 /* Fold a call to builtin frexp, we can assume the base is 2. */
8836 static tree
8838 {
8849 /* Proceed if a valid pointer type was passed in. */
8851 {
8856 {
8858 /* For +-0, return (*exp = 0, +-0). */
8864 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8867 {
8868 /* Since the frexp function always expects base 2, and in
8869 GCC normalized significands are already in the range
8870 [0.5, 1.0), we have exactly what frexp wants. */
8875 }
8879 }
8881 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8885 }
8888 }
8890 /* Fold a call to builtin modf. */
8892 static tree
8894 {
8905 /* Proceed if a valid pointer type was passed in. */
8907 {
8912 {
8915 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8919 /* For +-Inf, return (*arg1 = arg0, +-0). */
8925 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8928 /* If the original number was negative and already
8929 integral, then the fractional part is -0.0. */
8933 }
8935 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8941 }
8944 }
8946 /* Given a location LOC, an interclass builtin function decl FNDECL
8947 and its single argument ARG, return an folded expression computing
8948 the same, or NULL_TREE if we either couldn't or didn't want to fold
8949 (the latter happen if there's an RTL instruction available). */
8951 static tree
8953 {
8954 machine_mode mode;
8966 /* If there is no optab, try generic code. */
8968 {
8969 tree result;
8972 {
8973 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8976 REAL_VALUE_TYPE r;
8980 {
8981 /* NaN and Inf are encoded in the high-order double value
8982 only. The low-order value is not significant. */
8986 }
8993 }
8996 {
8997 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
9000 REAL_VALUE_TYPE r;
9004 {
9005 /* NaN and Inf are encoded in the high-order double value
9006 only. The low-order value is not significant. */
9010 }
9016 /*result = fold_build2_loc (loc, UNGT_EXPR,
9017 TREE_TYPE (TREE_TYPE (fndecl)),
9018 fold_build1_loc (loc, ABS_EXPR, type, arg),
9019 build_real (type, r));
9020 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9021 TREE_TYPE (TREE_TYPE (fndecl)),
9022 result);*/
9024 }
9026 {
9027 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9028 islessequal(fabs(x),DBL_MAX). */
9038 {
9039 /* Use double to test the normal range of IBM extended
9040 precision. Emin for IBM extended precision is
9041 different to emin for IEEE double, being 53 higher
9042 since the low double exponent is at least 53 lower
9043 than the high double exponent. */
9047 }
9059 {
9060 /* Testing the high end of the range is done just using
9061 the high double, using the same test as isfinite().
9062 For the subnormal end of the range we first test the
9063 high double, then if its magnitude is equal to the
9064 limit of 0x1p-969, we test whether the low double is
9065 non-zero and opposite sign to the high double. */
9081 integer_type_node,
9087 }
9088 else
9089 {
9090 tree const isge_fn
9093 }
9097 }
9100 }
9103 }
9105 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9106 ARG is the argument for the call. */
9108 static tree
9110 {
9117 {
9125 {
9126 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9127 /* In a boolean context, GCC will fold the inner COND_EXPR to
9128 1. So e.g. "if (isinf_sign(x))" would be folded to just
9129 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9137 {
9150 integer_zero_node);
9151 }
9154 }
9167 {
9170 {
9171 /* NaN and Inf are encoded in the high-order double value
9172 only. The low-order value is not significant. */
9174 }
9175 }
9181 }
9182 }
9184 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9185 This builtin will generate code to return the appropriate floating
9186 point classification depending on the value of the floating point
9187 number passed in. The possible return values must be supplied as
9188 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9189 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9190 one floating point argument which is "type generic". */
9192 static tree
9194 {
9197 machine_mode mode;
9198 REAL_VALUE_TYPE r;
9201 /* Verify the required arguments in the original call. */
9221 /* fpclassify(x) ->
9222 isnan(x) ? FP_NAN :
9223 (fabs(x) == Inf ? FP_INFINITE :
9224 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9225 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9239 {
9245 }
9248 {
9251 }
9254 }
9256 /* Fold a call to an unordered comparison function such as
9257 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9258 being called and ARG0 and ARG1 are the arguments for the call.
9259 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9260 the opposite of the desired result. UNORDERED_CODE is used
9261 for modes that can hold NaNs and ORDERED_CODE is used for
9262 the rest. */
9264 static tree
9268 {
9282 /* Choose the wider of two real types. */
9294 {
9298 }
9303 }
9305 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9306 arithmetics if it can never overflow, or into internal functions that
9307 return both result of arithmetics and overflowed boolean flag in
9308 a complex integer result, or some other check for overflow.
9309 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9310 checking part of that. */
9312 static tree
9315 {
9317 /* The code of the expression corresponding to the built-in. */
9322 {
9325 /* FALLTHRU */
9338 /* FALLTHRU */
9351 /* FALLTHRU */
9364 }
9366 /* For the "generic" overloads, the first two arguments can have different
9367 types and the last argument determines the target type to use to check
9368 for overflow. The arguments of the other overloads all have the same
9369 type. */
9372 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
9373 arguments are constant, attempt to fold the built-in call into a constant
9374 expression indicating whether or not it detected an overflow. */
9378 /* Perform the computation in the target type and check for overflow. */
9382 arg2);
9386 {
9394 }
9395 else
9396 {
9404 }
9410 tree store
9413 }
9415 /* Fold a call to __builtin_FILE to a constant string. */
9419 {
9421 {
9422 /* The documentation says this builtin is equivalent to the preprocessor
9423 __FILE__ macro so it appears appropriate to use the same file prefix
9424 mappings. */
9427 }
9430 }
9432 /* Fold a call to __builtin_FUNCTION to a constant string. */
9436 {
9443 }
9445 /* Fold a call to __builtin_LINE to an integer constant. */
9449 {
9451 }
9453 /* Fold a call to built-in function FNDECL with 0 arguments.
9454 This function returns NULL_TREE if no simplification was possible. */
9456 static tree
9458 {
9462 {
9488 }
9490 }
9492 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9493 This function returns NULL_TREE if no simplification was possible. */
9495 static tree
9497 {
9508 {
9510 {
9513 /* Gimplification will pull the CALL_EXPR for the builtin out of
9514 an if condition. When not optimizing, we'll not CSE it back.
9515 To avoid link error types of regressions, return false now. */
9520 }
9576 {
9581 }
9587 {
9592 }
9613 }
9617 }
9619 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9620 This function returns NULL_TREE if no simplification was possible. */
9622 static tree
9624 {
9636 {
9680 NOP_EXPR);
9682 /* We do the folding for va_start in the expander. */
9697 }
9699 }
9701 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9702 and ARG2.
9703 This function returns NULL_TREE if no simplification was possible. */
9705 static tree
9708 {
9722 {
9771 }
9773 }
9775 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9776 arguments. IGNORE is true if the result of the
9777 function call is ignored. This function returns NULL_TREE if no
9778 simplification was possible. */
9780 tree
9782 {
9786 {
9802 }
9804 {
9808 }
9810 }
9812 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9813 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9814 of arguments in ARGS to be omitted. OLDNARGS is the number of
9815 elements in ARGS. */
9817 static tree
9820 {
9825 {
9833 }
9834 else
9838 }
9840 /* Return true if FNDECL shouldn't be folded right now.
9841 If a built-in function has an inline attribute always_inline
9842 wrapper, defer folding it after always_inline functions have
9843 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9844 might not be performed. */
9846 bool
9848 {
9851 && cfun
9854 }
9856 /* A wrapper function for builtin folding that prevents warnings for
9857 "statement without effect" and the like, caused by removing the
9858 call node earlier than the warning is generated. */
9860 tree
9862 {
9866 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9867 yet. Defer folding until we see all the arguments
9868 (after inlining). */
9870 {
9873 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9874 instead last argument is __builtin_va_arg_pack (). Defer folding
9875 even in that case, until arguments are finalized. */
9877 {
9881 }
9889 else
9890 {
9895 }
9896 }
9898 }
9900 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9901 N arguments are passed in the array ARGARRAY. Return a folded
9902 expression or NULL_TREE if no simplification was possible. */
9904 tree
9906 tree fn,
9909 {
9916 {
9917 /* If last argument is __builtin_va_arg_pack (), arguments to this
9918 function are not finalized yet. Defer folding until they are. */
9920 {
9924 }
9929 else
9931 }
9934 }
9936 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9937 along with N new arguments specified as the "..." parameters. SKIP
9938 is the number of arguments in EXP to be omitted. This function is used
9939 to do varargs-to-varargs transformations. */
9941 static tree
9943 {
9945 tree t;
9953 }
9955 /* Validate a single argument ARG against a tree code CODE representing
9956 a type. Return true when argument is valid. */
9958 static bool
9960 {
9968 }
9970 /* This function validates the types of a function call argument list
9971 against a specified list of tree_codes. If the last specifier is a 0,
9972 that represents an ellipses, otherwise the last specifier must be a
9973 VOID_TYPE.
9975 This is the GIMPLE version of validate_arglist. Eventually we want to
9976 completely convert builtins.c to work from GIMPLEs and the tree based
9977 validate_arglist will then be removed. */
9979 bool
9981 {
9985 const_tree arg;
9991 do
9992 {
9995 {
9997 /* This signifies an ellipses, any further arguments are all ok. */
10001 /* This signifies an endlink, if no arguments remain, return
10002 true, otherwise return false. */
10006 /* If no parameters remain or the parameter's code does not
10007 match the specified code, return false. Otherwise continue
10008 checking any remaining arguments. */
10013 }
10014 }
10017 /* We need gotos here since we can only have one VA_CLOSE in a
10018 function. */
10019 end: ;
10023 }
10025 /* Default target-specific builtin expander that does nothing. */
10027 rtx
10029 rtx target ATTRIBUTE_UNUSED,
10030 rtx subtarget ATTRIBUTE_UNUSED,
10031 machine_mode mode ATTRIBUTE_UNUSED,
10033 {
10035 }
10037 /* Returns true is EXP represents data that would potentially reside
10038 in a readonly section. */
10040 bool
10042 {
10052 /* Make sure we call decl_readonly_section only for trees it
10053 can handle (since it returns true for everything it doesn't
10054 understand). */
10059 else
10061 }
10063 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
10064 to the call, and TYPE is its return type.
10066 Return NULL_TREE if no simplification was possible, otherwise return the
10067 simplified form of the call as a tree.
10069 The simplified form may be a constant or other expression which
10070 computes the same value, but in a more efficient manner (including
10071 calls to other builtin functions).
10073 The call may contain arguments which need to be evaluated, but
10074 which are not useful to determine the result of the call. In
10075 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10076 COMPOUND_EXPR will be an argument which must be evaluated.
10077 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10078 COMPOUND_EXPR in the chain will contain the tree for the simplified
10079 form of the builtin function call. */
10081 static tree
10083 {
10087 else
10088 {
10089 tree fn;
10098 {
10100 tree tem;
10105 /* Return an offset into the constant string argument. */
10108 }
10111 /* strpbrk(x, "") == NULL.
10112 Evaluate and ignore s1 in case it had side-effects. */
10122 /* New argument list transforming strpbrk(s1, s2) to
10123 strchr(s1, s2[0]). */
10126 }
10127 }
10129 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
10130 to the call.
10132 Return NULL_TREE if no simplification was possible, otherwise return the
10133 simplified form of the call as a tree.
10135 The simplified form may be a constant or other expression which
10136 computes the same value, but in a more efficient manner (including
10137 calls to other builtin functions).
10139 The call may contain arguments which need to be evaluated, but
10140 which are not useful to determine the result of the call. In
10141 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10142 COMPOUND_EXPR will be an argument which must be evaluated.
10143 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10144 COMPOUND_EXPR in the chain will contain the tree for the simplified
10145 form of the builtin function call. */
10147 static tree
10149 {
10153 else
10154 {
10157 /* If either argument is "", return NULL_TREE. */
10159 /* Evaluate and ignore both arguments in case either one has
10160 side-effects. */
10164 }
10165 }
10167 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
10168 to the call.
10170 Return NULL_TREE if no simplification was possible, otherwise return the
10171 simplified form of the call as a tree.
10173 The simplified form may be a constant or other expression which
10174 computes the same value, but in a more efficient manner (including
10175 calls to other builtin functions).
10177 The call may contain arguments which need to be evaluated, but
10178 which are not useful to determine the result of the call. In
10179 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10180 COMPOUND_EXPR will be an argument which must be evaluated.
10181 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10182 COMPOUND_EXPR in the chain will contain the tree for the simplified
10183 form of the builtin function call. */
10185 static tree
10187 {
10191 else
10192 {
10193 /* If the first argument is "", return NULL_TREE. */
10196 {
10197 /* Evaluate and ignore argument s2 in case it has
10198 side-effects. */
10201 }
10203 /* If the second argument is "", return __builtin_strlen(s1). */
10206 {
10209 /* If the replacement _DECL isn't initialized, don't do the
10210 transformation. */
10215 }
10217 }
10218 }
10220 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
10221 produced. False otherwise. This is done so that we don't output the error
10222 or warning twice or three times. */
10224 bool
10226 {
10229 tree arg;
10230 /* There is good chance the current input_location points inside the
10231 definition of the va_start macro (perhaps on the token for
10232 builtin) in a system header, so warnings will not be emitted.
10233 Use the location in real source code. */
10234 location_t current_location =
10236 NULL);
10239 {
10242 }
10245 {
10247 {
10250 }
10252 }
10253 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
10254 when we checked the arguments and if needed issued a warning. */
10255 else
10256 {
10258 {
10259 /* Evidently an out of date version of <stdarg.h>; can't validate
10260 va_start's second argument, but can still work as intended. */
10262 OPT_Wvarargs,
10265 }
10267 {
10270 }
10272 }
10277 /* We destructively modify the call to be __builtin_va_start (ap, 0)
10278 or __builtin_next_arg (0) the first time we see it, after checking
10279 the arguments and if needed issuing a warning. */
10281 {
10284 /* Strip off all nops for the sake of the comparison. This
10285 is not quite the same as STRIP_NOPS. It does more.
10286 We must also strip off INDIRECT_EXPR for C++ reference
10287 parameters. */
10292 {
10293 /* FIXME: Sometimes with the tree optimizers we can get the
10294 not the last argument even though the user used the last
10295 argument. We just warn and set the arg to be the last
10296 argument so that we will get wrong-code because of
10297 it. */
10299 OPT_Wvarargs,
10301 }
10303 /* Undefined by C99 7.15.1.4p4 (va_start):
10304 "If the parameter parmN is declared with the register storage
10305 class, with a function or array type, or with a type that is
10306 not compatible with the type that results after application of
10307 the default argument promotions, the behavior is undefined."
10308 */
10310 {
10312 OPT_Wvarargs,
10313 "undefined behavior when second parameter of "
10315 }
10317 /* We want to verify the second parameter just once before the tree
10318 optimizers are run and then avoid keeping it in the tree,
10319 as otherwise we could warn even for correct code like:
10320 void foo (int i, ...)
10321 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
10324 else
10326 }
10328 }
10331 /* Expand a call EXP to __builtin_object_size. */
10333 static rtx
10335 {
10336 tree ost;
10341 {
10346 }
10354 {
10359 }
10364 }
10366 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10367 FCODE is the BUILT_IN_* to use.
10368 Return NULL_RTX if we failed; the caller should emit a normal call,
10369 otherwise try to get the result in TARGET, if convenient (and in
10370 mode MODE if that's convenient). */
10372 static rtx
10375 {
10377 POINTER_TYPE,
10378 fcode == BUILT_IN_MEMSET_CHK
10395 {
10396 /* Avoid transforming the checking call to an ordinary one when
10397 an overflow has been detected or when the call couldn't be
10398 validated because the size is not constant. */
10403 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10404 mem{cpy,pcpy,move,set} is available. */
10406 {
10421 }
10430 }
10433 else
10434 {
10437 /* If DEST is not a pointer type, call the normal function. */
10441 /* If SRC and DEST are the same (and not volatile), do nothing. */
10443 {
10444 tree expr;
10447 {
10448 /* Evaluate and ignore LEN in case it has side-effects. */
10451 }
10455 }
10457 /* __memmove_chk special case. */
10459 {
10465 /* If src is categorized for a readonly section we can use
10466 normal __memcpy_chk. */
10468 {
10477 }
10478 }
10480 }
10481 }
10483 /* Emit warning if a buffer overflow is detected at compile time. */
10485 static void
10487 {
10488 /* The source string. */
10490 /* The size of the destination object. */
10492 /* The string that is being concatenated with (as in __strcat_chk)
10493 or null if it isn't. */
10495 /* The maximum length of the source sequence in a bounded operation
10496 (such as __strncat_chk) or null if the operation isn't bounded
10497 (such as __strcat_chk). */
10499 /* The exact size of the access (such as in __strncpy_chk). */
10503 {
10511 /* For __strcat_chk the warning will be emitted only if overflowing
10512 by at least strlen (dest) + 1 bytes. */
10539 }
10542 {
10543 /* Check __strncat_chk. There is no way to determine the length
10544 of the string to which the source string is being appended so
10545 just warn when the length of the source string is not known. */
10548 }
10550 /* The destination argument is the first one for all built-ins above. */
10554 }
10556 /* Emit warning if a buffer overflow is detected at compile time
10557 in __sprintf_chk/__vsprintf_chk calls. */
10559 static void
10561 {
10566 /* Verify the required arguments in the original call. */
10576 /* Check whether the format is a literal string constant. */
10584 /* If the format doesn't contain % args or %%, we know its size. */
10587 /* If the format is "%s" and first ... argument is a string literal,
10588 we know it too. */
10591 {
10592 tree arg;
10603 }
10604 else
10607 /* Add one for the terminating nul. */
10612 }
10614 /* Emit warning if a free is called with address of a variable. */
10616 static void
10618 {
10635 else
10638 }
10640 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10641 if possible. */
10643 static tree
10645 {
10662 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10663 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10664 and (size_t) 0 for types 2 and 3. */
10669 {
10673 }
10675 {
10676 /* If object size is not known yet, delay folding until
10677 later. Maybe subsequent passes will help determining
10678 it. */
10682 }
10685 }
10687 /* Builtins with folding operations that operate on "..." arguments
10688 need special handling; we need to store the arguments in a convenient
10689 data structure before attempting any folding. Fortunately there are
10690 only a few builtins that fall into this category. FNDECL is the
10691 function, EXP is the CALL_EXPR for the call. */
10693 static tree
10695 {
10700 {
10707 }
10709 {
10714 }
10716 }
10718 /* Initialize format string characters in the target charset. */
10720 bool
10722 {
10725 {
10748 }
10750 }
10752 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10753 and no overflow/underflow occurred. INEXACT is true if M was not
10754 exactly calculated. TYPE is the tree type for the result. This
10755 function assumes that you cleared the MPFR flags and then
10756 calculated M to see if anything subsequently set a flag prior to
10757 entering this function. Return NULL_TREE if any checks fail. */
10759 static tree
10761 {
10762 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10763 overflow/underflow occurred. If -frounding-math, proceed iff the
10764 result of calling FUNC was exact. */
10767 {
10768 REAL_VALUE_TYPE rr;
10771 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10772 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10773 but the mpft_t is not, then we underflowed in the
10774 conversion. */
10777 {
10778 REAL_VALUE_TYPE rmode;
10781 /* Proceed iff the specified mode can hold the value. */
10784 }
10785 }
10787 }
10789 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10790 number and no overflow/underflow occurred. INEXACT is true if M
10791 was not exactly calculated. TYPE is the tree type for the result.
10792 This function assumes that you cleared the MPFR flags and then
10793 calculated M to see if anything subsequently set a flag prior to
10794 entering this function. Return NULL_TREE if any checks fail, if
10795 FORCE_CONVERT is true, then bypass the checks. */
10797 static tree
10799 {
10800 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10801 overflow/underflow occurred. If -frounding-math, proceed iff the
10802 result of calling FUNC was exact. */
10807 {
10812 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10813 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10814 but the mpft_t is not, then we underflowed in the
10815 conversion. */
10820 {
10825 /* Proceed iff the specified mode can hold the value. */
10831 }
10832 }
10834 }
10836 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10837 the pointer *(ARG_QUO) and return the result. The type is taken
10838 from the type of ARG0 and is used for setting the precision of the
10839 calculation and results. */
10841 static tree
10843 {
10850 /* To proceed, MPFR must exactly represent the target floating point
10851 format, which only happens when the target base equals two. */
10855 {
10860 {
10864 tree result_rem;
10873 /* Remquo is independent of the rounding mode, so pass
10874 inexact=0 to do_mpfr_ckconv(). */
10878 {
10879 /* MPFR calculates quo in the host's long so it may
10880 return more bits in quo than the target int can hold
10881 if sizeof(host long) > sizeof(target int). This can
10882 happen even for native compilers in LP64 mode. In
10883 these cases, modulo the quo value with the largest
10884 number that the target int can hold while leaving one
10885 bit for the sign. */
10889 /* Dereference the quo pointer argument. */
10891 /* Proceed iff a valid pointer type was passed in. */
10893 {
10894 /* Set the value. */
10895 tree result_quo
10898 integer_quo));
10900 /* Combine the quo assignment with the rem. */
10903 }
10904 }
10905 }
10906 }
10908 }
10910 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10911 resulting value as a tree with type TYPE. The mpfr precision is
10912 set to the precision of TYPE. We assume that this mpfr function
10913 returns zero if the result could be calculated exactly within the
10914 requested precision. In addition, the integer pointer represented
10915 by ARG_SG will be dereferenced and set to the appropriate signgam
10916 (-1,1) value. */
10918 static tree
10920 {
10925 /* To proceed, MPFR must exactly represent the target floating point
10926 format, which only happens when the target base equals two. Also
10927 verify ARG is a constant and that ARG_SG is an int pointer. */
10932 {
10935 /* In addition to NaN and Inf, the argument cannot be zero or a
10936 negative integer. */
10940 {
10945 mpfr_t m;
10946 tree result_lg;
10955 {
10956 tree result_sg;
10958 /* Dereference the arg_sg pointer argument. */
10960 /* Assign the signgam value into *arg_sg. */
10965 /* Combine the signgam assignment with the lgamma result. */
10968 }
10969 }
10970 }
10973 }
10975 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10976 mpc function FUNC on it and return the resulting value as a tree
10977 with type TYPE. The mpfr precision is set to the precision of
10978 TYPE. We assume that function FUNC returns zero if the result
10979 could be calculated exactly within the requested precision. If
10980 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10981 in the arguments and/or results. */
10983 tree
10986 {
10992 /* To proceed, MPFR must exactly represent the target floating point
10993 format, which only happens when the target base equals two. */
10999 {
11008 {
11028 }
11029 }
11032 }
11034 /* A wrapper function for builtin folding that prevents warnings for
11035 "statement without effect" and the like, caused by removing the
11036 call node earlier than the warning is generated. */
11038 tree
11040 {
11046 {
11055 {
11057 }
11058 else
11059 {
11062 {
11063 /* Propagate location information from original call to
11064 expansion of builtin. Otherwise things like
11065 maybe_emit_chk_warning, that operate on the expansion
11066 of a builtin, will use the wrong location information. */
11068 {
11076 }
11078 }
11079 }
11080 }
11082 }
11084 /* Look up the function in builtin_decl that corresponds to DECL
11085 and set ASMSPEC as its user assembler name. DECL must be a
11086 function decl that declares a builtin. */
11088 void
11090 {
11099 {
11103 }
11104 }
11106 /* Return true if DECL is a builtin that expands to a constant or similarly
11107 simple code. */
11108 bool
11110 {
11113 {
11114 /* Builtins that expand to constants. */
11119 /* Simple register moves or loads from stack. */
11130 /* Exception state returns or moves registers around. */
11138 }
11141 }
11143 /* Return true if DECL is a builtin that is not expensive, i.e., they are
11144 most probably expanded inline into reasonably simple code. This is a
11145 superset of is_simple_builtin. */
11146 bool
11148 {
11155 {
11157 CASE_BUILT_IN_ALLOCA:
11223 }
11226 }
11228 /* Return true if T is a constant and the value cast to a target char
11229 can be represented by a host char.
11230 Store the casted char constant in *P if so. */
11232 bool
11234 {
11240 }