| blob | ca038cdcc7cc44d8aa30e3ec67114f45b9ed5b22 |
1 /* Expand builtin functions.
2 Copyright (C) 1988-2016 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. */
190 /* Return true if NAME starts with __builtin_ or __sync_. */
192 static bool
194 {
206 }
209 /* Return true if DECL is a function symbol representing a built-in. */
211 bool
213 {
215 }
217 /* Return true if NODE should be considered for inline expansion regardless
218 of the optimization level. This means whenever a function is invoked with
219 its "internal" name, which normally contains the prefix "__builtin". */
221 bool
223 {
224 /* Note that we must use DECL_NAME, not DECL_ASSEMBLER_NAME_SET_P since
225 we want the name used to call the function, not the name it
226 will have. */
229 }
231 /* Compute values M and N such that M divides (address of EXP - N) and such
232 that N < M. If these numbers can be determined, store M in alignp and N in
233 *BITPOSP and return true. Otherwise return false and store BITS_PER_UNIT to
234 *alignp and any bit-offset to *bitposp.
236 Note that the address (and thus the alignment) computed here is based
237 on the address to which a symbol resolves, whereas DECL_ALIGN is based
238 on the address at which an object is actually located. These two
239 addresses are not always the same. For example, on ARM targets,
240 the address &foo of a Thumb function foo() has the lowest bit set,
241 whereas foo() itself starts on an even address.
243 If ADDR_P is true we are taking the address of the memory reference EXP
244 and thus cannot rely on the access taking place. */
246 static bool
249 {
251 tree offset;
252 machine_mode mode;
257 /* Get the innermost object and the constant (bitpos) and possibly
258 variable (offset) offset of the access. */
262 /* Extract alignment information from the innermost object and
263 possibly adjust bitpos and offset. */
265 {
266 /* Function addresses can encode extra information besides their
267 alignment. However, if TARGET_PTRMEMFUNC_VBIT_LOCATION
268 allows the low bit to be used as a virtual bit, we know
269 that the address itself must be at least 2-byte aligned. */
272 }
274 ;
276 {
277 /* The alignment of a CONST_DECL is determined by its initializer. */
284 }
286 {
289 }
293 {
299 /* If the address is explicitely aligned, handle that. */
302 {
307 }
309 known_alignment
313 /* Re-apply explicit alignment to the bitpos. */
316 /* The alignment of the pointer operand in a TARGET_MEM_REF
317 has to take the variable offset parts into account. */
319 {
321 {
326 }
330 }
332 /* When EXP is an actual memory reference then we can use
333 TYPE_ALIGN of a pointer indirection to derive alignment.
334 Do so only if get_pointer_alignment_1 did not reveal absolute
335 alignment knowledge and if using that alignment would
336 improve the situation. */
340 else
341 {
342 /* Else adjust bitpos accordingly. */
347 }
348 }
350 {
351 /* STRING_CST are the only constant objects we allow to be not
352 wrapped inside a CONST_DECL. */
358 }
360 /* If there is a non-constant offset part extract the maximum
361 alignment that can prevail. */
363 {
366 {
370 }
371 }
376 }
378 /* For a memory reference expression EXP compute values M and N such that M
379 divides (&EXP - N) and such that N < M. If these numbers can be determined,
380 store M in alignp and N in *BITPOSP and return true. Otherwise return false
381 and store BITS_PER_UNIT to *alignp and any bit-offset to *bitposp. */
383 bool
386 {
388 }
390 /* Return the alignment in bits of EXP, an object. */
392 unsigned int
394 {
400 /* align and bitpos now specify known low bits of the pointer.
401 ptr & (align - 1) == bitpos. */
406 }
408 /* For a pointer valued expression EXP compute values M and N such that M
409 divides (EXP - N) and such that N < M. If these numbers can be determined,
410 store M in alignp and N in *BITPOSP and return true. Return false if
411 the results are just a conservative approximation.
413 If EXP is not a pointer, false is returned too. */
415 bool
418 {
425 {
432 else
433 {
436 {
440 }
441 }
445 }
448 {
453 {
456 /* Make sure to return a sensible alignment when the multiplication
457 by BITS_PER_UNIT overflowed. */
460 /* We cannot really tell whether this result is an approximation. */
462 }
463 else
464 {
468 }
469 }
471 {
476 }
481 }
483 /* Return the alignment in bits of EXP, a pointer valued expression.
484 The alignment returned is, by default, the alignment of the thing that
485 EXP points to. If it is not a POINTER_TYPE, 0 is returned.
487 Otherwise, look at the expression to see if we can do better, i.e., if the
488 expression is actually pointing at an object whose alignment is tighter. */
490 unsigned int
492 {
498 /* align and bitpos now specify known low bits of the pointer.
499 ptr & (align - 1) == bitpos. */
505 }
507 /* Return the number of non-zero elements in the sequence
508 [ PTR, PTR + MAXELTS ) where each element's size is ELTSIZE bytes.
509 ELTSIZE must be a power of 2 less than 8. Used by c_strlen. */
511 static unsigned
513 {
519 {
520 /* Optimize the common case of plain char. */
522 {
526 }
527 }
528 else
529 {
531 {
535 }
536 }
538 }
540 /* Compute the length of a null-terminated character string or wide
541 character string handling character sizes of 1, 2, and 4 bytes.
542 TREE_STRING_LENGTH is not the right way because it evaluates to
543 the size of the character array in bytes (as opposed to characters)
544 and because it can contain a zero byte in the middle.
546 ONLY_VALUE should be nonzero if the result is not going to be emitted
547 into the instruction stream and zero if it is going to be expanded.
548 E.g. with i++ ? "foo" : "bar", if ONLY_VALUE is nonzero, constant 3
549 is returned, otherwise NULL, since
550 len = c_strlen (src, 1); if (len) expand_expr (len, ...); would not
551 evaluate the side-effects.
553 If ONLY_VALUE is two then we do not emit warnings about out-of-bound
554 accesses. Note that this implies the result is not going to be emitted
555 into the instruction stream.
557 The value returned is of type `ssizetype'.
559 Unfortunately, string_constant can't access the values of const char
560 arrays with initializers, so neither can we do so here. */
562 tree
564 {
568 {
575 }
583 /* Offset from the beginning of the string in bytes. */
584 tree byteoff;
589 /* Determine the size of the string element. */
590 unsigned eltsize
593 /* Set MAXELTS to sizeof (SRC) / sizeof (*SRC) - 1, the maximum possible
594 length of SRC. */
597 /* PTR can point to the byte representation of any string type, including
598 char* and wchar_t*. */
602 {
603 /* If the string has an internal zero byte (e.g., "foo\0bar"), we can't
604 compute the offset to the following null if we don't know where to
605 start searching for it. */
607 {
608 /* Return when an embedded null character is found. */
610 }
612 /* We don't know the starting offset, but we do know that the string
613 has no internal zero bytes. We can assume that the offset falls
614 within the bounds of the string; otherwise, the programmer deserves
615 what he gets. Subtract the offset from the length of the string,
616 and return that. This would perhaps not be valid if we were dealing
617 with named arrays in addition to literal string constants. */
620 }
622 /* Offset from the beginning of the string in elements. */
623 HOST_WIDE_INT eltoff;
625 /* We have a known offset into the string. Start searching there for
626 a null character if we can represent it as a single HOST_WIDE_INT. */
631 else
634 /* If the offset is known to be out of bounds, warn, and call strlen at
635 runtime. */
637 {
638 /* Suppress multiple warnings for propagated constant strings. */
641 {
643 eltoff);
645 }
647 }
649 /* Use strlen to search for the first zero byte. Since any strings
650 constructed with build_string will have nulls appended, we win even
651 if we get handed something like (char[4])"abcd".
653 Since ELTOFF is our starting index into the string, no further
654 calculation is needed. */
659 }
661 /* Return a constant integer corresponding to target reading
662 GET_MODE_BITSIZE (MODE) bits from string constant STR. */
664 static rtx
666 {
667 HOST_WIDE_INT ch;
681 {
693 }
697 }
699 /* Cast a target constant CST to target CHAR and if that value fits into
700 host char type, return zero and put that value into variable pointed to by
701 P. */
703 static int
705 {
712 /* Do not care if it fits or not right here. */
727 }
729 /* Similar to save_expr, but assumes that arbitrary code is not executed
730 in between the multiple evaluations. In particular, we assume that a
731 non-addressable local variable will not be modified. */
733 static tree
735 {
743 }
745 /* Given TEM, a pointer to a stack frame, follow the dynamic chain COUNT
746 times to get the address of either a higher stack frame, or a return
747 address located within it (depending on FNDECL_CODE). */
749 static rtx
751 {
755 {
756 /* For a zero count with __builtin_return_address, we don't care what
757 frame address we return, because target-specific definitions will
758 override us. Therefore frame pointer elimination is OK, and using
759 the soft frame pointer is OK.
761 For a nonzero count, or a zero count with __builtin_frame_address,
762 we require a stable offset from the current frame pointer to the
763 previous one, so we must use the hard frame pointer, and
764 we must disable frame pointer elimination. */
767 else
768 {
771 /* Tell reload not to eliminate the frame pointer. */
773 }
774 }
779 /* On the SPARC, the return address is not in the frame, it is in a
780 register. There is no way to access it off of the current frame
781 pointer, but it can be accessed off the previous frame pointer by
782 reading the value from the register window save area. */
784 count--;
786 /* Scan back COUNT frames to the specified frame. */
788 {
789 /* Assume the dynamic chain pointer is in the word that the
790 frame address points to, unless otherwise specified. */
795 }
797 /* For __builtin_frame_address, return what we've got. But, on
798 the SPARC for example, we may have to add a bias. */
802 /* For __builtin_return_address, get the return address from that frame. */
803 #ifdef RETURN_ADDR_RTX
805 #else
809 #endif
811 }
813 /* Alias set used for setjmp buffer. */
816 /* Construct the leading half of a __builtin_setjmp call. Control will
817 return to RECEIVER_LABEL. This is also called directly by the SJLJ
818 exception handling code. */
820 void
822 {
824 rtx stack_save;
825 rtx mem;
834 /* We store the frame pointer and the address of receiver_label in
835 the buffer and use the rest of it for the stack save area, which
836 is machine-dependent. */
855 /* If there is further processing to do, do it. */
859 /* We have a nonlocal label. */
861 }
863 /* Construct the trailing part of a __builtin_setjmp call. This is
864 also called directly by the SJLJ exception handling code.
865 If RECEIVER_LABEL is NULL, instead contruct a nonlocal goto handler. */
867 void
869 {
870 rtx chain;
872 /* Mark the FP as used when we get here, so we have to make sure it's
873 marked as used by this function. */
876 /* Mark the static chain as clobbered here so life information
877 doesn't get messed up for it. */
882 /* Now put in the code to restore the frame pointer, and argument
883 pointer, if needed. */
885 {
886 /* First adjust our frame pointer to its actual value. It was
887 previously set to the start of the virtual area corresponding to
888 the stacked variables when we branched here and now needs to be
889 adjusted to the actual hardware fp value.
891 Assignments to virtual registers are converted by
892 instantiate_virtual_regs into the corresponding assignment
893 to the underlying register (fp in this case) that makes
894 the original assignment true.
895 So the following insn will actually be decrementing fp by
896 STARTING_FRAME_OFFSET. */
899 /* Restoring the frame pointer also modifies the hard frame pointer.
900 Mark it used (so that the previous assignment remains live once
901 the frame pointer is eliminated) and clobbered (to represent the
902 implicit update from the assignment). */
905 }
908 {
909 /* If the argument pointer can be eliminated in favor of the
910 frame pointer, we don't need to restore it. We assume here
911 that if such an elimination is present, it can always be used.
912 This is the case on all known machines; if we don't make this
913 assumption, we do unnecessary saving on many machines. */
923 {
924 /* Now restore our arg pointer from the address at which it
925 was saved in our stack frame. */
928 }
929 }
935 else
938 /* We must not allow the code we just generated to be reordered by
939 scheduling. Specifically, the update of the frame pointer must
940 happen immediately, not later. */
942 }
944 /* __builtin_longjmp is passed a pointer to an array of five words (not
945 all will be used on all machines). It operates similarly to the C
946 library function of the same name, but is more efficient. Much of
947 the code below is copied from the handling of non-local gotos. */
949 static void
951 {
956 /* DRAP is needed for stack realign if longjmp is expanded to current
957 function */
968 /* We require that the user must pass a second argument of 1, because
969 that is what builtin_setjmp will return. */
975 else
976 {
987 /* Pick up FP, label, and SP from the block and jump. This code is
988 from expand_goto in stmt.c; see there for detailed comments. */
990 /* We have to pass a value to the nonlocal_goto pattern that will
991 get copied into the static_chain pointer, but it does not matter
992 what that value is, because builtin_setjmp does not use it. */
994 else
995 {
1007 }
1008 }
1010 /* Search backwards and mark the jump insn as a non-local goto.
1011 Note that this precludes the use of __builtin_longjmp to a
1012 __builtin_setjmp target in the same function. However, we've
1013 already cautioned the user that these functions are for
1014 internal exception handling use only. */
1016 {
1020 {
1023 }
1026 }
1027 }
1031 {
1033 }
1035 /* This function validates the types of a function call argument list
1036 against a specified list of tree_codes. If the last specifier is a 0,
1037 that represents an ellipsis, otherwise the last specifier must be a
1038 VOID_TYPE. */
1040 static bool
1042 {
1046 const_call_expr_arg_iterator iter;
1047 const_tree arg;
1052 /* Get a bitmap of pointer argument numbers declared attribute nonnull. */
1056 {
1061 {
1063 /* This signifies an ellipses, any further arguments are all ok. */
1067 /* This signifies an endlink, if no arguments remain, return
1068 true, otherwise return false. */
1072 /* The actual argument must be nonnull when either the whole
1073 called function has been declared nonnull, or when the formal
1074 argument corresponding to the actual argument has been. */
1077 /* FALLTHRU */
1079 /* If no parameters remain or the parameter's code does not
1080 match the specified code, return false. Otherwise continue
1081 checking any remaining arguments. */
1086 }
1087 }
1089 /* We need gotos here since we can only have one VA_CLOSE in a
1090 function. */
1091 end: ;
1097 }
1099 /* Expand a call to __builtin_nonlocal_goto. We're passed the target label
1100 and the address of the save area. */
1102 static rtx
1104 {
1119 /* Copy the address of the save location to a register just in case it was
1120 based on the frame pointer. */
1129 /* ??? We no longer need to pass the static chain value, afaik. */
1132 else
1133 {
1139 /* Restore frame pointer for containing function. */
1143 /* USE of hard_frame_pointer_rtx added for consistency;
1144 not clear if really needed. */
1148 /* If the architecture is using a GP register, we must
1149 conservatively assume that the target function makes use of it.
1150 The prologue of functions with nonlocal gotos must therefore
1151 initialize the GP register to the appropriate value, and we
1152 must then make sure that this value is live at the point
1153 of the jump. (Note that this doesn't necessarily apply
1154 to targets with a nonlocal_goto pattern; they are free
1155 to implement it in their own way. Note also that this is
1156 a no-op if the GP register is a global invariant.) */
1162 }
1164 /* Search backwards to the jump insn and mark it as a
1165 non-local goto. */
1167 {
1169 {
1172 }
1175 }
1178 }
1180 /* __builtin_update_setjmp_buf is passed a pointer to an array of five words
1181 (not all will be used on all machines) that was passed to __builtin_setjmp.
1182 It updates the stack pointer in that block to the current value. This is
1183 also called directly by the SJLJ exception handling code. */
1185 void
1187 {
1189 rtx stack_save
1191 memory_address
1197 }
1199 /* Expand a call to __builtin_prefetch. For a target that does not support
1200 data prefetch, evaluate the memory address argument in case it has side
1201 effects. */
1203 static void
1205 {
1215 /* Arguments 1 and 2 are optional; argument 1 (read/write) defaults to
1216 zero (read) and argument 2 (locality) defaults to 3 (high degree of
1217 locality). */
1221 else
1225 else
1228 /* Argument 0 is an address. */
1231 /* Argument 1 (read/write flag) must be a compile-time constant int. */
1233 {
1236 }
1238 /* Argument 1 must be either zero or one. */
1240 {
1244 }
1246 /* Argument 2 (locality) must be a compile-time constant int. */
1248 {
1251 }
1253 /* Argument 2 must be 0, 1, 2, or 3. */
1255 {
1258 }
1261 {
1269 }
1271 /* Don't do anything with direct references to volatile memory, but
1272 generate code to handle other side effects. */
1275 }
1277 /* Get a MEM rtx for expression EXP which is the address of an operand
1278 to be used in a string instruction (cmpstrsi, movmemsi, ..). LEN is
1279 the maximum length of the block of memory that might be accessed or
1280 NULL if unknown. */
1282 static rtx
1284 {
1288 /* When EXP is not resolved SAVE_EXPR, MEM_ATTRS can be still derived
1289 from its expression, for expr->a.b only <variable>.a.b is recorded. */
1296 /* Get an expression we can use to find the attributes to assign to MEM.
1297 First remove any nops. */
1302 /* Build a MEM_REF representing the whole accessed area as a byte blob,
1303 (as builtin stringops may alias with anything). */
1310 /* If the MEM_REF has no acceptable address, try to get the base object
1311 from the original address we got, and build an all-aliasing
1312 unknown-sized access to that one. */
1318 {
1323 size_zero_node,
1324 NULL)),
1327 }
1330 }
1331 \f
1332 /* Built-in functions to perform an untyped call and return. */
1334 #define apply_args_mode \
1335 (this_target_builtins->x_apply_args_mode)
1336 #define apply_result_mode \
1337 (this_target_builtins->x_apply_result_mode)
1339 /* Return the size required for the block returned by __builtin_apply_args,
1340 and initialize apply_args_mode. */
1342 static int
1344 {
1348 machine_mode mode;
1350 /* The values computed by this function never change. */
1352 {
1353 /* The first value is the incoming arg-pointer. */
1356 /* The second value is the structure value address unless this is
1357 passed as an "invisible" first argument. */
1363 {
1373 }
1374 else
1375 {
1377 }
1378 }
1380 }
1382 /* Return the size required for the block returned by __builtin_apply,
1383 and initialize apply_result_mode. */
1385 static int
1387 {
1390 machine_mode mode;
1392 /* The values computed by this function never change. */
1394 {
1399 {
1409 }
1410 else
1413 /* Allow targets that use untyped_call and untyped_return to override
1414 the size so that machine-specific information can be stored here. */
1415 #ifdef APPLY_RESULT_SIZE
1417 #endif
1418 }
1420 }
1422 /* Create a vector describing the result block RESULT. If SAVEP is true,
1423 the result block is used to save the values; otherwise it is used to
1424 restore the values. */
1426 static rtx
1428 {
1430 machine_mode mode;
1437 {
1447 }
1449 }
1451 /* Save the state required to perform an untyped call with the same
1452 arguments as were passed to the current function. */
1454 static rtx
1456 {
1459 machine_mode mode;
1460 rtx struct_incoming_value = targetm.calls.struct_value_rtx (cfun ? TREE_TYPE (cfun->decl) : 0, 1);
1462 /* Create a block where the arg-pointer, structure value address,
1463 and argument registers can be saved. */
1466 /* Walk past the arg-pointer and structure value address. */
1471 /* Save each register used in calling a function to the block. */
1474 {
1483 }
1485 /* Save the arg pointer to the block. */
1487 /* We need the pointer as the caller actually passed them to us, not
1488 as we might have pretended they were passed. Make sure it's a valid
1489 operand, as emit_move_insn isn't expected to handle a PLUS. */
1491 tem
1494 NULL_RTX);
1499 /* Save the structure value address unless this is passed as an
1500 "invisible" first argument. */
1502 {
1506 }
1508 /* Return the address of the block. */
1510 }
1512 /* __builtin_apply_args returns block of memory allocated on
1513 the stack into which is stored the arg pointer, structure
1514 value address, static chain, and all the registers that might
1515 possibly be used in performing a function call. The code is
1516 moved to the start of the function so the incoming values are
1517 saved. */
1519 static rtx
1521 {
1522 /* Don't do __builtin_apply_args more than once in a function.
1523 Save the result of the first call and reuse it. */
1526 {
1527 /* When this function is called, it means that registers must be
1528 saved on entry to this function. So we migrate the
1529 call to the first insn of this function. */
1530 rtx temp;
1539 /* Put the insns after the NOTE that starts the function.
1540 If this is inside a start_sequence, make the outer-level insn
1541 chain current, so the code is placed at the start of the
1542 function. If internal_arg_pointer is a non-virtual pseudo,
1543 it needs to be placed after the function that initializes
1544 that pseudo. */
1549 else
1553 }
1554 }
1556 /* Perform an untyped call and save the state required to perform an
1557 untyped return of whatever value was returned by the given function. */
1559 static rtx
1561 {
1563 machine_mode mode;
1572 /* Create a block where the return registers can be saved. */
1575 /* Fetch the arg pointer from the ARGUMENTS block. */
1582 /* Push a new argument block and copy the arguments. Do not allow
1583 the (potential) memcpy call below to interfere with our stack
1584 manipulations. */
1586 NO_DEFER_POP;
1588 /* Save the stack with nonlocal if available. */
1591 else
1594 /* Allocate a block of memory onto the stack and copy the memory
1595 arguments to the outgoing arguments address. We can pass TRUE
1596 as the 4th argument because we just saved the stack pointer
1597 and will restore it right after the call. */
1600 /* Set DRAP flag to true, even though allocate_dynamic_stack_space
1601 may have already set current_function_calls_alloca to true.
1602 current_function_calls_alloca won't be set if argsize is zero,
1603 so we have to guarantee need_drap is true here. */
1609 {
1612 else
1614 }
1621 /* Refer to the argument block. */
1626 /* Walk past the arg-pointer and structure value address. */
1631 /* Restore each of the registers previously saved. Make USE insns
1632 for each of these registers for use in making the call. */
1635 {
1643 }
1645 /* Restore the structure value address unless this is passed as an
1646 "invisible" first argument. */
1649 {
1656 }
1658 /* All arguments and registers used for the call are set up by now! */
1661 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
1662 and we don't want to load it into a register as an optimization,
1663 because prepare_call_address already did it if it should be done. */
1667 /* Generate the actual call instruction and save the return value. */
1669 {
1673 }
1675 {
1678 /* Locate the unique return register. It is not possible to
1679 express a call that sets more than one return register using
1680 call_value; use untyped_call for that. In fact, untyped_call
1681 only needs to save the return registers in the given block. */
1684 {
1688 }
1695 }
1696 else
1699 /* Find the CALL insn we just emitted, and attach the register usage
1700 information. */
1704 /* Restore the stack. */
1707 else
1711 OK_DEFER_POP;
1713 /* Return the address of the result block. */
1716 }
1718 /* Perform an untyped return. */
1720 static void
1722 {
1724 machine_mode mode;
1725 rtx reg;
1734 {
1739 }
1741 /* Restore the return value and note that each value is used. */
1745 {
1757 }
1759 /* Put the USE insns before the return. */
1762 /* Return whatever values was restored by jumping directly to the end
1763 of the function. */
1765 }
1767 /* Used by expand_builtin_classify_type and fold_builtin_classify_type. */
1769 static enum type_class
1771 {
1773 {
1792 }
1793 }
1795 /* Expand a call EXP to __builtin_classify_type. */
1797 static rtx
1799 {
1803 }
1805 /* This helper macro, meant to be used in mathfn_built_in below,
1806 determines which among a set of three builtin math functions is
1807 appropriate for a given type mode. The `F' and `L' cases are
1808 automatically generated from the `double' case. */
1809 #define CASE_MATHFN(MATHFN) \
1810 CASE_CFN_##MATHFN: \
1811 fcode = BUILT_IN_##MATHFN; fcodef = BUILT_IN_##MATHFN##F ; \
1812 fcodel = BUILT_IN_##MATHFN##L ; break;
1813 /* Similar to above, but appends _R after any F/L suffix. */
1814 #define CASE_MATHFN_REENT(MATHFN) \
1815 case CFN_BUILT_IN_##MATHFN##_R: \
1816 case CFN_BUILT_IN_##MATHFN##F_R: \
1817 case CFN_BUILT_IN_##MATHFN##L_R: \
1818 fcode = BUILT_IN_##MATHFN##_R; fcodef = BUILT_IN_##MATHFN##F_R ; \
1819 fcodel = BUILT_IN_##MATHFN##L_R ; break;
1821 /* Return a function equivalent to FN but operating on floating-point
1822 values of type TYPE, or END_BUILTINS if no such function exists.
1823 This is purely an operation on function codes; it does not guarantee
1824 that the target actually has an implementation of the function. */
1826 static built_in_function
1828 {
1832 {
1923 }
1931 else
1933 }
1935 /* Return mathematic function equivalent to FN but operating directly on TYPE,
1936 if available. If IMPLICIT_P is true use the implicit builtin declaration,
1937 otherwise use the explicit declaration. If we can't do the conversion,
1938 return null. */
1940 static tree
1942 {
1951 }
1953 /* Like mathfn_built_in_1, but always use the implicit array. */
1955 tree
1957 {
1959 }
1961 /* Like mathfn_built_in_1, but take a built_in_function and
1962 always use the implicit array. */
1964 tree
1966 {
1968 }
1970 /* If BUILT_IN_NORMAL function FNDECL has an associated internal function,
1971 return its code, otherwise return IFN_LAST. Note that this function
1972 only tests whether the function is defined in internals.def, not whether
1973 it is actually available on the target. */
1975 internal_fn
1977 {
1981 {
1982 #define DEF_INTERNAL_FLT_FN(NAME, FLAGS, OPTAB, TYPE) \
1983 CASE_FLT_FN (BUILT_IN_##NAME): return IFN_##NAME;
1984 #define DEF_INTERNAL_INT_FN(NAME, FLAGS, OPTAB, TYPE) \
1985 CASE_INT_FN (BUILT_IN_##NAME): return IFN_##NAME;
2002 }
2003 }
2005 /* If CALL is a call to a BUILT_IN_NORMAL function that could be replaced
2006 on the current target by a call to an internal function, return the
2007 code of that internal function, otherwise return IFN_LAST. The caller
2008 is responsible for ensuring that any side-effects of the built-in
2009 call are dealt with correctly. E.g. if CALL sets errno, the caller
2010 must decide that the errno result isn't needed or make it available
2011 in some other way. */
2013 internal_fn
2015 {
2017 {
2020 {
2025 }
2026 }
2028 }
2030 /* Expand a call to the builtin trinary math functions (fma).
2031 Return NULL_RTX if a normal call should be emitted rather than expanding the
2032 function in-line. EXP is the expression that is a call to the builtin
2033 function; if convenient, the result should be placed in TARGET.
2034 SUBTARGET may be used as the target for computing one of EXP's
2035 operands. */
2037 static rtx
2039 {
2040 optab builtin_optab;
2045 machine_mode mode;
2055 {
2060 }
2062 /* Make a suitable register to place result in. */
2065 /* Before working hard, check whether the instruction is available. */
2071 /* Always stabilize the argument list. */
2082 /* Compute into RESULT.
2083 Set RESULT to wherever the result comes back. */
2087 /* If we were unable to expand via the builtin, stop the sequence
2088 (without outputting the insns) and call to the library function
2089 with the stabilized argument list. */
2091 {
2094 }
2096 /* Output the entire sequence. */
2102 }
2104 /* Expand a call to the builtin sin and cos math functions.
2105 Return NULL_RTX if a normal call should be emitted rather than expanding the
2106 function in-line. EXP is the expression that is a call to the builtin
2107 function; if convenient, the result should be placed in TARGET.
2108 SUBTARGET may be used as the target for computing one of EXP's
2109 operands. */
2111 static rtx
2113 {
2114 optab builtin_optab;
2115 rtx op0;
2118 machine_mode mode;
2119 tree arg;
2127 {
2133 }
2135 /* Make a suitable register to place result in. */
2138 /* Check if sincos insn is available, otherwise fallback
2139 to sin or cos insn. */
2142 {
2149 }
2151 /* Before working hard, check whether the instruction is available. */
2153 {
2156 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2157 need to expand the argument again. This way, we will not perform
2158 side-effects more the once. */
2165 /* Compute into RESULT.
2166 Set RESULT to wherever the result comes back. */
2168 {
2172 {
2181 }
2183 }
2184 else
2188 {
2189 /* Output the entire sequence. */
2194 }
2196 /* If we were unable to expand via the builtin, stop the sequence
2197 (without outputting the insns) and call to the library function
2198 with the stabilized argument list. */
2200 }
2203 }
2205 /* Given an interclass math builtin decl FNDECL and it's argument ARG
2206 return an RTL instruction code that implements the functionality.
2207 If that isn't possible or available return CODE_FOR_nothing. */
2209 static enum insn_code
2211 {
2214 machine_mode mode;
2217 {
2231 /* These builtins have no optabs (yet). */
2235 }
2237 /* There's no easy way to detect the case we need to set EDOM. */
2241 /* Optab mode depends on the mode of the input argument. */
2247 }
2249 /* Expand a call to one of the builtin math functions that operate on
2250 floating point argument and output an integer result (ilogb, isinf,
2251 isnan, etc).
2252 Return 0 if a normal call should be emitted rather than expanding the
2253 function in-line. EXP is the expression that is a call to the builtin
2254 function; if convenient, the result should be placed in TARGET. */
2256 static rtx
2258 {
2260 rtx op0;
2262 machine_mode mode;
2263 tree arg;
2273 {
2278 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2279 need to expand the argument again. This way, we will not perform
2280 side-effects more the once. */
2295 }
2298 }
2300 /* Expand a call to the builtin sincos math function.
2301 Return NULL_RTX if a normal call should be emitted rather than expanding the
2302 function in-line. EXP is the expression that is a call to the builtin
2303 function. */
2305 static rtx
2307 {
2309 machine_mode mode;
2323 /* Make a suitable register to place result in. */
2326 /* Check if sincos insn is available, otherwise emit the call. */
2341 /* Compute into target1 and target2.
2342 Set TARGET to wherever the result comes back. */
2346 /* Move target1 and target2 to the memory locations indicated
2347 by op1 and op2. */
2352 }
2354 /* Expand a call to the internal cexpi builtin to the sincos math function.
2355 EXP is the expression that is a call to the builtin function; if convenient,
2356 the result should be placed in TARGET. */
2358 static rtx
2360 {
2363 machine_mode mode;
2374 /* Try expanding via a sincos optab, fall back to emitting a libcall
2375 to sincos or cexp. We are sure we have sincos or cexp because cexpi
2376 is only generated from sincos, cexp or if we have either of them. */
2378 {
2384 /* Compute into op1 and op2. */
2386 }
2388 {
2399 else
2409 /* Make sure not to fold the sincos call again. */
2413 }
2414 else
2415 {
2425 else
2428 /* If we don't have a decl for cexp create one. This is the
2429 friendliest fallback if the user calls __builtin_cexpi
2430 without full target C99 function support. */
2432 {
2433 tree fntype;
2445 }
2450 /* Make sure not to fold the cexp call again. */
2454 }
2456 /* Now build the proper return type. */
2461 }
2463 /* Conveniently construct a function call expression. FNDECL names the
2464 function to be called, N is the number of arguments, and the "..."
2465 parameters are the argument expressions. Unlike build_call_exr
2466 this doesn't fold the call, hence it will always return a CALL_EXPR. */
2468 static tree
2470 {
2480 }
2482 /* Expand a call to one of the builtin rounding functions gcc defines
2483 as an extension (lfloor and lceil). As these are gcc extensions we
2484 do not need to worry about setting errno to EDOM.
2485 If expanding via optab fails, lower expression to (int)(floor(x)).
2486 EXP is the expression that is a call to the builtin function;
2487 if convenient, the result should be placed in TARGET. */
2489 static rtx
2491 {
2492 convert_optab builtin_optab;
2497 tree fallback_fndecl;
2498 machine_mode mode;
2499 tree arg;
2507 {
2524 }
2526 /* Make a suitable register to place result in. */
2531 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2532 need to expand the argument again. This way, we will not perform
2533 side-effects more the once. */
2540 /* Compute into TARGET. */
2542 {
2543 /* Output the entire sequence. */
2548 }
2550 /* If we were unable to expand via the builtin, stop the sequence
2551 (without outputting the insns). */
2554 /* Fall back to floating point rounding optab. */
2557 /* For non-C99 targets we may end up without a fallback fndecl here
2558 if the user called __builtin_lfloor directly. In this case emit
2559 a call to the floor/ceil variants nevertheless. This should result
2560 in the best user experience for not full C99 targets. */
2562 {
2563 tree fntype;
2567 {
2600 }
2605 }
2612 /* Truncate the result of floating point optab to integer
2613 via expand_fix (). */
2618 }
2620 /* Expand a call to one of the builtin math functions doing integer
2621 conversion (lrint).
2622 Return 0 if a normal call should be emitted rather than expanding the
2623 function in-line. EXP is the expression that is a call to the builtin
2624 function; if convenient, the result should be placed in TARGET. */
2626 static rtx
2628 {
2629 convert_optab builtin_optab;
2630 rtx op0;
2633 tree arg;
2634 machine_mode mode;
2643 {
2662 }
2664 /* There's no easy way to detect the case we need to set EDOM. */
2668 /* Make a suitable register to place result in. */
2671 /* There's no easy way to detect the case we need to set EDOM. */
2673 {
2676 /* Wrap the computation of the argument in a SAVE_EXPR, as we may
2677 need to expand the argument again. This way, we will not perform
2678 side-effects more the once. */
2686 {
2687 /* Output the entire sequence. */
2692 }
2694 /* If we were unable to expand via the builtin, stop the sequence
2695 (without outputting the insns) and call to the library function
2696 with the stabilized argument list. */
2698 }
2701 {
2702 /* Fall back to rounding to long int. Use implicit_p 0 - for non-C99
2703 targets, (int) round (x) should never be transformed into
2704 BUILT_IN_IROUND and if __builtin_iround is called directly, emit
2705 a call to lround in the hope that the target provides at least some
2706 C99 functions. This should result in the best user experience for
2707 not full C99 targets. */
2708 tree fallback_fndecl = mathfn_built_in_1
2717 }
2720 }
2722 /* Expand a call to the powi built-in mathematical function. Return NULL_RTX if
2723 a normal call should be emitted rather than expanding the function
2724 in-line. EXP is the expression that is a call to the builtin
2725 function; if convenient, the result should be placed in TARGET. */
2727 static rtx
2729 {
2732 machine_mode mode;
2733 machine_mode mode2;
2742 /* Emit a libcall to libgcc. */
2744 /* Mode of the 2nd argument must match that of an int. */
2762 }
2764 /* Expand expression EXP which is a call to the strlen builtin. Return
2765 NULL_RTX if we failed the caller should emit a normal call, otherwise
2766 try to get the result in TARGET, if convenient. */
2768 static rtx
2770 machine_mode target_mode)
2771 {
2774 else
2775 {
2777 rtx pat;
2778 tree len;
2780 rtx src_reg;
2786 /* If the length can be computed at compile-time, return it. */
2791 /* If the length can be computed at compile-time and is constant
2792 integer, but there are side-effects in src, evaluate
2793 src for side-effects, then return len.
2794 E.g. x = strlen (i++ ? "xfoo" + 1 : "bar");
2795 can be optimized into: i++; x = 3; */
2798 {
2801 }
2805 /* If SRC is not a pointer type, don't do this operation inline. */
2809 /* Bail out if we can't compute strlen in the right mode. */
2811 {
2817 }
2821 /* Make a place to hold the source address. We will not expand
2822 the actual source until we are sure that the expansion will
2823 not fail -- there are trees that cannot be expanded twice. */
2826 /* Mark the beginning of the strlen sequence so we can emit the
2827 source operand later. */
2837 /* Now that we are assured of success, expand the source. */
2841 {
2842 #ifdef POINTERS_EXTEND_UNSIGNED
2845 POINTERS_EXTEND_UNSIGNED);
2846 #endif
2848 }
2854 else
2857 /* Return the value in the proper mode for this function. */
2862 else
2866 }
2867 }
2869 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
2870 bytes from constant string DATA + OFFSET and return it as target
2871 constant. */
2873 static rtx
2875 machine_mode mode)
2876 {
2884 }
2886 /* LEN specify length of the block of memcpy/memset operation.
2887 Figure out its range and put it into MIN_SIZE/MAX_SIZE.
2888 In some cases we can make very likely guess on max size, then we
2889 set it into PROBABLE_MAX_SIZE. */
2891 static void
2896 {
2898 {
2901 }
2902 else
2903 {
2907 /* Determine bounds from the type. */
2910 else
2915 else
2921 {
2926 }
2928 {
2929 /* Anti range 0...N lets us to determine minimal size to N+1. */
2931 {
2934 }
2935 /* Code like
2937 int n;
2938 if (n < 100)
2939 memcpy (a, b, n)
2941 Produce anti range allowing negative values of N. We still
2942 can use the information and make a guess that N is not negative.
2943 */
2946 }
2947 }
2951 }
2953 /* Helper function to do the actual work for expand_builtin_memcpy. */
2955 static rtx
2957 {
2968 /* If DEST is not a pointer type, call the normal function. */
2972 /* If either SRC is not a pointer type, don't do this
2973 operation in-line. */
2990 /* If SRC is a string constant and block move would be done
2991 by pieces, we can avoid loading the string from memory
2992 and only stored the computed constants. */
2999 {
3001 builtin_memcpy_read_str,
3007 }
3012 /* Copy word part most expediently. */
3020 {
3023 }
3026 }
3028 /* Fill the 2-element RANGE array with the minimum and maximum values
3029 EXP is known to have and return true, otherwise null and return
3030 false. */
3032 static bool
3034 {
3036 {
3039 }
3042 {
3047 {
3048 /* Interpret the bound in the variable's type. */
3052 }
3054 {
3055 /* FIXME: Handle anti-ranges. */
3056 }
3057 }
3062 }
3064 /* Try to verify that the sizes and lengths of the arguments to a string
3065 manipulation function given by EXP are within valid bounds and that
3066 the operation does not lead to buffer overflow. Arguments other than
3067 EXP may be null. When non-null, the arguments have the following
3068 meaning:
3069 SIZE is the user-supplied size argument to the function (such as in
3070 memcpy(d, s, SIZE) or strncpy(d, s, SIZE). It specifies the exact
3071 number of bytes to write.
3072 MAXLEN is the user-supplied bound on the length of the source sequence
3073 (such as in strncat(d, s, N). It specifies the upper limit on the number
3074 of bytes to write.
3075 STR is the source string (such as in strcpy(d, s)) when the epxression
3076 EXP is a string function call (as opposed to a memory call like memcpy).
3077 As an exception, STR can also be an integer denoting the precomputed
3078 length of the source string.
3079 OBJSIZE is the size of the destination object specified by the last
3080 argument to the _chk builtins, typically resulting from the expansion
3081 of __builtin_object_size (such as in __builtin___strcpy_chk(d, s,
3082 OBJSIZE).
3084 When SIZE is null LEN is checked to verify that it doesn't exceed
3085 SIZE_MAX.
3087 If the call is successfully verified as safe from buffer overflow
3088 the function returns true, otherwise false.. */
3090 static bool
3092 {
3093 /* The size of the largest object is half the address space, or
3094 SSIZE_MAX. (This is way too permissive.) */
3099 /* Set to true when the exact number of bytes written by a string
3100 function like strcpy is not known and the only thing that is
3101 known is that it must be at least one (for the terminating nul). */
3104 {
3105 /* STR is normally a pointer to string but as a special case
3106 it can be an integer denoting the length of a string. */
3108 {
3109 /* Try to determine the range of lengths the source string
3110 refers to. If it can be determined add one to it for
3111 the terminating nul. Otherwise, set it to one for
3112 the same reason. */
3117 size_one_node);
3118 else
3119 {
3122 }
3123 }
3124 else
3126 }
3129 {
3130 /* When the only available piece of data is the object size
3131 there is nothing to do. */
3135 /* Otherwise, when the length of the source sequence is known
3136 (as with with strlen), set SIZE to it. */
3138 }
3143 /* The SIZE is exact if it's non-null, constant, and in range of
3144 unsigned HOST_WIDE_INT. */
3151 /* First check the number of bytes to be written against the maximum
3152 object size. */
3154 {
3159 "%K%qD: specified size %wu "
3164 else
3166 "%K%qD: specified size between %wu and %wu "
3173 }
3175 /* Next check the number of bytes to be written against the destination
3176 object size. */
3178 {
3184 {
3191 "%K%qD: writing at least %wu byte into a region "
3204 else
3206 "%K%qD: writing between %wu and %wu bytes "
3207 "into a region of size %wu overflows "
3212 /* Return error when an overflow has been detected. */
3214 }
3215 }
3217 /* Check the maximum length of the source sequence against the size
3218 of the destination object if known, or against the maximum size
3219 of an object. */
3221 {
3225 {
3229 {
3230 /* Warn about crazy big sizes first since that's more
3231 likely to be meaningful than saying that the bound
3232 is greater than the object size if both are big. */
3235 "%K%qD: specified bound %wu "
3240 else
3242 "%K%qD: specified bound between %wu and %wu "
3250 }
3253 {
3256 "%K%qD: specified bound %wu "
3261 else
3263 "%K%qD: specified bound between %wu and %wu "
3270 }
3271 }
3272 }
3275 }
3277 /* Helper to compute the size of the object referenced by the DEST
3278 expression which must of of pointer type, using Object Size type
3279 OSTYPE (only the least significant 2 bits are used). Return
3280 the size of the object if successful or NULL when the size cannot
3281 be determined. */
3285 {
3291 }
3293 /* Helper to determine and check the sizes of the source and the destination
3294 of calls to __builtin_{bzero,memcpy,memset} calls. Use Object Size type-0
3295 regardless of the OPT_Wstringop_overflow_ setting. Returns true on success
3296 (no overflow or invalid sizes), false otherwise. */
3298 static bool
3300 {
3304 /* For functions like memset and memcpy that operate on raw memory
3305 try to determine the size of the largest destination object using
3306 type-0 Object Size regardless of the object size type specified
3307 by the option. */
3312 }
3314 /* Expand a call EXP to the memcpy builtin.
3315 Return NULL_RTX if we failed, the caller should emit a normal call,
3316 otherwise try to get the result in TARGET, if convenient (and in
3317 mode MODE if that's convenient). */
3319 static rtx
3321 {
3333 }
3335 /* Expand an instrumented call EXP to the memcpy builtin.
3336 Return NULL_RTX if we failed, the caller should emit a normal call,
3337 otherwise try to get the result in TARGET, if convenient (and in
3338 mode MODE if that's convenient). */
3340 static rtx
3342 {
3348 else
3349 {
3355 /* Return src bounds with the result. */
3357 {
3361 }
3363 }
3364 }
3366 /* Expand a call EXP to the mempcpy builtin.
3367 Return NULL_RTX if we failed; the caller should emit a normal call,
3368 otherwise try to get the result in TARGET, if convenient (and in
3369 mode MODE if that's convenient). If ENDP is 0 return the
3370 destination pointer, if ENDP is 1 return the end pointer ala
3371 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3372 stpcpy. */
3374 static rtx
3376 {
3385 /* Avoid expanding mempcpy into memcpy when the call is determined
3386 to overflow the buffer. This also prevents the same overflow
3387 from being diagnosed again when expanding memcpy. */
3393 exp);
3394 }
3396 /* Expand an instrumented call EXP to the mempcpy builtin.
3397 Return NULL_RTX if we failed, the caller should emit a normal call,
3398 otherwise try to get the result in TARGET, if convenient (and in
3399 mode MODE if that's convenient). */
3401 static rtx
3403 {
3409 else
3410 {
3417 /* Return src bounds with the result. */
3419 {
3423 }
3425 }
3426 }
3428 /* Helper function to do the actual work for expand_builtin_mempcpy. The
3429 arguments to the builtin_mempcpy call DEST, SRC, and LEN are broken out
3430 so that this can also be called without constructing an actual CALL_EXPR.
3431 The other arguments and return value are the same as for
3432 expand_builtin_mempcpy. */
3434 static rtx
3437 tree orig_exp)
3438 {
3441 /* If return value is ignored, transform mempcpy into memcpy. */
3445 {
3450 }
3453 {
3458 }
3459 else
3460 {
3466 /* If either SRC or DEST is not a pointer type, don't do this
3467 operation in-line. */
3471 /* If LEN is not constant, call the normal function. */
3478 /* If SRC is a string constant and block move would be done
3479 by pieces, we can avoid loading the string from memory
3480 and only stored the computed constants. */
3487 {
3491 builtin_memcpy_read_str,
3497 }
3502 {
3512 }
3515 }
3516 }
3518 /* Expand into a movstr instruction, if one is available. Return NULL_RTX if
3519 we failed, the caller should emit a normal call, otherwise try to
3520 get the result in TARGET, if convenient. If ENDP is 0 return the
3521 destination pointer, if ENDP is 1 return the end pointer ala
3522 mempcpy, and if ENDP is 2 return the end pointer minus one ala
3523 stpcpy. */
3525 static rtx
3527 {
3529 rtx dest_mem;
3530 rtx src_mem;
3538 {
3541 }
3550 {
3552 /* movstr is supposed to set end to the address of the NUL
3553 terminator. If the caller requested a mempcpy-like return value,
3554 adjust it. */
3556 {
3560 }
3561 }
3563 }
3565 /* Do some very basic size validation of a call to the strcpy builtin
3566 given by EXP. Return NULL_RTX to have the built-in expand to a call
3567 to the library function. */
3569 static rtx
3571 {
3579 /* There is no way here to determine the length of the string in
3580 the destination to which the SRC string is being appended so
3581 just diagnose cases when the souce string is longer than
3582 the destination object. */
3590 }
3592 /* Expand expression EXP, which is a call to the strcpy builtin. Return
3593 NULL_RTX if we failed the caller should emit a normal call, otherwise
3594 try to get the result in TARGET, if convenient (and in mode MODE if that's
3595 convenient). */
3597 static rtx
3599 {
3607 {
3611 }
3614 }
3616 /* Helper function to do the actual work for expand_builtin_strcpy. The
3617 arguments to the builtin_strcpy call DEST and SRC are broken out
3618 so that this can also be called without constructing an actual CALL_EXPR.
3619 The other arguments and return value are the same as for
3620 expand_builtin_strcpy. */
3622 static rtx
3624 {
3626 }
3628 /* Expand a call EXP to the stpcpy builtin.
3629 Return NULL_RTX if we failed the caller should emit a normal call,
3630 otherwise try to get the result in TARGET, if convenient (and in
3631 mode MODE if that's convenient). */
3633 static rtx
3635 {
3645 /* If return value is ignored, transform stpcpy into strcpy. */
3647 {
3651 }
3652 else
3653 {
3655 rtx ret;
3657 /* Ensure we get an actual string whose length can be evaluated at
3658 compile-time, not an expression containing a string. This is
3659 because the latter will potentially produce pessimized code
3660 when used to produce the return value. */
3667 exp);
3673 {
3677 {
3681 {
3683 {
3686 else
3688 }
3697 }
3698 }
3699 }
3702 }
3703 }
3705 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3706 bytes from constant string DATA + OFFSET and return it as target
3707 constant. */
3709 rtx
3711 machine_mode mode)
3712 {
3719 }
3721 /* Helper to check the sizes of sequences and the destination of calls
3722 to __builtin_strncat and __builtin___strncat_chk. Returns true on
3723 success (no overflow or invalid sizes), false otherwise. */
3725 static bool
3727 {
3732 /* Try to determine the range of lengths that the source expression
3733 refers to. */
3737 /* Try to verify that the destination is big enough for the shortest
3738 string. */
3741 {
3742 /* If it hasn't been provided by __strncat_chk, try to determine
3743 the size of the destination object into which the source is
3744 being copied. */
3746 }
3748 /* Add one for the terminating nul. */
3751 size_one_node)
3754 /* Strncat copies at most MAXLEN bytes and always appends the terminating
3755 nul so the specified upper bound should never be equal to (or greater
3756 than) the size of the destination. */
3759 {
3761 "specified bound %wu "
3766 }
3774 /* The number of bytes to write is LEN but check_sizes will also
3775 check SRCLEN if LEN's value isn't known. */
3778 }
3780 /* Similar to expand_builtin_strcat, do some very basic size validation
3781 of a call to the strcpy builtin given by EXP. Return NULL_RTX to have
3782 the built-in expand to a call to the library function. */
3784 static rtx
3786 {
3794 /* The upper bound on the number of bytes to write. */
3796 /* The length of the source sequence. */
3799 /* Try to determine the range of lengths that the source expression
3800 refers to. */
3804 else
3807 /* Try to verify that the destination is big enough for the shortest
3808 string. First try to determine the size of the destination object
3809 into which the source is being copied. */
3812 /* Add one for the terminating nul. */
3815 size_one_node)
3818 /* Strncat copies at most MAXLEN bytes and always appends the terminating
3819 nul so the specified upper bound should never be equal to (or greater
3820 than) the size of the destination. */
3823 {
3825 "specified bound %wu "
3830 }
3838 /* The number of bytes to write is LEN but check_sizes will also
3839 check SRCLEN if LEN's value isn't known. */
3844 }
3846 /* Expand expression EXP, which is a call to the strncpy builtin. Return
3847 NULL_RTX if we failed the caller should emit a normal call. */
3849 static rtx
3851 {
3856 {
3859 /* The number of bytes to write (not the maximum). */
3861 /* The length of the source sequence. */
3865 {
3866 /* Try to determine the range of lengths that the source expression
3867 refers to. */
3871 else
3872 {
3875 }
3880 /* The number of bytes to write is LEN but check_sizes will also
3881 check SLEN if LEN's value isn't known. */
3884 }
3886 /* We must be passed a constant len and src parameter. */
3892 /* We're required to pad with trailing zeros if the requested
3893 len is greater than strlen(s2)+1. In that case try to
3894 use store_by_pieces, if it fails, punt. */
3896 {
3899 rtx dest_mem;
3903 builtin_strncpy_read_str,
3910 builtin_strncpy_read_str,
3915 }
3916 }
3918 }
3920 /* Callback routine for store_by_pieces. Read GET_MODE_BITSIZE (MODE)
3921 bytes from constant string DATA + OFFSET and return it as target
3922 constant. */
3924 rtx
3926 machine_mode mode)
3927 {
3934 }
3936 /* Callback routine for store_by_pieces. Return the RTL of a register
3937 containing GET_MODE_SIZE (MODE) consecutive copies of the unsigned
3938 char value given in the RTL register data. For example, if mode is
3939 4 bytes wide, return the RTL for 0x01010101*data. */
3941 static rtx
3943 machine_mode mode)
3944 {
3960 }
3962 /* Expand expression EXP, which is a call to the memset builtin. Return
3963 NULL_RTX if we failed the caller should emit a normal call, otherwise
3964 try to get the result in TARGET, if convenient (and in mode MODE if that's
3965 convenient). */
3967 static rtx
3969 {
3981 }
3983 /* Expand expression EXP, which is an instrumented call to the memset builtin.
3984 Return NULL_RTX if we failed the caller should emit a normal call, otherwise
3985 try to get the result in TARGET, if convenient (and in mode MODE if that's
3986 convenient). */
3988 static rtx
3990 {
3995 else
3996 {
4002 /* Return src bounds with the result. */
4004 {
4008 }
4010 }
4011 }
4013 /* Helper function to do the actual work for expand_builtin_memset. The
4014 arguments to the builtin_memset call DEST, VAL, and LEN are broken out
4015 so that this can also be called without constructing an actual CALL_EXPR.
4016 The other arguments and return value are the same as for
4017 expand_builtin_memset. */
4019 static rtx
4022 {
4025 machine_mode val_mode;
4037 /* If DEST is not a pointer type, don't do this operation in-line. */
4048 /* If the LEN parameter is zero, return DEST. */
4050 {
4051 /* Evaluate and ignore VAL in case it has side-effects. */
4054 }
4056 /* Stabilize the arguments in case we fail. */
4068 {
4069 rtx val_rtx;
4074 /* Assume that we can memset by pieces if we can store
4075 * the coefficients by pieces (in the required modes).
4076 * We can't pass builtin_memset_gen_str as that emits RTL. */
4082 {
4087 }
4091 probable_max_size))
4097 }
4103 {
4114 probable_max_size))
4120 }
4128 probable_max_size);
4131 {
4134 }
4138 do_libcall:
4148 else
4153 }
4155 /* Expand expression EXP, which is a call to the bzero builtin. Return
4156 NULL_RTX if we failed the caller should emit a normal call. */
4158 static rtx
4160 {
4169 /* New argument list transforming bzero(ptr x, int y) to
4170 memset(ptr x, int 0, size_t y). This is done this way
4171 so that if it isn't expanded inline, we fallback to
4172 calling bzero instead of memset. */
4180 }
4182 /* Try to expand cmpstr operation ICODE with the given operands.
4183 Return the result rtx on success, otherwise return null. */
4185 static rtx
4187 HOST_WIDE_INT align)
4188 {
4202 }
4204 /* Expand expression EXP, which is a call to the memcmp built-in function.
4205 Return NULL_RTX if we failed and the caller should emit a normal call,
4206 otherwise try to get the result in TARGET, if convenient.
4207 RESULT_EQ is true if we can relax the returned value to be either zero
4208 or nonzero, without caring about the sign. */
4210 static rtx
4212 {
4226 /* If we don't have POINTER_TYPE, call the function. */
4234 /* Set MEM_SIZE as appropriate. */
4236 {
4239 }
4245 {
4249 }
4251 /* If SRC is a string constant and block move would be done
4252 by pieces, we can avoid loading the string from memory
4253 and only stored the computed constants. */
4265 {
4266 /* Return the value in the proper mode for this function. */
4271 {
4274 }
4277 }
4280 }
4282 /* Expand expression EXP, which is a call to the strcmp builtin. Return NULL_RTX
4283 if we failed the caller should emit a normal call, otherwise try to get
4284 the result in TARGET, if convenient. */
4286 static rtx
4288 {
4295 {
4305 /* If we don't have POINTER_TYPE, call the function. */
4309 /* Stabilize the arguments in case gen_cmpstr(n)si fail. */
4316 /* Try to call cmpstrsi. */
4321 /* Try to determine at least one length and call cmpstrnsi. */
4323 {
4324 tree len;
4325 rtx arg3_rtx;
4335 /* If we don't have a constant length for the first, use the length
4336 of the second, if we know it. We don't require a constant for
4337 this case; some cost analysis could be done if both are available
4338 but neither is constant. For now, assume they're equally cheap,
4339 unless one has side effects. If both strings have constant lengths,
4340 use the smaller. */
4356 else
4359 /* If both arguments have side effects, we cannot optimize. */
4361 {
4363 result = expand_cmpstrn_or_cmpmem
4366 }
4367 }
4370 {
4371 /* Return the value in the proper mode for this function. */
4379 }
4381 /* Expand the library call ourselves using a stabilized argument
4382 list to avoid re-evaluating the function's arguments twice. */
4388 }
4390 }
4392 /* Expand expression EXP, which is a call to the strncmp builtin. Return
4393 NULL_RTX if we failed the caller should emit a normal call, otherwise try to get
4394 the result in TARGET, if convenient. */
4396 static rtx
4398 ATTRIBUTE_UNUSED machine_mode mode)
4399 {
4406 /* If c_strlen can determine an expression for one of the string
4407 lengths, and it doesn't have side effects, then emit cmpstrnsi
4408 using length MIN(strlen(string)+1, arg3). */
4411 {
4414 rtx result;
4433 /* If we don't have a constant length for the first, use the length
4434 of the second, if we know it. If neither string is constant length,
4435 use the given length argument. We don't require a constant for
4436 this case; some cost analysis could be done if both are available
4437 but neither is constant. For now, assume they're equally cheap,
4438 unless one has side effects. If both strings have constant lengths,
4439 use the smaller. */
4457 else
4460 /* If we are not using the given length, we must incorporate it here.
4461 The actual new length parameter will be MIN(len,arg3) in this case. */
4471 {
4472 /* Return the value in the proper mode for this function. */
4480 }
4482 /* Expand the library call ourselves using a stabilized argument
4483 list to avoid re-evaluating the function's arguments twice. */
4490 }
4492 }
4494 /* Expand a call to __builtin_saveregs, generating the result in TARGET,
4495 if that's convenient. */
4497 rtx
4499 {
4500 rtx val;
4503 /* Don't do __builtin_saveregs more than once in a function.
4504 Save the result of the first call and reuse it. */
4508 /* When this function is called, it means that registers must be
4509 saved on entry to this function. So we migrate the call to the
4510 first insn of this function. */
4514 /* Do whatever the machine needs done in this case. */
4522 /* Put the insns after the NOTE that starts the function. If this
4523 is inside a start_sequence, make the outer-level insn chain current, so
4524 the code is placed at the start of the function. */
4530 }
4532 /* Expand a call to __builtin_next_arg. */
4534 static rtx
4536 {
4537 /* Checking arguments is already done in fold_builtin_next_arg
4538 that must be called before this function. */
4543 }
4545 /* Make it easier for the backends by protecting the valist argument
4546 from multiple evaluations. */
4548 static tree
4550 {
4553 /* The current way of determining the type of valist is completely
4554 bogus. We should have the information on the va builtin instead. */
4559 {
4563 /* For this case, the backends will be expecting a pointer to
4564 vatype, but it's possible we've actually been given an array
4565 (an actual TARGET_CANONICAL_VA_LIST_TYPE (valist)).
4566 So fix it. */
4568 {
4571 }
4572 }
4573 else
4574 {
4578 {
4584 }
4590 }
4593 }
4595 /* The "standard" definition of va_list is void*. */
4597 tree
4599 {
4601 }
4603 /* The "standard" abi va_list is va_list_type_node. */
4605 tree
4607 {
4609 }
4611 /* The "standard" type of va_list is va_list_type_node. */
4613 tree
4615 {
4622 {
4623 /* If va_list is an array type, the argument may have decayed
4624 to a pointer type, e.g. by being passed to another function.
4625 In that case, unwrap both types so that we can compare the
4626 underlying records. */
4629 {
4632 }
4633 }
4638 }
4640 /* The "standard" implementation of va_start: just assign `nextarg' to
4641 the variable. */
4643 void
4645 {
4649 /* We do not have any valid bounds for the pointer, so
4650 just store zero bounds for it. */
4654 nextarg));
4655 }
4657 /* Expand EXP, a call to __builtin_va_start. */
4659 static rtx
4661 {
4662 rtx nextarg;
4663 tree valist;
4667 {
4670 }
4680 else
4684 }
4686 /* Expand EXP, a call to __builtin_va_end. */
4688 static rtx
4690 {
4693 /* Evaluate for side effects, if needed. I hate macros that don't
4694 do that. */
4699 }
4701 /* Expand EXP, a call to __builtin_va_copy. We do this as a
4702 builtin rather than just as an assignment in stdarg.h because of the
4703 nastiness of array-type va_list types. */
4705 static rtx
4707 {
4720 {
4724 }
4725 else
4726 {
4729 /* Evaluate to pointers. */
4738 /* "Dereference" to BLKmode memories. */
4746 /* Copy. */
4748 }
4751 }
4753 /* Expand a call to one of the builtin functions __builtin_frame_address or
4754 __builtin_return_address. */
4756 static rtx
4758 {
4759 /* The argument must be a nonnegative integer constant.
4760 It counts the number of frames to scan up the stack.
4761 The value is either the frame pointer value or the return
4762 address saved in that frame. */
4764 /* Warning about missing arg was already issued. */
4767 {
4770 }
4771 else
4772 {
4773 /* Number of frames to scan up the stack. */
4778 /* Some ports cannot access arbitrary stack frames. */
4780 {
4783 }
4786 {
4787 /* Warn since no effort is made to ensure that any frame
4788 beyond the current one exists or can be safely reached. */
4791 }
4793 /* For __builtin_frame_address, return what we've got. */
4801 }
4802 }
4804 /* Expand EXP, a call to the alloca builtin. Return NULL_RTX if we
4805 failed and the caller should emit a normal call. CANNOT_ACCUMULATE
4806 is the same as for allocate_dynamic_stack_space. */
4808 static rtx
4810 {
4811 rtx op0;
4812 rtx result;
4818 bool valid_arglist
4819 = (alloca_with_align
4828 {
4829 /* -Walloca-larger-than and -Wvla-larger-than settings override
4830 the more general -Walloc-size-larger-than so unless either of
4831 the former options is specified check the alloca arguments for
4832 overflow. */
4836 }
4838 /* Compute the argument. */
4841 /* Compute the alignment. */
4842 align = (alloca_with_align
4846 /* Allocate the desired space. */
4851 }
4853 /* Expand a call to bswap builtin in EXP.
4854 Return NULL_RTX if a normal call should be emitted rather than expanding the
4855 function in-line. If convenient, the result should be placed in TARGET.
4856 SUBTARGET may be used as the target for computing one of EXP's operands. */
4858 static rtx
4860 rtx subtarget)
4861 {
4862 tree arg;
4863 rtx op0;
4881 }
4883 /* Expand a call to a unary builtin in EXP.
4884 Return NULL_RTX if a normal call should be emitted rather than expanding the
4885 function in-line. If convenient, the result should be placed in TARGET.
4886 SUBTARGET may be used as the target for computing one of EXP's operands. */
4888 static rtx
4891 {
4892 rtx op0;
4897 /* Compute the argument. */
4899 (subtarget
4903 /* Compute op, into TARGET if possible.
4904 Set TARGET to wherever the result comes back. */
4910 }
4912 /* Expand a call to __builtin_expect. We just return our argument
4913 as the builtin_expect semantic should've been already executed by
4914 tree branch prediction pass. */
4916 static rtx
4918 {
4919 tree arg;
4926 /* When guessing was done, the hints should be already stripped away. */
4930 }
4932 /* Expand a call to __builtin_assume_aligned. We just return our first
4933 argument as the builtin_assume_aligned semantic should've been already
4934 executed by CCP. */
4936 static rtx
4938 {
4942 EXPAND_NORMAL);
4947 }
4949 void
4951 {
4953 {
4955 /* For trap insns when not accumulating outgoing args force
4956 REG_ARGS_SIZE note to prevent crossjumping of calls with
4957 different args sizes. */
4960 }
4961 else
4962 {
4966 }
4969 }
4971 /* Expand a call to __builtin_unreachable. We do nothing except emit
4972 a barrier saying that control flow will not pass here.
4974 It is the responsibility of the program being compiled to ensure
4975 that control flow does never reach __builtin_unreachable. */
4976 static void
4978 {
4980 }
4982 /* Expand EXP, a call to fabs, fabsf or fabsl.
4983 Return NULL_RTX if a normal call should be emitted rather than expanding
4984 the function inline. If convenient, the result should be placed
4985 in TARGET. SUBTARGET may be used as the target for computing
4986 the operand. */
4988 static rtx
4990 {
4991 machine_mode mode;
4992 tree arg;
4993 rtx op0;
5003 }
5005 /* Expand EXP, a call to copysign, copysignf, or copysignl.
5006 Return NULL is a normal call should be emitted rather than expanding the
5007 function inline. If convenient, the result should be placed in TARGET.
5008 SUBTARGET may be used as the target for computing the operand. */
5010 static rtx
5012 {
5014 tree arg;
5026 }
5028 /* Expand a call to __builtin___clear_cache. */
5030 static rtx
5032 {
5034 {
5035 #ifdef CLEAR_INSN_CACHE
5036 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5037 does something. Just do the default expansion to a call to
5038 __clear_cache(). */
5040 #else
5041 /* There is no "clear_cache" insn, and __clear_cache() in libgcc
5042 does nothing. There is no need to call it. Do nothing. */
5045 }
5047 /* We have a "clear_cache" insn, and it will handle everything. */
5051 /* We must not expand to a library call. If we did, any
5052 fallback library function in libgcc that might contain a call to
5053 __builtin___clear_cache() would recurse infinitely. */
5055 {
5058 }
5061 {
5074 }
5076 }
5078 /* Given a trampoline address, make sure it satisfies TRAMPOLINE_ALIGNMENT. */
5080 static rtx
5082 {
5085 /* If we don't need too much alignment, we'll have been guaranteed
5086 proper alignment by get_trampoline_type. */
5090 /* Round address up to desired boundary. */
5101 }
5103 static rtx
5105 {
5121 /* If ONSTACK, the TRAMP argument should be the address of a field
5122 within the local function's FRAME decl. Either way, let's see if
5123 we can fill in the MEM_ATTRs for this memory. */
5127 /* Creator of a heap trampoline is responsible for making sure the
5128 address is aligned to at least STACK_BOUNDARY. Normally malloc
5129 will ensure this anyhow. */
5132 {
5136 }
5138 /* The FUNC argument should be the address of the nested function.
5139 Extract the actual function decl to pass to the hook. */
5146 /* Generate insns to initialize the trampoline. */
5150 {
5156 }
5159 }
5161 static rtx
5163 {
5164 rtx tramp;
5175 }
5177 /* Expand a call to the builtin descriptor initialization routine.
5178 A descriptor is made up of a couple of pointers to the static
5179 chain and the code entry in this order. */
5181 static rtx
5183 {
5188 VOID_TYPE))
5202 /* Generate insns to initialize the descriptor. */
5208 }
5210 /* Expand a call to the builtin descriptor adjustment routine. */
5212 static rtx
5214 {
5215 rtx tramp;
5222 /* Unalign the descriptor to allow runtime identification. */
5227 }
5229 /* Expand the call EXP to the built-in signbit, signbitf or signbitl
5230 function. The function first checks whether the back end provides
5231 an insn to implement signbit for the respective mode. If not, it
5232 checks whether the floating point format of the value is such that
5233 the sign bit can be extracted. If that is not the case, error out.
5234 EXP is the expression that is a call to the builtin function; if
5235 convenient, the result should be placed in TARGET. */
5236 static rtx
5238 {
5241 tree arg;
5244 rtx temp;
5257 /* Expand the argument yielding a RTX expression. */
5260 /* Check if the back end provides an insn that handles signbit for the
5261 argument's mode. */
5264 {
5270 }
5272 /* For floating point formats without a sign bit, implement signbit
5273 as "ARG < 0.0". */
5276 {
5277 /* But we can't do this if the format supports signed zero. */
5283 }
5286 {
5290 }
5291 else
5292 {
5294 /* Handle targets with different FP word orders. */
5297 else
5301 }
5303 /* Force the intermediate word_mode (or narrower) result into a
5304 register. This avoids attempting to create paradoxical SUBREGs
5305 of floating point modes below. */
5308 /* If the bitpos is within the "result mode" lowpart, the operation
5309 can be implement with a single bitwise AND. Otherwise, we need
5310 a right shift and an AND. */
5313 {
5321 }
5322 else
5323 {
5324 /* Perform a logical right shift to place the signbit in the least
5325 significant bit, then truncate the result to the desired mode
5326 and mask just this bit. */
5331 }
5334 }
5336 /* Expand fork or exec calls. TARGET is the desired target of the
5337 call. EXP is the call. FN is the
5338 identificator of the actual function. IGNORE is nonzero if the
5339 value is to be ignored. */
5341 static rtx
5343 {
5345 tree call;
5347 /* If we are not profiling, just call the function. */
5351 /* Otherwise call the wrapper. This should be equivalent for the rest of
5352 compiler, so the code does not diverge, and the wrapper may run the
5353 code necessary for keeping the profiling sane. */
5356 {
5387 }
5399 }
5402 \f
5403 /* Reconstitute a mode for a __sync intrinsic operation. Since the type of
5404 the pointer in these functions is void*, the tree optimizers may remove
5405 casts. The mode computed in expand_builtin isn't reliable either, due
5406 to __sync_bool_compare_and_swap.
5408 FCODE_DIFF should be fcode - base, where base is the FOO_1 code for the
5409 group of builtins. This gives us log2 of the mode size. */
5413 {
5414 /* The size is not negotiable, so ask not to get BLKmode in return
5415 if the target indicates that a smaller size would be better. */
5417 }
5419 /* Expand the memory expression LOC and return the appropriate memory operand
5420 for the builtin_sync operations. */
5422 static rtx
5424 {
5430 /* Note that we explicitly do not want any alias information for this
5431 memory, so that we kill all other live memories. Otherwise we don't
5432 satisfy the full barrier semantics of the intrinsic. */
5435 /* The alignment needs to be at least according to that of the mode. */
5442 }
5444 /* Make sure an argument is in the right mode.
5445 EXP is the tree argument.
5446 MODE is the mode it should be in. */
5448 static rtx
5450 {
5451 rtx val;
5452 machine_mode old_mode;
5455 /* If VAL is promoted to a wider mode, convert it back to MODE. Take care
5456 of CONST_INTs, where we know the old_mode only from the call argument. */
5463 }
5466 /* Expand the __sync_xxx_and_fetch and __sync_fetch_and_xxx intrinsics.
5467 EXP is the CALL_EXPR. CODE is the rtx code
5468 that corresponds to the arithmetic or logical operation from the name;
5469 an exception here is that NOT actually means NAND. TARGET is an optional
5470 place for us to store the results; AFTER is true if this is the
5471 fetch_and_xxx form. */
5473 static rtx
5476 rtx target)
5477 {
5482 {
5489 {
5518 }
5519 }
5521 /* Expand the operands. */
5526 after);
5527 }
5529 /* Expand the __sync_val_compare_and_swap and __sync_bool_compare_and_swap
5530 intrinsics. EXP is the CALL_EXPR. IS_BOOL is
5531 true if this is the boolean form. TARGET is a place for us to store the
5532 results; this is NOT optional if IS_BOOL is true. */
5534 static rtx
5537 {
5541 /* Expand the operands. */
5548 {
5551 else
5553 }
5556 MEMMODEL_SYNC_SEQ_CST))
5560 }
5562 /* Expand the __sync_lock_test_and_set intrinsic. Note that the most
5563 general form is actually an atomic exchange, and some targets only
5564 support a reduced form with the second argument being a constant 1.
5565 EXP is the CALL_EXPR; TARGET is an optional place for us to store
5566 the results. */
5568 static rtx
5570 rtx target)
5571 {
5574 /* Expand the operands. */
5579 }
5581 /* Expand the __sync_lock_release intrinsic. EXP is the CALL_EXPR. */
5583 static void
5585 {
5586 rtx mem;
5588 /* Expand the operands. */
5592 }
5594 /* Given an integer representing an ``enum memmodel'', verify its
5595 correctness and return the memory model enum. */
5597 static enum memmodel
5599 {
5600 rtx op;
5602 source_location loc
5605 /* If the parameter is not a constant, it's a run time value so we'll just
5606 convert it to MEMMODEL_SEQ_CST to avoid annoying runtime checking. */
5616 {
5620 }
5622 /* Should never see a user explicit SYNC memodel model, so >= LAST works. */
5624 {
5628 }
5630 /* Workaround for Bugzilla 59448. GCC doesn't track consume properly, so
5631 be conservative and promote consume to acquire. */
5636 }
5638 /* Expand the __atomic_exchange intrinsic:
5639 TYPE __atomic_exchange (TYPE *object, TYPE desired, enum memmodel)
5640 EXP is the CALL_EXPR.
5641 TARGET is an optional place for us to store the results. */
5643 static rtx
5645 {
5654 /* Expand the operands. */
5659 }
5661 /* Expand the __atomic_compare_exchange intrinsic:
5662 bool __atomic_compare_exchange (TYPE *object, TYPE *expect,
5663 TYPE desired, BOOL weak,
5664 enum memmodel success,
5665 enum memmodel failure)
5666 EXP is the CALL_EXPR.
5667 TARGET is an optional place for us to store the results. */
5669 static rtx
5671 rtx target)
5672 {
5676 tree weak;
5678 source_location loc
5685 {
5687 "failure memory model cannot be stronger than success "
5690 }
5693 {
5695 "invalid failure memory model for "
5699 }
5705 /* Expand the operands. */
5721 /* Lest the rtl backend create a race condition with an imporoper store
5722 to memory, always create a new pseudo for OLDVAL. */
5729 /* Conditionally store back to EXPECT, lest we create a race condition
5730 with an improper store to memory. */
5731 /* ??? With a rearrangement of atomics at the gimple level, we can handle
5732 the normal case where EXPECT is totally private, i.e. a register. At
5733 which point the store can be unconditional. */
5741 }
5743 /* Helper function for expand_ifn_atomic_compare_exchange - expand
5744 internal ATOMIC_COMPARE_EXCHANGE call into __atomic_compare_exchange_N
5745 call. The weak parameter must be dropped to match the expected parameter
5746 list and the expected argument changed from value to pointer to memory
5747 slot. */
5749 static void
5751 {
5767 /* Skip the boolean weak parameter. */
5770 built_in_function fncode
5775 fndecl);
5780 {
5787 }
5788 }
5790 /* Expand IFN_ATOMIC_COMPARE_EXCHANGE internal function. */
5792 void
5794 {
5800 tree lhs;
5802 source_location loc
5809 {
5811 "failure memory model cannot be stronger than success "
5814 }
5817 {
5819 "invalid failure memory model for "
5823 }
5826 {
5829 }
5831 /* Expand the operands. */
5844 {
5847 }
5851 {
5857 }
5858 }
5860 /* Expand the __atomic_load intrinsic:
5861 TYPE __atomic_load (TYPE *object, enum memmodel)
5862 EXP is the CALL_EXPR.
5863 TARGET is an optional place for us to store the results. */
5865 static rtx
5867 {
5868 rtx mem;
5873 {
5874 source_location loc
5879 }
5884 /* Expand the operand. */
5888 }
5891 /* Expand the __atomic_store intrinsic:
5892 void __atomic_store (TYPE *object, TYPE desired, enum memmodel)
5893 EXP is the CALL_EXPR.
5894 TARGET is an optional place for us to store the results. */
5896 static rtx
5898 {
5905 {
5906 source_location loc
5911 }
5916 /* Expand the operands. */
5921 }
5923 /* Expand the __atomic_fetch_XXX intrinsic:
5924 TYPE __atomic_fetch_XXX (TYPE *object, TYPE val, enum memmodel)
5925 EXP is the CALL_EXPR.
5926 TARGET is an optional place for us to store the results.
5927 CODE is the operation, PLUS, MINUS, ADD, XOR, or IOR.
5928 FETCH_AFTER is true if returning the result of the operation.
5929 FETCH_AFTER is false if returning the value before the operation.
5930 IGNORE is true if the result is not used.
5931 EXT_CALL is the correct builtin for an external call if this cannot be
5932 resolved to an instruction sequence. */
5934 static rtx
5938 {
5941 tree fndecl;
5942 tree addr;
5946 /* Expand the operands. */
5950 /* Only try generating instructions if inlining is turned on. */
5952 {
5956 }
5958 /* Return if a different routine isn't needed for the library call. */
5962 /* Change the call to the specified function. */
5970 /* Expand the call here so we can emit trailing code. */
5973 /* Replace the original function just in case it matters. */
5976 /* Then issue the arithmetic correction to return the right result. */
5978 {
5980 {
5982 OPTAB_LIB_WIDEN);
5984 }
5985 else
5987 OPTAB_LIB_WIDEN);
5988 }
5990 }
5992 /* Expand IFN_ATOMIC_BIT_TEST_AND_* internal function. */
5994 void
5996 {
6004 optab optab;
6016 {
6031 }
6034 {
6041 }
6063 {
6068 }
6069 else
6071 OPTAB_DIRECT);
6074 }
6076 /* Expand an atomic clear operation.
6077 void _atomic_clear (BOOL *obj, enum memmodel)
6078 EXP is the call expression. */
6080 static rtx
6082 {
6083 machine_mode mode;
6092 {
6093 source_location loc
6098 }
6100 /* Try issuing an __atomic_store, and allow fallback to __sync_lock_release.
6101 Failing that, a store is issued by __atomic_store. The only way this can
6102 fail is if the bool type is larger than a word size. Unlikely, but
6103 handle it anyway for completeness. Assume a single threaded model since
6104 there is no atomic support in this case, and no barriers are required. */
6109 }
6111 /* Expand an atomic test_and_set operation.
6112 bool _atomic_test_and_set (BOOL *obj, enum memmodel)
6113 EXP is the call expression. */
6115 static rtx
6117 {
6118 rtx mem;
6120 machine_mode mode;
6127 }
6130 /* Return true if (optional) argument ARG1 of size ARG0 is always lock free on
6131 this architecture. If ARG1 is NULL, use typical alignment for size ARG0. */
6133 static tree
6135 {
6137 machine_mode mode;
6148 {
6151 /* Either this argument is null, or it's a fake pointer encoding
6152 the alignment of the object. */
6158 else
6160 }
6161 else
6162 {
6165 /* This function is usually invoked and folded immediately by the front
6166 end before anything else has a chance to look at it. The pointer
6167 parameter at this point is usually cast to a void *, so check for that
6168 and look past the cast. */
6178 /* Get the underlying type of the object. */
6181 }
6183 /* If the object has smaller alignment, the lock free routines cannot
6184 be used. */
6188 /* Check if a compare_and_swap pattern exists for the mode which represents
6189 the required size. The pattern is not allowed to fail, so the existence
6190 of the pattern indicates support is present. */
6193 else
6195 }
6197 /* Return true if the parameters to call EXP represent an object which will
6198 always generate lock free instructions. The first argument represents the
6199 size of the object, and the second parameter is a pointer to the object
6200 itself. If NULL is passed for the object, then the result is based on
6201 typical alignment for an object of the specified size. Otherwise return
6202 false. */
6204 static rtx
6206 {
6207 tree size;
6212 {
6215 }
6221 }
6223 /* Return a one or zero if it can be determined that object ARG1 of size ARG
6224 is lock free on this architecture. */
6226 static tree
6228 {
6232 /* If it isn't always lock free, don't generate a result. */
6237 }
6239 /* Return true if the parameters to call EXP represent an object which will
6240 always generate lock free instructions. The first argument represents the
6241 size of the object, and the second parameter is a pointer to the object
6242 itself. If NULL is passed for the object, then the result is based on
6243 typical alignment for an object of the specified size. Otherwise return
6244 NULL*/
6246 static rtx
6248 {
6249 tree size;
6254 {
6257 }
6262 /* If the value is known at compile time, return the RTX for it. */
6268 }
6270 /* Expand the __atomic_thread_fence intrinsic:
6271 void __atomic_thread_fence (enum memmodel)
6272 EXP is the CALL_EXPR. */
6274 static void
6276 {
6279 }
6281 /* Expand the __atomic_signal_fence intrinsic:
6282 void __atomic_signal_fence (enum memmodel)
6283 EXP is the CALL_EXPR. */
6285 static void
6287 {
6290 }
6292 /* Expand the __sync_synchronize intrinsic. */
6294 static void
6296 {
6298 }
6300 static rtx
6302 {
6308 {
6310 /* If the target is not sutitable then create a new target. */
6318 }
6321 }
6323 static void
6325 {
6331 {
6338 }
6340 }
6342 \f
6343 /* Emit code to restore the current value of stack. */
6345 static void
6347 {
6359 }
6361 /* Emit code to save the current value of stack. */
6363 static rtx
6365 {
6370 }
6373 /* Expand an expression EXP that calls a built-in function,
6374 with result going to TARGET if that's convenient
6375 (and in mode MODE if that's convenient).
6376 SUBTARGET may be used as the target for computing one of EXP's operands.
6377 IGNORE is nonzero if the value is to be ignored. */
6379 rtx
6382 {
6391 /* When ASan is enabled, we don't want to expand some memory/string
6392 builtins and rely on libsanitizer's hooks. This allows us to avoid
6393 redundant checks and be sure, that possible overflow will be detected
6394 by ASan. */
6399 /* When not optimizing, generate calls to library functions for a certain
6400 set of builtins. */
6427 /* The built-in function expanders test for target == const0_rtx
6428 to determine whether the function's result will be ignored. */
6432 /* If the result of a pure or const built-in function is ignored, and
6433 none of its arguments are volatile, we can avoid expanding the
6434 built-in call and just evaluate the arguments for side-effects. */
6438 {
6440 tree arg;
6441 call_expr_arg_iterator iter;
6445 {
6448 }
6451 {
6455 }
6456 }
6458 /* expand_builtin_with_bounds is supposed to be used for
6459 instrumented builtin calls. */
6463 {
6481 /* Just do a normal library call if we were unable to fold
6482 the values. */
6558 /* __builtin_apply (FUNCTION, ARGUMENTS, ARGSIZE) invokes
6559 FUNCTION with a copy of the parameters described by
6560 ARGUMENTS, and ARGSIZE. It returns a block of memory
6561 allocated on the stack into which is stored all the registers
6562 that might possibly be used for returning the result of a
6563 function. ARGUMENTS is the value returned by
6564 __builtin_apply_args. ARGSIZE is the number of bytes of
6565 arguments that must be copied. ??? How should this value be
6566 computed? We'll also need a safe worst case value for varargs
6567 functions. */
6574 else
6575 {
6583 }
6585 /* __builtin_return (RESULT) causes the function to return the
6586 value described by RESULT. RESULT is address of the block of
6587 memory returned by __builtin_apply. */
6597 /* All valid uses of __builtin_va_arg_pack () are removed during
6598 inlining. */
6603 /* All valid uses of __builtin_va_arg_pack_len () are removed during
6604 inlining. */
6608 /* Return the address of the first anonymous stack arg. */
6630 /* Returns the address of the area where the structure is returned.
6631 0 otherwise. */
6637 else
6642 /* If the allocation stems from the declaration of a variable-sized
6643 object, it cannot accumulate. */
6785 {
6788 }
6792 /* This should have been lowered to the builtins below. */
6796 /* __builtin_setjmp_setup is passed a pointer to an array of five words
6797 and the receiver label. */
6799 {
6805 /* This is copied from the handling of non-local gotos. */
6807 nonlocal_goto_handler_labels
6809 nonlocal_goto_handler_labels);
6810 /* ??? Do not let expand_label treat us as such since we would
6811 not want to be both on the list of non-local labels and on
6812 the list of forced labels. */
6815 }
6819 /* __builtin_setjmp_receiver is passed the receiver label. */
6821 {
6827 }
6830 /* __builtin_longjmp is passed a pointer to an array of five words.
6831 It's similar to the C library longjmp function but works with
6832 __builtin_setjmp above. */
6835 {
6841 {
6844 }
6848 }
6857 /* This updates the setjmp buffer that is its argument with the value
6858 of the current stack pointer. */
6861 {
6862 rtx buf_addr
6867 }
6887 /* Various hooks for the DWARF 2 __throw routine. */
6893 #ifdef DWARF2_UNWIND_INFO
6899 #endif
7099 mode = get_builtin_sync_mode
7111 mode = get_builtin_sync_mode
7158 {
7162 mode =
7168 /* If this is turned into an external library call, the weak parameter
7169 must be dropped to match the expected parameter list. */
7174 /* Skip the boolean weak parameter. */
7179 }
7208 {
7218 }
7224 {
7234 }
7240 {
7250 }
7256 {
7266 }
7272 {
7282 }
7288 {
7298 }
7453 /* We allow user CHKP builtins if Pointer Bounds
7454 Checker is off. */
7456 {
7467 else
7469 }
7470 /* FALLTHROUGH */
7482 /* Software implementation of Pointer Bounds Checker is NYI.
7483 Target support is required. */
7488 /* Do library call, if we failed to expand the builtin when
7489 folding. */
7494 }
7496 /* The switch statement above can drop through to cause the function
7497 to be called normally. */
7499 }
7501 /* Similar to expand_builtin but is used for instrumented calls. */
7503 rtx
7505 rtx subtarget ATTRIBUTE_UNUSED,
7507 {
7520 {
7541 }
7543 /* The switch statement above can drop through to cause the function
7544 to be called normally. */
7546 }
7548 /* Determine whether a tree node represents a call to a built-in
7549 function. If the tree T is a call to a built-in function with
7550 the right number of arguments of the appropriate types, return
7551 the DECL_FUNCTION_CODE of the call, e.g. BUILT_IN_SQRT.
7552 Otherwise the return value is END_BUILTINS. */
7554 enum built_in_function
7556 {
7559 const_call_expr_arg_iterator iter;
7575 {
7576 /* If a function doesn't take a variable number of arguments,
7577 the last element in the list will have type `void'. */
7580 {
7584 }
7593 {
7596 }
7598 {
7601 }
7603 {
7606 }
7608 {
7611 }
7612 else
7614 }
7616 /* Variable-length argument list. */
7618 }
7620 /* Fold a call to __builtin_constant_p, if we know its argument ARG will
7621 evaluate to a constant. */
7623 static tree
7625 {
7626 /* We return 1 for a numeric type that's known to be a constant
7627 value at compile-time or for an aggregate type that's a
7628 literal constant. */
7631 /* If we know this is a constant, emit the constant of one. */
7637 {
7644 }
7646 /* If this expression has side effects, show we don't know it to be a
7647 constant. Likewise if it's a pointer or aggregate type since in
7648 those case we only want literals, since those are only optimized
7649 when generating RTL, not later.
7650 And finally, if we are compiling an initializer, not code, we
7651 need to return a definite result now; there's not going to be any
7652 more optimization done. */
7657 || folding_initializer
7662 }
7664 /* Create builtin_expect with PRED and EXPECTED as its arguments and
7665 return it as a truthvalue. */
7667 static tree
7669 tree predictor)
7670 {
7682 predictor);
7686 }
7688 /* Fold a call to builtin_expect with arguments ARG0 and ARG1. Return
7689 NULL_TREE if no simplification is possible. */
7691 tree
7693 {
7697 /* Distribute the expected value over short-circuiting operators.
7698 See through the cast from truthvalue_type_node to long. */
7705 /* If this is a builtin_expect within a builtin_expect keep the
7706 inner one. See through a comparison against a constant. It
7707 might have been added to create a thruthvalue. */
7723 {
7732 }
7734 /* If the argument isn't invariant then there's nothing else we can do. */
7738 /* If we expect that a comparison against the argument will fold to
7739 a constant return the constant. In practice, this means a true
7740 constant or the address of a non-weak symbol. */
7744 {
7745 do
7746 {
7748 }
7753 }
7755 /* Otherwise, ARG0 already has the proper type for the return value. */
7757 }
7759 /* Fold a call to __builtin_classify_type with argument ARG. */
7761 static tree
7763 {
7768 }
7770 /* Fold a call to __builtin_strlen with argument ARG. */
7772 static tree
7774 {
7777 else
7778 {
7785 }
7786 }
7788 /* Fold a call to __builtin_inf or __builtin_huge_val. */
7790 static tree
7792 {
7793 REAL_VALUE_TYPE real;
7795 /* __builtin_inff is intended to be usable to define INFINITY on all
7796 targets. If an infinity is not available, INFINITY expands "to a
7797 positive constant of type float that overflows at translation
7798 time", footnote "In this case, using INFINITY will violate the
7799 constraint in 6.4.4 and thus require a diagnostic." (C99 7.12#4).
7800 Thus we pedwarn to ensure this constraint violation is
7801 diagnosed. */
7807 }
7809 /* Fold function call to builtin sincos, sincosf, or sincosl. Return
7810 NULL_TREE if no simplification can be made. */
7812 static tree
7815 {
7816 tree type;
7826 /* Calculate the result when the argument is a constant. */
7831 /* Canonicalize sincos to cexpi. */
7833 {
7836 }
7838 {
7845 }
7854 }
7856 /* Fold function call to builtin memcmp with arguments ARG1 and ARG2.
7857 Return NULL_TREE if no simplification can be made. */
7859 static tree
7861 {
7867 /* If the LEN parameter is zero, return zero. */
7872 /* If ARG1 and ARG2 are the same (and not volatile), return zero. */
7876 /* If len parameter is one, return an expression corresponding to
7877 (*(const unsigned char*)arg1 - (const unsigned char*)arg2). */
7879 {
7881 tree cst_uchar_ptr_node
7884 tree ind1
7888 cst_uchar_ptr_node,
7889 arg1)));
7890 tree ind2
7894 cst_uchar_ptr_node,
7895 arg2)));
7897 }
7900 }
7902 /* Fold a call to builtin isascii with argument ARG. */
7904 static tree
7906 {
7909 else
7910 {
7911 /* Transform isascii(c) -> ((c & ~0x7f) == 0). */
7917 }
7918 }
7920 /* Fold a call to builtin toascii with argument ARG. */
7922 static tree
7924 {
7928 /* Transform toascii(c) -> (c & 0x7f). */
7931 }
7933 /* Fold a call to builtin isdigit with argument ARG. */
7935 static tree
7937 {
7940 else
7941 {
7942 /* Transform isdigit(c) -> (unsigned)(c) - '0' <= 9. */
7943 /* According to the C standard, isdigit is unaffected by locale.
7944 However, it definitely is affected by the target character set. */
7945 unsigned HOST_WIDE_INT target_digit0
7956 }
7957 }
7959 /* Fold a call to fabs, fabsf or fabsl with argument ARG. */
7961 static tree
7963 {
7969 }
7971 /* Fold a call to abs, labs, llabs or imaxabs with argument ARG. */
7973 static tree
7975 {
7981 }
7983 /* Fold a call to fma, fmaf, or fmal with arguments ARG[012]. */
7985 static tree
7987 {
7988 /* ??? Only expand to FMA_EXPR if it's directly supported. */
7996 }
7998 /* Fold a call to builtin carg(a+bi) -> atan2(b,a). */
8000 static tree
8002 {
8005 {
8009 {
8014 }
8015 }
8018 }
8020 /* Fold a call to builtin frexp, we can assume the base is 2. */
8022 static tree
8024 {
8035 /* Proceed if a valid pointer type was passed in. */
8037 {
8042 {
8044 /* For +-0, return (*exp = 0, +-0). */
8050 /* For +-NaN or +-Inf, *exp is unspecified, return arg0. */
8053 {
8054 /* Since the frexp function always expects base 2, and in
8055 GCC normalized significands are already in the range
8056 [0.5, 1.0), we have exactly what frexp wants. */
8061 }
8065 }
8067 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8071 }
8074 }
8076 /* Fold a call to builtin modf. */
8078 static tree
8080 {
8091 /* Proceed if a valid pointer type was passed in. */
8093 {
8098 {
8101 /* For +-NaN or +-0, return (*arg1 = arg0, arg0). */
8105 /* For +-Inf, return (*arg1 = arg0, +-0). */
8111 /* Return (*arg1 = trunc(arg0), arg0-trunc(arg0)). */
8114 /* If the original number was negative and already
8115 integral, then the fractional part is -0.0. */
8119 }
8121 /* Create the COMPOUND_EXPR (*arg1 = trunc, frac). */
8127 }
8130 }
8132 /* Given a location LOC, an interclass builtin function decl FNDECL
8133 and its single argument ARG, return an folded expression computing
8134 the same, or NULL_TREE if we either couldn't or didn't want to fold
8135 (the latter happen if there's an RTL instruction available). */
8137 static tree
8139 {
8140 machine_mode mode;
8152 /* If there is no optab, try generic code. */
8154 {
8155 tree result;
8158 {
8159 /* isinf(x) -> isgreater(fabs(x),DBL_MAX). */
8162 REAL_VALUE_TYPE r;
8166 {
8167 /* NaN and Inf are encoded in the high-order double value
8168 only. The low-order value is not significant. */
8172 }
8179 }
8182 {
8183 /* isfinite(x) -> islessequal(fabs(x),DBL_MAX). */
8186 REAL_VALUE_TYPE r;
8190 {
8191 /* NaN and Inf are encoded in the high-order double value
8192 only. The low-order value is not significant. */
8196 }
8202 /*result = fold_build2_loc (loc, UNGT_EXPR,
8203 TREE_TYPE (TREE_TYPE (fndecl)),
8204 fold_build1_loc (loc, ABS_EXPR, type, arg),
8205 build_real (type, r));
8206 result = fold_build1_loc (loc, TRUTH_NOT_EXPR,
8207 TREE_TYPE (TREE_TYPE (fndecl)),
8208 result);*/
8210 }
8212 {
8213 /* isnormal(x) -> isgreaterequal(fabs(x),DBL_MIN) &
8214 islessequal(fabs(x),DBL_MAX). */
8224 {
8225 /* Use double to test the normal range of IBM extended
8226 precision. Emin for IBM extended precision is
8227 different to emin for IEEE double, being 53 higher
8228 since the low double exponent is at least 53 lower
8229 than the high double exponent. */
8233 }
8245 {
8246 /* Testing the high end of the range is done just using
8247 the high double, using the same test as isfinite().
8248 For the subnormal end of the range we first test the
8249 high double, then if its magnitude is equal to the
8250 limit of 0x1p-969, we test whether the low double is
8251 non-zero and opposite sign to the high double. */
8267 integer_type_node,
8273 }
8274 else
8275 {
8276 tree const isge_fn
8279 }
8283 }
8286 }
8289 }
8291 /* Fold a call to __builtin_isnan(), __builtin_isinf, __builtin_finite.
8292 ARG is the argument for the call. */
8294 static tree
8296 {
8303 {
8311 {
8312 /* isinf_sign(x) -> isinf(x) ? (signbit(x) ? -1 : 1) : 0 */
8313 /* In a boolean context, GCC will fold the inner COND_EXPR to
8314 1. So e.g. "if (isinf_sign(x))" would be folded to just
8315 "if (isinf(x) ? 1 : 0)" which becomes "if (isinf(x))". */
8323 {
8336 integer_zero_node);
8337 }
8340 }
8353 {
8356 {
8357 /* NaN and Inf are encoded in the high-order double value
8358 only. The low-order value is not significant. */
8360 }
8361 }
8367 }
8368 }
8370 /* Fold a call to __builtin_fpclassify(int, int, int, int, int, ...).
8371 This builtin will generate code to return the appropriate floating
8372 point classification depending on the value of the floating point
8373 number passed in. The possible return values must be supplied as
8374 int arguments to the call in the following order: FP_NAN, FP_INFINITE,
8375 FP_NORMAL, FP_SUBNORMAL and FP_ZERO. The ellipses is for exactly
8376 one floating point argument which is "type generic". */
8378 static tree
8380 {
8383 machine_mode mode;
8384 REAL_VALUE_TYPE r;
8387 /* Verify the required arguments in the original call. */
8407 /* fpclassify(x) ->
8408 isnan(x) ? FP_NAN :
8409 (fabs(x) == Inf ? FP_INFINITE :
8410 (fabs(x) >= DBL_MIN ? FP_NORMAL :
8411 (x == 0 ? FP_ZERO : FP_SUBNORMAL))). */
8425 {
8431 }
8434 {
8437 }
8440 }
8442 /* Fold a call to an unordered comparison function such as
8443 __builtin_isgreater(). FNDECL is the FUNCTION_DECL for the function
8444 being called and ARG0 and ARG1 are the arguments for the call.
8445 UNORDERED_CODE and ORDERED_CODE are comparison codes that give
8446 the opposite of the desired result. UNORDERED_CODE is used
8447 for modes that can hold NaNs and ORDERED_CODE is used for
8448 the rest. */
8450 static tree
8454 {
8468 /* Choose the wider of two real types. */
8480 {
8484 }
8489 }
8491 /* Fold __builtin_{,s,u}{add,sub,mul}{,l,ll}_overflow, either into normal
8492 arithmetics if it can never overflow, or into internal functions that
8493 return both result of arithmetics and overflowed boolean flag in
8494 a complex integer result, or some other check for overflow.
8495 Similarly fold __builtin_{add,sub,mul}_overflow_p to just the overflow
8496 checking part of that. */
8498 static tree
8501 {
8503 /* The code of the expression corresponding to the type-generic
8504 built-in, or ERROR_MARK for the type-specific ones. */
8509 {
8512 /* FALLTHRU */
8515 /* FALLTHRU */
8526 /* FALLTHRU */
8529 /* FALLTHRU */
8540 /* FALLTHRU */
8543 /* FALLTHRU */
8554 }
8556 /* For the "generic" overloads, the first two arguments can have different
8557 types and the last argument determines the target type to use to check
8558 for overflow. The arguments of the other overloads all have the same
8559 type. */
8562 /* For the __builtin_{add,sub,mul}_overflow_p builtins, when the first two
8563 arguments are constant, attempt to fold the built-in call into a constant
8564 expression indicating whether or not it detected an overflow. */
8568 /* Perform the computation in the target type and check for overflow. */
8572 arg2);
8586 tree store
8589 }
8591 /* Fold a call to __builtin_FILE to a constant string. */
8595 {
8600 }
8602 /* Fold a call to __builtin_FUNCTION to a constant string. */
8606 {
8608 {
8611 }
8614 }
8616 /* Fold a call to __builtin_LINE to an integer constant. */
8620 {
8622 }
8624 /* Fold a call to built-in function FNDECL with 0 arguments.
8625 This function returns NULL_TREE if no simplification was possible. */
8627 static tree
8629 {
8633 {
8659 }
8661 }
8663 /* Fold a call to built-in function FNDECL with 1 argument, ARG0.
8664 This function returns NULL_TREE if no simplification was possible. */
8666 static tree
8668 {
8679 {
8681 {
8684 /* Gimplification will pull the CALL_EXPR for the builtin out of
8685 an if condition. When not optimizing, we'll not CSE it back.
8686 To avoid link error types of regressions, return false now. */
8691 }
8747 {
8752 }
8758 {
8763 }
8784 }
8788 }
8790 /* Fold a call to built-in function FNDECL with 2 arguments, ARG0 and ARG1.
8791 This function returns NULL_TREE if no simplification was possible. */
8793 static tree
8795 {
8807 {
8851 NOP_EXPR);
8853 /* We do the folding for va_start in the expander. */
8868 }
8870 }
8872 /* Fold a call to built-in function FNDECL with 3 arguments, ARG0, ARG1,
8873 and ARG2.
8874 This function returns NULL_TREE if no simplification was possible. */
8876 static tree
8879 {
8893 {
8943 }
8945 }
8947 /* Fold a call to built-in function FNDECL. ARGS is an array of NARGS
8948 arguments. IGNORE is true if the result of the
8949 function call is ignored. This function returns NULL_TREE if no
8950 simplification was possible. */
8952 tree
8954 {
8958 {
8974 }
8976 {
8981 }
8983 }
8985 /* Construct a new CALL_EXPR to FNDECL using the tail of the argument
8986 list ARGS along with N new arguments in NEWARGS. SKIP is the number
8987 of arguments in ARGS to be omitted. OLDNARGS is the number of
8988 elements in ARGS. */
8990 static tree
8993 {
8998 {
9006 }
9007 else
9011 }
9013 /* Return true if FNDECL shouldn't be folded right now.
9014 If a built-in function has an inline attribute always_inline
9015 wrapper, defer folding it after always_inline functions have
9016 been inlined, otherwise e.g. -D_FORTIFY_SOURCE checking
9017 might not be performed. */
9019 bool
9021 {
9024 && cfun
9027 }
9029 /* A wrapper function for builtin folding that prevents warnings for
9030 "statement without effect" and the like, caused by removing the
9031 call node earlier than the warning is generated. */
9033 tree
9035 {
9041 /* If CALL_EXPR_VA_ARG_PACK is set, the arguments aren't finalized
9042 yet. Defer folding until we see all the arguments
9043 (after inlining). */
9045 {
9048 /* Before gimplification CALL_EXPR_VA_ARG_PACK is not set, but
9049 instead last argument is __builtin_va_arg_pack (). Defer folding
9050 even in that case, until arguments are finalized. */
9052 {
9059 }
9067 else
9068 {
9073 }
9074 }
9076 }
9078 /* Fold a CALL_EXPR with type TYPE with FN as the function expression.
9079 N arguments are passed in the array ARGARRAY. Return a folded
9080 expression or NULL_TREE if no simplification was possible. */
9082 tree
9084 tree fn,
9087 {
9094 {
9095 /* If last argument is __builtin_va_arg_pack (), arguments to this
9096 function are not finalized yet. Defer folding until they are. */
9098 {
9105 }
9110 else
9112 }
9115 }
9117 /* Construct a new CALL_EXPR using the tail of the argument list of EXP
9118 along with N new arguments specified as the "..." parameters. SKIP
9119 is the number of arguments in EXP to be omitted. This function is used
9120 to do varargs-to-varargs transformations. */
9122 static tree
9124 {
9126 tree t;
9134 }
9136 /* Validate a single argument ARG against a tree code CODE representing
9137 a type. When NONNULL is true consider a pointer argument valid only
9138 if it's non-null. Return true when argument is valid. */
9140 static bool
9142 {
9151 }
9153 /* This function validates the types of a function call argument list
9154 against a specified list of tree_codes. If the last specifier is a 0,
9155 that represents an ellipses, otherwise the last specifier must be a
9156 VOID_TYPE.
9158 This is the GIMPLE version of validate_arglist. Eventually we want to
9159 completely convert builtins.c to work from GIMPLEs and the tree based
9160 validate_arglist will then be removed. */
9162 bool
9164 {
9168 const_tree arg;
9174 do
9175 {
9178 {
9180 /* This signifies an ellipses, any further arguments are all ok. */
9184 /* This signifies an endlink, if no arguments remain, return
9185 true, otherwise return false. */
9189 /* If no parameters remain or the parameter's code does not
9190 match the specified code, return false. Otherwise continue
9191 checking any remaining arguments. */
9196 }
9197 }
9200 /* We need gotos here since we can only have one VA_CLOSE in a
9201 function. */
9202 end: ;
9206 }
9208 /* Default target-specific builtin expander that does nothing. */
9210 rtx
9212 rtx target ATTRIBUTE_UNUSED,
9213 rtx subtarget ATTRIBUTE_UNUSED,
9214 machine_mode mode ATTRIBUTE_UNUSED,
9216 {
9218 }
9220 /* Returns true is EXP represents data that would potentially reside
9221 in a readonly section. */
9223 bool
9225 {
9235 /* Make sure we call decl_readonly_section only for trees it
9236 can handle (since it returns true for everything it doesn't
9237 understand). */
9242 else
9244 }
9246 /* Simplify a call to the strpbrk builtin. S1 and S2 are the arguments
9247 to the call, and TYPE is its return type.
9249 Return NULL_TREE if no simplification was possible, otherwise return the
9250 simplified form of the call as a tree.
9252 The simplified form may be a constant or other expression which
9253 computes the same value, but in a more efficient manner (including
9254 calls to other builtin functions).
9256 The call may contain arguments which need to be evaluated, but
9257 which are not useful to determine the result of the call. In
9258 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9259 COMPOUND_EXPR will be an argument which must be evaluated.
9260 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9261 COMPOUND_EXPR in the chain will contain the tree for the simplified
9262 form of the builtin function call. */
9264 static tree
9266 {
9270 else
9271 {
9272 tree fn;
9281 {
9283 tree tem;
9288 /* Return an offset into the constant string argument. */
9291 }
9294 /* strpbrk(x, "") == NULL.
9295 Evaluate and ignore s1 in case it had side-effects. */
9305 /* New argument list transforming strpbrk(s1, s2) to
9306 strchr(s1, s2[0]). */
9309 }
9310 }
9312 /* Simplify a call to the strspn builtin. S1 and S2 are the arguments
9313 to the call.
9315 Return NULL_TREE if no simplification was possible, otherwise return the
9316 simplified form of the call as a tree.
9318 The simplified form may be a constant or other expression which
9319 computes the same value, but in a more efficient manner (including
9320 calls to other builtin functions).
9322 The call may contain arguments which need to be evaluated, but
9323 which are not useful to determine the result of the call. In
9324 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9325 COMPOUND_EXPR will be an argument which must be evaluated.
9326 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9327 COMPOUND_EXPR in the chain will contain the tree for the simplified
9328 form of the builtin function call. */
9330 static tree
9332 {
9336 else
9337 {
9340 /* If either argument is "", return NULL_TREE. */
9342 /* Evaluate and ignore both arguments in case either one has
9343 side-effects. */
9347 }
9348 }
9350 /* Simplify a call to the strcspn builtin. S1 and S2 are the arguments
9351 to the call.
9353 Return NULL_TREE if no simplification was possible, otherwise return the
9354 simplified form of the call as a tree.
9356 The simplified form may be a constant or other expression which
9357 computes the same value, but in a more efficient manner (including
9358 calls to other builtin functions).
9360 The call may contain arguments which need to be evaluated, but
9361 which are not useful to determine the result of the call. In
9362 this case we return a chain of COMPOUND_EXPRs. The LHS of each
9363 COMPOUND_EXPR will be an argument which must be evaluated.
9364 COMPOUND_EXPRs are chained through their RHS. The RHS of the last
9365 COMPOUND_EXPR in the chain will contain the tree for the simplified
9366 form of the builtin function call. */
9368 static tree
9370 {
9374 else
9375 {
9376 /* If the first argument is "", return NULL_TREE. */
9379 {
9380 /* Evaluate and ignore argument s2 in case it has
9381 side-effects. */
9384 }
9386 /* If the second argument is "", return __builtin_strlen(s1). */
9389 {
9392 /* If the replacement _DECL isn't initialized, don't do the
9393 transformation. */
9398 }
9400 }
9401 }
9403 /* Fold the next_arg or va_start call EXP. Returns true if there was an error
9404 produced. False otherwise. This is done so that we don't output the error
9405 or warning twice or three times. */
9407 bool
9409 {
9412 tree arg;
9413 /* There is good chance the current input_location points inside the
9414 definition of the va_start macro (perhaps on the token for
9415 builtin) in a system header, so warnings will not be emitted.
9416 Use the location in real source code. */
9417 source_location current_location =
9419 NULL);
9422 {
9425 }
9428 {
9430 {
9433 }
9435 }
9436 /* We use __builtin_va_start (ap, 0, 0) or __builtin_next_arg (0, 0)
9437 when we checked the arguments and if needed issued a warning. */
9438 else
9439 {
9441 {
9442 /* Evidently an out of date version of <stdarg.h>; can't validate
9443 va_start's second argument, but can still work as intended. */
9445 OPT_Wvarargs,
9448 }
9450 {
9453 }
9455 }
9460 /* We destructively modify the call to be __builtin_va_start (ap, 0)
9461 or __builtin_next_arg (0) the first time we see it, after checking
9462 the arguments and if needed issuing a warning. */
9464 {
9467 /* Strip off all nops for the sake of the comparison. This
9468 is not quite the same as STRIP_NOPS. It does more.
9469 We must also strip off INDIRECT_EXPR for C++ reference
9470 parameters. */
9475 {
9476 /* FIXME: Sometimes with the tree optimizers we can get the
9477 not the last argument even though the user used the last
9478 argument. We just warn and set the arg to be the last
9479 argument so that we will get wrong-code because of
9480 it. */
9482 OPT_Wvarargs,
9484 }
9486 /* Undefined by C99 7.15.1.4p4 (va_start):
9487 "If the parameter parmN is declared with the register storage
9488 class, with a function or array type, or with a type that is
9489 not compatible with the type that results after application of
9490 the default argument promotions, the behavior is undefined."
9491 */
9493 {
9495 OPT_Wvarargs,
9496 "undefined behavior when second parameter of "
9498 }
9500 /* We want to verify the second parameter just once before the tree
9501 optimizers are run and then avoid keeping it in the tree,
9502 as otherwise we could warn even for correct code like:
9503 void foo (int i, ...)
9504 { va_list ap; i++; va_start (ap, i); va_end (ap); } */
9507 else
9509 }
9511 }
9514 /* Expand a call EXP to __builtin_object_size. */
9516 static rtx
9518 {
9519 tree ost;
9524 {
9529 }
9537 {
9542 }
9547 }
9549 /* Expand EXP, a call to the __mem{cpy,pcpy,move,set}_chk builtin.
9550 FCODE is the BUILT_IN_* to use.
9551 Return NULL_RTX if we failed; the caller should emit a normal call,
9552 otherwise try to get the result in TARGET, if convenient (and in
9553 mode MODE if that's convenient). */
9555 static rtx
9558 {
9562 POINTER_TYPE,
9563 fcode == BUILT_IN_MEMSET_CHK
9581 {
9582 /* Avoid transforming the checking call to an ordinary one when
9583 an overflow has been detected or when the call couldn't be
9584 validated because the size is not constant. */
9589 /* If __builtin_mem{cpy,pcpy,move,set}_chk is used, assume
9590 mem{cpy,pcpy,move,set} is available. */
9592 {
9607 }
9616 }
9619 else
9620 {
9623 /* If DEST is not a pointer type, call the normal function. */
9627 /* If SRC and DEST are the same (and not volatile), do nothing. */
9629 {
9630 tree expr;
9633 {
9634 /* Evaluate and ignore LEN in case it has side-effects. */
9637 }
9641 }
9643 /* __memmove_chk special case. */
9645 {
9651 /* If src is categorized for a readonly section we can use
9652 normal __memcpy_chk. */
9654 {
9663 }
9664 }
9666 }
9667 }
9669 /* Emit warning if a buffer overflow is detected at compile time. */
9671 static void
9673 {
9674 /* The source string. */
9676 /* The size of the destination object. */
9678 /* The string that is being concatenated with (as in __strcat_chk)
9679 or null if it isn't. */
9681 /* The maximum length of the source sequence in a bounded operation
9682 (such as __strncat_chk) or null if the operation isn't bounded
9683 (such as __strcat_chk). */
9687 {
9695 /* For __strcat_chk the warning will be emitted only if overflowing
9696 by at least strlen (dest) + 1 bytes. */
9723 }
9726 {
9727 /* Check __strncat_chk. There is no way to determine the length
9728 of the string to which the source string is being appended so
9729 just warn when the length of the source string is not known. */
9732 }
9736 }
9738 /* Emit warning if a buffer overflow is detected at compile time
9739 in __sprintf_chk/__vsprintf_chk calls. */
9741 static void
9743 {
9748 /* Verify the required arguments in the original call. */
9758 /* Check whether the format is a literal string constant. */
9766 /* If the format doesn't contain % args or %%, we know its size. */
9769 /* If the format is "%s" and first ... argument is a string literal,
9770 we know it too. */
9773 {
9774 tree arg;
9785 }
9786 else
9789 /* Add one for the terminating nul. */
9793 }
9795 /* Emit warning if a free is called with address of a variable. */
9797 static void
9799 {
9813 else
9816 }
9818 /* Fold a call to __builtin_object_size with arguments PTR and OST,
9819 if possible. */
9821 static tree
9823 {
9840 /* __builtin_object_size doesn't evaluate side-effects in its arguments;
9841 if there are any side-effects, it returns (size_t) -1 for types 0 and 1
9842 and (size_t) 0 for types 2 and 3. */
9847 {
9851 }
9853 {
9854 /* If object size is not known yet, delay folding until
9855 later. Maybe subsequent passes will help determining
9856 it. */
9860 }
9863 }
9865 /* Builtins with folding operations that operate on "..." arguments
9866 need special handling; we need to store the arguments in a convenient
9867 data structure before attempting any folding. Fortunately there are
9868 only a few builtins that fall into this category. FNDECL is the
9869 function, EXP is the CALL_EXPR for the call. */
9871 static tree
9873 {
9878 {
9885 }
9887 {
9892 }
9894 }
9896 /* Initialize format string characters in the target charset. */
9898 bool
9900 {
9903 {
9926 }
9928 }
9930 /* Helper function for do_mpfr_arg*(). Ensure M is a normal number
9931 and no overflow/underflow occurred. INEXACT is true if M was not
9932 exactly calculated. TYPE is the tree type for the result. This
9933 function assumes that you cleared the MPFR flags and then
9934 calculated M to see if anything subsequently set a flag prior to
9935 entering this function. Return NULL_TREE if any checks fail. */
9937 static tree
9939 {
9940 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
9941 overflow/underflow occurred. If -frounding-math, proceed iff the
9942 result of calling FUNC was exact. */
9945 {
9946 REAL_VALUE_TYPE rr;
9949 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR value,
9950 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
9951 but the mpft_t is not, then we underflowed in the
9952 conversion. */
9955 {
9956 REAL_VALUE_TYPE rmode;
9959 /* Proceed iff the specified mode can hold the value. */
9962 }
9963 }
9965 }
9967 /* Helper function for do_mpc_arg*(). Ensure M is a normal complex
9968 number and no overflow/underflow occurred. INEXACT is true if M
9969 was not exactly calculated. TYPE is the tree type for the result.
9970 This function assumes that you cleared the MPFR flags and then
9971 calculated M to see if anything subsequently set a flag prior to
9972 entering this function. Return NULL_TREE if any checks fail, if
9973 FORCE_CONVERT is true, then bypass the checks. */
9975 static tree
9977 {
9978 /* Proceed iff we get a normal number, i.e. not NaN or Inf and no
9979 overflow/underflow occurred. If -frounding-math, proceed iff the
9980 result of calling FUNC was exact. */
9985 {
9990 /* Proceed iff GCC's REAL_VALUE_TYPE can hold the MPFR values,
9991 check for overflow/underflow. If the REAL_VALUE_TYPE is zero
9992 but the mpft_t is not, then we underflowed in the
9993 conversion. */
9998 {
10003 /* Proceed iff the specified mode can hold the value. */
10009 }
10010 }
10012 }
10014 /* If arguments ARG0 and ARG1 are REAL_CSTs, call mpfr_remquo() to set
10015 the pointer *(ARG_QUO) and return the result. The type is taken
10016 from the type of ARG0 and is used for setting the precision of the
10017 calculation and results. */
10019 static tree
10021 {
10028 /* To proceed, MPFR must exactly represent the target floating point
10029 format, which only happens when the target base equals two. */
10033 {
10038 {
10042 tree result_rem;
10051 /* Remquo is independent of the rounding mode, so pass
10052 inexact=0 to do_mpfr_ckconv(). */
10056 {
10057 /* MPFR calculates quo in the host's long so it may
10058 return more bits in quo than the target int can hold
10059 if sizeof(host long) > sizeof(target int). This can
10060 happen even for native compilers in LP64 mode. In
10061 these cases, modulo the quo value with the largest
10062 number that the target int can hold while leaving one
10063 bit for the sign. */
10067 /* Dereference the quo pointer argument. */
10069 /* Proceed iff a valid pointer type was passed in. */
10071 {
10072 /* Set the value. */
10073 tree result_quo
10076 integer_quo));
10078 /* Combine the quo assignment with the rem. */
10081 }
10082 }
10083 }
10084 }
10086 }
10088 /* If ARG is a REAL_CST, call mpfr_lgamma() on it and return the
10089 resulting value as a tree with type TYPE. The mpfr precision is
10090 set to the precision of TYPE. We assume that this mpfr function
10091 returns zero if the result could be calculated exactly within the
10092 requested precision. In addition, the integer pointer represented
10093 by ARG_SG will be dereferenced and set to the appropriate signgam
10094 (-1,1) value. */
10096 static tree
10098 {
10103 /* To proceed, MPFR must exactly represent the target floating point
10104 format, which only happens when the target base equals two. Also
10105 verify ARG is a constant and that ARG_SG is an int pointer. */
10110 {
10113 /* In addition to NaN and Inf, the argument cannot be zero or a
10114 negative integer. */
10118 {
10123 mpfr_t m;
10124 tree result_lg;
10133 {
10134 tree result_sg;
10136 /* Dereference the arg_sg pointer argument. */
10138 /* Assign the signgam value into *arg_sg. */
10143 /* Combine the signgam assignment with the lgamma result. */
10146 }
10147 }
10148 }
10151 }
10153 /* If arguments ARG0 and ARG1 are a COMPLEX_CST, call the two-argument
10154 mpc function FUNC on it and return the resulting value as a tree
10155 with type TYPE. The mpfr precision is set to the precision of
10156 TYPE. We assume that function FUNC returns zero if the result
10157 could be calculated exactly within the requested precision. If
10158 DO_NONFINITE is true, then fold expressions containing Inf or NaN
10159 in the arguments and/or results. */
10161 tree
10164 {
10170 /* To proceed, MPFR must exactly represent the target floating point
10171 format, which only happens when the target base equals two. */
10177 {
10186 {
10206 }
10207 }
10210 }
10212 /* A wrapper function for builtin folding that prevents warnings for
10213 "statement without effect" and the like, caused by removing the
10214 call node earlier than the warning is generated. */
10216 tree
10218 {
10226 {
10235 {
10237 }
10238 else
10239 {
10242 {
10243 /* Propagate location information from original call to
10244 expansion of builtin. Otherwise things like
10245 maybe_emit_chk_warning, that operate on the expansion
10246 of a builtin, will use the wrong location information. */
10248 {
10256 }
10258 }
10259 }
10260 }
10262 }
10264 /* Look up the function in builtin_decl that corresponds to DECL
10265 and set ASMSPEC as its user assembler name. DECL must be a
10266 function decl that declares a builtin. */
10268 void
10270 {
10280 {
10284 }
10285 }
10287 /* Return true if DECL is a builtin that expands to a constant or similarly
10288 simple code. */
10289 bool
10291 {
10294 {
10295 /* Builtins that expand to constants. */
10300 /* Simple register moves or loads from stack. */
10311 /* Exception state returns or moves registers around. */
10319 }
10322 }
10324 /* Return true if DECL is a builtin that is not expensive, i.e., they are
10325 most probably expanded inline into reasonably simple code. This is a
10326 superset of is_simple_builtin. */
10327 bool
10329 {
10336 {
10405 }
10408 }
10410 /* Return true if T is a constant and the value cast to a target char
10411 can be represented by a host char.
10412 Store the casted char constant in *P if so. */
10414 bool
10416 {
10422 }