| blob | 6405f482e918c36685ffa87443b9d0e8420f0942 |
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. */
831 {
838 }
841 }
843 {
851 }
852 else
856 {
860 }
863 }
865 /* Detect flags from a CALL_EXPR. */
867 int
869 {
877 else
878 {
882 else
886 }
889 }
891 /* Return true if TYPE should be passed by invisible reference. */
893 bool
896 {
898 {
899 /* If this type contains non-trivial constructors, then it is
900 forbidden for the middle-end to create any new copies. */
904 /* GCC post 3.4 passes *all* variable sized types by reference. */
908 /* If a record type should be passed the same as its first (and only)
909 member, use the type and mode of that member. */
911 {
914 }
915 }
919 }
921 /* Return true if TYPE, which is passed by reference, should be callee
922 copied instead of caller copied. */
924 bool
927 {
931 named_arg);
932 }
935 /* Precompute all register parameters as described by ARGS, storing values
936 into fields within the ARGS array.
938 NUM_ACTUALS indicates the total number elements in the ARGS array.
940 Set REG_PARM_SEEN if we encounter a register parameter. */
942 static void
945 {
952 {
956 {
961 }
963 /* If we are to promote the function arg to a wider mode,
964 do it now. */
972 /* If the value is a non-legitimate constant, force it into a
973 pseudo now. TLS symbols sometimes need a call to resolve. */
978 /* If we're going to have to load the value by parts, pull the
979 parts into pseudos. The part extraction process can involve
980 non-trivial computation. */
982 {
987 }
989 /* If the value is expensive, and we are inside an appropriately
990 short loop, put the value into a pseudo and then put the pseudo
991 into the hard reg.
993 For small register classes, also do this if this call uses
994 register parameters. This is to avoid reload conflicts while
995 loading the parameters registers. */
1004 && ((*reg_parm_seen
1008 }
1009 }
1011 #ifdef REG_PARM_STACK_SPACE
1013 /* The argument list is the property of the called routine and it
1014 may clobber it. If the fixed area has been used for previous
1015 parameters, we must save and restore it. */
1017 static rtx
1018 save_fixed_argument_area (int reg_parm_stack_space, rtx argblock, int *low_to_save, int *high_to_save)
1019 {
1023 /* Compute the boundary of the area that needs to be saved, if any. */
1033 {
1035 machine_mode save_mode;
1037 rtx addr;
1038 rtx stack_area;
1039 rtx save_area;
1042 ;
1050 /* If we don't have the required alignment, must do this
1051 in BLKmode. */
1058 else
1066 {
1070 }
1071 else
1072 {
1075 }
1078 }
1081 }
1083 static void
1085 {
1092 else
1101 else
1104 BLOCK_OP_CALL_PARM);
1105 }
1108 /* If any elements in ARGS refer to parameters that are to be passed in
1109 registers, but not in memory, and whose alignment does not permit a
1110 direct copy into registers. Copy the values into a group of pseudos
1111 which we will later copy into the appropriate hard registers.
1113 Pseudos for each unaligned argument will be stored into the array
1114 args[argnum].aligned_regs. The caller is responsible for deallocating
1115 the aligned_regs array if it is nonzero. */
1117 static void
1119 {
1129 {
1134 {
1137 }
1138 else
1139 {
1142 }
1146 /* Structures smaller than a word are normally aligned to the
1147 least significant byte. On a BYTES_BIG_ENDIAN machine,
1148 this means we must skip the empty high order bytes when
1149 calculating the bit offset. */
1151 #ifdef BLOCK_REG_PADDING
1155 #else
1156 && BYTES_BIG_ENDIAN
1157 #endif
1158 )
1162 {
1171 /* There is no need to restrict this code to loading items
1172 in TYPE_ALIGN sized hunks. The bitfield instructions can
1173 load up entire word sized registers efficiently.
1175 ??? This may not be needed anymore.
1176 We use to emit a clobber here but that doesn't let later
1177 passes optimize the instructions we emit. By storing 0 into
1178 the register later passes know the first AND to zero out the
1179 bitfield being set in the register is unnecessary. The store
1180 of 0 will be deleted as will at least the first AND. */
1187 }
1188 }
1189 }
1191 /* The limit set by -Walloc-larger-than=. */
1194 /* Initialize ALLOC_OBJECT_SIZE_LIMIT based on the -Walloc-size-larger-than=
1195 setting if the option is specified, or to the maximum object size if it
1196 is not. Return the initialized value. */
1198 static tree
1200 {
1202 {
1206 {
1210 unsigned HOST_WIDE_INT limit
1214 {
1216 {
1217 /* Numeric option arguments are at most INT_MAX. Make it
1218 possible to specify a larger value by accepting common
1219 suffixes. */
1246 else
1248 }
1251 {
1256 }
1257 }
1258 }
1259 }
1261 }
1263 /* Return true when EXP's range can be determined and set RANGE[] to it
1264 after adjusting it if necessary to make EXP a valid size argument to
1265 an allocation function declared with attribute alloc_size (whose
1266 argument may be signed), or to a string manipulation function like
1267 memset. */
1269 bool
1271 {
1273 {
1274 /* EXP is a constant. */
1277 }
1280 enum value_range_type range_type
1285 {
1286 /* No range information available. */
1290 }
1300 {
1302 {
1304 {
1305 /* EXP is not in a strictly negative range. That means
1306 it must be in some (not necessarily strictly) positive
1307 range which includes zero. Since in signed to unsigned
1308 conversions negative values end up converted to large
1309 positive values, and otherwise they are not valid sizes,
1310 the resulting range is in both cases [0, TYPE_MAX]. */
1313 }
1315 {
1316 /* EXP is not in a negative-positive range. That means EXP
1317 is either negative, or greater than max. Since negative
1318 sizes are invalid make the range [MAX + 1, TYPE_MAX]. */
1321 }
1322 else
1323 {
1326 }
1327 }
1329 {
1330 /* EXP is unsigned and not in the range [1, MAX]. That means
1331 it's either zero or greater than MAX. Even though 0 would
1332 normally be detected by -Walloc-zero set the range to
1333 [MAX, TYPE_MAX] so that when MAX is greater than the limit
1334 the whole range is diagnosed. */
1337 }
1338 else
1339 {
1342 }
1343 }
1349 }
1351 /* Diagnose a call EXP to function FN decorated with attribute alloc_size
1352 whose argument numbers given by IDX with values given by ARGS exceed
1353 the maximum object size or cause an unsigned oveflow (wrapping) when
1354 multiplied. When ARGS[0] is null the function does nothing. ARGS[1]
1355 may be null for functions like malloc, and non-null for those like
1356 calloc that are decorated with a two-argument attribute alloc_size. */
1358 void
1360 {
1361 /* The range each of the (up to) two arguments is known to be in. */
1364 /* Maximum object size set by -Walloc-size-larger-than= or SIZE_MAX / 2. */
1371 /* Validate each argument individually. */
1373 {
1375 {
1380 {
1384 }
1386 {
1387 /* Avoid issuing -Walloc-zero for allocation functions other
1388 than __builtin_alloca that are declared with attribute
1389 returns_nonnull because there's no portability risk. This
1390 avoids warning for such calls to libiberty's xmalloc and
1391 friends.
1392 Also avoid issuing the warning for calls to function named
1393 "alloca". */
1402 }
1404 {
1405 /* G++ emits calls to ::operator new[](SIZE_MAX) in C++98
1406 mode and with -fno-exceptions as a way to indicate array
1407 size overflow. There's no good way to detect C++98 here
1408 so avoid diagnosing these calls for all C++ modes. */
1417 "%Kargument %i value %qE exceeds "
1420 }
1421 }
1424 {
1425 /* Verify that the argument's range is not negative (including
1426 upper bound of zero). */
1429 {
1434 }
1436 {
1438 "%Kargument %i range [%E, %E] exceeds "
1442 maxobjsize);
1443 }
1444 }
1445 }
1450 /* For a two-argument alloc_size, validate the product of the two
1451 arguments if both of their values or ranges are known. */
1456 {
1457 /* Check for overflow in the product of a function decorated with
1458 attribute alloc_size (X, Y). */
1468 "%Kproduct %<%E * %E%> of arguments %i and %i "
1474 "%Kproduct %<%E * %E%> of arguments %i and %i "
1478 maxobjsize);
1481 {
1482 /* Print the full range of each of the two arguments to make
1483 it clear when it is, in fact, in a range and not constant. */
1490 }
1491 }
1494 {
1500 else
1503 }
1504 }
1506 /* Issue an error if CALL_EXPR was flagged as requiring
1507 tall-call optimization. */
1509 static void
1511 {
1517 }
1519 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1520 CALL_EXPR EXP.
1522 NUM_ACTUALS is the total number of parameters.
1524 N_NAMED_ARGS is the total number of named arguments.
1526 STRUCT_VALUE_ADDR_VALUE is the implicit argument for a struct return
1527 value, or null.
1529 FNDECL is the tree code for the target of this call (if known)
1531 ARGS_SO_FAR holds state needed by the target to know where to place
1532 the next argument.
1534 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1535 for arguments which are passed in registers.
1537 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1538 and may be modified by this routine.
1540 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
1541 flags which may be modified by this routine.
1543 MAY_TAILCALL is cleared if we encounter an invisible pass-by-reference
1544 that requires allocation of stack space.
1546 CALL_FROM_THUNK_P is true if this call is the jump from a thunk to
1547 the thunked-to function. */
1549 static void
1556 cumulative_args_t args_so_far,
1561 {
1565 /* Count arg position in order args appear. */
1575 /* In this loop, we consider args in the order they are written.
1576 We fill up ARGS from the back. */
1579 {
1581 call_expr_arg_iterator iter;
1582 tree arg;
1586 {
1588 j--;
1590 /* If we pass structure address then we need to
1591 create bounds for it. Since created bounds is
1592 a call statement, we expand it right here to avoid
1593 fixing all other places where it may be expanded. */
1595 {
1602 j--;
1603 }
1604 }
1607 {
1610 /* Remember last param with pointer and associate it
1611 with following pointer bounds. */
1614 {
1619 {
1622 }
1623 }
1627 {
1631 }
1633 {
1634 /* We expect bounds in instrumented calls only.
1635 Otherwise it is a sign we lost flag due to some optimization
1636 and may emit call args incorrectly. */
1639 /* For structures look for the next available pointer. */
1641 {
1648 /* Check we have no more pointers in the structure. */
1651 }
1654 /* Check we covered all pointers in the previous
1655 non bounds arg. */
1658 }
1659 else
1663 && argtype
1666 {
1669 j--;
1671 }
1672 else
1674 j--;
1675 argpos++;
1676 }
1680 }
1684 /* Extract attribute alloc_size and if set, store the indices of
1685 the corresponding arguments in ALLOC_IDX, and then the actual
1686 argument(s) at those indices in ALLOC_ARGS. */
1692 {
1697 }
1699 /* Array for up to the two attribute alloc_size arguments. */
1702 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1704 {
1707 machine_mode mode;
1709 /* Replace erroneous argument with constant zero. */
1713 /* If TYPE is a transparent union or record, pass things the way
1714 we would pass the first field of the union or record. We have
1715 already verified that the modes are the same. */
1720 /* Decide where to pass this arg.
1722 args[i].reg is nonzero if all or part is passed in registers.
1724 args[i].partial is nonzero if part but not all is passed in registers,
1725 and the exact value says how many bytes are passed in registers.
1727 args[i].pass_on_stack is nonzero if the argument must at least be
1728 computed on the stack. It may then be loaded back into registers
1729 if args[i].reg is nonzero.
1731 These decisions are driven by the FUNCTION_... macros and must agree
1732 with those made by function.c. */
1734 /* See if this argument should be passed by invisible reference. */
1737 {
1741 callee_copies
1745 /* If we're compiling a thunk, pass through invisible references
1746 instead of making a copy. */
1748 || (callee_copies
1753 {
1754 /* We may have turned the parameter value into an SSA name.
1755 Go back to the original parameter so we can take the
1756 address. */
1758 {
1762 }
1763 /* Argument setup code may have copied the value to register. We
1764 revert that optimization now because the tail call code must
1765 use the original location. */
1775 /* We can't use sibcalls if a callee-copied argument is
1776 stored in the current function's frame. */
1778 {
1781 "a callee-copied argument is"
1782 " stored in the current "
1784 }
1792 }
1793 else
1794 {
1795 /* We make a copy of the object and pass the address to the
1796 function being called. */
1797 rtx copy;
1804 {
1805 /* This is a variable-sized object. Make space on the stack
1806 for it. */
1810 {
1814 }
1816 /* We can pass TRUE as the 4th argument because we just
1817 saved the stack pointer and will restore it right after
1818 the call. */
1825 }
1826 else
1831 /* Just change the const function to pure and then let
1832 the next test clear the pure based on
1833 callee_copies. */
1835 {
1838 }
1848 "argument must be passed"
1850 }
1851 }
1864 {
1867 }
1869 /* If this is a sibling call and the machine has register windows, the
1870 register window has to be unwinded before calling the routine, so
1871 arguments have to go into the incoming registers. */
1876 else
1886 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1887 it means that we are to pass this arg in the register(s) designated
1888 by the PARALLEL, but also to pass it in the stack. */
1893 /* If this is an addressable type, we must preallocate the stack
1894 since we must evaluate the object into its final location.
1896 If this is to be passed in both registers and the stack, it is simpler
1897 to preallocate. */
1902 /* No stack allocation and padding for bounds. */
1904 ;
1905 /* Compute the stack-size of this argument. */
1910 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1912 #else
1914 #endif
1915 reg_parm_stack_space,
1918 #ifdef BLOCK_REG_PADDING
1919 else
1920 /* The argument is passed entirely in registers. See at which
1921 end it should be padded. */
1925 #endif
1927 /* Update ARGS_SIZE, the total stack space for args so far. */
1933 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1934 have been used, etc. */
1939 /* Store argument values for functions decorated with attribute
1940 alloc_size. */
1945 }
1948 {
1949 /* Check the arguments of functions decorated with attribute
1950 alloc_size. */
1952 }
1953 }
1955 /* Update ARGS_SIZE to contain the total size for the argument block.
1956 Return the original constant component of the argument block's size.
1958 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
1959 for arguments passed in registers. */
1961 static int
1964 tree fndecl ATTRIBUTE_UNUSED,
1965 tree fntype ATTRIBUTE_UNUSED,
1967 {
1970 /* For accumulate outgoing args mode we don't need to align, since the frame
1971 will be already aligned. Align to STACK_BOUNDARY in order to prevent
1972 backends from generating misaligned frame sizes. */
1976 /* Compute the actual size of the argument block required. The variable
1977 and constant sizes must be combined, the size may have to be rounded,
1978 and there may be a minimum required size. */
1981 {
1987 {
1988 /* We don't handle this case yet. To handle it correctly we have
1989 to add the delta, round and subtract the delta.
1990 Currently no machine description requires this support. */
1993 }
1996 {
1997 args_size->var
2001 /* The area corresponding to register parameters is not to count in
2002 the size of the block we need. So make the adjustment. */
2004 args_size->var
2007 }
2008 }
2009 else
2010 {
2015 + stack_pointer_delta
2017 / preferred_stack_boundary
2022 reg_parm_stack_space);
2026 }
2028 }
2030 /* Precompute parameters as needed for a function call.
2032 FLAGS is mask of ECF_* constants.
2034 NUM_ACTUALS is the number of arguments.
2036 ARGS is an array containing information for each argument; this
2037 routine fills in the INITIAL_VALUE and VALUE fields for each
2038 precomputed argument. */
2040 static void
2042 {
2045 /* If this is a libcall, then precompute all arguments so that we do not
2046 get extraneous instructions emitted as part of the libcall sequence. */
2048 /* If we preallocated the stack space, and some arguments must be passed
2049 on the stack, then we must precompute any parameter which contains a
2050 function call which will store arguments on the stack.
2051 Otherwise, evaluating the parameter may clobber previous parameters
2052 which have already been stored into the stack. (we have code to avoid
2053 such case by saving the outgoing stack arguments, but it results in
2054 worse code) */
2059 {
2060 tree type;
2061 machine_mode mode;
2066 /* If this is an addressable type, we cannot pre-evaluate it. */
2075 {
2081 /* CSE will replace this only if it contains args[i].value
2082 pseudo, so convert it down to the declared mode using
2083 a SUBREG. */
2087 {
2092 }
2093 }
2094 }
2095 }
2097 /* Given the current state of MUST_PREALLOCATE and information about
2098 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
2099 compute and return the final value for MUST_PREALLOCATE. */
2101 static int
2104 {
2105 /* See if we have or want to preallocate stack space.
2107 If we would have to push a partially-in-regs parm
2108 before other stack parms, preallocate stack space instead.
2110 If the size of some parm is not a multiple of the required stack
2111 alignment, we must preallocate.
2113 If the total size of arguments that would otherwise create a copy in
2114 a temporary (such as a CALL) is more than half the total argument list
2115 size, preallocation is faster.
2117 Another reason to preallocate is if we have a machine (like the m88k)
2118 where stack alignment is required to be maintained between every
2119 pair of insns, not just when the call is made. However, we assume here
2120 that such machines either do not have push insns (and hence preallocation
2121 would occur anyway) or the problem is taken care of with
2122 PUSH_ROUNDING. */
2125 {
2131 {
2136 /* We preallocate in case there are bounds passed
2137 in the bounds table to have precomputed address
2138 for bounds association. */
2148 copy_to_evaluate_size
2150 }
2155 }
2157 }
2159 /* If we preallocated stack space, compute the address of each argument
2160 and store it into the ARGS array.
2162 We need not ensure it is a valid memory address here; it will be
2163 validized when it is used.
2165 ARGBLOCK is an rtx for the address of the outgoing arguments. */
2167 static void
2169 {
2171 {
2179 {
2182 rtx addr;
2187 /* Skip this parm if it will not be passed on the stack. */
2193 /* Pointer Bounds are never passed on the stack. */
2199 else
2205 {
2206 /* Only part of the parameter is being passed on the stack.
2207 Generate a simple memory reference of the correct size. */
2213 }
2214 else
2215 {
2219 }
2225 {
2228 }
2233 else
2239 {
2240 /* Only part of the parameter is being passed on the stack.
2241 Generate a simple memory reference of the correct size.
2242 */
2245 }
2246 else
2247 {
2251 }
2254 /* Function incoming arguments may overlap with sibling call
2255 outgoing arguments and we cannot allow reordering of reads
2256 from function arguments with stores to outgoing arguments
2257 of sibling calls. */
2260 }
2261 }
2262 }
2264 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
2265 in a call instruction.
2267 FNDECL is the tree node for the target function. For an indirect call
2268 FNDECL will be NULL_TREE.
2270 ADDR is the operand 0 of CALL_EXPR for this call. */
2272 static rtx
2274 {
2275 rtx funexp;
2277 /* Get the function to call, in the form of RTL. */
2279 {
2283 /* Get a SYMBOL_REF rtx for the function address. */
2285 }
2286 else
2287 /* Generate an rtx (probably a pseudo-register) for the address. */
2288 {
2292 }
2294 }
2296 /* Internal state for internal_arg_pointer_based_exp and its helpers. */
2297 static struct
2298 {
2299 /* Last insn that has been scanned by internal_arg_pointer_based_exp_scan,
2300 or NULL_RTX if none has been scanned yet. */
2302 /* Vector indexed by REGNO - FIRST_PSEUDO_REGISTER, recording if a pseudo is
2303 based on crtl->args.internal_arg_pointer. The element is NULL_RTX if the
2304 pseudo isn't based on it, a CONST_INT offset if the pseudo is based on it
2305 with fixed offset, or PC if this is with variable or unknown offset. */
2311 /* Helper function for internal_arg_pointer_based_exp. Scan insns in
2312 the tail call sequence, starting with first insn that hasn't been
2313 scanned yet, and note for each pseudo on the LHS whether it is based
2314 on crtl->args.internal_arg_pointer or not, and what offset from that
2315 that pointer it has. */
2317 static void
2319 {
2324 else
2328 {
2331 {
2334 /* Punt on pseudos set multiple times. */
2339 else
2342 {
2344 internal_arg_pointer_exp_state.cache
2347 }
2348 }
2352 }
2355 }
2357 /* Compute whether RTL is based on crtl->args.internal_arg_pointer. Return
2358 NULL_RTX if RTL isn't based on it, a CONST_INT offset if RTL is based on
2359 it with fixed offset, or PC if this is with variable or unknown offset.
2360 TOPLEVEL is true if the function is invoked at the topmost level. */
2362 static rtx
2364 {
2375 {
2380 }
2382 /* When called at the topmost level, scan pseudo assignments in between the
2383 last scanned instruction in the tail call sequence and the latest insn
2384 in that sequence. */
2389 {
2395 }
2399 {
2405 }
2408 }
2410 /* Return true if and only if SIZE storage units (usually bytes)
2411 starting from address ADDR overlap with already clobbered argument
2412 area. This function is used to determine if we should give up a
2413 sibcall. */
2415 static bool
2417 {
2418 HOST_WIDE_INT i;
2419 rtx val;
2428 else
2433 else
2441 {
2448 }
2451 }
2453 /* Do the register loads required for any wholly-register parms or any
2454 parms which are passed both on the stack and in a register. Their
2455 expressions were already evaluated.
2457 Mark all register-parms as living through the call, putting these USE
2458 insns in the CALL_INSN_FUNCTION_USAGE field.
2460 When IS_SIBCALL, perform the check_sibcall_argument_overlap
2461 checking, setting *SIBCALL_FAILURE if appropriate. */
2463 static void
2467 {
2471 {
2475 {
2480 /* Set non-negative if we must move a word at a time, even if
2481 just one word (e.g, partial == 4 && mode == DFmode). Set
2482 to -1 if we just use a normal move insn. This value can be
2483 zero if the argument is a zero size structure. */
2486 ;
2488 {
2491 }
2493 {
2496 }
2497 else
2500 /* Handle calls that pass values in multiple non-contiguous
2501 locations. The Irix 6 ABI has examples of this. */
2506 /* If simple case, just do move. If normal partial, store_one_arg
2507 has already loaded the register for us. In all other cases,
2508 load the register(s) from memory. */
2511 {
2513 #ifdef BLOCK_REG_PADDING
2514 /* Handle case where we have a value that needs shifting
2515 up to the msb. eg. a QImode value and we're padding
2516 upward on a BYTES_BIG_ENDIAN machine. */
2520 {
2521 rtx x;
2524 /* Assigning REG here rather than a temp makes CALL_FUSAGE
2525 report the whole reg as used. Strictly speaking, the
2526 call only uses SIZE bytes at the msb end, but it doesn't
2527 seem worth generating rtl to say that. */
2532 }
2533 #endif
2534 }
2536 /* If we have pre-computed the values to put in the registers in
2537 the case of non-aligned structures, copy them in now. */
2545 {
2548 /* Check for overlap with already clobbered argument area,
2549 providing that this has non-zero size. */
2552 && (mem_overlaps_already_clobbered_arg_p
2559 else
2560 {
2569 NULL);
2575 }
2577 /* Handle a BLKmode that needs shifting. */
2579 #ifdef BLOCK_REG_PADDING
2581 #else
2582 && BYTES_BIG_ENDIAN
2583 #endif
2584 )
2585 {
2590 rtx x;
2595 }
2596 }
2598 /* When a parameter is a block, and perhaps in other cases, it is
2599 possible that it did a load from an argument slot that was
2600 already clobbered. */
2605 /* Handle calls that pass values in multiple non-contiguous
2606 locations. The Irix 6 ABI has examples of this. */
2614 }
2615 }
2616 }
2618 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
2619 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
2620 bytes, then we would need to push some additional bytes to pad the
2621 arguments. So, we compute an adjust to the stack pointer for an
2622 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
2623 bytes. Then, when the arguments are pushed the stack will be perfectly
2624 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
2625 be popped after the call. Returns the adjustment. */
2627 static int
2631 {
2632 /* The number of bytes to pop so that the stack will be
2633 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
2634 HOST_WIDE_INT adjustment;
2635 /* The alignment of the stack after the arguments are pushed, if we
2636 just pushed the arguments without adjust the stack here. */
2639 unadjusted_alignment
2643 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
2644 as possible -- leaving just enough left to cancel out the
2645 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
2646 PENDING_STACK_ADJUST is non-negative, and congruent to
2647 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
2649 /* Begin by trying to pop all the bytes. */
2650 unadjusted_alignment
2651 = (unadjusted_alignment
2654 /* Push enough additional bytes that the stack will be aligned
2655 after the arguments are pushed. */
2659 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
2660 bytes after the call. The right number is the entire
2661 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
2662 by the arguments in the first place. */
2663 args_size->constant
2667 }
2669 /* Scan X expression if it does not dereference any argument slots
2670 we already clobbered by tail call arguments (as noted in stored_args_map
2671 bitmap).
2672 Return nonzero if X expression dereferences such argument slots,
2673 zero otherwise. */
2675 static int
2677 {
2678 RTX_CODE code;
2687 /* We need not check the operands of the CALL expression itself. */
2695 /* Scan all subexpressions. */
2698 {
2700 {
2703 }
2705 {
2709 }
2710 }
2712 }
2714 /* Scan sequence after INSN if it does not dereference any argument slots
2715 we already clobbered by tail call arguments (as noted in stored_args_map
2716 bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to
2717 stored_args_map bitmap afterwards (when ARG is a register MARK_STORED_ARGS_MAP
2718 should be 0). Return nonzero if sequence after INSN dereferences such argument
2719 slots, zero otherwise. */
2721 static int
2724 {
2729 else
2738 {
2741 else
2746 }
2748 }
2750 /* Given that a function returns a value of mode MODE at the most
2751 significant end of hard register VALUE, shift VALUE left or right
2752 as specified by LEFT_P. Return true if some action was needed. */
2754 bool
2756 {
2757 HOST_WIDE_INT shift;
2764 /* Use ashr rather than lshr for right shifts. This is for the benefit
2765 of the MIPS port, which requires SImode values to be sign-extended
2766 when stored in 64-bit registers. */
2771 }
2773 /* If X is a likely-spilled register value, copy it to a pseudo
2774 register and return that register. Return X otherwise. */
2776 static rtx
2778 {
2779 rtx new_rtx;
2784 {
2785 /* Make sure that we generate a REG rather than a CONCAT.
2786 Moves into CONCATs can need nontrivial instructions,
2787 and the whole point of this function is to avoid
2788 using the hard register directly in such a situation. */
2794 }
2796 }
2798 /* Helper function for expand_call.
2799 Return false is EXP is not implementable as a sibling call. */
2801 static bool
2803 rtx structure_value_addr,
2804 tree funtype,
2806 tree fndecl,
2808 tree addr,
2810 {
2812 {
2813 maybe_complain_about_tail_call
2815 "machine description does not have"
2818 }
2820 /* Doing sibling call optimization needs some work, since
2821 structure_value_addr can be allocated on the stack.
2822 It does not seem worth the effort since few optimizable
2823 sibling calls will return a structure. */
2825 {
2828 }
2830 #ifdef REG_PARM_STACK_SPACE
2831 /* If outgoing reg parm stack space changes, we can not do sibcall. */
2835 {
2837 "inconsistent size of stack space"
2838 " allocated for arguments which are"
2841 }
2842 #endif
2844 /* Check whether the target is able to optimize the call
2845 into a sibcall. */
2847 {
2849 "target is not able to optimize the"
2852 }
2854 /* Functions that do not return exactly once may not be sibcall
2855 optimized. */
2857 {
2860 }
2862 {
2865 }
2868 {
2871 }
2873 /* If the called function is nested in the current one, it might access
2874 some of the caller's arguments, but could clobber them beforehand if
2875 the argument areas are shared. */
2877 {
2880 }
2882 /* If this function requires more stack slots than the current
2883 function, we cannot change it into a sibling call.
2884 crtl->args.pretend_args_size is not part of the
2885 stack allocated by our caller. */
2887 {
2889 "callee required more stack slots"
2892 }
2894 /* If the callee pops its own arguments, then it must pop exactly
2895 the same number of arguments as the current function. */
2900 {
2902 "inconsistent number of"
2905 }
2908 {
2912 }
2914 /* All checks passed. */
2916 }
2918 /* Generate all the code for a CALL_EXPR exp
2919 and return an rtx for its value.
2920 Store the value in TARGET (specified as an rtx) if convenient.
2921 If the value is stored in TARGET then TARGET is returned.
2922 If IGNORE is nonzero, then we ignore the value of the function call. */
2924 rtx
2926 {
2927 /* Nonzero if we are currently expanding a call. */
2930 /* RTX for the function to be called. */
2931 rtx funexp;
2932 /* Sequence of insns to perform a normal "call". */
2934 /* Sequence of insns to perform a tail "call". */
2936 /* Data type of the function. */
2937 tree funtype;
2938 tree type_arg_types;
2939 tree rettype;
2940 /* Declaration of the function being called,
2941 or 0 if the function is computed (not known by name). */
2943 /* The type of the function being called. */
2944 tree fntype;
2949 /* Register in which non-BLKmode value will be returned,
2950 or 0 if no value or if value is BLKmode. */
2951 rtx valreg;
2952 /* Register(s) in which bounds are returned. */
2954 /* Address where we should return a BLKmode value;
2955 0 if value not BLKmode. */
2957 /* Nonzero if that address is being passed by treating it as
2958 an extra, implicit first parameter. Otherwise,
2959 it is passed by being copied directly into struct_value_rtx. */
2961 /* Holds the value of implicit argument for the struct value. */
2963 /* Size of aggregate value wanted, or zero if none wanted
2964 or if we are using the non-reentrant PCC calling convention
2965 or expecting the value in registers. */
2967 /* Nonzero if called function returns an aggregate in memory PCC style,
2968 by returning the address of where to find it. */
2972 /* Number of actual parameters in this call, including struct value addr. */
2974 /* Number of named args. Args after this are anonymous ones
2975 and they must all go on the stack. */
2977 /* Number of complex actual arguments that need to be split. */
2980 /* Vector of information about each argument.
2981 Arguments are numbered in the order they will be pushed,
2982 not the order they are written. */
2985 /* Total size in bytes of all the stack-parms scanned so far. */
2988 /* Size of arguments before any adjustments (such as rounding). */
2990 /* Data on reg parms scanned so far. */
2991 CUMULATIVE_ARGS args_so_far_v;
2992 cumulative_args_t args_so_far;
2993 /* Nonzero if a reg parm has been scanned. */
2995 /* Nonzero if this is an indirect function call. */
2997 /* Nonzero if we must avoid push-insns in the args for this call.
2998 If stack space is allocated for register parameters, but not by the
2999 caller, then it is preallocated in the fixed part of the stack frame.
3000 So the entire argument block must then be preallocated (i.e., we
3001 ignore PUSH_ROUNDING in that case). */
3005 /* Size of the stack reserved for parameter registers. */
3008 /* Address of space preallocated for stack parms
3009 (on machines that lack push insns), or 0 if space not preallocated. */
3012 /* Mask of ECF_ and ERF_ flags. */
3015 #ifdef REG_PARM_STACK_SPACE
3016 /* Define the boundary of the register parm stack space that needs to be
3017 saved, if any. */
3020 #endif
3028 /* State variables to track stack modifications. */
3034 /* Some stack pointer alterations we make are performed via
3035 allocate_dynamic_stack_space. This modifies the stack_pointer_delta,
3036 which we then also need to save/restore along the way. */
3039 rtx call_fusage;
3042 /* The alignment of the stack, in bits. */
3044 /* The alignment of the stack, in bytes. */
3046 /* The static chain value to use for this call. */
3047 rtx static_chain_value;
3048 /* See if this is "nothrow" function call. */
3052 /* See if we can find a DECL-node for the actual function, and get the
3053 function attributes (flags) from the function decl or type node. */
3056 {
3060 }
3061 else
3062 {
3067 }
3072 /* Warn if this value is an aggregate type,
3073 regardless of which calling convention we are using for it. */
3077 /* If the result of a non looping pure or const function call is
3078 ignored (or void), and none of its arguments are volatile, we can
3079 avoid expanding the call and just evaluate the arguments for
3080 side-effects. */
3085 {
3087 tree arg;
3088 call_expr_arg_iterator iter;
3092 {
3095 }
3098 {
3102 }
3103 }
3105 #ifdef REG_PARM_STACK_SPACE
3107 #endif
3113 /* Set up a place to return a structure. */
3115 /* Cater to broken compilers. */
3117 {
3118 /* This call returns a big structure. */
3121 #ifdef PCC_STATIC_STRUCT_RETURN
3122 {
3124 }
3126 {
3129 /* Even if it is semantically safe to use the target as the return
3130 slot, it may be not sufficiently aligned for the return type. */
3132 && target
3138 else
3139 {
3140 /* For variable-sized objects, we must be called with a target
3141 specified. If we were to allocate space on the stack here,
3142 we would have no way of knowing when to free it. */
3146 }
3147 }
3149 }
3151 /* Figure out the amount to which the stack should be aligned. */
3154 {
3156 /* Without automatic stack alignment, we can't increase preferred
3157 stack boundary. With automatic stack alignment, it is
3158 unnecessary since unless we can guarantee that all callers will
3159 align the outgoing stack properly, callee has to align its
3160 stack anyway. */
3165 }
3167 /* Operand 0 is a pointer-to-function; get the type of the function. */
3172 /* Count whether there are actual complex arguments that need to be split
3173 into their real and imaginary parts. Munge the type_arg_types
3174 appropriately here as well. */
3176 {
3177 call_expr_arg_iterator iter;
3178 tree arg;
3180 {
3184 num_complex_actuals++;
3185 }
3187 }
3188 else
3194 /* If struct_value_rtx is 0, it means pass the address
3195 as if it were an extra parameter. Put the argument expression
3196 in structure_value_addr_value. */
3198 {
3199 /* If structure_value_addr is a REG other than
3200 virtual_outgoing_args_rtx, we can use always use it. If it
3201 is not a REG, we must always copy it into a register.
3202 If it is virtual_outgoing_args_rtx, we must copy it to another
3203 register in some cases. */
3205 || (ACCUMULATE_OUTGOING_ARGS
3206 && stack_arg_under_construction
3212 structure_value_addr_value =
3215 }
3217 /* Count the arguments and set NUM_ACTUALS. */
3218 num_actuals =
3221 /* Compute number of named args.
3222 First, do a raw count of the args for INIT_CUMULATIVE_ARGS. */
3225 n_named_args
3227 /* Count the struct value address, if it is passed as a parm. */
3229 else
3230 /* If we know nothing, treat all args as named. */
3233 /* Start updating where the next arg would go.
3235 On some machines (such as the PA) indirect calls have a different
3236 calling convention than normal calls. The fourth argument in
3237 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
3238 or not. */
3242 /* Now possibly adjust the number of named args.
3243 Normally, don't include the last named arg if anonymous args follow.
3244 We do include the last named arg if
3245 targetm.calls.strict_argument_naming() returns nonzero.
3246 (If no anonymous args follow, the result of list_length is actually
3247 one too large. This is harmless.)
3249 If targetm.calls.pretend_outgoing_varargs_named() returns
3250 nonzero, and targetm.calls.strict_argument_naming() returns zero,
3251 this machine will be able to place unnamed args that were passed
3252 in registers into the stack. So treat all args as named. This
3253 allows the insns emitting for a specific argument list to be
3254 independent of the function declaration.
3256 If targetm.calls.pretend_outgoing_varargs_named() returns zero,
3257 we do not have any reliable way to pass unnamed args in
3258 registers, so we must force them into memory. */
3262 ;
3265 /* Don't include the last named arg. */
3267 else
3268 /* Treat all args as named. */
3271 /* Make a vector to hold all the information about each arg. */
3274 /* Build up entries in the ARGS array, compute the size of the
3275 arguments into ARGS_SIZE, etc. */
3287 /* Now make final decision about preallocating stack space. */
3292 /* If the structure value address will reference the stack pointer, we
3293 must stabilize it. We don't need to do this if we know that we are
3294 not going to adjust the stack pointer in processing this call. */
3299 structure_value_addr))
3304 /* Tail calls can make things harder to debug, and we've traditionally
3305 pushed these optimizations into -O2. Don't try if we're already
3306 expanding a call, as that means we're an argument. Don't try if
3307 there's cleanups, as we know there's code to follow the call. */
3310 || !flag_optimize_sibling_calls
3315 /* If the user has marked the function as requiring tail-call
3316 optimization, attempt it. */
3320 /* Rest of purposes for tail call optimizations to fail. */
3323 structure_value_addr,
3324 funtype,
3325 reg_parm_stack_space,
3326 fndecl,
3329 /* Check if caller and callee disagree in promotion of function
3330 return value. */
3332 {
3342 caller_promoted_mode
3346 callee_promoted_mode
3357 {
3360 "caller and callee disagree in"
3361 " promotion of function"
3363 }
3364 }
3366 /* Ensure current function's preferred stack boundary is at least
3367 what we need. Stack alignment may also increase preferred stack
3368 boundary. */
3371 else
3376 /* We want to make two insn chains; one for a sibling call, the other
3377 for a normal call. We will select one of the two chains after
3378 initial RTL generation is complete. */
3380 {
3382 /* We want to emit any pending stack adjustments before the tail
3383 recursion "call". That way we know any adjustment after the tail
3384 recursion call can be ignored if we indeed use the tail
3385 call expansion. */
3386 saved_pending_stack_adjust save;
3388 rtx next_arg_reg;
3391 {
3392 /* State variables we need to save and restore between
3393 iterations. */
3395 }
3398 else
3401 /* Other state variables that we must reinitialize each time
3402 through the loop (that are not initialized by the loop itself). */
3406 /* Start a new sequence for the normal call case.
3408 From this point on, if the sibling call fails, we want to set
3409 sibcall_failure instead of continuing the loop. */
3412 /* Don't let pending stack adjusts add up to too much.
3413 Also, do all pending adjustments now if there is any chance
3414 this might be a call to alloca or if we are expanding a sibling
3415 call sequence.
3416 Also do the adjustments before a throwing call, otherwise
3417 exception handling can fail; PR 19225. */
3426 /* Precompute any arguments as needed. */
3430 /* Now we are about to start emitting insns that can be deleted
3431 if a libcall is deleted. */
3441 /* Compute the actual size of the argument block required. The variable
3442 and constant sizes must be combined, the size may have to be rounded,
3443 and there may be a minimum required size. When generating a sibcall
3444 pattern, do not round up, since we'll be re-using whatever space our
3445 caller provided. */
3446 unadjusted_args_size
3455 /* The argument block when performing a sibling call is the
3456 incoming argument block. */
3458 {
3461 argblock
3463 else
3464 argblock
3469 }
3471 /* If we have no actual push instructions, or shouldn't use them,
3472 make space for all args right now. */
3474 {
3476 {
3481 /* stack_arg_under_construction says whether a stack arg is
3482 being constructed at the old stack level. Pushing the stack
3483 gets a clean outgoing argument block. */
3486 }
3490 }
3491 else
3492 {
3493 /* Note that we must go through the motions of allocating an argument
3494 block even if the size is zero because we may be storing args
3495 in the area reserved for register arguments, which may be part of
3496 the stack frame. */
3500 /* Store the maximum argument space used. It will be pushed by
3501 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
3502 checking). */
3508 {
3510 {
3511 /* Since the stack pointer will never be pushed, it is
3512 possible for the evaluation of a parm to clobber
3513 something we have already written to the stack.
3514 Since most function calls on RISC machines do not use
3515 the stack, this is uncommon, but must work correctly.
3517 Therefore, we save any area of the stack that was already
3518 written and that we are using. Here we set up to do this
3519 by making a new stack usage map from the old one. The
3520 actual save will be done by store_one_arg.
3522 Another approach might be to try to reorder the argument
3523 evaluations to avoid this conflicting stack usage. */
3525 /* Since we will be writing into the entire argument area,
3526 the map must be allocated for its entire size, not just
3527 the part that is the responsibility of the caller. */
3532 highest_outgoing_arg_in_use
3534 else
3535 highest_outgoing_arg_in_use
3544 initial_highest_arg_in_use);
3548 (highest_outgoing_arg_in_use
3552 /* The address of the outgoing argument list must not be
3553 copied to a register here, because argblock would be left
3554 pointing to the wrong place after the call to
3555 allocate_dynamic_stack_space below. */
3558 }
3559 else
3560 {
3562 {
3563 /* Try to reuse some or all of the pending_stack_adjust
3564 to get this space. */
3565 needed
3566 = (combine_pending_stack_adjustment_and_call
3569 preferred_unit_stack_boundary));
3571 /* combine_pending_stack_adjustment_and_call computes
3572 an adjustment before the arguments are allocated.
3573 Account for them and see whether or not the stack
3574 needs to go up or down. */
3578 {
3579 /* We're releasing stack space. */
3580 /* ??? We can avoid any adjustment at all if we're
3581 already aligned. FIXME. */
3585 }
3586 else
3587 /* We need to allocate space. We'll do that in
3588 push_block below. */
3590 }
3592 /* Special case this because overhead of `push_block' in
3593 this case is non-trivial. */
3596 else
3597 {
3601 }
3603 /* We only really need to call `copy_to_reg' in the case
3604 where push insns are going to be used to pass ARGBLOCK
3605 to a function call in ARGS. In that case, the stack
3606 pointer changes value from the allocation point to the
3607 call point, and hence the value of
3608 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
3609 as well always do it. */
3611 }
3612 }
3613 }
3616 {
3617 /* The save/restore code in store_one_arg handles all
3618 cases except one: a constructor call (including a C
3619 function returning a BLKmode struct) to initialize
3620 an argument. */
3622 {
3623 rtx push_size
3629 {
3634 /* stack_arg_under_construction says whether a stack
3635 arg is being constructed at the old stack level.
3636 Pushing the stack gets a clean outgoing argument
3637 block. */
3638 old_stack_arg_under_construction
3641 /* Make a new map for the new argument list. */
3646 }
3647 /* We can pass TRUE as the 4th argument because we just
3648 saved the stack pointer and will restore it right after
3649 the call. */
3652 }
3654 /* If argument evaluation might modify the stack pointer,
3655 copy the address of the argument list to a register. */
3658 {
3661 }
3662 }
3666 /* Stack is properly aligned, pops can't safely be deferred during
3667 the evaluation of the arguments. */
3668 NO_DEFER_POP;
3670 /* Precompute all register parameters. It isn't safe to compute
3671 anything once we have started filling any specific hard regs.
3672 TLS symbols sometimes need a call to resolve. Precompute
3673 register parameters before any stack pointer manipulation
3674 to avoid unaligned stack in the called function. */
3677 OK_DEFER_POP;
3679 /* Perform stack alignment before the first push (the last arg). */
3683 {
3684 /* When the stack adjustment is pending, we get better code
3685 by combining the adjustments. */
3688 {
3689 pending_stack_adjust
3690 = (combine_pending_stack_adjustment_and_call
3693 preferred_unit_stack_boundary));
3695 }
3699 }
3700 /* Now that the stack is properly aligned, pops can't safely
3701 be deferred during the evaluation of the arguments. */
3702 NO_DEFER_POP;
3704 /* Record the maximum pushed stack space size. We need to delay
3705 doing it this far to take into account the optimization done
3706 by combine_pending_stack_adjustment_and_call. */
3708 && !ACCUMULATE_OUTGOING_ARGS
3709 && pass
3711 {
3715 }
3721 else
3724 #ifdef REG_PARM_STACK_SPACE
3725 /* Save the fixed argument area if it's part of the caller's frame and
3726 is clobbered by argument setup for this call. */
3730 #endif
3732 /* Now store (and compute if necessary) all non-register parms.
3733 These come before register parms, since they can require block-moves,
3734 which could clobber the registers used for register parms.
3735 Parms which have partial registers are not stored here,
3736 but we do preallocate space here if they want that. */
3739 {
3740 /* Delay bounds until all other args are stored. */
3744 {
3747 /* We don't allow passing huge (> 2^30 B) arguments
3748 by value. It would cause an overflow later on. */
3751 {
3754 }
3758 reg_parm_stack_space)
3763 }
3766 call_fusage
3769 call_fusage);
3770 }
3772 /* If we have a parm that is passed in registers but not in memory
3773 and whose alignment does not permit a direct copy into registers,
3774 make a group of pseudos that correspond to each register that we
3775 will later fill. */
3779 /* Now store any partially-in-registers parm.
3780 This is the last place a block-move can happen. */
3784 {
3787 /* On targets with weird calling conventions (e.g. PA) it's
3788 hard to ensure that all cases of argument overlap between
3789 stack and registers work. Play it safe and bail out. */
3791 {
3794 }
3798 reg_parm_stack_space)
3803 }
3808 {
3811 }
3815 /* Figure out the register where the value, if any, will come back. */
3820 {
3822 {
3829 }
3830 else
3831 {
3836 fndecl,
3838 }
3840 /* If VALREG is a PARALLEL whose first member has a zero
3841 offset, use that. This is for targets such as m68k that
3842 return the same value in multiple places. */
3844 {
3851 }
3852 }
3854 /* Store all bounds not passed in registers. */
3856 {
3861 ? NULL
3863 }
3865 /* If register arguments require space on the stack and stack space
3866 was not preallocated, allocate stack space here for arguments
3867 passed in registers. */
3869 && !ACCUMULATE_OUTGOING_ARGS
3873 /* Pass the function the address in which to return a
3874 structure value. */
3876 {
3877 structure_value_addr
3882 NULL_RTX)));
3886 }
3896 /* Save a pointer to the last insn before the call, so that we can
3897 later safely search backwards to find the CALL_INSN. */
3900 /* Set up next argument register. For sibling calls on machines
3901 with register windows this should be the incoming register. */
3904 VOIDmode,
3905 void_type_node,
3907 else
3913 {
3919 && valreg
3922 call_fusage
3925 call_fusage);
3926 }
3927 /* All arguments and registers used for the call must be set up by
3928 now! */
3930 /* Stack must be properly aligned now. */
3934 /* Generate the actual call instruction. */
3941 {
3945 {
3949 }
3952 }
3954 /* If the call setup or the call itself overlaps with anything
3955 of the argument setup we probably clobbered our call address.
3956 In that case we can't do sibcalls. */
3961 /* If a non-BLKmode value is returned at the most significant end
3962 of a register, shift the register right by the appropriate amount
3963 and update VALREG accordingly. BLKmode values are handled by the
3964 group load/store machinery below. */
3966 && !pcc_struct_value
3971 {
3975 }
3978 {
3982 /* The return value from a malloc-like function is a pointer. */
3988 /* The return value from a malloc-like function can not alias
3989 anything else. */
3993 /* Write out the sequence. */
3998 }
4000 /* For calls to `setjmp', etc., inform
4001 function.c:setjmp_warnings that it should complain if
4002 nonvolatile values are live. For functions that cannot
4003 return, inform flow that control does not fall through. */
4006 {
4007 /* The barrier must be emitted
4008 immediately after the CALL_INSN. Some ports emit more
4009 than just a CALL_INSN above, so we must search for it here. */
4013 {
4015 /* There was no CALL_INSN? */
4017 }
4021 /* Stack adjustments after a noreturn call are dead code.
4022 However when NO_DEFER_POP is in effect, we must preserve
4023 stack_pointer_delta. */
4025 {
4028 }
4029 }
4031 /* If value type not void, return an rtx for the value. */
4037 {
4039 {
4040 target
4043 structure_value_addr));
4045 }
4046 }
4048 {
4049 /* This is the special C++ case where we need to
4050 know what the true target was. We take care to
4051 never use this value more than once in one expression. */
4055 }
4056 /* Handle calls that return values in multiple non-contiguous locations.
4057 The Irix 6 ABI has examples of this. */
4059 {
4063 ;
4065 /* Handle the result of a emit_group_move_into_temps
4066 call in the previous pass. */
4068 else
4071 }
4075 {
4078 /* We have to copy a return value in a CLASS_LIKELY_SPILLED hard
4079 reg to a plain register. */
4083 /* If TARGET is a MEM in the argument area, and we have
4084 saved part of the argument area, then we can't store
4085 directly into TARGET as it may get overwritten when we
4086 restore the argument save area below. Don't work too
4087 hard though and simply force TARGET to a register if it
4088 is a MEM; the optimizer is quite likely to sort it out. */
4092 {
4095 }
4099 else
4100 {
4101 /* TARGET and VALREG cannot be equal at this point
4102 because the latter would not have
4103 REG_FUNCTION_VALUE_P true, while the former would if
4104 it were referring to the same register.
4106 If they refer to the same register, this move will be
4107 a no-op, except when function inlining is being
4108 done. */
4111 /* If we are setting a MEM, this code must be executed.
4112 Since it is emitted after the call insn, sibcall
4113 optimization cannot be performed in that case. */
4116 }
4117 }
4118 else
4121 /* If we promoted this return value, make the proper SUBREG.
4122 TARGET might be const0_rtx here, so be careful. */
4126 {
4130 machine_mode pmode;
4132 /* Ensure we promote as expected, and get the new unsignedness. */
4140 {
4147 }
4152 }
4154 /* If size of args is variable or this was a constructor call for a stack
4155 argument, restore saved stack-pointer value. */
4158 {
4172 }
4174 {
4175 #ifdef REG_PARM_STACK_SPACE
4179 #endif
4181 /* If we saved any argument areas, restore them. */
4184 {
4186 rtx stack_area
4193 else
4196 BLOCK_OP_CALL_PARM);
4197 }
4201 }
4203 /* If this was alloca, record the new stack level. */
4207 /* Free up storage we no longer need. */
4217 {
4220 /* Restore the pending stack adjustment now that we have
4221 finished generating the sibling call sequence. */
4225 /* Prepare arg structure for next iteration. */
4227 {
4231 }
4236 }
4237 else
4238 {
4241 /* Verify that we've deallocated all the stack we used. */
4243 || (old_stack_allocated
4245 }
4247 /* If something prevents making this a sibling call,
4248 zero out the sequence. */
4251 else
4253 }
4255 /* If tail call production succeeded, we need to remove REG_EQUIV notes on
4256 arguments too, as argument area is now clobbered by the call. */
4258 {
4261 }
4262 else
4263 {
4266 /* Ideally we'd emit a message for all of the ways that it could
4267 have failed. */
4269 }
4271 currently_expanding_call--;
4276 /* Join result with returned bounds so caller may use them if needed. */
4280 }
4282 /* A sibling call sequence invalidates any REG_EQUIV notes made for
4283 this function's incoming arguments.
4285 At the start of RTL generation we know the only REG_EQUIV notes
4286 in the rtl chain are those for incoming arguments, so we can look
4287 for REG_EQUIV notes between the start of the function and the
4288 NOTE_INSN_FUNCTION_BEG.
4290 This is (slight) overkill. We could keep track of the highest
4291 argument we clobber and be more selective in removing notes, but it
4292 does not seem to be worth the effort. */
4294 void
4296 {
4300 {
4301 rtx note;
4303 /* There are never REG_EQUIV notes for the incoming arguments
4304 after the NOTE_INSN_FUNCTION_BEG note, so stop if we see it. */
4314 }
4315 }
4317 /* Traverse a list of TYPES and expand all complex types into their
4318 components. */
4319 static tree
4321 {
4322 tree p;
4324 /* Before allocating memory, check for the common case of no complex. */
4326 {
4331 }
4334 found:
4338 {
4343 {
4346 /* Rewrite complex type with component type. */
4350 /* Add another component type for the imaginary part. */
4355 /* Skip the newly created node. */
4357 }
4358 }
4361 }
4362 \f
4363 /* Output a library call to function FUN (a SYMBOL_REF rtx).
4364 The RETVAL parameter specifies whether return value needs to be saved, other
4365 parameters are documented in the emit_library_call function below. */
4367 static rtx
4371 {
4372 /* Total size in bytes of all the stack-parms scanned so far. */
4374 /* Size of arguments before any adjustments (such as rounding). */
4377 rtx fun;
4378 /* Todo, choose the correct decl type of orgfun. Sadly this information
4379 isn't present here, so we default to native calling abi here. */
4384 CUMULATIVE_ARGS args_so_far_v;
4385 cumulative_args_t args_so_far;
4386 struct arg
4387 {
4388 rtx value;
4389 machine_mode mode;
4390 rtx reg;
4393 rtx save_area;
4394 };
4399 rtx valreg;
4409 #ifdef REG_PARM_STACK_SPACE
4410 /* Define the boundary of the register parm stack space that needs to be
4411 save, if any. */
4414 #endif
4416 /* Size of the stack reserved for parameter registers. */
4423 #ifdef REG_PARM_STACK_SPACE
4425 #endif
4427 /* By default, library functions cannot throw. */
4431 {
4449 }
4452 /* Ensure current function's preferred stack boundary is at least
4453 what we need. */
4457 /* If this kind of value comes back in memory,
4458 decide where in memory it should come back. */
4460 {
4463 {
4464 #ifdef PCC_STATIC_STRUCT_RETURN
4465 rtx pointer_reg
4475 else
4477 #endif
4478 /* This call returns a big structure. */
4480 }
4481 }
4482 else
4485 /* ??? Unfinished: must pass the memory address as an argument. */
4487 /* Copy all the libcall-arguments out of the varargs data
4488 and into a vector ARGVEC.
4490 Compute how to pass each argument. We only support a very small subset
4491 of the full argument passing conventions to limit complexity here since
4492 library functions shouldn't have many args. */
4497 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
4499 #else
4501 #endif
4511 /* If there's a structure value address to be passed,
4512 either pass it in the special place, or pass it as an extra argument. */
4514 {
4517 nargs++;
4519 /* Make sure it is a reasonable operand for a move or push insn. */
4535 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4537 #else
4539 #endif
4549 count++;
4550 }
4553 {
4558 /* We cannot convert the arg value to the mode the library wants here;
4559 must do it earlier where we know the signedness of the arg. */
4563 /* Make sure it is a reasonable operand for a move or push insn. */
4569 {
4570 rtx slot;
4571 int must_copy
4574 /* If this was a CONST function, it is now PURE since it now
4575 reads memory. */
4577 {
4580 }
4583 {
4588 }
4589 else
4590 {
4594 }
4598 call_fusage);
4602 slot),
4603 call_fusage);
4607 }
4621 {
4623 #ifdef STACK_PARMS_IN_REG_PARM_AREA
4625 #else
4627 #endif
4632 }
4633 #ifdef BLOCK_REG_PADDING
4634 else
4635 /* The argument is passed entirely in registers. See at which
4636 end it should be padded. */
4640 #endif
4643 }
4645 /* If this machine requires an external definition for library
4646 functions, write one out. */
4651 + stack_pointer_delta
4653 / STACK_BYTES
4658 reg_parm_stack_space);
4667 {
4671 }
4674 {
4675 /* Since the stack pointer will never be pushed, it is possible for
4676 the evaluation of a parm to clobber something we have already
4677 written to the stack. Since most function calls on RISC machines
4678 do not use the stack, this is uncommon, but must work correctly.
4680 Therefore, we save any area of the stack that was already written
4681 and that we are using. Here we set up to do this by making a new
4682 stack usage map from the old one.
4684 Another approach might be to try to reorder the argument
4685 evaluations to avoid this conflicting stack usage. */
4689 /* Since we will be writing into the entire argument area, the
4690 map must be allocated for its entire size, not just the part that
4691 is the responsibility of the caller. */
4698 else
4706 initial_highest_arg_in_use);
4713 /* We must be careful to use virtual regs before they're instantiated,
4714 and real regs afterwards. Loop optimization, for example, can create
4715 new libcalls after we've instantiated the virtual regs, and if we
4716 use virtuals anyway, they won't match the rtl patterns. */
4720 STACK_POINTER_OFFSET);
4721 else
4723 }
4724 else
4725 {
4728 }
4730 /* We push args individually in reverse order, perform stack alignment
4731 before the first push (the last arg). */
4738 #ifdef REG_PARM_STACK_SPACE
4740 {
4741 /* The argument list is the property of the called routine and it
4742 may clobber it. If the fixed area has been used for previous
4743 parameters, we must save and restore it. */
4746 }
4747 #endif
4749 /* When expanding a normal call, args are stored in push order,
4750 which is the reverse of what we have here. */
4754 {
4757 }
4761 /* Push the args that need to be pushed. */
4765 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4766 are to be pushed. */
4768 {
4777 {
4778 rtx use;
4781 {
4782 /* If this is being stored into a pre-allocated, fixed-size,
4783 stack area, save any previous data at that location. */
4786 {
4787 /* stack_slot is negative, but we want to index stack_usage_map
4788 with positive values. */
4791 }
4792 else
4793 {
4796 }
4799 /* Don't worry about things in the fixed argument area;
4800 it has already been saved. */
4804 i++;
4807 {
4808 /* We need to make a save area. */
4809 unsigned int size
4811 machine_mode save_mode
4813 rtx adr
4816 rtx stack_area
4820 {
4824 );
4828 stack_area,
4830 BLOCK_OP_CALL_PARM);
4831 }
4832 else
4833 {
4837 }
4838 }
4839 }
4844 reg_parm_stack_space,
4847 /* Now mark the segment we just used. */
4852 NO_DEFER_POP;
4854 /* Indicate argument access so that alias.c knows that these
4855 values are live. */
4861 else
4862 {
4863 /* When arguments are pushed, trying to tell alias.c where
4864 exactly this argument is won't work, because the
4865 auto-increment causes confusion. So we merely indicate
4866 that we access something with a known mode somewhere on
4867 the stack. */
4871 }
4875 }
4876 }
4882 /* Now load any reg parms into their regs. */
4884 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4885 are to be pushed. */
4887 {
4892 #ifdef BLOCK_REG_PADDING
4894 #endif
4896 /* Handle calls that pass values in multiple non-contiguous
4897 locations. The PA64 has examples of this for library calls. */
4901 {
4903 #ifdef BLOCK_REG_PADDING
4906 /* Copied from load_register_parameters. */
4908 /* Handle case where we have a value that needs shifting
4909 up to the msb. eg. a QImode value and we're padding
4910 upward on a BYTES_BIG_ENDIAN machine. */
4914 {
4915 rtx x;
4918 /* Assigning REG here rather than a temp makes CALL_FUSAGE
4919 report the whole reg as used. Strictly speaking, the
4920 call only uses SIZE bytes at the msb end, but it doesn't
4921 seem worth generating rtl to say that. */
4926 }
4927 #endif
4928 }
4930 NO_DEFER_POP;
4931 }
4933 /* Any regs containing parms remain in use through the call. */
4935 {
4940 {
4943 {
4948 }
4949 else
4951 }
4952 }
4954 /* Pass the function the address in which to return a structure value. */
4956 {
4960 NULL_RTX)));
4963 }
4965 /* Don't allow popping to be deferred, since then
4966 cse'ing of library calls could delete a call and leave the pop. */
4967 NO_DEFER_POP;
4971 /* Stack must be properly aligned now. */
4977 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
4978 will set inhibit_defer_pop to that value. */
4979 /* The return type is needed to decide how many bytes the function pops.
4980 Signedness plays no role in that, so for simplicity, we pretend it's
4981 always signed. We also assume that the list of arguments passed has
4982 no impact, so we pretend it is unknown. */
4988 struct_value_size,
4991 valreg,
4995 {
5000 }
5002 /* Right-shift returned value if necessary. */
5006 {
5009 }
5013 /* For calls to `setjmp', etc., inform function.c:setjmp_warnings
5014 that it should complain if nonvolatile values are live. For
5015 functions that cannot return, inform flow that control does not
5016 fall through. */
5018 {
5019 /* The barrier note must be emitted
5020 immediately after the CALL_INSN. Some ports emit more than
5021 just a CALL_INSN above, so we must search for it here. */
5024 {
5026 /* There was no CALL_INSN? */
5028 }
5031 }
5033 /* Consider that "regular" libcalls, i.e. all of them except for LCT_THROW
5034 and LCT_RETURNS_TWICE, cannot perform non-local gotos. */
5036 {
5039 {
5041 /* There was no CALL_INSN? */
5043 }
5046 }
5048 /* Now restore inhibit_defer_pop to its actual original value. */
5049 OK_DEFER_POP;
5053 /* Copy the value to the right place. */
5055 {
5057 {
5062 }
5064 {
5068 }
5069 else
5070 {
5071 /* Convert to the proper mode if a promotion has been active. */
5073 {
5080 }
5084 else
5086 }
5087 }
5090 {
5091 #ifdef REG_PARM_STACK_SPACE
5095 #endif
5097 /* If we saved any argument areas, restore them. */
5100 {
5109 validize_mem
5112 BLOCK_OP_CALL_PARM);
5113 else
5115 }
5119 }
5125 }
5126 \f
5127 /* Output a library call to function FUN (a SYMBOL_REF rtx)
5128 (emitting the queue unless NO_QUEUE is nonzero),
5129 for a value of mode OUTMODE,
5130 with NARGS different arguments, passed as alternating rtx values
5131 and machine_modes to convert them to.
5133 FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for
5134 `const' calls, LCT_PURE for `pure' calls, or other LCT_ value for
5135 other types of library calls. */
5137 void
5140 {
5146 }
5147 \f
5148 /* Like emit_library_call except that an extra argument, VALUE,
5149 comes second and says where to store the result.
5150 (If VALUE is zero, this function chooses a convenient way
5151 to return the value.
5153 This function returns an rtx for where the value is to be found.
5154 If VALUE is nonzero, VALUE is returned. */
5156 rtx
5160 {
5161 rtx result;
5170 }
5171 \f
5173 /* Store pointer bounds argument ARG into Bounds Table entry
5174 associated with PARM. */
5175 static void
5177 {
5180 /* We may pass bounds not associated with any pointer. */
5182 {
5186 }
5187 /* Find pointer associated with bounds and where it is
5188 passed. */
5189 else
5190 {
5192 {
5196 }
5198 {
5206 else
5207 {
5210 }
5211 }
5212 else
5213 {
5222 else
5224 }
5225 }
5227 /* Expand bounds. */
5232 }
5234 /* Store a single argument for a function call
5235 into the register or memory area where it must be passed.
5236 *ARG describes the argument value and where to pass it.
5238 ARGBLOCK is the address of the stack-block for all the arguments,
5239 or 0 on a machine where arguments are pushed individually.
5241 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
5242 so must be careful about how the stack is used.
5244 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
5245 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
5246 that we need not worry about saving and restoring the stack.
5248 FNDECL is the declaration of the function we are calling.
5250 Return nonzero if this arg should cause sibcall failure,
5251 zero otherwise. */
5253 static int
5256 {
5267 /* Push a new temporary level for any temporaries we make for
5268 this argument. */
5272 {
5273 /* If this is being stored into a pre-allocated, fixed-size, stack area,
5274 save any previous data at that location. */
5276 {
5278 {
5279 /* stack_slot is negative, but we want to index stack_usage_map
5280 with positive values. */
5283 else
5287 }
5288 else
5289 {
5292 else
5296 }
5299 /* Don't worry about things in the fixed argument area;
5300 it has already been saved. */
5304 i++;
5307 {
5308 /* We need to make a save area. */
5315 {
5316 arg->save_area
5320 stack_area,
5322 BLOCK_OP_CALL_PARM);
5323 }
5324 else
5325 {
5328 }
5329 }
5330 }
5331 }
5333 /* If this isn't going to be placed on both the stack and in registers,
5334 set up the register and number of words. */
5336 {
5339 else
5342 }
5344 /* Being passed entirely in a register. We shouldn't be called in
5345 this case. */
5348 /* If this arg needs special alignment, don't load the registers
5349 here. */
5353 /* If this is being passed partially in a register, we can't evaluate
5354 it directly into its stack slot. Otherwise, we can. */
5356 {
5357 /* stack_arg_under_construction is nonzero if a function argument is
5358 being evaluated directly into the outgoing argument list and
5359 expand_call must take special action to preserve the argument list
5360 if it is called recursively.
5362 For scalar function arguments stack_usage_map is sufficient to
5363 determine which stack slots must be saved and restored. Scalar
5364 arguments in general have pass_on_stack == 0.
5366 If this argument is initialized by a function which takes the
5367 address of the argument (a C++ constructor or a C function
5368 returning a BLKmode structure), then stack_usage_map is
5369 insufficient and expand_call must push the stack around the
5370 function call. Such arguments have pass_on_stack == 1.
5372 Note that it is always safe to set stack_arg_under_construction,
5373 but this generates suboptimal code if set when not needed. */
5376 stack_arg_under_construction++;
5379 (partial
5384 /* If we are promoting object (or for any other reason) the mode
5385 doesn't agree, convert the mode. */
5392 stack_arg_under_construction--;
5393 }
5395 /* Check for overlap with already clobbered argument area. */
5402 /* Don't allow anything left on stack from computation
5403 of argument to alloca. */
5408 /* If the value is already in the stack slot, we are done. */
5409 ;
5411 {
5415 /* Argument is a scalar, not entirely passed in registers.
5416 (If part is passed in registers, arg->partial says how much
5417 and emit_push_insn will take care of putting it there.)
5419 Push it, and if its size is less than the
5420 amount of space allocated to it,
5421 also bump stack pointer by the additional space.
5422 Note that in C the default argument promotions
5423 will prevent such mismatches. */
5426 /* Compute how much space the push instruction will push.
5427 On many machines, pushing a byte will advance the stack
5428 pointer by a halfword. */
5429 #ifdef PUSH_ROUNDING
5431 #endif
5434 /* Compute how much space the argument should get:
5435 round up to a multiple of the alignment for arguments. */
5441 /* Compute the alignment of the pushed argument. */
5444 {
5447 {
5450 }
5451 }
5453 /* This isn't already where we want it on the stack, so put it there.
5454 This can either be done with push or copy insns. */
5461 /* Unless this is a partially-in-register argument, the argument is now
5462 in the stack. */
5465 }
5466 else
5467 {
5468 /* BLKmode, at least partly to be pushed. */
5472 rtx size_rtx;
5474 /* Pushing a nonscalar.
5475 If part is passed in registers, PARTIAL says how much
5476 and emit_push_insn will take care of putting it there. */
5478 /* Round its size up to a multiple
5479 of the allocation unit for arguments. */
5482 {
5485 }
5486 else
5487 {
5488 /* PUSH_ROUNDING has no effect on us, because emit_push_insn
5489 for BLKmode is careful to avoid it. */
5495 EXPAND_NORMAL);
5496 }
5500 /* When an argument is padded down, the block is aligned to
5501 PARM_BOUNDARY, but the actual argument isn't. */
5503 {
5507 {
5510 }
5511 }
5514 {
5515 /* emit_push_insn might not work properly if arg->value and
5516 argblock + arg->locate.offset areas overlap. */
5525 {
5529 /* arg.locate doesn't contain the pretend_args_size offset,
5530 it's part of argblock. Ensure we don't count it in I. */
5533 else
5536 /* expand_call should ensure this. */
5542 {
5545 }
5547 {
5548 /* Use arg->locate.size.constant instead of size_rtx
5549 because we only care about the part of the argument
5550 on the stack. */
5554 }
5555 else
5556 {
5557 /* Even though they appear to be at the same location,
5558 if part of the outgoing argument is in registers,
5559 they aren't really at the same location. Check for
5560 this by making sure that the incoming size is the
5561 same as the outgoing size. */
5564 }
5565 }
5566 }
5573 /* Unless this is a partially-in-register argument, the argument is now
5574 in the stack.
5576 ??? Unlike the case above, in which we want the actual
5577 address of the data, so that we can load it directly into a
5578 register, here we want the address of the stack slot, so that
5579 it's properly aligned for word-by-word copying or something
5580 like that. It's not clear that this is always correct. */
5583 }
5586 {
5588 arg->parallel_value
5591 }
5593 /* Mark all slots this store used. */
5599 /* Once we have pushed something, pops can't safely
5600 be deferred during the rest of the arguments. */
5601 NO_DEFER_POP;
5603 /* Free any temporary slots made in processing this argument. */
5607 }
5609 /* Nonzero if we do not know how to pass TYPE solely in registers. */
5611 bool
5613 const_tree type)
5614 {
5618 /* If the type has variable size... */
5622 /* If the type is marked as addressable (it is required
5623 to be constructed into the stack)... */
5628 }
5630 /* Another version of the TARGET_MUST_PASS_IN_STACK hook. This one
5631 takes trailing padding of a structure into account. */
5632 /* ??? Should be able to merge these two by examining BLOCK_REG_PADDING. */
5634 bool
5636 {
5640 /* If the type has variable size... */
5644 /* If the type is marked as addressable (it is required
5645 to be constructed into the stack)... */
5649 /* If the padding and mode of the type is such that a copy into
5650 a register would put it into the wrong part of the register. */
5658 }
5660 /* Tell the garbage collector about GTY markers in this source file. */