| blob | e6816d5c86550b724e89aad834ad3314d555a6b4 |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2022 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.cc instead. */
86 #if SWITCHABLE_TARGET
88 #endif
90 /* Define the names of the builtin function types and codes. */
94 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
96 {
98 };
100 /* Setup an array of builtin_info_type, make sure each element decl is
101 initialized to NULL_TREE. */
104 /* Non-zero if __builtin_constant_p should be folded right away. */
124 optab);
138 memop_ret retmode,
197 /* Return true if NAME starts with __builtin_ or __sync_. */
199 static bool
201 {
205 }
207 /* Return true if NODE should be considered for inline expansion regardless
208 of the optimization level. This means whenever a function is invoked with
209 its "internal" name, which normally contains the prefix "__builtin". */
211 bool
213 {
214 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
215 we want the name used to call the function, not the name it
216 will have. */
219 }
221 /* Compute values M and N such that M divides (address of EXP - N) and such
222 that N < M. If these numbers can be determined, store M in alignp and N in
223 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
224 *alignp and any bit-offset to *bitposp.
226 Note that the address (and thus the alignment) computed here is based
227 on the address to which a symbol resolves, whereas DECL_ALIGN is based
228 on the address at which an object is actually located. These two
229 addresses are not always the same. For example, on ARM targets,
230 the address &foo of a Thumb function foo() has the lowest bit set,
231 whereas foo() itself starts on an even address.
233 If ADDR_P is true we are taking the address of the memory reference EXP
234 and thus cannot rely on the access taking place. */
236 bool
239 {
241 tree offset;
242 machine_mode mode;
247 /* Get the innermost object and the constant (bitpos) and possibly
248 variable (offset) offset of the access. */
252 /* Extract alignment information from the innermost object and
253 possibly adjust bitpos and offset. */
255 {
256 /* Function addresses can encode extra information besides their
257 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
258 allows the low bit to be used as a virtual bit, we know
259 that the address itself must be at least 2-byte aligned. */
262 }
264 ;
266 {
267 /* The alignment of a CONST_DECL is determined by its initializer. */
274 }
276 {
279 }
283 {
289 /* If the address is explicitely aligned, handle that. */
292 {
297 }
299 known_alignment
303 /* Re-apply explicit alignment to the bitpos. */
306 /* The alignment of the pointer operand in a TARGET_MEM_REF
307 has to take the variable offset parts into account. */
309 {
311 {
316 }
320 }
322 /* When EXP is an actual memory reference then we can use
323 TYPE_ALIGN of a pointer indirection to derive alignment.
324 Do so only if get_pointer_alignment_1 did not reveal absolute
325 alignment knowledge and if using that alignment would
326 improve the situation. */
332 else
333 {
334 /* Else adjust bitpos accordingly. */
339 }
340 }
342 {
343 /* STRING_CST are the only constant objects we allow to be not
344 wrapped inside a CONST_DECL. */
350 }
352 /* If there is a non-constant offset part extract the maximum
353 alignment that can prevail. */
355 {
358 {
362 }
363 }
365 /* Account for the alignment of runtime coefficients, so that the constant
366 bitpos is guaranteed to be accurate. */
369 {
372 }
377 }
379 /* For a memory reference expression EXP compute values M and N such that M
380 divides (&EXP - N) and such that N < M. If these numbers can be determined,
381 store M in alignp and N in *BITPOSP and return true. Otherwise return false
382 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
384 bool
387 {
388 /* Strip a WITH_SIZE_EXPR, get_inner_reference doesn't know how to deal
389 with it. */
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 /* Compute the length of a null-terminated character string or wide
546 character string handling character sizes of 1, 2, and 4 bytes.
547 TREE_STRING_LENGTH is not the right way because it evaluates to
548 the size of the character array in bytes (as opposed to characters)
549 and because it can contain a zero byte in the middle.
551 ONLY_VALUE should be nonzero if the result is not going to be emitted
552 into the instruction stream and zero if it is going to be expanded.
553 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
554 is returned, otherwise NULL, since
555 len = c_strlen (ARG, 1); if (len) expand_expr (len, ...); would not
556 evaluate the side-effects.
558 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
559 accesses. Note that this implies the result is not going to be emitted
560 into the instruction stream.
562 Additional information about the string accessed may be recorded
563 in DATA. For example, if ARG references an unterminated string,
564 then the declaration will be stored in the DECL field. If the
565 length of the unterminated string can be determined, it'll be
566 stored in the LEN field. Note this length could well be different
567 than what a C strlen call would return.
569 ELTSIZE is 1 for normal single byte character strings, and 2 or
570 4 for wide characer strings. ELTSIZE is by default 1.
572 The value returned is of type `ssizetype'. */
574 tree
576 {
577 /* If we were not passed a DATA pointer, then get one to a local
578 structure. That avoids having to check DATA for NULL before
579 each time we want to use it. */
580 c_strlen_data local_strlen_data = { };
589 {
596 }
604 /* Offset from the beginning of the string in bytes. */
605 tree byteoff;
606 tree memsize;
607 tree decl;
612 /* Determine the size of the string element. */
616 /* Set MAXELTS to ARRAY_SIZE (SRC) - 1, the maximum possible
617 length of SRC. Prefer TYPE_SIZE() to TREE_STRING_LENGTH() if possible
618 in case the latter is less than the size of the array, such as when
619 SRC refers to a short string literal used to initialize a large array.
620 In that case, the elements of the array after the terminating NUL are
621 all NUL. */
630 /* PTR can point to the byte representation of any string type, including
631 char* and wchar_t*. */
635 {
636 /* The code below works only for single byte character types. */
640 /* If the string has an internal NUL character followed by any
641 non-NUL characters (e.g., "foo\0bar"), we can't compute
642 the offset to the following NUL if we don't know where to
643 start searching for it. */
646 /* Return when an embedded null character is found or none at all.
647 In the latter case, set the DECL/LEN field in the DATA structure
648 so that callers may examine them. */
652 {
657 }
659 /* For empty strings the result should be zero. */
663 /* We don't know the starting offset, but we do know that the string
664 has no internal zero bytes. If the offset falls within the bounds
665 of the string subtract the offset from the length of the string,
666 and return that. Otherwise the length is zero. Take care to
667 use SAVE_EXPR in case the OFFSET has side-effects. */
674 offsave);
678 }
680 /* Offset from the beginning of the string in elements. */
681 HOST_WIDE_INT eltoff;
683 /* We have a known offset into the string. Start searching there for
684 a null character if we can represent it as a single HOST_WIDE_INT. */
689 else
692 /* If the offset is known to be out of bounds, warn, and call strlen at
693 runtime. */
695 {
696 /* Suppress multiple warnings for propagated constant strings. */
701 eltoff))
702 {
706 }
708 }
710 /* If eltoff is larger than strelts but less than maxelts the
711 string length is zero, since the excess memory will be zero. */
715 /* Use strlen to search for the first zero byte. Since any strings
716 constructed with build_string will have nulls appended, we win even
717 if we get handed something like (char[4])"abcd".
719 Since ELTOFF is our starting index into the string, no further
720 calculation is needed. */
724 /* Don't know what to return if there was no zero termination.
725 Ideally this would turn into a gcc_checking_assert over time.
726 Set DECL/LEN so callers can examine them. */
728 {
733 }
736 }
738 /* Return a constant integer corresponding to target reading
739 GET_MODE_BITSIZE (MODE) bits from string constant STR. If
740 NULL_TERMINATED_P, reading stops after '\0' character, all further ones
741 are assumed to be zero, otherwise it reads as many characters
742 as needed. */
744 rtx
747 {
748 HOST_WIDE_INT ch;
762 {
774 }
778 }
780 /* Cast a target constant CST to target CHAR and if that value fits into
781 host char type, return zero and put that value into variable pointed to by
782 P. */
784 static int
786 {
793 /* Do not care if it fits or not right here. */
808 }
810 /* Similar to save_expr, but assumes that arbitrary code is not executed
811 in between the multiple evaluations. In particular, we assume that a
812 non-addressable local variable will not be modified. */
814 static tree
816 {
824 }
826 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
827 times to get the address of either a higher stack frame, or a return
828 address located within it (depending on FNDECL_CODE). */
830 static rtx
832 {
836 {
837 /* For a zero count with __builtin_return_address, we don't care what
838 frame address we return, because target-specific definitions will
839 override us. Therefore frame pointer elimination is OK, and using
840 the soft frame pointer is OK.
842 For a nonzero count, or a zero count with __builtin_frame_address,
843 we require a stable offset from the current frame pointer to the
844 previous one, so we must use the hard frame pointer, and
845 we must disable frame pointer elimination. */
848 else
849 {
852 /* Tell reload not to eliminate the frame pointer. */
854 }
855 }
860 /* On the SPARC, the return address is not in the frame, it is in a
861 register. There is no way to access it off of the current frame
862 pointer, but it can be accessed off the previous frame pointer by
863 reading the value from the register window save area. */
865 count--;
867 /* Scan back COUNT frames to the specified frame. */
869 {
870 /* Assume the dynamic chain pointer is in the word that the
871 frame address points to, unless otherwise specified. */
876 }
878 /* For __builtin_frame_address, return what we've got. But, on
879 the SPARC for example, we may have to add a bias. */
883 /* For __builtin_return_address, get the return address from that frame. */
884 #ifdef RETURN_ADDR_RTX
886 #else
890 #endif
892 }
894 /* Alias set used for setjmp buffer. */
897 /* Construct the leading half of a __builtin_setjmp call. Control will
898 return to RECEIVER_LABEL. This is also called directly by the SJLJ
899 exception handling code. */
901 void
903 {
905 rtx stack_save;
906 rtx mem;
915 /* We store the frame pointer and the address of receiver_label in
916 the buffer and use the rest of it for the stack save area, which
917 is machine-dependent. */
936 /* If there is further processing to do, do it. */
940 /* We have a nonlocal label. */
942 }
944 /* Construct the trailing part of a __builtin_setjmp call. This is
945 also called directly by the SJLJ exception handling code.
946 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
948 void
950 {
951 rtx chain;
953 /* Mark the FP as used when we get here, so we have to make sure it's
954 marked as used by this function. */
957 /* Mark the static chain as clobbered here so life information
958 doesn't get messed up for it. */
964 {
965 /* If the argument pointer can be eliminated in favor of the
966 frame pointer, we don't need to restore it. We assume here
967 that if such an elimination is present, it can always be used.
968 This is the case on all known machines; if we don't make this
969 assumption, we do unnecessary saving on many machines. */
979 {
980 /* Now restore our arg pointer from the address at which it
981 was saved in our stack frame. */
984 }
985 }
991 else
994 /* We must not allow the code we just generated to be reordered by
995 scheduling. Specifically, the update of the frame pointer must
996 happen immediately, not later. */
998 }
1000 /* __builtin_longjmp is passed a pointer to an array of five words (not
1001 all will be used on all machines). It operates similarly to the C
1002 library function of the same name, but is more efficient. Much of
1003 the code below is copied from the handling of non-local gotos. */
1005 static void
1007 {
1012 /* DRAP is needed for stack realign if longjmp is expanded to current
1013 function */
1024 /* We require that the user must pass a second argument of 1, because
1025 that is what builtin_setjmp will return. */
1031 else
1032 {
1043 /* Pick up FP, label, and SP from the block and jump. This code is
1044 from expand_goto in stmt.cc; see there for detailed comments. */
1046 /* We have to pass a value to the nonlocal_goto pattern that will
1047 get copied into the static_chain pointer, but it does not matter
1048 what that value is, because builtin_setjmp does not use it. */
1050 else
1051 {
1057 /* Restore the frame pointer and stack pointer. We must use a
1058 temporary since the setjmp buffer may be a local. */
1062 /* Ensure the frame pointer move is not optimized. */
1071 }
1072 }
1074 /* Search backwards and mark the jump insn as a non-local goto.
1075 Note that this precludes the use of __builtin_longjmp to a
1076 __builtin_setjmp target in the same function. However, we've
1077 already cautioned the user that these functions are for
1078 internal exception handling use only. */
1080 {
1084 {
1087 }
1090 }
1091 }
1095 {
1097 }
1099 /* This function validates the types of a function call argument list
1100 against a specified list of tree_codes. If the last specifier is a 0,
1101 that represents an ellipsis, otherwise the last specifier must be a
1102 VOID_TYPE. */
1104 static bool
1106 {
1110 const_call_expr_arg_iterator iter;
1111 const_tree arg;
1116 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1121 {
1125 {
1127 /* This signifies an ellipses, any further arguments are all ok. */
1131 /* This signifies an endlink, if no arguments remain, return
1132 true, otherwise return false. */
1136 /* The actual argument must be nonnull when either the whole
1137 called function has been declared nonnull, or when the formal
1138 argument corresponding to the actual argument has been. */
1141 {
1146 }
1147 /* FALLTHRU */
1149 /* If no parameters remain or the parameter's code does not
1150 match the specified code, return false. Otherwise continue
1151 checking any remaining arguments. */
1156 }
1157 }
1159 /* We need gotos here since we can only have one VA_CLOSE in a
1160 function. */
1161 end: ;
1167 }
1169 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1170 and the address of the save area. */
1172 static rtx
1174 {
1189 /* Copy the address of the save location to a register just in case it was
1190 based on the frame pointer. */
1199 /* ??? We no longer need to pass the static chain value, afaik. */
1202 else
1203 {
1209 /* Restore the frame pointer and stack pointer. We must use a
1210 temporary since the setjmp buffer may be a local. */
1214 /* Ensure the frame pointer move is not optimized. */
1220 /* USE of hard_frame_pointer_rtx added for consistency;
1221 not clear if really needed. */
1225 /* If the architecture is using a GP register, we must
1226 conservatively assume that the target function makes use of it.
1227 The prologue of functions with nonlocal gotos must therefore
1228 initialize the GP register to the appropriate value, and we
1229 must then make sure that this value is live at the point
1230 of the jump. (Note that this doesn't necessarily apply
1231 to targets with a nonlocal_goto pattern; they are free
1232 to implement it in their own way. Note also that this is
1233 a no-op if the GP register is a global invariant.) */
1239 }
1241 /* Search backwards to the jump insn and mark it as a
1242 non-local goto. */
1244 {
1246 {
1249 }
1252 }
1255 }
1257 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1258 (not all will be used on all machines) that was passed to __builtin_setjmp.
1259 It updates the stack pointer in that block to the current value. This is
1260 also called directly by the SJLJ exception handling code. */
1262 void
1264 {
1267 rtx stack_save
1269 memory_address
1275 }
1277 /* Expand a call to __builtin_prefetch. For a target that does not support
1278 data prefetch, evaluate the memory address argument in case it has side
1279 effects. */
1281 static void
1283 {
1293 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1294 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1295 locality). */
1299 else
1303 else
1306 /* Argument 0 is an address. */
1309 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1311 {
1314 }
1316 /* Argument 1 must be either zero or one. */
1318 {
1322 }
1324 /* Argument 2 (locality) must be a compile-time constant int. */
1326 {
1329 }
1331 /* Argument 2 must be 0, 1, 2, or 3. */
1333 {
1336 }
1339 {
1347 }
1349 /* Don't do anything with direct references to volatile memory, but
1350 generate code to handle other side effects. */
1353 }
1355 /* Get a MEM rtx for expression EXP which is the address of an operand
1356 to be used in a string instruction (cmpstrsi, cpymemsi, ..). LEN is
1357 the maximum length of the block of memory that might be accessed or
1358 NULL if unknown. */
1360 rtx
1362 {
1366 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1367 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1374 /* Get an expression we can use to find the attributes to assign to MEM.
1375 First remove any nops. */
1380 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1381 (as builtin stringops may alias with anything). */
1388 /* If the MEM_REF has no acceptable address, try to get the base object
1389 from the original address we got, and build an all-aliasing
1390 unknown-sized access to that one. */
1396 {
1401 size_zero_node,
1402 NULL)),
1405 }
1408 }
1409 \f
1410 /* Built-in functions to perform an untyped call and return. */
1412 #define apply_args_mode \
1413 (this_target_builtins->x_apply_args_mode)
1414 #define apply_result_mode \
1415 (this_target_builtins->x_apply_result_mode)
1417 /* Return the size required for the block returned by __builtin_apply_args,
1418 and initialize apply_args_mode. */
1420 static int
1422 {
1427 /* The values computed by this function never change. */
1429 {
1430 /* The first value is the incoming arg-pointer. */
1433 /* The second value is the structure value address unless this is
1434 passed as an "invisible" first argument. */
1440 {
1450 }
1451 else
1452 {
1454 }
1455 }
1457 }
1459 /* Return the size required for the block returned by __builtin_apply,
1460 and initialize apply_result_mode. */
1462 static int
1464 {
1468 /* The values computed by this function never change. */
1470 {
1475 {
1485 }
1486 else
1489 /* Allow targets that use untyped_call and untyped_return to override
1490 the size so that machine-specific information can be stored here. */
1491 #ifdef APPLY_RESULT_SIZE
1493 #endif
1494 }
1496 }
1498 /* Create a vector describing the result block RESULT. If SAVEP is true,
1499 the result block is used to save the values; otherwise it is used to
1500 restore the values. */
1502 static rtx
1504 {
1506 fixed_size_mode mode;
1513 {
1523 }
1525 }
1527 /* Save the state required to perform an untyped call with the same
1528 arguments as were passed to the current function. */
1530 static rtx
1532 {
1535 fixed_size_mode mode;
1536 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1538 /* Create a block where the arg-pointer, structure value address,
1539 and argument registers can be saved. */
1542 /* Walk past the arg-pointer and structure value address. */
1547 /* Save each register used in calling a function to the block. */
1550 {
1559 }
1561 /* Save the arg pointer to the block. */
1563 /* We need the pointer as the caller actually passed them to us, not
1564 as we might have pretended they were passed. Make sure it's a valid
1565 operand, as emit_move_insn isn't expected to handle a PLUS. */
1567 tem
1570 NULL_RTX);
1575 /* Save the structure value address unless this is passed as an
1576 "invisible" first argument. */
1581 /* Return the address of the block. */
1583 }
1585 /* __builtin_apply_args returns block of memory allocated on
1586 the stack into which is stored the arg pointer, structure
1587 value address, static chain, and all the registers that might
1588 possibly be used in performing a function call. The code is
1589 moved to the start of the function so the incoming values are
1590 saved. */
1592 static rtx
1594 {
1595 /* Don't do __builtin_apply_args more than once in a function.
1596 Save the result of the first call and reuse it. */
1599 {
1600 /* When this function is called, it means that registers must be
1601 saved on entry to this function. So we migrate the
1602 call to the first insn of this function. */
1603 rtx temp;
1612 /* Put the insns after the NOTE that starts the function.
1613 If this is inside a start_sequence, make the outer-level insn
1614 chain current, so the code is placed at the start of the
1615 function. If internal_arg_pointer is a non-virtual pseudo,
1616 it needs to be placed after the function that initializes
1617 that pseudo. */
1622 else
1626 }
1627 }
1629 /* Perform an untyped call and save the state required to perform an
1630 untyped return of whatever value was returned by the given function. */
1632 static rtx
1634 {
1636 fixed_size_mode mode;
1645 /* Create a block where the return registers can be saved. */
1648 /* Fetch the arg pointer from the ARGUMENTS block. */
1655 /* Push a new argument block and copy the arguments. Do not allow
1656 the (potential) memcpy call below to interfere with our stack
1657 manipulations. */
1659 NO_DEFER_POP;
1661 /* Save the stack with nonlocal if available. */
1664 else
1667 /* Allocate a block of memory onto the stack and copy the memory
1668 arguments to the outgoing arguments address. We can pass TRUE
1669 as the 4th argument because we just saved the stack pointer
1670 and will restore it right after the call. */
1673 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1674 may have already set current_function_calls_alloca to true.
1675 current_function_calls_alloca won't be set if argsize is zero,
1676 so we have to guarantee need_drap is true here. */
1682 {
1685 else
1687 }
1694 /* Refer to the argument block. */
1699 /* Walk past the arg-pointer and structure value address. */
1704 /* Restore each of the registers previously saved. Make USE insns
1705 for each of these registers for use in making the call. */
1708 {
1716 }
1718 /* Restore the structure value address unless this is passed as an
1719 "invisible" first argument. */
1722 {
1728 }
1730 /* All arguments and registers used for the call are set up by now! */
1733 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1734 and we don't want to load it into a register as an optimization,
1735 because prepare_call_address already did it if it should be done. */
1739 /* Generate the actual call instruction and save the return value. */
1741 {
1749 }
1751 {
1754 /* Locate the unique return register. It is not possible to
1755 express a call that sets more than one return register using
1756 call_value; use untyped_call for that. In fact, untyped_call
1757 only needs to save the return registers in the given block. */
1760 {
1764 }
1771 }
1772 else
1775 /* Find the CALL insn we just emitted, and attach the register usage
1776 information. */
1780 /* Restore the stack. */
1783 else
1787 OK_DEFER_POP;
1789 /* Return the address of the result block. */
1792 }
1794 /* Perform an untyped return. */
1796 static void
1798 {
1800 fixed_size_mode mode;
1801 rtx reg;
1810 {
1815 }
1817 /* Restore the return value and note that each value is used. */
1821 {
1833 }
1835 /* Put the USE insns before the return. */
1838 /* Return whatever values was restored by jumping directly to the end
1839 of the function. */
1841 }
1843 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1845 static enum type_class
1847 {
1849 {
1869 }
1870 }
1872 /* Expand a call EXP to __builtin_classify_type. */
1874 static rtx
1876 {
1880 }
1882 /* This helper macro, meant to be used in mathfn_built_in below, determines
1883 which among a set of builtin math functions is appropriate for a given type
1884 mode. The `F' (float) and `L' (long double) are automatically generated
1885 from the 'double' case. If a function supports the _Float<N> and _Float<N>X
1886 types, there are additional types that are considered with 'F32', 'F64',
1887 'F128', etc. suffixes. */
1888 #define CASE_MATHFN(MATHFN) \
1889 CASE_CFN_##MATHFN: \
1890 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1891 fcodel = BUILT_IN_##MATHFN##L ; break;
1892 /* Similar to the above, but also add support for the _Float<N> and _Float<N>X
1893 types. */
1894 #define CASE_MATHFN_FLOATN(MATHFN) \
1895 CASE_CFN_##MATHFN: \
1896 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1897 fcodel = BUILT_IN_##MATHFN##L ; fcodef16 = BUILT_IN_##MATHFN##F16 ; \
1898 fcodef32 = BUILT_IN_##MATHFN##F32; fcodef64 = BUILT_IN_##MATHFN##F64 ; \
1899 fcodef128 = BUILT_IN_##MATHFN##F128 ; fcodef32x = BUILT_IN_##MATHFN##F32X ; \
1900 fcodef64x = BUILT_IN_##MATHFN##F64X ; fcodef128x = BUILT_IN_##MATHFN##F128X ;\
1901 break;
1902 /* Similar to above, but appends _R after any F/L suffix. */
1903 #define CASE_MATHFN_REENT(MATHFN) \
1904 case CFN_BUILT_IN_##MATHFN##_R: \
1905 case CFN_BUILT_IN_##MATHFN##F_R: \
1906 case CFN_BUILT_IN_##MATHFN##L_R: \
1907 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1908 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1910 /* Return a function equivalent to FN but operating on floating-point
1911 values of type TYPE, or END_BUILTINS if no such function exists.
1912 This is purely an operation on function codes; it does not guarantee
1913 that the target actually has an implementation of the function. */
1915 static built_in_function
1917 {
1918 tree mtype;
1929 {
1930 #define SEQ_OF_CASE_MATHFN \
1931 CASE_MATHFN (ACOS) \
1932 CASE_MATHFN (ACOSH) \
1933 CASE_MATHFN (ASIN) \
1934 CASE_MATHFN (ASINH) \
1935 CASE_MATHFN (ATAN) \
1936 CASE_MATHFN (ATAN2) \
1937 CASE_MATHFN (ATANH) \
1938 CASE_MATHFN (CBRT) \
1939 CASE_MATHFN_FLOATN (CEIL) \
1940 CASE_MATHFN (CEXPI) \
1941 CASE_MATHFN_FLOATN (COPYSIGN) \
1942 CASE_MATHFN (COS) \
1943 CASE_MATHFN (COSH) \
1944 CASE_MATHFN (DREM) \
1945 CASE_MATHFN (ERF) \
1946 CASE_MATHFN (ERFC) \
1947 CASE_MATHFN (EXP) \
1948 CASE_MATHFN (EXP10) \
1949 CASE_MATHFN (EXP2) \
1950 CASE_MATHFN (EXPM1) \
1951 CASE_MATHFN (FABS) \
1952 CASE_MATHFN (FDIM) \
1953 CASE_MATHFN_FLOATN (FLOOR) \
1954 CASE_MATHFN_FLOATN (FMA) \
1955 CASE_MATHFN_FLOATN (FMAX) \
1956 CASE_MATHFN_FLOATN (FMIN) \
1957 CASE_MATHFN (FMOD) \
1958 CASE_MATHFN (FREXP) \
1959 CASE_MATHFN (GAMMA) \
1961 CASE_MATHFN (HUGE_VAL) \
1962 CASE_MATHFN (HYPOT) \
1963 CASE_MATHFN (ILOGB) \
1964 CASE_MATHFN (ICEIL) \
1965 CASE_MATHFN (IFLOOR) \
1966 CASE_MATHFN (INF) \
1967 CASE_MATHFN (IRINT) \
1968 CASE_MATHFN (IROUND) \
1969 CASE_MATHFN (ISINF) \
1970 CASE_MATHFN (J0) \
1971 CASE_MATHFN (J1) \
1972 CASE_MATHFN (JN) \
1973 CASE_MATHFN (LCEIL) \
1974 CASE_MATHFN (LDEXP) \
1975 CASE_MATHFN (LFLOOR) \
1976 CASE_MATHFN (LGAMMA) \
1978 CASE_MATHFN (LLCEIL) \
1979 CASE_MATHFN (LLFLOOR) \
1980 CASE_MATHFN (LLRINT) \
1981 CASE_MATHFN (LLROUND) \
1982 CASE_MATHFN (LOG) \
1983 CASE_MATHFN (LOG10) \
1984 CASE_MATHFN (LOG1P) \
1985 CASE_MATHFN (LOG2) \
1986 CASE_MATHFN (LOGB) \
1987 CASE_MATHFN (LRINT) \
1988 CASE_MATHFN (LROUND) \
1989 CASE_MATHFN (MODF) \
1990 CASE_MATHFN (NAN) \
1991 CASE_MATHFN (NANS) \
1992 CASE_MATHFN_FLOATN (NEARBYINT) \
1993 CASE_MATHFN (NEXTAFTER) \
1994 CASE_MATHFN (NEXTTOWARD) \
1995 CASE_MATHFN (POW) \
1996 CASE_MATHFN (POWI) \
1997 CASE_MATHFN (POW10) \
1998 CASE_MATHFN (REMAINDER) \
1999 CASE_MATHFN (REMQUO) \
2000 CASE_MATHFN_FLOATN (RINT) \
2001 CASE_MATHFN_FLOATN (ROUND) \
2002 CASE_MATHFN_FLOATN (ROUNDEVEN) \
2003 CASE_MATHFN (SCALB) \
2004 CASE_MATHFN (SCALBLN) \
2005 CASE_MATHFN (SCALBN) \
2006 CASE_MATHFN (SIGNBIT) \
2007 CASE_MATHFN (SIGNIFICAND) \
2008 CASE_MATHFN (SIN) \
2009 CASE_MATHFN (SINCOS) \
2010 CASE_MATHFN (SINH) \
2011 CASE_MATHFN_FLOATN (SQRT) \
2012 CASE_MATHFN (TAN) \
2013 CASE_MATHFN (TANH) \
2014 CASE_MATHFN (TGAMMA) \
2015 CASE_MATHFN_FLOATN (TRUNC) \
2016 CASE_MATHFN (Y0) \
2017 CASE_MATHFN (Y1) \
2018 CASE_MATHFN (YN)
2020 SEQ_OF_CASE_MATHFN
2024 }
2047 else
2049 }
2051 #undef CASE_MATHFN
2052 #undef CASE_MATHFN_FLOATN
2053 #undef CASE_MATHFN_REENT
2055 /* Return mathematic function equivalent to FN but operating directly on TYPE,
2056 if available. If IMPLICIT_P is true use the implicit builtin declaration,
2057 otherwise use the explicit declaration. If we can't do the conversion,
2058 return null. */
2060 static tree
2062 {
2071 }
2073 /* Like mathfn_built_in_1, but always use the implicit array. */
2075 tree
2077 {
2079 }
2081 /* Like mathfn_built_in_1, but take a built_in_function and
2082 always use the implicit array. */
2084 tree
2086 {
2088 }
2090 /* Return the type associated with a built in function, i.e., the one
2091 to be passed to mathfn_built_in to get the type-specific
2092 function. */
2094 tree
2096 {
2097 #define CASE_MATHFN(MATHFN) \
2098 case CFN_BUILT_IN_##MATHFN: \
2099 return double_type_node; \
2100 case CFN_BUILT_IN_##MATHFN##F: \
2101 return float_type_node; \
2102 case CFN_BUILT_IN_##MATHFN##L: \
2103 return long_double_type_node;
2105 #define CASE_MATHFN_FLOATN(MATHFN) \
2106 CASE_MATHFN(MATHFN) \
2107 case CFN_BUILT_IN_##MATHFN##F16: \
2108 return float16_type_node; \
2109 case CFN_BUILT_IN_##MATHFN##F32: \
2110 return float32_type_node; \
2111 case CFN_BUILT_IN_##MATHFN##F64: \
2112 return float64_type_node; \
2113 case CFN_BUILT_IN_##MATHFN##F128: \
2114 return float128_type_node; \
2115 case CFN_BUILT_IN_##MATHFN##F32X: \
2116 return float32x_type_node; \
2117 case CFN_BUILT_IN_##MATHFN##F64X: \
2118 return float64x_type_node; \
2119 case CFN_BUILT_IN_##MATHFN##F128X: \
2120 return float128x_type_node;
2122 /* Similar to above, but appends _R after any F/L suffix. */
2123 #define CASE_MATHFN_REENT(MATHFN) \
2124 case CFN_BUILT_IN_##MATHFN##_R: \
2125 return double_type_node; \
2126 case CFN_BUILT_IN_##MATHFN##F_R: \
2127 return float_type_node; \
2128 case CFN_BUILT_IN_##MATHFN##L_R: \
2129 return long_double_type_node;
2132 {
2133 SEQ_OF_CASE_MATHFN
2137 }
2139 #undef CASE_MATHFN
2140 #undef CASE_MATHFN_FLOATN
2141 #undef CASE_MATHFN_REENT
2142 #undef SEQ_OF_CASE_MATHFN
2143 }
2145 /* Check whether there is an internal function associated with function FN
2146 and return type RETURN_TYPE. Return the function if so, otherwise return
2147 IFN_LAST.
2149 Note that this function only tests whether the function is defined in
2150 internals.def, not whether it is actually available on the target. */
2152 static internal_fn
2154 {
2156 {
2157 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
2158 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2159 #define DEF_INTERNAL_FLT_FLOATN_FN(NAME, FLAGS, OPTAB, TYPE) \
2160 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME; \
2161 CASE_FLT_FN_FLOATN_NX (BUILT_IN_##NAME): return IFN_##NAME;
2162 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
2163 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2180 }
2181 }
2183 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
2184 return its code, otherwise return IFN_LAST. Note that this function
2185 only tests whether the function is defined in internals.def, not whether
2186 it is actually available on the target. */
2188 internal_fn
2190 {
2194 }
2196 /* Check whether there is an internal function associated with function CFN
2197 and return type RETURN_TYPE. Return the function if so, otherwise return
2198 IFN_LAST.
2200 Note that this function only tests whether the function is defined in
2201 internals.def, not whether it is actually available on the target. */
2203 internal_fn
2205 {
2209 }
2211 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2212 on the current target by a call to an internal function, return the
2213 code of that internal function, otherwise return IFN_LAST. The caller
2214 is responsible for ensuring that any side-effects of the built-in
2215 call are dealt with correctly. E.g. if CALL sets errno, the caller
2216 must decide that the errno result isn't needed or make it available
2217 in some other way. */
2219 internal_fn
2221 {
2223 {
2226 {
2231 }
2232 }
2234 }
2236 /* Expand a call to the builtin trinary math functions (fma).
2237 Return NULL_RTX if a normal call should be emitted rather than expanding the
2238 function in-line. EXP is the expression that is a call to the builtin
2239 function; if convenient, the result should be placed in TARGET.
2240 SUBTARGET may be used as the target for computing one of EXP's
2241 operands. */
2243 static rtx
2245 {
2246 optab builtin_optab;
2251 machine_mode mode;
2261 {
2267 }
2269 /* Make a suitable register to place result in. */
2272 /* Before working hard, check whether the instruction is available. */
2278 /* Always stabilize the argument list. */
2289 /* Compute into RESULT.
2290 Set RESULT to wherever the result comes back. */
2294 /* If we were unable to expand via the builtin, stop the sequence
2295 (without outputting the insns) and call to the library function
2296 with the stabilized argument list. */
2298 {
2301 }
2303 /* Output the entire sequence. */
2309 }
2311 /* Expand a call to the builtin sin and cos math functions.
2312 Return NULL_RTX if a normal call should be emitted rather than expanding the
2313 function in-line. EXP is the expression that is a call to the builtin
2314 function; if convenient, the result should be placed in TARGET.
2315 SUBTARGET may be used as the target for computing one of EXP's
2316 operands. */
2318 static rtx
2320 {
2321 optab builtin_optab;
2322 rtx op0;
2325 machine_mode mode;
2326 tree arg;
2334 {
2340 }
2342 /* Make a suitable register to place result in. */
2345 /* Check if sincos insn is available, otherwise fallback
2346 to sin or cos insn. */
2349 {
2356 }
2358 /* Before working hard, check whether the instruction is available. */
2360 {
2363 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2364 need to expand the argument again. This way, we will not perform
2365 side-effects more the once. */
2372 /* Compute into RESULT.
2373 Set RESULT to wherever the result comes back. */
2375 {
2379 {
2388 }
2390 }
2391 else
2395 {
2396 /* Output the entire sequence. */
2401 }
2403 /* If we were unable to expand via the builtin, stop the sequence
2404 (without outputting the insns) and call to the library function
2405 with the stabilized argument list. */
2407 }
2410 }
2412 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2413 return an RTL instruction code that implements the functionality.
2414 If that isn't possible or available return CODE_FOR_nothing. */
2416 static enum insn_code
2418 {
2421 machine_mode mode;
2424 {
2438 /* These builtins have no optabs (yet). */
2442 }
2444 /* There's no easy way to detect the case we need to set EDOM. */
2448 /* Optab mode depends on the mode of the input argument. */
2454 }
2456 /* Expand a call to one of the builtin math functions that operate on
2457 floating point argument and output an integer result (ilogb, isinf,
2458 isnan, etc).
2459 Return 0 if a normal call should be emitted rather than expanding the
2460 function in-line. EXP is the expression that is a call to the builtin
2461 function; if convenient, the result should be placed in TARGET. */
2463 static rtx
2465 {
2467 rtx op0;
2469 machine_mode mode;
2470 tree arg;
2480 {
2485 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2486 need to expand the argument again. This way, we will not perform
2487 side-effects more the once. */
2502 }
2505 }
2507 /* Expand a call to the builtin sincos math function.
2508 Return NULL_RTX if a normal call should be emitted rather than expanding the
2509 function in-line. EXP is the expression that is a call to the builtin
2510 function. */
2512 static rtx
2514 {
2516 machine_mode mode;
2530 /* Make a suitable register to place result in. */
2533 /* Check if sincos insn is available, otherwise emit the call. */
2548 /* Compute into target1 and target2.
2549 Set TARGET to wherever the result comes back. */
2553 /* Move target1 and target2 to the memory locations indicated
2554 by op1 and op2. */
2559 }
2561 /* Expand call EXP to the fegetround builtin (from C99 fenv.h), returning the
2562 result and setting it in TARGET. Otherwise return NULL_RTX on failure. */
2563 static rtx
2565 {
2584 }
2586 /* Expand call EXP to either feclearexcept or feraiseexcept builtins (from C99
2587 fenv.h), returning the result and setting it in TARGET. Otherwise return
2588 NULL_RTX on failure. */
2589 static rtx
2592 {
2615 }
2617 /* Expand a call to the internal cexpi builtin to the sincos math function.
2618 EXP is the expression that is a call to the builtin function; if convenient,
2619 the result should be placed in TARGET. */
2621 static rtx
2623 {
2626 machine_mode mode;
2637 /* Try expanding via a sincos optab, fall back to emitting a libcall
2638 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2639 is only generated from sincos, cexp or if we have either of them. */
2641 {
2647 /* Compute into op1 and op2. */
2649 }
2651 {
2662 else
2672 /* Make sure not to fold the sincos call again. */
2676 }
2677 else
2678 {
2688 else
2691 /* If we don't have a decl for cexp create one. This is the
2692 friendliest fallback if the user calls __builtin_cexpi
2693 without full target C99 function support. */
2695 {
2696 tree fntype;
2708 }
2713 /* Make sure not to fold the cexp call again. */
2717 }
2719 /* Now build the proper return type. */
2724 }
2726 /* Conveniently construct a function call expression. FNDECL names the
2727 function to be called, N is the number of arguments, and the "..."
2728 parameters are the argument expressions. Unlike build_call_exr
2729 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2731 static tree
2733 {
2743 }
2745 /* Expand a call to one of the builtin rounding functions gcc defines
2746 as an extension (lfloor and lceil). As these are gcc extensions we
2747 do not need to worry about setting errno to EDOM.
2748 If expanding via optab fails, lower expression to (int)(floor(x)).
2749 EXP is the expression that is a call to the builtin function;
2750 if convenient, the result should be placed in TARGET. */
2752 static rtx
2754 {
2755 convert_optab builtin_optab;
2760 tree fallback_fndecl;
2761 machine_mode mode;
2762 tree arg;
2770 {
2787 }
2789 /* Make a suitable register to place result in. */
2794 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2795 need to expand the argument again. This way, we will not perform
2796 side-effects more the once. */
2803 /* Compute into TARGET. */
2805 {
2806 /* Output the entire sequence. */
2811 }
2813 /* If we were unable to expand via the builtin, stop the sequence
2814 (without outputting the insns). */
2817 /* Fall back to floating point rounding optab. */
2820 /* For non-C99 targets we may end up without a fallback fndecl here
2821 if the user called __builtin_lfloor directly. In this case emit
2822 a call to the floor/ceil variants nevertheless. This should result
2823 in the best user experience for not full C99 targets. */
2825 {
2826 tree fntype;
2830 {
2863 }
2868 }
2875 /* Truncate the result of floating point optab to integer
2876 via expand_fix (). */
2881 }
2883 /* Expand a call to one of the builtin math functions doing integer
2884 conversion (lrint).
2885 Return 0 if a normal call should be emitted rather than expanding the
2886 function in-line. EXP is the expression that is a call to the builtin
2887 function; if convenient, the result should be placed in TARGET. */
2889 static rtx
2891 {
2892 convert_optab builtin_optab;
2893 rtx op0;
2896 tree arg;
2897 machine_mode mode;
2906 {
2925 }
2927 /* There's no easy way to detect the case we need to set EDOM. */
2931 /* Make a suitable register to place result in. */
2934 /* There's no easy way to detect the case we need to set EDOM. */
2936 {
2939 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2940 need to expand the argument again. This way, we will not perform
2941 side-effects more the once. */
2949 {
2950 /* Output the entire sequence. */
2955 }
2957 /* If we were unable to expand via the builtin, stop the sequence
2958 (without outputting the insns) and call to the library function
2959 with the stabilized argument list. */
2961 }
2964 {
2965 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2966 targets, (int) round (x) should never be transformed into
2967 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2968 a call to lround in the hope that the target provides at least some
2969 C99 functions. This should result in the best user experience for
2970 not full C99 targets.
2971 As scalar float conversions with same mode are useless in GIMPLE,
2972 we can end up e.g. with _Float32 argument passed to float builtin,
2973 try to get the type from the builtin prototype first. */
2976 fallback_fndecl
2980 fallback_fndecl
2984 {
2991 }
2992 }
2995 }
2997 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2998 a normal call should be emitted rather than expanding the function
2999 in-line. EXP is the expression that is a call to the builtin
3000 function; if convenient, the result should be placed in TARGET. */
3002 static rtx
3004 {
3007 machine_mode mode;
3008 machine_mode mode2;
3017 /* Emit a libcall to libgcc. */
3019 /* Mode of the 2nd argument must match that of an int. */
3037 }
3039 /* Expand expression EXP which is a call to the strlen builtin. Return
3040 NULL_RTX if we failed and the caller should emit a normal call, otherwise
3041 try to get the result in TARGET, if convenient. */
3043 static rtx
3045 machine_mode target_mode)
3046 {
3052 /* If the length can be computed at compile-time, return it. */
3056 /* If the length can be computed at compile-time and is constant
3057 integer, but there are side-effects in src, evaluate
3058 src for side-effects, then return len.
3059 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
3060 can be optimized into: i++; x = 3; */
3063 {
3066 }
3070 /* If SRC is not a pointer type, don't do this operation inline. */
3074 /* Bail out if we can't compute strlen in the right mode. */
3075 machine_mode insn_mode;
3078 {
3082 }
3086 /* Make a place to hold the source address. We will not expand
3087 the actual source until we are sure that the expansion will
3088 not fail -- there are trees that cannot be expanded twice. */
3091 /* Mark the beginning of the strlen sequence so we can emit the
3092 source operand later. */
3103 /* Check to see if the argument was declared attribute nonstring
3104 and if so, issue a warning since at this point it's not known
3105 to be nul-terminated. */
3108 /* Now that we are assured of success, expand the source. */
3112 {
3113 #ifdef POINTERS_EXTEND_UNSIGNED
3116 POINTERS_EXTEND_UNSIGNED);
3117 #endif
3119 }
3125 else
3128 /* Return the value in the proper mode for this function. */
3133 else
3137 }
3139 /* Expand call EXP to the strnlen built-in, returning the result
3140 and setting it in TARGET. Otherwise return NULL_RTX on failure. */
3142 static rtx
3144 {
3158 /* FIXME: Change c_strlen() to return sizetype instead of ssizetype
3159 so these conversions aren't necessary. */
3160 c_strlen_data lendata = { };
3166 {
3172 }
3178 value_range r;
3186 {
3191 }
3201 }
3203 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3204 bytes from bytes at DATA + OFFSET and return it reinterpreted as
3205 a target constant. */
3207 static rtx
3209 fixed_size_mode mode)
3210 {
3211 /* The REPresentation pointed to by DATA need not be a nul-terminated
3212 string but the caller guarantees it's large enough for MODE. */
3215 /* The by-pieces infrastructure does not try to pick a vector mode
3216 for memcpy expansion. */
3219 }
3221 /* LEN specify length of the block of memcpy/memset operation.
3222 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
3223 In some cases we can make very likely guess on max size, then we
3224 set it into PROBABLE_MAX_SIZE. */
3226 static void
3231 {
3233 {
3236 }
3237 else
3238 {
3242 /* Determine bounds from the type. */
3245 else
3250 else
3254 {
3255 value_range r;
3259 {
3262 }
3263 }
3265 {
3270 }
3272 {
3273 /* Code like
3275 int n;
3276 if (n < 100)
3277 memcpy (a, b, n)
3279 Produce anti range allowing negative values of N. We still
3280 can use the information and make a guess that N is not negative.
3281 */
3284 }
3285 }
3289 }
3291 /* Expand a call EXP to the memcpy builtin.
3292 Return NULL_RTX if we failed, the caller should emit a normal call,
3293 otherwise try to get the result in TARGET, if convenient (and in
3294 mode MODE if that's convenient). */
3296 static rtx
3298 {
3309 }
3311 /* Check a call EXP to the memmove built-in for validity.
3312 Return NULL_RTX on both success and failure. */
3314 static rtx
3316 {
3327 }
3329 /* Expand a call EXP to the mempcpy builtin.
3330 Return NULL_RTX if we failed; the caller should emit a normal call,
3331 otherwise try to get the result in TARGET, if convenient (and in
3332 mode MODE if that's convenient). */
3334 static rtx
3336 {
3345 /* Policy does not generally allow using compute_objsize (which
3346 is used internally by check_memop_size) to change code generation
3347 or drive optimization decisions.
3349 In this instance it is safe because the code we generate has
3350 the same semantics regardless of the return value of
3351 check_memop_sizes. Exactly the same amount of data is copied
3352 and the return value is exactly the same in both cases.
3354 Furthermore, check_memop_size always uses mode 0 for the call to
3355 compute_objsize, so the imprecise nature of compute_objsize is
3356 avoided. */
3358 /* Avoid expanding mempcpy into memcpy when the call is determined
3359 to overflow the buffer. This also prevents the same overflow
3360 from being diagnosed again when expanding memcpy. */
3364 }
3366 /* Helper function to do the actual work for expand of memory copy family
3367 functions (memcpy, mempcpy, stpcpy). Expansing should assign LEN bytes
3368 of memory from SRC to DEST and assign to TARGET if convenient. Return
3369 value is based on RETMODE argument. */
3371 static rtx
3375 {
3387 /* If DEST is not a pointer type, call the normal function. */
3391 /* If either SRC is not a pointer type, don't do this
3392 operation in-line. */
3408 /* Try to get the byte representation of the constant SRC points to,
3409 with its byte size in NBYTES. */
3413 /* If the function's constant bound LEN_RTX is less than or equal
3414 to the byte size of the representation of the constant argument,
3415 and if block move would be done by pieces, we can avoid loading
3416 the bytes from memory and only store the computed constant.
3417 This works in the overlap (memmove) case as well because
3418 store_by_pieces just generates a series of stores of constants
3419 from the representation returned by getbyterep(). */
3426 {
3428 builtin_memcpy_read_str,
3434 }
3439 /* Copy word part most expediently. */
3446 && !might_overlap
3454 might_overlap);
3456 /* Bail out when a mempcpy call would be expanded as libcall and when
3457 we have a target that provides a fast implementation
3458 of mempcpy routine. */
3466 {
3469 }
3472 {
3474 /* stpcpy pointer to last byte. */
3477 }
3480 }
3482 static rtx
3485 {
3488 }
3490 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3491 we failed, the caller should emit a normal call, otherwise try to
3492 get the result in TARGET, if convenient.
3493 Return value is based on RETMODE argument. */
3495 static rtx
3497 {
3499 rtx dest_mem;
3500 rtx src_mem;
3508 {
3511 }
3521 {
3523 /* movstr is supposed to set end to the address of the NUL
3524 terminator. If the caller requested a mempcpy-like return value,
3525 adjust it. */
3527 {
3531 }
3532 }
3534 }
3536 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3537 NULL_RTX if we failed the caller should emit a normal call, otherwise
3538 try to get the result in TARGET, if convenient (and in mode MODE if that's
3539 convenient). */
3541 static rtx
3543 {
3551 }
3553 /* Helper function to do the actual work for expand_builtin_strcpy. The
3554 arguments to the builtin_strcpy call DEST and SRC are broken out
3555 so that this can also be called without constructing an actual CALL_EXPR.
3556 The other arguments and return value are the same as for
3557 expand_builtin_strcpy. */
3559 static rtx
3561 {
3563 }
3565 /* Expand a call EXP to the stpcpy builtin.
3566 Return NULL_RTX if we failed the caller should emit a normal call,
3567 otherwise try to get the result in TARGET, if convenient (and in
3568 mode MODE if that's convenient). */
3570 static rtx
3572 {
3582 /* If return value is ignored, transform stpcpy into strcpy. */
3584 {
3588 }
3589 else
3590 {
3592 rtx ret;
3594 /* Ensure we get an actual string whose length can be evaluated at
3595 compile-time, not an expression containing a string. This is
3596 because the latter will potentially produce pessimized code
3597 when used to produce the return value. */
3598 c_strlen_data lendata = { };
3613 {
3617 {
3621 {
3623 {
3626 else
3628 }
3637 }
3638 }
3639 }
3643 }
3644 }
3646 /* Expand a call EXP to the stpcpy builtin and diagnose uses of nonstring
3647 arguments while being careful to avoid duplicate warnings (which could
3648 be issued if the expander were to expand the call, resulting in it
3649 being emitted in expand_call(). */
3651 static rtx
3653 {
3655 {
3656 /* The call has been successfully expanded. Check for nonstring
3657 arguments and issue warnings as appropriate. */
3660 }
3663 }
3665 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3666 bytes from constant string DATA + OFFSET and return it as target
3667 constant. */
3669 rtx
3671 fixed_size_mode mode)
3672 {
3678 /* The by-pieces infrastructure does not try to pick a vector mode
3679 for strncpy expansion. */
3681 }
3683 /* Helper to check the sizes of sequences and the destination of calls
3684 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3685 success (no overflow or invalid sizes), false otherwise. */
3687 static bool
3689 {
3694 /* Try to determine the range of lengths that the source expression
3695 refers to. */
3696 c_strlen_data lendata = { };
3699 /* Try to verify that the destination is big enough for the shortest
3700 string. */
3704 {
3705 /* If it hasn't been provided by __strncat_chk, try to determine
3706 the size of the destination object into which the source is
3707 being copied. */
3709 }
3711 /* Add one for the terminating nul. */
3714 size_one_node)
3717 /* The strncat function copies at most MAXREAD bytes and always appends
3718 the terminating nul so the specified upper bound should never be equal
3719 to (or greater than) the size of the destination. */
3722 {
3729 }
3737 /* The number of bytes to write is LEN but check_access will alsoa
3738 check SRCLEN if LEN's value isn't known. */
3741 }
3743 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3744 NULL_RTX if we failed the caller should emit a normal call. */
3746 static rtx
3748 {
3756 /* The number of bytes to write (not the maximum). */
3759 /* The length of the source sequence. */
3762 /* We must be passed a constant len and src parameter. */
3768 /* We're required to pad with trailing zeros if the requested
3769 len is greater than strlen(s2)+1. In that case try to
3770 use store_by_pieces, if it fails, punt. */
3772 {
3775 rtx dest_mem;
3779 builtin_strncpy_read_str,
3786 builtin_strncpy_read_str,
3788 RETURN_BEGIN);
3792 }
3795 }
3797 /* Return the RTL of a register in MODE generated from PREV in the
3798 previous iteration. */
3800 static rtx
3802 {
3805 {
3806 /* Use the previous data in the same mode. */
3812 /* Don't use the previous data to write QImode if it is in a
3813 vector mode. */
3822 {
3823 /* This case occurs when PREV_MODE is a vector and when
3824 MODE is too small to store using vector operations.
3825 After register allocation, the code will need to move the
3826 lowpart of the vector register into a non-vector register.
3828 Also, the target has chosen to use a hard register
3829 instead of going with the default choice of using a
3830 pseudo register. We should respect that choice and try to
3831 avoid creating a pseudo register with the same mode as the
3832 current hard register.
3834 In principle, we could just use a lowpart MODE subreg of
3835 the vector register. However, the vector register mode might
3836 be too wide for non-vector registers, and we already know
3837 that the non-vector mode is too small for vector registers.
3838 It's therefore likely that we'd need to spill to memory in
3839 the vector mode and reload the non-vector value from there.
3841 Try to avoid that by reducing the vector register to the
3842 smallest size that it can hold. This should increase the
3843 chances that non-vector registers can hold both the inner
3844 and outer modes of the subreg that we generate later. */
3845 machine_mode m;
3846 fixed_size_mode candidate;
3849 {
3856 {
3858 prev_mode);
3862 }
3863 }
3866 }
3869 }
3871 }
3873 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3874 bytes from constant string DATA + OFFSET and return it as target
3875 constant. If PREV isn't nullptr, it has the RTL info from the
3876 previous iteration. */
3878 rtx
3880 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3881 fixed_size_mode mode)
3882 {
3887 mode);
3893 {
3898 /* Return CONST_VECTOR when called by a query function. */
3901 /* Use the move expander with CONST_VECTOR. */
3905 }
3911 /* Vector modes should be handled above. */
3913 }
3915 /* Callback routine for store_by_pieces. Return the RTL of a register
3916 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3917 char value given in the RTL register data. For example, if mode is
3918 4 bytes wide, return the RTL for 0x01010101*data. If PREV isn't
3919 nullptr, it has the RTL info from the previous iteration. */
3921 static rtx
3923 HOST_WIDE_INT offset ATTRIBUTE_UNUSED,
3924 fixed_size_mode mode)
3925 {
3939 {
3942 /* vec_duplicate_optab is a precondition to pick a vector mode for
3943 the memset expander. */
3955 }
3959 /* Vector modes should be handled above. */
3965 }
3967 /* Expand expression EXP, which is a call to the memset builtin. Return
3968 NULL_RTX if we failed the caller should emit a normal call, otherwise
3969 try to get the result in TARGET, if convenient (and in mode MODE if that's
3970 convenient). */
3972 rtx
3974 {
3984 }
3986 /* Try to store VAL (or, if NULL_RTX, VALC) in LEN bytes starting at TO.
3987 Return TRUE if successful, FALSE otherwise. TO is assumed to be
3988 aligned at an ALIGN-bits boundary. LEN must be a multiple of
3989 1<<CTZ_LEN between MIN_LEN and MAX_LEN.
3991 The strategy is to issue one store_by_pieces for each power of two,
3992 from most to least significant, guarded by a test on whether there
3993 are at least that many bytes left to copy in LEN.
3995 ??? Should we skip some powers of two in favor of loops? Maybe start
3996 at the max of TO/LEN/word alignment, at least when optimizing for
3997 size, instead of ensuring O(log len) dynamic compares? */
3999 bool
4004 {
4014 /* Bits more significant than TST_BITS are part of the shared prefix
4015 in the binary representation of both min_len and max_len. Since
4016 they're identical, we don't need to test them in the loop. */
4020 /* Check whether it's profitable to start by storing a fixed BLKSIZE
4021 bytes, to lower max_bits. In the unlikely case of a constant LEN
4022 (implied by identical MAX_LEN and MIN_LEN), we want to issue a
4023 single store_by_pieces, but otherwise, select the minimum multiple
4024 of the ALIGN (in bytes) and of the MCD of the possible LENs, that
4025 brings MAX_LEN below TST_BITS, if that's lower than min_len. */
4028 {
4033 }
4036 else
4037 /* Huh, max_len < min_len? Punt. See pr100843.c. */
4040 {
4048 }
4049 else
4052 /* Check that we can use store by pieces for the maximum store count
4053 we may issue (initial fixed-size block, plus conditional
4054 power-of-two-sized from max_bits to ctz_len. */
4063 by_pieces_constfn constfun;
4066 {
4069 val);
4070 }
4071 else
4072 {
4075 }
4083 {
4091 /* Adjust PTR, TO and REM. Since TO's address is likely
4092 PTR+offset, we have to replace it. */
4097 }
4099 /* Iterate over power-of-two block sizes from the maximum length to
4100 the least significant bit possibly set in the length. */
4102 {
4106 /* If we're past the bits shared between min_ and max_len, expand
4107 a test on the dynamic length, comparing it with the
4108 BLKSIZE. */
4110 {
4115 }
4116 /* If we are at a bit that is in the prefix shared by min_ and
4117 max_len, skip this BLKSIZE if the bit is clear. */
4121 /* Issue a store of BLKSIZE bytes. */
4127 /* Adjust REM and PTR, unless this is the last iteration. */
4129 {
4134 }
4137 {
4140 /* Given conditional stores, the offset can no longer be
4141 known, so clear it. */
4143 }
4144 }
4147 }
4149 /* Helper function to do the actual work for expand_builtin_memset. The
4150 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4151 so that this can also be called without constructing an actual CALL_EXPR.
4152 The other arguments and return value are the same as for
4153 expand_builtin_memset. */
4155 static rtx
4158 {
4161 machine_mode val_mode;
4173 /* If DEST is not a pointer type, don't do this operation in-line. */
4184 /* If the LEN parameter is zero, return DEST. */
4186 {
4187 /* Evaluate and ignore VAL in case it has side-effects. */
4190 }
4192 /* Stabilize the arguments in case we fail. */
4205 {
4206 rtx val_rtx;
4211 /* Assume that we can memset by pieces if we can store
4212 * the coefficients by pieces (in the required modes).
4213 * We can't pass builtin_memset_gen_str as that emits RTL. */
4219 {
4224 }
4228 probable_max_size)
4233 dest_align))
4239 }
4242 {
4249 RETURN_BEGIN);
4254 probable_max_size)
4259 dest_align))
4265 }
4276 {
4279 }
4283 do_libcall:
4292 else
4297 }
4299 /* Expand expression EXP, which is a call to the bzero builtin. Return
4300 NULL_RTX if we failed the caller should emit a normal call. */
4302 static rtx
4304 {
4311 /* New argument list transforming bzero(ptr x, int y) to
4312 memset(ptr x, int 0, size_t y). This is done this way
4313 so that if it isn't expanded inline, we fallback to
4314 calling bzero instead of memset. */
4322 }
4324 /* Try to expand cmpstr operation ICODE with the given operands.
4325 Return the result rtx on success, otherwise return null. */
4327 static rtx
4329 HOST_WIDE_INT align)
4330 {
4344 }
4346 /* Expand expression EXP, which is a call to the memcmp built-in function.
4347 Return NULL_RTX if we failed and the caller should emit a normal call,
4348 otherwise try to get the result in TARGET, if convenient.
4349 RESULT_EQ is true if we can relax the returned value to be either zero
4350 or nonzero, without caring about the sign. */
4352 static rtx
4354 {
4363 /* Due to the performance benefit, always inline the calls first
4364 when result_eq is false. */
4368 {
4372 }
4380 /* If we don't have POINTER_TYPE, call the function. */
4388 /* Set MEM_SIZE as appropriate. */
4390 {
4393 }
4397 /* Try to get the byte representation of the constant ARG2 (or, only
4398 when the function's result is used for equality to zero, ARG1)
4399 points to, with its byte size in NBYTES. */
4403 {
4404 /* For equality to zero the arguments are interchangeable. */
4408 }
4410 /* If the function's constant bound LEN_RTX is less than or equal
4411 to the byte size of the representation of the constant argument,
4412 and if block move would be done by pieces, we can avoid loading
4413 the bytes from memory and only store the computed constant result. */
4425 {
4426 /* Return the value in the proper mode for this function. */
4431 {
4434 }
4437 }
4440 }
4442 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4443 if we failed the caller should emit a normal call, otherwise try to get
4444 the result in TARGET, if convenient. */
4446 static rtx
4448 {
4455 /* Due to the performance benefit, always inline the calls first. */
4469 /* If we don't have POINTER_TYPE, call the function. */
4473 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4480 /* Try to call cmpstrsi. */
4485 /* Try to determine at least one length and call cmpstrnsi. */
4487 {
4488 tree len;
4489 rtx arg3_rtx;
4499 /* If we don't have a constant length for the first, use the length
4500 of the second, if we know it. We don't require a constant for
4501 this case; some cost analysis could be done if both are available
4502 but neither is constant. For now, assume they're equally cheap,
4503 unless one has side effects. If both strings have constant lengths,
4504 use the smaller. */
4520 else
4523 /* If both arguments have side effects, we cannot optimize. */
4525 {
4527 result = expand_cmpstrn_or_cmpmem
4530 }
4531 }
4535 {
4536 /* Return the value in the proper mode for this function. */
4544 }
4546 /* Expand the library call ourselves using a stabilized argument
4547 list to avoid re-evaluating the function's arguments twice. */
4553 }
4555 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4556 NULL_RTX if we failed the caller should emit a normal call, otherwise
4557 try to get the result in TARGET, if convenient. */
4559 static rtx
4561 ATTRIBUTE_UNUSED machine_mode mode)
4562 {
4575 /* Due to the performance benefit, always inline the calls first. */
4581 /* If c_strlen can determine an expression for one of the string
4582 lengths, and it doesn't have side effects, then emit cmpstrnsi
4583 using length MIN(strlen(string)+1, arg3). */
4588 tree len;
4600 /* If we don't have a constant length for the first, use the length
4601 of the second, if we know it. If neither string is constant length,
4602 use the given length argument. We don't require a constant for
4603 this case; some cost analysis could be done if both are available
4604 but neither is constant. For now, assume they're equally cheap,
4605 unless one has side effects. If both strings have constant lengths,
4606 use the smaller. */
4624 else
4627 /* If we are not using the given length, we must incorporate it here.
4628 The actual new length parameter will be MIN(len,arg3) in this case. */
4630 {
4633 }
4643 {
4644 /* Return the value in the proper mode for this function. */
4652 }
4654 /* Expand the library call ourselves using a stabilized argument
4655 list to avoid re-evaluating the function's arguments twice. */
4661 }
4663 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4664 if that's convenient. */
4666 rtx
4668 {
4669 rtx val;
4672 /* Don't do __builtin_saveregs more than once in a function.
4673 Save the result of the first call and reuse it. */
4677 /* When this function is called, it means that registers must be
4678 saved on entry to this function. So we migrate the call to the
4679 first insn of this function. */
4683 /* Do whatever the machine needs done in this case. */
4691 /* Put the insns after the NOTE that starts the function. If this
4692 is inside a start_sequence, make the outer-level insn chain current, so
4693 the code is placed at the start of the function. */
4699 }
4701 /* Expand a call to __builtin_next_arg. */
4703 static rtx
4705 {
4706 /* Checking arguments is already done in fold_builtin_next_arg
4707 that must be called before this function. */
4712 }
4714 /* Make it easier for the backends by protecting the valist argument
4715 from multiple evaluations. */
4717 static tree
4719 {
4722 /* The current way of determining the type of valist is completely
4723 bogus. We should have the information on the va builtin instead. */
4728 {
4732 /* For this case, the backends will be expecting a pointer to
4733 vatype, but it's possible we've actually been given an array
4734 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4735 So fix it. */
4737 {
4740 }
4741 }
4742 else
4743 {
4747 {
4753 }
4759 }
4762 }
4764 /* The "standard" definition of va_list is void*. */
4766 tree
4768 {
4770 }
4772 /* The "standard" abi va_list is va_list_type_node. */
4774 tree
4776 {
4778 }
4780 /* The "standard" type of va_list is va_list_type_node. */
4782 tree
4784 {
4791 {
4792 /* If va_list is an array type, the argument may have decayed
4793 to a pointer type, e.g. by being passed to another function.
4794 In that case, unwrap both types so that we can compare the
4795 underlying records. */
4798 {
4801 }
4802 }
4807 }
4809 /* The "standard" implementation of va_start: just assign `nextarg' to
4810 the variable. */
4812 void
4814 {
4817 }
4819 /* Expand EXP, a call to __builtin_va_start. */
4821 static rtx
4823 {
4824 rtx nextarg;
4825 tree valist;
4829 {
4832 }
4842 else
4846 }
4848 /* Expand EXP, a call to __builtin_va_end. */
4850 static rtx
4852 {
4855 /* Evaluate for side effects, if needed. I hate macros that don't
4856 do that. */
4861 }
4863 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4864 builtin rather than just as an assignment in stdarg.h because of the
4865 nastiness of array-type va_list types. */
4867 static rtx
4869 {
4882 {
4886 }
4887 else
4888 {
4891 /* Evaluate to pointers. */
4900 /* "Dereference" to BLKmode memories. */
4908 /* Copy. */
4910 }
4913 }
4915 /* Expand a call to one of the builtin functions __builtin_frame_address or
4916 __builtin_return_address. */
4918 static rtx
4920 {
4921 /* The argument must be a nonnegative integer constant.
4922 It counts the number of frames to scan up the stack.
4923 The value is either the frame pointer value or the return
4924 address saved in that frame. */
4926 /* Warning about missing arg was already issued. */
4929 {
4932 }
4933 else
4934 {
4935 /* Number of frames to scan up the stack. */
4940 /* Some ports cannot access arbitrary stack frames. */
4942 {
4945 }
4948 {
4949 /* Warn since no effort is made to ensure that any frame
4950 beyond the current one exists or can be safely reached. */
4953 }
4955 /* For __builtin_frame_address, return what we've got. */
4963 }
4964 }
4966 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
4967 failed and the caller should emit a normal call. */
4969 static rtx
4971 {
4972 rtx op0;
4973 rtx result;
4976 HOST_WIDE_INT max_size;
4979 bool valid_arglist
4982 VOID_TYPE)
4990 /* Compute the argument. */
4993 /* Compute the alignment. */
4995 ? BIGGEST_ALIGNMENT
4998 /* Compute the maximum size. */
5003 /* Allocate the desired space. If the allocation stems from the declaration
5004 of a variable-sized object, it cannot accumulate. */
5005 result
5009 /* Dynamic allocations for variables are recorded during gimplification. */
5014 }
5016 /* Emit a call to __asan_allocas_unpoison call in EXP. Add to second argument
5017 of the call virtual_stack_dynamic_rtx - stack_pointer_rtx, which is the
5018 STACK_DYNAMIC_OFFSET value. See motivation for this in comment to
5019 handle_builtin_stack_restore function. */
5021 static rtx
5023 {
5030 OPTAB_LIB_WIDEN);
5033 OPTAB_LIB_WIDEN);
5038 }
5040 /* Expand a call to bswap builtin in EXP.
5041 Return NULL_RTX if a normal call should be emitted rather than expanding the
5042 function in-line. If convenient, the result should be placed in TARGET.
5043 SUBTARGET may be used as the target for computing one of EXP's operands. */
5045 static rtx
5047 rtx subtarget)
5048 {
5049 tree arg;
5050 rtx op0;
5068 }
5070 /* Expand a call to a unary builtin in EXP.
5071 Return NULL_RTX if a normal call should be emitted rather than expanding the
5072 function in-line. If convenient, the result should be placed in TARGET.
5073 SUBTARGET may be used as the target for computing one of EXP's operands. */
5075 static rtx
5078 {
5079 rtx op0;
5084 /* Compute the argument. */
5086 (subtarget
5090 /* Compute op, into TARGET if possible.
5091 Set TARGET to wherever the result comes back. */
5097 }
5099 /* Expand a call to __builtin_expect. We just return our argument
5100 as the builtin_expect semantic should've been already executed by
5101 tree branch prediction pass. */
5103 static rtx
5105 {
5106 tree arg;
5113 /* When guessing was done, the hints should be already stripped away. */
5117 }
5119 /* Expand a call to __builtin_expect_with_probability. We just return our
5120 argument as the builtin_expect semantic should've been already executed by
5121 tree branch prediction pass. */
5123 static rtx
5125 {
5126 tree arg;
5133 /* When guessing was done, the hints should be already stripped away. */
5137 }
5140 /* Expand a call to __builtin_assume_aligned. We just return our first
5141 argument as the builtin_assume_aligned semantic should've been already
5142 executed by CCP. */
5144 static rtx
5146 {
5150 EXPAND_NORMAL);
5155 }
5157 void
5159 {
5161 {
5163 /* For trap insns when not accumulating outgoing args force
5164 REG_ARGS_SIZE note to prevent crossjumping of calls with
5165 different args sizes. */
5168 }
5169 else
5170 {
5174 }
5177 }
5179 /* Expand a call to __builtin_unreachable. We do nothing except emit
5180 a barrier saying that control flow will not pass here.
5182 It is the responsibility of the program being compiled to ensure
5183 that control flow does never reach __builtin_unreachable. */
5184 static void
5186 {
5187 /* Use gimple_build_builtin_unreachable or builtin_decl_unreachable
5188 to avoid this. */
5191 }
5193 /* Expand EXP, a call to fabs, fabsf or fabsl.
5194 Return NULL_RTX if a normal call should be emitted rather than expanding
5195 the function inline. If convenient, the result should be placed
5196 in TARGET. SUBTARGET may be used as the target for computing
5197 the operand. */
5199 static rtx
5201 {
5202 machine_mode mode;
5203 tree arg;
5204 rtx op0;
5214 }
5216 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5217 Return NULL is a normal call should be emitted rather than expanding the
5218 function inline. If convenient, the result should be placed in TARGET.
5219 SUBTARGET may be used as the target for computing the operand. */
5221 static rtx
5223 {
5225 tree arg;
5237 }
5239 /* Emit a call to __builtin___clear_cache. */
5241 void
5243 {
5245 BUILTIN_ASM_NAME_PTR
5252 }
5254 /* Emit a call to __builtin___clear_cache, unless the target specifies
5255 it as do-nothing. This function can be used by trampoline
5256 finalizers to duplicate the effects of expanding a call to the
5257 clear_cache builtin. */
5259 void
5261 {
5268 {
5269 /* We have a "clear_cache" insn, and it will handle everything. */
5277 }
5278 else
5279 {
5280 #ifndef CLEAR_INSN_CACHE
5281 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5282 does nothing. There is no need to call it. Do nothing. */
5285 }
5288 }
5290 /* Expand a call to __builtin___clear_cache. */
5292 static void
5294 {
5298 /* We must not expand to a library call. If we did, any
5299 fallback library function in libgcc that might contain a call to
5300 __builtin___clear_cache() would recurse infinitely. */
5302 {
5305 }
5314 }
5316 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5318 static rtx
5320 {
5323 /* If we don't need too much alignment, we'll have been guaranteed
5324 proper alignment by get_trampoline_type. */
5328 /* Round address up to desired boundary. */
5339 }
5341 static rtx
5343 {
5359 /* If ONSTACK, the TRAMP argument should be the address of a field
5360 within the local function's FRAME decl. Either way, let's see if
5361 we can fill in the MEM_ATTRs for this memory. */
5365 /* Creator of a heap trampoline is responsible for making sure the
5366 address is aligned to at least STACK_BOUNDARY. Normally malloc
5367 will ensure this anyhow. */
5370 {
5374 }
5376 /* The FUNC argument should be the address of the nested function.
5377 Extract the actual function decl to pass to the hook. */
5384 /* Generate insns to initialize the trampoline. */
5388 {
5394 }
5397 }
5399 static rtx
5401 {
5402 rtx tramp;
5413 }
5415 /* Expand a call to the builtin descriptor initialization routine.
5416 A descriptor is made up of a couple of pointers to the static
5417 chain and the code entry in this order. */
5419 static rtx
5421 {
5426 VOID_TYPE))
5441 /* Generate insns to initialize the descriptor. */
5447 }
5449 /* Expand a call to the builtin descriptor adjustment routine. */
5451 static rtx
5453 {
5454 rtx tramp;
5461 /* Unalign the descriptor to allow runtime identification. */
5466 }
5468 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5469 function. The function first checks whether the back end provides
5470 an insn to implement signbit for the respective mode. If not, it
5471 checks whether the floating point format of the value is such that
5472 the sign bit can be extracted. If that is not the case, error out.
5473 EXP is the expression that is a call to the builtin function; if
5474 convenient, the result should be placed in TARGET. */
5475 static rtx
5477 {
5479 scalar_float_mode fmode;
5481 tree arg;
5484 rtx temp;
5497 /* Expand the argument yielding a RTX expression. */
5500 /* Check if the back end provides an insn that handles signbit for the
5501 argument's mode. */
5504 {
5510 }
5512 /* For floating point formats without a sign bit, implement signbit
5513 as "ARG < 0.0". */
5516 {
5517 /* But we can't do this if the format supports signed zero. */
5523 }
5526 {
5529 }
5530 else
5531 {
5533 /* Handle targets with different FP word orders. */
5536 else
5540 }
5542 /* Force the intermediate word_mode (or narrower) result into a
5543 register. This avoids attempting to create paradoxical SUBREGs
5544 of floating point modes below. */
5547 /* If the bitpos is within the "result mode" lowpart, the operation
5548 can be implement with a single bitwise AND. Otherwise, we need
5549 a right shift and an AND. */
5552 {
5560 }
5561 else
5562 {
5563 /* Perform a logical right shift to place the signbit in the least
5564 significant bit, then truncate the result to the desired mode
5565 and mask just this bit. */
5570 }
5573 }
5575 /* Expand fork or exec calls. TARGET is the desired target of the
5576 call. EXP is the call. FN is the
5577 identificator of the actual function. IGNORE is nonzero if the
5578 value is to be ignored. */
5580 static rtx
5582 {
5584 tree call;
5586 /* If we are not profiling, just call the function. */
5590 /* Otherwise call the wrapper. This should be equivalent for the rest of
5591 compiler, so the code does not diverge, and the wrapper may run the
5592 code necessary for keeping the profiling sane. */
5595 {
5626 }
5638 }
5641 \f
5642 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5643 the pointer in these functions is void*, the tree optimizers may remove
5644 casts. The mode computed in expand_builtin isn't reliable either, due
5645 to __sync_bool_compare_and_swap.
5647 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5648 group of builtins. This gives us log2 of the mode size. */
5652 {
5653 /* The size is not negotiable, so ask not to get BLKmode in return
5654 if the target indicates that a smaller size would be better. */
5656 }
5658 /* Expand the memory expression LOC and return the appropriate memory operand
5659 for the builtin_sync operations. */
5661 static rtx
5663 {
5673 /* Note that we explicitly do not want any alias information for this
5674 memory, so that we kill all other live memories. Otherwise we don't
5675 satisfy the full barrier semantics of the intrinsic. */
5682 /* The alignment needs to be at least according to that of the mode. */
5689 }
5691 /* Make sure an argument is in the right mode.
5692 EXP is the tree argument.
5693 MODE is the mode it should be in. */
5695 static rtx
5697 {
5698 rtx val;
5699 machine_mode old_mode;
5703 {
5704 /* Undo argument promotion if possible, as combine might not
5705 be able to do it later due to MEM_VOLATILE_P uses in the
5706 patterns. */
5709 {
5719 }
5720 }
5723 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5724 of CONST_INTs, where we know the old_mode only from the call argument. */
5731 }
5734 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5735 EXP is the CALL_EXPR. CODE is the rtx code
5736 that corresponds to the arithmetic or logical operation from the name;
5737 an exception here is that NOT actually means NAND. TARGET is an optional
5738 place for us to store the results; AFTER is true if this is the
5739 fetch_and_xxx form. */
5741 static rtx
5744 rtx target)
5745 {
5750 {
5757 {
5786 }
5787 }
5789 /* Expand the operands. */
5794 after);
5795 }
5797 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5798 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5799 true if this is the boolean form. TARGET is a place for us to store the
5800 results; this is NOT optional if IS_BOOL is true. */
5802 static rtx
5805 {
5809 /* Expand the operands. */
5816 {
5819 else
5821 }
5824 MEMMODEL_SYNC_SEQ_CST))
5828 }
5830 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5831 general form is actually an atomic exchange, and some targets only
5832 support a reduced form with the second argument being a constant 1.
5833 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5834 the results. */
5836 static rtx
5838 rtx target)
5839 {
5842 /* Expand the operands. */
5847 }
5849 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5851 static void
5853 {
5854 rtx mem;
5856 /* Expand the operands. */
5860 }
5862 /* Given an integer representing an ``enum memmodel'', verify its
5863 correctness and return the memory model enum. */
5865 static enum memmodel
5867 {
5868 /* If the parameter is not a constant, it's a run time value so we'll just
5869 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5881 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5885 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5886 be conservative and promote consume to acquire. */
5891 }
5893 /* Expand the __atomic_exchange intrinsic:
5894 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5895 EXP is the CALL_EXPR.
5896 TARGET is an optional place for us to store the results. */
5898 static rtx
5900 {
5909 /* Expand the operands. */
5914 }
5916 /* Expand the __atomic_compare_exchange intrinsic:
5917 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5918 TYPE desired, BOOL weak,
5919 enum memmodel success,
5920 enum memmodel failure)
5921 EXP is the CALL_EXPR.
5922 TARGET is an optional place for us to store the results. */
5924 static rtx
5926 rtx target)
5927 {
5930 tree weak;
5940 {
5943 }
5949 /* Expand the operands. */
5965 /* Lest the rtl backend create a race condition with an imporoper store
5966 to memory, always create a new pseudo for OLDVAL. */
5973 /* Conditionally store back to EXPECT, lest we create a race condition
5974 with an improper store to memory. */
5975 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5976 the normal case where EXPECT is totally private, i.e. a register. At
5977 which point the store can be unconditional. */
5985 }
5987 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5988 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5989 call. The weak parameter must be dropped to match the expected parameter
5990 list and the expected argument changed from value to pointer to memory
5991 slot. */
5993 static void
5995 {
6011 /* Skip the boolean weak parameter. */
6014 /* At present we only have BUILT_IN_ATOMIC_COMPARE_EXCHANGE_{1,2,4,8,16}. */
6017 built_in_function fncode
6022 fndecl);
6027 {
6034 }
6035 }
6037 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
6039 void
6041 {
6053 {
6056 }
6059 {
6062 }
6064 /* Expand the operands. */
6077 {
6080 }
6084 {
6090 }
6091 }
6093 /* Expand the __atomic_load intrinsic:
6094 TYPE __atomic_load (TYPE *object, enum memmodel)
6095 EXP is the CALL_EXPR.
6096 TARGET is an optional place for us to store the results. */
6098 static rtx
6100 {
6108 /* Expand the operand. */
6112 }
6115 /* Expand the __atomic_store intrinsic:
6116 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
6117 EXP is the CALL_EXPR.
6118 TARGET is an optional place for us to store the results. */
6120 static rtx
6122 {
6131 /* Expand the operands. */
6136 }
6138 /* Expand the __atomic_fetch_XXX intrinsic:
6139 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
6140 EXP is the CALL_EXPR.
6141 TARGET is an optional place for us to store the results.
6142 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
6143 FETCH_AFTER is true if returning the result of the operation.
6144 FETCH_AFTER is false if returning the value before the operation.
6145 IGNORE is true if the result is not used.
6146 EXT_CALL is the correct builtin for an external call if this cannot be
6147 resolved to an instruction sequence. */
6149 static rtx
6153 {
6156 tree fndecl;
6157 tree addr;
6161 /* Expand the operands. */
6165 /* Only try generating instructions if inlining is turned on. */
6167 {
6171 }
6173 /* Return if a different routine isn't needed for the library call. */
6177 /* Change the call to the specified function. */
6185 /* If we will emit code after the call, the call cannot be a tail call.
6186 If it is emitted as a tail call, a barrier is emitted after it, and
6187 then all trailing code is removed. */
6191 /* Expand the call here so we can emit trailing code. */
6194 /* Replace the original function just in case it matters. */
6197 /* Then issue the arithmetic correction to return the right result. */
6199 {
6201 {
6203 OPTAB_LIB_WIDEN);
6205 }
6206 else
6208 OPTAB_LIB_WIDEN);
6209 }
6211 }
6213 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6215 void
6217 {
6225 optab optab;
6237 {
6252 }
6255 {
6262 }
6264 rtx target;
6267 else
6288 {
6295 is_atomic
6300 }
6304 {
6309 }
6310 else
6312 OPTAB_DIRECT);
6315 }
6317 /* Expand IFN_ATOMIC_*_FETCH_CMP_0 internal function. */
6319 void
6321 {
6328 optab optab;
6329 rtx_code code;
6341 {
6364 }
6368 {
6376 }
6378 rtx target;
6381 else
6396 {
6403 is_atomic
6408 }
6411 {
6416 }
6417 }
6419 /* Expand an atomic clear operation.
6420 void _atomic_clear (BOOL *obj, enum memmodel)
6421 EXP is the call expression. */
6423 static rtx
6425 {
6433 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6434 Failing that, a store is issued by __atomic_store. The only way this can
6435 fail is if the bool type is larger than a word size. Unlikely, but
6436 handle it anyway for completeness. Assume a single threaded model since
6437 there is no atomic support in this case, and no barriers are required. */
6442 }
6444 /* Expand an atomic test_and_set operation.
6445 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6446 EXP is the call expression. */
6448 static rtx
6450 {
6451 rtx mem;
6453 machine_mode mode;
6460 }
6463 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6464 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6466 static tree
6468 {
6470 machine_mode mode;
6476 /* We need a corresponding integer mode for the access to be lock-free. */
6484 {
6487 /* Either this argument is null, or it's a fake pointer encoding
6488 the alignment of the object. */
6494 else
6496 }
6497 else
6498 {
6501 /* This function is usually invoked and folded immediately by the front
6502 end before anything else has a chance to look at it. The pointer
6503 parameter at this point is usually cast to a void *, so check for that
6504 and look past the cast. */
6514 /* Get the underlying type of the object. */
6517 }
6519 /* If the object has smaller alignment, the lock free routines cannot
6520 be used. */
6524 /* Check if a compare_and_swap pattern exists for the mode which represents
6525 the required size. The pattern is not allowed to fail, so the existence
6526 of the pattern indicates support is present. Also require that an
6527 atomic load exists for the required size. */
6530 else
6532 }
6534 /* Return true if the parameters to call EXP represent an object which will
6535 always generate lock free instructions. The first argument represents the
6536 size of the object, and the second parameter is a pointer to the object
6537 itself. If NULL is passed for the object, then the result is based on
6538 typical alignment for an object of the specified size. Otherwise return
6539 false. */
6541 static rtx
6543 {
6544 tree size;
6549 {
6552 }
6558 }
6560 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6561 is lock free on this architecture. */
6563 static tree
6565 {
6569 /* If it isn't always lock free, don't generate a result. */
6574 }
6576 /* Return true if the parameters to call EXP represent an object which will
6577 always generate lock free instructions. The first argument represents the
6578 size of the object, and the second parameter is a pointer to the object
6579 itself. If NULL is passed for the object, then the result is based on
6580 typical alignment for an object of the specified size. Otherwise return
6581 NULL*/
6583 static rtx
6585 {
6586 tree size;
6591 {
6594 }
6599 /* If the value is known at compile time, return the RTX for it. */
6605 }
6607 /* Expand the __atomic_thread_fence intrinsic:
6608 void __atomic_thread_fence (enum memmodel)
6609 EXP is the CALL_EXPR. */
6611 static void
6613 {
6616 }
6618 /* Expand the __atomic_signal_fence intrinsic:
6619 void __atomic_signal_fence (enum memmodel)
6620 EXP is the CALL_EXPR. */
6622 static void
6624 {
6627 }
6629 /* Expand the __sync_synchronize intrinsic. */
6631 static void
6633 {
6635 }
6637 static rtx
6639 {
6645 {
6647 /* If the target is not sutitable then create a new target. */
6655 }
6658 }
6660 static void
6662 {
6668 {
6675 }
6677 }
6679 \f
6680 /* Emit code to restore the current value of stack. */
6682 static void
6684 {
6696 }
6698 /* Emit code to save the current value of stack. */
6700 static rtx
6702 {
6707 }
6709 /* Emit code to get the openacc gang, worker or vector id or size. */
6711 static rtx
6713 {
6715 rtx fallback_retval;
6718 {
6731 }
6734 {
6737 }
6741 {
6744 }
6748 {
6756 }
6765 {
6768 }
6776 }
6778 /* Expand a string compare operation using a sequence of char comparison
6779 to get rid of the calling overhead, with result going to TARGET if
6780 that's convenient.
6782 VAR_STR is the variable string source;
6783 CONST_STR is the constant string source;
6784 LENGTH is the number of chars to compare;
6785 CONST_STR_N indicates which source string is the constant string;
6786 IS_MEMCMP indicates whether it's a memcmp or strcmp.
6788 to: (assume const_str_n is 2, i.e., arg2 is a constant string)
6790 target = (int) (unsigned char) var_str[0]
6791 - (int) (unsigned char) const_str[0];
6792 if (target != 0)
6793 goto ne_label;
6794 ...
6795 target = (int) (unsigned char) var_str[length - 2]
6796 - (int) (unsigned char) const_str[length - 2];
6797 if (target != 0)
6798 goto ne_label;
6799 target = (int) (unsigned char) var_str[length - 1]
6800 - (int) (unsigned char) const_str[length - 1];
6801 ne_label:
6802 */
6804 static rtx
6808 {
6810 rtx var_rtx_array
6817 scalar_int_mode unit_mode
6823 {
6824 var_rtx
6838 }
6846 }
6848 /* Inline expansion of a call to str(n)cmp and memcmp, with result going
6849 to TARGET if that's convenient.
6850 If the call is not been inlined, return NULL_RTX. */
6852 static rtx
6854 {
6859 /* Do NOT apply this inlining expansion when optimizing for size or
6860 optimization level below 2. */
6868 /* On a target where the type of the call (int) has same or narrower presicion
6869 than unsigned char, give up the inlining expansion. */
6882 /* Get the object representation of the initializers of ARG1 and ARG2
6883 as strings, provided they refer to constant objects, with their byte
6884 sizes in LEN1 and LEN2, respectively. */
6888 /* Fail if neither argument refers to an initialized constant. */
6893 {
6894 /* Fail if the memcmp/strncmp bound is not a constant. */
6901 {
6902 /* Fail if the memcmp bound is greater than the size of either
6903 of the two constant objects. */
6907 }
6908 }
6911 {
6912 /* For string functions (i.e., strcmp and strncmp) reduce LEN1
6913 and LEN2 to the length of the nul-terminated string stored
6914 in each. */
6919 }
6921 /* See inline_string_cmp. */
6929 else
6932 /* For strncmp only, compute the new bound as the smallest of
6933 the lengths of the two strings (plus 1) and the bound provided
6934 to the function. */
6939 /* If the bound of the comparison is larger than the threshold,
6940 do nothing. */
6946 /* Now, start inline expansion the call. */
6950 }
6952 /* Expand a call to __builtin_speculation_safe_value_<N>. MODE
6953 represents the size of the first argument to that call, or VOIDmode
6954 if the argument is a pointer. IGNORE will be true if the result
6955 isn't used. */
6956 static rtx
6959 {
6966 {
6969 }
6973 /* An optional second argument can be used as a failsafe value on
6974 some machines. If it isn't present, then the failsafe value is
6975 assumed to be 0. */
6977 {
6980 }
6981 else
6984 /* If the result isn't used, the behavior is undefined. It would be
6985 nice to emit a warning here, but path splitting means this might
6986 happen with legitimate code. So simply drop the builtin
6987 expansion in that case; we've handled any side-effects above. */
6991 /* If we don't have a suitable target, create one to hold the result. */
6999 }
7001 /* Expand an expression EXP that calls a built-in function,
7002 with result going to TARGET if that's convenient
7003 (and in mode MODE if that's convenient).
7004 SUBTARGET may be used as the target for computing one of EXP's operands.
7005 IGNORE is nonzero if the value is to be ignored. */
7007 rtx
7010 {
7018 /* When ASan is enabled, we don't want to expand some memory/string
7019 builtins and rely on libsanitizer's hooks. This allows us to avoid
7020 redundant checks and be sure, that possible overflow will be detected
7021 by ASan. */
7027 /* When not optimizing, generate calls to library functions for a certain
7028 set of builtins. */
7043 /* The built-in function expanders test for target == const0_rtx
7044 to determine whether the function's result will be ignored. */
7048 /* If the result of a pure or const built-in function is ignored, and
7049 none of its arguments are volatile, we can avoid expanding the
7050 built-in call and just evaluate the arguments for side-effects. */
7054 {
7056 tree arg;
7057 call_expr_arg_iterator iter;
7061 {
7064 }
7067 {
7071 }
7072 }
7075 {
7093 /* Just do a normal library call if we were unable to fold
7094 the values. */
7176 feclearexcept_optab);
7183 feraiseexcept_optab);
7191 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
7192 FUNCTION with a copy of the parameters described by
7193 ARGUMENTS, and ARGSIZE. It returns a block of memory
7194 allocated on the stack into which is stored all the registers
7195 that might possibly be used for returning the result of a
7196 function. ARGUMENTS is the value returned by
7197 __builtin_apply_args. ARGSIZE is the number of bytes of
7198 arguments that must be copied. ??? How should this value be
7199 computed? We'll also need a safe worst case value for varargs
7200 functions. */
7207 else
7208 {
7216 }
7218 /* __builtin_return (RESULT) causes the function to return the
7219 value described by RESULT. RESULT is address of the block of
7220 memory returned by __builtin_apply. */
7230 /* All valid uses of __builtin_va_arg_pack () are removed during
7231 inlining. */
7236 /* All valid uses of __builtin_va_arg_pack_len () are removed during
7237 inlining. */
7241 /* Return the address of the first anonymous stack arg. */
7261 /* Returns the address of the area where the structure is returned.
7262 0 otherwise. */
7268 else
7271 CASE_BUILT_IN_ALLOCA:
7398 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7399 back to a BUILT_IN_STRCMP. Remember to delete the 3rd parameter
7400 when changing it to a strcmp call. */
7406 /* Change this call back to a BUILT_IN_STRCMP. */
7410 /* Delete the last parameter. */
7417 /* FALLTHROUGH */
7425 /* Expand it as BUILT_IN_MEMCMP_EQ first. If not successful, change it
7426 back to a BUILT_IN_STRNCMP. */
7432 /* Change it back to a BUILT_IN_STRNCMP. */
7435 /* FALLTHROUGH */
7450 {
7453 }
7457 /* This should have been lowered to the builtins below. */
7461 /* __builtin_setjmp_setup is passed a pointer to an array of five words
7462 and the receiver label. */
7464 {
7470 /* This is copied from the handling of non-local gotos. */
7472 nonlocal_goto_handler_labels
7474 nonlocal_goto_handler_labels);
7475 /* ??? Do not let expand_label treat us as such since we would
7476 not want to be both on the list of non-local labels and on
7477 the list of forced labels. */
7480 }
7484 /* __builtin_setjmp_receiver is passed the receiver label. */
7486 {
7492 }
7495 /* __builtin_longjmp is passed a pointer to an array of five words.
7496 It's similar to the C library longjmp function but works with
7497 __builtin_setjmp above. */
7500 {
7506 {
7509 }
7513 }
7522 /* This updates the setjmp buffer that is its argument with the value
7523 of the current stack pointer. */
7526 {
7527 rtx buf_addr
7532 }
7552 /* Various hooks for the DWARF 2 __throw routine. */
7558 #ifdef DWARF2_UNWIND_INFO
7564 #endif
7766 mode = get_builtin_sync_mode
7778 mode = get_builtin_sync_mode
7825 {
7829 mode =
7835 /* If this is turned into an external library call, the weak parameter
7836 must be dropped to match the expected parameter list. */
7841 /* Skip the boolean weak parameter. */
7846 }
7875 {
7885 }
7891 {
7901 }
7907 {
7917 }
7923 {
7933 }
7939 {
7949 }
7955 {
7965 }
8098 /* Do library call, if we failed to expand the builtin when
8099 folding. */
8119 }
8121 /* The switch statement above can drop through to cause the function
8122 to be called normally. */
8124 }
8126 /* Determine whether a tree node represents a call to a built-in
8127 function. If the tree T is a call to a built-in function with
8128 the right number of arguments of the appropriate types, return
8129 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
8130 Otherwise the return value is END_BUILTINS. */
8132 enum built_in_function
8134 {
8137 const_call_expr_arg_iterator iter;
8149 {
8150 /* If a function doesn't take a variable number of arguments,
8151 the last element in the list will have type `void'. */
8154 {
8158 }
8167 {
8170 }
8172 {
8175 }
8177 {
8180 }
8182 {
8185 }
8186 else
8188 }
8190 /* Variable-length argument list. */
8192 }
8194 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
8195 evaluate to a constant. */
8197 static tree
8199 {
8200 /* We return 1 for a numeric type that's known to be a constant
8201 value at compile-time or for an aggregate type that's a
8202 literal constant. */
8205 /* If we know this is a constant, emit the constant of one. */
8211 {
8218 }
8220 /* If this expression has side effects, show we don't know it to be a
8221 constant. Likewise if it's a pointer or aggregate type since in
8222 those case we only want literals, since those are only optimized
8223 when generating RTL, not later.
8224 And finally, if we are compiling an initializer, not code, we
8225 need to return a definite result now; there's not going to be any
8226 more optimization done. */
8231 || folding_initializer
8236 }
8238 /* Create builtin_expect or builtin_expect_with_probability
8239 with PRED and EXPECTED as its arguments and return it as a truthvalue.
8240 Fortran FE can also produce builtin_expect with PREDICTOR as third argument.
8241 builtin_expect_with_probability instead uses third argument as PROBABILITY
8242 value. */
8244 static tree
8247 {
8262 else
8264 predictor);
8268 }
8270 /* Fold a call to builtin_expect with arguments ARG0, ARG1, ARG2, ARG3. Return
8271 NULL_TREE if no simplification is possible. */
8273 tree
8275 tree arg3)
8276 {
8280 /* Distribute the expected value over short-circuiting operators.
8281 See through the cast from truthvalue_type_node to long. */
8288 /* If this is a builtin_expect within a builtin_expect keep the
8289 inner one. See through a comparison against a constant. It
8290 might have been added to create a thruthvalue. */
8306 {
8316 }
8318 /* If the argument isn't invariant then there's nothing else we can do. */
8322 /* If we expect that a comparison against the argument will fold to
8323 a constant return the constant. In practice, this means a true
8324 constant or the address of a non-weak symbol. */
8328 {
8329 do
8330 {
8332 }
8337 }
8339 /* Otherwise, ARG0 already has the proper type for the return value. */
8341 }
8343 /* Fold a call to __builtin_classify_type with argument ARG. */
8345 static tree
8347 {
8352 }
8354 /* Fold a call EXPR (which may be null) to __builtin_strlen with argument
8355 ARG. */
8357 static tree
8359 {
8362 else
8363 {
8364 c_strlen_data lendata = { };
8370 /* TODO: Move this to gimple-ssa-warn-access once the pass runs
8371 also early enough to detect invalid reads in multimensional
8372 arrays and struct members. */
8377 {
8383 }
8386 }
8387 }
8389 /* Fold a call to __builtin_inf or __builtin_huge_val. */
8391 static tree
8393 {
8394 REAL_VALUE_TYPE real;
8396 /* __builtin_inff is intended to be usable to define INFINITY on all
8397 targets. If an infinity is not available, INFINITY expands "to a
8398 positive constant of type float that overflows at translation
8399 time", footnote "In this case, using INFINITY will violate the
8400 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
8401 Thus we pedwarn to ensure this constraint violation is
8402 diagnosed. */
8408 }
8410 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
8411 NULL_TREE if no simplification can be made. */
8413 static tree
8416 {
8417 tree type;
8427 /* Calculate the result when the argument is a constant. */
8432 /* Canonicalize sincos to cexpi. */
8434 {
8437 }
8439 {
8446 }
8458 }
8460 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
8461 Return NULL_TREE if no simplification can be made. */
8463 static tree
8465 {
8471 /* If the LEN parameter is zero, return zero. */
8476 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
8480 /* If len parameter is one, return an expression corresponding to
8481 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
8483 {
8485 tree cst_uchar_ptr_node
8488 tree ind1
8492 cst_uchar_ptr_node,
8493 arg1)));
8494 tree ind2
8498 cst_uchar_ptr_node,
8499 arg2)));
8501 }
8504 }
8506 /* Fold a call to builtin isascii with argument ARG. */
8508 static tree
8510 {
8513 else
8514 {
8515 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
8521 }
8522 }
8524 /* Fold a call to builtin toascii with argument ARG. */
8526 static tree
8528 {
8532 /* Transform toascii(c) -> (c & 0x7f). */
8535 }
8537 /* Fold a call to builtin isdigit with argument ARG. */
8539 static tree
8541 {
8544 else
8545 {
8546 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8547 /* According to the C standard, isdigit is unaffected by locale.
8548 However, it definitely is affected by the target character set. */
8549 unsigned HOST_WIDE_INT target_digit0
8560 }
8561 }
8563 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8565 static tree
8567 {
8573 }
8575 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8577 static tree
8579 {
8585 }
8587 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8589 static tree
8591 {
8594 {
8598 {
8603 }
8604 }
8607 }
8609 /* Fold a call to builtin frexp, we can assume the base is 2. */
8611 static tree
8613 {
8624 /* Proceed if a valid pointer type was passed in. */
8626 {
8631 {
8633 /* For +-0, return (*exp = 0, +-0). */
8639 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8642 {
8643 /* Since the frexp function always expects base 2, and in
8644 GCC normalized significands are already in the range
8645 [0.5, 1.0), we have exactly what frexp wants. */
8650 }
8654 }
8656 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8660 }
8663 }
8665 /* Fold a call to builtin modf. */
8667 static tree
8669 {
8680 /* Proceed if a valid pointer type was passed in. */
8682 {
8687 {
8690 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8694 /* For +-Inf, return (*arg1 = arg0, +-0). */
8700 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8703 /* If the original number was negative and already
8704 integral, then the fractional part is -0.0. */
8708 }
8710 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8716 }
8719 }
8721 /* Given a location LOC, an interclass builtin function decl FNDECL
8722 and its single argument ARG, return an folded expression computing
8723 the same, or NULL_TREE if we either couldn't or didn't want to fold
8724 (the latter happen if there's an RTL instruction available). */
8726 static tree
8728 {
8729 machine_mode mode;
8741 /* If there is no optab, try generic code. */
8743 {
8744 tree result;
8747 {
8748 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8751 REAL_VALUE_TYPE r;
8755 {
8756 /* NaN and Inf are encoded in the high-order double value
8757 only. The low-order value is not significant. */
8761 }
8768 }
8771 {
8772 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8775 REAL_VALUE_TYPE r;
8779 {
8780 /* NaN and Inf are encoded in the high-order double value
8781 only. The low-order value is not significant. */
8785 }
8791 /*result = fold_build2_loc (loc, UNGT_EXPR,
8792 TREE_TYPE (TREE_TYPE (fndecl)),
8793 fold_build1_loc (loc, ABS_EXPR, type, arg),
8794 build_real (type, r));
8795 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8796 TREE_TYPE (TREE_TYPE (fndecl)),
8797 result);*/
8799 }
8801 {
8802 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8803 islessequal(fabs(x),DBL_MAX). */
8813 {
8814 /* Use double to test the normal range of IBM extended
8815 precision. Emin for IBM extended precision is
8816 different to emin for IEEE double, being 53 higher
8817 since the low double exponent is at least 53 lower
8818 than the high double exponent. */
8822 }
8834 {
8835 /* Testing the high end of the range is done just using
8836 the high double, using the same test as isfinite().
8837 For the subnormal end of the range we first test the
8838 high double, then if its magnitude is equal to the
8839 limit of 0x1p-969, we test whether the low double is
8840 non-zero and opposite sign to the high double. */
8856 integer_type_node,
8862 }
8863 else
8864 {
8865 tree const isge_fn
8868 }
8872 }
8875 }
8878 }
8880 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8881 ARG is the argument for the call. */
8883 static tree
8885 {
8892 {
8901 {
8902 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8903 /* In a boolean context, GCC will fold the inner COND_EXPR to
8904 1. So e.g. "if (isinf_sign(x))" would be folded to just
8905 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8913 {
8926 integer_zero_node);
8927 }
8930 }
8945 {
8948 {
8949 /* NaN and Inf are encoded in the high-order double value
8950 only. The low-order value is not significant. */
8952 }
8953 }
8959 }
8960 }
8962 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8963 This builtin will generate code to return the appropriate floating
8964 point classification depending on the value of the floating point
8965 number passed in. The possible return values must be supplied as
8966 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8967 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8968 one floating point argument which is "type generic". */
8970 static tree
8972 {
8975 machine_mode mode;
8976 REAL_VALUE_TYPE r;
8979 /* Verify the required arguments in the original call. */
8999 /* fpclassify(x) ->
9000 isnan(x) ? FP_NAN :
9001 (fabs(x) == Inf ? FP_INFINITE :
9002 (fabs(x) >= DBL_MIN ? FP_NORMAL :
9003 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
9017 {
9023 }
9026 {
9029 }
9032 }
9034 /* Fold a call to an unordered comparison function such as
9035 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
9036 being called and ARG0 and ARG1 are the arguments for the call.
9037 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
9038 the opposite of the desired result. UNORDERED_CODE is used
9039 for modes that can hold NaNs and ORDERED_CODE is used for
9040 the rest. */
9042 static tree
9046 {
9060 /* Choose the wider of two real types. */
9072 {
9078 }
9084 }
9086 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
9087 arithmetics if it can never overflow, or into internal functions that
9088 return both result of arithmetics and overflowed boolean flag in
9089 a complex integer result, or some other check for overflow.
9090 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
9091 checking part of that. */
9093 static tree
9096 {
9098 /* The code of the expression corresponding to the built-in. */
9103 {
9106 /* FALLTHRU */
9119 /* FALLTHRU */
9132 /* FALLTHRU */
9145 }
9147 /* For the "generic" overloads, the first two arguments can have different
9148 types and the last argument determines the target type to use to check
9149 for overflow. The arguments of the other overloads all have the same
9150 type. */
9153 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
9154 arguments are constant, attempt to fold the built-in call into a constant
9155 expression indicating whether or not it detected an overflow. */
9159 /* Perform the computation in the target type and check for overflow. */
9163 arg2);
9167 {
9175 }
9176 else
9177 {
9185 }
9191 tree store
9194 }
9196 /* Fold a call to __builtin_FILE to a constant string. */
9200 {
9202 {
9203 /* The documentation says this builtin is equivalent to the preprocessor
9204 __FILE__ macro so it appears appropriate to use the same file prefix
9205 mappings. */
9208 }
9211 }
9213 /* Fold a call to __builtin_FUNCTION to a constant string. */
9217 {
9224 }
9226 /* Fold a call to __builtin_LINE to an integer constant. */
9230 {
9232 }
9234 /* Fold a call to built-in function FNDECL with 0 arguments.
9235 This function returns NULL_TREE if no simplification was possible. */
9237 static tree
9239 {
9243 {
9268 /* Rewrite any explicit calls to __builtin_unreachable. */
9275 }
9277 }
9279 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
9280 This function returns NULL_TREE if no simplification was possible. */
9282 static tree
9284 {
9295 {
9297 {
9300 /* Gimplification will pull the CALL_EXPR for the builtin out of
9301 an if condition. When not optimizing, we'll not CSE it back.
9302 To avoid link error types of regressions, return false now. */
9307 }
9363 {
9368 }
9374 {
9379 }
9400 }
9404 }
9406 /* Folds a call EXPR (which may be null) to built-in function FNDECL
9407 with 2 arguments, ARG0 and ARG1. This function returns NULL_TREE
9408 if no simplification was possible. */
9410 static tree
9412 {
9424 {
9468 NOP_EXPR);
9470 /* We do the folding for va_start in the expander. */
9486 }
9488 }
9490 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
9491 and ARG2.
9492 This function returns NULL_TREE if no simplification was possible. */
9494 static tree
9497 {
9511 {
9560 }
9562 }
9564 /* Folds a call EXPR (which may be null) to built-in function FNDECL.
9565 ARGS is an array of NARGS arguments. IGNORE is true if the result
9566 of the function call is ignored. This function returns NULL_TREE
9567 if no simplification was possible. */
9569 static tree
9572 {
9576 {
9592 }
9594 {
9598 }
9600 }
9602 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9603 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9604 of arguments in ARGS to be omitted. OLDNARGS is the number of
9605 elements in ARGS. */
9607 static tree
9610 {
9615 {
9623 }
9624 else
9628 }
9630 /* Return true if FNDECL shouldn't be folded right now.
9631 If a built-in function has an inline attribute always_inline
9632 wrapper, defer folding it after always_inline functions have
9633 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9634 might not be performed. */
9636 bool
9638 {
9641 && cfun
9644 }
9646 /* A wrapper function for builtin folding that prevents warnings for
9647 "statement without effect" and the like, caused by removing the
9648 call node earlier than the warning is generated. */
9650 tree
9652 {
9656 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9657 yet. Defer folding until we see all the arguments
9658 (after inlining). */
9660 {
9663 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9664 instead last argument is __builtin_va_arg_pack (). Defer folding
9665 even in that case, until arguments are finalized. */
9667 {
9671 }
9679 else
9680 {
9685 }
9686 }
9688 }
9690 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9691 N arguments are passed in the array ARGARRAY. Return a folded
9692 expression or NULL_TREE if no simplification was possible. */
9694 tree
9696 tree fn,
9699 {
9706 {
9707 /* If last argument is __builtin_va_arg_pack (), arguments to this
9708 function are not finalized yet. Defer folding until they are. */
9710 {
9714 }
9719 else
9721 }
9724 }
9726 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9727 along with N new arguments specified as the "..." parameters. SKIP
9728 is the number of arguments in EXP to be omitted. This function is used
9729 to do varargs-to-varargs transformations. */
9731 static tree
9733 {
9735 tree t;
9743 }
9745 /* Validate a single argument ARG against a tree code CODE representing
9746 a type. Return true when argument is valid. */
9748 static bool
9750 {
9758 }
9760 /* This function validates the types of a function call argument list
9761 against a specified list of tree_codes. If the last specifier is a 0,
9762 that represents an ellipses, otherwise the last specifier must be a
9763 VOID_TYPE.
9765 This is the GIMPLE version of validate_arglist. Eventually we want to
9766 completely convert builtins.cc to work from GIMPLEs and the tree based
9767 validate_arglist will then be removed. */
9769 bool
9771 {
9775 const_tree arg;
9781 do
9782 {
9785 {
9787 /* This signifies an ellipses, any further arguments are all ok. */
9791 /* This signifies an endlink, if no arguments remain, return
9792 true, otherwise return false. */
9796 /* If no parameters remain or the parameter's code does not
9797 match the specified code, return false. Otherwise continue
9798 checking any remaining arguments. */
9803 }
9804 }
9807 /* We need gotos here since we can only have one VA_CLOSE in a
9808 function. */
9809 end: ;
9813 }
9815 /* Default target-specific builtin expander that does nothing. */
9817 rtx
9819 rtx target ATTRIBUTE_UNUSED,
9820 rtx subtarget ATTRIBUTE_UNUSED,
9821 machine_mode mode ATTRIBUTE_UNUSED,
9823 {
9825 }
9827 /* Returns true is EXP represents data that would potentially reside
9828 in a readonly section. */
9830 bool
9832 {
9842 /* Make sure we call decl_readonly_section only for trees it
9843 can handle (since it returns true for everything it doesn't
9844 understand). */
9849 else
9851 }
9853 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9854 to the call, and TYPE is its return type.
9856 Return NULL_TREE if no simplification was possible, otherwise return the
9857 simplified form of the call as a tree.
9859 The simplified form may be a constant or other expression which
9860 computes the same value, but in a more efficient manner (including
9861 calls to other builtin functions).
9863 The call may contain arguments which need to be evaluated, but
9864 which are not useful to determine the result of the call. In
9865 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9866 COMPOUND_EXPR will be an argument which must be evaluated.
9867 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9868 COMPOUND_EXPR in the chain will contain the tree for the simplified
9869 form of the builtin function call. */
9871 static tree
9873 {
9878 tree fn;
9887 {
9889 tree tem;
9894 /* Return an offset into the constant string argument. */
9897 }
9900 /* strpbrk(x, "") == NULL.
9901 Evaluate and ignore s1 in case it had side-effects. */
9911 /* New argument list transforming strpbrk(s1, s2) to
9912 strchr(s1, s2[0]). */
9915 }
9917 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9918 to the call.
9920 Return NULL_TREE if no simplification was possible, otherwise return the
9921 simplified form of the call as a tree.
9923 The simplified form may be a constant or other expression which
9924 computes the same value, but in a more efficient manner (including
9925 calls to other builtin functions).
9927 The call may contain arguments which need to be evaluated, but
9928 which are not useful to determine the result of the call. In
9929 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9930 COMPOUND_EXPR will be an argument which must be evaluated.
9931 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9932 COMPOUND_EXPR in the chain will contain the tree for the simplified
9933 form of the builtin function call. */
9935 static tree
9937 {
9948 /* If either argument is "", return NULL_TREE. */
9950 /* Evaluate and ignore both arguments in case either one has
9951 side-effects. */
9955 }
9957 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9958 to the call.
9960 Return NULL_TREE if no simplification was possible, otherwise return the
9961 simplified form of the call as a tree.
9963 The simplified form may be a constant or other expression which
9964 computes the same value, but in a more efficient manner (including
9965 calls to other builtin functions).
9967 The call may contain arguments which need to be evaluated, but
9968 which are not useful to determine the result of the call. In
9969 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9970 COMPOUND_EXPR will be an argument which must be evaluated.
9971 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9972 COMPOUND_EXPR in the chain will contain the tree for the simplified
9973 form of the builtin function call. */
9975 static tree
9977 {
9986 /* If the first argument is "", return NULL_TREE. */
9989 {
9990 /* Evaluate and ignore argument s2 in case it has
9991 side-effects. */
9994 }
9996 /* If the second argument is "", return __builtin_strlen(s1). */
9999 {
10002 /* If the replacement _DECL isn't initialized, don't do the
10003 transformation. */
10008 }
10010 }
10012 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
10013 produced. False otherwise. This is done so that we don't output the error
10014 or warning twice or three times. */
10016 bool
10018 {
10021 tree arg;
10022 /* There is good chance the current input_location points inside the
10023 definition of the va_start macro (perhaps on the token for
10024 builtin) in a system header, so warnings will not be emitted.
10025 Use the location in real source code. */
10026 location_t current_location =
10028 NULL);
10031 {
10034 }
10037 {
10039 {
10042 }
10044 }
10045 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
10046 when we checked the arguments and if needed issued a warning. */
10047 else
10048 {
10050 {
10051 /* Evidently an out of date version of <stdarg.h>; can't validate
10052 va_start's second argument, but can still work as intended. */
10054 OPT_Wvarargs,
10057 }
10059 {
10062 }
10064 }
10070 /* We destructively modify the call to be __builtin_va_start (ap, 0)
10071 or __builtin_next_arg (0) the first time we see it, after checking
10072 the arguments and if needed issuing a warning. */
10074 {
10077 /* Strip off all nops for the sake of the comparison. This
10078 is not quite the same as STRIP_NOPS. It does more.
10079 We must also strip off INDIRECT_EXPR for C++ reference
10080 parameters. */
10085 {
10086 /* FIXME: Sometimes with the tree optimizers we can get the
10087 not the last argument even though the user used the last
10088 argument. We just warn and set the arg to be the last
10089 argument so that we will get wrong-code because of
10090 it. */
10092 OPT_Wvarargs,
10094 }
10096 /* Undefined by C99 7.15.1.4p4 (va_start):
10097 "If the parameter parmN is declared with the register storage
10098 class, with a function or array type, or with a type that is
10099 not compatible with the type that results after application of
10100 the default argument promotions, the behavior is undefined."
10101 */
10103 {
10105 OPT_Wvarargs,
10106 "undefined behavior when second parameter of "
10108 }
10110 /* We want to verify the second parameter just once before the tree
10111 optimizers are run and then avoid keeping it in the tree,
10112 as otherwise we could warn even for correct code like:
10113 void foo (int i, ...)
10114 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
10117 else
10119 }
10121 }
10124 /* Expand a call EXP to __builtin_object_size. */
10126 static rtx
10128 {
10129 tree ost;
10134 {
10136 fndecl);
10139 }
10147 {
10149 fndecl);
10152 }
10157 }
10159 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
10160 FCODE is the BUILT_IN_* to use.
10161 Return NULL_RTX if we failed; the caller should emit a normal call,
10162 otherwise try to get the result in TARGET, if convenient (and in
10163 mode MODE if that's convenient). */
10165 static rtx
10168 {
10170 POINTER_TYPE,
10171 fcode == BUILT_IN_MEMSET_CHK
10181 /* FIXME: Set access mode to write only for memset et al. */
10189 {
10190 /* Avoid transforming the checking call to an ordinary one when
10191 an overflow has been detected or when the call couldn't be
10192 validated because the size is not constant. */
10197 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
10198 mem{cpy,pcpy,move,set} is available. */
10200 {
10215 }
10224 }
10227 else
10228 {
10231 /* If DEST is not a pointer type, call the normal function. */
10235 /* If SRC and DEST are the same (and not volatile), do nothing. */
10237 {
10238 tree expr;
10241 {
10242 /* Evaluate and ignore LEN in case it has side-effects. */
10245 }
10249 }
10251 /* __memmove_chk special case. */
10253 {
10259 /* If src is categorized for a readonly section we can use
10260 normal __memcpy_chk. */
10262 {
10271 }
10272 }
10274 }
10275 }
10277 /* Emit warning if a buffer overflow is detected at compile time. */
10279 static void
10281 {
10282 /* The source string. */
10284 /* The size of the destination object returned by __builtin_object_size. */
10286 /* The string that is being concatenated with (as in __strcat_chk)
10287 or null if it isn't. */
10289 /* The maximum length of the source sequence in a bounded operation
10290 (such as __strncat_chk) or null if the operation isn't bounded
10291 (such as __strcat_chk). */
10293 /* The exact size of the access (such as in __strncpy_chk). */
10295 /* The access by the function that's checked. Except for snprintf
10296 both writing and reading is checked. */
10300 {
10308 /* For __strcat_chk the warning will be emitted only if overflowing
10309 by at least strlen (dest) + 1 bytes. */
10333 /* The only checked access the write to the destination. */
10338 }
10341 {
10342 /* Check __strncat_chk. There is no way to determine the length
10343 of the string to which the source string is being appended so
10344 just warn when the length of the source string is not known. */
10347 }
10350 }
10352 /* Emit warning if a buffer overflow is detected at compile time
10353 in __sprintf_chk/__vsprintf_chk calls. */
10355 static void
10357 {
10362 /* Verify the required arguments in the original call. */
10372 /* Check whether the format is a literal string constant. */
10380 /* If the format doesn't contain % args or %%, we know its size. */
10383 /* If the format is "%s" and first ... argument is a string literal,
10384 we know it too. */
10387 {
10388 tree arg;
10399 }
10400 else
10403 /* Add one for the terminating nul. */
10407 access_write_only);
10408 }
10410 /* Fold a call to __builtin_object_size with arguments PTR and OST,
10411 if possible. */
10413 static tree
10415 {
10416 tree bytes;
10432 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
10433 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
10434 and (size_t) 0 for types 2 and 3. */
10442 {
10447 }
10449 {
10450 /* If object size is not known yet, delay folding until
10451 later. Maybe subsequent passes will help determining
10452 it. */
10457 }
10460 }
10462 /* Builtins with folding operations that operate on "..." arguments
10463 need special handling; we need to store the arguments in a convenient
10464 data structure before attempting any folding. Fortunately there are
10465 only a few builtins that fall into this category. FNDECL is the
10466 function, EXP is the CALL_EXPR for the call. */
10468 static tree
10470 {
10475 {
10482 }
10484 {
10489 }
10491 }
10493 /* Initialize format string characters in the target charset. */
10495 bool
10497 {
10500 {
10523 }
10525 }
10527 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
10528 and no overflow/underflow occurred. INEXACT is true if M was not
10529 exactly calculated. TYPE is the tree type for the result. This
10530 function assumes that you cleared the MPFR flags and then
10531 calculated M to see if anything subsequently set a flag prior to
10532 entering this function. Return NULL_TREE if any checks fail. */
10534 static tree
10536 {
10537 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10538 overflow/underflow occurred. If -frounding-math, proceed iff the
10539 result of calling FUNC was exact. */
10542 {
10543 REAL_VALUE_TYPE rr;
10546 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10547 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10548 but the mpft_t is not, then we underflowed in the
10549 conversion. */
10552 {
10553 REAL_VALUE_TYPE rmode;
10556 /* Proceed iff the specified mode can hold the value. */
10559 }
10560 }
10562 }
10564 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10565 number and no overflow/underflow occurred. INEXACT is true if M
10566 was not exactly calculated. TYPE is the tree type for the result.
10567 This function assumes that you cleared the MPFR flags and then
10568 calculated M to see if anything subsequently set a flag prior to
10569 entering this function. Return NULL_TREE if any checks fail, if
10570 FORCE_CONVERT is true, then bypass the checks. */
10572 static tree
10574 {
10575 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10576 overflow/underflow occurred. If -frounding-math, proceed iff the
10577 result of calling FUNC was exact. */
10582 {
10587 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10588 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10589 but the mpft_t is not, then we underflowed in the
10590 conversion. */
10595 {
10600 /* Proceed iff the specified mode can hold the value. */
10606 }
10607 }
10609 }
10611 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10612 the pointer *(ARG_QUO) and return the result. The type is taken
10613 from the type of ARG0 and is used for setting the precision of the
10614 calculation and results. */
10616 static tree
10618 {
10625 /* To proceed, MPFR must exactly represent the target floating point
10626 format, which only happens when the target base equals two. */
10630 {
10635 {
10639 tree result_rem;
10648 /* Remquo is independent of the rounding mode, so pass
10649 inexact=0 to do_mpfr_ckconv(). */
10653 {
10654 /* MPFR calculates quo in the host's long so it may
10655 return more bits in quo than the target int can hold
10656 if sizeof(host long) > sizeof(target int). This can
10657 happen even for native compilers in LP64 mode. In
10658 these cases, modulo the quo value with the largest
10659 number that the target int can hold while leaving one
10660 bit for the sign. */
10664 /* Dereference the quo pointer argument. */
10666 /* Proceed iff a valid pointer type was passed in. */
10668 {
10669 /* Set the value. */
10670 tree result_quo
10673 integer_quo));
10675 /* Combine the quo assignment with the rem. */
10678 }
10679 }
10680 }
10681 }
10683 }
10685 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10686 resulting value as a tree with type TYPE. The mpfr precision is
10687 set to the precision of TYPE. We assume that this mpfr function
10688 returns zero if the result could be calculated exactly within the
10689 requested precision. In addition, the integer pointer represented
10690 by ARG_SG will be dereferenced and set to the appropriate signgam
10691 (-1,1) value. */
10693 static tree
10695 {
10700 /* To proceed, MPFR must exactly represent the target floating point
10701 format, which only happens when the target base equals two. Also
10702 verify ARG is a constant and that ARG_SG is an int pointer. */
10707 {
10710 /* In addition to NaN and Inf, the argument cannot be zero or a
10711 negative integer. */
10715 {
10720 mpfr_t m;
10721 tree result_lg;
10730 {
10731 tree result_sg;
10733 /* Dereference the arg_sg pointer argument. */
10735 /* Assign the signgam value into *arg_sg. */
10740 /* Combine the signgam assignment with the lgamma result. */
10743 }
10744 }
10745 }
10748 }
10750 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10751 mpc function FUNC on it and return the resulting value as a tree
10752 with type TYPE. The mpfr precision is set to the precision of
10753 TYPE. We assume that function FUNC returns zero if the result
10754 could be calculated exactly within the requested precision. If
10755 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10756 in the arguments and/or results. */
10758 tree
10761 {
10767 /* To proceed, MPFR must exactly represent the target floating point
10768 format, which only happens when the target base equals two. */
10774 {
10783 {
10804 }
10805 }
10808 }
10810 /* A wrapper function for builtin folding that prevents warnings for
10811 "statement without effect" and the like, caused by removing the
10812 call node earlier than the warning is generated. */
10814 tree
10816 {
10822 {
10831 {
10833 }
10834 else
10835 {
10838 {
10839 /* Propagate location information from original call to
10840 expansion of builtin. Otherwise things like
10841 maybe_emit_chk_warning, that operate on the expansion
10842 of a builtin, will use the wrong location information. */
10844 {
10852 }
10854 }
10855 }
10856 }
10858 }
10860 /* Look up the function in builtin_decl that corresponds to DECL
10861 and set ASMSPEC as its user assembler name. DECL must be a
10862 function decl that declares a builtin. */
10864 void
10866 {
10875 {
10879 }
10880 }
10882 /* Return true if DECL is a builtin that expands to a constant or similarly
10883 simple code. */
10884 bool
10886 {
10889 {
10890 /* Builtins that expand to constants. */
10895 /* Simple register moves or loads from stack. */
10907 /* Exception state returns or moves registers around. */
10915 }
10918 }
10920 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10921 most probably expanded inline into reasonably simple code. This is a
10922 superset of is_simple_builtin. */
10923 bool
10925 {
10932 {
10934 CASE_BUILT_IN_ALLOCA:
11001 }
11004 }
11006 /* Return true if T is a constant and the value cast to a target char
11007 can be represented by a host char.
11008 Store the casted char constant in *P if so. */
11010 bool
11012 {
11018 }
11020 /* Return true if the builtin DECL is implemented in a standard library.
11021 Otherwise return false which doesn't guarantee it is not (thus the list
11022 of handled builtins below may be incomplete). */
11024 bool
11026 {
11029 {
11104 /* stpcpy is both referenced in libiberty's pex-win32.c and provided
11105 by libiberty's stpcpy.c for MinGW targets so we need to return true
11106 in order to be able to build libiberty in LTO mode for them. */
11111 }
11113 }
11115 /* Return true if OFFRNG is bounded to a subrange of offset values
11116 valid for the largest possible object. */
11118 bool
11120 {
11124 }
11126 /* If CALLEE has known side effects, fill in INFO and return true.
11127 See tree-ssa-structalias.cc:find_func_aliases
11128 for the list of builtins we might need to handle here. */
11130 attr_fnspec
11132 {
11136 {
11137 /* All the following functions read memory pointed to by
11138 their second argument and write memory pointed to by first
11139 argument.
11140 strcat/strncat additionally reads memory pointed to by the first
11141 argument. */
11181 /* The following functions read memory pointed to by their
11182 first argument. */
11215 /* These read memory pointed to by the first argument.
11216 Allocating memory does not have any side-effects apart from
11217 being the definition point for the pointer.
11218 Unix98 specifies that errno is set on allocation failure. */
11223 /* Allocating memory does not have any side-effects apart from
11224 being the definition point for the pointer. */
11230 CASE_BUILT_IN_ALLOCA:
11232 /* These read memory pointed to by the first argument with size
11233 in the third argument. */
11236 /* These read memory pointed to by the first and second arguments. */
11245 /* Freeing memory kills the pointed-to memory. More importantly
11246 the call has to serve as a barrier for moving loads and stores
11247 across it. */
11254 /* Realloc serves both as allocation point and deallocation point. */
11311 /* But posix_memalign stores a pointer into the memory pointed to
11312 by its first argument. */
11318 }
11319 }