| blob | ebde2db6e6494cf7e4441f6834e65fcb81e1629c |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2018 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* Legacy warning! Please add no further builtin simplifications here
21 (apart from pure constant folding) - builtin simplifications should go
22 to match.pd or gimple-fold.c instead. */
77 #if SWITCHABLE_TARGET
79 #endif
81 /* Define the names of the builtin function types and codes. */
85 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
87 {
89 };
91 /* Setup an array of builtin_info_type, make sure each element decl is
92 initialized to NULL_TREE. */
95 /* Non-zero if __builtin_constant_p should be folded right away. */
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 data;
581 {
583 {
586 {
587 /* Constant offsets are already accounted for in data.len, but
588 not in a SSA_NAME + CST expression. */
593 {
594 /* Subtract the offset from the size of the array. */
599 }
600 else
602 }
603 else
607 }
609 }
612 }
614 /* Compute the length of a null-terminated character string or wide
615 character string handling character sizes of 1, 2, and 4 bytes.
616 TREE_STRING_LENGTH is not the right way because it evaluates to
617 the size of the character array in bytes (as opposed to characters)
618 and because it can contain a zero byte in the middle.
620 ONLY_VALUE should be nonzero if the result is not going to be emitted
621 into the instruction stream and zero if it is going to be expanded.
622 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
623 is returned, otherwise NULL, since
624 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
625 evaluate the side-effects.
627 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
628 accesses. Note that this implies the result is not going to be emitted
629 into the instruction stream.
631 Additional information about the string accessed may be recorded
632 in DATA. For example, if SRC references an unterminated string,
633 then the declaration will be stored in the DECL field. If the
634 length of the unterminated string can be determined, it'll be
635 stored in the LEN field. Note this length could well be different
636 than what a C strlen call would return.
638 ELTSIZE is 1 for normal single byte character strings, and 2 or
639 4 for wide characer strings. ELTSIZE is by default 1.
641 The value returned is of type `ssizetype'. */
643 tree
645 {
646 /* If we were not passed a DATA pointer, then get one to a local
647 structure. That avoids having to check DATA for NULL before
648 each time we want to use it. */
649 c_strlen_data local_strlen_data;
658 {
665 }
673 /* Offset from the beginning of the string in bytes. */
674 tree byteoff;
675 tree memsize;
676 tree decl;
681 /* Determine the size of the string element. */
685 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
686 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
687 in case the latter is less than the size of the array, such as when
688 SRC refers to a short string literal used to initialize a large array.
689 In that case, the elements of the array after the terminating NUL are
690 all NUL. */
699 /* PTR can point to the byte representation of any string type, including
700 char* and wchar_t*. */
704 {
705 /* The code below works only for single byte character types. */
709 /* If the string has an internal NUL character followed by any
710 non-NUL characters (e.g., "foo\0bar"), we can't compute
711 the offset to the following NUL if we don't know where to
712 start searching for it. */
715 /* Return when an embedded null character is found or none at all.
716 In the latter case, set the DECL/LEN field in the DATA structure
717 so that callers may examine them. */
721 {
726 }
728 /* For empty strings the result should be zero. */
732 /* We don't know the starting offset, but we do know that the string
733 has no internal zero bytes. If the offset falls within the bounds
734 of the string subtract the offset from the length of the string,
735 and return that. Otherwise the length is zero. Take care to
736 use SAVE_EXPR in case the OFFSET has side-effects. */
743 offsave);
747 }
749 /* Offset from the beginning of the string in elements. */
750 HOST_WIDE_INT eltoff;
752 /* We have a known offset into the string. Start searching there for
753 a null character if we can represent it as a single HOST_WIDE_INT. */
758 else
761 /* If the offset is known to be out of bounds, warn, and call strlen at
762 runtime. */
764 {
765 /* Suppress multiple warnings for propagated constant strings. */
768 {
771 eltoff);
773 }
775 }
777 /* If eltoff is larger than strelts but less than maxelts the
778 string length is zero, since the excess memory will be zero. */
782 /* Use strlen to search for the first zero byte. Since any strings
783 constructed with build_string will have nulls appended, we win even
784 if we get handed something like (char[4])"abcd".
786 Since ELTOFF is our starting index into the string, no further
787 calculation is needed. */
791 /* Don't know what to return if there was no zero termination.
792 Ideally this would turn into a gcc_checking_assert over time.
793 Set DECL/LEN so callers can examine them. */
795 {
800 }
803 }
805 /* Return a constant integer corresponding to target reading
806 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
808 static 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 {
1151 }
1152 }
1154 /* Search backwards and mark the jump insn as a non-local goto.
1155 Note that this precludes the use of __builtin_longjmp to a
1156 __builtin_setjmp target in the same function. However, we've
1157 already cautioned the user that these functions are for
1158 internal exception handling use only. */
1160 {
1164 {
1167 }
1170 }
1171 }
1175 {
1177 }
1179 /* This function validates the types of a function call argument list
1180 against a specified list of tree_codes. If the last specifier is a 0,
1181 that represents an ellipsis, otherwise the last specifier must be a
1182 VOID_TYPE. */
1184 static bool
1186 {
1190 const_call_expr_arg_iterator iter;
1191 const_tree arg;
1196 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1201 {
1205 {
1207 /* This signifies an ellipses, any further arguments are all ok. */
1211 /* This signifies an endlink, if no arguments remain, return
1212 true, otherwise return false. */
1216 /* The actual argument must be nonnull when either the whole
1217 called function has been declared nonnull, or when the formal
1218 argument corresponding to the actual argument has been. */
1221 {
1226 }
1227 /* FALLTHRU */
1229 /* If no parameters remain or the parameter's code does not
1230 match the specified code, return false. Otherwise continue
1231 checking any remaining arguments. */
1236 }
1237 }
1239 /* We need gotos here since we can only have one VA_CLOSE in a
1240 function. */
1241 end: ;
1247 }
1249 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1250 and the address of the save area. */
1252 static rtx
1254 {
1269 /* Copy the address of the save location to a register just in case it was
1270 based on the frame pointer. */
1279 /* ??? We no longer need to pass the static chain value, afaik. */
1282 else
1283 {
1289 /* Restore frame pointer for containing function. */
1293 /* USE of hard_frame_pointer_rtx added for consistency;
1294 not clear if really needed. */
1298 /* If the architecture is using a GP register, we must
1299 conservatively assume that the target function makes use of it.
1300 The prologue of functions with nonlocal gotos must therefore
1301 initialize the GP register to the appropriate value, and we
1302 must then make sure that this value is live at the point
1303 of the jump. (Note that this doesn't necessarily apply
1304 to targets with a nonlocal_goto pattern; they are free
1305 to implement it in their own way. Note also that this is
1306 a no-op if the GP register is a global invariant.) */
1312 }
1314 /* Search backwards to the jump insn and mark it as a
1315 non-local goto. */
1317 {
1319 {
1322 }
1325 }
1328 }
1330 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1331 (not all will be used on all machines) that was passed to __builtin_setjmp.
1332 It updates the stack pointer in that block to the current value. This is
1333 also called directly by the SJLJ exception handling code. */
1335 void
1337 {
1340 rtx stack_save
1342 memory_address
1348 }
1350 /* Expand a call to __builtin_prefetch. For a target that does not support
1351 data prefetch, evaluate the memory address argument in case it has side
1352 effects. */
1354 static void
1356 {
1366 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1367 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1368 locality). */
1372 else
1376 else
1379 /* Argument 0 is an address. */
1382 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1384 {
1387 }
1389 /* Argument 1 must be either zero or one. */
1391 {
1395 }
1397 /* Argument 2 (locality) must be a compile-time constant int. */
1399 {
1402 }
1404 /* Argument 2 must be 0, 1, 2, or 3. */
1406 {
1409 }
1412 {
1420 }
1422 /* Don't do anything with direct references to volatile memory, but
1423 generate code to handle other side effects. */
1426 }
1428 /* Get a MEM rtx for expression EXP which is the address of an operand
1429 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1430 the maximum length of the block of memory that might be accessed or
1431 NULL if unknown. */
1433 static rtx
1435 {
1439 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1440 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1447 /* Get an expression we can use to find the attributes to assign to MEM.
1448 First remove any nops. */
1453 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1454 (as builtin stringops may alias with anything). */
1461 /* If the MEM_REF has no acceptable address, try to get the base object
1462 from the original address we got, and build an all-aliasing
1463 unknown-sized access to that one. */
1469 {
1474 size_zero_node,
1475 NULL)),
1478 }
1481 }
1482 \f
1483 /* Built-in functions to perform an untyped call and return. */
1485 #define apply_args_mode \
1486 (this_target_builtins->x_apply_args_mode)
1487 #define apply_result_mode \
1488 (this_target_builtins->x_apply_result_mode)
1490 /* Return the size required for the block returned by __builtin_apply_args,
1491 and initialize apply_args_mode. */
1493 static int
1495 {
1500 /* The values computed by this function never change. */
1502 {
1503 /* The first value is the incoming arg-pointer. */
1506 /* The second value is the structure value address unless this is
1507 passed as an "invisible" first argument. */
1513 {
1523 }
1524 else
1525 {
1527 }
1528 }
1530 }
1532 /* Return the size required for the block returned by __builtin_apply,
1533 and initialize apply_result_mode. */
1535 static int
1537 {
1541 /* The values computed by this function never change. */
1543 {
1548 {
1558 }
1559 else
1562 /* Allow targets that use untyped_call and untyped_return to override
1563 the size so that machine-specific information can be stored here. */
1564 #ifdef APPLY_RESULT_SIZE
1566 #endif
1567 }
1569 }
1571 /* Create a vector describing the result block RESULT. If SAVEP is true,
1572 the result block is used to save the values; otherwise it is used to
1573 restore the values. */
1575 static rtx
1577 {
1579 fixed_size_mode mode;
1586 {
1596 }
1598 }
1600 /* Save the state required to perform an untyped call with the same
1601 arguments as were passed to the current function. */
1603 static rtx
1605 {
1608 fixed_size_mode mode;
1609 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1611 /* Create a block where the arg-pointer, structure value address,
1612 and argument registers can be saved. */
1615 /* Walk past the arg-pointer and structure value address. */
1620 /* Save each register used in calling a function to the block. */
1623 {
1632 }
1634 /* Save the arg pointer to the block. */
1636 /* We need the pointer as the caller actually passed them to us, not
1637 as we might have pretended they were passed. Make sure it's a valid
1638 operand, as emit_move_insn isn't expected to handle a PLUS. */
1640 tem
1643 NULL_RTX);
1648 /* Save the structure value address unless this is passed as an
1649 "invisible" first argument. */
1651 {
1655 }
1657 /* Return the address of the block. */
1659 }
1661 /* __builtin_apply_args returns block of memory allocated on
1662 the stack into which is stored the arg pointer, structure
1663 value address, static chain, and all the registers that might
1664 possibly be used in performing a function call. The code is
1665 moved to the start of the function so the incoming values are
1666 saved. */
1668 static rtx
1670 {
1671 /* Don't do __builtin_apply_args more than once in a function.
1672 Save the result of the first call and reuse it. */
1675 {
1676 /* When this function is called, it means that registers must be
1677 saved on entry to this function. So we migrate the
1678 call to the first insn of this function. */
1679 rtx temp;
1688 /* Put the insns after the NOTE that starts the function.
1689 If this is inside a start_sequence, make the outer-level insn
1690 chain current, so the code is placed at the start of the
1691 function. If internal_arg_pointer is a non-virtual pseudo,
1692 it needs to be placed after the function that initializes
1693 that pseudo. */
1698 else
1702 }
1703 }
1705 /* Perform an untyped call and save the state required to perform an
1706 untyped return of whatever value was returned by the given function. */
1708 static rtx
1710 {
1712 fixed_size_mode mode;
1721 /* Create a block where the return registers can be saved. */
1724 /* Fetch the arg pointer from the ARGUMENTS block. */
1731 /* Push a new argument block and copy the arguments. Do not allow
1732 the (potential) memcpy call below to interfere with our stack
1733 manipulations. */
1735 NO_DEFER_POP;
1737 /* Save the stack with nonlocal if available. */
1740 else
1743 /* Allocate a block of memory onto the stack and copy the memory
1744 arguments to the outgoing arguments address. We can pass TRUE
1745 as the 4th argument because we just saved the stack pointer
1746 and will restore it right after the call. */
1749 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1750 may have already set current_function_calls_alloca to true.
1751 current_function_calls_alloca won't be set if argsize is zero,
1752 so we have to guarantee need_drap is true here. */
1758 {
1761 else
1763 }
1770 /* Refer to the argument block. */
1775 /* Walk past the arg-pointer and structure value address. */
1780 /* Restore each of the registers previously saved. Make USE insns
1781 for each of these registers for use in making the call. */
1784 {
1792 }
1794 /* Restore the structure value address unless this is passed as an
1795 "invisible" first argument. */
1798 {
1805 }
1807 /* All arguments and registers used for the call are set up by now! */
1810 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1811 and we don't want to load it into a register as an optimization,
1812 because prepare_call_address already did it if it should be done. */
1816 /* Generate the actual call instruction and save the return value. */
1818 {
1822 }
1824 {
1827 /* Locate the unique return register. It is not possible to
1828 express a call that sets more than one return register using
1829 call_value; use untyped_call for that. In fact, untyped_call
1830 only needs to save the return registers in the given block. */
1833 {
1837 }
1844 }
1845 else
1848 /* Find the CALL insn we just emitted, and attach the register usage
1849 information. */
1853 /* Restore the stack. */
1856 else
1860 OK_DEFER_POP;
1862 /* Return the address of the result block. */
1865 }
1867 /* Perform an untyped return. */
1869 static void
1871 {
1873 fixed_size_mode mode;
1874 rtx reg;
1883 {
1888 }
1890 /* Restore the return value and note that each value is used. */
1894 {
1906 }
1908 /* Put the USE insns before the return. */
1911 /* Return whatever values was restored by jumping directly to the end
1912 of the function. */
1914 }
1916 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1918 static enum type_class
1920 {
1922 {
1941 }
1942 }
1944 /* Expand a call EXP to __builtin_classify_type. */
1946 static rtx
1948 {
1952 }
1954 /* This helper macro, meant to be used in mathfn_built_in below, determines
1955 which among a set of builtin math functions is appropriate for a given type
1956 mode. The `F' (float) and `L' (long double) are automatically generated
1957 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1958 types, there are additional types that are considered with 'F32', 'F64',
1959 'F128', etc. suffixes. */
1960 #define CASE_MATHFN(MATHFN) \
1961 CASE_CFN_##MATHFN: \
1962 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1963 fcodel = BUILT_IN_##MATHFN##L ; break;
1964 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1965 types. */
1966 #define CASE_MATHFN_FLOATN(MATHFN) \
1967 CASE_CFN_##MATHFN: \
1968 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1969 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1970 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1971 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1972 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1973 break;
1974 /* Similar to above, but appends _R after any F/L suffix. */
1975 #define CASE_MATHFN_REENT(MATHFN) \
1976 case CFN_BUILT_IN_##MATHFN##_R: \
1977 case CFN_BUILT_IN_##MATHFN##F_R: \
1978 case CFN_BUILT_IN_##MATHFN##L_R: \
1979 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1980 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1982 /* Return a function equivalent to FN but operating on floating-point
1983 values of type TYPE, or END_BUILTINS if no such function exists.
1984 This is purely an operation on function codes; it does not guarantee
1985 that the target actually has an implementation of the function. */
1987 static built_in_function
1989 {
1990 tree mtype;
2001 {
2092 }
2115 else
2117 }
2119 /* Return mathematic function equivalent to FN but operating directly on TYPE,
2120 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2121 otherwise use the explicit declaration. If we can't do the conversion,
2122 return null. */
2124 static tree
2126 {
2135 }
2137 /* Like mathfn_built_in_1, but always use the implicit array. */
2139 tree
2141 {
2143 }
2145 /* Like mathfn_built_in_1, but take a built_in_function and
2146 always use the implicit array. */
2148 tree
2150 {
2152 }
2154 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2155 return its code, otherwise return IFN_LAST. Note that this function
2156 only tests whether the function is defined in internals.def, not whether
2157 it is actually available on the target. */
2159 internal_fn
2161 {
2165 {
2166 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2167 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2168 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2169 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2170 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2171 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2172 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2189 }
2190 }
2192 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2193 on the current target by a call to an internal function, return the
2194 code of that internal function, otherwise return IFN_LAST. The caller
2195 is responsible for ensuring that any side-effects of the built-in
2196 call are dealt with correctly. E.g. if CALL sets errno, the caller
2197 must decide that the errno result isn't needed or make it available
2198 in some other way. */
2200 internal_fn
2202 {
2204 {
2207 {
2212 }
2213 }
2215 }
2217 /* Expand a call to the builtin trinary math functions (fma).
2218 Return NULL_RTX if a normal call should be emitted rather than expanding the
2219 function in-line. EXP is the expression that is a call to the builtin
2220 function; if convenient, the result should be placed in TARGET.
2221 SUBTARGET may be used as the target for computing one of EXP's
2222 operands. */
2224 static rtx
2226 {
2227 optab builtin_optab;
2232 machine_mode mode;
2242 {
2248 }
2250 /* Make a suitable register to place result in. */
2253 /* Before working hard, check whether the instruction is available. */
2259 /* Always stabilize the argument list. */
2270 /* Compute into RESULT.
2271 Set RESULT to wherever the result comes back. */
2275 /* If we were unable to expand via the builtin, stop the sequence
2276 (without outputting the insns) and call to the library function
2277 with the stabilized argument list. */
2279 {
2282 }
2284 /* Output the entire sequence. */
2290 }
2292 /* Expand a call to the builtin sin and cos math functions.
2293 Return NULL_RTX if a normal call should be emitted rather than expanding the
2294 function in-line. EXP is the expression that is a call to the builtin
2295 function; if convenient, the result should be placed in TARGET.
2296 SUBTARGET may be used as the target for computing one of EXP's
2297 operands. */
2299 static rtx
2301 {
2302 optab builtin_optab;
2303 rtx op0;
2306 machine_mode mode;
2307 tree arg;
2315 {
2321 }
2323 /* Make a suitable register to place result in. */
2326 /* Check if sincos insn is available, otherwise fallback
2327 to sin or cos insn. */
2330 {
2337 }
2339 /* Before working hard, check whether the instruction is available. */
2341 {
2344 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2345 need to expand the argument again. This way, we will not perform
2346 side-effects more the once. */
2353 /* Compute into RESULT.
2354 Set RESULT to wherever the result comes back. */
2356 {
2360 {
2369 }
2371 }
2372 else
2376 {
2377 /* Output the entire sequence. */
2382 }
2384 /* If we were unable to expand via the builtin, stop the sequence
2385 (without outputting the insns) and call to the library function
2386 with the stabilized argument list. */
2388 }
2391 }
2393 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2394 return an RTL instruction code that implements the functionality.
2395 If that isn't possible or available return CODE_FOR_nothing. */
2397 static enum insn_code
2399 {
2402 machine_mode mode;
2405 {
2419 /* These builtins have no optabs (yet). */
2423 }
2425 /* There's no easy way to detect the case we need to set EDOM. */
2429 /* Optab mode depends on the mode of the input argument. */
2435 }
2437 /* Expand a call to one of the builtin math functions that operate on
2438 floating point argument and output an integer result (ilogb, isinf,
2439 isnan, etc).
2440 Return 0 if a normal call should be emitted rather than expanding the
2441 function in-line. EXP is the expression that is a call to the builtin
2442 function; if convenient, the result should be placed in TARGET. */
2444 static rtx
2446 {
2448 rtx op0;
2450 machine_mode mode;
2451 tree arg;
2461 {
2466 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2467 need to expand the argument again. This way, we will not perform
2468 side-effects more the once. */
2483 }
2486 }
2488 /* Expand a call to the builtin sincos math function.
2489 Return NULL_RTX if a normal call should be emitted rather than expanding the
2490 function in-line. EXP is the expression that is a call to the builtin
2491 function. */
2493 static rtx
2495 {
2497 machine_mode mode;
2511 /* Make a suitable register to place result in. */
2514 /* Check if sincos insn is available, otherwise emit the call. */
2529 /* Compute into target1 and target2.
2530 Set TARGET to wherever the result comes back. */
2534 /* Move target1 and target2 to the memory locations indicated
2535 by op1 and op2. */
2540 }
2542 /* Expand a call to the internal cexpi builtin to the sincos math function.
2543 EXP is the expression that is a call to the builtin function; if convenient,
2544 the result should be placed in TARGET. */
2546 static rtx
2548 {
2551 machine_mode mode;
2562 /* Try expanding via a sincos optab, fall back to emitting a libcall
2563 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2564 is only generated from sincos, cexp or if we have either of them. */
2566 {
2572 /* Compute into op1 and op2. */
2574 }
2576 {
2587 else
2597 /* Make sure not to fold the sincos call again. */
2601 }
2602 else
2603 {
2613 else
2616 /* If we don't have a decl for cexp create one. This is the
2617 friendliest fallback if the user calls __builtin_cexpi
2618 without full target C99 function support. */
2620 {
2621 tree fntype;
2633 }
2638 /* Make sure not to fold the cexp call again. */
2642 }
2644 /* Now build the proper return type. */
2649 }
2651 /* Conveniently construct a function call expression. FNDECL names the
2652 function to be called, N is the number of arguments, and the "..."
2653 parameters are the argument expressions. Unlike build_call_exr
2654 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2656 static tree
2658 {
2668 }
2670 /* Expand a call to one of the builtin rounding functions gcc defines
2671 as an extension (lfloor and lceil). As these are gcc extensions we
2672 do not need to worry about setting errno to EDOM.
2673 If expanding via optab fails, lower expression to (int)(floor(x)).
2674 EXP is the expression that is a call to the builtin function;
2675 if convenient, the result should be placed in TARGET. */
2677 static rtx
2679 {
2680 convert_optab builtin_optab;
2685 tree fallback_fndecl;
2686 machine_mode mode;
2687 tree arg;
2695 {
2712 }
2714 /* Make a suitable register to place result in. */
2719 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2720 need to expand the argument again. This way, we will not perform
2721 side-effects more the once. */
2728 /* Compute into TARGET. */
2730 {
2731 /* Output the entire sequence. */
2736 }
2738 /* If we were unable to expand via the builtin, stop the sequence
2739 (without outputting the insns). */
2742 /* Fall back to floating point rounding optab. */
2745 /* For non-C99 targets we may end up without a fallback fndecl here
2746 if the user called __builtin_lfloor directly. In this case emit
2747 a call to the floor/ceil variants nevertheless. This should result
2748 in the best user experience for not full C99 targets. */
2750 {
2751 tree fntype;
2755 {
2788 }
2793 }
2800 /* Truncate the result of floating point optab to integer
2801 via expand_fix (). */
2806 }
2808 /* Expand a call to one of the builtin math functions doing integer
2809 conversion (lrint).
2810 Return 0 if a normal call should be emitted rather than expanding the
2811 function in-line. EXP is the expression that is a call to the builtin
2812 function; if convenient, the result should be placed in TARGET. */
2814 static rtx
2816 {
2817 convert_optab builtin_optab;
2818 rtx op0;
2821 tree arg;
2822 machine_mode mode;
2831 {
2850 }
2852 /* There's no easy way to detect the case we need to set EDOM. */
2856 /* Make a suitable register to place result in. */
2859 /* There's no easy way to detect the case we need to set EDOM. */
2861 {
2864 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2865 need to expand the argument again. This way, we will not perform
2866 side-effects more the once. */
2874 {
2875 /* Output the entire sequence. */
2880 }
2882 /* If we were unable to expand via the builtin, stop the sequence
2883 (without outputting the insns) and call to the library function
2884 with the stabilized argument list. */
2886 }
2889 {
2890 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2891 targets, (int) round (x) should never be transformed into
2892 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2893 a call to lround in the hope that the target provides at least some
2894 C99 functions. This should result in the best user experience for
2895 not full C99 targets. */
2896 tree fallback_fndecl = mathfn_built_in_1
2905 }
2908 }
2910 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2911 a normal call should be emitted rather than expanding the function
2912 in-line. EXP is the expression that is a call to the builtin
2913 function; if convenient, the result should be placed in TARGET. */
2915 static rtx
2917 {
2920 machine_mode mode;
2921 machine_mode mode2;
2930 /* Emit a libcall to libgcc. */
2932 /* Mode of the 2nd argument must match that of an int. */
2950 }
2952 /* Expand expression EXP which is a call to the strlen builtin. Return
2953 NULL_RTX if we failed and the caller should emit a normal call, otherwise
2954 try to get the result in TARGET, if convenient. */
2956 static rtx
2958 machine_mode target_mode)
2959 {
2964 rtx pat;
2965 tree len;
2967 rtx src_reg;
2969 machine_mode insn_mode;
2973 /* If the length can be computed at compile-time, return it. */
2978 /* If the length can be computed at compile-time and is constant
2979 integer, but there are side-effects in src, evaluate
2980 src for side-effects, then return len.
2981 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2982 can be optimized into: i++; x = 3; */
2985 {
2988 }
2992 /* If SRC is not a pointer type, don't do this operation inline. */
2996 /* Bail out if we can't compute strlen in the right mode. */
2998 {
3002 }
3006 /* Make a place to hold the source address. We will not expand
3007 the actual source until we are sure that the expansion will
3008 not fail -- there are trees that cannot be expanded twice. */
3011 /* Mark the beginning of the strlen sequence so we can emit the
3012 source operand later. */
3022 /* Check to see if the argument was declared attribute nonstring
3023 and if so, issue a warning since at this point it's not known
3024 to be nul-terminated. */
3027 /* Now that we are assured of success, expand the source. */
3031 {
3032 #ifdef POINTERS_EXTEND_UNSIGNED
3035 POINTERS_EXTEND_UNSIGNED);
3036 #endif
3038 }
3044 else
3047 /* Return the value in the proper mode for this function. */
3052 else
3056 }
3058 /* Expand call EXP to the strnlen built-in, returning the result
3059 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
3061 static rtx
3063 {
3080 /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
3081 so these conversions aren't necessary. */
3082 c_strlen_data data;
3089 {
3093 "%K%qD specified bound %E "
3100 {
3101 /* Clear EXACT if LEN may be less than SRC suggests,
3102 such as in
3103 strnlen (&a[i], sizeof a)
3104 where the value of i is unknown. Unless i's value is
3105 zero, the call is unsafe because the bound is greater. */
3109 }
3115 {
3116 location_t warnloc
3120 exact
3126 {
3131 }
3132 }
3139 }
3152 "%K%qD specified bound [%wu, %wu] "
3159 {
3163 }
3169 {
3170 location_t warnloc
3174 exact
3180 {
3184 }
3185 }
3195 }
3197 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3198 bytes from constant string DATA + OFFSET and return it as target
3199 constant. */
3201 static rtx
3203 scalar_int_mode mode)
3204 {
3212 }
3214 /* LEN specify length of the block of memcpy/memset operation.
3215 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3216 In some cases we can make very likely guess on max size, then we
3217 set it into PROBABLE_MAX_SIZE. */
3219 static void
3224 {
3226 {
3229 }
3230 else
3231 {
3235 /* Determine bounds from the type. */
3238 else
3243 else
3249 {
3254 }
3256 {
3257 /* Anti range 0...N lets us to determine minimal size to N+1. */
3259 {
3262 }
3263 /* Code like
3265 int n;
3266 if (n < 100)
3267 memcpy (a, b, n)
3269 Produce anti range allowing negative values of N. We still
3270 can use the information and make a guess that N is not negative.
3271 */
3274 }
3275 }
3279 }
3281 /* Try to verify that the sizes and lengths of the arguments to a string
3282 manipulation function given by EXP are within valid bounds and that
3283 the operation does not lead to buffer overflow or read past the end.
3284 Arguments other than EXP may be null. When non-null, the arguments
3285 have the following meaning:
3286 DST is the destination of a copy call or NULL otherwise.
3287 SRC is the source of a copy call or NULL otherwise.
3288 DSTWRITE is the number of bytes written into the destination obtained
3289 from the user-supplied size argument to the function (such as in
3290 memcpy(DST, SRCs, DSTWRITE) or strncpy(DST, DRC, DSTWRITE).
3291 MAXREAD is the user-supplied bound on the length of the source sequence
3292 (such as in strncat(d, s, N). It specifies the upper limit on the number
3293 of bytes to write. If NULL, it's taken to be the same as DSTWRITE.
3294 SRCSTR is the source string (such as in strcpy(DST, SRC)) when the
3295 expression EXP is a string function call (as opposed to a memory call
3296 like memcpy). As an exception, SRCSTR can also be an integer denoting
3297 the precomputed size of the source string or object (for functions like
3298 memcpy).
3299 DSTSIZE is the size of the destination object specified by the last
3300 argument to the _chk builtins, typically resulting from the expansion
3301 of __builtin_object_size (such as in __builtin___strcpy_chk(DST, SRC,
3302 DSTSIZE).
3304 When DSTWRITE is null LEN is checked to verify that it doesn't exceed
3305 SIZE_MAX.
3307 If the call is successfully verified as safe return true, otherwise
3308 return false. */
3310 static bool
3313 {
3316 /* The size of the largest object is half the address space, or
3317 PTRDIFF_MAX. (This is way too permissive.) */
3320 /* Either the length of the source string for string functions or
3321 the size of the source object for raw memory functions. */
3326 /* Set to true when the exact number of bytes written by a string
3327 function like strcpy is not known and the only thing that is
3328 known is that it must be at least one (for the terminating nul). */
3331 {
3332 /* SRCSTR is normally a pointer to string but as a special case
3333 it can be an integer denoting the length of a string. */
3335 {
3336 /* Try to determine the range of lengths the source string
3337 refers to. If it can be determined and is less than
3338 the upper bound given by MAXREAD add one to it for
3339 the terminating nul. Otherwise, set it to one for
3340 the same reason, or to MAXREAD as appropriate. */
3343 {
3346 else
3357 }
3358 else
3359 {
3362 }
3363 }
3364 else
3366 }
3369 {
3370 /* When the only available piece of data is the object size
3371 there is nothing to do. */
3375 /* Otherwise, when the length of the source sequence is known
3376 (as with strlen), set DSTWRITE to it. */
3379 }
3389 /* First check the number of bytes to be written against the maximum
3390 object size. */
3394 {
3404 "%K%qD specified size %E "
3407 else
3409 "%K%qD specified size between %E and %E "
3417 }
3419 /* The number of bytes to write is "exact" if DSTWRITE is non-null,
3420 constant, and in range of unsigned HOST_WIDE_INT. */
3423 /* Next check the number of bytes to be written against the destination
3424 object size. */
3426 {
3431 || (dstwrite
3434 {
3442 {
3443 /* This is a call to strcpy with a destination of 0 size
3444 and a source of unknown length. The call will write
3445 at least one byte past the end of the destination. */
3447 "%K%qD writing %E or more bytes into a region "
3450 }
3453 "%K%qD writing %E byte into a region "
3455 "%K%qD writing %E bytes into a region "
3459 {
3460 /* Avoid printing the upper bound if it's invalid. */
3462 "%K%qD writing %E or more bytes into a region "
3465 }
3466 else
3468 "%K%qD writing between %E and %E bytes into "
3471 dstsize);
3473 /* Return error when an overflow has been detected. */
3475 }
3476 }
3478 /* Check the maximum length of the source sequence against the size
3479 of the destination object if known, or against the maximum size
3480 of an object. */
3482 {
3485 /* Use the lower end for MAXREAD from now on. */
3490 {
3495 {
3499 /* Warn about crazy big sizes first since that's more
3500 likely to be meaningful than saying that the bound
3501 is greater than the object size if both are big. */
3504 "%K%qD specified bound %E "
3508 else
3510 "%K%qD specified bound between %E and %E "
3516 }
3519 {
3525 "%K%qD specified bound %E "
3529 else
3531 "%K%qD specified bound between %E and %E "
3536 }
3537 }
3538 }
3540 /* Check for reading past the end of SRC. */
3545 {
3557 {
3558 /* Avoid printing the upper bound if it's invalid. */
3560 "%K%qD reading %E or more bytes from a region "
3563 }
3564 else
3566 "%K%qD reading between %E and %E bytes from a region "
3570 }
3573 }
3575 /* Helper to compute the size of the object referenced by the DEST
3576 expression which must have pointer type, using Object Size type
3577 OSTYPE (only the least significant 2 bits are used). Return
3578 an estimate of the size of the object if successful or NULL when
3579 the size cannot be determined. When the referenced object involves
3580 a non-constant offset in some range the returned value represents
3581 the largest size given the smallest non-negative offset in the
3582 range. The function is intended for diagnostics and should not
3583 be used to influence code generation or optimization. */
3585 tree
3587 {
3590 /* Only the two least significant bits are meaningful. */
3597 {
3606 {
3607 /* compute_builtin_object_size fails for addresses with
3608 non-constant offsets. Try to determine the range of
3609 such an offset here and use it to adjust the constant
3610 size. */
3613 {
3615 {
3619 /* Ignore negative offsets for now. For others,
3620 use the lower bound as the most optimistic
3621 estimate of the (remaining) size. */
3623 ;
3627 else
3629 }
3630 }
3633 {
3638 {
3640 {
3643 /* Ignore negative offsets for now. For others,
3644 use the lower bound as the most optimistic
3645 estimate of the (remaining)size. */
3647 ;
3651 else
3653 }
3654 }
3655 }
3656 }
3659 }
3661 /* Unless computing the largest size (for memcpy and other raw memory
3662 functions), try to determine the size of the object from its type. */
3677 {
3678 /* Return the constant size unless it's zero (that's a zero-length
3679 array likely at the end of a struct). */
3684 }
3687 }
3689 /* Helper to determine and check the sizes of the source and the destination
3690 of calls to __builtin_{bzero,memcpy,mempcpy,memset} calls. EXP is the
3691 call expression, DEST is the destination argument, SRC is the source
3692 argument or null, and LEN is the number of bytes. Use Object Size type-0
3693 regardless of the OPT_Wstringop_overflow_ setting. Return true on success
3694 (no overflow or invalid sizes), false otherwise. */
3696 static bool
3698 {
3699 /* For functions like memset and memcpy that operate on raw memory
3700 try to determine the size of the largest source and destination
3701 object using type-0 Object Size regardless of the object size
3702 type specified by the option. */
3708 }
3710 /* Validate memchr arguments without performing any expansion.
3711 Return NULL_RTX. */
3713 static rtx
3715 {
3723 /* Diagnose calls where the specified length exceeds the size
3724 of the object. */
3726 {
3730 }
3733 }
3735 /* Expand a call EXP to the memcpy builtin.
3736 Return NULL_RTX if we failed, the caller should emit a normal call,
3737 otherwise try to get the result in TARGET, if convenient (and in
3738 mode MODE if that's convenient). */
3740 static rtx
3742 {
3755 }
3757 /* Check a call EXP to the memmove built-in for validity.
3758 Return NULL_RTX on both success and failure. */
3760 static rtx
3762 {
3774 }
3776 /* Expand a call EXP to the mempcpy builtin.
3777 Return NULL_RTX if we failed; the caller should emit a normal call,
3778 otherwise try to get the result in TARGET, if convenient (and in
3779 mode MODE if that's convenient). If ENDP is 0 return the
3780 destination pointer, if ENDP is 1 return the end pointer ala
3781 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3782 stpcpy. */
3784 static rtx
3786 {
3795 /* Policy does not generally allow using compute_objsize (which
3796 is used internally by check_memop_size) to change code generation
3797 or drive optimization decisions.
3799 In this instance it is safe because the code we generate has
3800 the same semantics regardless of the return value of
3801 check_memop_sizes. Exactly the same amount of data is copied
3802 and the return value is exactly the same in both cases.
3804 Furthermore, check_memop_size always uses mode 0 for the call to
3805 compute_objsize, so the imprecise nature of compute_objsize is
3806 avoided. */
3808 /* Avoid expanding mempcpy into memcpy when the call is determined
3809 to overflow the buffer. This also prevents the same overflow
3810 from being diagnosed again when expanding memcpy. */
3816 }
3818 /* Helper function to do the actual work for expand of memory copy family
3819 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3820 of memory from SRC to DEST and assign to TARGET if convenient.
3821 If ENDP is 0 return the
3822 destination pointer, if ENDP is 1 return the end pointer ala
3823 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3824 stpcpy. */
3826 static rtx
3829 {
3840 /* If DEST is not a pointer type, call the normal function. */
3844 /* If either SRC is not a pointer type, don't do this
3845 operation in-line. */
3862 /* If SRC is a string constant and block move would be done
3863 by pieces, we can avoid loading the string from memory
3864 and only stored the computed constants. */
3871 {
3873 builtin_memcpy_read_str,
3879 }
3884 /* Copy word part most expediently. */
3897 {
3900 }
3903 {
3905 /* stpcpy pointer to last byte. */
3908 }
3911 }
3913 static rtx
3916 {
3918 endp);
3919 }
3921 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3922 we failed, the caller should emit a normal call, otherwise try to
3923 get the result in TARGET, if convenient. If ENDP is 0 return the
3924 destination pointer, if ENDP is 1 return the end pointer ala
3925 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3926 stpcpy. */
3928 static rtx
3930 {
3932 rtx dest_mem;
3933 rtx src_mem;
3941 {
3944 }
3953 {
3955 /* movstr is supposed to set end to the address of the NUL
3956 terminator. If the caller requested a mempcpy-like return value,
3957 adjust it. */
3959 {
3963 }
3964 }
3966 }
3968 /* Do some very basic size validation of a call to the strcpy builtin
3969 given by EXP. Return NULL_RTX to have the built-in expand to a call
3970 to the library function. */
3972 static rtx
3974 {
3982 /* There is no way here to determine the length of the string in
3983 the destination to which the SRC string is being appended so
3984 just diagnose cases when the souce string is longer than
3985 the destination object. */
3990 destsize);
3993 }
3995 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3996 NULL_RTX if we failed the caller should emit a normal call, otherwise
3997 try to get the result in TARGET, if convenient (and in mode MODE if that's
3998 convenient). */
4000 static rtx
4002 {
4010 {
4014 }
4017 {
4018 /* Check to see if the argument was declared attribute nonstring
4019 and if so, issue a warning since at this point it's not known
4020 to be nul-terminated. */
4024 }
4027 }
4029 /* Helper function to do the actual work for expand_builtin_strcpy. The
4030 arguments to the builtin_strcpy call DEST and SRC are broken out
4031 so that this can also be called without constructing an actual CALL_EXPR.
4032 The other arguments and return value are the same as for
4033 expand_builtin_strcpy. */
4035 static rtx
4037 {
4038 /* Detect strcpy calls with unterminated arrays.. */
4040 {
4041 /* NONSTR refers to the non-nul terminated constant array. */
4045 }
4048 }
4050 /* Expand a call EXP to the stpcpy builtin.
4051 Return NULL_RTX if we failed the caller should emit a normal call,
4052 otherwise try to get the result in TARGET, if convenient (and in
4053 mode MODE if that's convenient). */
4055 static rtx
4057 {
4068 {
4072 }
4074 /* If return value is ignored, transform stpcpy into strcpy. */
4076 {
4080 }
4081 else
4082 {
4084 rtx ret;
4086 /* Ensure we get an actual string whose length can be evaluated at
4087 compile-time, not an expression containing a string. This is
4088 because the latter will potentially produce pessimized code
4089 when used to produce the return value. */
4090 c_strlen_data data;
4107 {
4111 {
4115 {
4117 {
4120 else
4122 }
4131 }
4132 }
4133 }
4136 }
4137 }
4139 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
4140 arguments while being careful to avoid duplicate warnings (which could
4141 be issued if the expander were to expand the call, resulting in it
4142 being emitted in expand_call(). */
4144 static rtx
4146 {
4148 {
4149 /* The call has been successfully expanded. Check for nonstring
4150 arguments and issue warnings as appropriate. */
4153 }
4156 }
4158 /* Check a call EXP to the stpncpy built-in for validity.
4159 Return NULL_RTX on both success and failure. */
4161 static rtx
4163 {
4169 /* The source and destination of the call. */
4173 /* The exact number of bytes to write (not the maximum). */
4176 /* The size of the destination object. */
4182 }
4184 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4185 bytes from constant string DATA + OFFSET and return it as target
4186 constant. */
4188 rtx
4190 scalar_int_mode mode)
4191 {
4198 }
4200 /* Helper to check the sizes of sequences and the destination of calls
4201 to __builtin_strncat and __builtin___strncat_chk. Returns true on
4202 success (no overflow or invalid sizes), false otherwise. */
4204 static bool
4206 {
4211 /* Try to determine the range of lengths that the source expression
4212 refers to. */
4216 /* Try to verify that the destination is big enough for the shortest
4217 string. */
4220 {
4221 /* If it hasn't been provided by __strncat_chk, try to determine
4222 the size of the destination object into which the source is
4223 being copied. */
4225 }
4227 /* Add one for the terminating nul. */
4230 size_one_node)
4233 /* The strncat function copies at most MAXREAD bytes and always appends
4234 the terminating nul so the specified upper bound should never be equal
4235 to (or greater than) the size of the destination. */
4238 {
4247 }
4255 /* The number of bytes to write is LEN but check_access will also
4256 check SRCLEN if LEN's value isn't known. */
4258 objsize);
4259 }
4261 /* Similar to expand_builtin_strcat, do some very basic size validation
4262 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
4263 the built-in expand to a call to the library function. */
4265 static rtx
4267 {
4275 /* The upper bound on the number of bytes to write. */
4277 /* The length of the source sequence. */
4280 /* Try to determine the range of lengths that the source expression
4281 refers to. */
4285 else
4288 /* Try to verify that the destination is big enough for the shortest
4289 string. First try to determine the size of the destination object
4290 into which the source is being copied. */
4293 /* Add one for the terminating nul. */
4296 size_one_node)
4299 /* The strncat function copies at most MAXREAD bytes and always appends
4300 the terminating nul so the specified upper bound should never be equal
4301 to (or greater than) the size of the destination. */
4304 {
4313 }
4321 /* The number of bytes to write is SRCLEN. */
4325 }
4327 /* Expand expression EXP, which is a call to the strncpy builtin. Return
4328 NULL_RTX if we failed the caller should emit a normal call. */
4330 static rtx
4332 {
4337 {
4340 /* The number of bytes to write (not the maximum). */
4342 /* The length of the source sequence. */
4346 {
4350 /* The number of bytes to write is LEN but check_access will also
4351 check SLEN if LEN's value isn't known. */
4353 destsize);
4354 }
4356 /* We must be passed a constant len and src parameter. */
4362 /* We're required to pad with trailing zeros if the requested
4363 len is greater than strlen(s2)+1. In that case try to
4364 use store_by_pieces, if it fails, punt. */
4366 {
4369 rtx dest_mem;
4373 builtin_strncpy_read_str,
4380 builtin_strncpy_read_str,
4385 }
4386 }
4388 }
4390 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
4391 bytes from constant string DATA + OFFSET and return it as target
4392 constant. */
4394 rtx
4396 scalar_int_mode mode)
4397 {
4404 }
4406 /* Callback routine for store_by_pieces. Return the RTL of a register
4407 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
4408 char value given in the RTL register data. For example, if mode is
4409 4 bytes wide, return the RTL for 0x01010101*data. */
4411 static rtx
4413 scalar_int_mode mode)
4414 {
4430 }
4432 /* Expand expression EXP, which is a call to the memset builtin. Return
4433 NULL_RTX if we failed the caller should emit a normal call, otherwise
4434 try to get the result in TARGET, if convenient (and in mode MODE if that's
4435 convenient). */
4437 static rtx
4439 {
4451 }
4453 /* Helper function to do the actual work for expand_builtin_memset. The
4454 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4455 so that this can also be called without constructing an actual CALL_EXPR.
4456 The other arguments and return value are the same as for
4457 expand_builtin_memset. */
4459 static rtx
4462 {
4465 machine_mode val_mode;
4477 /* If DEST is not a pointer type, don't do this operation in-line. */
4488 /* If the LEN parameter is zero, return DEST. */
4490 {
4491 /* Evaluate and ignore VAL in case it has side-effects. */
4494 }
4496 /* Stabilize the arguments in case we fail. */
4508 {
4509 rtx val_rtx;
4514 /* Assume that we can memset by pieces if we can store
4515 * the coefficients by pieces (in the required modes).
4516 * We can't pass builtin_memset_gen_str as that emits RTL. */
4522 {
4527 }
4531 probable_max_size))
4537 }
4543 {
4554 probable_max_size))
4560 }
4568 probable_max_size);
4571 {
4574 }
4578 do_libcall:
4587 else
4592 }
4594 /* Expand expression EXP, which is a call to the bzero builtin. Return
4595 NULL_RTX if we failed the caller should emit a normal call. */
4597 static rtx
4599 {
4608 /* New argument list transforming bzero(ptr x, int y) to
4609 memset(ptr x, int 0, size_t y). This is done this way
4610 so that if it isn't expanded inline, we fallback to
4611 calling bzero instead of memset. */
4619 }
4621 /* Try to expand cmpstr operation ICODE with the given operands.
4622 Return the result rtx on success, otherwise return null. */
4624 static rtx
4626 HOST_WIDE_INT align)
4627 {
4641 }
4643 /* Expand expression EXP, which is a call to the memcmp built-in function.
4644 Return NULL_RTX if we failed and the caller should emit a normal call,
4645 otherwise try to get the result in TARGET, if convenient.
4646 RESULT_EQ is true if we can relax the returned value to be either zero
4647 or nonzero, without caring about the sign. */
4649 static rtx
4651 {
4662 /* Diagnose calls where the specified length exceeds the size of either
4663 object. */
4669 {
4674 }
4676 /* If the specified length exceeds the size of either object,
4677 call the function. */
4681 /* Due to the performance benefit, always inline the calls first
4682 when result_eq is false. */
4686 {
4690 }
4698 /* If we don't have POINTER_TYPE, call the function. */
4706 /* Set MEM_SIZE as appropriate. */
4708 {
4711 }
4717 {
4721 }
4723 /* If SRC is a string constant and block move would be done
4724 by pieces, we can avoid loading the string from memory
4725 and only stored the computed constants. */
4737 {
4738 /* Return the value in the proper mode for this function. */
4743 {
4746 }
4749 }
4752 }
4754 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4755 if we failed the caller should emit a normal call, otherwise try to get
4756 the result in TARGET, if convenient. */
4758 static rtx
4760 {
4764 /* Due to the performance benefit, always inline the calls first. */
4781 /* If we don't have POINTER_TYPE, call the function. */
4785 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4792 /* Try to call cmpstrsi. */
4797 /* Try to determine at least one length and call cmpstrnsi. */
4799 {
4800 tree len;
4801 rtx arg3_rtx;
4811 /* If we don't have a constant length for the first, use the length
4812 of the second, if we know it. We don't require a constant for
4813 this case; some cost analysis could be done if both are available
4814 but neither is constant. For now, assume they're equally cheap,
4815 unless one has side effects. If both strings have constant lengths,
4816 use the smaller. */
4832 else
4835 /* If both arguments have side effects, we cannot optimize. */
4837 {
4839 result = expand_cmpstrn_or_cmpmem
4842 }
4843 }
4847 {
4848 /* Check to see if the argument was declared attribute nonstring
4849 and if so, issue a warning since at this point it's not known
4850 to be nul-terminated. */
4853 /* Return the value in the proper mode for this function. */
4861 }
4863 /* Expand the library call ourselves using a stabilized argument
4864 list to avoid re-evaluating the function's arguments twice. */
4869 }
4871 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4872 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4873 the result in TARGET, if convenient. */
4875 static rtx
4877 ATTRIBUTE_UNUSED machine_mode mode)
4878 {
4883 /* Due to the performance benefit, always inline the calls first. */
4889 /* If c_strlen can determine an expression for one of the string
4890 lengths, and it doesn't have side effects, then emit cmpstrnsi
4891 using length MIN(strlen(string)+1, arg3). */
4896 tree len;
4917 /* If we don't have a constant length for the first, use the length
4918 of the second, if we know it. If neither string is constant length,
4919 use the given length argument. We don't require a constant for
4920 this case; some cost analysis could be done if both are available
4921 but neither is constant. For now, assume they're equally cheap,
4922 unless one has side effects. If both strings have constant lengths,
4923 use the smaller. */
4941 else
4944 /* If we are not using the given length, we must incorporate it here.
4945 The actual new length parameter will be MIN(len,arg3) in this case. */
4947 {
4950 }
4960 {
4961 /* Check to see if the argument was declared attribute nonstring
4962 and if so, issue a warning since at this point it's not known
4963 to be nul-terminated. */
4966 /* Return the value in the proper mode for this function. */
4974 }
4976 /* Expand the library call ourselves using a stabilized argument
4977 list to avoid re-evaluating the function's arguments twice. */
4982 }
4984 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4985 if that's convenient. */
4987 rtx
4989 {
4990 rtx val;
4993 /* Don't do __builtin_saveregs more than once in a function.
4994 Save the result of the first call and reuse it. */
4998 /* When this function is called, it means that registers must be
4999 saved on entry to this function. So we migrate the call to the
5000 first insn of this function. */
5004 /* Do whatever the machine needs done in this case. */
5012 /* Put the insns after the NOTE that starts the function. If this
5013 is inside a start_sequence, make the outer-level insn chain current, so
5014 the code is placed at the start of the function. */
5020 }
5022 /* Expand a call to __builtin_next_arg. */
5024 static rtx
5026 {
5027 /* Checking arguments is already done in fold_builtin_next_arg
5028 that must be called before this function. */
5033 }
5035 /* Make it easier for the backends by protecting the valist argument
5036 from multiple evaluations. */
5038 static tree
5040 {
5043 /* The current way of determining the type of valist is completely
5044 bogus. We should have the information on the va builtin instead. */
5049 {
5053 /* For this case, the backends will be expecting a pointer to
5054 vatype, but it's possible we've actually been given an array
5055 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
5056 So fix it. */
5058 {
5061 }
5062 }
5063 else
5064 {
5068 {
5074 }
5080 }
5083 }
5085 /* The "standard" definition of va_list is void*. */
5087 tree
5089 {
5091 }
5093 /* The "standard" abi va_list is va_list_type_node. */
5095 tree
5097 {
5099 }
5101 /* The "standard" type of va_list is va_list_type_node. */
5103 tree
5105 {
5112 {
5113 /* If va_list is an array type, the argument may have decayed
5114 to a pointer type, e.g. by being passed to another function.
5115 In that case, unwrap both types so that we can compare the
5116 underlying records. */
5119 {
5122 }
5123 }
5128 }
5130 /* The "standard" implementation of va_start: just assign `nextarg' to
5131 the variable. */
5133 void
5135 {
5138 }
5140 /* Expand EXP, a call to __builtin_va_start. */
5142 static rtx
5144 {
5145 rtx nextarg;
5146 tree valist;
5150 {
5153 }
5163 else
5167 }
5169 /* Expand EXP, a call to __builtin_va_end. */
5171 static rtx
5173 {
5176 /* Evaluate for side effects, if needed. I hate macros that don't
5177 do that. */
5182 }
5184 /* Expand EXP, a call to __builtin_va_copy. We do this as a
5185 builtin rather than just as an assignment in stdarg.h because of the
5186 nastiness of array-type va_list types. */
5188 static rtx
5190 {
5203 {
5207 }
5208 else
5209 {
5212 /* Evaluate to pointers. */
5221 /* "Dereference" to BLKmode memories. */
5229 /* Copy. */
5231 }
5234 }
5236 /* Expand a call to one of the builtin functions __builtin_frame_address or
5237 __builtin_return_address. */
5239 static rtx
5241 {
5242 /* The argument must be a nonnegative integer constant.
5243 It counts the number of frames to scan up the stack.
5244 The value is either the frame pointer value or the return
5245 address saved in that frame. */
5247 /* Warning about missing arg was already issued. */
5250 {
5253 }
5254 else
5255 {
5256 /* Number of frames to scan up the stack. */
5261 /* Some ports cannot access arbitrary stack frames. */
5263 {
5266 }
5269 {
5270 /* Warn since no effort is made to ensure that any frame
5271 beyond the current one exists or can be safely reached. */
5274 }
5276 /* For __builtin_frame_address, return what we've got. */
5284 }
5285 }
5287 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
5288 failed and the caller should emit a normal call. */
5290 static rtx
5292 {
5293 rtx op0;
5294 rtx result;
5297 HOST_WIDE_INT max_size;
5300 bool valid_arglist
5303 VOID_TYPE)
5314 || (!alloca_for_var
5317 ))
5318 {
5319 /* -Walloca-larger-than and -Wvla-larger-than settings of
5320 less than HOST_WIDE_INT_MAX override the more general
5321 -Walloc-size-larger-than so unless either of the former
5322 options is smaller than the last one (wchich would imply
5323 that the call was already checked), check the alloca
5324 arguments for overflow. */
5328 }
5330 /* Compute the argument. */
5333 /* Compute the alignment. */
5335 ? BIGGEST_ALIGNMENT
5338 /* Compute the maximum size. */
5343 /* Allocate the desired space. If the allocation stems from the declaration
5344 of a variable-sized object, it cannot accumulate. */
5345 result
5350 }
5352 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5353 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5354 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5355 handle_builtin_stack_restore function. */
5357 static rtx
5359 {
5366 OPTAB_LIB_WIDEN);
5369 OPTAB_LIB_WIDEN);
5374 }
5376 /* Expand a call to bswap builtin in EXP.
5377 Return NULL_RTX if a normal call should be emitted rather than expanding the
5378 function in-line. If convenient, the result should be placed in TARGET.
5379 SUBTARGET may be used as the target for computing one of EXP's operands. */
5381 static rtx
5383 rtx subtarget)
5384 {
5385 tree arg;
5386 rtx op0;
5404 }
5406 /* Expand a call to a unary builtin in EXP.
5407 Return NULL_RTX if a normal call should be emitted rather than expanding the
5408 function in-line. If convenient, the result should be placed in TARGET.
5409 SUBTARGET may be used as the target for computing one of EXP's operands. */
5411 static rtx
5414 {
5415 rtx op0;
5420 /* Compute the argument. */
5422 (subtarget
5426 /* Compute op, into TARGET if possible.
5427 Set TARGET to wherever the result comes back. */
5433 }
5435 /* Expand a call to __builtin_expect. We just return our argument
5436 as the builtin_expect semantic should've been already executed by
5437 tree branch prediction pass. */
5439 static rtx
5441 {
5442 tree arg;
5449 /* When guessing was done, the hints should be already stripped away. */
5453 }
5455 /* Expand a call to __builtin_expect_with_probability. We just return our
5456 argument as the builtin_expect semantic should've been already executed by
5457 tree branch prediction pass. */
5459 static rtx
5461 {
5462 tree arg;
5469 /* When guessing was done, the hints should be already stripped away. */
5473 }
5476 /* Expand a call to __builtin_assume_aligned. We just return our first
5477 argument as the builtin_assume_aligned semantic should've been already
5478 executed by CCP. */
5480 static rtx
5482 {
5486 EXPAND_NORMAL);
5491 }
5493 void
5495 {
5497 {
5499 /* For trap insns when not accumulating outgoing args force
5500 REG_ARGS_SIZE note to prevent crossjumping of calls with
5501 different args sizes. */
5504 }
5505 else
5506 {
5510 }
5513 }
5515 /* Expand a call to __builtin_unreachable. We do nothing except emit
5516 a barrier saying that control flow will not pass here.
5518 It is the responsibility of the program being compiled to ensure
5519 that control flow does never reach __builtin_unreachable. */
5520 static void
5522 {
5524 }
5526 /* Expand EXP, a call to fabs, fabsf or fabsl.
5527 Return NULL_RTX if a normal call should be emitted rather than expanding
5528 the function inline. If convenient, the result should be placed
5529 in TARGET. SUBTARGET may be used as the target for computing
5530 the operand. */
5532 static rtx
5534 {
5535 machine_mode mode;
5536 tree arg;
5537 rtx op0;
5547 }
5549 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5550 Return NULL is a normal call should be emitted rather than expanding the
5551 function inline. If convenient, the result should be placed in TARGET.
5552 SUBTARGET may be used as the target for computing the operand. */
5554 static rtx
5556 {
5558 tree arg;
5570 }
5572 /* Expand a call to __builtin___clear_cache. */
5574 static rtx
5576 {
5578 {
5579 #ifdef CLEAR_INSN_CACHE
5580 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5581 does something. Just do the default expansion to a call to
5582 __clear_cache(). */
5584 #else
5585 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5586 does nothing. There is no need to call it. Do nothing. */
5589 }
5591 /* We have a "clear_cache" insn, and it will handle everything. */
5595 /* We must not expand to a library call. If we did, any
5596 fallback library function in libgcc that might contain a call to
5597 __builtin___clear_cache() would recurse infinitely. */
5599 {
5602 }
5605 {
5618 }
5620 }
5622 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5624 static rtx
5626 {
5629 /* If we don't need too much alignment, we'll have been guaranteed
5630 proper alignment by get_trampoline_type. */
5634 /* Round address up to desired boundary. */
5645 }
5647 static rtx
5649 {
5665 /* If ONSTACK, the TRAMP argument should be the address of a field
5666 within the local function's FRAME decl. Either way, let's see if
5667 we can fill in the MEM_ATTRs for this memory. */
5671 /* Creator of a heap trampoline is responsible for making sure the
5672 address is aligned to at least STACK_BOUNDARY. Normally malloc
5673 will ensure this anyhow. */
5676 {
5680 }
5682 /* The FUNC argument should be the address of the nested function.
5683 Extract the actual function decl to pass to the hook. */
5690 /* Generate insns to initialize the trampoline. */
5694 {
5700 }
5703 }
5705 static rtx
5707 {
5708 rtx tramp;
5719 }
5721 /* Expand a call to the builtin descriptor initialization routine.
5722 A descriptor is made up of a couple of pointers to the static
5723 chain and the code entry in this order. */
5725 static rtx
5727 {
5732 VOID_TYPE))
5746 /* Generate insns to initialize the descriptor. */
5752 }
5754 /* Expand a call to the builtin descriptor adjustment routine. */
5756 static rtx
5758 {
5759 rtx tramp;
5766 /* Unalign the descriptor to allow runtime identification. */
5771 }
5773 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5774 function. The function first checks whether the back end provides
5775 an insn to implement signbit for the respective mode. If not, it
5776 checks whether the floating point format of the value is such that
5777 the sign bit can be extracted. If that is not the case, error out.
5778 EXP is the expression that is a call to the builtin function; if
5779 convenient, the result should be placed in TARGET. */
5780 static rtx
5782 {
5784 scalar_float_mode fmode;
5786 tree arg;
5789 rtx temp;
5802 /* Expand the argument yielding a RTX expression. */
5805 /* Check if the back end provides an insn that handles signbit for the
5806 argument's mode. */
5809 {
5815 }
5817 /* For floating point formats without a sign bit, implement signbit
5818 as "ARG < 0.0". */
5821 {
5822 /* But we can't do this if the format supports signed zero. */
5828 }
5831 {
5834 }
5835 else
5836 {
5838 /* Handle targets with different FP word orders. */
5841 else
5845 }
5847 /* Force the intermediate word_mode (or narrower) result into a
5848 register. This avoids attempting to create paradoxical SUBREGs
5849 of floating point modes below. */
5852 /* If the bitpos is within the "result mode" lowpart, the operation
5853 can be implement with a single bitwise AND. Otherwise, we need
5854 a right shift and an AND. */
5857 {
5865 }
5866 else
5867 {
5868 /* Perform a logical right shift to place the signbit in the least
5869 significant bit, then truncate the result to the desired mode
5870 and mask just this bit. */
5875 }
5878 }
5880 /* Expand fork or exec calls. TARGET is the desired target of the
5881 call. EXP is the call. FN is the
5882 identificator of the actual function. IGNORE is nonzero if the
5883 value is to be ignored. */
5885 static rtx
5887 {
5889 tree call;
5891 /* If we are not profiling, just call the function. */
5895 /* Otherwise call the wrapper. This should be equivalent for the rest of
5896 compiler, so the code does not diverge, and the wrapper may run the
5897 code necessary for keeping the profiling sane. */
5900 {
5931 }
5943 }
5946 \f
5947 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5948 the pointer in these functions is void*, the tree optimizers may remove
5949 casts. The mode computed in expand_builtin isn't reliable either, due
5950 to __sync_bool_compare_and_swap.
5952 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5953 group of builtins. This gives us log2 of the mode size. */
5957 {
5958 /* The size is not negotiable, so ask not to get BLKmode in return
5959 if the target indicates that a smaller size would be better. */
5961 }
5963 /* Expand the memory expression LOC and return the appropriate memory operand
5964 for the builtin_sync operations. */
5966 static rtx
5968 {
5978 /* Note that we explicitly do not want any alias information for this
5979 memory, so that we kill all other live memories. Otherwise we don't
5980 satisfy the full barrier semantics of the intrinsic. */
5987 /* The alignment needs to be at least according to that of the mode. */
5994 }
5996 /* Make sure an argument is in the right mode.
5997 EXP is the tree argument.
5998 MODE is the mode it should be in. */
6000 static rtx
6002 {
6003 rtx val;
6004 machine_mode old_mode;
6007 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
6008 of CONST_INTs, where we know the old_mode only from the call argument. */
6015 }
6018 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
6019 EXP is the CALL_EXPR. CODE is the rtx code
6020 that corresponds to the arithmetic or logical operation from the name;
6021 an exception here is that NOT actually means NAND. TARGET is an optional
6022 place for us to store the results; AFTER is true if this is the
6023 fetch_and_xxx form. */
6025 static rtx
6028 rtx target)
6029 {
6034 {
6041 {
6070 }
6071 }
6073 /* Expand the operands. */
6078 after);
6079 }
6081 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
6082 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
6083 true if this is the boolean form. TARGET is a place for us to store the
6084 results; this is NOT optional if IS_BOOL is true. */
6086 static rtx
6089 {
6093 /* Expand the operands. */
6100 {
6103 else
6105 }
6108 MEMMODEL_SYNC_SEQ_CST))
6112 }
6114 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
6115 general form is actually an atomic exchange, and some targets only
6116 support a reduced form with the second argument being a constant 1.
6117 EXP is the CALL_EXPR; TARGET is an optional place for us to store
6118 the results. */
6120 static rtx
6122 rtx target)
6123 {
6126 /* Expand the operands. */
6131 }
6133 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
6135 static void
6137 {
6138 rtx mem;
6140 /* Expand the operands. */
6144 }
6146 /* Given an integer representing an ``enum memmodel'', verify its
6147 correctness and return the memory model enum. */
6149 static enum memmodel
6151 {
6152 rtx op;
6154 location_t loc
6157 /* If the parameter is not a constant, it's a run time value so we'll just
6158 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
6168 {
6172 }
6174 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
6176 {
6180 }
6182 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
6183 be conservative and promote consume to acquire. */
6188 }
6190 /* Expand the __atomic_exchange intrinsic:
6191 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
6192 EXP is the CALL_EXPR.
6193 TARGET is an optional place for us to store the results. */
6195 static rtx
6197 {
6206 /* Expand the operands. */
6211 }
6213 /* Expand the __atomic_compare_exchange intrinsic:
6214 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
6215 TYPE desired, BOOL weak,
6216 enum memmodel success,
6217 enum memmodel failure)
6218 EXP is the CALL_EXPR.
6219 TARGET is an optional place for us to store the results. */
6221 static rtx
6223 rtx target)
6224 {
6228 tree weak;
6230 location_t loc
6237 {
6239 "failure memory model cannot be stronger than success "
6242 }
6245 {
6247 "invalid failure memory model for "
6251 }
6257 /* Expand the operands. */
6273 /* Lest the rtl backend create a race condition with an imporoper store
6274 to memory, always create a new pseudo for OLDVAL. */
6281 /* Conditionally store back to EXPECT, lest we create a race condition
6282 with an improper store to memory. */
6283 /* ??? With a rearrangement of atomics at the gimple level, we can handle
6284 the normal case where EXPECT is totally private, i.e. a register. At
6285 which point the store can be unconditional. */
6293 }
6295 /* Helper function for expand_ifn_atomic_compare_exchange - expand
6296 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
6297 call. The weak parameter must be dropped to match the expected parameter
6298 list and the expected argument changed from value to pointer to memory
6299 slot. */
6301 static void
6303 {
6319 /* Skip the boolean weak parameter. */
6322 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6325 built_in_function fncode
6330 fndecl);
6335 {
6342 }
6343 }
6345 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6347 void
6349 {
6355 tree lhs;
6357 location_t loc
6364 {
6366 "failure memory model cannot be stronger than success "
6369 }
6372 {
6374 "invalid failure memory model for "
6378 }
6381 {
6384 }
6386 /* Expand the operands. */
6399 {
6402 }
6406 {
6412 }
6413 }
6415 /* Expand the __atomic_load intrinsic:
6416 TYPE __atomic_load (TYPE *object, enum memmodel)
6417 EXP is the CALL_EXPR.
6418 TARGET is an optional place for us to store the results. */
6420 static rtx
6422 {
6423 rtx mem;
6428 {
6429 location_t loc
6434 }
6439 /* Expand the operand. */
6443 }
6446 /* Expand the __atomic_store intrinsic:
6447 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6448 EXP is the CALL_EXPR.
6449 TARGET is an optional place for us to store the results. */
6451 static rtx
6453 {
6460 {
6461 location_t loc
6466 }
6471 /* Expand the operands. */
6476 }
6478 /* Expand the __atomic_fetch_XXX intrinsic:
6479 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6480 EXP is the CALL_EXPR.
6481 TARGET is an optional place for us to store the results.
6482 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6483 FETCH_AFTER is true if returning the result of the operation.
6484 FETCH_AFTER is false if returning the value before the operation.
6485 IGNORE is true if the result is not used.
6486 EXT_CALL is the correct builtin for an external call if this cannot be
6487 resolved to an instruction sequence. */
6489 static rtx
6493 {
6496 tree fndecl;
6497 tree addr;
6501 /* Expand the operands. */
6505 /* Only try generating instructions if inlining is turned on. */
6507 {
6511 }
6513 /* Return if a different routine isn't needed for the library call. */
6517 /* Change the call to the specified function. */
6525 /* If we will emit code after the call, the call can not be a tail call.
6526 If it is emitted as a tail call, a barrier is emitted after it, and
6527 then all trailing code is removed. */
6531 /* Expand the call here so we can emit trailing code. */
6534 /* Replace the original function just in case it matters. */
6537 /* Then issue the arithmetic correction to return the right result. */
6539 {
6541 {
6543 OPTAB_LIB_WIDEN);
6545 }
6546 else
6548 OPTAB_LIB_WIDEN);
6549 }
6551 }
6553 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6555 void
6557 {
6565 optab optab;
6577 {
6592 }
6595 {
6602 }
6624 {
6629 }
6630 else
6632 OPTAB_DIRECT);
6635 }
6637 /* Expand an atomic clear operation.
6638 void _atomic_clear (BOOL *obj, enum memmodel)
6639 EXP is the call expression. */
6641 static rtx
6643 {
6644 machine_mode mode;
6653 {
6654 location_t loc
6659 }
6661 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6662 Failing that, a store is issued by __atomic_store. The only way this can
6663 fail is if the bool type is larger than a word size. Unlikely, but
6664 handle it anyway for completeness. Assume a single threaded model since
6665 there is no atomic support in this case, and no barriers are required. */
6670 }
6672 /* Expand an atomic test_and_set operation.
6673 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6674 EXP is the call expression. */
6676 static rtx
6678 {
6679 rtx mem;
6681 machine_mode mode;
6688 }
6691 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6692 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6694 static tree
6696 {
6698 machine_mode mode;
6704 /* We need a corresponding integer mode for the access to be lock-free. */
6712 {
6715 /* Either this argument is null, or it's a fake pointer encoding
6716 the alignment of the object. */
6722 else
6724 }
6725 else
6726 {
6729 /* This function is usually invoked and folded immediately by the front
6730 end before anything else has a chance to look at it. The pointer
6731 parameter at this point is usually cast to a void *, so check for that
6732 and look past the cast. */
6742 /* Get the underlying type of the object. */
6745 }
6747 /* If the object has smaller alignment, the lock free routines cannot
6748 be used. */
6752 /* Check if a compare_and_swap pattern exists for the mode which represents
6753 the required size. The pattern is not allowed to fail, so the existence
6754 of the pattern indicates support is present. Also require that an
6755 atomic load exists for the required size. */
6758 else
6760 }
6762 /* Return true if the parameters to call EXP represent an object which will
6763 always generate lock free instructions. The first argument represents the
6764 size of the object, and the second parameter is a pointer to the object
6765 itself. If NULL is passed for the object, then the result is based on
6766 typical alignment for an object of the specified size. Otherwise return
6767 false. */
6769 static rtx
6771 {
6772 tree size;
6777 {
6780 }
6786 }
6788 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6789 is lock free on this architecture. */
6791 static tree
6793 {
6797 /* If it isn't always lock free, don't generate a result. */
6802 }
6804 /* Return true if the parameters to call EXP represent an object which will
6805 always generate lock free instructions. The first argument represents the
6806 size of the object, and the second parameter is a pointer to the object
6807 itself. If NULL is passed for the object, then the result is based on
6808 typical alignment for an object of the specified size. Otherwise return
6809 NULL*/
6811 static rtx
6813 {
6814 tree size;
6819 {
6822 }
6827 /* If the value is known at compile time, return the RTX for it. */
6833 }
6835 /* Expand the __atomic_thread_fence intrinsic:
6836 void __atomic_thread_fence (enum memmodel)
6837 EXP is the CALL_EXPR. */
6839 static void
6841 {
6844 }
6846 /* Expand the __atomic_signal_fence intrinsic:
6847 void __atomic_signal_fence (enum memmodel)
6848 EXP is the CALL_EXPR. */
6850 static void
6852 {
6855 }
6857 /* Expand the __sync_synchronize intrinsic. */
6859 static void
6861 {
6863 }
6865 static rtx
6867 {
6873 {
6875 /* If the target is not sutitable then create a new target. */
6883 }
6886 }
6888 static void
6890 {
6896 {
6903 }
6905 }
6907 \f
6908 /* Emit code to restore the current value of stack. */
6910 static void
6912 {
6924 }
6926 /* Emit code to save the current value of stack. */
6928 static rtx
6930 {
6935 }
6937 /* Emit code to get the openacc gang, worker or vector id or size. */
6939 static rtx
6941 {
6943 rtx fallback_retval;
6946 {
6959 }
6962 {
6965 }
6969 {
6972 }
6976 {
6984 }
6993 {
6996 }
7004 }
7006 /* Expand a string compare operation using a sequence of char comparison
7007 to get rid of the calling overhead, with result going to TARGET if
7008 that's convenient.
7010 VAR_STR is the variable string source;
7011 CONST_STR is the constant string source;
7012 LENGTH is the number of chars to compare;
7013 CONST_STR_N indicates which source string is the constant string;
7014 IS_MEMCMP indicates whether it's a memcmp or strcmp.
7016 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
7018 target = (int) (unsigned char) var_str[0]
7019 - (int) (unsigned char) const_str[0];
7020 if (target != 0)
7021 goto ne_label;
7022 ...
7023 target = (int) (unsigned char) var_str[length - 2]
7024 - (int) (unsigned char) const_str[length - 2];
7025 if (target != 0)
7026 goto ne_label;
7027 target = (int) (unsigned char) var_str[length - 1]
7028 - (int) (unsigned char) const_str[length - 1];
7029 ne_label:
7030 */
7032 static rtx
7036 {
7038 rtx var_rtx_array
7045 scalar_int_mode unit_mode
7051 {
7052 var_rtx
7066 }
7074 }
7076 /* Inline expansion a call to str(n)cmp, with result going to
7077 TARGET if that's convenient.
7078 If the call is not been inlined, return NULL_RTX. */
7079 static rtx
7081 {
7087 /* Do NOT apply this inlining expansion when optimizing for size or
7088 optimization level below 2. */
7096 /* On a target where the type of the call (int) has same or narrower presicion
7097 than unsigned char, give up the inlining expansion. */
7113 /* If neither strings is constant string, the call is not qualify. */
7117 /* For strncmp, if the length is not a const, not qualify. */
7128 else
7137 /* If the length of the comparision is larger than the threshold,
7138 do nothing. */
7145 /* Now, start inline expansion the call. */
7149 }
7151 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
7152 represents the size of the first argument to that call, or VOIDmode
7153 if the argument is a pointer. IGNORE will be true if the result
7154 isn't used. */
7155 static rtx
7158 {
7165 {
7168 }
7172 /* An optional second argument can be used as a failsafe value on
7173 some machines. If it isn't present, then the failsafe value is
7174 assumed to be 0. */
7176 {
7179 }
7180 else
7183 /* If the result isn't used, the behavior is undefined. It would be
7184 nice to emit a warning here, but path splitting means this might
7185 happen with legitimate code. So simply drop the builtin
7186 expansion in that case; we've handled any side-effects above. */
7190 /* If we don't have a suitable target, create one to hold the result. */
7198 }
7200 /* Expand an expression EXP that calls a built-in function,
7201 with result going to TARGET if that's convenient
7202 (and in mode MODE if that's convenient).
7203 SUBTARGET may be used as the target for computing one of EXP's operands.
7204 IGNORE is nonzero if the value is to be ignored. */
7206 rtx
7209 {
7218 /* When ASan is enabled, we don't want to expand some memory/string
7219 builtins and rely on libsanitizer's hooks. This allows us to avoid
7220 redundant checks and be sure, that possible overflow will be detected
7221 by ASan. */
7226 /* When not optimizing, generate calls to library functions for a certain
7227 set of builtins. */
7241 /* The built-in function expanders test for target == const0_rtx
7242 to determine whether the function's result will be ignored. */
7246 /* If the result of a pure or const built-in function is ignored, and
7247 none of its arguments are volatile, we can avoid expanding the
7248 built-in call and just evaluate the arguments for side-effects. */
7252 {
7254 tree arg;
7255 call_expr_arg_iterator iter;
7259 {
7262 }
7265 {
7269 }
7270 }
7273 {
7291 /* Just do a normal library call if we were unable to fold
7292 the values. */
7369 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7370 FUNCTION with a copy of the parameters described by
7371 ARGUMENTS, and ARGSIZE. It returns a block of memory
7372 allocated on the stack into which is stored all the registers
7373 that might possibly be used for returning the result of a
7374 function. ARGUMENTS is the value returned by
7375 __builtin_apply_args. ARGSIZE is the number of bytes of
7376 arguments that must be copied. ??? How should this value be
7377 computed? We'll also need a safe worst case value for varargs
7378 functions. */
7385 else
7386 {
7394 }
7396 /* __builtin_return (RESULT) causes the function to return the
7397 value described by RESULT. RESULT is address of the block of
7398 memory returned by __builtin_apply. */
7408 /* All valid uses of __builtin_va_arg_pack () are removed during
7409 inlining. */
7414 /* All valid uses of __builtin_va_arg_pack_len () are removed during
7415 inlining. */
7419 /* Return the address of the first anonymous stack arg. */
7441 /* Returns the address of the area where the structure is returned.
7442 0 otherwise. */
7448 else
7451 CASE_BUILT_IN_ALLOCA:
7601 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7602 back to a BUILT_IN_STRCMP. Remember to delete the 3rd paramater
7603 when changing it to a strcmp call. */
7609 /* Change this call back to a BUILT_IN_STRCMP. */
7613 /* Delete the last parameter. */
7620 /* FALLTHROUGH */
7628 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7629 back to a BUILT_IN_STRNCMP. */
7635 /* Change it back to a BUILT_IN_STRNCMP. */
7638 /* FALLTHROUGH */
7653 {
7656 }
7660 /* This should have been lowered to the builtins below. */
7664 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7665 and the receiver label. */
7667 {
7673 /* This is copied from the handling of non-local gotos. */
7675 nonlocal_goto_handler_labels
7677 nonlocal_goto_handler_labels);
7678 /* ??? Do not let expand_label treat us as such since we would
7679 not want to be both on the list of non-local labels and on
7680 the list of forced labels. */
7683 }
7687 /* __builtin_setjmp_receiver is passed the receiver label. */
7689 {
7695 }
7698 /* __builtin_longjmp is passed a pointer to an array of five words.
7699 It's similar to the C library longjmp function but works with
7700 __builtin_setjmp above. */
7703 {
7709 {
7712 }
7716 }
7725 /* This updates the setjmp buffer that is its argument with the value
7726 of the current stack pointer. */
7729 {
7730 rtx buf_addr
7735 }
7755 /* Various hooks for the DWARF 2 __throw routine. */
7761 #ifdef DWARF2_UNWIND_INFO
7767 #endif
7969 mode = get_builtin_sync_mode
7981 mode = get_builtin_sync_mode
8028 {
8032 mode =
8038 /* If this is turned into an external library call, the weak parameter
8039 must be dropped to match the expected parameter list. */
8044 /* Skip the boolean weak parameter. */
8049 }
8078 {
8088 }
8094 {
8104 }
8110 {
8120 }
8126 {
8136 }
8142 {
8152 }
8158 {
8168 }
8305 /* Do library call, if we failed to expand the builtin when
8306 folding. */
8326 }
8328 /* The switch statement above can drop through to cause the function
8329 to be called normally. */
8331 }
8333 /* Determine whether a tree node represents a call to a built-in
8334 function. If the tree T is a call to a built-in function with
8335 the right number of arguments of the appropriate types, return
8336 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8337 Otherwise the return value is END_BUILTINS. */
8339 enum built_in_function
8341 {
8344 const_call_expr_arg_iterator iter;
8356 {
8357 /* If a function doesn't take a variable number of arguments,
8358 the last element in the list will have type `void'. */
8361 {
8365 }
8374 {
8377 }
8379 {
8382 }
8384 {
8387 }
8389 {
8392 }
8393 else
8395 }
8397 /* Variable-length argument list. */
8399 }
8401 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
8402 evaluate to a constant. */
8404 static tree
8406 {
8407 /* We return 1 for a numeric type that's known to be a constant
8408 value at compile-time or for an aggregate type that's a
8409 literal constant. */
8412 /* If we know this is a constant, emit the constant of one. */
8418 {
8425 }
8427 /* If this expression has side effects, show we don't know it to be a
8428 constant. Likewise if it's a pointer or aggregate type since in
8429 those case we only want literals, since those are only optimized
8430 when generating RTL, not later.
8431 And finally, if we are compiling an initializer, not code, we
8432 need to return a definite result now; there's not going to be any
8433 more optimization done. */
8438 || folding_initializer
8443 }
8445 /* Create builtin_expect or builtin_expect_with_probability
8446 with PRED and EXPECTED as its arguments and return it as a truthvalue.
8447 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
8448 builtin_expect_with_probability instead uses third argument as PROBABILITY
8449 value. */
8451 static tree
8454 {
8469 else
8471 predictor);
8475 }
8477 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
8478 NULL_TREE if no simplification is possible. */
8480 tree
8482 tree arg3)
8483 {
8487 /* Distribute the expected value over short-circuiting operators.
8488 See through the cast from truthvalue_type_node to long. */
8495 /* If this is a builtin_expect within a builtin_expect keep the
8496 inner one. See through a comparison against a constant. It
8497 might have been added to create a thruthvalue. */
8513 {
8523 }
8525 /* If the argument isn't invariant then there's nothing else we can do. */
8529 /* If we expect that a comparison against the argument will fold to
8530 a constant return the constant. In practice, this means a true
8531 constant or the address of a non-weak symbol. */
8535 {
8536 do
8537 {
8539 }
8544 }
8546 /* Otherwise, ARG0 already has the proper type for the return value. */
8548 }
8550 /* Fold a call to __builtin_classify_type with argument ARG. */
8552 static tree
8554 {
8559 }
8561 /* Fold a call to __builtin_strlen with argument ARG. */
8563 static tree
8565 {
8568 else
8569 {
8570 c_strlen_data data;
8581 {
8587 }
8590 }
8591 }
8593 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8595 static tree
8597 {
8598 REAL_VALUE_TYPE real;
8600 /* __builtin_inff is intended to be usable to define INFINITY on all
8601 targets. If an infinity is not available, INFINITY expands "to a
8602 positive constant of type float that overflows at translation
8603 time", footnote "In this case, using INFINITY will violate the
8604 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8605 Thus we pedwarn to ensure this constraint violation is
8606 diagnosed. */
8612 }
8614 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8615 NULL_TREE if no simplification can be made. */
8617 static tree
8620 {
8621 tree type;
8631 /* Calculate the result when the argument is a constant. */
8636 /* Canonicalize sincos to cexpi. */
8638 {
8641 }
8643 {
8650 }
8662 }
8664 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8665 Return NULL_TREE if no simplification can be made. */
8667 static tree
8669 {
8675 /* If the LEN parameter is zero, return zero. */
8680 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8684 /* If len parameter is one, return an expression corresponding to
8685 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8687 {
8689 tree cst_uchar_ptr_node
8692 tree ind1
8696 cst_uchar_ptr_node,
8697 arg1)));
8698 tree ind2
8702 cst_uchar_ptr_node,
8703 arg2)));
8705 }
8708 }
8710 /* Fold a call to builtin isascii with argument ARG. */
8712 static tree
8714 {
8717 else
8718 {
8719 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8725 }
8726 }
8728 /* Fold a call to builtin toascii with argument ARG. */
8730 static tree
8732 {
8736 /* Transform toascii(c) -> (c & 0x7f). */
8739 }
8741 /* Fold a call to builtin isdigit with argument ARG. */
8743 static tree
8745 {
8748 else
8749 {
8750 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8751 /* According to the C standard, isdigit is unaffected by locale.
8752 However, it definitely is affected by the target character set. */
8753 unsigned HOST_WIDE_INT target_digit0
8764 }
8765 }
8767 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8769 static tree
8771 {
8777 }
8779 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8781 static tree
8783 {
8789 }
8791 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8793 static tree
8795 {
8798 {
8802 {
8807 }
8808 }
8811 }
8813 /* Fold a call to builtin frexp, we can assume the base is 2. */
8815 static tree
8817 {
8828 /* Proceed if a valid pointer type was passed in. */
8830 {
8835 {
8837 /* For +-0, return (*exp = 0, +-0). */
8843 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8846 {
8847 /* Since the frexp function always expects base 2, and in
8848 GCC normalized significands are already in the range
8849 [0.5, 1.0), we have exactly what frexp wants. */
8854 }
8858 }
8860 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8864 }
8867 }
8869 /* Fold a call to builtin modf. */
8871 static tree
8873 {
8884 /* Proceed if a valid pointer type was passed in. */
8886 {
8891 {
8894 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8898 /* For +-Inf, return (*arg1 = arg0, +-0). */
8904 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8907 /* If the original number was negative and already
8908 integral, then the fractional part is -0.0. */
8912 }
8914 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8920 }
8923 }
8925 /* Given a location LOC, an interclass builtin function decl FNDECL
8926 and its single argument ARG, return an folded expression computing
8927 the same, or NULL_TREE if we either couldn't or didn't want to fold
8928 (the latter happen if there's an RTL instruction available). */
8930 static tree
8932 {
8933 machine_mode mode;
8945 /* If there is no optab, try generic code. */
8947 {
8948 tree result;
8951 {
8952 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8955 REAL_VALUE_TYPE r;
8959 {
8960 /* NaN and Inf are encoded in the high-order double value
8961 only. The low-order value is not significant. */
8965 }
8972 }
8975 {
8976 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8979 REAL_VALUE_TYPE r;
8983 {
8984 /* NaN and Inf are encoded in the high-order double value
8985 only. The low-order value is not significant. */
8989 }
8995 /*result = fold_build2_loc (loc, UNGT_EXPR,
8996 TREE_TYPE (TREE_TYPE (fndecl)),
8997 fold_build1_loc (loc, ABS_EXPR, type, arg),
8998 build_real (type, r));
8999 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
9000 TREE_TYPE (TREE_TYPE (fndecl)),
9001 result);*/
9003 }
9005 {
9006 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
9007 islessequal(fabs(x),DBL_MAX). */
9017 {
9018 /* Use double to test the normal range of IBM extended
9019 precision. Emin for IBM extended precision is
9020 different to emin for IEEE double, being 53 higher
9021 since the low double exponent is at least 53 lower
9022 than the high double exponent. */
9026 }
9038 {
9039 /* Testing the high end of the range is done just using
9040 the high double, using the same test as isfinite().
9041 For the subnormal end of the range we first test the
9042 high double, then if its magnitude is equal to the
9043 limit of 0x1p-969, we test whether the low double is
9044 non-zero and opposite sign to the high double. */
9060 integer_type_node,
9066 }
9067 else
9068 {
9069 tree const isge_fn
9072 }
9076 }
9079 }
9082 }
9084 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
9085 ARG is the argument for the call. */
9087 static tree
9089 {
9096 {
9104 {
9105 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
9106 /* In a boolean context, GCC will fold the inner COND_EXPR to
9107 1. So e.g. "if (isinf_sign(x))" would be folded to just
9108 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
9116 {
9129 integer_zero_node);
9130 }
9133 }
9146 {
9149 {
9150 /* NaN and Inf are encoded in the high-order double value
9151 only. The low-order value is not significant. */
9153 }
9154 }
9160 }
9161 }
9163 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
9164 This builtin will generate code to return the appropriate floating
9165 point classification depending on the value of the floating point
9166 number passed in. The possible return values must be supplied as
9167 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
9168 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
9169 one floating point argument which is "type generic". */
9171 static tree
9173 {
9176 machine_mode mode;
9177 REAL_VALUE_TYPE r;
9180 /* Verify the required arguments in the original call. */
9200 /* fpclassify(x) ->
9201 isnan(x) ? FP_NAN :
9202 (fabs(x) == Inf ? FP_INFINITE :
9203 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9204 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9218 {
9224 }
9227 {
9230 }
9233 }
9235 /* Fold a call to an unordered comparison function such as
9236 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9237 being called and ARG0 and ARG1 are the arguments for the call.
9238 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9239 the opposite of the desired result. UNORDERED_CODE is used
9240 for modes that can hold NaNs and ORDERED_CODE is used for
9241 the rest. */
9243 static tree
9247 {
9261 /* Choose the wider of two real types. */
9273 {
9277 }
9282 }
9284 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9285 arithmetics if it can never overflow, or into internal functions that
9286 return both result of arithmetics and overflowed boolean flag in
9287 a complex integer result, or some other check for overflow.
9288 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9289 checking part of that. */
9291 static tree
9294 {
9296 /* The code of the expression corresponding to the type-generic
9297 built-in, or ERROR_MARK for the type-specific ones. */
9302 {
9305 /* FALLTHRU */
9308 /* FALLTHRU */
9319 /* FALLTHRU */
9322 /* FALLTHRU */
9333 /* FALLTHRU */
9336 /* FALLTHRU */
9347 }
9349 /* For the "generic" overloads, the first two arguments can have different
9350 types and the last argument determines the target type to use to check
9351 for overflow. The arguments of the other overloads all have the same
9352 type. */
9355 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
9356 arguments are constant, attempt to fold the built-in call into a constant
9357 expression indicating whether or not it detected an overflow. */
9361 /* Perform the computation in the target type and check for overflow. */
9365 arg2);
9379 tree store
9382 }
9384 /* Fold a call to __builtin_FILE to a constant string. */
9388 {
9390 {
9391 /* The documentation says this builtin is equivalent to the preprocessor
9392 __FILE__ macro so it appears appropriate to use the same file prefix
9393 mappings. */
9396 }
9399 }
9401 /* Fold a call to __builtin_FUNCTION to a constant string. */
9405 {
9412 }
9414 /* Fold a call to __builtin_LINE to an integer constant. */
9418 {
9420 }
9422 /* Fold a call to built-in function FNDECL with 0 arguments.
9423 This function returns NULL_TREE if no simplification was possible. */
9425 static tree
9427 {
9431 {
9457 }
9459 }
9461 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9462 This function returns NULL_TREE if no simplification was possible. */
9464 static tree
9466 {
9477 {
9479 {
9482 /* Gimplification will pull the CALL_EXPR for the builtin out of
9483 an if condition. When not optimizing, we'll not CSE it back.
9484 To avoid link error types of regressions, return false now. */
9489 }
9545 {
9550 }
9556 {
9561 }
9582 }
9586 }
9588 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
9589 This function returns NULL_TREE if no simplification was possible. */
9591 static tree
9593 {
9605 {
9649 NOP_EXPR);
9651 /* We do the folding for va_start in the expander. */
9666 }
9668 }
9670 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9671 and ARG2.
9672 This function returns NULL_TREE if no simplification was possible. */
9674 static tree
9677 {
9691 {
9740 }
9742 }
9744 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9745 arguments. IGNORE is true if the result of the
9746 function call is ignored. This function returns NULL_TREE if no
9747 simplification was possible. */
9749 tree
9751 {
9755 {
9771 }
9773 {
9777 }
9779 }
9781 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9782 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9783 of arguments in ARGS to be omitted. OLDNARGS is the number of
9784 elements in ARGS. */
9786 static tree
9789 {
9794 {
9802 }
9803 else
9807 }
9809 /* Return true if FNDECL shouldn't be folded right now.
9810 If a built-in function has an inline attribute always_inline
9811 wrapper, defer folding it after always_inline functions have
9812 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9813 might not be performed. */
9815 bool
9817 {
9820 && cfun
9823 }
9825 /* A wrapper function for builtin folding that prevents warnings for
9826 "statement without effect" and the like, caused by removing the
9827 call node earlier than the warning is generated. */
9829 tree
9831 {
9835 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9836 yet. Defer folding until we see all the arguments
9837 (after inlining). */
9839 {
9842 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9843 instead last argument is __builtin_va_arg_pack (). Defer folding
9844 even in that case, until arguments are finalized. */
9846 {
9850 }
9858 else
9859 {
9864 }
9865 }
9867 }
9869 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9870 N arguments are passed in the array ARGARRAY. Return a folded
9871 expression or NULL_TREE if no simplification was possible. */
9873 tree
9875 tree fn,
9878 {
9885 {
9886 /* If last argument is __builtin_va_arg_pack (), arguments to this
9887 function are not finalized yet. Defer folding until they are. */
9889 {
9893 }
9898 else
9900 }
9903 }
9905 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9906 along with N new arguments specified as the "..." parameters. SKIP
9907 is the number of arguments in EXP to be omitted. This function is used
9908 to do varargs-to-varargs transformations. */
9910 static tree
9912 {
9914 tree t;
9922 }
9924 /* Validate a single argument ARG against a tree code CODE representing
9925 a type. Return true when argument is valid. */
9927 static bool
9929 {
9937 }
9939 /* This function validates the types of a function call argument list
9940 against a specified list of tree_codes. If the last specifier is a 0,
9941 that represents an ellipses, otherwise the last specifier must be a
9942 VOID_TYPE.
9944 This is the GIMPLE version of validate_arglist. Eventually we want to
9945 completely convert builtins.c to work from GIMPLEs and the tree based
9946 validate_arglist will then be removed. */
9948 bool
9950 {
9954 const_tree arg;
9960 do
9961 {
9964 {
9966 /* This signifies an ellipses, any further arguments are all ok. */
9970 /* This signifies an endlink, if no arguments remain, return
9971 true, otherwise return false. */
9975 /* If no parameters remain or the parameter's code does not
9976 match the specified code, return false. Otherwise continue
9977 checking any remaining arguments. */
9982 }
9983 }
9986 /* We need gotos here since we can only have one VA_CLOSE in a
9987 function. */
9988 end: ;
9992 }
9994 /* Default target-specific builtin expander that does nothing. */
9996 rtx
9998 rtx target ATTRIBUTE_UNUSED,
9999 rtx subtarget ATTRIBUTE_UNUSED,
10000 machine_mode mode ATTRIBUTE_UNUSED,
10002 {
10004 }
10006 /* Returns true is EXP represents data that would potentially reside
10007 in a readonly section. */
10009 bool
10011 {
10021 /* Make sure we call decl_readonly_section only for trees it
10022 can handle (since it returns true for everything it doesn't
10023 understand). */
10028 else
10030 }
10032 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
10033 to the call, and TYPE is its return type.
10035 Return NULL_TREE if no simplification was possible, otherwise return the
10036 simplified form of the call as a tree.
10038 The simplified form may be a constant or other expression which
10039 computes the same value, but in a more efficient manner (including
10040 calls to other builtin functions).
10042 The call may contain arguments which need to be evaluated, but
10043 which are not useful to determine the result of the call. In
10044 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10045 COMPOUND_EXPR will be an argument which must be evaluated.
10046 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10047 COMPOUND_EXPR in the chain will contain the tree for the simplified
10048 form of the builtin function call. */
10050 static tree
10052 {
10056 else
10057 {
10058 tree fn;
10067 {
10069 tree tem;
10074 /* Return an offset into the constant string argument. */
10077 }
10080 /* strpbrk(x, "") == NULL.
10081 Evaluate and ignore s1 in case it had side-effects. */
10091 /* New argument list transforming strpbrk(s1, s2) to
10092 strchr(s1, s2[0]). */
10095 }
10096 }
10098 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
10099 to the call.
10101 Return NULL_TREE if no simplification was possible, otherwise return the
10102 simplified form of the call as a tree.
10104 The simplified form may be a constant or other expression which
10105 computes the same value, but in a more efficient manner (including
10106 calls to other builtin functions).
10108 The call may contain arguments which need to be evaluated, but
10109 which are not useful to determine the result of the call. In
10110 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10111 COMPOUND_EXPR will be an argument which must be evaluated.
10112 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10113 COMPOUND_EXPR in the chain will contain the tree for the simplified
10114 form of the builtin function call. */
10116 static tree
10118 {
10122 else
10123 {
10126 /* If either argument is "", return NULL_TREE. */
10128 /* Evaluate and ignore both arguments in case either one has
10129 side-effects. */
10133 }
10134 }
10136 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
10137 to the call.
10139 Return NULL_TREE if no simplification was possible, otherwise return the
10140 simplified form of the call as a tree.
10142 The simplified form may be a constant or other expression which
10143 computes the same value, but in a more efficient manner (including
10144 calls to other builtin functions).
10146 The call may contain arguments which need to be evaluated, but
10147 which are not useful to determine the result of the call. In
10148 this case we return a chain of COMPOUND_EXPRs. The LHS of each
10149 COMPOUND_EXPR will be an argument which must be evaluated.
10150 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
10151 COMPOUND_EXPR in the chain will contain the tree for the simplified
10152 form of the builtin function call. */
10154 static tree
10156 {
10160 else
10161 {
10162 /* If the first argument is "", return NULL_TREE. */
10165 {
10166 /* Evaluate and ignore argument s2 in case it has
10167 side-effects. */
10170 }
10172 /* If the second argument is "", return __builtin_strlen(s1). */
10175 {
10178 /* If the replacement _DECL isn't initialized, don't do the
10179 transformation. */
10184 }
10186 }
10187 }
10189 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
10190 produced. False otherwise. This is done so that we don't output the error
10191 or warning twice or three times. */
10193 bool
10195 {
10198 tree arg;
10199 /* There is good chance the current input_location points inside the
10200 definition of the va_start macro (perhaps on the token for
10201 builtin) in a system header, so warnings will not be emitted.
10202 Use the location in real source code. */
10203 location_t current_location =
10205 NULL);
10208 {
10211 }
10214 {
10216 {
10219 }
10221 }
10222 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
10223 when we checked the arguments and if needed issued a warning. */
10224 else
10225 {
10227 {
10228 /* Evidently an out of date version of <stdarg.h>; can't validate
10229 va_start's second argument, but can still work as intended. */
10231 OPT_Wvarargs,
10234 }
10236 {
10239 }
10241 }
10246 /* We destructively modify the call to be __builtin_va_start (ap, 0)
10247 or __builtin_next_arg (0) the first time we see it, after checking
10248 the arguments and if needed issuing a warning. */
10250 {
10253 /* Strip off all nops for the sake of the comparison. This
10254 is not quite the same as STRIP_NOPS. It does more.
10255 We must also strip off INDIRECT_EXPR for C++ reference
10256 parameters. */
10261 {
10262 /* FIXME: Sometimes with the tree optimizers we can get the
10263 not the last argument even though the user used the last
10264 argument. We just warn and set the arg to be the last
10265 argument so that we will get wrong-code because of
10266 it. */
10268 OPT_Wvarargs,
10270 }
10272 /* Undefined by C99 7.15.1.4p4 (va_start):
10273 "If the parameter parmN is declared with the register storage
10274 class, with a function or array type, or with a type that is
10275 not compatible with the type that results after application of
10276 the default argument promotions, the behavior is undefined."
10277 */
10279 {
10281 OPT_Wvarargs,
10282 "undefined behavior when second parameter of "
10284 }
10286 /* We want to verify the second parameter just once before the tree
10287 optimizers are run and then avoid keeping it in the tree,
10288 as otherwise we could warn even for correct code like:
10289 void foo (int i, ...)
10290 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
10293 else
10295 }
10297 }
10300 /* Expand a call EXP to __builtin_object_size. */
10302 static rtx
10304 {
10305 tree ost;
10310 {
10315 }
10323 {
10328 }
10333 }
10335 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10336 FCODE is the BUILT_IN_* to use.
10337 Return NULL_RTX if we failed; the caller should emit a normal call,
10338 otherwise try to get the result in TARGET, if convenient (and in
10339 mode MODE if that's convenient). */
10341 static rtx
10344 {
10346 POINTER_TYPE,
10347 fcode == BUILT_IN_MEMSET_CHK
10364 {
10365 /* Avoid transforming the checking call to an ordinary one when
10366 an overflow has been detected or when the call couldn't be
10367 validated because the size is not constant. */
10372 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10373 mem{cpy,pcpy,move,set} is available. */
10375 {
10390 }
10399 }
10402 else
10403 {
10406 /* If DEST is not a pointer type, call the normal function. */
10410 /* If SRC and DEST are the same (and not volatile), do nothing. */
10412 {
10413 tree expr;
10416 {
10417 /* Evaluate and ignore LEN in case it has side-effects. */
10420 }
10424 }
10426 /* __memmove_chk special case. */
10428 {
10434 /* If src is categorized for a readonly section we can use
10435 normal __memcpy_chk. */
10437 {
10446 }
10447 }
10449 }
10450 }
10452 /* Emit warning if a buffer overflow is detected at compile time. */
10454 static void
10456 {
10457 /* The source string. */
10459 /* The size of the destination object. */
10461 /* The string that is being concatenated with (as in __strcat_chk)
10462 or null if it isn't. */
10464 /* The maximum length of the source sequence in a bounded operation
10465 (such as __strncat_chk) or null if the operation isn't bounded
10466 (such as __strcat_chk). */
10468 /* The exact size of the access (such as in __strncpy_chk). */
10472 {
10480 /* For __strcat_chk the warning will be emitted only if overflowing
10481 by at least strlen (dest) + 1 bytes. */
10508 }
10511 {
10512 /* Check __strncat_chk. There is no way to determine the length
10513 of the string to which the source string is being appended so
10514 just warn when the length of the source string is not known. */
10517 }
10519 /* The destination argument is the first one for all built-ins above. */
10523 }
10525 /* Emit warning if a buffer overflow is detected at compile time
10526 in __sprintf_chk/__vsprintf_chk calls. */
10528 static void
10530 {
10535 /* Verify the required arguments in the original call. */
10545 /* Check whether the format is a literal string constant. */
10553 /* If the format doesn't contain % args or %%, we know its size. */
10556 /* If the format is "%s" and first ... argument is a string literal,
10557 we know it too. */
10560 {
10561 tree arg;
10572 }
10573 else
10576 /* Add one for the terminating nul. */
10581 }
10583 /* Emit warning if a free is called with address of a variable. */
10585 static void
10587 {
10601 else
10604 }
10606 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10607 if possible. */
10609 static tree
10611 {
10628 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10629 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10630 and (size_t) 0 for types 2 and 3. */
10635 {
10639 }
10641 {
10642 /* If object size is not known yet, delay folding until
10643 later. Maybe subsequent passes will help determining
10644 it. */
10648 }
10651 }
10653 /* Builtins with folding operations that operate on "..." arguments
10654 need special handling; we need to store the arguments in a convenient
10655 data structure before attempting any folding. Fortunately there are
10656 only a few builtins that fall into this category. FNDECL is the
10657 function, EXP is the CALL_EXPR for the call. */
10659 static tree
10661 {
10666 {
10673 }
10675 {
10680 }
10682 }
10684 /* Initialize format string characters in the target charset. */
10686 bool
10688 {
10691 {
10714 }
10716 }
10718 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10719 and no overflow/underflow occurred. INEXACT is true if M was not
10720 exactly calculated. TYPE is the tree type for the result. This
10721 function assumes that you cleared the MPFR flags and then
10722 calculated M to see if anything subsequently set a flag prior to
10723 entering this function. Return NULL_TREE if any checks fail. */
10725 static tree
10727 {
10728 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10729 overflow/underflow occurred. If -frounding-math, proceed iff the
10730 result of calling FUNC was exact. */
10733 {
10734 REAL_VALUE_TYPE rr;
10737 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10738 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10739 but the mpft_t is not, then we underflowed in the
10740 conversion. */
10743 {
10744 REAL_VALUE_TYPE rmode;
10747 /* Proceed iff the specified mode can hold the value. */
10750 }
10751 }
10753 }
10755 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10756 number and no overflow/underflow occurred. INEXACT is true if M
10757 was not exactly calculated. TYPE is the tree type for the result.
10758 This function assumes that you cleared the MPFR flags and then
10759 calculated M to see if anything subsequently set a flag prior to
10760 entering this function. Return NULL_TREE if any checks fail, if
10761 FORCE_CONVERT is true, then bypass the checks. */
10763 static tree
10765 {
10766 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10767 overflow/underflow occurred. If -frounding-math, proceed iff the
10768 result of calling FUNC was exact. */
10773 {
10778 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10779 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10780 but the mpft_t is not, then we underflowed in the
10781 conversion. */
10786 {
10791 /* Proceed iff the specified mode can hold the value. */
10797 }
10798 }
10800 }
10802 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10803 the pointer *(ARG_QUO) and return the result. The type is taken
10804 from the type of ARG0 and is used for setting the precision of the
10805 calculation and results. */
10807 static tree
10809 {
10816 /* To proceed, MPFR must exactly represent the target floating point
10817 format, which only happens when the target base equals two. */
10821 {
10826 {
10830 tree result_rem;
10839 /* Remquo is independent of the rounding mode, so pass
10840 inexact=0 to do_mpfr_ckconv(). */
10844 {
10845 /* MPFR calculates quo in the host's long so it may
10846 return more bits in quo than the target int can hold
10847 if sizeof(host long) > sizeof(target int). This can
10848 happen even for native compilers in LP64 mode. In
10849 these cases, modulo the quo value with the largest
10850 number that the target int can hold while leaving one
10851 bit for the sign. */
10855 /* Dereference the quo pointer argument. */
10857 /* Proceed iff a valid pointer type was passed in. */
10859 {
10860 /* Set the value. */
10861 tree result_quo
10864 integer_quo));
10866 /* Combine the quo assignment with the rem. */
10869 }
10870 }
10871 }
10872 }
10874 }
10876 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10877 resulting value as a tree with type TYPE. The mpfr precision is
10878 set to the precision of TYPE. We assume that this mpfr function
10879 returns zero if the result could be calculated exactly within the
10880 requested precision. In addition, the integer pointer represented
10881 by ARG_SG will be dereferenced and set to the appropriate signgam
10882 (-1,1) value. */
10884 static tree
10886 {
10891 /* To proceed, MPFR must exactly represent the target floating point
10892 format, which only happens when the target base equals two. Also
10893 verify ARG is a constant and that ARG_SG is an int pointer. */
10898 {
10901 /* In addition to NaN and Inf, the argument cannot be zero or a
10902 negative integer. */
10906 {
10911 mpfr_t m;
10912 tree result_lg;
10921 {
10922 tree result_sg;
10924 /* Dereference the arg_sg pointer argument. */
10926 /* Assign the signgam value into *arg_sg. */
10931 /* Combine the signgam assignment with the lgamma result. */
10934 }
10935 }
10936 }
10939 }
10941 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10942 mpc function FUNC on it and return the resulting value as a tree
10943 with type TYPE. The mpfr precision is set to the precision of
10944 TYPE. We assume that function FUNC returns zero if the result
10945 could be calculated exactly within the requested precision. If
10946 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10947 in the arguments and/or results. */
10949 tree
10952 {
10958 /* To proceed, MPFR must exactly represent the target floating point
10959 format, which only happens when the target base equals two. */
10965 {
10974 {
10994 }
10995 }
10998 }
11000 /* A wrapper function for builtin folding that prevents warnings for
11001 "statement without effect" and the like, caused by removing the
11002 call node earlier than the warning is generated. */
11004 tree
11006 {
11012 {
11021 {
11023 }
11024 else
11025 {
11028 {
11029 /* Propagate location information from original call to
11030 expansion of builtin. Otherwise things like
11031 maybe_emit_chk_warning, that operate on the expansion
11032 of a builtin, will use the wrong location information. */
11034 {
11042 }
11044 }
11045 }
11046 }
11048 }
11050 /* Look up the function in builtin_decl that corresponds to DECL
11051 and set ASMSPEC as its user assembler name. DECL must be a
11052 function decl that declares a builtin. */
11054 void
11056 {
11065 {
11069 }
11070 }
11072 /* Return true if DECL is a builtin that expands to a constant or similarly
11073 simple code. */
11074 bool
11076 {
11079 {
11080 /* Builtins that expand to constants. */
11085 /* Simple register moves or loads from stack. */
11096 /* Exception state returns or moves registers around. */
11104 }
11107 }
11109 /* Return true if DECL is a builtin that is not expensive, i.e., they are
11110 most probably expanded inline into reasonably simple code. This is a
11111 superset of is_simple_builtin. */
11112 bool
11114 {
11121 {
11123 CASE_BUILT_IN_ALLOCA:
11189 }
11192 }
11194 /* Return true if T is a constant and the value cast to a target char
11195 can be represented by a host char.
11196 Store the casted char constant in *P if so. */
11198 bool
11200 {
11206 }
11208 /* Return the maximum object size. */
11210 tree
11212 {
11213 /* To do: Make this a configurable parameter. */
11215 }