| blob | 9f2e447a2fd04842074a6690a0149f1c6e1740e3 |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2017 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* Legacy warning! Please add no further builtin simplifications here
21 (apart from pure constant folding) - builtin simplifications should go
22 to match.pd or gimple-fold.c instead. */
73 #if SWITCHABLE_TARGET
75 #endif
77 /* Define the names of the builtin function types and codes. */
81 #define DEF_BUILTIN(X, N, C, T, LT, B, F, NA, AT, IM, COND) #X,
83 {
85 };
87 /* Setup an array of builtin_info_type, make sure each element decl is
88 initialized to NULL_TREE. */
91 /* Non-zero if __builtin_constant_p should be folded right away. */
192 /* Return true if NAME starts with __builtin_ or __sync_. */
194 static bool
196 {
208 }
211 /* Return true if DECL is a function symbol representing a built-in. */
213 bool
215 {
217 }
219 /* Return true if NODE should be considered for inline expansion regardless
220 of the optimization level. This means whenever a function is invoked with
221 its "internal" name, which normally contains the prefix "__builtin". */
223 bool
225 {
226 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
227 we want the name used to call the function, not the name it
228 will have. */
231 }
233 /* Compute values M and N such that M divides (address of EXP - N) and such
234 that N < M. If these numbers can be determined, store M in alignp and N in
235 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
236 *alignp and any bit-offset to *bitposp.
238 Note that the address (and thus the alignment) computed here is based
239 on the address to which a symbol resolves, whereas DECL_ALIGN is based
240 on the address at which an object is actually located. These two
241 addresses are not always the same. For example, on ARM targets,
242 the address &foo of a Thumb function foo() has the lowest bit set,
243 whereas foo() itself starts on an even address.
245 If ADDR_P is true we are taking the address of the memory reference EXP
246 and thus cannot rely on the access taking place. */
248 static bool
251 {
253 tree offset;
254 machine_mode mode;
259 /* Get the innermost object and the constant (bitpos) and possibly
260 variable (offset) offset of the access. */
264 /* Extract alignment information from the innermost object and
265 possibly adjust bitpos and offset. */
267 {
268 /* Function addresses can encode extra information besides their
269 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
270 allows the low bit to be used as a virtual bit, we know
271 that the address itself must be at least 2-byte aligned. */
274 }
276 ;
278 {
279 /* The alignment of a CONST_DECL is determined by its initializer. */
286 }
288 {
291 }
295 {
301 /* If the address is explicitely aligned, handle that. */
304 {
309 }
311 known_alignment
315 /* Re-apply explicit alignment to the bitpos. */
318 /* The alignment of the pointer operand in a TARGET_MEM_REF
319 has to take the variable offset parts into account. */
321 {
323 {
328 }
332 }
334 /* When EXP is an actual memory reference then we can use
335 TYPE_ALIGN of a pointer indirection to derive alignment.
336 Do so only if get_pointer_alignment_1 did not reveal absolute
337 alignment knowledge and if using that alignment would
338 improve the situation. */
344 else
345 {
346 /* Else adjust bitpos accordingly. */
351 }
352 }
354 {
355 /* STRING_CST are the only constant objects we allow to be not
356 wrapped inside a CONST_DECL. */
362 }
364 /* If there is a non-constant offset part extract the maximum
365 alignment that can prevail. */
367 {
370 {
374 }
375 }
380 }
382 /* For a memory reference expression EXP compute values M and N such that M
383 divides (&EXP - N) and such that N < M. If these numbers can be determined,
384 store M in alignp and N in *BITPOSP and return true. Otherwise return false
385 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
387 bool
390 {
392 }
394 /* Return the alignment in bits of EXP, an object. */
396 unsigned int
398 {
404 /* align and bitpos now specify known low bits of the pointer.
405 ptr & (align - 1) == bitpos. */
410 }
412 /* For a pointer valued expression EXP compute values M and N such that M
413 divides (EXP - N) and such that N < M. If these numbers can be determined,
414 store M in alignp and N in *BITPOSP and return true. Return false if
415 the results are just a conservative approximation.
417 If EXP is not a pointer, false is returned too. */
419 bool
422 {
429 {
436 else
437 {
440 {
444 }
445 }
449 }
452 {
457 {
460 /* Make sure to return a sensible alignment when the multiplication
461 by BITS_PER_UNIT overflowed. */
464 /* We cannot really tell whether this result is an approximation. */
466 }
467 else
468 {
472 }
473 }
475 {
480 }
485 }
487 /* Return the alignment in bits of EXP, a pointer valued expression.
488 The alignment returned is, by default, the alignment of the thing that
489 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
491 Otherwise, look at the expression to see if we can do better, i.e., if the
492 expression is actually pointing at an object whose alignment is tighter. */
494 unsigned int
496 {
502 /* align and bitpos now specify known low bits of the pointer.
503 ptr & (align - 1) == bitpos. */
509 }
511 /* Return the number of non-zero elements in the sequence
512 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
513 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
515 static unsigned
517 {
523 {
524 /* Optimize the common case of plain char. */
526 {
530 }
531 }
532 else
533 {
535 {
539 }
540 }
542 }
544 /* Compute the length of a null-terminated character string or wide
545 character string handling character sizes of 1, 2, and 4 bytes.
546 TREE_STRING_LENGTH is not the right way because it evaluates to
547 the size of the character array in bytes (as opposed to characters)
548 and because it can contain a zero byte in the middle.
550 ONLY_VALUE should be nonzero if the result is not going to be emitted
551 into the instruction stream and zero if it is going to be expanded.
552 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
553 is returned, otherwise NULL, since
554 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
555 evaluate the side-effects.
557 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
558 accesses. Note that this implies the result is not going to be emitted
559 into the instruction stream.
561 The value returned is of type `ssizetype'.
563 Unfortunately, string_constant can't access the values of const char
564 arrays with initializers, so neither can we do so here. */
566 tree
568 {
572 {
579 }
587 /* Offset from the beginning of the string in bytes. */
588 tree byteoff;
593 /* Determine the size of the string element. */
594 unsigned eltsize
597 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
598 length of SRC. */
601 /* PTR can point to the byte representation of any string type, including
602 char* and wchar_t*. */
606 {
607 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
608 compute the offset to the following null if we don't know where to
609 start searching for it. */
611 {
612 /* Return when an embedded null character is found. */
614 }
616 /* We don't know the starting offset, but we do know that the string
617 has no internal zero bytes. We can assume that the offset falls
618 within the bounds of the string; otherwise, the programmer deserves
619 what he gets. Subtract the offset from the length of the string,
620 and return that. This would perhaps not be valid if we were dealing
621 with named arrays in addition to literal string constants. */
624 }
626 /* Offset from the beginning of the string in elements. */
627 HOST_WIDE_INT eltoff;
629 /* We have a known offset into the string. Start searching there for
630 a null character if we can represent it as a single HOST_WIDE_INT. */
635 else
638 /* If the offset is known to be out of bounds, warn, and call strlen at
639 runtime. */
641 {
642 /* Suppress multiple warnings for propagated constant strings. */
645 {
647 eltoff);
649 }
651 }
653 /* Use strlen to search for the first zero byte. Since any strings
654 constructed with build_string will have nulls appended, we win even
655 if we get handed something like (char[4])"abcd".
657 Since ELTOFF is our starting index into the string, no further
658 calculation is needed. */
663 }
665 /* Return a constant integer corresponding to target reading
666 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
668 static rtx
670 {
671 HOST_WIDE_INT ch;
685 {
697 }
701 }
703 /* Cast a target constant CST to target CHAR and if that value fits into
704 host char type, return zero and put that value into variable pointed to by
705 P. */
707 static int
709 {
716 /* Do not care if it fits or not right here. */
731 }
733 /* Similar to save_expr, but assumes that arbitrary code is not executed
734 in between the multiple evaluations. In particular, we assume that a
735 non-addressable local variable will not be modified. */
737 static tree
739 {
747 }
749 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
750 times to get the address of either a higher stack frame, or a return
751 address located within it (depending on FNDECL_CODE). */
753 static rtx
755 {
759 {
760 /* For a zero count with __builtin_return_address, we don't care what
761 frame address we return, because target-specific definitions will
762 override us. Therefore frame pointer elimination is OK, and using
763 the soft frame pointer is OK.
765 For a nonzero count, or a zero count with __builtin_frame_address,
766 we require a stable offset from the current frame pointer to the
767 previous one, so we must use the hard frame pointer, and
768 we must disable frame pointer elimination. */
771 else
772 {
775 /* Tell reload not to eliminate the frame pointer. */
777 }
778 }
783 /* On the SPARC, the return address is not in the frame, it is in a
784 register. There is no way to access it off of the current frame
785 pointer, but it can be accessed off the previous frame pointer by
786 reading the value from the register window save area. */
788 count--;
790 /* Scan back COUNT frames to the specified frame. */
792 {
793 /* Assume the dynamic chain pointer is in the word that the
794 frame address points to, unless otherwise specified. */
799 }
801 /* For __builtin_frame_address, return what we've got. But, on
802 the SPARC for example, we may have to add a bias. */
806 /* For __builtin_return_address, get the return address from that frame. */
807 #ifdef RETURN_ADDR_RTX
809 #else
813 #endif
815 }
817 /* Alias set used for setjmp buffer. */
820 /* Construct the leading half of a __builtin_setjmp call. Control will
821 return to RECEIVER_LABEL. This is also called directly by the SJLJ
822 exception handling code. */
824 void
826 {
828 rtx stack_save;
829 rtx mem;
838 /* We store the frame pointer and the address of receiver_label in
839 the buffer and use the rest of it for the stack save area, which
840 is machine-dependent. */
859 /* If there is further processing to do, do it. */
863 /* We have a nonlocal label. */
865 }
867 /* Construct the trailing part of a __builtin_setjmp call. This is
868 also called directly by the SJLJ exception handling code.
869 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
871 void
873 {
874 rtx chain;
876 /* Mark the FP as used when we get here, so we have to make sure it's
877 marked as used by this function. */
880 /* Mark the static chain as clobbered here so life information
881 doesn't get messed up for it. */
886 /* Now put in the code to restore the frame pointer, and argument
887 pointer, if needed. */
889 {
890 /* First adjust our frame pointer to its actual value. It was
891 previously set to the start of the virtual area corresponding to
892 the stacked variables when we branched here and now needs to be
893 adjusted to the actual hardware fp value.
895 Assignments to virtual registers are converted by
896 instantiate_virtual_regs into the corresponding assignment
897 to the underlying register (fp in this case) that makes
898 the original assignment true.
899 So the following insn will actually be decrementing fp by
900 STARTING_FRAME_OFFSET. */
903 /* Restoring the frame pointer also modifies the hard frame pointer.
904 Mark it used (so that the previous assignment remains live once
905 the frame pointer is eliminated) and clobbered (to represent the
906 implicit update from the assignment). */
909 }
912 {
913 /* If the argument pointer can be eliminated in favor of the
914 frame pointer, we don't need to restore it. We assume here
915 that if such an elimination is present, it can always be used.
916 This is the case on all known machines; if we don't make this
917 assumption, we do unnecessary saving on many machines. */
927 {
928 /* Now restore our arg pointer from the address at which it
929 was saved in our stack frame. */
932 }
933 }
939 else
942 /* We must not allow the code we just generated to be reordered by
943 scheduling. Specifically, the update of the frame pointer must
944 happen immediately, not later. */
946 }
948 /* __builtin_longjmp is passed a pointer to an array of five words (not
949 all will be used on all machines). It operates similarly to the C
950 library function of the same name, but is more efficient. Much of
951 the code below is copied from the handling of non-local gotos. */
953 static void
955 {
960 /* DRAP is needed for stack realign if longjmp is expanded to current
961 function */
972 /* We require that the user must pass a second argument of 1, because
973 that is what builtin_setjmp will return. */
979 else
980 {
991 /* Pick up FP, label, and SP from the block and jump. This code is
992 from expand_goto in stmt.c; see there for detailed comments. */
994 /* We have to pass a value to the nonlocal_goto pattern that will
995 get copied into the static_chain pointer, but it does not matter
996 what that value is, because builtin_setjmp does not use it. */
998 else
999 {
1011 }
1012 }
1014 /* Search backwards and mark the jump insn as a non-local goto.
1015 Note that this precludes the use of __builtin_longjmp to a
1016 __builtin_setjmp target in the same function. However, we've
1017 already cautioned the user that these functions are for
1018 internal exception handling use only. */
1020 {
1024 {
1027 }
1030 }
1031 }
1035 {
1037 }
1039 /* This function validates the types of a function call argument list
1040 against a specified list of tree_codes. If the last specifier is a 0,
1041 that represents an ellipsis, otherwise the last specifier must be a
1042 VOID_TYPE. */
1044 static bool
1046 {
1050 const_call_expr_arg_iterator iter;
1051 const_tree arg;
1056 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1061 {
1065 {
1067 /* This signifies an ellipses, any further arguments are all ok. */
1071 /* This signifies an endlink, if no arguments remain, return
1072 true, otherwise return false. */
1076 /* The actual argument must be nonnull when either the whole
1077 called function has been declared nonnull, or when the formal
1078 argument corresponding to the actual argument has been. */
1081 {
1086 }
1087 /* FALLTHRU */
1089 /* If no parameters remain or the parameter's code does not
1090 match the specified code, return false. Otherwise continue
1091 checking any remaining arguments. */
1096 }
1097 }
1099 /* We need gotos here since we can only have one VA_CLOSE in a
1100 function. */
1101 end: ;
1107 }
1109 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1110 and the address of the save area. */
1112 static rtx
1114 {
1129 /* Copy the address of the save location to a register just in case it was
1130 based on the frame pointer. */
1139 /* ??? We no longer need to pass the static chain value, afaik. */
1142 else
1143 {
1149 /* Restore frame pointer for containing function. */
1153 /* USE of hard_frame_pointer_rtx added for consistency;
1154 not clear if really needed. */
1158 /* If the architecture is using a GP register, we must
1159 conservatively assume that the target function makes use of it.
1160 The prologue of functions with nonlocal gotos must therefore
1161 initialize the GP register to the appropriate value, and we
1162 must then make sure that this value is live at the point
1163 of the jump. (Note that this doesn't necessarily apply
1164 to targets with a nonlocal_goto pattern; they are free
1165 to implement it in their own way. Note also that this is
1166 a no-op if the GP register is a global invariant.) */
1172 }
1174 /* Search backwards to the jump insn and mark it as a
1175 non-local goto. */
1177 {
1179 {
1182 }
1185 }
1188 }
1190 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1191 (not all will be used on all machines) that was passed to __builtin_setjmp.
1192 It updates the stack pointer in that block to the current value. This is
1193 also called directly by the SJLJ exception handling code. */
1195 void
1197 {
1199 rtx stack_save
1201 memory_address
1207 }
1209 /* Expand a call to __builtin_prefetch. For a target that does not support
1210 data prefetch, evaluate the memory address argument in case it has side
1211 effects. */
1213 static void
1215 {
1225 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1226 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1227 locality). */
1231 else
1235 else
1238 /* Argument 0 is an address. */
1241 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1243 {
1246 }
1248 /* Argument 1 must be either zero or one. */
1250 {
1254 }
1256 /* Argument 2 (locality) must be a compile-time constant int. */
1258 {
1261 }
1263 /* Argument 2 must be 0, 1, 2, or 3. */
1265 {
1268 }
1271 {
1279 }
1281 /* Don't do anything with direct references to volatile memory, but
1282 generate code to handle other side effects. */
1285 }
1287 /* Get a MEM rtx for expression EXP which is the address of an operand
1288 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1289 the maximum length of the block of memory that might be accessed or
1290 NULL if unknown. */
1292 static rtx
1294 {
1298 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1299 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1306 /* Get an expression we can use to find the attributes to assign to MEM.
1307 First remove any nops. */
1312 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1313 (as builtin stringops may alias with anything). */
1320 /* If the MEM_REF has no acceptable address, try to get the base object
1321 from the original address we got, and build an all-aliasing
1322 unknown-sized access to that one. */
1328 {
1333 size_zero_node,
1334 NULL)),
1337 }
1340 }
1341 \f
1342 /* Built-in functions to perform an untyped call and return. */
1344 #define apply_args_mode \
1345 (this_target_builtins->x_apply_args_mode)
1346 #define apply_result_mode \
1347 (this_target_builtins->x_apply_result_mode)
1349 /* Return the size required for the block returned by __builtin_apply_args,
1350 and initialize apply_args_mode. */
1352 static int
1354 {
1358 machine_mode mode;
1360 /* The values computed by this function never change. */
1362 {
1363 /* The first value is the incoming arg-pointer. */
1366 /* The second value is the structure value address unless this is
1367 passed as an "invisible" first argument. */
1373 {
1383 }
1384 else
1385 {
1387 }
1388 }
1390 }
1392 /* Return the size required for the block returned by __builtin_apply,
1393 and initialize apply_result_mode. */
1395 static int
1397 {
1400 machine_mode mode;
1402 /* The values computed by this function never change. */
1404 {
1409 {
1419 }
1420 else
1423 /* Allow targets that use untyped_call and untyped_return to override
1424 the size so that machine-specific information can be stored here. */
1425 #ifdef APPLY_RESULT_SIZE
1427 #endif
1428 }
1430 }
1432 /* Create a vector describing the result block RESULT. If SAVEP is true,
1433 the result block is used to save the values; otherwise it is used to
1434 restore the values. */
1436 static rtx
1438 {
1440 machine_mode mode;
1447 {
1457 }
1459 }
1461 /* Save the state required to perform an untyped call with the same
1462 arguments as were passed to the current function. */
1464 static rtx
1466 {
1469 machine_mode mode;
1470 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1472 /* Create a block where the arg-pointer, structure value address,
1473 and argument registers can be saved. */
1476 /* Walk past the arg-pointer and structure value address. */
1481 /* Save each register used in calling a function to the block. */
1484 {
1493 }
1495 /* Save the arg pointer to the block. */
1497 /* We need the pointer as the caller actually passed them to us, not
1498 as we might have pretended they were passed. Make sure it's a valid
1499 operand, as emit_move_insn isn't expected to handle a PLUS. */
1501 tem
1504 NULL_RTX);
1509 /* Save the structure value address unless this is passed as an
1510 "invisible" first argument. */
1512 {
1516 }
1518 /* Return the address of the block. */
1520 }
1522 /* __builtin_apply_args returns block of memory allocated on
1523 the stack into which is stored the arg pointer, structure
1524 value address, static chain, and all the registers that might
1525 possibly be used in performing a function call. The code is
1526 moved to the start of the function so the incoming values are
1527 saved. */
1529 static rtx
1531 {
1532 /* Don't do __builtin_apply_args more than once in a function.
1533 Save the result of the first call and reuse it. */
1536 {
1537 /* When this function is called, it means that registers must be
1538 saved on entry to this function. So we migrate the
1539 call to the first insn of this function. */
1540 rtx temp;
1549 /* Put the insns after the NOTE that starts the function.
1550 If this is inside a start_sequence, make the outer-level insn
1551 chain current, so the code is placed at the start of the
1552 function. If internal_arg_pointer is a non-virtual pseudo,
1553 it needs to be placed after the function that initializes
1554 that pseudo. */
1559 else
1563 }
1564 }
1566 /* Perform an untyped call and save the state required to perform an
1567 untyped return of whatever value was returned by the given function. */
1569 static rtx
1571 {
1573 machine_mode mode;
1582 /* Create a block where the return registers can be saved. */
1585 /* Fetch the arg pointer from the ARGUMENTS block. */
1592 /* Push a new argument block and copy the arguments. Do not allow
1593 the (potential) memcpy call below to interfere with our stack
1594 manipulations. */
1596 NO_DEFER_POP;
1598 /* Save the stack with nonlocal if available. */
1601 else
1604 /* Allocate a block of memory onto the stack and copy the memory
1605 arguments to the outgoing arguments address. We can pass TRUE
1606 as the 4th argument because we just saved the stack pointer
1607 and will restore it right after the call. */
1610 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1611 may have already set current_function_calls_alloca to true.
1612 current_function_calls_alloca won't be set if argsize is zero,
1613 so we have to guarantee need_drap is true here. */
1619 {
1622 else
1624 }
1631 /* Refer to the argument block. */
1636 /* Walk past the arg-pointer and structure value address. */
1641 /* Restore each of the registers previously saved. Make USE insns
1642 for each of these registers for use in making the call. */
1645 {
1653 }
1655 /* Restore the structure value address unless this is passed as an
1656 "invisible" first argument. */
1659 {
1666 }
1668 /* All arguments and registers used for the call are set up by now! */
1671 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1672 and we don't want to load it into a register as an optimization,
1673 because prepare_call_address already did it if it should be done. */
1677 /* Generate the actual call instruction and save the return value. */
1679 {
1683 }
1685 {
1688 /* Locate the unique return register. It is not possible to
1689 express a call that sets more than one return register using
1690 call_value; use untyped_call for that. In fact, untyped_call
1691 only needs to save the return registers in the given block. */
1694 {
1698 }
1705 }
1706 else
1709 /* Find the CALL insn we just emitted, and attach the register usage
1710 information. */
1714 /* Restore the stack. */
1717 else
1721 OK_DEFER_POP;
1723 /* Return the address of the result block. */
1726 }
1728 /* Perform an untyped return. */
1730 static void
1732 {
1734 machine_mode mode;
1735 rtx reg;
1744 {
1749 }
1751 /* Restore the return value and note that each value is used. */
1755 {
1767 }
1769 /* Put the USE insns before the return. */
1772 /* Return whatever values was restored by jumping directly to the end
1773 of the function. */
1775 }
1777 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1779 static enum type_class
1781 {
1783 {
1802 }
1803 }
1805 /* Expand a call EXP to __builtin_classify_type. */
1807 static rtx
1809 {
1813 }
1815 /* This helper macro, meant to be used in mathfn_built_in below,
1816 determines which among a set of three builtin math functions is
1817 appropriate for a given type mode. The `F' and `L' cases are
1818 automatically generated from the `double' case. */
1819 #define CASE_MATHFN(MATHFN) \
1820 CASE_CFN_##MATHFN: \
1821 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1822 fcodel = BUILT_IN_##MATHFN##L ; break;
1823 /* Similar to above, but appends _R after any F/L suffix. */
1824 #define CASE_MATHFN_REENT(MATHFN) \
1825 case CFN_BUILT_IN_##MATHFN##_R: \
1826 case CFN_BUILT_IN_##MATHFN##F_R: \
1827 case CFN_BUILT_IN_##MATHFN##L_R: \
1828 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1829 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1831 /* Return a function equivalent to FN but operating on floating-point
1832 values of type TYPE, or END_BUILTINS if no such function exists.
1833 This is purely an operation on function codes; it does not guarantee
1834 that the target actually has an implementation of the function. */
1836 static built_in_function
1838 {
1842 {
1933 }
1941 else
1943 }
1945 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1946 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1947 otherwise use the explicit declaration. If we can't do the conversion,
1948 return null. */
1950 static tree
1952 {
1961 }
1963 /* Like mathfn_built_in_1, but always use the implicit array. */
1965 tree
1967 {
1969 }
1971 /* Like mathfn_built_in_1, but take a built_in_function and
1972 always use the implicit array. */
1974 tree
1976 {
1978 }
1980 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
1981 return its code, otherwise return IFN_LAST. Note that this function
1982 only tests whether the function is defined in internals.def, not whether
1983 it is actually available on the target. */
1985 internal_fn
1987 {
1991 {
1992 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
1993 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
1994 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
1995 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2012 }
2013 }
2015 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2016 on the current target by a call to an internal function, return the
2017 code of that internal function, otherwise return IFN_LAST. The caller
2018 is responsible for ensuring that any side-effects of the built-in
2019 call are dealt with correctly. E.g. if CALL sets errno, the caller
2020 must decide that the errno result isn't needed or make it available
2021 in some other way. */
2023 internal_fn
2025 {
2027 {
2030 {
2035 }
2036 }
2038 }
2040 /* Expand a call to the builtin trinary math functions (fma).
2041 Return NULL_RTX if a normal call should be emitted rather than expanding the
2042 function in-line. EXP is the expression that is a call to the builtin
2043 function; if convenient, the result should be placed in TARGET.
2044 SUBTARGET may be used as the target for computing one of EXP's
2045 operands. */
2047 static rtx
2049 {
2050 optab builtin_optab;
2055 machine_mode mode;
2065 {
2070 }
2072 /* Make a suitable register to place result in. */
2075 /* Before working hard, check whether the instruction is available. */
2081 /* Always stabilize the argument list. */
2092 /* Compute into RESULT.
2093 Set RESULT to wherever the result comes back. */
2097 /* If we were unable to expand via the builtin, stop the sequence
2098 (without outputting the insns) and call to the library function
2099 with the stabilized argument list. */
2101 {
2104 }
2106 /* Output the entire sequence. */
2112 }
2114 /* Expand a call to the builtin sin and cos math functions.
2115 Return NULL_RTX if a normal call should be emitted rather than expanding the
2116 function in-line. EXP is the expression that is a call to the builtin
2117 function; if convenient, the result should be placed in TARGET.
2118 SUBTARGET may be used as the target for computing one of EXP's
2119 operands. */
2121 static rtx
2123 {
2124 optab builtin_optab;
2125 rtx op0;
2128 machine_mode mode;
2129 tree arg;
2137 {
2143 }
2145 /* Make a suitable register to place result in. */
2148 /* Check if sincos insn is available, otherwise fallback
2149 to sin or cos insn. */
2152 {
2159 }
2161 /* Before working hard, check whether the instruction is available. */
2163 {
2166 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2167 need to expand the argument again. This way, we will not perform
2168 side-effects more the once. */
2175 /* Compute into RESULT.
2176 Set RESULT to wherever the result comes back. */
2178 {
2182 {
2191 }
2193 }
2194 else
2198 {
2199 /* Output the entire sequence. */
2204 }
2206 /* If we were unable to expand via the builtin, stop the sequence
2207 (without outputting the insns) and call to the library function
2208 with the stabilized argument list. */
2210 }
2213 }
2215 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2216 return an RTL instruction code that implements the functionality.
2217 If that isn't possible or available return CODE_FOR_nothing. */
2219 static enum insn_code
2221 {
2224 machine_mode mode;
2227 {
2241 /* These builtins have no optabs (yet). */
2245 }
2247 /* There's no easy way to detect the case we need to set EDOM. */
2251 /* Optab mode depends on the mode of the input argument. */
2257 }
2259 /* Expand a call to one of the builtin math functions that operate on
2260 floating point argument and output an integer result (ilogb, isinf,
2261 isnan, etc).
2262 Return 0 if a normal call should be emitted rather than expanding the
2263 function in-line. EXP is the expression that is a call to the builtin
2264 function; if convenient, the result should be placed in TARGET. */
2266 static rtx
2268 {
2270 rtx op0;
2272 machine_mode mode;
2273 tree arg;
2283 {
2288 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2289 need to expand the argument again. This way, we will not perform
2290 side-effects more the once. */
2305 }
2308 }
2310 /* Expand a call to the builtin sincos math function.
2311 Return NULL_RTX if a normal call should be emitted rather than expanding the
2312 function in-line. EXP is the expression that is a call to the builtin
2313 function. */
2315 static rtx
2317 {
2319 machine_mode mode;
2333 /* Make a suitable register to place result in. */
2336 /* Check if sincos insn is available, otherwise emit the call. */
2351 /* Compute into target1 and target2.
2352 Set TARGET to wherever the result comes back. */
2356 /* Move target1 and target2 to the memory locations indicated
2357 by op1 and op2. */
2362 }
2364 /* Expand a call to the internal cexpi builtin to the sincos math function.
2365 EXP is the expression that is a call to the builtin function; if convenient,
2366 the result should be placed in TARGET. */
2368 static rtx
2370 {
2373 machine_mode mode;
2384 /* Try expanding via a sincos optab, fall back to emitting a libcall
2385 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2386 is only generated from sincos, cexp or if we have either of them. */
2388 {
2394 /* Compute into op1 and op2. */
2396 }
2398 {
2409 else
2419 /* Make sure not to fold the sincos call again. */
2423 }
2424 else
2425 {
2435 else
2438 /* If we don't have a decl for cexp create one. This is the
2439 friendliest fallback if the user calls __builtin_cexpi
2440 without full target C99 function support. */
2442 {
2443 tree fntype;
2455 }
2460 /* Make sure not to fold the cexp call again. */
2464 }
2466 /* Now build the proper return type. */
2471 }
2473 /* Conveniently construct a function call expression. FNDECL names the
2474 function to be called, N is the number of arguments, and the "..."
2475 parameters are the argument expressions. Unlike build_call_exr
2476 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2478 static tree
2480 {
2490 }
2492 /* Expand a call to one of the builtin rounding functions gcc defines
2493 as an extension (lfloor and lceil). As these are gcc extensions we
2494 do not need to worry about setting errno to EDOM.
2495 If expanding via optab fails, lower expression to (int)(floor(x)).
2496 EXP is the expression that is a call to the builtin function;
2497 if convenient, the result should be placed in TARGET. */
2499 static rtx
2501 {
2502 convert_optab builtin_optab;
2507 tree fallback_fndecl;
2508 machine_mode mode;
2509 tree arg;
2517 {
2534 }
2536 /* Make a suitable register to place result in. */
2541 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2542 need to expand the argument again. This way, we will not perform
2543 side-effects more the once. */
2550 /* Compute into TARGET. */
2552 {
2553 /* Output the entire sequence. */
2558 }
2560 /* If we were unable to expand via the builtin, stop the sequence
2561 (without outputting the insns). */
2564 /* Fall back to floating point rounding optab. */
2567 /* For non-C99 targets we may end up without a fallback fndecl here
2568 if the user called __builtin_lfloor directly. In this case emit
2569 a call to the floor/ceil variants nevertheless. This should result
2570 in the best user experience for not full C99 targets. */
2572 {
2573 tree fntype;
2577 {
2610 }
2615 }
2622 /* Truncate the result of floating point optab to integer
2623 via expand_fix (). */
2628 }
2630 /* Expand a call to one of the builtin math functions doing integer
2631 conversion (lrint).
2632 Return 0 if a normal call should be emitted rather than expanding the
2633 function in-line. EXP is the expression that is a call to the builtin
2634 function; if convenient, the result should be placed in TARGET. */
2636 static rtx
2638 {
2639 convert_optab builtin_optab;
2640 rtx op0;
2643 tree arg;
2644 machine_mode mode;
2653 {
2672 }
2674 /* There's no easy way to detect the case we need to set EDOM. */
2678 /* Make a suitable register to place result in. */
2681 /* There's no easy way to detect the case we need to set EDOM. */
2683 {
2686 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2687 need to expand the argument again. This way, we will not perform
2688 side-effects more the once. */
2696 {
2697 /* Output the entire sequence. */
2702 }
2704 /* If we were unable to expand via the builtin, stop the sequence
2705 (without outputting the insns) and call to the library function
2706 with the stabilized argument list. */
2708 }
2711 {
2712 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2713 targets, (int) round (x) should never be transformed into
2714 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2715 a call to lround in the hope that the target provides at least some
2716 C99 functions. This should result in the best user experience for
2717 not full C99 targets. */
2718 tree fallback_fndecl = mathfn_built_in_1
2727 }
2730 }
2732 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2733 a normal call should be emitted rather than expanding the function
2734 in-line. EXP is the expression that is a call to the builtin
2735 function; if convenient, the result should be placed in TARGET. */
2737 static rtx
2739 {
2742 machine_mode mode;
2743 machine_mode mode2;
2752 /* Emit a libcall to libgcc. */
2754 /* Mode of the 2nd argument must match that of an int. */
2772 }
2774 /* Expand expression EXP which is a call to the strlen builtin. Return
2775 NULL_RTX if we failed the caller should emit a normal call, otherwise
2776 try to get the result in TARGET, if convenient. */
2778 static rtx
2780 machine_mode target_mode)
2781 {
2784 else
2785 {
2787 rtx pat;
2788 tree len;
2790 rtx src_reg;
2796 /* If the length can be computed at compile-time, return it. */
2801 /* If the length can be computed at compile-time and is constant
2802 integer, but there are side-effects in src, evaluate
2803 src for side-effects, then return len.
2804 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2805 can be optimized into: i++; x = 3; */
2808 {
2811 }
2815 /* If SRC is not a pointer type, don't do this operation inline. */
2819 /* Bail out if we can't compute strlen in the right mode. */
2821 {
2827 }
2831 /* Make a place to hold the source address. We will not expand
2832 the actual source until we are sure that the expansion will
2833 not fail -- there are trees that cannot be expanded twice. */
2836 /* Mark the beginning of the strlen sequence so we can emit the
2837 source operand later. */
2847 /* Now that we are assured of success, expand the source. */
2851 {
2852 #ifdef POINTERS_EXTEND_UNSIGNED
2855 POINTERS_EXTEND_UNSIGNED);
2856 #endif
2858 }
2864 else
2867 /* Return the value in the proper mode for this function. */
2872 else
2876 }
2877 }
2879 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2880 bytes from constant string DATA + OFFSET and return it as target
2881 constant. */
2883 static rtx
2885 machine_mode mode)
2886 {
2894 }
2896 /* LEN specify length of the block of memcpy/memset operation.
2897 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2898 In some cases we can make very likely guess on max size, then we
2899 set it into PROBABLE_MAX_SIZE. */
2901 static void
2906 {
2908 {
2911 }
2912 else
2913 {
2917 /* Determine bounds from the type. */
2920 else
2925 else
2931 {
2936 }
2938 {
2939 /* Anti range 0...N lets us to determine minimal size to N+1. */
2941 {
2944 }
2945 /* Code like
2947 int n;
2948 if (n < 100)
2949 memcpy (a, b, n)
2951 Produce anti range allowing negative values of N. We still
2952 can use the information and make a guess that N is not negative.
2953 */
2956 }
2957 }
2961 }
2963 /* Helper function to do the actual work for expand_builtin_memcpy. */
2965 static rtx
2967 {
2978 /* If DEST is not a pointer type, call the normal function. */
2982 /* If either SRC is not a pointer type, don't do this
2983 operation in-line. */
3000 /* If SRC is a string constant and block move would be done
3001 by pieces, we can avoid loading the string from memory
3002 and only stored the computed constants. */
3009 {
3011 builtin_memcpy_read_str,
3017 }
3022 /* Copy word part most expediently. */
3030 {
3033 }
3036 }
3038 /* Try to verify that the sizes and lengths of the arguments to a string
3039 manipulation function given by EXP are within valid bounds and that
3040 the operation does not lead to buffer overflow. Arguments other than
3041 EXP may be null. When non-null, the arguments have the following
3042 meaning:
3043 SIZE is the user-supplied size argument to the function (such as in
3044 memcpy(d, s, SIZE) or strncpy(d, s, SIZE). It specifies the exact
3045 number of bytes to write.
3046 MAXLEN is the user-supplied bound on the length of the source sequence
3047 (such as in strncat(d, s, N). It specifies the upper limit on the number
3048 of bytes to write.
3049 STR is the source string (such as in strcpy(d, s)) when the epxression
3050 EXP is a string function call (as opposed to a memory call like memcpy).
3051 As an exception, STR can also be an integer denoting the precomputed
3052 length of the source string.
3053 OBJSIZE is the size of the destination object specified by the last
3054 argument to the _chk builtins, typically resulting from the expansion
3055 of __builtin_object_size (such as in __builtin___strcpy_chk(d, s,
3056 OBJSIZE).
3058 When SIZE is null LEN is checked to verify that it doesn't exceed
3059 SIZE_MAX.
3061 If the call is successfully verified as safe from buffer overflow
3062 the function returns true, otherwise false.. */
3064 static bool
3066 {
3067 /* The size of the largest object is half the address space, or
3068 SSIZE_MAX. (This is way too permissive.) */
3073 /* Set to true when the exact number of bytes written by a string
3074 function like strcpy is not known and the only thing that is
3075 known is that it must be at least one (for the terminating nul). */
3078 {
3079 /* STR is normally a pointer to string but as a special case
3080 it can be an integer denoting the length of a string. */
3082 {
3083 /* Try to determine the range of lengths the source string
3084 refers to. If it can be determined add one to it for
3085 the terminating nul. Otherwise, set it to one for
3086 the same reason. */
3091 size_one_node);
3092 else
3093 {
3096 }
3097 }
3098 else
3100 }
3103 {
3104 /* When the only available piece of data is the object size
3105 there is nothing to do. */
3109 /* Otherwise, when the length of the source sequence is known
3110 (as with with strlen), set SIZE to it. */
3112 }
3117 /* The SIZE is exact if it's non-null, constant, and in range of
3118 unsigned HOST_WIDE_INT. */
3125 /* First check the number of bytes to be written against the maximum
3126 object size. */
3128 {
3134 "%K%qD: specified size %wu "
3139 else
3141 "%K%qD: specified size between %wu and %wu "
3148 }
3150 /* Next check the number of bytes to be written against the destination
3151 object size. */
3153 {
3159 {
3167 "%K%qD writing at least %wu byte into a region "
3180 else
3182 "%K%qD writing between %wu and %wu bytes "
3183 "into a region of size %wu overflows "
3188 /* Return error when an overflow has been detected. */
3190 }
3191 }
3193 /* Check the maximum length of the source sequence against the size
3194 of the destination object if known, or against the maximum size
3195 of an object. */
3197 {
3201 {
3206 {
3207 /* Warn about crazy big sizes first since that's more
3208 likely to be meaningful than saying that the bound
3209 is greater than the object size if both are big. */
3212 "%K%qD: specified bound %wu "
3217 else
3219 "%K%qD: specified bound between %wu and %wu "
3227 }
3230 {
3233 "%K%qD: specified bound %wu "
3238 else
3240 "%K%qD: specified bound between %wu and %wu "
3247 }
3248 }
3249 }
3252 }
3254 /* Helper to compute the size of the object referenced by the DEST
3255 expression which must of of pointer type, using Object Size type
3256 OSTYPE (only the least significant 2 bits are used). Return
3257 the size of the object if successful or NULL when the size cannot
3258 be determined. */
3262 {
3268 }
3270 /* Helper to determine and check the sizes of the source and the destination
3271 of calls to __builtin_{bzero,memcpy,memset} calls. Use Object Size type-0
3272 regardless of the OPT_Wstringop_overflow_ setting. Returns true on success
3273 (no overflow or invalid sizes), false otherwise. */
3275 static bool
3277 {
3281 /* For functions like memset and memcpy that operate on raw memory
3282 try to determine the size of the largest destination object using
3283 type-0 Object Size regardless of the object size type specified
3284 by the option. */
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 {
3310 }
3312 /* Check a call EXP to the memmove built-in for validity.
3313 Return NULL_RTX on both success and failure. */
3315 static rtx
3317 {
3328 }
3330 /* Expand an instrumented call EXP to the memcpy builtin.
3331 Return NULL_RTX if we failed, the caller should emit a normal call,
3332 otherwise try to get the result in TARGET, if convenient (and in
3333 mode MODE if that's convenient). */
3335 static rtx
3337 {
3343 else
3344 {
3350 /* Return src bounds with the result. */
3352 {
3356 }
3358 }
3359 }
3361 /* Expand a call EXP to the mempcpy builtin.
3362 Return NULL_RTX if we failed; the caller should emit a normal call,
3363 otherwise try to get the result in TARGET, if convenient (and in
3364 mode MODE if that's convenient). If ENDP is 0 return the
3365 destination pointer, if ENDP is 1 return the end pointer ala
3366 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3367 stpcpy. */
3369 static rtx
3371 {
3380 /* Avoid expanding mempcpy into memcpy when the call is determined
3381 to overflow the buffer. This also prevents the same overflow
3382 from being diagnosed again when expanding memcpy. */
3388 exp);
3389 }
3391 /* Expand an instrumented call EXP to the mempcpy builtin.
3392 Return NULL_RTX if we failed, the caller should emit a normal call,
3393 otherwise try to get the result in TARGET, if convenient (and in
3394 mode MODE if that's convenient). */
3396 static rtx
3398 {
3404 else
3405 {
3412 /* Return src bounds with the result. */
3414 {
3418 }
3420 }
3421 }
3423 /* Helper function to do the actual work for expand_builtin_mempcpy. The
3424 arguments to the builtin_mempcpy call DEST, SRC, and LEN are broken out
3425 so that this can also be called without constructing an actual CALL_EXPR.
3426 The other arguments and return value are the same as for
3427 expand_builtin_mempcpy. */
3429 static rtx
3432 tree orig_exp)
3433 {
3436 /* If return value is ignored, transform mempcpy into memcpy. */
3440 {
3445 }
3448 {
3453 }
3454 else
3455 {
3461 /* If either SRC or DEST is not a pointer type, don't do this
3462 operation in-line. */
3466 /* If LEN is not constant, call the normal function. */
3473 /* If SRC is a string constant and block move would be done
3474 by pieces, we can avoid loading the string from memory
3475 and only stored the computed constants. */
3482 {
3486 builtin_memcpy_read_str,
3492 }
3497 {
3507 }
3510 }
3511 }
3513 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3514 we failed, the caller should emit a normal call, otherwise try to
3515 get the result in TARGET, if convenient. If ENDP is 0 return the
3516 destination pointer, if ENDP is 1 return the end pointer ala
3517 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3518 stpcpy. */
3520 static rtx
3522 {
3524 rtx dest_mem;
3525 rtx src_mem;
3533 {
3536 }
3545 {
3547 /* movstr is supposed to set end to the address of the NUL
3548 terminator. If the caller requested a mempcpy-like return value,
3549 adjust it. */
3551 {
3555 }
3556 }
3558 }
3560 /* Do some very basic size validation of a call to the strcpy builtin
3561 given by EXP. Return NULL_RTX to have the built-in expand to a call
3562 to the library function. */
3564 static rtx
3566 {
3574 /* There is no way here to determine the length of the string in
3575 the destination to which the SRC string is being appended so
3576 just diagnose cases when the souce string is longer than
3577 the destination object. */
3585 }
3587 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3588 NULL_RTX if we failed the caller should emit a normal call, otherwise
3589 try to get the result in TARGET, if convenient (and in mode MODE if that's
3590 convenient). */
3592 static rtx
3594 {
3602 {
3606 }
3609 }
3611 /* Helper function to do the actual work for expand_builtin_strcpy. The
3612 arguments to the builtin_strcpy call DEST and SRC are broken out
3613 so that this can also be called without constructing an actual CALL_EXPR.
3614 The other arguments and return value are the same as for
3615 expand_builtin_strcpy. */
3617 static rtx
3619 {
3621 }
3623 /* Expand a call EXP to the stpcpy builtin.
3624 Return NULL_RTX if we failed the caller should emit a normal call,
3625 otherwise try to get the result in TARGET, if convenient (and in
3626 mode MODE if that's convenient). */
3628 static rtx
3630 {
3641 {
3645 }
3647 /* If return value is ignored, transform stpcpy into strcpy. */
3649 {
3653 }
3654 else
3655 {
3657 rtx ret;
3659 /* Ensure we get an actual string whose length can be evaluated at
3660 compile-time, not an expression containing a string. This is
3661 because the latter will potentially produce pessimized code
3662 when used to produce the return value. */
3669 exp);
3675 {
3679 {
3683 {
3685 {
3688 else
3690 }
3699 }
3700 }
3701 }
3704 }
3705 }
3707 /* Check a call EXP to the stpncpy built-in for validity.
3708 Return NULL_RTX on both success and failure. */
3710 static rtx
3712 {
3721 /* The number of bytes to write (not the maximum). */
3723 /* The length of the source sequence. */
3726 /* Try to determine the range of lengths that the source expression
3727 refers to. */
3731 else
3732 {
3735 }
3740 /* The number of bytes to write is LEN but check_sizes will also
3741 check SLEN if LEN's value isn't known. */
3746 }
3748 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3749 bytes from constant string DATA + OFFSET and return it as target
3750 constant. */
3752 rtx
3754 machine_mode mode)
3755 {
3762 }
3764 /* Helper to check the sizes of sequences and the destination of calls
3765 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3766 success (no overflow or invalid sizes), false otherwise. */
3768 static bool
3770 {
3775 /* Try to determine the range of lengths that the source expression
3776 refers to. */
3780 /* Try to verify that the destination is big enough for the shortest
3781 string. */
3784 {
3785 /* If it hasn't been provided by __strncat_chk, try to determine
3786 the size of the destination object into which the source is
3787 being copied. */
3789 }
3791 /* Add one for the terminating nul. */
3794 size_one_node)
3797 /* Strncat copies at most MAXLEN bytes and always appends the terminating
3798 nul so the specified upper bound should never be equal to (or greater
3799 than) the size of the destination. */
3802 {
3807 "%K%qD: specified bound %wu "
3813 }
3821 /* The number of bytes to write is LEN but check_sizes will also
3822 check SRCLEN if LEN's value isn't known. */
3825 }
3827 /* Similar to expand_builtin_strcat, do some very basic size validation
3828 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3829 the built-in expand to a call to the library function. */
3831 static rtx
3833 {
3841 /* The upper bound on the number of bytes to write. */
3843 /* The length of the source sequence. */
3846 /* Try to determine the range of lengths that the source expression
3847 refers to. */
3851 else
3854 /* Try to verify that the destination is big enough for the shortest
3855 string. First try to determine the size of the destination object
3856 into which the source is being copied. */
3859 /* Add one for the terminating nul. */
3862 size_one_node)
3865 /* Strncat copies at most MAXLEN bytes and always appends the terminating
3866 nul so the specified upper bound should never be equal to (or greater
3867 than) the size of the destination. */
3870 {
3875 "%K%qD: specified bound %wu "
3881 }
3889 /* The number of bytes to write is LEN but check_sizes will also
3890 check SRCLEN if LEN's value isn't known. */
3895 }
3897 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3898 NULL_RTX if we failed the caller should emit a normal call. */
3900 static rtx
3902 {
3907 {
3910 /* The number of bytes to write (not the maximum). */
3912 /* The length of the source sequence. */
3916 {
3917 /* Try to determine the range of lengths that the source expression
3918 refers to. */
3922 else
3923 {
3926 }
3931 /* The number of bytes to write is LEN but check_sizes will also
3932 check SLEN if LEN's value isn't known. */
3935 }
3937 /* We must be passed a constant len and src parameter. */
3943 /* We're required to pad with trailing zeros if the requested
3944 len is greater than strlen(s2)+1. In that case try to
3945 use store_by_pieces, if it fails, punt. */
3947 {
3950 rtx dest_mem;
3954 builtin_strncpy_read_str,
3961 builtin_strncpy_read_str,
3966 }
3967 }
3969 }
3971 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3972 bytes from constant string DATA + OFFSET and return it as target
3973 constant. */
3975 rtx
3977 machine_mode mode)
3978 {
3985 }
3987 /* Callback routine for store_by_pieces. Return the RTL of a register
3988 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3989 char value given in the RTL register data. For example, if mode is
3990 4 bytes wide, return the RTL for 0x01010101*data. */
3992 static rtx
3994 machine_mode mode)
3995 {
4011 }
4013 /* Expand expression EXP, which is a call to the memset builtin. Return
4014 NULL_RTX if we failed the caller should emit a normal call, otherwise
4015 try to get the result in TARGET, if convenient (and in mode MODE if that's
4016 convenient). */
4018 static rtx
4020 {
4032 }
4034 /* Expand expression EXP, which is an instrumented call to the memset builtin.
4035 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
4036 try to get the result in TARGET, if convenient (and in mode MODE if that's
4037 convenient). */
4039 static rtx
4041 {
4046 else
4047 {
4053 /* Return src bounds with the result. */
4055 {
4059 }
4061 }
4062 }
4064 /* Helper function to do the actual work for expand_builtin_memset. The
4065 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4066 so that this can also be called without constructing an actual CALL_EXPR.
4067 The other arguments and return value are the same as for
4068 expand_builtin_memset. */
4070 static rtx
4073 {
4076 machine_mode val_mode;
4088 /* If DEST is not a pointer type, don't do this operation in-line. */
4099 /* If the LEN parameter is zero, return DEST. */
4101 {
4102 /* Evaluate and ignore VAL in case it has side-effects. */
4105 }
4107 /* Stabilize the arguments in case we fail. */
4119 {
4120 rtx val_rtx;
4125 /* Assume that we can memset by pieces if we can store
4126 * the coefficients by pieces (in the required modes).
4127 * We can't pass builtin_memset_gen_str as that emits RTL. */
4133 {
4138 }
4142 probable_max_size))
4148 }
4154 {
4165 probable_max_size))
4171 }
4179 probable_max_size);
4182 {
4185 }
4189 do_libcall:
4199 else
4204 }
4206 /* Expand expression EXP, which is a call to the bzero builtin. Return
4207 NULL_RTX if we failed the caller should emit a normal call. */
4209 static rtx
4211 {
4220 /* New argument list transforming bzero(ptr x, int y) to
4221 memset(ptr x, int 0, size_t y). This is done this way
4222 so that if it isn't expanded inline, we fallback to
4223 calling bzero instead of memset. */
4231 }
4233 /* Try to expand cmpstr operation ICODE with the given operands.
4234 Return the result rtx on success, otherwise return null. */
4236 static rtx
4238 HOST_WIDE_INT align)
4239 {
4253 }
4255 /* Expand expression EXP, which is a call to the memcmp built-in function.
4256 Return NULL_RTX if we failed and the caller should emit a normal call,
4257 otherwise try to get the result in TARGET, if convenient.
4258 RESULT_EQ is true if we can relax the returned value to be either zero
4259 or nonzero, without caring about the sign. */
4261 static rtx
4263 {
4277 /* If we don't have POINTER_TYPE, call the function. */
4285 /* Set MEM_SIZE as appropriate. */
4287 {
4290 }
4296 {
4300 }
4302 /* If SRC is a string constant and block move would be done
4303 by pieces, we can avoid loading the string from memory
4304 and only stored the computed constants. */
4316 {
4317 /* Return the value in the proper mode for this function. */
4322 {
4325 }
4328 }
4331 }
4333 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4334 if we failed the caller should emit a normal call, otherwise try to get
4335 the result in TARGET, if convenient. */
4337 static rtx
4339 {
4346 {
4356 /* If we don't have POINTER_TYPE, call the function. */
4360 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4367 /* Try to call cmpstrsi. */
4372 /* Try to determine at least one length and call cmpstrnsi. */
4374 {
4375 tree len;
4376 rtx arg3_rtx;
4386 /* If we don't have a constant length for the first, use the length
4387 of the second, if we know it. We don't require a constant for
4388 this case; some cost analysis could be done if both are available
4389 but neither is constant. For now, assume they're equally cheap,
4390 unless one has side effects. If both strings have constant lengths,
4391 use the smaller. */
4407 else
4410 /* If both arguments have side effects, we cannot optimize. */
4412 {
4414 result = expand_cmpstrn_or_cmpmem
4417 }
4418 }
4421 {
4422 /* Return the value in the proper mode for this function. */
4430 }
4432 /* Expand the library call ourselves using a stabilized argument
4433 list to avoid re-evaluating the function's arguments twice. */
4439 }
4441 }
4443 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4444 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4445 the result in TARGET, if convenient. */
4447 static rtx
4449 ATTRIBUTE_UNUSED machine_mode mode)
4450 {
4457 /* If c_strlen can determine an expression for one of the string
4458 lengths, and it doesn't have side effects, then emit cmpstrnsi
4459 using length MIN(strlen(string)+1, arg3). */
4462 {
4465 rtx result;
4484 /* If we don't have a constant length for the first, use the length
4485 of the second, if we know it. If neither string is constant length,
4486 use the given length argument. We don't require a constant for
4487 this case; some cost analysis could be done if both are available
4488 but neither is constant. For now, assume they're equally cheap,
4489 unless one has side effects. If both strings have constant lengths,
4490 use the smaller. */
4508 else
4511 /* If we are not using the given length, we must incorporate it here.
4512 The actual new length parameter will be MIN(len,arg3) in this case. */
4522 {
4523 /* Return the value in the proper mode for this function. */
4531 }
4533 /* Expand the library call ourselves using a stabilized argument
4534 list to avoid re-evaluating the function's arguments twice. */
4541 }
4543 }
4545 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4546 if that's convenient. */
4548 rtx
4550 {
4551 rtx val;
4554 /* Don't do __builtin_saveregs more than once in a function.
4555 Save the result of the first call and reuse it. */
4559 /* When this function is called, it means that registers must be
4560 saved on entry to this function. So we migrate the call to the
4561 first insn of this function. */
4565 /* Do whatever the machine needs done in this case. */
4573 /* Put the insns after the NOTE that starts the function. If this
4574 is inside a start_sequence, make the outer-level insn chain current, so
4575 the code is placed at the start of the function. */
4581 }
4583 /* Expand a call to __builtin_next_arg. */
4585 static rtx
4587 {
4588 /* Checking arguments is already done in fold_builtin_next_arg
4589 that must be called before this function. */
4594 }
4596 /* Make it easier for the backends by protecting the valist argument
4597 from multiple evaluations. */
4599 static tree
4601 {
4604 /* The current way of determining the type of valist is completely
4605 bogus. We should have the information on the va builtin instead. */
4610 {
4614 /* For this case, the backends will be expecting a pointer to
4615 vatype, but it's possible we've actually been given an array
4616 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4617 So fix it. */
4619 {
4622 }
4623 }
4624 else
4625 {
4629 {
4635 }
4641 }
4644 }
4646 /* The "standard" definition of va_list is void*. */
4648 tree
4650 {
4652 }
4654 /* The "standard" abi va_list is va_list_type_node. */
4656 tree
4658 {
4660 }
4662 /* The "standard" type of va_list is va_list_type_node. */
4664 tree
4666 {
4673 {
4674 /* If va_list is an array type, the argument may have decayed
4675 to a pointer type, e.g. by being passed to another function.
4676 In that case, unwrap both types so that we can compare the
4677 underlying records. */
4680 {
4683 }
4684 }
4689 }
4691 /* The "standard" implementation of va_start: just assign `nextarg' to
4692 the variable. */
4694 void
4696 {
4700 /* We do not have any valid bounds for the pointer, so
4701 just store zero bounds for it. */
4705 nextarg));
4706 }
4708 /* Expand EXP, a call to __builtin_va_start. */
4710 static rtx
4712 {
4713 rtx nextarg;
4714 tree valist;
4718 {
4721 }
4731 else
4735 }
4737 /* Expand EXP, a call to __builtin_va_end. */
4739 static rtx
4741 {
4744 /* Evaluate for side effects, if needed. I hate macros that don't
4745 do that. */
4750 }
4752 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4753 builtin rather than just as an assignment in stdarg.h because of the
4754 nastiness of array-type va_list types. */
4756 static rtx
4758 {
4771 {
4775 }
4776 else
4777 {
4780 /* Evaluate to pointers. */
4789 /* "Dereference" to BLKmode memories. */
4797 /* Copy. */
4799 }
4802 }
4804 /* Expand a call to one of the builtin functions __builtin_frame_address or
4805 __builtin_return_address. */
4807 static rtx
4809 {
4810 /* The argument must be a nonnegative integer constant.
4811 It counts the number of frames to scan up the stack.
4812 The value is either the frame pointer value or the return
4813 address saved in that frame. */
4815 /* Warning about missing arg was already issued. */
4818 {
4821 }
4822 else
4823 {
4824 /* Number of frames to scan up the stack. */
4829 /* Some ports cannot access arbitrary stack frames. */
4831 {
4834 }
4837 {
4838 /* Warn since no effort is made to ensure that any frame
4839 beyond the current one exists or can be safely reached. */
4842 }
4844 /* For __builtin_frame_address, return what we've got. */
4852 }
4853 }
4855 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
4856 failed and the caller should emit a normal call. CANNOT_ACCUMULATE
4857 is the same as for allocate_dynamic_stack_space. */
4859 static rtx
4861 {
4862 rtx op0;
4863 rtx result;
4869 bool valid_arglist
4870 = (alloca_with_align
4879 {
4880 /* -Walloca-larger-than and -Wvla-larger-than settings override
4881 the more general -Walloc-size-larger-than so unless either of
4882 the former options is specified check the alloca arguments for
4883 overflow. */
4887 }
4889 /* Compute the argument. */
4892 /* Compute the alignment. */
4893 align = (alloca_with_align
4897 /* Allocate the desired space. */
4902 }
4904 /* Expand a call to bswap builtin in EXP.
4905 Return NULL_RTX if a normal call should be emitted rather than expanding the
4906 function in-line. If convenient, the result should be placed in TARGET.
4907 SUBTARGET may be used as the target for computing one of EXP's operands. */
4909 static rtx
4911 rtx subtarget)
4912 {
4913 tree arg;
4914 rtx op0;
4932 }
4934 /* Expand a call to a unary builtin in EXP.
4935 Return NULL_RTX if a normal call should be emitted rather than expanding the
4936 function in-line. If convenient, the result should be placed in TARGET.
4937 SUBTARGET may be used as the target for computing one of EXP's operands. */
4939 static rtx
4942 {
4943 rtx op0;
4948 /* Compute the argument. */
4950 (subtarget
4954 /* Compute op, into TARGET if possible.
4955 Set TARGET to wherever the result comes back. */
4961 }
4963 /* Expand a call to __builtin_expect. We just return our argument
4964 as the builtin_expect semantic should've been already executed by
4965 tree branch prediction pass. */
4967 static rtx
4969 {
4970 tree arg;
4977 /* When guessing was done, the hints should be already stripped away. */
4981 }
4983 /* Expand a call to __builtin_assume_aligned. We just return our first
4984 argument as the builtin_assume_aligned semantic should've been already
4985 executed by CCP. */
4987 static rtx
4989 {
4993 EXPAND_NORMAL);
4998 }
5000 void
5002 {
5004 {
5006 /* For trap insns when not accumulating outgoing args force
5007 REG_ARGS_SIZE note to prevent crossjumping of calls with
5008 different args sizes. */
5011 }
5012 else
5013 {
5017 }
5020 }
5022 /* Expand a call to __builtin_unreachable. We do nothing except emit
5023 a barrier saying that control flow will not pass here.
5025 It is the responsibility of the program being compiled to ensure
5026 that control flow does never reach __builtin_unreachable. */
5027 static void
5029 {
5031 }
5033 /* Expand EXP, a call to fabs, fabsf or fabsl.
5034 Return NULL_RTX if a normal call should be emitted rather than expanding
5035 the function inline. If convenient, the result should be placed
5036 in TARGET. SUBTARGET may be used as the target for computing
5037 the operand. */
5039 static rtx
5041 {
5042 machine_mode mode;
5043 tree arg;
5044 rtx op0;
5054 }
5056 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5057 Return NULL is a normal call should be emitted rather than expanding the
5058 function inline. If convenient, the result should be placed in TARGET.
5059 SUBTARGET may be used as the target for computing the operand. */
5061 static rtx
5063 {
5065 tree arg;
5077 }
5079 /* Expand a call to __builtin___clear_cache. */
5081 static rtx
5083 {
5085 {
5086 #ifdef CLEAR_INSN_CACHE
5087 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5088 does something. Just do the default expansion to a call to
5089 __clear_cache(). */
5091 #else
5092 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5093 does nothing. There is no need to call it. Do nothing. */
5096 }
5098 /* We have a "clear_cache" insn, and it will handle everything. */
5102 /* We must not expand to a library call. If we did, any
5103 fallback library function in libgcc that might contain a call to
5104 __builtin___clear_cache() would recurse infinitely. */
5106 {
5109 }
5112 {
5125 }
5127 }
5129 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5131 static rtx
5133 {
5136 /* If we don't need too much alignment, we'll have been guaranteed
5137 proper alignment by get_trampoline_type. */
5141 /* Round address up to desired boundary. */
5152 }
5154 static rtx
5156 {
5172 /* If ONSTACK, the TRAMP argument should be the address of a field
5173 within the local function's FRAME decl. Either way, let's see if
5174 we can fill in the MEM_ATTRs for this memory. */
5178 /* Creator of a heap trampoline is responsible for making sure the
5179 address is aligned to at least STACK_BOUNDARY. Normally malloc
5180 will ensure this anyhow. */
5183 {
5187 }
5189 /* The FUNC argument should be the address of the nested function.
5190 Extract the actual function decl to pass to the hook. */
5197 /* Generate insns to initialize the trampoline. */
5201 {
5207 }
5210 }
5212 static rtx
5214 {
5215 rtx tramp;
5226 }
5228 /* Expand a call to the builtin descriptor initialization routine.
5229 A descriptor is made up of a couple of pointers to the static
5230 chain and the code entry in this order. */
5232 static rtx
5234 {
5239 VOID_TYPE))
5253 /* Generate insns to initialize the descriptor. */
5259 }
5261 /* Expand a call to the builtin descriptor adjustment routine. */
5263 static rtx
5265 {
5266 rtx tramp;
5273 /* Unalign the descriptor to allow runtime identification. */
5278 }
5280 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5281 function. The function first checks whether the back end provides
5282 an insn to implement signbit for the respective mode. If not, it
5283 checks whether the floating point format of the value is such that
5284 the sign bit can be extracted. If that is not the case, error out.
5285 EXP is the expression that is a call to the builtin function; if
5286 convenient, the result should be placed in TARGET. */
5287 static rtx
5289 {
5292 tree arg;
5295 rtx temp;
5308 /* Expand the argument yielding a RTX expression. */
5311 /* Check if the back end provides an insn that handles signbit for the
5312 argument's mode. */
5315 {
5321 }
5323 /* For floating point formats without a sign bit, implement signbit
5324 as "ARG < 0.0". */
5327 {
5328 /* But we can't do this if the format supports signed zero. */
5334 }
5337 {
5341 }
5342 else
5343 {
5345 /* Handle targets with different FP word orders. */
5348 else
5352 }
5354 /* Force the intermediate word_mode (or narrower) result into a
5355 register. This avoids attempting to create paradoxical SUBREGs
5356 of floating point modes below. */
5359 /* If the bitpos is within the "result mode" lowpart, the operation
5360 can be implement with a single bitwise AND. Otherwise, we need
5361 a right shift and an AND. */
5364 {
5372 }
5373 else
5374 {
5375 /* Perform a logical right shift to place the signbit in the least
5376 significant bit, then truncate the result to the desired mode
5377 and mask just this bit. */
5382 }
5385 }
5387 /* Expand fork or exec calls. TARGET is the desired target of the
5388 call. EXP is the call. FN is the
5389 identificator of the actual function. IGNORE is nonzero if the
5390 value is to be ignored. */
5392 static rtx
5394 {
5396 tree call;
5398 /* If we are not profiling, just call the function. */
5402 /* Otherwise call the wrapper. This should be equivalent for the rest of
5403 compiler, so the code does not diverge, and the wrapper may run the
5404 code necessary for keeping the profiling sane. */
5407 {
5438 }
5450 }
5453 \f
5454 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5455 the pointer in these functions is void*, the tree optimizers may remove
5456 casts. The mode computed in expand_builtin isn't reliable either, due
5457 to __sync_bool_compare_and_swap.
5459 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5460 group of builtins. This gives us log2 of the mode size. */
5464 {
5465 /* The size is not negotiable, so ask not to get BLKmode in return
5466 if the target indicates that a smaller size would be better. */
5468 }
5470 /* Expand the memory expression LOC and return the appropriate memory operand
5471 for the builtin_sync operations. */
5473 static rtx
5475 {
5481 /* Note that we explicitly do not want any alias information for this
5482 memory, so that we kill all other live memories. Otherwise we don't
5483 satisfy the full barrier semantics of the intrinsic. */
5486 /* The alignment needs to be at least according to that of the mode. */
5493 }
5495 /* Make sure an argument is in the right mode.
5496 EXP is the tree argument.
5497 MODE is the mode it should be in. */
5499 static rtx
5501 {
5502 rtx val;
5503 machine_mode old_mode;
5506 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5507 of CONST_INTs, where we know the old_mode only from the call argument. */
5514 }
5517 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5518 EXP is the CALL_EXPR. CODE is the rtx code
5519 that corresponds to the arithmetic or logical operation from the name;
5520 an exception here is that NOT actually means NAND. TARGET is an optional
5521 place for us to store the results; AFTER is true if this is the
5522 fetch_and_xxx form. */
5524 static rtx
5527 rtx target)
5528 {
5533 {
5540 {
5569 }
5570 }
5572 /* Expand the operands. */
5577 after);
5578 }
5580 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5581 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5582 true if this is the boolean form. TARGET is a place for us to store the
5583 results; this is NOT optional if IS_BOOL is true. */
5585 static rtx
5588 {
5592 /* Expand the operands. */
5599 {
5602 else
5604 }
5607 MEMMODEL_SYNC_SEQ_CST))
5611 }
5613 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5614 general form is actually an atomic exchange, and some targets only
5615 support a reduced form with the second argument being a constant 1.
5616 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5617 the results. */
5619 static rtx
5621 rtx target)
5622 {
5625 /* Expand the operands. */
5630 }
5632 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5634 static void
5636 {
5637 rtx mem;
5639 /* Expand the operands. */
5643 }
5645 /* Given an integer representing an ``enum memmodel'', verify its
5646 correctness and return the memory model enum. */
5648 static enum memmodel
5650 {
5651 rtx op;
5653 source_location loc
5656 /* If the parameter is not a constant, it's a run time value so we'll just
5657 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5667 {
5671 }
5673 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5675 {
5679 }
5681 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5682 be conservative and promote consume to acquire. */
5687 }
5689 /* Expand the __atomic_exchange intrinsic:
5690 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5691 EXP is the CALL_EXPR.
5692 TARGET is an optional place for us to store the results. */
5694 static rtx
5696 {
5705 /* Expand the operands. */
5710 }
5712 /* Expand the __atomic_compare_exchange intrinsic:
5713 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5714 TYPE desired, BOOL weak,
5715 enum memmodel success,
5716 enum memmodel failure)
5717 EXP is the CALL_EXPR.
5718 TARGET is an optional place for us to store the results. */
5720 static rtx
5722 rtx target)
5723 {
5727 tree weak;
5729 source_location loc
5736 {
5738 "failure memory model cannot be stronger than success "
5741 }
5744 {
5746 "invalid failure memory model for "
5750 }
5756 /* Expand the operands. */
5772 /* Lest the rtl backend create a race condition with an imporoper store
5773 to memory, always create a new pseudo for OLDVAL. */
5780 /* Conditionally store back to EXPECT, lest we create a race condition
5781 with an improper store to memory. */
5782 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5783 the normal case where EXPECT is totally private, i.e. a register. At
5784 which point the store can be unconditional. */
5792 }
5794 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5795 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5796 call. The weak parameter must be dropped to match the expected parameter
5797 list and the expected argument changed from value to pointer to memory
5798 slot. */
5800 static void
5802 {
5818 /* Skip the boolean weak parameter. */
5821 built_in_function fncode
5826 fndecl);
5831 {
5838 }
5839 }
5841 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
5843 void
5845 {
5851 tree lhs;
5853 source_location loc
5860 {
5862 "failure memory model cannot be stronger than success "
5865 }
5868 {
5870 "invalid failure memory model for "
5874 }
5877 {
5880 }
5882 /* Expand the operands. */
5895 {
5898 }
5902 {
5908 }
5909 }
5911 /* Expand the __atomic_load intrinsic:
5912 TYPE __atomic_load (TYPE *object, enum memmodel)
5913 EXP is the CALL_EXPR.
5914 TARGET is an optional place for us to store the results. */
5916 static rtx
5918 {
5919 rtx mem;
5924 {
5925 source_location loc
5930 }
5935 /* Expand the operand. */
5939 }
5942 /* Expand the __atomic_store intrinsic:
5943 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
5944 EXP is the CALL_EXPR.
5945 TARGET is an optional place for us to store the results. */
5947 static rtx
5949 {
5956 {
5957 source_location loc
5962 }
5967 /* Expand the operands. */
5972 }
5974 /* Expand the __atomic_fetch_XXX intrinsic:
5975 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
5976 EXP is the CALL_EXPR.
5977 TARGET is an optional place for us to store the results.
5978 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
5979 FETCH_AFTER is true if returning the result of the operation.
5980 FETCH_AFTER is false if returning the value before the operation.
5981 IGNORE is true if the result is not used.
5982 EXT_CALL is the correct builtin for an external call if this cannot be
5983 resolved to an instruction sequence. */
5985 static rtx
5989 {
5992 tree fndecl;
5993 tree addr;
5997 /* Expand the operands. */
6001 /* Only try generating instructions if inlining is turned on. */
6003 {
6007 }
6009 /* Return if a different routine isn't needed for the library call. */
6013 /* Change the call to the specified function. */
6021 /* Expand the call here so we can emit trailing code. */
6024 /* Replace the original function just in case it matters. */
6027 /* Then issue the arithmetic correction to return the right result. */
6029 {
6031 {
6033 OPTAB_LIB_WIDEN);
6035 }
6036 else
6038 OPTAB_LIB_WIDEN);
6039 }
6041 }
6043 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
6045 void
6047 {
6055 optab optab;
6067 {
6082 }
6085 {
6092 }
6114 {
6119 }
6120 else
6122 OPTAB_DIRECT);
6125 }
6127 /* Expand an atomic clear operation.
6128 void _atomic_clear (BOOL *obj, enum memmodel)
6129 EXP is the call expression. */
6131 static rtx
6133 {
6134 machine_mode mode;
6143 {
6144 source_location loc
6149 }
6151 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6152 Failing that, a store is issued by __atomic_store. The only way this can
6153 fail is if the bool type is larger than a word size. Unlikely, but
6154 handle it anyway for completeness. Assume a single threaded model since
6155 there is no atomic support in this case, and no barriers are required. */
6160 }
6162 /* Expand an atomic test_and_set operation.
6163 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6164 EXP is the call expression. */
6166 static rtx
6168 {
6169 rtx mem;
6171 machine_mode mode;
6178 }
6181 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6182 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6184 static tree
6186 {
6188 machine_mode mode;
6199 {
6202 /* Either this argument is null, or it's a fake pointer encoding
6203 the alignment of the object. */
6209 else
6211 }
6212 else
6213 {
6216 /* This function is usually invoked and folded immediately by the front
6217 end before anything else has a chance to look at it. The pointer
6218 parameter at this point is usually cast to a void *, so check for that
6219 and look past the cast. */
6229 /* Get the underlying type of the object. */
6232 }
6234 /* If the object has smaller alignment, the lock free routines cannot
6235 be used. */
6239 /* Check if a compare_and_swap pattern exists for the mode which represents
6240 the required size. The pattern is not allowed to fail, so the existence
6241 of the pattern indicates support is present. Also require that an
6242 atomic load exists for the required size. */
6245 else
6247 }
6249 /* Return true if the parameters to call EXP represent an object which will
6250 always generate lock free instructions. The first argument represents the
6251 size of the object, and the second parameter is a pointer to the object
6252 itself. If NULL is passed for the object, then the result is based on
6253 typical alignment for an object of the specified size. Otherwise return
6254 false. */
6256 static rtx
6258 {
6259 tree size;
6264 {
6267 }
6273 }
6275 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6276 is lock free on this architecture. */
6278 static tree
6280 {
6284 /* If it isn't always lock free, don't generate a result. */
6289 }
6291 /* Return true if the parameters to call EXP represent an object which will
6292 always generate lock free instructions. The first argument represents the
6293 size of the object, and the second parameter is a pointer to the object
6294 itself. If NULL is passed for the object, then the result is based on
6295 typical alignment for an object of the specified size. Otherwise return
6296 NULL*/
6298 static rtx
6300 {
6301 tree size;
6306 {
6309 }
6314 /* If the value is known at compile time, return the RTX for it. */
6320 }
6322 /* Expand the __atomic_thread_fence intrinsic:
6323 void __atomic_thread_fence (enum memmodel)
6324 EXP is the CALL_EXPR. */
6326 static void
6328 {
6331 }
6333 /* Expand the __atomic_signal_fence intrinsic:
6334 void __atomic_signal_fence (enum memmodel)
6335 EXP is the CALL_EXPR. */
6337 static void
6339 {
6342 }
6344 /* Expand the __sync_synchronize intrinsic. */
6346 static void
6348 {
6350 }
6352 static rtx
6354 {
6360 {
6362 /* If the target is not sutitable then create a new target. */
6370 }
6373 }
6375 static void
6377 {
6383 {
6390 }
6392 }
6394 \f
6395 /* Emit code to restore the current value of stack. */
6397 static void
6399 {
6411 }
6413 /* Emit code to save the current value of stack. */
6415 static rtx
6417 {
6422 }
6425 /* Expand an expression EXP that calls a built-in function,
6426 with result going to TARGET if that's convenient
6427 (and in mode MODE if that's convenient).
6428 SUBTARGET may be used as the target for computing one of EXP's operands.
6429 IGNORE is nonzero if the value is to be ignored. */
6431 rtx
6434 {
6443 /* When ASan is enabled, we don't want to expand some memory/string
6444 builtins and rely on libsanitizer's hooks. This allows us to avoid
6445 redundant checks and be sure, that possible overflow will be detected
6446 by ASan. */
6451 /* When not optimizing, generate calls to library functions for a certain
6452 set of builtins. */
6479 /* The built-in function expanders test for target == const0_rtx
6480 to determine whether the function's result will be ignored. */
6484 /* If the result of a pure or const built-in function is ignored, and
6485 none of its arguments are volatile, we can avoid expanding the
6486 built-in call and just evaluate the arguments for side-effects. */
6490 {
6492 tree arg;
6493 call_expr_arg_iterator iter;
6497 {
6500 }
6503 {
6507 }
6508 }
6510 /* expand_builtin_with_bounds is supposed to be used for
6511 instrumented builtin calls. */
6515 {
6533 /* Just do a normal library call if we were unable to fold
6534 the values. */
6610 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6611 FUNCTION with a copy of the parameters described by
6612 ARGUMENTS, and ARGSIZE. It returns a block of memory
6613 allocated on the stack into which is stored all the registers
6614 that might possibly be used for returning the result of a
6615 function. ARGUMENTS is the value returned by
6616 __builtin_apply_args. ARGSIZE is the number of bytes of
6617 arguments that must be copied. ??? How should this value be
6618 computed? We'll also need a safe worst case value for varargs
6619 functions. */
6626 else
6627 {
6635 }
6637 /* __builtin_return (RESULT) causes the function to return the
6638 value described by RESULT. RESULT is address of the block of
6639 memory returned by __builtin_apply. */
6649 /* All valid uses of __builtin_va_arg_pack () are removed during
6650 inlining. */
6655 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6656 inlining. */
6660 /* Return the address of the first anonymous stack arg. */
6682 /* Returns the address of the area where the structure is returned.
6683 0 otherwise. */
6689 else
6694 /* If the allocation stems from the declaration of a variable-sized
6695 object, it cannot accumulate. */
6849 {
6852 }
6856 /* This should have been lowered to the builtins below. */
6860 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6861 and the receiver label. */
6863 {
6869 /* This is copied from the handling of non-local gotos. */
6871 nonlocal_goto_handler_labels
6873 nonlocal_goto_handler_labels);
6874 /* ??? Do not let expand_label treat us as such since we would
6875 not want to be both on the list of non-local labels and on
6876 the list of forced labels. */
6879 }
6883 /* __builtin_setjmp_receiver is passed the receiver label. */
6885 {
6891 }
6894 /* __builtin_longjmp is passed a pointer to an array of five words.
6895 It's similar to the C library longjmp function but works with
6896 __builtin_setjmp above. */
6899 {
6905 {
6908 }
6912 }
6921 /* This updates the setjmp buffer that is its argument with the value
6922 of the current stack pointer. */
6925 {
6926 rtx buf_addr
6931 }
6951 /* Various hooks for the DWARF 2 __throw routine. */
6957 #ifdef DWARF2_UNWIND_INFO
6963 #endif
7163 mode = get_builtin_sync_mode
7175 mode = get_builtin_sync_mode
7222 {
7226 mode =
7232 /* If this is turned into an external library call, the weak parameter
7233 must be dropped to match the expected parameter list. */
7238 /* Skip the boolean weak parameter. */
7243 }
7272 {
7282 }
7288 {
7298 }
7304 {
7314 }
7320 {
7330 }
7336 {
7346 }
7352 {
7362 }
7517 /* We allow user CHKP builtins if Pointer Bounds
7518 Checker is off. */
7520 {
7531 else
7533 }
7534 /* FALLTHROUGH */
7546 /* Software implementation of Pointer Bounds Checker is NYI.
7547 Target support is required. */
7552 /* Do library call, if we failed to expand the builtin when
7553 folding. */
7558 }
7560 /* The switch statement above can drop through to cause the function
7561 to be called normally. */
7563 }
7565 /* Similar to expand_builtin but is used for instrumented calls. */
7567 rtx
7569 rtx subtarget ATTRIBUTE_UNUSED,
7571 {
7584 {
7605 }
7607 /* The switch statement above can drop through to cause the function
7608 to be called normally. */
7610 }
7612 /* Determine whether a tree node represents a call to a built-in
7613 function. If the tree T is a call to a built-in function with
7614 the right number of arguments of the appropriate types, return
7615 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7616 Otherwise the return value is END_BUILTINS. */
7618 enum built_in_function
7620 {
7623 const_call_expr_arg_iterator iter;
7639 {
7640 /* If a function doesn't take a variable number of arguments,
7641 the last element in the list will have type `void'. */
7644 {
7648 }
7657 {
7660 }
7662 {
7665 }
7667 {
7670 }
7672 {
7675 }
7676 else
7678 }
7680 /* Variable-length argument list. */
7682 }
7684 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7685 evaluate to a constant. */
7687 static tree
7689 {
7690 /* We return 1 for a numeric type that's known to be a constant
7691 value at compile-time or for an aggregate type that's a
7692 literal constant. */
7695 /* If we know this is a constant, emit the constant of one. */
7701 {
7708 }
7710 /* If this expression has side effects, show we don't know it to be a
7711 constant. Likewise if it's a pointer or aggregate type since in
7712 those case we only want literals, since those are only optimized
7713 when generating RTL, not later.
7714 And finally, if we are compiling an initializer, not code, we
7715 need to return a definite result now; there's not going to be any
7716 more optimization done. */
7721 || folding_initializer
7726 }
7728 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7729 return it as a truthvalue. */
7731 static tree
7733 tree predictor)
7734 {
7746 predictor);
7750 }
7752 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7753 NULL_TREE if no simplification is possible. */
7755 tree
7757 {
7761 /* Distribute the expected value over short-circuiting operators.
7762 See through the cast from truthvalue_type_node to long. */
7769 /* If this is a builtin_expect within a builtin_expect keep the
7770 inner one. See through a comparison against a constant. It
7771 might have been added to create a thruthvalue. */
7787 {
7796 }
7798 /* If the argument isn't invariant then there's nothing else we can do. */
7802 /* If we expect that a comparison against the argument will fold to
7803 a constant return the constant. In practice, this means a true
7804 constant or the address of a non-weak symbol. */
7808 {
7809 do
7810 {
7812 }
7817 }
7819 /* Otherwise, ARG0 already has the proper type for the return value. */
7821 }
7823 /* Fold a call to __builtin_classify_type with argument ARG. */
7825 static tree
7827 {
7832 }
7834 /* Fold a call to __builtin_strlen with argument ARG. */
7836 static tree
7838 {
7841 else
7842 {
7849 }
7850 }
7852 /* Fold a call to __builtin_inf or __builtin_huge_val. */
7854 static tree
7856 {
7857 REAL_VALUE_TYPE real;
7859 /* __builtin_inff is intended to be usable to define INFINITY on all
7860 targets. If an infinity is not available, INFINITY expands "to a
7861 positive constant of type float that overflows at translation
7862 time", footnote "In this case, using INFINITY will violate the
7863 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
7864 Thus we pedwarn to ensure this constraint violation is
7865 diagnosed. */
7871 }
7873 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
7874 NULL_TREE if no simplification can be made. */
7876 static tree
7879 {
7880 tree type;
7890 /* Calculate the result when the argument is a constant. */
7895 /* Canonicalize sincos to cexpi. */
7897 {
7900 }
7902 {
7909 }
7918 }
7920 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
7921 Return NULL_TREE if no simplification can be made. */
7923 static tree
7925 {
7931 /* If the LEN parameter is zero, return zero. */
7936 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7940 /* If len parameter is one, return an expression corresponding to
7941 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
7943 {
7945 tree cst_uchar_ptr_node
7948 tree ind1
7952 cst_uchar_ptr_node,
7953 arg1)));
7954 tree ind2
7958 cst_uchar_ptr_node,
7959 arg2)));
7961 }
7964 }
7966 /* Fold a call to builtin isascii with argument ARG. */
7968 static tree
7970 {
7973 else
7974 {
7975 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
7981 }
7982 }
7984 /* Fold a call to builtin toascii with argument ARG. */
7986 static tree
7988 {
7992 /* Transform toascii(c) -> (c & 0x7f). */
7995 }
7997 /* Fold a call to builtin isdigit with argument ARG. */
7999 static tree
8001 {
8004 else
8005 {
8006 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
8007 /* According to the C standard, isdigit is unaffected by locale.
8008 However, it definitely is affected by the target character set. */
8009 unsigned HOST_WIDE_INT target_digit0
8020 }
8021 }
8023 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
8025 static tree
8027 {
8033 }
8035 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
8037 static tree
8039 {
8045 }
8047 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
8049 static tree
8051 {
8052 /* ??? Only expand to FMA_EXPR if it's directly supported. */
8060 }
8062 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8064 static tree
8066 {
8069 {
8073 {
8078 }
8079 }
8082 }
8084 /* Fold a call to builtin frexp, we can assume the base is 2. */
8086 static tree
8088 {
8099 /* Proceed if a valid pointer type was passed in. */
8101 {
8106 {
8108 /* For +-0, return (*exp = 0, +-0). */
8114 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8117 {
8118 /* Since the frexp function always expects base 2, and in
8119 GCC normalized significands are already in the range
8120 [0.5, 1.0), we have exactly what frexp wants. */
8125 }
8129 }
8131 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8135 }
8138 }
8140 /* Fold a call to builtin modf. */
8142 static tree
8144 {
8155 /* Proceed if a valid pointer type was passed in. */
8157 {
8162 {
8165 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8169 /* For +-Inf, return (*arg1 = arg0, +-0). */
8175 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8178 /* If the original number was negative and already
8179 integral, then the fractional part is -0.0. */
8183 }
8185 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8191 }
8194 }
8196 /* Given a location LOC, an interclass builtin function decl FNDECL
8197 and its single argument ARG, return an folded expression computing
8198 the same, or NULL_TREE if we either couldn't or didn't want to fold
8199 (the latter happen if there's an RTL instruction available). */
8201 static tree
8203 {
8204 machine_mode mode;
8216 /* If there is no optab, try generic code. */
8218 {
8219 tree result;
8222 {
8223 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8226 REAL_VALUE_TYPE r;
8230 {
8231 /* NaN and Inf are encoded in the high-order double value
8232 only. The low-order value is not significant. */
8236 }
8243 }
8246 {
8247 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8250 REAL_VALUE_TYPE r;
8254 {
8255 /* NaN and Inf are encoded in the high-order double value
8256 only. The low-order value is not significant. */
8260 }
8266 /*result = fold_build2_loc (loc, UNGT_EXPR,
8267 TREE_TYPE (TREE_TYPE (fndecl)),
8268 fold_build1_loc (loc, ABS_EXPR, type, arg),
8269 build_real (type, r));
8270 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8271 TREE_TYPE (TREE_TYPE (fndecl)),
8272 result);*/
8274 }
8276 {
8277 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8278 islessequal(fabs(x),DBL_MAX). */
8288 {
8289 /* Use double to test the normal range of IBM extended
8290 precision. Emin for IBM extended precision is
8291 different to emin for IEEE double, being 53 higher
8292 since the low double exponent is at least 53 lower
8293 than the high double exponent. */
8297 }
8309 {
8310 /* Testing the high end of the range is done just using
8311 the high double, using the same test as isfinite().
8312 For the subnormal end of the range we first test the
8313 high double, then if its magnitude is equal to the
8314 limit of 0x1p-969, we test whether the low double is
8315 non-zero and opposite sign to the high double. */
8331 integer_type_node,
8337 }
8338 else
8339 {
8340 tree const isge_fn
8343 }
8347 }
8350 }
8353 }
8355 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8356 ARG is the argument for the call. */
8358 static tree
8360 {
8367 {
8375 {
8376 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8377 /* In a boolean context, GCC will fold the inner COND_EXPR to
8378 1. So e.g. "if (isinf_sign(x))" would be folded to just
8379 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8387 {
8400 integer_zero_node);
8401 }
8404 }
8417 {
8420 {
8421 /* NaN and Inf are encoded in the high-order double value
8422 only. The low-order value is not significant. */
8424 }
8425 }
8431 }
8432 }
8434 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8435 This builtin will generate code to return the appropriate floating
8436 point classification depending on the value of the floating point
8437 number passed in. The possible return values must be supplied as
8438 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8439 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8440 one floating point argument which is "type generic". */
8442 static tree
8444 {
8447 machine_mode mode;
8448 REAL_VALUE_TYPE r;
8451 /* Verify the required arguments in the original call. */
8471 /* fpclassify(x) ->
8472 isnan(x) ? FP_NAN :
8473 (fabs(x) == Inf ? FP_INFINITE :
8474 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8475 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8489 {
8495 }
8498 {
8501 }
8504 }
8506 /* Fold a call to an unordered comparison function such as
8507 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8508 being called and ARG0 and ARG1 are the arguments for the call.
8509 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8510 the opposite of the desired result. UNORDERED_CODE is used
8511 for modes that can hold NaNs and ORDERED_CODE is used for
8512 the rest. */
8514 static tree
8518 {
8532 /* Choose the wider of two real types. */
8544 {
8548 }
8553 }
8555 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8556 arithmetics if it can never overflow, or into internal functions that
8557 return both result of arithmetics and overflowed boolean flag in
8558 a complex integer result, or some other check for overflow.
8559 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8560 checking part of that. */
8562 static tree
8565 {
8567 /* The code of the expression corresponding to the type-generic
8568 built-in, or ERROR_MARK for the type-specific ones. */
8573 {
8576 /* FALLTHRU */
8579 /* FALLTHRU */
8590 /* FALLTHRU */
8593 /* FALLTHRU */
8604 /* FALLTHRU */
8607 /* FALLTHRU */
8618 }
8620 /* For the "generic" overloads, the first two arguments can have different
8621 types and the last argument determines the target type to use to check
8622 for overflow. The arguments of the other overloads all have the same
8623 type. */
8626 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8627 arguments are constant, attempt to fold the built-in call into a constant
8628 expression indicating whether or not it detected an overflow. */
8632 /* Perform the computation in the target type and check for overflow. */
8636 arg2);
8650 tree store
8653 }
8655 /* Fold a call to __builtin_FILE to a constant string. */
8659 {
8664 }
8666 /* Fold a call to __builtin_FUNCTION to a constant string. */
8670 {
8672 {
8675 }
8678 }
8680 /* Fold a call to __builtin_LINE to an integer constant. */
8684 {
8686 }
8688 /* Fold a call to built-in function FNDECL with 0 arguments.
8689 This function returns NULL_TREE if no simplification was possible. */
8691 static tree
8693 {
8697 {
8723 }
8725 }
8727 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8728 This function returns NULL_TREE if no simplification was possible. */
8730 static tree
8732 {
8743 {
8745 {
8748 /* Gimplification will pull the CALL_EXPR for the builtin out of
8749 an if condition. When not optimizing, we'll not CSE it back.
8750 To avoid link error types of regressions, return false now. */
8755 }
8811 {
8816 }
8822 {
8827 }
8848 }
8852 }
8854 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
8855 This function returns NULL_TREE if no simplification was possible. */
8857 static tree
8859 {
8871 {
8915 NOP_EXPR);
8917 /* We do the folding for va_start in the expander. */
8932 }
8934 }
8936 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
8937 and ARG2.
8938 This function returns NULL_TREE if no simplification was possible. */
8940 static tree
8943 {
8957 {
9007 }
9009 }
9011 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
9012 arguments. IGNORE is true if the result of the
9013 function call is ignored. This function returns NULL_TREE if no
9014 simplification was possible. */
9016 tree
9018 {
9022 {
9038 }
9040 {
9045 }
9047 }
9049 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
9050 list ARGS along with N new arguments in NEWARGS. SKIP is the number
9051 of arguments in ARGS to be omitted. OLDNARGS is the number of
9052 elements in ARGS. */
9054 static tree
9057 {
9062 {
9070 }
9071 else
9075 }
9077 /* Return true if FNDECL shouldn't be folded right now.
9078 If a built-in function has an inline attribute always_inline
9079 wrapper, defer folding it after always_inline functions have
9080 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9081 might not be performed. */
9083 bool
9085 {
9088 && cfun
9091 }
9093 /* A wrapper function for builtin folding that prevents warnings for
9094 "statement without effect" and the like, caused by removing the
9095 call node earlier than the warning is generated. */
9097 tree
9099 {
9105 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9106 yet. Defer folding until we see all the arguments
9107 (after inlining). */
9109 {
9112 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9113 instead last argument is __builtin_va_arg_pack (). Defer folding
9114 even in that case, until arguments are finalized. */
9116 {
9123 }
9131 else
9132 {
9137 }
9138 }
9140 }
9142 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9143 N arguments are passed in the array ARGARRAY. Return a folded
9144 expression or NULL_TREE if no simplification was possible. */
9146 tree
9148 tree fn,
9151 {
9158 {
9159 /* If last argument is __builtin_va_arg_pack (), arguments to this
9160 function are not finalized yet. Defer folding until they are. */
9162 {
9169 }
9174 else
9176 }
9179 }
9181 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9182 along with N new arguments specified as the "..." parameters. SKIP
9183 is the number of arguments in EXP to be omitted. This function is used
9184 to do varargs-to-varargs transformations. */
9186 static tree
9188 {
9190 tree t;
9198 }
9200 /* Validate a single argument ARG against a tree code CODE representing
9201 a type. Return true when argument is valid. */
9203 static bool
9205 {
9213 }
9215 /* This function validates the types of a function call argument list
9216 against a specified list of tree_codes. If the last specifier is a 0,
9217 that represents an ellipses, otherwise the last specifier must be a
9218 VOID_TYPE.
9220 This is the GIMPLE version of validate_arglist. Eventually we want to
9221 completely convert builtins.c to work from GIMPLEs and the tree based
9222 validate_arglist will then be removed. */
9224 bool
9226 {
9230 const_tree arg;
9236 do
9237 {
9240 {
9242 /* This signifies an ellipses, any further arguments are all ok. */
9246 /* This signifies an endlink, if no arguments remain, return
9247 true, otherwise return false. */
9251 /* If no parameters remain or the parameter's code does not
9252 match the specified code, return false. Otherwise continue
9253 checking any remaining arguments. */
9258 }
9259 }
9262 /* We need gotos here since we can only have one VA_CLOSE in a
9263 function. */
9264 end: ;
9268 }
9270 /* Default target-specific builtin expander that does nothing. */
9272 rtx
9274 rtx target ATTRIBUTE_UNUSED,
9275 rtx subtarget ATTRIBUTE_UNUSED,
9276 machine_mode mode ATTRIBUTE_UNUSED,
9278 {
9280 }
9282 /* Returns true is EXP represents data that would potentially reside
9283 in a readonly section. */
9285 bool
9287 {
9297 /* Make sure we call decl_readonly_section only for trees it
9298 can handle (since it returns true for everything it doesn't
9299 understand). */
9304 else
9306 }
9308 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9309 to the call, and TYPE is its return type.
9311 Return NULL_TREE if no simplification was possible, otherwise return the
9312 simplified form of the call as a tree.
9314 The simplified form may be a constant or other expression which
9315 computes the same value, but in a more efficient manner (including
9316 calls to other builtin functions).
9318 The call may contain arguments which need to be evaluated, but
9319 which are not useful to determine the result of the call. In
9320 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9321 COMPOUND_EXPR will be an argument which must be evaluated.
9322 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9323 COMPOUND_EXPR in the chain will contain the tree for the simplified
9324 form of the builtin function call. */
9326 static tree
9328 {
9332 else
9333 {
9334 tree fn;
9343 {
9345 tree tem;
9350 /* Return an offset into the constant string argument. */
9353 }
9356 /* strpbrk(x, "") == NULL.
9357 Evaluate and ignore s1 in case it had side-effects. */
9367 /* New argument list transforming strpbrk(s1, s2) to
9368 strchr(s1, s2[0]). */
9371 }
9372 }
9374 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9375 to the call.
9377 Return NULL_TREE if no simplification was possible, otherwise return the
9378 simplified form of the call as a tree.
9380 The simplified form may be a constant or other expression which
9381 computes the same value, but in a more efficient manner (including
9382 calls to other builtin functions).
9384 The call may contain arguments which need to be evaluated, but
9385 which are not useful to determine the result of the call. In
9386 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9387 COMPOUND_EXPR will be an argument which must be evaluated.
9388 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9389 COMPOUND_EXPR in the chain will contain the tree for the simplified
9390 form of the builtin function call. */
9392 static tree
9394 {
9398 else
9399 {
9402 /* If either argument is "", return NULL_TREE. */
9404 /* Evaluate and ignore both arguments in case either one has
9405 side-effects. */
9409 }
9410 }
9412 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9413 to the call.
9415 Return NULL_TREE if no simplification was possible, otherwise return the
9416 simplified form of the call as a tree.
9418 The simplified form may be a constant or other expression which
9419 computes the same value, but in a more efficient manner (including
9420 calls to other builtin functions).
9422 The call may contain arguments which need to be evaluated, but
9423 which are not useful to determine the result of the call. In
9424 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9425 COMPOUND_EXPR will be an argument which must be evaluated.
9426 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9427 COMPOUND_EXPR in the chain will contain the tree for the simplified
9428 form of the builtin function call. */
9430 static tree
9432 {
9436 else
9437 {
9438 /* If the first argument is "", return NULL_TREE. */
9441 {
9442 /* Evaluate and ignore argument s2 in case it has
9443 side-effects. */
9446 }
9448 /* If the second argument is "", return __builtin_strlen(s1). */
9451 {
9454 /* If the replacement _DECL isn't initialized, don't do the
9455 transformation. */
9460 }
9462 }
9463 }
9465 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9466 produced. False otherwise. This is done so that we don't output the error
9467 or warning twice or three times. */
9469 bool
9471 {
9474 tree arg;
9475 /* There is good chance the current input_location points inside the
9476 definition of the va_start macro (perhaps on the token for
9477 builtin) in a system header, so warnings will not be emitted.
9478 Use the location in real source code. */
9479 source_location current_location =
9481 NULL);
9484 {
9487 }
9490 {
9492 {
9495 }
9497 }
9498 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9499 when we checked the arguments and if needed issued a warning. */
9500 else
9501 {
9503 {
9504 /* Evidently an out of date version of <stdarg.h>; can't validate
9505 va_start's second argument, but can still work as intended. */
9507 OPT_Wvarargs,
9510 }
9512 {
9515 }
9517 }
9522 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9523 or __builtin_next_arg (0) the first time we see it, after checking
9524 the arguments and if needed issuing a warning. */
9526 {
9529 /* Strip off all nops for the sake of the comparison. This
9530 is not quite the same as STRIP_NOPS. It does more.
9531 We must also strip off INDIRECT_EXPR for C++ reference
9532 parameters. */
9537 {
9538 /* FIXME: Sometimes with the tree optimizers we can get the
9539 not the last argument even though the user used the last
9540 argument. We just warn and set the arg to be the last
9541 argument so that we will get wrong-code because of
9542 it. */
9544 OPT_Wvarargs,
9546 }
9548 /* Undefined by C99 7.15.1.4p4 (va_start):
9549 "If the parameter parmN is declared with the register storage
9550 class, with a function or array type, or with a type that is
9551 not compatible with the type that results after application of
9552 the default argument promotions, the behavior is undefined."
9553 */
9555 {
9557 OPT_Wvarargs,
9558 "undefined behavior when second parameter of "
9560 }
9562 /* We want to verify the second parameter just once before the tree
9563 optimizers are run and then avoid keeping it in the tree,
9564 as otherwise we could warn even for correct code like:
9565 void foo (int i, ...)
9566 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9569 else
9571 }
9573 }
9576 /* Expand a call EXP to __builtin_object_size. */
9578 static rtx
9580 {
9581 tree ost;
9586 {
9591 }
9599 {
9604 }
9609 }
9611 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9612 FCODE is the BUILT_IN_* to use.
9613 Return NULL_RTX if we failed; the caller should emit a normal call,
9614 otherwise try to get the result in TARGET, if convenient (and in
9615 mode MODE if that's convenient). */
9617 static rtx
9620 {
9624 POINTER_TYPE,
9625 fcode == BUILT_IN_MEMSET_CHK
9643 {
9644 /* Avoid transforming the checking call to an ordinary one when
9645 an overflow has been detected or when the call couldn't be
9646 validated because the size is not constant. */
9651 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9652 mem{cpy,pcpy,move,set} is available. */
9654 {
9669 }
9678 }
9681 else
9682 {
9685 /* If DEST is not a pointer type, call the normal function. */
9689 /* If SRC and DEST are the same (and not volatile), do nothing. */
9691 {
9692 tree expr;
9695 {
9696 /* Evaluate and ignore LEN in case it has side-effects. */
9699 }
9703 }
9705 /* __memmove_chk special case. */
9707 {
9713 /* If src is categorized for a readonly section we can use
9714 normal __memcpy_chk. */
9716 {
9725 }
9726 }
9728 }
9729 }
9731 /* Emit warning if a buffer overflow is detected at compile time. */
9733 static void
9735 {
9736 /* The source string. */
9738 /* The size of the destination object. */
9740 /* The string that is being concatenated with (as in __strcat_chk)
9741 or null if it isn't. */
9743 /* The maximum length of the source sequence in a bounded operation
9744 (such as __strncat_chk) or null if the operation isn't bounded
9745 (such as __strcat_chk). */
9749 {
9757 /* For __strcat_chk the warning will be emitted only if overflowing
9758 by at least strlen (dest) + 1 bytes. */
9785 }
9788 {
9789 /* Check __strncat_chk. There is no way to determine the length
9790 of the string to which the source string is being appended so
9791 just warn when the length of the source string is not known. */
9794 }
9798 }
9800 /* Emit warning if a buffer overflow is detected at compile time
9801 in __sprintf_chk/__vsprintf_chk calls. */
9803 static void
9805 {
9810 /* Verify the required arguments in the original call. */
9820 /* Check whether the format is a literal string constant. */
9828 /* If the format doesn't contain % args or %%, we know its size. */
9831 /* If the format is "%s" and first ... argument is a string literal,
9832 we know it too. */
9835 {
9836 tree arg;
9847 }
9848 else
9851 /* Add one for the terminating nul. */
9855 }
9857 /* Emit warning if a free is called with address of a variable. */
9859 static void
9861 {
9875 else
9878 }
9880 /* Fold a call to __builtin_object_size with arguments PTR and OST,
9881 if possible. */
9883 static tree
9885 {
9902 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
9903 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
9904 and (size_t) 0 for types 2 and 3. */
9909 {
9913 }
9915 {
9916 /* If object size is not known yet, delay folding until
9917 later. Maybe subsequent passes will help determining
9918 it. */
9922 }
9925 }
9927 /* Builtins with folding operations that operate on "..." arguments
9928 need special handling; we need to store the arguments in a convenient
9929 data structure before attempting any folding. Fortunately there are
9930 only a few builtins that fall into this category. FNDECL is the
9931 function, EXP is the CALL_EXPR for the call. */
9933 static tree
9935 {
9940 {
9947 }
9949 {
9954 }
9956 }
9958 /* Initialize format string characters in the target charset. */
9960 bool
9962 {
9965 {
9988 }
9990 }
9992 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
9993 and no overflow/underflow occurred. INEXACT is true if M was not
9994 exactly calculated. TYPE is the tree type for the result. This
9995 function assumes that you cleared the MPFR flags and then
9996 calculated M to see if anything subsequently set a flag prior to
9997 entering this function. Return NULL_TREE if any checks fail. */
9999 static tree
10001 {
10002 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10003 overflow/underflow occurred. If -frounding-math, proceed iff the
10004 result of calling FUNC was exact. */
10007 {
10008 REAL_VALUE_TYPE rr;
10011 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
10012 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10013 but the mpft_t is not, then we underflowed in the
10014 conversion. */
10017 {
10018 REAL_VALUE_TYPE rmode;
10021 /* Proceed iff the specified mode can hold the value. */
10024 }
10025 }
10027 }
10029 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
10030 number and no overflow/underflow occurred. INEXACT is true if M
10031 was not exactly calculated. TYPE is the tree type for the result.
10032 This function assumes that you cleared the MPFR flags and then
10033 calculated M to see if anything subsequently set a flag prior to
10034 entering this function. Return NULL_TREE if any checks fail, if
10035 FORCE_CONVERT is true, then bypass the checks. */
10037 static tree
10039 {
10040 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
10041 overflow/underflow occurred. If -frounding-math, proceed iff the
10042 result of calling FUNC was exact. */
10047 {
10052 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
10053 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
10054 but the mpft_t is not, then we underflowed in the
10055 conversion. */
10060 {
10065 /* Proceed iff the specified mode can hold the value. */
10071 }
10072 }
10074 }
10076 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10077 the pointer *(ARG_QUO) and return the result. The type is taken
10078 from the type of ARG0 and is used for setting the precision of the
10079 calculation and results. */
10081 static tree
10083 {
10090 /* To proceed, MPFR must exactly represent the target floating point
10091 format, which only happens when the target base equals two. */
10095 {
10100 {
10104 tree result_rem;
10113 /* Remquo is independent of the rounding mode, so pass
10114 inexact=0 to do_mpfr_ckconv(). */
10118 {
10119 /* MPFR calculates quo in the host's long so it may
10120 return more bits in quo than the target int can hold
10121 if sizeof(host long) > sizeof(target int). This can
10122 happen even for native compilers in LP64 mode. In
10123 these cases, modulo the quo value with the largest
10124 number that the target int can hold while leaving one
10125 bit for the sign. */
10129 /* Dereference the quo pointer argument. */
10131 /* Proceed iff a valid pointer type was passed in. */
10133 {
10134 /* Set the value. */
10135 tree result_quo
10138 integer_quo));
10140 /* Combine the quo assignment with the rem. */
10143 }
10144 }
10145 }
10146 }
10148 }
10150 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10151 resulting value as a tree with type TYPE. The mpfr precision is
10152 set to the precision of TYPE. We assume that this mpfr function
10153 returns zero if the result could be calculated exactly within the
10154 requested precision. In addition, the integer pointer represented
10155 by ARG_SG will be dereferenced and set to the appropriate signgam
10156 (-1,1) value. */
10158 static tree
10160 {
10165 /* To proceed, MPFR must exactly represent the target floating point
10166 format, which only happens when the target base equals two. Also
10167 verify ARG is a constant and that ARG_SG is an int pointer. */
10172 {
10175 /* In addition to NaN and Inf, the argument cannot be zero or a
10176 negative integer. */
10180 {
10185 mpfr_t m;
10186 tree result_lg;
10195 {
10196 tree result_sg;
10198 /* Dereference the arg_sg pointer argument. */
10200 /* Assign the signgam value into *arg_sg. */
10205 /* Combine the signgam assignment with the lgamma result. */
10208 }
10209 }
10210 }
10213 }
10215 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10216 mpc function FUNC on it and return the resulting value as a tree
10217 with type TYPE. The mpfr precision is set to the precision of
10218 TYPE. We assume that function FUNC returns zero if the result
10219 could be calculated exactly within the requested precision. If
10220 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10221 in the arguments and/or results. */
10223 tree
10226 {
10232 /* To proceed, MPFR must exactly represent the target floating point
10233 format, which only happens when the target base equals two. */
10239 {
10248 {
10268 }
10269 }
10272 }
10274 /* A wrapper function for builtin folding that prevents warnings for
10275 "statement without effect" and the like, caused by removing the
10276 call node earlier than the warning is generated. */
10278 tree
10280 {
10288 {
10297 {
10299 }
10300 else
10301 {
10304 {
10305 /* Propagate location information from original call to
10306 expansion of builtin. Otherwise things like
10307 maybe_emit_chk_warning, that operate on the expansion
10308 of a builtin, will use the wrong location information. */
10310 {
10318 }
10320 }
10321 }
10322 }
10324 }
10326 /* Look up the function in builtin_decl that corresponds to DECL
10327 and set ASMSPEC as its user assembler name. DECL must be a
10328 function decl that declares a builtin. */
10330 void
10332 {
10342 {
10346 }
10347 }
10349 /* Return true if DECL is a builtin that expands to a constant or similarly
10350 simple code. */
10351 bool
10353 {
10356 {
10357 /* Builtins that expand to constants. */
10362 /* Simple register moves or loads from stack. */
10373 /* Exception state returns or moves registers around. */
10381 }
10384 }
10386 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10387 most probably expanded inline into reasonably simple code. This is a
10388 superset of is_simple_builtin. */
10389 bool
10391 {
10398 {
10467 }
10470 }
10472 /* Return true if T is a constant and the value cast to a target char
10473 can be represented by a host char.
10474 Store the casted char constant in *P if so. */
10476 bool
10478 {
10484 }