| blob | 91a4466b00bec4f514344b80aacbe0ca30aac8fe |
1 /* Convert function calls to rtl insns, for GNU C compiler.
2 Copyright (C) 1989-2017 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
56 /* Like PREFERRED_STACK_BOUNDARY but in units of bytes, not bits. */
57 #define STACK_BYTES (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)
59 /* Data structure and subroutines used within expand_call. */
61 struct arg_data
62 {
63 /* Tree node for this argument. */
64 tree tree_value;
65 /* Mode for value; TYPE_MODE unless promoted. */
66 machine_mode mode;
67 /* Current RTL value for argument, or 0 if it isn't precomputed. */
68 rtx value;
69 /* Initially-compute RTL value for argument; only for const functions. */
70 rtx initial_value;
71 /* Register to pass this argument in, 0 if passed on stack, or an
72 PARALLEL if the arg is to be copied into multiple non-contiguous
73 registers. */
74 rtx reg;
75 /* Register to pass this argument in when generating tail call sequence.
76 This is not the same register as for normal calls on machines with
77 register windows. */
78 rtx tail_call_reg;
79 /* If REG is a PARALLEL, this is a copy of VALUE pulled into the correct
80 form for emit_group_move. */
81 rtx parallel_value;
82 /* If value is passed in neither reg nor stack, this field holds a number
83 of a special slot to be used. */
84 rtx special_slot;
85 /* For pointer bounds hold an index of parm bounds are bound to. -1 if
86 there is no such pointer. */
88 /* If pointer_arg refers a structure, then pointer_offset holds an offset
89 of a pointer in this structure. */
91 /* If REG was promoted from the actual mode of the argument expression,
92 indicates whether the promotion is sign- or zero-extended. */
94 /* Number of bytes to put in registers. 0 means put the whole arg
95 in registers. Also 0 if not passed in registers. */
97 /* Nonzero if argument must be passed on stack.
98 Note that some arguments may be passed on the stack
99 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
100 pass_on_stack identifies arguments that *cannot* go in registers. */
102 /* Some fields packaged up for locate_and_pad_parm. */
104 /* Location on the stack at which parameter should be stored. The store
105 has already been done if STACK == VALUE. */
106 rtx stack;
107 /* Location on the stack of the start of this argument slot. This can
108 differ from STACK if this arg pads downward. This location is known
109 to be aligned to TARGET_FUNCTION_ARG_BOUNDARY. */
110 rtx stack_slot;
111 /* Place that this stack area has been saved, if needed. */
112 rtx save_area;
113 /* If an argument's alignment does not permit direct copying into registers,
114 copy in smaller-sized pieces into pseudos. These are stored in a
115 block pointed to by this field. The next field says how many
116 word-sized pseudos we made. */
119 };
121 /* A vector of one char per byte of stack space. A byte if nonzero if
122 the corresponding stack location has been used.
123 This vector is used to prevent a function call within an argument from
124 clobbering any stack already set up. */
127 /* Size of STACK_USAGE_MAP. */
130 /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding
131 stack location's tail call argument has been already stored into the stack.
132 This bitmap is used to prevent sibling call optimization if function tries
133 to use parent's incoming argument slots when they have been already
134 overwritten with tail call arguments. */
137 /* stack_arg_under_construction is nonzero when an argument may be
138 initialized with a constructor call (including a C function that
139 returns a BLKmode struct) and expand_call must take special action
140 to make sure the object being constructed does not overlap the
141 argument list for the constructor call. */
146 cumulative_args_t);
175 #ifdef REG_PARM_STACK_SPACE
178 #endif
179 \f
180 /* Force FUNEXP into a form suitable for the address of a CALL,
181 and return that as an rtx. Also load the static chain register
182 if FNDECL is a nested function.
184 CALL_FUSAGE points to a variable holding the prospective
185 CALL_INSN_FUNCTION_USAGE information. */
187 rtx
190 {
191 /* Make a valid memory address and copy constants through pseudo-regs,
192 but not for a constant address if -fno-function-cse. */
194 {
195 /* If it's an indirect call by descriptor, generate code to perform
196 runtime identification of the pointer and load the descriptor. */
198 {
203 fndecl_or_type
205 fndecl_or_type);
212 /* Avoid long live ranges around function calls. */
218 /* Emit the runtime identification pattern. */
221 call_lab);
223 /* Statically predict the branch to very likely taken. */
228 /* Load the descriptor. */
237 POINTER_SIZE / BITS_PER_UNIT
246 {
249 }
251 /* Make sure we're not going to be overwritten below. */
253 }
255 /* If we are using registers for parameters, force the
256 function address into a register now. */
257 funexp = ((reg_parm_seen
261 }
262 else
263 {
264 /* funexp could be a SYMBOL_REF represents a function pointer which is
265 of ptr_mode. In this case, it should be converted into address mode
266 to be a valid address for memory rtx pattern. See PR 64971. */
271 {
274 }
275 }
280 {
281 rtx chain;
288 {
291 }
292 }
295 }
297 /* Generate instructions to call function FUNEXP,
298 and optionally pop the results.
299 The CALL_INSN is the first insn generated.
301 FNDECL is the declaration node of the function. This is given to the
302 hook TARGET_RETURN_POPS_ARGS to determine whether this function pops
303 its own args.
305 FUNTYPE is the data type of the function. This is given to the hook
306 TARGET_RETURN_POPS_ARGS to determine whether this function pops its
307 own args. We used to allow an identifier for library functions, but
308 that doesn't work when the return type is an aggregate type and the
309 calling convention says that the pointer to this aggregate is to be
310 popped by the callee.
312 STACK_SIZE is the number of bytes of arguments on the stack,
313 ROUNDED_STACK_SIZE is that number rounded up to
314 PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is
315 both to put into the call insn and to generate explicit popping
316 code if necessary.
318 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
319 It is zero if this call doesn't want a structure value.
321 NEXT_ARG_REG is the rtx that results from executing
322 targetm.calls.function_arg (&args_so_far, VOIDmode, void_type_node, true)
323 just after all the args have had their registers assigned.
324 This could be whatever you like, but normally it is the first
325 arg-register beyond those used for args in this call,
326 or 0 if all the arg-registers are used in this call.
327 It is passed on to `gen_call' so you can put this info in the call insn.
329 VALREG is a hard register in which a value is returned,
330 or 0 if the call does not return a value.
332 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
333 the args to this call were processed.
334 We restore `inhibit_defer_pop' to that value.
336 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
337 denote registers used by the called function. */
339 static void
341 tree funtype ATTRIBUTE_UNUSED,
342 HOST_WIDE_INT stack_size ATTRIBUTE_UNUSED,
343 HOST_WIDE_INT rounded_stack_size,
344 HOST_WIDE_INT struct_value_size ATTRIBUTE_UNUSED,
347 cumulative_args_t args_so_far ATTRIBUTE_UNUSED)
348 {
354 /* Sibling call patterns never pop arguments (no sibcall(_value)_pop
355 patterns exist). Any popping that the callee does on return will
356 be from our caller's frame rather than ours. */
358 {
361 #ifdef CALL_POPS_ARGS
363 #endif
364 }
366 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
367 and we don't want to load it into a register as an optimization,
368 because prepare_call_address already did it if it should be done. */
374 {
377 /* Although a built-in FUNCTION_DECL and its non-__builtin
378 counterpart compare equal and get a shared mem_attrs, they
379 produce different dump output in compare-debug compilations,
380 if an entry gets garbage collected in one compilation, then
381 adds a different (but equivalent) entry, while the other
382 doesn't run the garbage collector at the same spot and then
383 shares the mem_attr with the equivalent entry. */
385 {
389 }
392 }
397 {
400 rounded_stack_size_rtx,
402 else
405 }
406 /* If the target has "call" or "call_value" insns, then prefer them
407 if no arguments are actually popped. If the target does not have
408 "call" or "call_value" insns, then we must use the popping versions
409 even if the call has no arguments to pop. */
411 || !(valreg
414 {
417 /* If this subroutine pops its own args, record that in the call insn
418 if possible, for the sake of frame pointer elimination. */
422 rounded_stack_size_rtx,
424 else
429 }
430 else
431 {
435 else
438 }
441 /* Find the call we just emitted. */
444 /* Some target create a fresh MEM instead of reusing the one provided
445 above. Set its MEM_EXPR. */
452 /* Mark instrumented calls. */
456 /* Put the register usage information there. */
459 /* If this is a const call, then set the insn's unchanging bit. */
463 /* If this is a pure call, then set the insn's unchanging bit. */
467 /* If this is a const call, then set the insn's unchanging bit. */
471 /* Create a nothrow REG_EH_REGION note, if needed. */
478 {
481 }
485 /* Restore this now, so that we do defer pops for this call's args
486 if the context of the call as a whole permits. */
490 {
502 /* If popup is needed, stack realign must use DRAP */
505 }
506 /* For noreturn calls when not accumulating outgoing args force
507 REG_ARGS_SIZE note to prevent crossjumping of calls with different
508 args sizes. */
513 {
514 /* If returning from the subroutine does not automatically pop the args,
515 we need an instruction to pop them sooner or later.
516 Perhaps do it now; perhaps just record how much space to pop later.
518 If returning from the subroutine does pop the args, indicate that the
519 stack pointer will be changed. */
522 {
524 /* Just pretend we did the pop. */
529 else
531 }
532 }
533 /* When we accumulate outgoing args, we must avoid any stack manipulations.
534 Restore the stack pointer to its original value now. Usually
535 ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions.
536 On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and
537 popping variants of functions exist as well.
539 ??? We may optimize similar to defer_pop above, but it is
540 probably not worthwhile.
542 ??? It will be worthwhile to enable combine_stack_adjustments even for
543 such machines. */
546 }
548 /* Determine if the function identified by FNDECL is one with
549 special properties we wish to know about. Modify FLAGS accordingly.
551 For example, if the function might return more than one time (setjmp), then
552 set ECF_RETURNS_TWICE.
554 Set ECF_MAY_BE_ALLOCA for any memory allocation function that might allocate
555 space from the stack such as alloca. */
557 static int
559 {
562 /* For instrumentation clones we want to derive flags
563 from the original name. */
570 /* Exclude functions not at the file scope, or not `extern',
571 since they are not the magic functions we would otherwise
572 think they are.
573 FIXME: this should be handled with attributes, not with this
574 hacky imitation of DECL_ASSEMBLER_NAME. It's (also) wrong
575 because you can declare fork() inside a function if you
576 wish. */
580 {
584 /* We assume that alloca will always be called by name. It
585 makes no sense to pass it as a pointer-to-function to
586 anything that does not understand its behavior. */
592 /* Disregard prefix _ or __. */
594 {
597 else
599 }
601 /* ECF_RETURNS_TWICE is safe even for -ffreestanding. */
608 }
612 {
619 }
622 }
624 /* Similar to special_function_p; return a set of ERF_ flags for the
625 function FNDECL. */
626 static int
628 {
629 tree attr;
643 {
656 }
657 }
659 /* Return nonzero when FNDECL represents a call to setjmp. */
661 int
663 {
667 }
670 /* Return true if STMT may be an alloca call. */
672 bool
674 {
675 tree fndecl;
685 }
687 /* Return true if STMT is a builtin alloca call. */
689 bool
691 {
692 tree fndecl;
700 {
706 }
709 }
711 /* Return true when exp contains a builtin alloca call. */
713 bool
715 {
716 tree fndecl;
721 {
727 }
730 }
732 /* Return TRUE if FNDECL is either a TM builtin or a TM cloned
733 function. Return FALSE otherwise. */
735 static bool
737 {
745 {
747 {
790 }
791 }
793 }
795 /* Detect flags (function attributes) from the function decl or type node. */
797 int
799 {
803 {
804 /* The function exp may have the `malloc' attribute. */
808 /* The function exp may have the `returns_twice' attribute. */
812 /* Process the pure and const attributes. */
829 {
836 }
839 }
841 {
849 }
850 else
854 {
858 }
861 }
863 /* Detect flags from a CALL_EXPR. */
865 int
867 {
875 else
876 {
880 else
884 }
887 }
889 /* Return true if TYPE should be passed by invisible reference. */
891 bool
894 {
896 {
897 /* If this type contains non-trivial constructors, then it is
898 forbidden for the middle-end to create any new copies. */
902 /* GCC post 3.4 passes *all* variable sized types by reference. */
906 /* If a record type should be passed the same as its first (and only)
907 member, use the type and mode of that member. */
909 {
912 }
913 }
917 }
919 /* Return true if TYPE, which is passed by reference, should be callee
920 copied instead of caller copied. */
922 bool
925 {
929 named_arg);
930 }
933 /* Precompute all register parameters as described by ARGS, storing values
934 into fields within the ARGS array.
936 NUM_ACTUALS indicates the total number elements in the ARGS array.
938 Set REG_PARM_SEEN if we encounter a register parameter. */
940 static void
943 {
950 {
954 {
959 }
961 /* If we are to promote the function arg to a wider mode,
962 do it now. */
970 /* If the value is a non-legitimate constant, force it into a
971 pseudo now. TLS symbols sometimes need a call to resolve. */
976 /* If we're going to have to load the value by parts, pull the
977 parts into pseudos. The part extraction process can involve
978 non-trivial computation. */
980 {
985 }
987 /* If the value is expensive, and we are inside an appropriately
988 short loop, put the value into a pseudo and then put the pseudo
989 into the hard reg.
991 For small register classes, also do this if this call uses
992 register parameters. This is to avoid reload conflicts while
993 loading the parameters registers. */
1002 && ((*reg_parm_seen
1006 }
1007 }
1009 #ifdef REG_PARM_STACK_SPACE
1011 /* The argument list is the property of the called routine and it
1012 may clobber it. If the fixed area has been used for previous
1013 parameters, we must save and restore it. */
1015 static rtx
1016 save_fixed_argument_area (int reg_parm_stack_space, rtx argblock, int *low_to_save, int *high_to_save)
1017 {
1021 /* Compute the boundary of the area that needs to be saved, if any. */
1031 {
1033 machine_mode save_mode;
1035 rtx addr;
1036 rtx stack_area;
1037 rtx save_area;
1040 ;
1048 /* If we don't have the required alignment, must do this
1049 in BLKmode. */
1056 else
1064 {
1068 }
1069 else
1070 {
1073 }
1076 }
1079 }
1081 static void
1083 {
1090 else
1099 else
1102 BLOCK_OP_CALL_PARM);
1103 }
1106 /* If any elements in ARGS refer to parameters that are to be passed in
1107 registers, but not in memory, and whose alignment does not permit a
1108 direct copy into registers. Copy the values into a group of pseudos
1109 which we will later copy into the appropriate hard registers.
1111 Pseudos for each unaligned argument will be stored into the array
1112 args[argnum].aligned_regs. The caller is responsible for deallocating
1113 the aligned_regs array if it is nonzero. */
1115 static void
1117 {
1127 {
1132 {
1135 }
1136 else
1137 {
1140 }
1144 /* Structures smaller than a word are normally aligned to the
1145 least significant byte. On a BYTES_BIG_ENDIAN machine,
1146 this means we must skip the empty high order bytes when
1147 calculating the bit offset. */
1149 #ifdef BLOCK_REG_PADDING
1153 #else
1154 && BYTES_BIG_ENDIAN
1155 #endif
1156 )
1160 {
1169 /* There is no need to restrict this code to loading items
1170 in TYPE_ALIGN sized hunks. The bitfield instructions can
1171 load up entire word sized registers efficiently.
1173 ??? This may not be needed anymore.
1174 We use to emit a clobber here but that doesn't let later
1175 passes optimize the instructions we emit. By storing 0 into
1176 the register later passes know the first AND to zero out the
1177 bitfield being set in the register is unnecessary. The store
1178 of 0 will be deleted as will at least the first AND. */
1185 }
1186 }
1187 }
1189 /* The limit set by -Walloc-larger-than=. */
1192 /* Initialize ALLOC_OBJECT_SIZE_LIMIT based on the -Walloc-size-larger-than=
1193 setting if the option is specified, or to the maximum object size if it
1194 is not. Return the initialized value. */
1196 static tree
1198 {
1200 {
1204 {
1208 unsigned HOST_WIDE_INT limit
1212 {
1214 {
1215 /* Numeric option arguments are at most INT_MAX. Make it
1216 possible to specify a larger value by accepting common
1217 suffixes. */
1242 else
1244 }
1247 alloc_object_size_limit
1249 }
1250 }
1251 }
1253 }
1255 /* Return true when EXP's range can be determined and set RANGE[] to it
1256 after adjusting it if necessary to make EXP a valid size argument to
1257 an allocation function declared with attribute alloc_size (whose
1258 argument may be signed), or to a string manipulation function like
1259 memset. */
1261 bool
1263 {
1265 {
1266 /* EXP is a constant. */
1269 }
1272 enum value_range_type range_type
1277 {
1278 /* No range information available. */
1282 }
1292 {
1294 {
1296 {
1297 /* EXP is not in a strictly negative range. That means
1298 it must be in some (not necessarily strictly) positive
1299 range which includes zero. Since in signed to unsigned
1300 conversions negative values end up converted to large
1301 positive values, and otherwise they are not valid sizes,
1302 the resulting range is in both cases [0, TYPE_MAX]. */
1305 }
1307 {
1308 /* EXP is not in a negative-positive range. That means EXP
1309 is either negative, or greater than max. Since negative
1310 sizes are invalid make the range [MAX + 1, TYPE_MAX]. */
1313 }
1314 else
1315 {
1318 }
1319 }
1321 {
1322 /* EXP is unsigned and not in the range [1, MAX]. That means
1323 it's either zero or greater than MAX. Even though 0 would
1324 normally be detected by -Walloc-zero set the range to
1325 [MAX, TYPE_MAX] so that when MAX is greater than the limit
1326 the whole range is diagnosed. */
1329 }
1330 else
1331 {
1334 }
1335 }
1341 }
1343 /* Diagnose a call EXP to function FN decorated with attribute alloc_size
1344 whose argument numbers given by IDX with values given by ARGS exceed
1345 the maximum object size or cause an unsigned oveflow (wrapping) when
1346 multiplied. When ARGS[0] is null the function does nothing. ARGS[1]
1347 may be null for functions like malloc, and non-null for those like
1348 calloc that are decorated with a two-argument attribute alloc_size. */
1350 void
1352 {
1353 /* The range each of the (up to) two arguments is known to be in. */
1356 /* Maximum object size set by -Walloc-size-larger-than= or SIZE_MAX / 2. */
1363 /* Validate each argument individually. */
1365 {
1367 {
1372 {
1376 }
1378 {
1379 /* Avoid issuing -Walloc-zero for allocation functions other
1380 than __builtin_alloca that are declared with attribute
1381 returns_nonnull because there's no portability risk. This
1382 avoids warning for such calls to libiberty's xmalloc and
1383 friends.
1384 Also avoid issuing the warning for calls to function named
1385 "alloca". */
1394 }
1396 {
1397 /* G++ emits calls to ::operator new[](SIZE_MAX) in C++98
1398 mode and with -fno-exceptions as a way to indicate array
1399 size overflow. There's no good way to detect C++98 here
1400 so avoid diagnosing these calls for all C++ modes. */
1409 "%Kargument %i value %qE exceeds "
1412 }
1413 }
1416 {
1417 /* Verify that the argument's range is not negative (including
1418 upper bound of zero). */
1421 {
1426 }
1428 {
1430 "%Kargument %i range [%E, %E] exceeds "
1434 maxobjsize);
1435 }
1436 }
1437 }
1442 /* For a two-argument alloc_size, validate the product of the two
1443 arguments if both of their values or ranges are known. */
1448 {
1449 /* Check for overflow in the product of a function decorated with
1450 attribute alloc_size (X, Y). */
1460 "%Kproduct %<%E * %E%> of arguments %i and %i "
1466 "%Kproduct %<%E * %E%> of arguments %i and %i "
1470 maxobjsize);
1473 {
1474 /* Print the full range of each of the two arguments to make
1475 it clear when it is, in fact, in a range and not constant. */
1482 }
1483 }
1486 {
1492 else
1495 }
1496 }
1498 /* Issue an error if CALL_EXPR was flagged as requiring
1499 tall-call optimization. */
1501 static void
1503 {
1509 }
1511 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1512 CALL_EXPR EXP.
1514 NUM_ACTUALS is the total number of parameters.
1516 N_NAMED_ARGS is the total number of named arguments.
1518 STRUCT_VALUE_ADDR_VALUE is the implicit argument for a struct return
1519 value, or null.
1521 FNDECL is the tree code for the target of this call (if known)
1523 ARGS_SO_FAR holds state needed by the target to know where to place
1524 the next argument.
1526 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1527 for arguments which are passed in registers.
1529 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1530 and may be modified by this routine.
1532 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
1533 flags which may be modified by this routine.
1535 MAY_TAILCALL is cleared if we encounter an invisible pass-by-reference
1536 that requires allocation of stack space.
1538 CALL_FROM_THUNK_P is true if this call is the jump from a thunk to
1539 the thunked-to function. */
1541 static void
1548 cumulative_args_t args_so_far,
1553 {
1557 /* Count arg position in order args appear. */
1567 /* In this loop, we consider args in the order they are written.
1568 We fill up ARGS from the back. */
1571 {
1573 call_expr_arg_iterator iter;
1574 tree arg;
1578 {
1580 j--;
1582 /* If we pass structure address then we need to
1583 create bounds for it. Since created bounds is
1584 a call statement, we expand it right here to avoid
1585 fixing all other places where it may be expanded. */
1587 {
1594 j--;
1595 }
1596 }
1599 {
1602 /* Remember last param with pointer and associate it
1603 with following pointer bounds. */
1606 {
1611 {
1614 }
1615 }
1619 {
1623 }
1625 {
1626 /* We expect bounds in instrumented calls only.
1627 Otherwise it is a sign we lost flag due to some optimization
1628 and may emit call args incorrectly. */
1631 /* For structures look for the next available pointer. */
1633 {
1640 /* Check we have no more pointers in the structure. */
1643 }
1646 /* Check we covered all pointers in the previous
1647 non bounds arg. */
1650 }
1651 else
1655 && argtype
1658 {
1661 j--;
1663 }
1664 else
1666 j--;
1667 argpos++;
1668 }
1672 }
1676 /* Extract attribute alloc_size and if set, store the indices of
1677 the corresponding arguments in ALLOC_IDX, and then the actual
1678 argument(s) at those indices in ALLOC_ARGS. */
1684 {
1689 }
1691 /* Array for up to the two attribute alloc_size arguments. */
1694 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1696 {
1699 machine_mode mode;
1701 /* Replace erroneous argument with constant zero. */
1705 /* If TYPE is a transparent union or record, pass things the way
1706 we would pass the first field of the union or record. We have
1707 already verified that the modes are the same. */
1712 /* Decide where to pass this arg.
1714 args[i].reg is nonzero if all or part is passed in registers.
1716 args[i].partial is nonzero if part but not all is passed in registers,
1717 and the exact value says how many bytes are passed in registers.
1719 args[i].pass_on_stack is nonzero if the argument must at least be
1720 computed on the stack. It may then be loaded back into registers
1721 if args[i].reg is nonzero.
1723 These decisions are driven by the FUNCTION_... macros and must agree
1724 with those made by function.c. */
1726 /* See if this argument should be passed by invisible reference. */
1729 {
1733 callee_copies
1737 /* If we're compiling a thunk, pass through invisible references
1738 instead of making a copy. */
1740 || (callee_copies
1745 {
1746 /* We may have turned the parameter value into an SSA name.
1747 Go back to the original parameter so we can take the
1748 address. */
1750 {
1754 }
1755 /* Argument setup code may have copied the value to register. We
1756 revert that optimization now because the tail call code must
1757 use the original location. */
1767 /* We can't use sibcalls if a callee-copied argument is
1768 stored in the current function's frame. */
1770 {
1773 "a callee-copied argument is"
1774 " stored in the current "
1776 }
1784 }
1785 else
1786 {
1787 /* We make a copy of the object and pass the address to the
1788 function being called. */
1789 rtx copy;
1796 {
1797 /* This is a variable-sized object. Make space on the stack
1798 for it. */
1802 {
1806 }
1808 /* We can pass TRUE as the 4th argument because we just
1809 saved the stack pointer and will restore it right after
1810 the call. */
1817 }
1818 else
1823 /* Just change the const function to pure and then let
1824 the next test clear the pure based on
1825 callee_copies. */
1827 {
1830 }
1840 "argument must be passed"
1842 }
1843 }
1856 {
1859 }
1861 /* If this is a sibling call and the machine has register windows, the
1862 register window has to be unwinded before calling the routine, so
1863 arguments have to go into the incoming registers. */
1868 else
1878 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1879 it means that we are to pass this arg in the register(s) designated
1880 by the PARALLEL, but also to pass it in the stack. */
1885 /* If this is an addressable type, we must preallocate the stack
1886 since we must evaluate the object into its final location.
1888 If this is to be passed in both registers and the stack, it is simpler
1889 to preallocate. */
1894 /* No stack allocation and padding for bounds. */
1896 ;
1897 /* Compute the stack-size of this argument. */
1902 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1904 #else
1906 #endif
1907 reg_parm_stack_space,
1910 #ifdef BLOCK_REG_PADDING
1911 else
1912 /* The argument is passed entirely in registers. See at which
1913 end it should be padded. */
1917 #endif
1919 /* Update ARGS_SIZE, the total stack space for args so far. */
1925 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1926 have been used, etc. */
1931 /* Store argument values for functions decorated with attribute
1932 alloc_size. */
1937 }
1940 {
1941 /* Check the arguments of functions decorated with attribute
1942 alloc_size. */
1944 }
1945 }
1947 /* Update ARGS_SIZE to contain the total size for the argument block.
1948 Return the original constant component of the argument block's size.
1950 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
1951 for arguments passed in registers. */
1953 static int
1956 tree fndecl ATTRIBUTE_UNUSED,
1957 tree fntype ATTRIBUTE_UNUSED,
1959 {
1962 /* For accumulate outgoing args mode we don't need to align, since the frame
1963 will be already aligned. Align to STACK_BOUNDARY in order to prevent
1964 backends from generating misaligned frame sizes. */
1968 /* Compute the actual size of the argument block required. The variable
1969 and constant sizes must be combined, the size may have to be rounded,
1970 and there may be a minimum required size. */
1973 {
1979 {
1980 /* We don't handle this case yet. To handle it correctly we have
1981 to add the delta, round and subtract the delta.
1982 Currently no machine description requires this support. */
1985 }
1988 {
1989 args_size->var
1993 /* The area corresponding to register parameters is not to count in
1994 the size of the block we need. So make the adjustment. */
1996 args_size->var
1999 }
2000 }
2001 else
2002 {
2007 + stack_pointer_delta
2009 / preferred_stack_boundary
2014 reg_parm_stack_space);
2018 }
2020 }
2022 /* Precompute parameters as needed for a function call.
2024 FLAGS is mask of ECF_* constants.
2026 NUM_ACTUALS is the number of arguments.
2028 ARGS is an array containing information for each argument; this
2029 routine fills in the INITIAL_VALUE and VALUE fields for each
2030 precomputed argument. */
2032 static void
2034 {
2037 /* If this is a libcall, then precompute all arguments so that we do not
2038 get extraneous instructions emitted as part of the libcall sequence. */
2040 /* If we preallocated the stack space, and some arguments must be passed
2041 on the stack, then we must precompute any parameter which contains a
2042 function call which will store arguments on the stack.
2043 Otherwise, evaluating the parameter may clobber previous parameters
2044 which have already been stored into the stack. (we have code to avoid
2045 such case by saving the outgoing stack arguments, but it results in
2046 worse code) */
2051 {
2052 tree type;
2053 machine_mode mode;
2058 /* If this is an addressable type, we cannot pre-evaluate it. */
2067 {
2073 /* CSE will replace this only if it contains args[i].value
2074 pseudo, so convert it down to the declared mode using
2075 a SUBREG. */
2079 {
2084 }
2085 }
2086 }
2087 }
2089 /* Given the current state of MUST_PREALLOCATE and information about
2090 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
2091 compute and return the final value for MUST_PREALLOCATE. */
2093 static int
2096 {
2097 /* See if we have or want to preallocate stack space.
2099 If we would have to push a partially-in-regs parm
2100 before other stack parms, preallocate stack space instead.
2102 If the size of some parm is not a multiple of the required stack
2103 alignment, we must preallocate.
2105 If the total size of arguments that would otherwise create a copy in
2106 a temporary (such as a CALL) is more than half the total argument list
2107 size, preallocation is faster.
2109 Another reason to preallocate is if we have a machine (like the m88k)
2110 where stack alignment is required to be maintained between every
2111 pair of insns, not just when the call is made. However, we assume here
2112 that such machines either do not have push insns (and hence preallocation
2113 would occur anyway) or the problem is taken care of with
2114 PUSH_ROUNDING. */
2117 {
2123 {
2128 /* We preallocate in case there are bounds passed
2129 in the bounds table to have precomputed address
2130 for bounds association. */
2140 copy_to_evaluate_size
2142 }
2147 }
2149 }
2151 /* If we preallocated stack space, compute the address of each argument
2152 and store it into the ARGS array.
2154 We need not ensure it is a valid memory address here; it will be
2155 validized when it is used.
2157 ARGBLOCK is an rtx for the address of the outgoing arguments. */
2159 static void
2161 {
2163 {
2171 {
2174 rtx addr;
2179 /* Skip this parm if it will not be passed on the stack. */
2185 /* Pointer Bounds are never passed on the stack. */
2191 else
2197 {
2198 /* Only part of the parameter is being passed on the stack.
2199 Generate a simple memory reference of the correct size. */
2205 }
2206 else
2207 {
2211 }
2217 {
2220 }
2225 else
2231 {
2232 /* Only part of the parameter is being passed on the stack.
2233 Generate a simple memory reference of the correct size.
2234 */
2237 }
2238 else
2239 {
2243 }
2246 /* Function incoming arguments may overlap with sibling call
2247 outgoing arguments and we cannot allow reordering of reads
2248 from function arguments with stores to outgoing arguments
2249 of sibling calls. */
2252 }
2253 }
2254 }
2256 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
2257 in a call instruction.
2259 FNDECL is the tree node for the target function. For an indirect call
2260 FNDECL will be NULL_TREE.
2262 ADDR is the operand 0 of CALL_EXPR for this call. */
2264 static rtx
2266 {
2267 rtx funexp;
2269 /* Get the function to call, in the form of RTL. */
2271 {
2275 /* Get a SYMBOL_REF rtx for the function address. */
2277 }
2278 else
2279 /* Generate an rtx (probably a pseudo-register) for the address. */
2280 {
2284 }
2286 }
2288 /* Internal state for internal_arg_pointer_based_exp and its helpers. */
2289 static struct
2290 {
2291 /* Last insn that has been scanned by internal_arg_pointer_based_exp_scan,
2292 or NULL_RTX if none has been scanned yet. */
2294 /* Vector indexed by REGNO - FIRST_PSEUDO_REGISTER, recording if a pseudo is
2295 based on crtl->args.internal_arg_pointer. The element is NULL_RTX if the
2296 pseudo isn't based on it, a CONST_INT offset if the pseudo is based on it
2297 with fixed offset, or PC if this is with variable or unknown offset. */
2303 /* Helper function for internal_arg_pointer_based_exp. Scan insns in
2304 the tail call sequence, starting with first insn that hasn't been
2305 scanned yet, and note for each pseudo on the LHS whether it is based
2306 on crtl->args.internal_arg_pointer or not, and what offset from that
2307 that pointer it has. */
2309 static void
2311 {
2316 else
2320 {
2323 {
2326 /* Punt on pseudos set multiple times. */
2331 else
2334 {
2336 internal_arg_pointer_exp_state.cache
2339 }
2340 }
2344 }
2347 }
2349 /* Compute whether RTL is based on crtl->args.internal_arg_pointer. Return
2350 NULL_RTX if RTL isn't based on it, a CONST_INT offset if RTL is based on
2351 it with fixed offset, or PC if this is with variable or unknown offset.
2352 TOPLEVEL is true if the function is invoked at the topmost level. */
2354 static rtx
2356 {
2367 {
2372 }
2374 /* When called at the topmost level, scan pseudo assignments in between the
2375 last scanned instruction in the tail call sequence and the latest insn
2376 in that sequence. */
2381 {
2387 }
2391 {
2397 }
2400 }
2402 /* Return true if and only if SIZE storage units (usually bytes)
2403 starting from address ADDR overlap with already clobbered argument
2404 area. This function is used to determine if we should give up a
2405 sibcall. */
2407 static bool
2409 {
2410 HOST_WIDE_INT i;
2411 rtx val;
2420 else
2425 else
2433 {
2440 }
2443 }
2445 /* Do the register loads required for any wholly-register parms or any
2446 parms which are passed both on the stack and in a register. Their
2447 expressions were already evaluated.
2449 Mark all register-parms as living through the call, putting these USE
2450 insns in the CALL_INSN_FUNCTION_USAGE field.
2452 When IS_SIBCALL, perform the check_sibcall_argument_overlap
2453 checking, setting *SIBCALL_FAILURE if appropriate. */
2455 static void
2459 {
2463 {
2467 {
2472 /* Set non-negative if we must move a word at a time, even if
2473 just one word (e.g, partial == 4 && mode == DFmode). Set
2474 to -1 if we just use a normal move insn. This value can be
2475 zero if the argument is a zero size structure. */
2478 ;
2480 {
2483 }
2485 {
2488 }
2489 else
2492 /* Handle calls that pass values in multiple non-contiguous
2493 locations. The Irix 6 ABI has examples of this. */
2498 /* If simple case, just do move. If normal partial, store_one_arg
2499 has already loaded the register for us. In all other cases,
2500 load the register(s) from memory. */
2503 {
2505 #ifdef BLOCK_REG_PADDING
2506 /* Handle case where we have a value that needs shifting
2507 up to the msb. eg. a QImode value and we're padding
2508 upward on a BYTES_BIG_ENDIAN machine. */
2512 {
2513 rtx x;
2516 /* Assigning REG here rather than a temp makes CALL_FUSAGE
2517 report the whole reg as used. Strictly speaking, the
2518 call only uses SIZE bytes at the msb end, but it doesn't
2519 seem worth generating rtl to say that. */
2524 }
2525 #endif
2526 }
2528 /* If we have pre-computed the values to put in the registers in
2529 the case of non-aligned structures, copy them in now. */
2537 {
2540 /* Check for overlap with already clobbered argument area,
2541 providing that this has non-zero size. */
2544 && (mem_overlaps_already_clobbered_arg_p
2551 else
2552 {
2561 NULL);
2567 }
2569 /* Handle a BLKmode that needs shifting. */
2571 #ifdef BLOCK_REG_PADDING
2573 #else
2574 && BYTES_BIG_ENDIAN
2575 #endif
2576 )
2577 {
2582 rtx x;
2587 }
2588 }
2590 /* When a parameter is a block, and perhaps in other cases, it is
2591 possible that it did a load from an argument slot that was
2592 already clobbered. */
2597 /* Handle calls that pass values in multiple non-contiguous
2598 locations. The Irix 6 ABI has examples of this. */
2606 }
2607 }
2608 }
2610 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
2611 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
2612 bytes, then we would need to push some additional bytes to pad the
2613 arguments. So, we compute an adjust to the stack pointer for an
2614 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
2615 bytes. Then, when the arguments are pushed the stack will be perfectly
2616 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
2617 be popped after the call. Returns the adjustment. */
2619 static int
2623 {
2624 /* The number of bytes to pop so that the stack will be
2625 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
2626 HOST_WIDE_INT adjustment;
2627 /* The alignment of the stack after the arguments are pushed, if we
2628 just pushed the arguments without adjust the stack here. */
2631 unadjusted_alignment
2635 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
2636 as possible -- leaving just enough left to cancel out the
2637 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
2638 PENDING_STACK_ADJUST is non-negative, and congruent to
2639 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
2641 /* Begin by trying to pop all the bytes. */
2642 unadjusted_alignment
2643 = (unadjusted_alignment
2646 /* Push enough additional bytes that the stack will be aligned
2647 after the arguments are pushed. */
2651 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
2652 bytes after the call. The right number is the entire
2653 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
2654 by the arguments in the first place. */
2655 args_size->constant
2659 }
2661 /* Scan X expression if it does not dereference any argument slots
2662 we already clobbered by tail call arguments (as noted in stored_args_map
2663 bitmap).
2664 Return nonzero if X expression dereferences such argument slots,
2665 zero otherwise. */
2667 static int
2669 {
2670 RTX_CODE code;
2679 /* We need not check the operands of the CALL expression itself. */
2687 /* Scan all subexpressions. */
2690 {
2692 {
2695 }
2697 {
2701 }
2702 }
2704 }
2706 /* Scan sequence after INSN if it does not dereference any argument slots
2707 we already clobbered by tail call arguments (as noted in stored_args_map
2708 bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to
2709 stored_args_map bitmap afterwards (when ARG is a register MARK_STORED_ARGS_MAP
2710 should be 0). Return nonzero if sequence after INSN dereferences such argument
2711 slots, zero otherwise. */
2713 static int
2716 {
2721 else
2730 {
2733 else
2738 }
2740 }
2742 /* Given that a function returns a value of mode MODE at the most
2743 significant end of hard register VALUE, shift VALUE left or right
2744 as specified by LEFT_P. Return true if some action was needed. */
2746 bool
2748 {
2749 HOST_WIDE_INT shift;
2756 /* Use ashr rather than lshr for right shifts. This is for the benefit
2757 of the MIPS port, which requires SImode values to be sign-extended
2758 when stored in 64-bit registers. */
2763 }
2765 /* If X is a likely-spilled register value, copy it to a pseudo
2766 register and return that register. Return X otherwise. */
2768 static rtx
2770 {
2771 rtx new_rtx;
2776 {
2777 /* Make sure that we generate a REG rather than a CONCAT.
2778 Moves into CONCATs can need nontrivial instructions,
2779 and the whole point of this function is to avoid
2780 using the hard register directly in such a situation. */
2786 }
2788 }
2790 /* Helper function for expand_call.
2791 Return false is EXP is not implementable as a sibling call. */
2793 static bool
2795 rtx structure_value_addr,
2796 tree funtype,
2798 tree fndecl,
2800 tree addr,
2802 {
2804 {
2805 maybe_complain_about_tail_call
2807 "machine description does not have"
2810 }
2812 /* Doing sibling call optimization needs some work, since
2813 structure_value_addr can be allocated on the stack.
2814 It does not seem worth the effort since few optimizable
2815 sibling calls will return a structure. */
2817 {
2820 }
2822 #ifdef REG_PARM_STACK_SPACE
2823 /* If outgoing reg parm stack space changes, we can not do sibcall. */
2827 {
2829 "inconsistent size of stack space"
2830 " allocated for arguments which are"
2833 }
2834 #endif
2836 /* Check whether the target is able to optimize the call
2837 into a sibcall. */
2839 {
2841 "target is not able to optimize the"
2844 }
2846 /* Functions that do not return exactly once may not be sibcall
2847 optimized. */
2849 {
2852 }
2854 {
2857 }
2860 {
2863 }
2865 /* If the called function is nested in the current one, it might access
2866 some of the caller's arguments, but could clobber them beforehand if
2867 the argument areas are shared. */
2869 {
2872 }
2874 /* If this function requires more stack slots than the current
2875 function, we cannot change it into a sibling call.
2876 crtl->args.pretend_args_size is not part of the
2877 stack allocated by our caller. */
2879 {
2881 "callee required more stack slots"
2884 }
2886 /* If the callee pops its own arguments, then it must pop exactly
2887 the same number of arguments as the current function. */
2892 {
2894 "inconsistent number of"
2897 }
2900 {
2904 }
2906 /* All checks passed. */
2908 }
2910 /* Generate all the code for a CALL_EXPR exp
2911 and return an rtx for its value.
2912 Store the value in TARGET (specified as an rtx) if convenient.
2913 If the value is stored in TARGET then TARGET is returned.
2914 If IGNORE is nonzero, then we ignore the value of the function call. */
2916 rtx
2918 {
2919 /* Nonzero if we are currently expanding a call. */
2922 /* RTX for the function to be called. */
2923 rtx funexp;
2924 /* Sequence of insns to perform a normal "call". */
2926 /* Sequence of insns to perform a tail "call". */
2928 /* Data type of the function. */
2929 tree funtype;
2930 tree type_arg_types;
2931 tree rettype;
2932 /* Declaration of the function being called,
2933 or 0 if the function is computed (not known by name). */
2935 /* The type of the function being called. */
2936 tree fntype;
2941 /* Register in which non-BLKmode value will be returned,
2942 or 0 if no value or if value is BLKmode. */
2943 rtx valreg;
2944 /* Register(s) in which bounds are returned. */
2946 /* Address where we should return a BLKmode value;
2947 0 if value not BLKmode. */
2949 /* Nonzero if that address is being passed by treating it as
2950 an extra, implicit first parameter. Otherwise,
2951 it is passed by being copied directly into struct_value_rtx. */
2953 /* Holds the value of implicit argument for the struct value. */
2955 /* Size of aggregate value wanted, or zero if none wanted
2956 or if we are using the non-reentrant PCC calling convention
2957 or expecting the value in registers. */
2959 /* Nonzero if called function returns an aggregate in memory PCC style,
2960 by returning the address of where to find it. */
2964 /* Number of actual parameters in this call, including struct value addr. */
2966 /* Number of named args. Args after this are anonymous ones
2967 and they must all go on the stack. */
2969 /* Number of complex actual arguments that need to be split. */
2972 /* Vector of information about each argument.
2973 Arguments are numbered in the order they will be pushed,
2974 not the order they are written. */
2977 /* Total size in bytes of all the stack-parms scanned so far. */
2980 /* Size of arguments before any adjustments (such as rounding). */
2982 /* Data on reg parms scanned so far. */
2983 CUMULATIVE_ARGS args_so_far_v;
2984 cumulative_args_t args_so_far;
2985 /* Nonzero if a reg parm has been scanned. */
2987 /* Nonzero if this is an indirect function call. */
2989 /* Nonzero if we must avoid push-insns in the args for this call.
2990 If stack space is allocated for register parameters, but not by the
2991 caller, then it is preallocated in the fixed part of the stack frame.
2992 So the entire argument block must then be preallocated (i.e., we
2993 ignore PUSH_ROUNDING in that case). */
2997 /* Size of the stack reserved for parameter registers. */
3000 /* Address of space preallocated for stack parms
3001 (on machines that lack push insns), or 0 if space not preallocated. */
3004 /* Mask of ECF_ and ERF_ flags. */
3007 #ifdef REG_PARM_STACK_SPACE
3008 /* Define the boundary of the register parm stack space that needs to be
3009 saved, if any. */
3012 #endif
3020 /* State variables to track stack modifications. */
3026 /* Some stack pointer alterations we make are performed via
3027 allocate_dynamic_stack_space. This modifies the stack_pointer_delta,
3028 which we then also need to save/restore along the way. */
3031 rtx call_fusage;
3034 /* The alignment of the stack, in bits. */
3036 /* The alignment of the stack, in bytes. */
3038 /* The static chain value to use for this call. */
3039 rtx static_chain_value;
3040 /* See if this is "nothrow" function call. */
3044 /* See if we can find a DECL-node for the actual function, and get the
3045 function attributes (flags) from the function decl or type node. */
3048 {
3052 }
3053 else
3054 {
3059 }
3064 /* Warn if this value is an aggregate type,
3065 regardless of which calling convention we are using for it. */
3069 /* If the result of a non looping pure or const function call is
3070 ignored (or void), and none of its arguments are volatile, we can
3071 avoid expanding the call and just evaluate the arguments for
3072 side-effects. */
3077 {
3079 tree arg;
3080 call_expr_arg_iterator iter;
3084 {
3087 }
3090 {
3094 }
3095 }
3097 #ifdef REG_PARM_STACK_SPACE
3099 #endif
3105 /* Set up a place to return a structure. */
3107 /* Cater to broken compilers. */
3109 {
3110 /* This call returns a big structure. */
3113 #ifdef PCC_STATIC_STRUCT_RETURN
3114 {
3116 }
3118 {
3121 /* Even if it is semantically safe to use the target as the return
3122 slot, it may be not sufficiently aligned for the return type. */
3124 && target
3130 else
3131 {
3132 /* For variable-sized objects, we must be called with a target
3133 specified. If we were to allocate space on the stack here,
3134 we would have no way of knowing when to free it. */
3138 }
3139 }
3141 }
3143 /* Figure out the amount to which the stack should be aligned. */
3146 {
3148 /* Without automatic stack alignment, we can't increase preferred
3149 stack boundary. With automatic stack alignment, it is
3150 unnecessary since unless we can guarantee that all callers will
3151 align the outgoing stack properly, callee has to align its
3152 stack anyway. */
3157 }
3159 /* Operand 0 is a pointer-to-function; get the type of the function. */
3164 /* Count whether there are actual complex arguments that need to be split
3165 into their real and imaginary parts. Munge the type_arg_types
3166 appropriately here as well. */
3168 {
3169 call_expr_arg_iterator iter;
3170 tree arg;
3172 {
3176 num_complex_actuals++;
3177 }
3179 }
3180 else
3186 /* If struct_value_rtx is 0, it means pass the address
3187 as if it were an extra parameter. Put the argument expression
3188 in structure_value_addr_value. */
3190 {
3191 /* If structure_value_addr is a REG other than
3192 virtual_outgoing_args_rtx, we can use always use it. If it
3193 is not a REG, we must always copy it into a register.
3194 If it is virtual_outgoing_args_rtx, we must copy it to another
3195 register in some cases. */
3197 || (ACCUMULATE_OUTGOING_ARGS
3198 && stack_arg_under_construction
3204 structure_value_addr_value =
3207 }
3209 /* Count the arguments and set NUM_ACTUALS. */
3210 num_actuals =
3213 /* Compute number of named args.
3214 First, do a raw count of the args for INIT_CUMULATIVE_ARGS. */
3217 n_named_args
3219 /* Count the struct value address, if it is passed as a parm. */
3221 else
3222 /* If we know nothing, treat all args as named. */
3225 /* Start updating where the next arg would go.
3227 On some machines (such as the PA) indirect calls have a different
3228 calling convention than normal calls. The fourth argument in
3229 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
3230 or not. */
3234 /* Now possibly adjust the number of named args.
3235 Normally, don't include the last named arg if anonymous args follow.
3236 We do include the last named arg if
3237 targetm.calls.strict_argument_naming() returns nonzero.
3238 (If no anonymous args follow, the result of list_length is actually
3239 one too large. This is harmless.)
3241 If targetm.calls.pretend_outgoing_varargs_named() returns
3242 nonzero, and targetm.calls.strict_argument_naming() returns zero,
3243 this machine will be able to place unnamed args that were passed
3244 in registers into the stack. So treat all args as named. This
3245 allows the insns emitting for a specific argument list to be
3246 independent of the function declaration.
3248 If targetm.calls.pretend_outgoing_varargs_named() returns zero,
3249 we do not have any reliable way to pass unnamed args in
3250 registers, so we must force them into memory. */
3254 ;
3257 /* Don't include the last named arg. */
3259 else
3260 /* Treat all args as named. */
3263 /* Make a vector to hold all the information about each arg. */
3266 /* Build up entries in the ARGS array, compute the size of the
3267 arguments into ARGS_SIZE, etc. */
3279 /* Now make final decision about preallocating stack space. */
3284 /* If the structure value address will reference the stack pointer, we
3285 must stabilize it. We don't need to do this if we know that we are
3286 not going to adjust the stack pointer in processing this call. */
3291 structure_value_addr))
3296 /* Tail calls can make things harder to debug, and we've traditionally
3297 pushed these optimizations into -O2. Don't try if we're already
3298 expanding a call, as that means we're an argument. Don't try if
3299 there's cleanups, as we know there's code to follow the call. */
3302 || !flag_optimize_sibling_calls
3307 /* If the user has marked the function as requiring tail-call
3308 optimization, attempt it. */
3312 /* Rest of purposes for tail call optimizations to fail. */
3315 structure_value_addr,
3316 funtype,
3317 reg_parm_stack_space,
3318 fndecl,
3321 /* Check if caller and callee disagree in promotion of function
3322 return value. */
3324 {
3334 caller_promoted_mode
3338 callee_promoted_mode
3349 {
3352 "caller and callee disagree in"
3353 " promotion of function"
3355 }
3356 }
3358 /* Ensure current function's preferred stack boundary is at least
3359 what we need. Stack alignment may also increase preferred stack
3360 boundary. */
3363 else
3368 /* We want to make two insn chains; one for a sibling call, the other
3369 for a normal call. We will select one of the two chains after
3370 initial RTL generation is complete. */
3372 {
3374 /* We want to emit any pending stack adjustments before the tail
3375 recursion "call". That way we know any adjustment after the tail
3376 recursion call can be ignored if we indeed use the tail
3377 call expansion. */
3378 saved_pending_stack_adjust save;
3380 rtx next_arg_reg;
3383 {
3384 /* State variables we need to save and restore between
3385 iterations. */
3387 }
3390 else
3393 /* Other state variables that we must reinitialize each time
3394 through the loop (that are not initialized by the loop itself). */
3398 /* Start a new sequence for the normal call case.
3400 From this point on, if the sibling call fails, we want to set
3401 sibcall_failure instead of continuing the loop. */
3404 /* Don't let pending stack adjusts add up to too much.
3405 Also, do all pending adjustments now if there is any chance
3406 this might be a call to alloca or if we are expanding a sibling
3407 call sequence.
3408 Also do the adjustments before a throwing call, otherwise
3409 exception handling can fail; PR 19225. */
3418 /* Precompute any arguments as needed. */
3422 /* Now we are about to start emitting insns that can be deleted
3423 if a libcall is deleted. */
3433 /* Compute the actual size of the argument block required. The variable
3434 and constant sizes must be combined, the size may have to be rounded,
3435 and there may be a minimum required size. When generating a sibcall
3436 pattern, do not round up, since we'll be re-using whatever space our
3437 caller provided. */
3438 unadjusted_args_size
3447 /* The argument block when performing a sibling call is the
3448 incoming argument block. */
3450 {
3453 argblock
3455 else
3456 argblock
3461 }
3463 /* If we have no actual push instructions, or shouldn't use them,
3464 make space for all args right now. */
3466 {
3468 {
3473 /* stack_arg_under_construction says whether a stack arg is
3474 being constructed at the old stack level. Pushing the stack
3475 gets a clean outgoing argument block. */
3478 }
3482 }
3483 else
3484 {
3485 /* Note that we must go through the motions of allocating an argument
3486 block even if the size is zero because we may be storing args
3487 in the area reserved for register arguments, which may be part of
3488 the stack frame. */
3492 /* Store the maximum argument space used. It will be pushed by
3493 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
3494 checking). */
3500 {
3502 {
3503 /* Since the stack pointer will never be pushed, it is
3504 possible for the evaluation of a parm to clobber
3505 something we have already written to the stack.
3506 Since most function calls on RISC machines do not use
3507 the stack, this is uncommon, but must work correctly.
3509 Therefore, we save any area of the stack that was already
3510 written and that we are using. Here we set up to do this
3511 by making a new stack usage map from the old one. The
3512 actual save will be done by store_one_arg.
3514 Another approach might be to try to reorder the argument
3515 evaluations to avoid this conflicting stack usage. */
3517 /* Since we will be writing into the entire argument area,
3518 the map must be allocated for its entire size, not just
3519 the part that is the responsibility of the caller. */
3524 highest_outgoing_arg_in_use
3526 else
3527 highest_outgoing_arg_in_use
3536 initial_highest_arg_in_use);
3540 (highest_outgoing_arg_in_use
3544 /* The address of the outgoing argument list must not be
3545 copied to a register here, because argblock would be left
3546 pointing to the wrong place after the call to
3547 allocate_dynamic_stack_space below. */
3550 }
3551 else
3552 {
3554 {
3555 /* Try to reuse some or all of the pending_stack_adjust
3556 to get this space. */
3557 needed
3558 = (combine_pending_stack_adjustment_and_call
3561 preferred_unit_stack_boundary));
3563 /* combine_pending_stack_adjustment_and_call computes
3564 an adjustment before the arguments are allocated.
3565 Account for them and see whether or not the stack
3566 needs to go up or down. */
3570 {
3571 /* We're releasing stack space. */
3572 /* ??? We can avoid any adjustment at all if we're
3573 already aligned. FIXME. */
3577 }
3578 else
3579 /* We need to allocate space. We'll do that in
3580 push_block below. */
3582 }
3584 /* Special case this because overhead of `push_block' in
3585 this case is non-trivial. */
3588 else
3589 {
3593 }
3595 /* We only really need to call `copy_to_reg' in the case
3596 where push insns are going to be used to pass ARGBLOCK
3597 to a function call in ARGS. In that case, the stack
3598 pointer changes value from the allocation point to the
3599 call point, and hence the value of
3600 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
3601 as well always do it. */
3603 }
3604 }
3605 }
3608 {
3609 /* The save/restore code in store_one_arg handles all
3610 cases except one: a constructor call (including a C
3611 function returning a BLKmode struct) to initialize
3612 an argument. */
3614 {
3615 rtx push_size
3621 {
3626 /* stack_arg_under_construction says whether a stack
3627 arg is being constructed at the old stack level.
3628 Pushing the stack gets a clean outgoing argument
3629 block. */
3630 old_stack_arg_under_construction
3633 /* Make a new map for the new argument list. */
3638 }
3639 /* We can pass TRUE as the 4th argument because we just
3640 saved the stack pointer and will restore it right after
3641 the call. */
3644 }
3646 /* If argument evaluation might modify the stack pointer,
3647 copy the address of the argument list to a register. */
3650 {
3653 }
3654 }
3658 /* Stack is properly aligned, pops can't safely be deferred during
3659 the evaluation of the arguments. */
3660 NO_DEFER_POP;
3662 /* Precompute all register parameters. It isn't safe to compute
3663 anything once we have started filling any specific hard regs.
3664 TLS symbols sometimes need a call to resolve. Precompute
3665 register parameters before any stack pointer manipulation
3666 to avoid unaligned stack in the called function. */
3669 OK_DEFER_POP;
3671 /* Perform stack alignment before the first push (the last arg). */
3675 {
3676 /* When the stack adjustment is pending, we get better code
3677 by combining the adjustments. */
3680 {
3681 pending_stack_adjust
3682 = (combine_pending_stack_adjustment_and_call
3685 preferred_unit_stack_boundary));
3687 }
3691 }
3692 /* Now that the stack is properly aligned, pops can't safely
3693 be deferred during the evaluation of the arguments. */
3694 NO_DEFER_POP;
3696 /* Record the maximum pushed stack space size. We need to delay
3697 doing it this far to take into account the optimization done
3698 by combine_pending_stack_adjustment_and_call. */
3700 && !ACCUMULATE_OUTGOING_ARGS
3701 && pass
3703 {
3707 }
3713 else
3716 #ifdef REG_PARM_STACK_SPACE
3717 /* Save the fixed argument area if it's part of the caller's frame and
3718 is clobbered by argument setup for this call. */
3722 #endif
3724 /* Now store (and compute if necessary) all non-register parms.
3725 These come before register parms, since they can require block-moves,
3726 which could clobber the registers used for register parms.
3727 Parms which have partial registers are not stored here,
3728 but we do preallocate space here if they want that. */
3731 {
3732 /* Delay bounds until all other args are stored. */
3736 {
3739 /* We don't allow passing huge (> 2^30 B) arguments
3740 by value. It would cause an overflow later on. */
3743 {
3746 }
3750 reg_parm_stack_space)
3755 }
3758 call_fusage
3761 call_fusage);
3762 }
3764 /* If we have a parm that is passed in registers but not in memory
3765 and whose alignment does not permit a direct copy into registers,
3766 make a group of pseudos that correspond to each register that we
3767 will later fill. */
3771 /* Now store any partially-in-registers parm.
3772 This is the last place a block-move can happen. */
3776 {
3779 /* On targets with weird calling conventions (e.g. PA) it's
3780 hard to ensure that all cases of argument overlap between
3781 stack and registers work. Play it safe and bail out. */
3783 {
3786 }
3790 reg_parm_stack_space)
3795 }
3800 {
3803 }
3807 /* Figure out the register where the value, if any, will come back. */
3812 {
3814 {
3821 }
3822 else
3823 {
3828 fndecl,
3830 }
3832 /* If VALREG is a PARALLEL whose first member has a zero
3833 offset, use that. This is for targets such as m68k that
3834 return the same value in multiple places. */
3836 {
3843 }
3844 }
3846 /* Store all bounds not passed in registers. */
3848 {
3853 ? NULL
3855 }
3857 /* If register arguments require space on the stack and stack space
3858 was not preallocated, allocate stack space here for arguments
3859 passed in registers. */
3861 && !ACCUMULATE_OUTGOING_ARGS
3865 /* Pass the function the address in which to return a
3866 structure value. */
3868 {
3869 structure_value_addr
3874 NULL_RTX)));
3878 }
3888 /* Save a pointer to the last insn before the call, so that we can
3889 later safely search backwards to find the CALL_INSN. */
3892 /* Set up next argument register. For sibling calls on machines
3893 with register windows this should be the incoming register. */
3896 VOIDmode,
3897 void_type_node,
3899 else
3905 {
3911 && valreg
3914 call_fusage
3917 call_fusage);
3918 }
3919 /* All arguments and registers used for the call must be set up by
3920 now! */
3922 /* Stack must be properly aligned now. */
3926 /* Generate the actual call instruction. */
3933 {
3937 {
3941 }
3944 }
3946 /* If the call setup or the call itself overlaps with anything
3947 of the argument setup we probably clobbered our call address.
3948 In that case we can't do sibcalls. */
3953 /* If a non-BLKmode value is returned at the most significant end
3954 of a register, shift the register right by the appropriate amount
3955 and update VALREG accordingly. BLKmode values are handled by the
3956 group load/store machinery below. */
3958 && !pcc_struct_value
3963 {
3967 }
3970 {
3974 /* The return value from a malloc-like function is a pointer. */
3980 /* The return value from a malloc-like function can not alias
3981 anything else. */
3985 /* Write out the sequence. */
3990 }
3992 /* For calls to `setjmp', etc., inform
3993 function.c:setjmp_warnings that it should complain if
3994 nonvolatile values are live. For functions that cannot
3995 return, inform flow that control does not fall through. */
3998 {
3999 /* The barrier must be emitted
4000 immediately after the CALL_INSN. Some ports emit more
4001 than just a CALL_INSN above, so we must search for it here. */
4005 {
4007 /* There was no CALL_INSN? */
4009 }
4013 /* Stack adjustments after a noreturn call are dead code.
4014 However when NO_DEFER_POP is in effect, we must preserve
4015 stack_pointer_delta. */
4017 {
4020 }
4021 }
4023 /* If value type not void, return an rtx for the value. */
4029 {
4031 {
4032 target
4035 structure_value_addr));
4037 }
4038 }
4040 {
4041 /* This is the special C++ case where we need to
4042 know what the true target was. We take care to
4043 never use this value more than once in one expression. */
4047 }
4048 /* Handle calls that return values in multiple non-contiguous locations.
4049 The Irix 6 ABI has examples of this. */
4051 {
4055 ;
4057 /* Handle the result of a emit_group_move_into_temps
4058 call in the previous pass. */
4060 else
4063 }
4067 {
4070 /* We have to copy a return value in a CLASS_LIKELY_SPILLED hard
4071 reg to a plain register. */
4075 /* If TARGET is a MEM in the argument area, and we have
4076 saved part of the argument area, then we can't store
4077 directly into TARGET as it may get overwritten when we
4078 restore the argument save area below. Don't work too
4079 hard though and simply force TARGET to a register if it
4080 is a MEM; the optimizer is quite likely to sort it out. */
4084 {
4087 }
4091 else
4092 {
4093 /* TARGET and VALREG cannot be equal at this point
4094 because the latter would not have
4095 REG_FUNCTION_VALUE_P true, while the former would if
4096 it were referring to the same register.
4098 If they refer to the same register, this move will be
4099 a no-op, except when function inlining is being
4100 done. */
4103 /* If we are setting a MEM, this code must be executed.
4104 Since it is emitted after the call insn, sibcall
4105 optimization cannot be performed in that case. */
4108 }
4109 }
4110 else
4113 /* If we promoted this return value, make the proper SUBREG.
4114 TARGET might be const0_rtx here, so be careful. */
4118 {
4122 machine_mode pmode;
4124 /* Ensure we promote as expected, and get the new unsignedness. */
4132 {
4139 }
4144 }
4146 /* If size of args is variable or this was a constructor call for a stack
4147 argument, restore saved stack-pointer value. */
4150 {
4164 }
4166 {
4167 #ifdef REG_PARM_STACK_SPACE
4171 #endif
4173 /* If we saved any argument areas, restore them. */
4176 {
4178 rtx stack_area
4185 else
4188 BLOCK_OP_CALL_PARM);
4189 }
4193 }
4195 /* If this was alloca, record the new stack level. */
4199 /* Free up storage we no longer need. */
4209 {
4212 /* Restore the pending stack adjustment now that we have
4213 finished generating the sibling call sequence. */
4217 /* Prepare arg structure for next iteration. */
4219 {
4223 }
4228 }
4229 else
4230 {
4233 /* Verify that we've deallocated all the stack we used. */
4235 || (old_stack_allocated
4237 }
4239 /* If something prevents making this a sibling call,
4240 zero out the sequence. */
4243 else
4245 }
4247 /* If tail call production succeeded, we need to remove REG_EQUIV notes on
4248 arguments too, as argument area is now clobbered by the call. */
4250 {
4253 }
4254 else
4255 {
4258 /* Ideally we'd emit a message for all of the ways that it could
4259 have failed. */
4261 }
4263 currently_expanding_call--;
4268 /* Join result with returned bounds so caller may use them if needed. */
4272 }
4274 /* A sibling call sequence invalidates any REG_EQUIV notes made for
4275 this function's incoming arguments.
4277 At the start of RTL generation we know the only REG_EQUIV notes
4278 in the rtl chain are those for incoming arguments, so we can look
4279 for REG_EQUIV notes between the start of the function and the
4280 NOTE_INSN_FUNCTION_BEG.
4282 This is (slight) overkill. We could keep track of the highest
4283 argument we clobber and be more selective in removing notes, but it
4284 does not seem to be worth the effort. */
4286 void
4288 {
4292 {
4293 rtx note;
4295 /* There are never REG_EQUIV notes for the incoming arguments
4296 after the NOTE_INSN_FUNCTION_BEG note, so stop if we see it. */
4306 }
4307 }
4309 /* Traverse a list of TYPES and expand all complex types into their
4310 components. */
4311 static tree
4313 {
4314 tree p;
4316 /* Before allocating memory, check for the common case of no complex. */
4318 {
4323 }
4326 found:
4330 {
4335 {
4338 /* Rewrite complex type with component type. */
4342 /* Add another component type for the imaginary part. */
4347 /* Skip the newly created node. */
4349 }
4350 }
4353 }
4354 \f
4355 /* Output a library call to function FUN (a SYMBOL_REF rtx).
4356 The RETVAL parameter specifies whether return value needs to be saved, other
4357 parameters are documented in the emit_library_call function below. */
4359 static rtx
4363 {
4364 /* Total size in bytes of all the stack-parms scanned so far. */
4366 /* Size of arguments before any adjustments (such as rounding). */
4369 rtx fun;
4370 /* Todo, choose the correct decl type of orgfun. Sadly this information
4371 isn't present here, so we default to native calling abi here. */
4376 CUMULATIVE_ARGS args_so_far_v;
4377 cumulative_args_t args_so_far;
4378 struct arg
4379 {
4380 rtx value;
4381 machine_mode mode;
4382 rtx reg;
4385 rtx save_area;
4386 };
4391 rtx valreg;
4401 #ifdef REG_PARM_STACK_SPACE
4402 /* Define the boundary of the register parm stack space that needs to be
4403 save, if any. */
4406 #endif
4408 /* Size of the stack reserved for parameter registers. */
4415 #ifdef REG_PARM_STACK_SPACE
4417 #endif
4419 /* By default, library functions cannot throw. */
4423 {
4441 }
4444 /* Ensure current function's preferred stack boundary is at least
4445 what we need. */
4449 /* If this kind of value comes back in memory,
4450 decide where in memory it should come back. */
4452 {
4455 {
4456 #ifdef PCC_STATIC_STRUCT_RETURN
4457 rtx pointer_reg
4467 else
4469 #endif
4470 /* This call returns a big structure. */
4472 }
4473 }
4474 else
4477 /* ??? Unfinished: must pass the memory address as an argument. */
4479 /* Copy all the libcall-arguments out of the varargs data
4480 and into a vector ARGVEC.
4482 Compute how to pass each argument. We only support a very small subset
4483 of the full argument passing conventions to limit complexity here since
4484 library functions shouldn't have many args. */
4489 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
4491 #else
4493 #endif
4503 /* If there's a structure value address to be passed,
4504 either pass it in the special place, or pass it as an extra argument. */
4506 {
4509 nargs++;
4511 /* Make sure it is a reasonable operand for a move or push insn. */
4527 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4529 #else
4531 #endif
4541 count++;
4542 }
4545 {
4550 /* We cannot convert the arg value to the mode the library wants here;
4551 must do it earlier where we know the signedness of the arg. */
4555 /* Make sure it is a reasonable operand for a move or push insn. */
4561 {
4562 rtx slot;
4563 int must_copy
4566 /* If this was a CONST function, it is now PURE since it now
4567 reads memory. */
4569 {
4572 }
4575 {
4580 }
4581 else
4582 {
4586 }
4590 call_fusage);
4594 slot),
4595 call_fusage);
4599 }
4613 {
4615 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4617 #else
4619 #endif
4624 }
4625 #ifdef BLOCK_REG_PADDING
4626 else
4627 /* The argument is passed entirely in registers. See at which
4628 end it should be padded. */
4632 #endif
4635 }
4637 /* If this machine requires an external definition for library
4638 functions, write one out. */
4643 + stack_pointer_delta
4645 / STACK_BYTES
4650 reg_parm_stack_space);
4659 {
4663 }
4666 {
4667 /* Since the stack pointer will never be pushed, it is possible for
4668 the evaluation of a parm to clobber something we have already
4669 written to the stack. Since most function calls on RISC machines
4670 do not use the stack, this is uncommon, but must work correctly.
4672 Therefore, we save any area of the stack that was already written
4673 and that we are using. Here we set up to do this by making a new
4674 stack usage map from the old one.
4676 Another approach might be to try to reorder the argument
4677 evaluations to avoid this conflicting stack usage. */
4681 /* Since we will be writing into the entire argument area, the
4682 map must be allocated for its entire size, not just the part that
4683 is the responsibility of the caller. */
4690 else
4698 initial_highest_arg_in_use);
4705 /* We must be careful to use virtual regs before they're instantiated,
4706 and real regs afterwards. Loop optimization, for example, can create
4707 new libcalls after we've instantiated the virtual regs, and if we
4708 use virtuals anyway, they won't match the rtl patterns. */
4712 STACK_POINTER_OFFSET);
4713 else
4715 }
4716 else
4717 {
4720 }
4722 /* We push args individually in reverse order, perform stack alignment
4723 before the first push (the last arg). */
4730 #ifdef REG_PARM_STACK_SPACE
4732 {
4733 /* The argument list is the property of the called routine and it
4734 may clobber it. If the fixed area has been used for previous
4735 parameters, we must save and restore it. */
4738 }
4739 #endif
4741 /* When expanding a normal call, args are stored in push order,
4742 which is the reverse of what we have here. */
4746 {
4749 }
4753 /* Push the args that need to be pushed. */
4757 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4758 are to be pushed. */
4760 {
4769 {
4770 rtx use;
4773 {
4774 /* If this is being stored into a pre-allocated, fixed-size,
4775 stack area, save any previous data at that location. */
4778 {
4779 /* stack_slot is negative, but we want to index stack_usage_map
4780 with positive values. */
4783 }
4784 else
4785 {
4788 }
4791 /* Don't worry about things in the fixed argument area;
4792 it has already been saved. */
4796 i++;
4799 {
4800 /* We need to make a save area. */
4801 unsigned int size
4803 machine_mode save_mode
4805 rtx adr
4808 rtx stack_area
4812 {
4816 );
4820 stack_area,
4822 BLOCK_OP_CALL_PARM);
4823 }
4824 else
4825 {
4829 }
4830 }
4831 }
4836 reg_parm_stack_space,
4839 /* Now mark the segment we just used. */
4844 NO_DEFER_POP;
4846 /* Indicate argument access so that alias.c knows that these
4847 values are live. */
4853 else
4854 {
4855 /* When arguments are pushed, trying to tell alias.c where
4856 exactly this argument is won't work, because the
4857 auto-increment causes confusion. So we merely indicate
4858 that we access something with a known mode somewhere on
4859 the stack. */
4863 }
4867 }
4868 }
4874 /* Now load any reg parms into their regs. */
4876 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4877 are to be pushed. */
4879 {
4884 #ifdef BLOCK_REG_PADDING
4886 #endif
4888 /* Handle calls that pass values in multiple non-contiguous
4889 locations. The PA64 has examples of this for library calls. */
4893 {
4895 #ifdef BLOCK_REG_PADDING
4898 /* Copied from load_register_parameters. */
4900 /* Handle case where we have a value that needs shifting
4901 up to the msb. eg. a QImode value and we're padding
4902 upward on a BYTES_BIG_ENDIAN machine. */
4906 {
4907 rtx x;
4910 /* Assigning REG here rather than a temp makes CALL_FUSAGE
4911 report the whole reg as used. Strictly speaking, the
4912 call only uses SIZE bytes at the msb end, but it doesn't
4913 seem worth generating rtl to say that. */
4918 }
4919 #endif
4920 }
4922 NO_DEFER_POP;
4923 }
4925 /* Any regs containing parms remain in use through the call. */
4927 {
4932 {
4935 {
4940 }
4941 else
4943 }
4944 }
4946 /* Pass the function the address in which to return a structure value. */
4948 {
4952 NULL_RTX)));
4955 }
4957 /* Don't allow popping to be deferred, since then
4958 cse'ing of library calls could delete a call and leave the pop. */
4959 NO_DEFER_POP;
4963 /* Stack must be properly aligned now. */
4969 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
4970 will set inhibit_defer_pop to that value. */
4971 /* The return type is needed to decide how many bytes the function pops.
4972 Signedness plays no role in that, so for simplicity, we pretend it's
4973 always signed. We also assume that the list of arguments passed has
4974 no impact, so we pretend it is unknown. */
4980 struct_value_size,
4983 valreg,
4987 {
4992 }
4994 /* Right-shift returned value if necessary. */
4998 {
5001 }
5005 /* For calls to `setjmp', etc., inform function.c:setjmp_warnings
5006 that it should complain if nonvolatile values are live. For
5007 functions that cannot return, inform flow that control does not
5008 fall through. */
5010 {
5011 /* The barrier note must be emitted
5012 immediately after the CALL_INSN. Some ports emit more than
5013 just a CALL_INSN above, so we must search for it here. */
5016 {
5018 /* There was no CALL_INSN? */
5020 }
5023 }
5025 /* Consider that "regular" libcalls, i.e. all of them except for LCT_THROW
5026 and LCT_RETURNS_TWICE, cannot perform non-local gotos. */
5028 {
5031 {
5033 /* There was no CALL_INSN? */
5035 }
5038 }
5040 /* Now restore inhibit_defer_pop to its actual original value. */
5041 OK_DEFER_POP;
5045 /* Copy the value to the right place. */
5047 {
5049 {
5054 }
5056 {
5060 }
5061 else
5062 {
5063 /* Convert to the proper mode if a promotion has been active. */
5065 {
5072 }
5076 else
5078 }
5079 }
5082 {
5083 #ifdef REG_PARM_STACK_SPACE
5087 #endif
5089 /* If we saved any argument areas, restore them. */
5092 {
5101 validize_mem
5104 BLOCK_OP_CALL_PARM);
5105 else
5107 }
5111 }
5117 }
5118 \f
5119 /* Output a library call to function FUN (a SYMBOL_REF rtx)
5120 (emitting the queue unless NO_QUEUE is nonzero),
5121 for a value of mode OUTMODE,
5122 with NARGS different arguments, passed as alternating rtx values
5123 and machine_modes to convert them to.
5125 FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for
5126 `const' calls, LCT_PURE for `pure' calls, or other LCT_ value for
5127 other types of library calls. */
5129 void
5132 {
5138 }
5139 \f
5140 /* Like emit_library_call except that an extra argument, VALUE,
5141 comes second and says where to store the result.
5142 (If VALUE is zero, this function chooses a convenient way
5143 to return the value.
5145 This function returns an rtx for where the value is to be found.
5146 If VALUE is nonzero, VALUE is returned. */
5148 rtx
5152 {
5153 rtx result;
5162 }
5163 \f
5165 /* Store pointer bounds argument ARG into Bounds Table entry
5166 associated with PARM. */
5167 static void
5169 {
5172 /* We may pass bounds not associated with any pointer. */
5174 {
5178 }
5179 /* Find pointer associated with bounds and where it is
5180 passed. */
5181 else
5182 {
5184 {
5188 }
5190 {
5198 else
5199 {
5202 }
5203 }
5204 else
5205 {
5214 else
5216 }
5217 }
5219 /* Expand bounds. */
5224 }
5226 /* Store a single argument for a function call
5227 into the register or memory area where it must be passed.
5228 *ARG describes the argument value and where to pass it.
5230 ARGBLOCK is the address of the stack-block for all the arguments,
5231 or 0 on a machine where arguments are pushed individually.
5233 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
5234 so must be careful about how the stack is used.
5236 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
5237 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
5238 that we need not worry about saving and restoring the stack.
5240 FNDECL is the declaration of the function we are calling.
5242 Return nonzero if this arg should cause sibcall failure,
5243 zero otherwise. */
5245 static int
5248 {
5259 /* Push a new temporary level for any temporaries we make for
5260 this argument. */
5264 {
5265 /* If this is being stored into a pre-allocated, fixed-size, stack area,
5266 save any previous data at that location. */
5268 {
5270 {
5271 /* stack_slot is negative, but we want to index stack_usage_map
5272 with positive values. */
5275 else
5279 }
5280 else
5281 {
5284 else
5288 }
5291 /* Don't worry about things in the fixed argument area;
5292 it has already been saved. */
5296 i++;
5299 {
5300 /* We need to make a save area. */
5307 {
5308 arg->save_area
5312 stack_area,
5314 BLOCK_OP_CALL_PARM);
5315 }
5316 else
5317 {
5320 }
5321 }
5322 }
5323 }
5325 /* If this isn't going to be placed on both the stack and in registers,
5326 set up the register and number of words. */
5328 {
5331 else
5334 }
5336 /* Being passed entirely in a register. We shouldn't be called in
5337 this case. */
5340 /* If this arg needs special alignment, don't load the registers
5341 here. */
5345 /* If this is being passed partially in a register, we can't evaluate
5346 it directly into its stack slot. Otherwise, we can. */
5348 {
5349 /* stack_arg_under_construction is nonzero if a function argument is
5350 being evaluated directly into the outgoing argument list and
5351 expand_call must take special action to preserve the argument list
5352 if it is called recursively.
5354 For scalar function arguments stack_usage_map is sufficient to
5355 determine which stack slots must be saved and restored. Scalar
5356 arguments in general have pass_on_stack == 0.
5358 If this argument is initialized by a function which takes the
5359 address of the argument (a C++ constructor or a C function
5360 returning a BLKmode structure), then stack_usage_map is
5361 insufficient and expand_call must push the stack around the
5362 function call. Such arguments have pass_on_stack == 1.
5364 Note that it is always safe to set stack_arg_under_construction,
5365 but this generates suboptimal code if set when not needed. */
5368 stack_arg_under_construction++;
5371 (partial
5376 /* If we are promoting object (or for any other reason) the mode
5377 doesn't agree, convert the mode. */
5384 stack_arg_under_construction--;
5385 }
5387 /* Check for overlap with already clobbered argument area. */
5394 /* Don't allow anything left on stack from computation
5395 of argument to alloca. */
5400 /* If the value is already in the stack slot, we are done. */
5401 ;
5403 {
5407 /* Argument is a scalar, not entirely passed in registers.
5408 (If part is passed in registers, arg->partial says how much
5409 and emit_push_insn will take care of putting it there.)
5411 Push it, and if its size is less than the
5412 amount of space allocated to it,
5413 also bump stack pointer by the additional space.
5414 Note that in C the default argument promotions
5415 will prevent such mismatches. */
5418 /* Compute how much space the push instruction will push.
5419 On many machines, pushing a byte will advance the stack
5420 pointer by a halfword. */
5421 #ifdef PUSH_ROUNDING
5423 #endif
5426 /* Compute how much space the argument should get:
5427 round up to a multiple of the alignment for arguments. */
5433 /* Compute the alignment of the pushed argument. */
5436 {
5439 {
5442 }
5443 }
5445 /* This isn't already where we want it on the stack, so put it there.
5446 This can either be done with push or copy insns. */
5453 /* Unless this is a partially-in-register argument, the argument is now
5454 in the stack. */
5457 }
5458 else
5459 {
5460 /* BLKmode, at least partly to be pushed. */
5464 rtx size_rtx;
5466 /* Pushing a nonscalar.
5467 If part is passed in registers, PARTIAL says how much
5468 and emit_push_insn will take care of putting it there. */
5470 /* Round its size up to a multiple
5471 of the allocation unit for arguments. */
5474 {
5477 }
5478 else
5479 {
5480 /* PUSH_ROUNDING has no effect on us, because emit_push_insn
5481 for BLKmode is careful to avoid it. */
5487 EXPAND_NORMAL);
5488 }
5492 /* When an argument is padded down, the block is aligned to
5493 PARM_BOUNDARY, but the actual argument isn't. */
5495 {
5499 {
5502 }
5503 }
5506 {
5507 /* emit_push_insn might not work properly if arg->value and
5508 argblock + arg->locate.offset areas overlap. */
5517 {
5521 /* arg.locate doesn't contain the pretend_args_size offset,
5522 it's part of argblock. Ensure we don't count it in I. */
5525 else
5528 /* expand_call should ensure this. */
5534 {
5537 }
5539 {
5540 /* Use arg->locate.size.constant instead of size_rtx
5541 because we only care about the part of the argument
5542 on the stack. */
5546 }
5547 else
5548 {
5549 /* Even though they appear to be at the same location,
5550 if part of the outgoing argument is in registers,
5551 they aren't really at the same location. Check for
5552 this by making sure that the incoming size is the
5553 same as the outgoing size. */
5556 }
5557 }
5558 }
5565 /* Unless this is a partially-in-register argument, the argument is now
5566 in the stack.
5568 ??? Unlike the case above, in which we want the actual
5569 address of the data, so that we can load it directly into a
5570 register, here we want the address of the stack slot, so that
5571 it's properly aligned for word-by-word copying or something
5572 like that. It's not clear that this is always correct. */
5575 }
5578 {
5580 arg->parallel_value
5583 }
5585 /* Mark all slots this store used. */
5591 /* Once we have pushed something, pops can't safely
5592 be deferred during the rest of the arguments. */
5593 NO_DEFER_POP;
5595 /* Free any temporary slots made in processing this argument. */
5599 }
5601 /* Nonzero if we do not know how to pass TYPE solely in registers. */
5603 bool
5605 const_tree type)
5606 {
5610 /* If the type has variable size... */
5614 /* If the type is marked as addressable (it is required
5615 to be constructed into the stack)... */
5620 }
5622 /* Another version of the TARGET_MUST_PASS_IN_STACK hook. This one
5623 takes trailing padding of a structure into account. */
5624 /* ??? Should be able to merge these two by examining BLOCK_REG_PADDING. */
5626 bool
5628 {
5632 /* If the type has variable size... */
5636 /* If the type is marked as addressable (it is required
5637 to be constructed into the stack)... */
5641 /* If the padding and mode of the type is such that a copy into
5642 a register would put it into the wrong part of the register. */
5650 }
5652 /* Tell the garbage collector about GTY markers in this source file. */