1 /* Convert function calls to rtl insns, for GNU C compiler.
2 Copyright (C) 1989, 92, 93, 94, 95, 96, 1997 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
31 #include "insn-flags.h"
33 /* Decide whether a function's arguments should be processed
34 from first to last or from last to first.
36 They should if the stack and args grow in opposite directions, but
37 only if we have push insns. */
41 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
42 #define PUSH_ARGS_REVERSED /* If it's last to first */
47 /* Like STACK_BOUNDARY but in units of bytes, not bits. */
48 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
50 /* Data structure and subroutines used within expand_call. */
54 /* Tree node for this argument. */
56 /* Mode for value; TYPE_MODE unless promoted. */
57 enum machine_mode mode;
58 /* Current RTL value for argument, or 0 if it isn't precomputed. */
60 /* Initially-compute RTL value for argument; only for const functions. */
62 /* Register to pass this argument in, 0 if passed on stack, or an
63 PARALLEL if the arg is to be copied into multiple non-contiguous
66 /* If REG was promoted from the actual mode of the argument expression,
67 indicates whether the promotion is sign- or zero-extended. */
69 /* Number of registers to use. 0 means put the whole arg in registers.
70 Also 0 if not passed in registers. */
72 /* Non-zero if argument must be passed on stack.
73 Note that some arguments may be passed on the stack
74 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
75 pass_on_stack identifies arguments that *cannot* go in registers. */
77 /* Offset of this argument from beginning of stack-args. */
78 struct args_size offset;
79 /* Similar, but offset to the start of the stack slot. Different from
80 OFFSET if this arg pads downward. */
81 struct args_size slot_offset;
82 /* Size of this argument on the stack, rounded up for any padding it gets,
83 parts of the argument passed in registers do not count.
84 If REG_PARM_STACK_SPACE is defined, then register parms
85 are counted here as well. */
86 struct args_size size;
87 /* Location on the stack at which parameter should be stored. The store
88 has already been done if STACK == VALUE. */
90 /* Location on the stack of the start of this argument slot. This can
91 differ from STACK if this arg pads downward. This location is known
92 to be aligned to FUNCTION_ARG_BOUNDARY. */
94 #ifdef ACCUMULATE_OUTGOING_ARGS
95 /* Place that this stack area has been saved, if needed. */
98 /* If an argument's alignment does not permit direct copying into registers,
99 copy in smaller-sized pieces into pseudos. These are stored in a
100 block pointed to by this field. The next field says how many
101 word-sized pseudos we made. */
106 #ifdef ACCUMULATE_OUTGOING_ARGS
107 /* A vector of one char per byte of stack space. A byte if non-zero if
108 the corresponding stack location has been used.
109 This vector is used to prevent a function call within an argument from
110 clobbering any stack already set up. */
111 static char *stack_usage_map;
113 /* Size of STACK_USAGE_MAP. */
114 static int highest_outgoing_arg_in_use;
116 /* stack_arg_under_construction is nonzero when an argument may be
117 initialized with a constructor call (including a C function that
118 returns a BLKmode struct) and expand_call must take special action
119 to make sure the object being constructed does not overlap the
120 argument list for the constructor call. */
121 int stack_arg_under_construction;
124 static int calls_function PROTO((tree, int));
125 static int calls_function_1 PROTO((tree, int));
126 static void emit_call_1 PROTO((rtx, tree, tree, int, int, rtx, rtx,
128 static void store_one_arg PROTO ((struct arg_data *, rtx, int, int,
131 /* If WHICH is 1, return 1 if EXP contains a call to the built-in function
134 If WHICH is 0, return 1 if EXP contains a call to any function.
135 Actually, we only need return 1 if evaluating EXP would require pushing
136 arguments on the stack, but that is too difficult to compute, so we just
137 assume any function call might require the stack. */
139 static tree calls_function_save_exprs;
142 calls_function (exp, which)
147 calls_function_save_exprs = 0;
148 val = calls_function_1 (exp, which);
149 calls_function_save_exprs = 0;
154 calls_function_1 (exp, which)
159 enum tree_code code = TREE_CODE (exp);
160 int type = TREE_CODE_CLASS (code);
161 int length = tree_code_length[(int) code];
163 /* If this code is language-specific, we don't know what it will do. */
164 if ((int) code >= NUM_TREE_CODES)
167 /* Only expressions and references can contain calls. */
168 if (type != 'e' && type != '<' && type != '1' && type != '2' && type != 'r'
177 else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
178 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
181 tree fndecl = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
183 if ((DECL_BUILT_IN (fndecl)
184 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_ALLOCA)
185 || (DECL_SAVED_INSNS (fndecl)
186 && (FUNCTION_FLAGS (DECL_SAVED_INSNS (fndecl))
187 & FUNCTION_FLAGS_CALLS_ALLOCA)))
191 /* Third operand is RTL. */
196 if (SAVE_EXPR_RTL (exp) != 0)
198 if (value_member (exp, calls_function_save_exprs))
200 calls_function_save_exprs = tree_cons (NULL_TREE, exp,
201 calls_function_save_exprs);
202 return (TREE_OPERAND (exp, 0) != 0
203 && calls_function_1 (TREE_OPERAND (exp, 0), which));
209 for (local = BLOCK_VARS (exp); local; local = TREE_CHAIN (local))
210 if (DECL_INITIAL (local) != 0
211 && calls_function_1 (DECL_INITIAL (local), which))
215 register tree subblock;
217 for (subblock = BLOCK_SUBBLOCKS (exp);
219 subblock = TREE_CHAIN (subblock))
220 if (calls_function_1 (subblock, which))
225 case METHOD_CALL_EXPR:
229 case WITH_CLEANUP_EXPR:
237 for (i = 0; i < length; i++)
238 if (TREE_OPERAND (exp, i) != 0
239 && calls_function_1 (TREE_OPERAND (exp, i), which))
245 /* Force FUNEXP into a form suitable for the address of a CALL,
246 and return that as an rtx. Also load the static chain register
247 if FNDECL is a nested function.
249 CALL_FUSAGE points to a variable holding the prospective
250 CALL_INSN_FUNCTION_USAGE information. */
253 prepare_call_address (funexp, fndecl, call_fusage, reg_parm_seen)
259 rtx static_chain_value = 0;
261 funexp = protect_from_queue (funexp, 0);
264 /* Get possible static chain value for nested function in C. */
265 static_chain_value = lookup_static_chain (fndecl);
267 /* Make a valid memory address and copy constants thru pseudo-regs,
268 but not for a constant address if -fno-function-cse. */
269 if (GET_CODE (funexp) != SYMBOL_REF)
271 #ifdef SMALL_REGISTER_CLASSES
272 /* If we are using registers for parameters, force the
273 function address into a register now. */
274 (SMALL_REGISTER_CLASSES && reg_parm_seen)
275 ? force_not_mem (memory_address (FUNCTION_MODE, funexp))
278 memory_address (FUNCTION_MODE, funexp);
281 #ifndef NO_FUNCTION_CSE
282 if (optimize && ! flag_no_function_cse)
283 #ifdef NO_RECURSIVE_FUNCTION_CSE
284 if (fndecl != current_function_decl)
286 funexp = force_reg (Pmode, funexp);
290 if (static_chain_value != 0)
292 emit_move_insn (static_chain_rtx, static_chain_value);
294 if (GET_CODE (static_chain_rtx) == REG)
295 use_reg (call_fusage, static_chain_rtx);
301 /* Generate instructions to call function FUNEXP,
302 and optionally pop the results.
303 The CALL_INSN is the first insn generated.
305 FNDECL is the declaration node of the function. This is given to the
306 macro RETURN_POPS_ARGS to determine whether this function pops its own args.
308 FUNTYPE is the data type of the function. This is given to the macro
309 RETURN_POPS_ARGS to determine whether this function pops its own args.
310 We used to allow an identifier for library functions, but that doesn't
311 work when the return type is an aggregate type and the calling convention
312 says that the pointer to this aggregate is to be popped by the callee.
314 STACK_SIZE is the number of bytes of arguments on the stack,
315 rounded up to STACK_BOUNDARY; zero if the size is variable.
316 This is both to put into the call insn and
317 to generate explicit popping code if necessary.
319 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
320 It is zero if this call doesn't want a structure value.
322 NEXT_ARG_REG is the rtx that results from executing
323 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1)
324 just after all the args have had their registers assigned.
325 This could be whatever you like, but normally it is the first
326 arg-register beyond those used for args in this call,
327 or 0 if all the arg-registers are used in this call.
328 It is passed on to `gen_call' so you can put this info in the call insn.
330 VALREG is a hard register in which a value is returned,
331 or 0 if the call does not return a value.
333 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
334 the args to this call were processed.
335 We restore `inhibit_defer_pop' to that value.
337 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
338 denote registers used by the called function.
340 IS_CONST is true if this is a `const' call. */
343 emit_call_1 (funexp, fndecl, funtype, stack_size, struct_value_size,
344 next_arg_reg, valreg, old_inhibit_defer_pop, call_fusage,
350 int struct_value_size;
353 int old_inhibit_defer_pop;
357 rtx stack_size_rtx = GEN_INT (stack_size);
358 rtx struct_value_size_rtx = GEN_INT (struct_value_size);
360 int already_popped = 0;
362 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
363 and we don't want to load it into a register as an optimization,
364 because prepare_call_address already did it if it should be done. */
365 if (GET_CODE (funexp) != SYMBOL_REF)
366 funexp = memory_address (FUNCTION_MODE, funexp);
368 #ifndef ACCUMULATE_OUTGOING_ARGS
369 #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop)
370 if (HAVE_call_pop && HAVE_call_value_pop
371 && (RETURN_POPS_ARGS (fndecl, funtype, stack_size) > 0
374 rtx n_pop = GEN_INT (RETURN_POPS_ARGS (fndecl, funtype, stack_size));
377 /* If this subroutine pops its own args, record that in the call insn
378 if possible, for the sake of frame pointer elimination. */
381 pat = gen_call_value_pop (valreg,
382 gen_rtx (MEM, FUNCTION_MODE, funexp),
383 stack_size_rtx, next_arg_reg, n_pop);
385 pat = gen_call_pop (gen_rtx (MEM, FUNCTION_MODE, funexp),
386 stack_size_rtx, next_arg_reg, n_pop);
388 emit_call_insn (pat);
395 #if defined (HAVE_call) && defined (HAVE_call_value)
396 if (HAVE_call && HAVE_call_value)
399 emit_call_insn (gen_call_value (valreg,
400 gen_rtx (MEM, FUNCTION_MODE, funexp),
401 stack_size_rtx, next_arg_reg,
404 emit_call_insn (gen_call (gen_rtx (MEM, FUNCTION_MODE, funexp),
405 stack_size_rtx, next_arg_reg,
406 struct_value_size_rtx));
412 /* Find the CALL insn we just emitted. */
413 for (call_insn = get_last_insn ();
414 call_insn && GET_CODE (call_insn) != CALL_INSN;
415 call_insn = PREV_INSN (call_insn))
421 /* Put the register usage information on the CALL. If there is already
422 some usage information, put ours at the end. */
423 if (CALL_INSN_FUNCTION_USAGE (call_insn))
427 for (link = CALL_INSN_FUNCTION_USAGE (call_insn); XEXP (link, 1) != 0;
428 link = XEXP (link, 1))
431 XEXP (link, 1) = call_fusage;
434 CALL_INSN_FUNCTION_USAGE (call_insn) = call_fusage;
436 /* If this is a const call, then set the insn's unchanging bit. */
438 CONST_CALL_P (call_insn) = 1;
440 /* Restore this now, so that we do defer pops for this call's args
441 if the context of the call as a whole permits. */
442 inhibit_defer_pop = old_inhibit_defer_pop;
444 #ifndef ACCUMULATE_OUTGOING_ARGS
445 /* If returning from the subroutine does not automatically pop the args,
446 we need an instruction to pop them sooner or later.
447 Perhaps do it now; perhaps just record how much space to pop later.
449 If returning from the subroutine does pop the args, indicate that the
450 stack pointer will be changed. */
452 if (stack_size != 0 && RETURN_POPS_ARGS (fndecl, funtype, stack_size) > 0)
455 CALL_INSN_FUNCTION_USAGE (call_insn) =
456 gen_rtx (EXPR_LIST, VOIDmode,
457 gen_rtx (CLOBBER, VOIDmode, stack_pointer_rtx),
458 CALL_INSN_FUNCTION_USAGE (call_insn));
459 stack_size -= RETURN_POPS_ARGS (fndecl, funtype, stack_size);
460 stack_size_rtx = GEN_INT (stack_size);
465 if (flag_defer_pop && inhibit_defer_pop == 0 && !is_const)
466 pending_stack_adjust += stack_size;
468 adjust_stack (stack_size_rtx);
473 /* Generate all the code for a function call
474 and return an rtx for its value.
475 Store the value in TARGET (specified as an rtx) if convenient.
476 If the value is stored in TARGET then TARGET is returned.
477 If IGNORE is nonzero, then we ignore the value of the function call. */
480 expand_call (exp, target, ignore)
485 /* List of actual parameters. */
486 tree actparms = TREE_OPERAND (exp, 1);
487 /* RTX for the function to be called. */
489 /* Tree node for the function to be called (not the address!). */
491 /* Data type of the function. */
493 /* Declaration of the function being called,
494 or 0 if the function is computed (not known by name). */
498 /* Register in which non-BLKmode value will be returned,
499 or 0 if no value or if value is BLKmode. */
501 /* Address where we should return a BLKmode value;
502 0 if value not BLKmode. */
503 rtx structure_value_addr = 0;
504 /* Nonzero if that address is being passed by treating it as
505 an extra, implicit first parameter. Otherwise,
506 it is passed by being copied directly into struct_value_rtx. */
507 int structure_value_addr_parm = 0;
508 /* Size of aggregate value wanted, or zero if none wanted
509 or if we are using the non-reentrant PCC calling convention
510 or expecting the value in registers. */
511 int struct_value_size = 0;
512 /* Nonzero if called function returns an aggregate in memory PCC style,
513 by returning the address of where to find it. */
514 int pcc_struct_value = 0;
516 /* Number of actual parameters in this call, including struct value addr. */
518 /* Number of named args. Args after this are anonymous ones
519 and they must all go on the stack. */
521 /* Count arg position in order args appear. */
524 /* Vector of information about each argument.
525 Arguments are numbered in the order they will be pushed,
526 not the order they are written. */
527 struct arg_data *args;
529 /* Total size in bytes of all the stack-parms scanned so far. */
530 struct args_size args_size;
531 /* Size of arguments before any adjustments (such as rounding). */
532 struct args_size original_args_size;
533 /* Data on reg parms scanned so far. */
534 CUMULATIVE_ARGS args_so_far;
535 /* Nonzero if a reg parm has been scanned. */
537 /* Nonzero if this is an indirect function call. */
539 /* Nonzero if we must avoid push-insns in the args for this call.
540 If stack space is allocated for register parameters, but not by the
541 caller, then it is preallocated in the fixed part of the stack frame.
542 So the entire argument block must then be preallocated (i.e., we
543 ignore PUSH_ROUNDING in that case). */
545 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
546 int must_preallocate = 1;
549 int must_preallocate = 0;
551 int must_preallocate = 1;
555 /* Size of the stack reserved for parameter registers. */
556 int reg_parm_stack_space = 0;
558 /* 1 if scanning parms front to back, -1 if scanning back to front. */
560 /* Address of space preallocated for stack parms
561 (on machines that lack push insns), or 0 if space not preallocated. */
564 /* Nonzero if it is plausible that this is a call to alloca. */
566 /* Nonzero if this is a call to setjmp or a related function. */
568 /* Nonzero if this is a call to `longjmp'. */
570 /* Nonzero if this is a call to an inline function. */
571 int is_integrable = 0;
572 /* Nonzero if this is a call to a `const' function.
573 Note that only explicitly named functions are handled as `const' here. */
575 /* Nonzero if this is a call to a `volatile' function. */
577 #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE)
578 /* Define the boundary of the register parm stack space that needs to be
580 int low_to_save = -1, high_to_save;
581 rtx save_area = 0; /* Place that it is saved */
584 #ifdef ACCUMULATE_OUTGOING_ARGS
585 int initial_highest_arg_in_use = highest_outgoing_arg_in_use;
586 char *initial_stack_usage_map = stack_usage_map;
589 rtx old_stack_level = 0;
590 int old_pending_adj = 0;
591 int old_stack_arg_under_construction;
592 int old_inhibit_defer_pop = inhibit_defer_pop;
593 tree old_cleanups = cleanups_this_call;
598 /* See if we can find a DECL-node for the actual function.
599 As a result, decide whether this is a call to an integrable function. */
601 p = TREE_OPERAND (exp, 0);
602 if (TREE_CODE (p) == ADDR_EXPR)
604 fndecl = TREE_OPERAND (p, 0);
605 if (TREE_CODE (fndecl) != FUNCTION_DECL)
610 && fndecl != current_function_decl
611 && DECL_INLINE (fndecl)
612 && DECL_SAVED_INSNS (fndecl)
613 && RTX_INTEGRATED_P (DECL_SAVED_INSNS (fndecl)))
615 else if (! TREE_ADDRESSABLE (fndecl))
617 /* In case this function later becomes inlinable,
618 record that there was already a non-inline call to it.
620 Use abstraction instead of setting TREE_ADDRESSABLE
622 if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline
625 warning_with_decl (fndecl, "can't inline call to `%s'");
626 warning ("called from here");
628 mark_addressable (fndecl);
631 if (TREE_READONLY (fndecl) && ! TREE_THIS_VOLATILE (fndecl)
632 && TYPE_MODE (TREE_TYPE (exp)) != VOIDmode)
635 if (TREE_THIS_VOLATILE (fndecl))
640 /* If we don't have specific function to call, see if we have a
641 constant or `noreturn' function from the type. */
644 is_const = TREE_READONLY (TREE_TYPE (TREE_TYPE (p)));
645 is_volatile = TREE_THIS_VOLATILE (TREE_TYPE (TREE_TYPE (p)));
648 #ifdef REG_PARM_STACK_SPACE
649 #ifdef MAYBE_REG_PARM_STACK_SPACE
650 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
652 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
656 /* Warn if this value is an aggregate type,
657 regardless of which calling convention we are using for it. */
658 if (warn_aggregate_return && AGGREGATE_TYPE_P (TREE_TYPE (exp)))
659 warning ("function call has aggregate value");
661 /* Set up a place to return a structure. */
663 /* Cater to broken compilers. */
664 if (aggregate_value_p (exp))
666 /* This call returns a big structure. */
669 #ifdef PCC_STATIC_STRUCT_RETURN
671 pcc_struct_value = 1;
672 /* Easier than making that case work right. */
675 /* In case this is a static function, note that it has been
677 if (! TREE_ADDRESSABLE (fndecl))
678 mark_addressable (fndecl);
682 #else /* not PCC_STATIC_STRUCT_RETURN */
684 struct_value_size = int_size_in_bytes (TREE_TYPE (exp));
686 if (target && GET_CODE (target) == MEM)
687 structure_value_addr = XEXP (target, 0);
690 /* Assign a temporary on the stack to hold the value. */
692 /* For variable-sized objects, we must be called with a target
693 specified. If we were to allocate space on the stack here,
694 we would have no way of knowing when to free it. */
696 if (struct_value_size < 0)
700 = XEXP (assign_stack_temp (BLKmode, struct_value_size, 1), 0);
701 MEM_IN_STRUCT_P (structure_value_addr)
702 = AGGREGATE_TYPE_P (TREE_TYPE (exp));
706 #endif /* not PCC_STATIC_STRUCT_RETURN */
709 /* If called function is inline, try to integrate it. */
714 rtx before_call = get_last_insn ();
716 temp = expand_inline_function (fndecl, actparms, target,
717 ignore, TREE_TYPE (exp),
718 structure_value_addr);
720 /* If inlining succeeded, return. */
721 if ((HOST_WIDE_INT) temp != -1)
723 if (flag_short_temps)
725 /* Perform all cleanups needed for the arguments of this
726 call (i.e. destructors in C++). It is ok if these
727 destructors clobber RETURN_VALUE_REG, because the
728 only time we care about this is when TARGET is that
729 register. But in C++, we take care to never return
730 that register directly. */
731 expand_cleanups_to (old_cleanups);
734 #ifdef ACCUMULATE_OUTGOING_ARGS
735 /* If the outgoing argument list must be preserved, push
736 the stack before executing the inlined function if it
739 for (i = reg_parm_stack_space - 1; i >= 0; i--)
740 if (i < highest_outgoing_arg_in_use && stack_usage_map[i] != 0)
743 if (stack_arg_under_construction || i >= 0)
746 = before_call ? NEXT_INSN (before_call) : get_insns ();
749 /* Look for a call in the inline function code.
750 If OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl)) is
751 nonzero then there is a call and it is not necessary
752 to scan the insns. */
754 if (OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl)) == 0)
755 for (insn = first_insn; insn; insn = NEXT_INSN (insn))
756 if (GET_CODE (insn) == CALL_INSN)
761 /* Reserve enough stack space so that the largest
762 argument list of any function call in the inline
763 function does not overlap the argument list being
764 evaluated. This is usually an overestimate because
765 allocate_dynamic_stack_space reserves space for an
766 outgoing argument list in addition to the requested
767 space, but there is no way to ask for stack space such
768 that an argument list of a certain length can be
769 safely constructed. */
771 int adjust = OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl));
772 #ifdef REG_PARM_STACK_SPACE
773 /* Add the stack space reserved for register arguments
774 in the inline function. What is really needed is the
775 largest value of reg_parm_stack_space in the inline
776 function, but that is not available. Using the current
777 value of reg_parm_stack_space is wrong, but gives
778 correct results on all supported machines. */
779 adjust += reg_parm_stack_space;
782 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
783 allocate_dynamic_stack_space (GEN_INT (adjust),
784 NULL_RTX, BITS_PER_UNIT);
787 emit_insns_before (seq, first_insn);
788 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
793 /* If the result is equivalent to TARGET, return TARGET to simplify
794 checks in store_expr. They can be equivalent but not equal in the
795 case of a function that returns BLKmode. */
796 if (temp != target && rtx_equal_p (temp, target))
801 /* If inlining failed, mark FNDECL as needing to be compiled
802 separately after all. If function was declared inline,
804 if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline
805 && optimize > 0 && ! TREE_ADDRESSABLE (fndecl))
807 warning_with_decl (fndecl, "inlining failed in call to `%s'");
808 warning ("called from here");
810 mark_addressable (fndecl);
813 /* When calling a const function, we must pop the stack args right away,
814 so that the pop is deleted or moved with the call. */
818 function_call_count++;
820 if (fndecl && DECL_NAME (fndecl))
821 name = IDENTIFIER_POINTER (DECL_NAME (fndecl));
824 /* Unless it's a call to a specific function that isn't alloca,
825 if it has one argument, we must assume it might be alloca. */
828 (!(fndecl != 0 && strcmp (name, "alloca"))
830 && TREE_CHAIN (actparms) == 0);
832 /* We assume that alloca will always be called by name. It
833 makes no sense to pass it as a pointer-to-function to
834 anything that does not understand its behavior. */
836 (name && ((IDENTIFIER_LENGTH (DECL_NAME (fndecl)) == 6
838 && ! strcmp (name, "alloca"))
839 || (IDENTIFIER_LENGTH (DECL_NAME (fndecl)) == 16
841 && ! strcmp (name, "__builtin_alloca"))));
844 /* See if this is a call to a function that can return more than once
845 or a call to longjmp. */
850 if (name != 0 && IDENTIFIER_LENGTH (DECL_NAME (fndecl)) <= 15)
854 /* Disregard prefix _, __ or __x. */
857 if (name[1] == '_' && name[2] == 'x')
859 else if (name[1] == '_')
869 && (! strcmp (tname, "setjmp")
870 || ! strcmp (tname, "setjmp_syscall")))
872 && ! strcmp (tname, "sigsetjmp"))
874 && ! strcmp (tname, "savectx")));
876 && ! strcmp (tname, "siglongjmp"))
879 else if ((tname[0] == 'q' && tname[1] == 's'
880 && ! strcmp (tname, "qsetjmp"))
881 || (tname[0] == 'v' && tname[1] == 'f'
882 && ! strcmp (tname, "vfork")))
885 else if (tname[0] == 'l' && tname[1] == 'o'
886 && ! strcmp (tname, "longjmp"))
891 current_function_calls_alloca = 1;
893 /* Don't let pending stack adjusts add up to too much.
894 Also, do all pending adjustments now
895 if there is any chance this might be a call to alloca. */
897 if (pending_stack_adjust >= 32
898 || (pending_stack_adjust > 0 && may_be_alloca))
899 do_pending_stack_adjust ();
901 /* Operand 0 is a pointer-to-function; get the type of the function. */
902 funtype = TREE_TYPE (TREE_OPERAND (exp, 0));
903 if (TREE_CODE (funtype) != POINTER_TYPE)
905 funtype = TREE_TYPE (funtype);
907 /* Push the temporary stack slot level so that we can free any temporaries
911 /* Start updating where the next arg would go.
913 On some machines (such as the PA) indirect calls have a different
914 calling convention than normal calls. The last argument in
915 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
917 INIT_CUMULATIVE_ARGS (args_so_far, funtype, NULL_RTX, (fndecl == 0));
919 /* If struct_value_rtx is 0, it means pass the address
920 as if it were an extra parameter. */
921 if (structure_value_addr && struct_value_rtx == 0)
923 /* If structure_value_addr is a REG other than
924 virtual_outgoing_args_rtx, we can use always use it. If it
925 is not a REG, we must always copy it into a register.
926 If it is virtual_outgoing_args_rtx, we must copy it to another
927 register in some cases. */
928 rtx temp = (GET_CODE (structure_value_addr) != REG
929 #ifdef ACCUMULATE_OUTGOING_ARGS
930 || (stack_arg_under_construction
931 && structure_value_addr == virtual_outgoing_args_rtx)
933 ? copy_addr_to_reg (structure_value_addr)
934 : structure_value_addr);
937 = tree_cons (error_mark_node,
938 make_tree (build_pointer_type (TREE_TYPE (funtype)),
941 structure_value_addr_parm = 1;
944 /* Count the arguments and set NUM_ACTUALS. */
945 for (p = actparms, i = 0; p; p = TREE_CHAIN (p)) i++;
948 /* Compute number of named args.
949 Normally, don't include the last named arg if anonymous args follow.
950 We do include the last named arg if STRICT_ARGUMENT_NAMING is defined.
951 (If no anonymous args follow, the result of list_length is actually
952 one too large. This is harmless.)
954 If SETUP_INCOMING_VARARGS is defined and STRICT_ARGUMENT_NAMING is not,
955 this machine will be able to place unnamed args that were passed in
956 registers into the stack. So treat all args as named. This allows the
957 insns emitting for a specific argument list to be independent of the
958 function declaration.
960 If SETUP_INCOMING_VARARGS is not defined, we do not have any reliable
961 way to pass unnamed args in registers, so we must force them into
963 #if !defined(SETUP_INCOMING_VARARGS) || defined(STRICT_ARGUMENT_NAMING)
964 if (TYPE_ARG_TYPES (funtype) != 0)
966 = (list_length (TYPE_ARG_TYPES (funtype))
967 #ifndef STRICT_ARGUMENT_NAMING
968 /* Don't include the last named arg. */
971 /* Count the struct value address, if it is passed as a parm. */
972 + structure_value_addr_parm);
975 /* If we know nothing, treat all args as named. */
976 n_named_args = num_actuals;
978 /* Make a vector to hold all the information about each arg. */
979 args = (struct arg_data *) alloca (num_actuals * sizeof (struct arg_data));
980 bzero ((char *) args, num_actuals * sizeof (struct arg_data));
982 args_size.constant = 0;
985 /* In this loop, we consider args in the order they are written.
986 We fill up ARGS from the front or from the back if necessary
987 so that in any case the first arg to be pushed ends up at the front. */
989 #ifdef PUSH_ARGS_REVERSED
990 i = num_actuals - 1, inc = -1;
991 /* In this case, must reverse order of args
992 so that we compute and push the last arg first. */
997 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
998 for (p = actparms, argpos = 0; p; p = TREE_CHAIN (p), i += inc, argpos++)
1000 tree type = TREE_TYPE (TREE_VALUE (p));
1002 enum machine_mode mode;
1004 args[i].tree_value = TREE_VALUE (p);
1006 /* Replace erroneous argument with constant zero. */
1007 if (type == error_mark_node || TYPE_SIZE (type) == 0)
1008 args[i].tree_value = integer_zero_node, type = integer_type_node;
1010 /* If TYPE is a transparent union, pass things the way we would
1011 pass the first field of the union. We have already verified that
1012 the modes are the same. */
1013 if (TYPE_TRANSPARENT_UNION (type))
1014 type = TREE_TYPE (TYPE_FIELDS (type));
1016 /* Decide where to pass this arg.
1018 args[i].reg is nonzero if all or part is passed in registers.
1020 args[i].partial is nonzero if part but not all is passed in registers,
1021 and the exact value says how many words are passed in registers.
1023 args[i].pass_on_stack is nonzero if the argument must at least be
1024 computed on the stack. It may then be loaded back into registers
1025 if args[i].reg is nonzero.
1027 These decisions are driven by the FUNCTION_... macros and must agree
1028 with those made by function.c. */
1030 /* See if this argument should be passed by invisible reference. */
1031 if ((TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST
1032 && contains_placeholder_p (TYPE_SIZE (type)))
1033 || TREE_ADDRESSABLE (type)
1034 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
1035 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, TYPE_MODE (type),
1036 type, argpos < n_named_args)
1040 #ifdef FUNCTION_ARG_CALLEE_COPIES
1041 if (FUNCTION_ARG_CALLEE_COPIES (args_so_far, TYPE_MODE (type), type,
1042 argpos < n_named_args)
1043 /* If it's in a register, we must make a copy of it too. */
1044 /* ??? Is this a sufficient test? Is there a better one? */
1045 && !(TREE_CODE (args[i].tree_value) == VAR_DECL
1046 && REG_P (DECL_RTL (args[i].tree_value)))
1047 && ! TREE_ADDRESSABLE (type))
1049 args[i].tree_value = build1 (ADDR_EXPR,
1050 build_pointer_type (type),
1051 args[i].tree_value);
1052 type = build_pointer_type (type);
1057 /* We make a copy of the object and pass the address to the
1058 function being called. */
1061 if (TYPE_SIZE (type) == 0
1062 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
1064 /* This is a variable-sized object. Make space on the stack
1066 rtx size_rtx = expr_size (TREE_VALUE (p));
1068 if (old_stack_level == 0)
1070 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1071 old_pending_adj = pending_stack_adjust;
1072 pending_stack_adjust = 0;
1075 copy = gen_rtx (MEM, BLKmode,
1076 allocate_dynamic_stack_space (size_rtx,
1078 TYPE_ALIGN (type)));
1082 int size = int_size_in_bytes (type);
1083 copy = assign_stack_temp (TYPE_MODE (type), size, 0);
1086 MEM_IN_STRUCT_P (copy) = AGGREGATE_TYPE_P (type);
1088 store_expr (args[i].tree_value, copy, 0);
1091 args[i].tree_value = build1 (ADDR_EXPR,
1092 build_pointer_type (type),
1093 make_tree (type, copy));
1094 type = build_pointer_type (type);
1098 mode = TYPE_MODE (type);
1099 unsignedp = TREE_UNSIGNED (type);
1101 #ifdef PROMOTE_FUNCTION_ARGS
1102 mode = promote_mode (type, mode, &unsignedp, 1);
1105 args[i].unsignedp = unsignedp;
1106 args[i].mode = mode;
1107 args[i].reg = FUNCTION_ARG (args_so_far, mode, type,
1108 argpos < n_named_args);
1109 #ifdef FUNCTION_ARG_PARTIAL_NREGS
1112 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, type,
1113 argpos < n_named_args);
1116 args[i].pass_on_stack = MUST_PASS_IN_STACK (mode, type);
1118 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1119 it means that we are to pass this arg in the register(s) designated
1120 by the PARALLEL, but also to pass it in the stack. */
1121 if (args[i].reg && GET_CODE (args[i].reg) == PARALLEL
1122 && XEXP (XVECEXP (args[i].reg, 0, 0), 0) == 0)
1123 args[i].pass_on_stack = 1;
1125 /* If this is an addressable type, we must preallocate the stack
1126 since we must evaluate the object into its final location.
1128 If this is to be passed in both registers and the stack, it is simpler
1130 if (TREE_ADDRESSABLE (type)
1131 || (args[i].pass_on_stack && args[i].reg != 0))
1132 must_preallocate = 1;
1134 /* If this is an addressable type, we cannot pre-evaluate it. Thus,
1135 we cannot consider this function call constant. */
1136 if (TREE_ADDRESSABLE (type))
1139 /* Compute the stack-size of this argument. */
1140 if (args[i].reg == 0 || args[i].partial != 0
1141 #ifdef REG_PARM_STACK_SPACE
1142 || reg_parm_stack_space > 0
1144 || args[i].pass_on_stack)
1145 locate_and_pad_parm (mode, type,
1146 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1151 fndecl, &args_size, &args[i].offset,
1154 #ifndef ARGS_GROW_DOWNWARD
1155 args[i].slot_offset = args_size;
1158 #ifndef REG_PARM_STACK_SPACE
1159 /* If a part of the arg was put into registers,
1160 don't include that part in the amount pushed. */
1161 if (! args[i].pass_on_stack)
1162 args[i].size.constant -= ((args[i].partial * UNITS_PER_WORD)
1163 / (PARM_BOUNDARY / BITS_PER_UNIT)
1164 * (PARM_BOUNDARY / BITS_PER_UNIT));
1167 /* Update ARGS_SIZE, the total stack space for args so far. */
1169 args_size.constant += args[i].size.constant;
1170 if (args[i].size.var)
1172 ADD_PARM_SIZE (args_size, args[i].size.var);
1175 /* Since the slot offset points to the bottom of the slot,
1176 we must record it after incrementing if the args grow down. */
1177 #ifdef ARGS_GROW_DOWNWARD
1178 args[i].slot_offset = args_size;
1180 args[i].slot_offset.constant = -args_size.constant;
1183 SUB_PARM_SIZE (args[i].slot_offset, args_size.var);
1187 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1188 have been used, etc. */
1190 FUNCTION_ARG_ADVANCE (args_so_far, TYPE_MODE (type), type,
1191 argpos < n_named_args);
1194 #ifdef FINAL_REG_PARM_STACK_SPACE
1195 reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant,
1199 /* Compute the actual size of the argument block required. The variable
1200 and constant sizes must be combined, the size may have to be rounded,
1201 and there may be a minimum required size. */
1203 original_args_size = args_size;
1206 /* If this function requires a variable-sized argument list, don't try to
1207 make a cse'able block for this call. We may be able to do this
1208 eventually, but it is too complicated to keep track of what insns go
1209 in the cse'able block and which don't. */
1212 must_preallocate = 1;
1214 args_size.var = ARGS_SIZE_TREE (args_size);
1215 args_size.constant = 0;
1217 #ifdef STACK_BOUNDARY
1218 if (STACK_BOUNDARY != BITS_PER_UNIT)
1219 args_size.var = round_up (args_size.var, STACK_BYTES);
1222 #ifdef REG_PARM_STACK_SPACE
1223 if (reg_parm_stack_space > 0)
1226 = size_binop (MAX_EXPR, args_size.var,
1227 size_int (REG_PARM_STACK_SPACE (fndecl)));
1229 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1230 /* The area corresponding to register parameters is not to count in
1231 the size of the block we need. So make the adjustment. */
1233 = size_binop (MINUS_EXPR, args_size.var,
1234 size_int (reg_parm_stack_space));
1241 #ifdef STACK_BOUNDARY
1242 args_size.constant = (((args_size.constant + (STACK_BYTES - 1))
1243 / STACK_BYTES) * STACK_BYTES);
1246 #ifdef REG_PARM_STACK_SPACE
1247 args_size.constant = MAX (args_size.constant,
1248 reg_parm_stack_space);
1249 #ifdef MAYBE_REG_PARM_STACK_SPACE
1250 if (reg_parm_stack_space == 0)
1251 args_size.constant = 0;
1253 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1254 args_size.constant -= reg_parm_stack_space;
1259 /* See if we have or want to preallocate stack space.
1261 If we would have to push a partially-in-regs parm
1262 before other stack parms, preallocate stack space instead.
1264 If the size of some parm is not a multiple of the required stack
1265 alignment, we must preallocate.
1267 If the total size of arguments that would otherwise create a copy in
1268 a temporary (such as a CALL) is more than half the total argument list
1269 size, preallocation is faster.
1271 Another reason to preallocate is if we have a machine (like the m88k)
1272 where stack alignment is required to be maintained between every
1273 pair of insns, not just when the call is made. However, we assume here
1274 that such machines either do not have push insns (and hence preallocation
1275 would occur anyway) or the problem is taken care of with
1278 if (! must_preallocate)
1280 int partial_seen = 0;
1281 int copy_to_evaluate_size = 0;
1283 for (i = 0; i < num_actuals && ! must_preallocate; i++)
1285 if (args[i].partial > 0 && ! args[i].pass_on_stack)
1287 else if (partial_seen && args[i].reg == 0)
1288 must_preallocate = 1;
1290 if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode
1291 && (TREE_CODE (args[i].tree_value) == CALL_EXPR
1292 || TREE_CODE (args[i].tree_value) == TARGET_EXPR
1293 || TREE_CODE (args[i].tree_value) == COND_EXPR
1294 || TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value))))
1295 copy_to_evaluate_size
1296 += int_size_in_bytes (TREE_TYPE (args[i].tree_value));
1299 if (copy_to_evaluate_size * 2 >= args_size.constant
1300 && args_size.constant > 0)
1301 must_preallocate = 1;
1304 /* If the structure value address will reference the stack pointer, we must
1305 stabilize it. We don't need to do this if we know that we are not going
1306 to adjust the stack pointer in processing this call. */
1308 if (structure_value_addr
1309 && (reg_mentioned_p (virtual_stack_dynamic_rtx, structure_value_addr)
1310 || reg_mentioned_p (virtual_outgoing_args_rtx, structure_value_addr))
1312 #ifndef ACCUMULATE_OUTGOING_ARGS
1313 || args_size.constant
1316 structure_value_addr = copy_to_reg (structure_value_addr);
1318 /* If this function call is cse'able, precompute all the parameters.
1319 Note that if the parameter is constructed into a temporary, this will
1320 cause an additional copy because the parameter will be constructed
1321 into a temporary location and then copied into the outgoing arguments.
1322 If a parameter contains a call to alloca and this function uses the
1323 stack, precompute the parameter. */
1325 /* If we preallocated the stack space, and some arguments must be passed
1326 on the stack, then we must precompute any parameter which contains a
1327 function call which will store arguments on the stack.
1328 Otherwise, evaluating the parameter may clobber previous parameters
1329 which have already been stored into the stack. */
1331 for (i = 0; i < num_actuals; i++)
1333 || ((args_size.var != 0 || args_size.constant != 0)
1334 && calls_function (args[i].tree_value, 1))
1335 || (must_preallocate && (args_size.var != 0 || args_size.constant != 0)
1336 && calls_function (args[i].tree_value, 0)))
1338 /* If this is an addressable type, we cannot pre-evaluate it. */
1339 if (TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value)))
1344 args[i].initial_value = args[i].value
1345 = expand_expr (args[i].tree_value, NULL_RTX, VOIDmode, 0);
1347 preserve_temp_slots (args[i].value);
1350 /* ANSI doesn't require a sequence point here,
1351 but PCC has one, so this will avoid some problems. */
1354 args[i].initial_value = args[i].value
1355 = protect_from_queue (args[i].initial_value, 0);
1357 if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) != args[i].mode)
1359 = convert_modes (args[i].mode,
1360 TYPE_MODE (TREE_TYPE (args[i].tree_value)),
1361 args[i].value, args[i].unsignedp);
1364 /* Now we are about to start emitting insns that can be deleted
1365 if a libcall is deleted. */
1369 /* If we have no actual push instructions, or shouldn't use them,
1370 make space for all args right now. */
1372 if (args_size.var != 0)
1374 if (old_stack_level == 0)
1376 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1377 old_pending_adj = pending_stack_adjust;
1378 pending_stack_adjust = 0;
1379 #ifdef ACCUMULATE_OUTGOING_ARGS
1380 /* stack_arg_under_construction says whether a stack arg is
1381 being constructed at the old stack level. Pushing the stack
1382 gets a clean outgoing argument block. */
1383 old_stack_arg_under_construction = stack_arg_under_construction;
1384 stack_arg_under_construction = 0;
1387 argblock = push_block (ARGS_SIZE_RTX (args_size), 0, 0);
1391 /* Note that we must go through the motions of allocating an argument
1392 block even if the size is zero because we may be storing args
1393 in the area reserved for register arguments, which may be part of
1396 int needed = args_size.constant;
1398 /* Store the maximum argument space used. It will be pushed by
1399 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
1402 if (needed > current_function_outgoing_args_size)
1403 current_function_outgoing_args_size = needed;
1405 if (must_preallocate)
1407 #ifdef ACCUMULATE_OUTGOING_ARGS
1408 /* Since the stack pointer will never be pushed, it is possible for
1409 the evaluation of a parm to clobber something we have already
1410 written to the stack. Since most function calls on RISC machines
1411 do not use the stack, this is uncommon, but must work correctly.
1413 Therefore, we save any area of the stack that was already written
1414 and that we are using. Here we set up to do this by making a new
1415 stack usage map from the old one. The actual save will be done
1418 Another approach might be to try to reorder the argument
1419 evaluations to avoid this conflicting stack usage. */
1421 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1422 /* Since we will be writing into the entire argument area, the
1423 map must be allocated for its entire size, not just the part that
1424 is the responsibility of the caller. */
1425 needed += reg_parm_stack_space;
1428 #ifdef ARGS_GROW_DOWNWARD
1429 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
1432 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
1435 stack_usage_map = (char *) alloca (highest_outgoing_arg_in_use);
1437 if (initial_highest_arg_in_use)
1438 bcopy (initial_stack_usage_map, stack_usage_map,
1439 initial_highest_arg_in_use);
1441 if (initial_highest_arg_in_use != highest_outgoing_arg_in_use)
1442 bzero (&stack_usage_map[initial_highest_arg_in_use],
1443 highest_outgoing_arg_in_use - initial_highest_arg_in_use);
1446 /* The address of the outgoing argument list must not be copied to a
1447 register here, because argblock would be left pointing to the
1448 wrong place after the call to allocate_dynamic_stack_space below.
1451 argblock = virtual_outgoing_args_rtx;
1453 #else /* not ACCUMULATE_OUTGOING_ARGS */
1454 if (inhibit_defer_pop == 0)
1456 /* Try to reuse some or all of the pending_stack_adjust
1457 to get this space. Maybe we can avoid any pushing. */
1458 if (needed > pending_stack_adjust)
1460 needed -= pending_stack_adjust;
1461 pending_stack_adjust = 0;
1465 pending_stack_adjust -= needed;
1469 /* Special case this because overhead of `push_block' in this
1470 case is non-trivial. */
1472 argblock = virtual_outgoing_args_rtx;
1474 argblock = push_block (GEN_INT (needed), 0, 0);
1476 /* We only really need to call `copy_to_reg' in the case where push
1477 insns are going to be used to pass ARGBLOCK to a function
1478 call in ARGS. In that case, the stack pointer changes value
1479 from the allocation point to the call point, and hence
1480 the value of VIRTUAL_OUTGOING_ARGS_RTX changes as well.
1481 But might as well always do it. */
1482 argblock = copy_to_reg (argblock);
1483 #endif /* not ACCUMULATE_OUTGOING_ARGS */
1487 #ifdef ACCUMULATE_OUTGOING_ARGS
1488 /* The save/restore code in store_one_arg handles all cases except one:
1489 a constructor call (including a C function returning a BLKmode struct)
1490 to initialize an argument. */
1491 if (stack_arg_under_construction)
1493 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1494 rtx push_size = GEN_INT (reg_parm_stack_space + args_size.constant);
1496 rtx push_size = GEN_INT (args_size.constant);
1498 if (old_stack_level == 0)
1500 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1501 old_pending_adj = pending_stack_adjust;
1502 pending_stack_adjust = 0;
1503 /* stack_arg_under_construction says whether a stack arg is
1504 being constructed at the old stack level. Pushing the stack
1505 gets a clean outgoing argument block. */
1506 old_stack_arg_under_construction = stack_arg_under_construction;
1507 stack_arg_under_construction = 0;
1508 /* Make a new map for the new argument list. */
1509 stack_usage_map = (char *)alloca (highest_outgoing_arg_in_use);
1510 bzero (stack_usage_map, highest_outgoing_arg_in_use);
1511 highest_outgoing_arg_in_use = 0;
1513 allocate_dynamic_stack_space (push_size, NULL_RTX, BITS_PER_UNIT);
1515 /* If argument evaluation might modify the stack pointer, copy the
1516 address of the argument list to a register. */
1517 for (i = 0; i < num_actuals; i++)
1518 if (args[i].pass_on_stack)
1520 argblock = copy_addr_to_reg (argblock);
1526 /* If we preallocated stack space, compute the address of each argument.
1527 We need not ensure it is a valid memory address here; it will be
1528 validized when it is used. */
1531 rtx arg_reg = argblock;
1534 if (GET_CODE (argblock) == PLUS)
1535 arg_reg = XEXP (argblock, 0), arg_offset = INTVAL (XEXP (argblock, 1));
1537 for (i = 0; i < num_actuals; i++)
1539 rtx offset = ARGS_SIZE_RTX (args[i].offset);
1540 rtx slot_offset = ARGS_SIZE_RTX (args[i].slot_offset);
1543 /* Skip this parm if it will not be passed on the stack. */
1544 if (! args[i].pass_on_stack && args[i].reg != 0)
1547 if (GET_CODE (offset) == CONST_INT)
1548 addr = plus_constant (arg_reg, INTVAL (offset));
1550 addr = gen_rtx (PLUS, Pmode, arg_reg, offset);
1552 addr = plus_constant (addr, arg_offset);
1553 args[i].stack = gen_rtx (MEM, args[i].mode, addr);
1554 MEM_IN_STRUCT_P (args[i].stack)
1555 = AGGREGATE_TYPE_P (TREE_TYPE (args[i].tree_value));
1557 if (GET_CODE (slot_offset) == CONST_INT)
1558 addr = plus_constant (arg_reg, INTVAL (slot_offset));
1560 addr = gen_rtx (PLUS, Pmode, arg_reg, slot_offset);
1562 addr = plus_constant (addr, arg_offset);
1563 args[i].stack_slot = gen_rtx (MEM, args[i].mode, addr);
1567 #ifdef PUSH_ARGS_REVERSED
1568 #ifdef STACK_BOUNDARY
1569 /* If we push args individually in reverse order, perform stack alignment
1570 before the first push (the last arg). */
1572 anti_adjust_stack (GEN_INT (args_size.constant
1573 - original_args_size.constant));
1577 /* Don't try to defer pops if preallocating, not even from the first arg,
1578 since ARGBLOCK probably refers to the SP. */
1582 /* Get the function to call, in the form of RTL. */
1585 /* If this is the first use of the function, see if we need to
1586 make an external definition for it. */
1587 if (! TREE_USED (fndecl))
1589 assemble_external (fndecl);
1590 TREE_USED (fndecl) = 1;
1593 /* Get a SYMBOL_REF rtx for the function address. */
1594 funexp = XEXP (DECL_RTL (fndecl), 0);
1597 /* Generate an rtx (probably a pseudo-register) for the address. */
1600 funexp = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
1601 pop_temp_slots (); /* FUNEXP can't be BLKmode */
1605 /* Figure out the register where the value, if any, will come back. */
1607 if (TYPE_MODE (TREE_TYPE (exp)) != VOIDmode
1608 && ! structure_value_addr)
1610 if (pcc_struct_value)
1611 valreg = hard_function_value (build_pointer_type (TREE_TYPE (exp)),
1614 valreg = hard_function_value (TREE_TYPE (exp), fndecl);
1617 /* Precompute all register parameters. It isn't safe to compute anything
1618 once we have started filling any specific hard regs. */
1620 for (i = 0; i < num_actuals; i++)
1621 if (args[i].reg != 0 && ! args[i].pass_on_stack)
1625 if (args[i].value == 0)
1628 args[i].value = expand_expr (args[i].tree_value, NULL_RTX,
1630 preserve_temp_slots (args[i].value);
1633 /* ANSI doesn't require a sequence point here,
1634 but PCC has one, so this will avoid some problems. */
1638 /* If we are to promote the function arg to a wider mode,
1641 if (args[i].mode != TYPE_MODE (TREE_TYPE (args[i].tree_value)))
1643 = convert_modes (args[i].mode,
1644 TYPE_MODE (TREE_TYPE (args[i].tree_value)),
1645 args[i].value, args[i].unsignedp);
1647 /* If the value is expensive, and we are inside an appropriately
1648 short loop, put the value into a pseudo and then put the pseudo
1651 For small register classes, also do this if this call uses
1652 register parameters. This is to avoid reload conflicts while
1653 loading the parameters registers. */
1655 if ((! (GET_CODE (args[i].value) == REG
1656 || (GET_CODE (args[i].value) == SUBREG
1657 && GET_CODE (SUBREG_REG (args[i].value)) == REG)))
1658 && args[i].mode != BLKmode
1659 && rtx_cost (args[i].value, SET) > 2
1660 #ifdef SMALL_REGISTER_CLASSES
1661 && ((SMALL_REGISTER_CLASSES && reg_parm_seen)
1662 || preserve_subexpressions_p ())
1664 && preserve_subexpressions_p ()
1667 args[i].value = copy_to_mode_reg (args[i].mode, args[i].value);
1670 #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE)
1671 /* The argument list is the property of the called routine and it
1672 may clobber it. If the fixed area has been used for previous
1673 parameters, we must save and restore it.
1675 Here we compute the boundary of the that needs to be saved, if any. */
1677 #ifdef ARGS_GROW_DOWNWARD
1678 for (i = 0; i < reg_parm_stack_space + 1; i++)
1680 for (i = 0; i < reg_parm_stack_space; i++)
1683 if (i >= highest_outgoing_arg_in_use
1684 || stack_usage_map[i] == 0)
1687 if (low_to_save == -1)
1693 if (low_to_save >= 0)
1695 int num_to_save = high_to_save - low_to_save + 1;
1696 enum machine_mode save_mode
1697 = mode_for_size (num_to_save * BITS_PER_UNIT, MODE_INT, 1);
1700 /* If we don't have the required alignment, must do this in BLKmode. */
1701 if ((low_to_save & (MIN (GET_MODE_SIZE (save_mode),
1702 BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1)))
1703 save_mode = BLKmode;
1705 stack_area = gen_rtx (MEM, save_mode,
1706 memory_address (save_mode,
1708 #ifdef ARGS_GROW_DOWNWARD
1709 plus_constant (argblock,
1712 plus_constant (argblock,
1716 if (save_mode == BLKmode)
1718 save_area = assign_stack_temp (BLKmode, num_to_save, 0);
1719 MEM_IN_STRUCT_P (save_area) = 0;
1720 emit_block_move (validize_mem (save_area), stack_area,
1721 GEN_INT (num_to_save),
1722 PARM_BOUNDARY / BITS_PER_UNIT);
1726 save_area = gen_reg_rtx (save_mode);
1727 emit_move_insn (save_area, stack_area);
1733 /* Now store (and compute if necessary) all non-register parms.
1734 These come before register parms, since they can require block-moves,
1735 which could clobber the registers used for register parms.
1736 Parms which have partial registers are not stored here,
1737 but we do preallocate space here if they want that. */
1739 for (i = 0; i < num_actuals; i++)
1740 if (args[i].reg == 0 || args[i].pass_on_stack)
1741 store_one_arg (&args[i], argblock, may_be_alloca,
1742 args_size.var != 0, fndecl, reg_parm_stack_space);
1744 /* If we have a parm that is passed in registers but not in memory
1745 and whose alignment does not permit a direct copy into registers,
1746 make a group of pseudos that correspond to each register that we
1749 if (STRICT_ALIGNMENT)
1750 for (i = 0; i < num_actuals; i++)
1751 if (args[i].reg != 0 && ! args[i].pass_on_stack
1752 && args[i].mode == BLKmode
1753 && (TYPE_ALIGN (TREE_TYPE (args[i].tree_value))
1754 < MIN (BIGGEST_ALIGNMENT, BITS_PER_WORD)))
1756 int bytes = int_size_in_bytes (TREE_TYPE (args[i].tree_value));
1757 int big_endian_correction = 0;
1759 args[i].n_aligned_regs
1760 = args[i].partial ? args[i].partial
1761 : (bytes + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
1763 args[i].aligned_regs = (rtx *) alloca (sizeof (rtx)
1764 * args[i].n_aligned_regs);
1766 /* Structures smaller than a word are aligned to the least
1767 significant byte (to the right). On a BYTES_BIG_ENDIAN machine,
1768 this means we must skip the empty high order bytes when
1769 calculating the bit offset. */
1770 if (BYTES_BIG_ENDIAN && bytes < UNITS_PER_WORD)
1771 big_endian_correction = (BITS_PER_WORD - (bytes * BITS_PER_UNIT));
1773 for (j = 0; j < args[i].n_aligned_regs; j++)
1775 rtx reg = gen_reg_rtx (word_mode);
1776 rtx word = operand_subword_force (args[i].value, j, BLKmode);
1777 int bitsize = TYPE_ALIGN (TREE_TYPE (args[i].tree_value));
1780 args[i].aligned_regs[j] = reg;
1782 /* Clobber REG and move each partword into it. Ensure we don't
1783 go past the end of the structure. Note that the loop below
1784 works because we've already verified that padding
1785 and endianness are compatible.
1787 We use to emit a clobber here but that doesn't let later
1788 passes optimize the instructions we emit. By storing 0 into
1789 the register later passes know the first AND to zero out the
1790 bitfield being set in the register is unnecessary. The store
1791 of 0 will be deleted as will at least the first AND. */
1793 emit_move_insn (reg, const0_rtx);
1796 bitpos < BITS_PER_WORD && bytes > 0;
1797 bitpos += bitsize, bytes -= bitsize / BITS_PER_UNIT)
1799 int xbitpos = bitpos + big_endian_correction;
1801 store_bit_field (reg, bitsize, xbitpos, word_mode,
1802 extract_bit_field (word, bitsize, bitpos, 1,
1803 NULL_RTX, word_mode,
1805 bitsize / BITS_PER_UNIT,
1807 bitsize / BITS_PER_UNIT, BITS_PER_WORD);
1812 /* Now store any partially-in-registers parm.
1813 This is the last place a block-move can happen. */
1815 for (i = 0; i < num_actuals; i++)
1816 if (args[i].partial != 0 && ! args[i].pass_on_stack)
1817 store_one_arg (&args[i], argblock, may_be_alloca,
1818 args_size.var != 0, fndecl, reg_parm_stack_space);
1820 #ifndef PUSH_ARGS_REVERSED
1821 #ifdef STACK_BOUNDARY
1822 /* If we pushed args in forward order, perform stack alignment
1823 after pushing the last arg. */
1825 anti_adjust_stack (GEN_INT (args_size.constant
1826 - original_args_size.constant));
1830 /* If register arguments require space on the stack and stack space
1831 was not preallocated, allocate stack space here for arguments
1832 passed in registers. */
1833 #if ! defined(ACCUMULATE_OUTGOING_ARGS) && defined(OUTGOING_REG_PARM_STACK_SPACE)
1834 if (must_preallocate == 0 && reg_parm_stack_space > 0)
1835 anti_adjust_stack (GEN_INT (reg_parm_stack_space));
1838 /* Pass the function the address in which to return a structure value. */
1839 if (structure_value_addr && ! structure_value_addr_parm)
1841 emit_move_insn (struct_value_rtx,
1843 force_operand (structure_value_addr,
1845 if (GET_CODE (struct_value_rtx) == REG)
1846 use_reg (&call_fusage, struct_value_rtx);
1849 funexp = prepare_call_address (funexp, fndecl, &call_fusage, reg_parm_seen);
1851 /* Now do the register loads required for any wholly-register parms or any
1852 parms which are passed both on the stack and in a register. Their
1853 expressions were already evaluated.
1855 Mark all register-parms as living through the call, putting these USE
1856 insns in the CALL_INSN_FUNCTION_USAGE field. */
1858 for (i = 0; i < num_actuals; i++)
1860 rtx reg = args[i].reg;
1861 int partial = args[i].partial;
1866 /* Set to non-negative if must move a word at a time, even if just
1867 one word (e.g, partial == 1 && mode == DFmode). Set to -1 if
1868 we just use a normal move insn. This value can be zero if the
1869 argument is a zero size structure with no fields. */
1870 nregs = (partial ? partial
1871 : (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode
1872 ? ((int_size_in_bytes (TREE_TYPE (args[i].tree_value))
1873 + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD)
1876 /* Handle calls that pass values in multiple non-contiguous
1877 locations. The Irix 6 ABI has examples of this. */
1879 if (GET_CODE (reg) == PARALLEL)
1880 emit_group_load (reg, args[i].value);
1882 /* If simple case, just do move. If normal partial, store_one_arg
1883 has already loaded the register for us. In all other cases,
1884 load the register(s) from memory. */
1886 else if (nregs == -1)
1887 emit_move_insn (reg, args[i].value);
1889 /* If we have pre-computed the values to put in the registers in
1890 the case of non-aligned structures, copy them in now. */
1892 else if (args[i].n_aligned_regs != 0)
1893 for (j = 0; j < args[i].n_aligned_regs; j++)
1894 emit_move_insn (gen_rtx (REG, word_mode, REGNO (reg) + j),
1895 args[i].aligned_regs[j]);
1897 else if (partial == 0 || args[i].pass_on_stack)
1898 move_block_to_reg (REGNO (reg),
1899 validize_mem (args[i].value), nregs,
1902 /* Handle calls that pass values in multiple non-contiguous
1903 locations. The Irix 6 ABI has examples of this. */
1904 if (GET_CODE (reg) == PARALLEL)
1905 use_group_regs (&call_fusage, reg);
1906 else if (nregs == -1)
1907 use_reg (&call_fusage, reg);
1909 use_regs (&call_fusage, REGNO (reg), nregs == 0 ? 1 : nregs);
1913 /* Perform postincrements before actually calling the function. */
1916 /* All arguments and registers used for the call must be set up by now! */
1918 /* Generate the actual call instruction. */
1919 emit_call_1 (funexp, fndecl, funtype, args_size.constant, struct_value_size,
1920 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1),
1921 valreg, old_inhibit_defer_pop, call_fusage, is_const);
1923 /* If call is cse'able, make appropriate pair of reg-notes around it.
1924 Test valreg so we don't crash; may safely ignore `const'
1925 if return type is void. Disable for PARALLEL return values, because
1926 we have no way to move such values into a pseudo register. */
1927 if (is_const && valreg != 0 && GET_CODE (valreg) != PARALLEL)
1930 rtx temp = gen_reg_rtx (GET_MODE (valreg));
1933 /* Construct an "equal form" for the value which mentions all the
1934 arguments in order as well as the function name. */
1935 #ifdef PUSH_ARGS_REVERSED
1936 for (i = 0; i < num_actuals; i++)
1937 note = gen_rtx (EXPR_LIST, VOIDmode, args[i].initial_value, note);
1939 for (i = num_actuals - 1; i >= 0; i--)
1940 note = gen_rtx (EXPR_LIST, VOIDmode, args[i].initial_value, note);
1942 note = gen_rtx (EXPR_LIST, VOIDmode, funexp, note);
1944 insns = get_insns ();
1947 emit_libcall_block (insns, temp, valreg, note);
1953 /* Otherwise, just write out the sequence without a note. */
1954 rtx insns = get_insns ();
1960 /* For calls to `setjmp', etc., inform flow.c it should complain
1961 if nonvolatile values are live. */
1965 emit_note (name, NOTE_INSN_SETJMP);
1966 current_function_calls_setjmp = 1;
1970 current_function_calls_longjmp = 1;
1972 /* Notice functions that cannot return.
1973 If optimizing, insns emitted below will be dead.
1974 If not optimizing, they will exist, which is useful
1975 if the user uses the `return' command in the debugger. */
1977 if (is_volatile || is_longjmp)
1980 /* If value type not void, return an rtx for the value. */
1982 /* If there are cleanups to be called, don't use a hard reg as target. */
1983 if (cleanups_this_call != old_cleanups
1984 && target && REG_P (target)
1985 && REGNO (target) < FIRST_PSEUDO_REGISTER)
1988 if (TYPE_MODE (TREE_TYPE (exp)) == VOIDmode
1991 target = const0_rtx;
1993 else if (structure_value_addr)
1995 if (target == 0 || GET_CODE (target) != MEM)
1997 target = gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)),
1998 memory_address (TYPE_MODE (TREE_TYPE (exp)),
1999 structure_value_addr));
2000 MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp));
2003 else if (pcc_struct_value)
2007 /* We used leave the value in the location that it is
2008 returned in, but that causes problems if it is used more
2009 than once in one expression. Rather than trying to track
2010 when a copy is required, we always copy when TARGET is
2011 not specified. This calling sequence is only used on
2012 a few machines and TARGET is usually nonzero. */
2013 if (TYPE_MODE (TREE_TYPE (exp)) == BLKmode)
2015 target = assign_stack_temp (BLKmode,
2016 int_size_in_bytes (TREE_TYPE (exp)),
2019 MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp));
2021 /* Save this temp slot around the pop below. */
2022 preserve_temp_slots (target);
2025 target = gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp)));
2028 if (TYPE_MODE (TREE_TYPE (exp)) != BLKmode)
2029 emit_move_insn (target, gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)),
2030 copy_to_reg (valreg)));
2032 emit_block_move (target, gen_rtx (MEM, BLKmode, copy_to_reg (valreg)),
2034 TYPE_ALIGN (TREE_TYPE (exp)) / BITS_PER_UNIT);
2036 /* Handle calls that return values in multiple non-contiguous locations.
2037 The Irix 6 ABI has examples of this. */
2038 else if (GET_CODE (valreg) == PARALLEL)
2042 int bytes = int_size_in_bytes (TREE_TYPE (exp));
2043 target = assign_stack_temp (TYPE_MODE (TREE_TYPE (exp)), bytes, 0);
2044 MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp));
2045 preserve_temp_slots (target);
2048 emit_group_store (target, valreg);
2050 else if (target && GET_MODE (target) == TYPE_MODE (TREE_TYPE (exp))
2051 && GET_MODE (target) == GET_MODE (valreg))
2052 /* TARGET and VALREG cannot be equal at this point because the latter
2053 would not have REG_FUNCTION_VALUE_P true, while the former would if
2054 it were referring to the same register.
2056 If they refer to the same register, this move will be a no-op, except
2057 when function inlining is being done. */
2058 emit_move_insn (target, valreg);
2059 else if (TYPE_MODE (TREE_TYPE (exp)) == BLKmode)
2061 /* Some machines (the PA for example) want to return all small
2062 structures in registers regardless of the structure's alignment.
2064 Deal with them explicitly by copying from the return registers
2065 into the target MEM locations. */
2066 int bytes = int_size_in_bytes (TREE_TYPE (exp));
2067 int n_regs = (bytes + UNITS_PER_WORD - 1) / UNITS_PER_WORD;
2069 enum machine_mode tmpmode;
2071 int bitsize = MIN (TYPE_ALIGN (TREE_TYPE (exp)), BITS_PER_WORD);
2072 int bitpos, xbitpos, big_endian_correction = 0;
2076 target = assign_stack_temp (BLKmode, bytes, 0);
2077 MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp));
2078 preserve_temp_slots (target);
2081 /* This code assumes valreg is at least a full word. If it isn't,
2082 copy it into a new pseudo which is a full word. */
2083 if (GET_MODE (valreg) != BLKmode
2084 && GET_MODE_SIZE (GET_MODE (valreg)) < UNITS_PER_WORD)
2085 valreg = convert_to_mode (word_mode, valreg,
2086 TREE_UNSIGNED (TREE_TYPE (exp)));
2088 /* Structures whose size is not a multiple of a word are aligned
2089 to the least significant byte (to the right). On a BYTES_BIG_ENDIAN
2090 machine, this means we must skip the empty high order bytes when
2091 calculating the bit offset. */
2092 if (BYTES_BIG_ENDIAN && bytes % UNITS_PER_WORD)
2093 big_endian_correction = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD)
2096 /* Copy the structure BITSIZE bites at a time.
2098 We could probably emit more efficient code for machines
2099 which do not use strict alignment, but it doesn't seem
2100 worth the effort at the current time. */
2101 for (bitpos = 0, xbitpos = big_endian_correction;
2102 bitpos < bytes * BITS_PER_UNIT;
2103 bitpos += bitsize, xbitpos += bitsize)
2106 /* We need a new source operand each time xbitpos is on a
2107 word boundary and when xbitpos == big_endian_correction
2108 (the first time through). */
2109 if (xbitpos % BITS_PER_WORD == 0
2110 || xbitpos == big_endian_correction)
2111 src = operand_subword_force (valreg,
2112 xbitpos / BITS_PER_WORD,
2115 /* We need a new destination operand each time bitpos is on
2117 if (bitpos % BITS_PER_WORD == 0)
2118 dst = operand_subword (target, bitpos / BITS_PER_WORD, 1, BLKmode);
2120 /* Use xbitpos for the source extraction (right justified) and
2121 xbitpos for the destination store (left justified). */
2122 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, word_mode,
2123 extract_bit_field (src, bitsize,
2124 xbitpos % BITS_PER_WORD, 1,
2125 NULL_RTX, word_mode,
2127 bitsize / BITS_PER_UNIT,
2129 bitsize / BITS_PER_UNIT, BITS_PER_WORD);
2133 target = copy_to_reg (valreg);
2135 #ifdef PROMOTE_FUNCTION_RETURN
2136 /* If we promoted this return value, make the proper SUBREG. TARGET
2137 might be const0_rtx here, so be careful. */
2138 if (GET_CODE (target) == REG
2139 && TYPE_MODE (TREE_TYPE (exp)) != BLKmode
2140 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
2142 tree type = TREE_TYPE (exp);
2143 int unsignedp = TREE_UNSIGNED (type);
2145 /* If we don't promote as expected, something is wrong. */
2146 if (GET_MODE (target)
2147 != promote_mode (type, TYPE_MODE (type), &unsignedp, 1))
2150 target = gen_rtx (SUBREG, TYPE_MODE (type), target, 0);
2151 SUBREG_PROMOTED_VAR_P (target) = 1;
2152 SUBREG_PROMOTED_UNSIGNED_P (target) = unsignedp;
2156 if (flag_short_temps)
2158 /* Perform all cleanups needed for the arguments of this call
2159 (i.e. destructors in C++). */
2160 expand_cleanups_to (old_cleanups);
2163 /* If size of args is variable or this was a constructor call for a stack
2164 argument, restore saved stack-pointer value. */
2166 if (old_stack_level)
2168 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
2169 pending_stack_adjust = old_pending_adj;
2170 #ifdef ACCUMULATE_OUTGOING_ARGS
2171 stack_arg_under_construction = old_stack_arg_under_construction;
2172 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
2173 stack_usage_map = initial_stack_usage_map;
2176 #ifdef ACCUMULATE_OUTGOING_ARGS
2179 #ifdef REG_PARM_STACK_SPACE
2182 enum machine_mode save_mode = GET_MODE (save_area);
2184 = gen_rtx (MEM, save_mode,
2185 memory_address (save_mode,
2186 #ifdef ARGS_GROW_DOWNWARD
2187 plus_constant (argblock, - high_to_save)
2189 plus_constant (argblock, low_to_save)
2193 if (save_mode != BLKmode)
2194 emit_move_insn (stack_area, save_area);
2196 emit_block_move (stack_area, validize_mem (save_area),
2197 GEN_INT (high_to_save - low_to_save + 1),
2198 PARM_BOUNDARY / BITS_PER_UNIT);
2202 /* If we saved any argument areas, restore them. */
2203 for (i = 0; i < num_actuals; i++)
2204 if (args[i].save_area)
2206 enum machine_mode save_mode = GET_MODE (args[i].save_area);
2208 = gen_rtx (MEM, save_mode,
2209 memory_address (save_mode,
2210 XEXP (args[i].stack_slot, 0)));
2212 if (save_mode != BLKmode)
2213 emit_move_insn (stack_area, args[i].save_area);
2215 emit_block_move (stack_area, validize_mem (args[i].save_area),
2216 GEN_INT (args[i].size.constant),
2217 PARM_BOUNDARY / BITS_PER_UNIT);
2220 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
2221 stack_usage_map = initial_stack_usage_map;
2225 /* If this was alloca, record the new stack level for nonlocal gotos.
2226 Check for the handler slots since we might not have a save area
2227 for non-local gotos. */
2229 if (may_be_alloca && nonlocal_goto_handler_slot != 0)
2230 emit_stack_save (SAVE_NONLOCAL, &nonlocal_goto_stack_level, NULL_RTX);
2237 /* Output a library call to function FUN (a SYMBOL_REF rtx)
2238 (emitting the queue unless NO_QUEUE is nonzero),
2239 for a value of mode OUTMODE,
2240 with NARGS different arguments, passed as alternating rtx values
2241 and machine_modes to convert them to.
2242 The rtx values should have been passed through protect_from_queue already.
2244 NO_QUEUE will be true if and only if the library call is a `const' call
2245 which will be enclosed in REG_LIBCALL/REG_RETVAL notes; it is equivalent
2246 to the variable is_const in expand_call.
2248 NO_QUEUE must be true for const calls, because if it isn't, then
2249 any pending increment will be emitted between REG_LIBCALL/REG_RETVAL notes,
2250 and will be lost if the libcall sequence is optimized away.
2252 NO_QUEUE must be false for non-const calls, because if it isn't, the
2253 call insn will have its CONST_CALL_P bit set, and it will be incorrectly
2254 optimized. For instance, the instruction scheduler may incorrectly
2255 move memory references across the non-const call. */
2258 emit_library_call VPROTO((rtx orgfun, int no_queue, enum machine_mode outmode,
2264 enum machine_mode outmode;
2268 /* Total size in bytes of all the stack-parms scanned so far. */
2269 struct args_size args_size;
2270 /* Size of arguments before any adjustments (such as rounding). */
2271 struct args_size original_args_size;
2272 register int argnum;
2277 CUMULATIVE_ARGS args_so_far;
2278 struct arg { rtx value; enum machine_mode mode; rtx reg; int partial;
2279 struct args_size offset; struct args_size size; };
2281 int old_inhibit_defer_pop = inhibit_defer_pop;
2282 rtx call_fusage = 0;
2284 VA_START (p, nargs);
2287 orgfun = va_arg (p, rtx);
2288 no_queue = va_arg (p, int);
2289 outmode = va_arg (p, enum machine_mode);
2290 nargs = va_arg (p, int);
2295 /* Copy all the libcall-arguments out of the varargs data
2296 and into a vector ARGVEC.
2298 Compute how to pass each argument. We only support a very small subset
2299 of the full argument passing conventions to limit complexity here since
2300 library functions shouldn't have many args. */
2302 argvec = (struct arg *) alloca (nargs * sizeof (struct arg));
2304 INIT_CUMULATIVE_ARGS (args_so_far, NULL_TREE, fun, 0);
2306 args_size.constant = 0;
2311 for (count = 0; count < nargs; count++)
2313 rtx val = va_arg (p, rtx);
2314 enum machine_mode mode = va_arg (p, enum machine_mode);
2316 /* We cannot convert the arg value to the mode the library wants here;
2317 must do it earlier where we know the signedness of the arg. */
2319 || (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode))
2322 /* On some machines, there's no way to pass a float to a library fcn.
2323 Pass it as a double instead. */
2324 #ifdef LIBGCC_NEEDS_DOUBLE
2325 if (LIBGCC_NEEDS_DOUBLE && mode == SFmode)
2326 val = convert_modes (DFmode, SFmode, val, 0), mode = DFmode;
2329 /* There's no need to call protect_from_queue, because
2330 either emit_move_insn or emit_push_insn will do that. */
2332 /* Make sure it is a reasonable operand for a move or push insn. */
2333 if (GET_CODE (val) != REG && GET_CODE (val) != MEM
2334 && ! (CONSTANT_P (val) && LEGITIMATE_CONSTANT_P (val)))
2335 val = force_operand (val, NULL_RTX);
2337 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
2338 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, mode, NULL_TREE, 1))
2340 /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can
2341 be viewed as just an efficiency improvement. */
2342 rtx slot = assign_stack_temp (mode, GET_MODE_SIZE (mode), 0);
2343 emit_move_insn (slot, val);
2344 val = force_operand (XEXP (slot, 0), NULL_RTX);
2349 argvec[count].value = val;
2350 argvec[count].mode = mode;
2352 argvec[count].reg = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
2353 if (argvec[count].reg && GET_CODE (argvec[count].reg) == PARALLEL)
2355 #ifdef FUNCTION_ARG_PARTIAL_NREGS
2356 argvec[count].partial
2357 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, NULL_TREE, 1);
2359 argvec[count].partial = 0;
2362 locate_and_pad_parm (mode, NULL_TREE,
2363 argvec[count].reg && argvec[count].partial == 0,
2364 NULL_TREE, &args_size, &argvec[count].offset,
2365 &argvec[count].size);
2367 if (argvec[count].size.var)
2370 #ifndef REG_PARM_STACK_SPACE
2371 if (argvec[count].partial)
2372 argvec[count].size.constant -= argvec[count].partial * UNITS_PER_WORD;
2375 if (argvec[count].reg == 0 || argvec[count].partial != 0
2376 #ifdef REG_PARM_STACK_SPACE
2380 args_size.constant += argvec[count].size.constant;
2382 #ifdef ACCUMULATE_OUTGOING_ARGS
2383 /* If this arg is actually passed on the stack, it might be
2384 clobbering something we already put there (this library call might
2385 be inside the evaluation of an argument to a function whose call
2386 requires the stack). This will only occur when the library call
2387 has sufficient args to run out of argument registers. Abort in
2388 this case; if this ever occurs, code must be added to save and
2389 restore the arg slot. */
2391 if (argvec[count].reg == 0 || argvec[count].partial != 0)
2395 FUNCTION_ARG_ADVANCE (args_so_far, mode, (tree) 0, 1);
2399 /* If this machine requires an external definition for library
2400 functions, write one out. */
2401 assemble_external_libcall (fun);
2403 original_args_size = args_size;
2404 #ifdef STACK_BOUNDARY
2405 args_size.constant = (((args_size.constant + (STACK_BYTES - 1))
2406 / STACK_BYTES) * STACK_BYTES);
2409 #ifdef REG_PARM_STACK_SPACE
2410 args_size.constant = MAX (args_size.constant,
2411 REG_PARM_STACK_SPACE (NULL_TREE));
2412 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2413 args_size.constant -= REG_PARM_STACK_SPACE (NULL_TREE);
2417 if (args_size.constant > current_function_outgoing_args_size)
2418 current_function_outgoing_args_size = args_size.constant;
2420 #ifdef ACCUMULATE_OUTGOING_ARGS
2421 args_size.constant = 0;
2424 #ifndef PUSH_ROUNDING
2425 argblock = push_block (GEN_INT (args_size.constant), 0, 0);
2428 #ifdef PUSH_ARGS_REVERSED
2429 #ifdef STACK_BOUNDARY
2430 /* If we push args individually in reverse order, perform stack alignment
2431 before the first push (the last arg). */
2433 anti_adjust_stack (GEN_INT (args_size.constant
2434 - original_args_size.constant));
2438 #ifdef PUSH_ARGS_REVERSED
2446 /* Push the args that need to be pushed. */
2448 for (count = 0; count < nargs; count++, argnum += inc)
2450 register enum machine_mode mode = argvec[argnum].mode;
2451 register rtx val = argvec[argnum].value;
2452 rtx reg = argvec[argnum].reg;
2453 int partial = argvec[argnum].partial;
2455 if (! (reg != 0 && partial == 0))
2456 emit_push_insn (val, mode, NULL_TREE, NULL_RTX, 0, partial, reg, 0,
2457 argblock, GEN_INT (argvec[count].offset.constant));
2461 #ifndef PUSH_ARGS_REVERSED
2462 #ifdef STACK_BOUNDARY
2463 /* If we pushed args in forward order, perform stack alignment
2464 after pushing the last arg. */
2466 anti_adjust_stack (GEN_INT (args_size.constant
2467 - original_args_size.constant));
2471 #ifdef PUSH_ARGS_REVERSED
2477 fun = prepare_call_address (fun, NULL_TREE, &call_fusage, 0);
2479 /* Now load any reg parms into their regs. */
2481 for (count = 0; count < nargs; count++, argnum += inc)
2483 register enum machine_mode mode = argvec[argnum].mode;
2484 register rtx val = argvec[argnum].value;
2485 rtx reg = argvec[argnum].reg;
2486 int partial = argvec[argnum].partial;
2488 if (reg != 0 && partial == 0)
2489 emit_move_insn (reg, val);
2493 /* For version 1.37, try deleting this entirely. */
2497 /* Any regs containing parms remain in use through the call. */
2498 for (count = 0; count < nargs; count++)
2499 if (argvec[count].reg != 0)
2500 use_reg (&call_fusage, argvec[count].reg);
2502 /* Don't allow popping to be deferred, since then
2503 cse'ing of library calls could delete a call and leave the pop. */
2506 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
2507 will set inhibit_defer_pop to that value. */
2509 /* The return type is needed to decide how many bytes the function pops.
2510 Signedness plays no role in that, so for simplicity, we pretend it's
2511 always signed. We also assume that the list of arguments passed has
2512 no impact, so we pretend it is unknown. */
2515 get_identifier (XSTR (orgfun, 0)),
2516 build_function_type (outmode == VOIDmode ? void_type_node
2517 : type_for_mode (outmode, 0), NULL_TREE),
2518 args_size.constant, 0,
2519 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1),
2520 outmode != VOIDmode ? hard_libcall_value (outmode) : NULL_RTX,
2521 old_inhibit_defer_pop + 1, call_fusage, no_queue);
2525 /* Now restore inhibit_defer_pop to its actual original value. */
2529 /* Like emit_library_call except that an extra argument, VALUE,
2530 comes second and says where to store the result.
2531 (If VALUE is zero, this function chooses a convenient way
2532 to return the value.
2534 This function returns an rtx for where the value is to be found.
2535 If VALUE is nonzero, VALUE is returned. */
2538 emit_library_call_value VPROTO((rtx orgfun, rtx value, int no_queue,
2539 enum machine_mode outmode, int nargs, ...))
2545 enum machine_mode outmode;
2549 /* Total size in bytes of all the stack-parms scanned so far. */
2550 struct args_size args_size;
2551 /* Size of arguments before any adjustments (such as rounding). */
2552 struct args_size original_args_size;
2553 register int argnum;
2558 CUMULATIVE_ARGS args_so_far;
2559 struct arg { rtx value; enum machine_mode mode; rtx reg; int partial;
2560 struct args_size offset; struct args_size size; };
2562 int old_inhibit_defer_pop = inhibit_defer_pop;
2563 rtx call_fusage = 0;
2565 int pcc_struct_value = 0;
2566 int struct_value_size = 0;
2569 VA_START (p, nargs);
2572 orgfun = va_arg (p, rtx);
2573 value = va_arg (p, rtx);
2574 no_queue = va_arg (p, int);
2575 outmode = va_arg (p, enum machine_mode);
2576 nargs = va_arg (p, int);
2579 is_const = no_queue;
2582 /* If this kind of value comes back in memory,
2583 decide where in memory it should come back. */
2584 if (aggregate_value_p (type_for_mode (outmode, 0)))
2586 #ifdef PCC_STATIC_STRUCT_RETURN
2588 = hard_function_value (build_pointer_type (type_for_mode (outmode, 0)),
2590 mem_value = gen_rtx (MEM, outmode, pointer_reg);
2591 pcc_struct_value = 1;
2593 value = gen_reg_rtx (outmode);
2594 #else /* not PCC_STATIC_STRUCT_RETURN */
2595 struct_value_size = GET_MODE_SIZE (outmode);
2596 if (value != 0 && GET_CODE (value) == MEM)
2599 mem_value = assign_stack_temp (outmode, GET_MODE_SIZE (outmode), 0);
2602 /* This call returns a big structure. */
2606 /* ??? Unfinished: must pass the memory address as an argument. */
2608 /* Copy all the libcall-arguments out of the varargs data
2609 and into a vector ARGVEC.
2611 Compute how to pass each argument. We only support a very small subset
2612 of the full argument passing conventions to limit complexity here since
2613 library functions shouldn't have many args. */
2615 argvec = (struct arg *) alloca ((nargs + 1) * sizeof (struct arg));
2617 INIT_CUMULATIVE_ARGS (args_so_far, NULL_TREE, fun, 0);
2619 args_size.constant = 0;
2626 /* If there's a structure value address to be passed,
2627 either pass it in the special place, or pass it as an extra argument. */
2628 if (mem_value && struct_value_rtx == 0 && ! pcc_struct_value)
2630 rtx addr = XEXP (mem_value, 0);
2633 /* Make sure it is a reasonable operand for a move or push insn. */
2634 if (GET_CODE (addr) != REG && GET_CODE (addr) != MEM
2635 && ! (CONSTANT_P (addr) && LEGITIMATE_CONSTANT_P (addr)))
2636 addr = force_operand (addr, NULL_RTX);
2638 argvec[count].value = addr;
2639 argvec[count].mode = Pmode;
2640 argvec[count].partial = 0;
2642 argvec[count].reg = FUNCTION_ARG (args_so_far, Pmode, NULL_TREE, 1);
2643 #ifdef FUNCTION_ARG_PARTIAL_NREGS
2644 if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far, Pmode, NULL_TREE, 1))
2648 locate_and_pad_parm (Pmode, NULL_TREE,
2649 argvec[count].reg && argvec[count].partial == 0,
2650 NULL_TREE, &args_size, &argvec[count].offset,
2651 &argvec[count].size);
2654 if (argvec[count].reg == 0 || argvec[count].partial != 0
2655 #ifdef REG_PARM_STACK_SPACE
2659 args_size.constant += argvec[count].size.constant;
2661 FUNCTION_ARG_ADVANCE (args_so_far, Pmode, (tree) 0, 1);
2666 for (; count < nargs; count++)
2668 rtx val = va_arg (p, rtx);
2669 enum machine_mode mode = va_arg (p, enum machine_mode);
2671 /* We cannot convert the arg value to the mode the library wants here;
2672 must do it earlier where we know the signedness of the arg. */
2674 || (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode))
2677 /* On some machines, there's no way to pass a float to a library fcn.
2678 Pass it as a double instead. */
2679 #ifdef LIBGCC_NEEDS_DOUBLE
2680 if (LIBGCC_NEEDS_DOUBLE && mode == SFmode)
2681 val = convert_modes (DFmode, SFmode, val, 0), mode = DFmode;
2684 /* There's no need to call protect_from_queue, because
2685 either emit_move_insn or emit_push_insn will do that. */
2687 /* Make sure it is a reasonable operand for a move or push insn. */
2688 if (GET_CODE (val) != REG && GET_CODE (val) != MEM
2689 && ! (CONSTANT_P (val) && LEGITIMATE_CONSTANT_P (val)))
2690 val = force_operand (val, NULL_RTX);
2692 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
2693 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, mode, NULL_TREE, 1))
2695 /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can
2696 be viewed as just an efficiency improvement. */
2697 rtx slot = assign_stack_temp (mode, GET_MODE_SIZE (mode), 0);
2698 emit_move_insn (slot, val);
2699 val = XEXP (slot, 0);
2704 argvec[count].value = val;
2705 argvec[count].mode = mode;
2707 argvec[count].reg = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
2708 if (argvec[count].reg && GET_CODE (argvec[count].reg) == PARALLEL)
2710 #ifdef FUNCTION_ARG_PARTIAL_NREGS
2711 argvec[count].partial
2712 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, NULL_TREE, 1);
2714 argvec[count].partial = 0;
2717 locate_and_pad_parm (mode, NULL_TREE,
2718 argvec[count].reg && argvec[count].partial == 0,
2719 NULL_TREE, &args_size, &argvec[count].offset,
2720 &argvec[count].size);
2722 if (argvec[count].size.var)
2725 #ifndef REG_PARM_STACK_SPACE
2726 if (argvec[count].partial)
2727 argvec[count].size.constant -= argvec[count].partial * UNITS_PER_WORD;
2730 if (argvec[count].reg == 0 || argvec[count].partial != 0
2731 #ifdef REG_PARM_STACK_SPACE
2735 args_size.constant += argvec[count].size.constant;
2737 #ifdef ACCUMULATE_OUTGOING_ARGS
2738 /* If this arg is actually passed on the stack, it might be
2739 clobbering something we already put there (this library call might
2740 be inside the evaluation of an argument to a function whose call
2741 requires the stack). This will only occur when the library call
2742 has sufficient args to run out of argument registers. Abort in
2743 this case; if this ever occurs, code must be added to save and
2744 restore the arg slot. */
2746 if (argvec[count].reg == 0 || argvec[count].partial != 0)
2750 FUNCTION_ARG_ADVANCE (args_so_far, mode, (tree) 0, 1);
2754 /* If this machine requires an external definition for library
2755 functions, write one out. */
2756 assemble_external_libcall (fun);
2758 original_args_size = args_size;
2759 #ifdef STACK_BOUNDARY
2760 args_size.constant = (((args_size.constant + (STACK_BYTES - 1))
2761 / STACK_BYTES) * STACK_BYTES);
2764 #ifdef REG_PARM_STACK_SPACE
2765 args_size.constant = MAX (args_size.constant,
2766 REG_PARM_STACK_SPACE (NULL_TREE));
2767 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2768 args_size.constant -= REG_PARM_STACK_SPACE (NULL_TREE);
2772 if (args_size.constant > current_function_outgoing_args_size)
2773 current_function_outgoing_args_size = args_size.constant;
2775 #ifdef ACCUMULATE_OUTGOING_ARGS
2776 args_size.constant = 0;
2779 #ifndef PUSH_ROUNDING
2780 argblock = push_block (GEN_INT (args_size.constant), 0, 0);
2783 #ifdef PUSH_ARGS_REVERSED
2784 #ifdef STACK_BOUNDARY
2785 /* If we push args individually in reverse order, perform stack alignment
2786 before the first push (the last arg). */
2788 anti_adjust_stack (GEN_INT (args_size.constant
2789 - original_args_size.constant));
2793 #ifdef PUSH_ARGS_REVERSED
2801 /* Push the args that need to be pushed. */
2803 for (count = 0; count < nargs; count++, argnum += inc)
2805 register enum machine_mode mode = argvec[argnum].mode;
2806 register rtx val = argvec[argnum].value;
2807 rtx reg = argvec[argnum].reg;
2808 int partial = argvec[argnum].partial;
2810 if (! (reg != 0 && partial == 0))
2811 emit_push_insn (val, mode, NULL_TREE, NULL_RTX, 0, partial, reg, 0,
2812 argblock, GEN_INT (argvec[count].offset.constant));
2816 #ifndef PUSH_ARGS_REVERSED
2817 #ifdef STACK_BOUNDARY
2818 /* If we pushed args in forward order, perform stack alignment
2819 after pushing the last arg. */
2821 anti_adjust_stack (GEN_INT (args_size.constant
2822 - original_args_size.constant));
2826 #ifdef PUSH_ARGS_REVERSED
2832 fun = prepare_call_address (fun, NULL_TREE, &call_fusage, 0);
2834 /* Now load any reg parms into their regs. */
2836 for (count = 0; count < nargs; count++, argnum += inc)
2838 register enum machine_mode mode = argvec[argnum].mode;
2839 register rtx val = argvec[argnum].value;
2840 rtx reg = argvec[argnum].reg;
2841 int partial = argvec[argnum].partial;
2843 if (reg != 0 && partial == 0)
2844 emit_move_insn (reg, val);
2849 /* For version 1.37, try deleting this entirely. */
2854 /* Any regs containing parms remain in use through the call. */
2855 for (count = 0; count < nargs; count++)
2856 if (argvec[count].reg != 0)
2857 use_reg (&call_fusage, argvec[count].reg);
2859 /* Pass the function the address in which to return a structure value. */
2860 if (mem_value != 0 && struct_value_rtx != 0 && ! pcc_struct_value)
2862 emit_move_insn (struct_value_rtx,
2864 force_operand (XEXP (mem_value, 0),
2866 if (GET_CODE (struct_value_rtx) == REG)
2867 use_reg (&call_fusage, struct_value_rtx);
2870 /* Don't allow popping to be deferred, since then
2871 cse'ing of library calls could delete a call and leave the pop. */
2874 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
2875 will set inhibit_defer_pop to that value. */
2876 /* See the comment in emit_library_call about the function type we build
2880 get_identifier (XSTR (orgfun, 0)),
2881 build_function_type (type_for_mode (outmode, 0), NULL_TREE),
2882 args_size.constant, struct_value_size,
2883 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1),
2884 mem_value == 0 ? hard_libcall_value (outmode) : NULL_RTX,
2885 old_inhibit_defer_pop + 1, call_fusage, is_const);
2887 /* Now restore inhibit_defer_pop to its actual original value. */
2892 /* Copy the value to the right place. */
2893 if (outmode != VOIDmode)
2899 if (value != mem_value)
2900 emit_move_insn (value, mem_value);
2902 else if (value != 0)
2903 emit_move_insn (value, hard_libcall_value (outmode));
2905 value = hard_libcall_value (outmode);
2912 /* Return an rtx which represents a suitable home on the stack
2913 given TYPE, the type of the argument looking for a home.
2914 This is called only for BLKmode arguments.
2916 SIZE is the size needed for this target.
2917 ARGS_ADDR is the address of the bottom of the argument block for this call.
2918 OFFSET describes this parameter's offset into ARGS_ADDR. It is meaningless
2919 if this machine uses push insns. */
2922 target_for_arg (type, size, args_addr, offset)
2926 struct args_size offset;
2929 rtx offset_rtx = ARGS_SIZE_RTX (offset);
2931 /* We do not call memory_address if possible,
2932 because we want to address as close to the stack
2933 as possible. For non-variable sized arguments,
2934 this will be stack-pointer relative addressing. */
2935 if (GET_CODE (offset_rtx) == CONST_INT)
2936 target = plus_constant (args_addr, INTVAL (offset_rtx));
2939 /* I have no idea how to guarantee that this
2940 will work in the presence of register parameters. */
2941 target = gen_rtx (PLUS, Pmode, args_addr, offset_rtx);
2942 target = memory_address (QImode, target);
2945 return gen_rtx (MEM, BLKmode, target);
2949 /* Store a single argument for a function call
2950 into the register or memory area where it must be passed.
2951 *ARG describes the argument value and where to pass it.
2953 ARGBLOCK is the address of the stack-block for all the arguments,
2954 or 0 on a machine where arguments are pushed individually.
2956 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
2957 so must be careful about how the stack is used.
2959 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
2960 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
2961 that we need not worry about saving and restoring the stack.
2963 FNDECL is the declaration of the function we are calling. */
2966 store_one_arg (arg, argblock, may_be_alloca, variable_size, fndecl,
2967 reg_parm_stack_space)
2968 struct arg_data *arg;
2973 int reg_parm_stack_space;
2975 register tree pval = arg->tree_value;
2979 int i, lower_bound, upper_bound;
2981 if (TREE_CODE (pval) == ERROR_MARK)
2984 /* Push a new temporary level for any temporaries we make for
2988 #ifdef ACCUMULATE_OUTGOING_ARGS
2989 /* If this is being stored into a pre-allocated, fixed-size, stack area,
2990 save any previous data at that location. */
2991 if (argblock && ! variable_size && arg->stack)
2993 #ifdef ARGS_GROW_DOWNWARD
2994 /* stack_slot is negative, but we want to index stack_usage_map
2995 with positive values. */
2996 if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS)
2997 upper_bound = -INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1)) + 1;
3001 lower_bound = upper_bound - arg->size.constant;
3003 if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS)
3004 lower_bound = INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1));
3008 upper_bound = lower_bound + arg->size.constant;
3011 for (i = lower_bound; i < upper_bound; i++)
3012 if (stack_usage_map[i]
3013 #ifdef REG_PARM_STACK_SPACE
3014 /* Don't store things in the fixed argument area at this point;
3015 it has already been saved. */
3016 && i > reg_parm_stack_space
3021 if (i != upper_bound)
3023 /* We need to make a save area. See what mode we can make it. */
3024 enum machine_mode save_mode
3025 = mode_for_size (arg->size.constant * BITS_PER_UNIT, MODE_INT, 1);
3027 = gen_rtx (MEM, save_mode,
3028 memory_address (save_mode, XEXP (arg->stack_slot, 0)));
3030 if (save_mode == BLKmode)
3032 arg->save_area = assign_stack_temp (BLKmode,
3033 arg->size.constant, 0);
3034 MEM_IN_STRUCT_P (arg->save_area)
3035 = AGGREGATE_TYPE_P (TREE_TYPE (arg->tree_value));
3036 preserve_temp_slots (arg->save_area);
3037 emit_block_move (validize_mem (arg->save_area), stack_area,
3038 GEN_INT (arg->size.constant),
3039 PARM_BOUNDARY / BITS_PER_UNIT);
3043 arg->save_area = gen_reg_rtx (save_mode);
3044 emit_move_insn (arg->save_area, stack_area);
3050 /* If this isn't going to be placed on both the stack and in registers,
3051 set up the register and number of words. */
3052 if (! arg->pass_on_stack)
3053 reg = arg->reg, partial = arg->partial;
3055 if (reg != 0 && partial == 0)
3056 /* Being passed entirely in a register. We shouldn't be called in
3060 /* If this arg needs special alignment, don't load the registers
3062 if (arg->n_aligned_regs != 0)
3065 /* If this is being passed partially in a register, we can't evaluate
3066 it directly into its stack slot. Otherwise, we can. */
3067 if (arg->value == 0)
3069 #ifdef ACCUMULATE_OUTGOING_ARGS
3070 /* stack_arg_under_construction is nonzero if a function argument is
3071 being evaluated directly into the outgoing argument list and
3072 expand_call must take special action to preserve the argument list
3073 if it is called recursively.
3075 For scalar function arguments stack_usage_map is sufficient to
3076 determine which stack slots must be saved and restored. Scalar
3077 arguments in general have pass_on_stack == 0.
3079 If this argument is initialized by a function which takes the
3080 address of the argument (a C++ constructor or a C function
3081 returning a BLKmode structure), then stack_usage_map is
3082 insufficient and expand_call must push the stack around the
3083 function call. Such arguments have pass_on_stack == 1.
3085 Note that it is always safe to set stack_arg_under_construction,
3086 but this generates suboptimal code if set when not needed. */
3088 if (arg->pass_on_stack)
3089 stack_arg_under_construction++;
3091 arg->value = expand_expr (pval,
3093 || TYPE_MODE (TREE_TYPE (pval)) != arg->mode)
3094 ? NULL_RTX : arg->stack,
3097 /* If we are promoting object (or for any other reason) the mode
3098 doesn't agree, convert the mode. */
3100 if (arg->mode != TYPE_MODE (TREE_TYPE (pval)))
3101 arg->value = convert_modes (arg->mode, TYPE_MODE (TREE_TYPE (pval)),
3102 arg->value, arg->unsignedp);
3104 #ifdef ACCUMULATE_OUTGOING_ARGS
3105 if (arg->pass_on_stack)
3106 stack_arg_under_construction--;
3110 /* Don't allow anything left on stack from computation
3111 of argument to alloca. */
3113 do_pending_stack_adjust ();
3115 if (arg->value == arg->stack)
3116 /* If the value is already in the stack slot, we are done. */
3118 else if (arg->mode != BLKmode)
3122 /* Argument is a scalar, not entirely passed in registers.
3123 (If part is passed in registers, arg->partial says how much
3124 and emit_push_insn will take care of putting it there.)
3126 Push it, and if its size is less than the
3127 amount of space allocated to it,
3128 also bump stack pointer by the additional space.
3129 Note that in C the default argument promotions
3130 will prevent such mismatches. */
3132 size = GET_MODE_SIZE (arg->mode);
3133 /* Compute how much space the push instruction will push.
3134 On many machines, pushing a byte will advance the stack
3135 pointer by a halfword. */
3136 #ifdef PUSH_ROUNDING
3137 size = PUSH_ROUNDING (size);
3141 /* Compute how much space the argument should get:
3142 round up to a multiple of the alignment for arguments. */
3143 if (none != FUNCTION_ARG_PADDING (arg->mode, TREE_TYPE (pval)))
3144 used = (((size + PARM_BOUNDARY / BITS_PER_UNIT - 1)
3145 / (PARM_BOUNDARY / BITS_PER_UNIT))
3146 * (PARM_BOUNDARY / BITS_PER_UNIT));
3148 /* This isn't already where we want it on the stack, so put it there.
3149 This can either be done with push or copy insns. */
3150 emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), NULL_RTX,
3151 0, partial, reg, used - size,
3152 argblock, ARGS_SIZE_RTX (arg->offset));
3156 /* BLKmode, at least partly to be pushed. */
3158 register int excess;
3161 /* Pushing a nonscalar.
3162 If part is passed in registers, PARTIAL says how much
3163 and emit_push_insn will take care of putting it there. */
3165 /* Round its size up to a multiple
3166 of the allocation unit for arguments. */
3168 if (arg->size.var != 0)
3171 size_rtx = ARGS_SIZE_RTX (arg->size);
3175 /* PUSH_ROUNDING has no effect on us, because
3176 emit_push_insn for BLKmode is careful to avoid it. */
3177 excess = (arg->size.constant - int_size_in_bytes (TREE_TYPE (pval))
3178 + partial * UNITS_PER_WORD);
3179 size_rtx = expr_size (pval);
3182 emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), size_rtx,
3183 TYPE_ALIGN (TREE_TYPE (pval)) / BITS_PER_UNIT, partial,
3184 reg, excess, argblock, ARGS_SIZE_RTX (arg->offset));
3188 /* Unless this is a partially-in-register argument, the argument is now
3191 ??? Note that this can change arg->value from arg->stack to
3192 arg->stack_slot and it matters when they are not the same.
3193 It isn't totally clear that this is correct in all cases. */
3195 arg->value = arg->stack_slot;
3197 /* Once we have pushed something, pops can't safely
3198 be deferred during the rest of the arguments. */
3201 /* ANSI doesn't require a sequence point here,
3202 but PCC has one, so this will avoid some problems. */
3205 /* Free any temporary slots made in processing this argument. Show
3206 that we might have taken the address of something and pushed that
3208 preserve_temp_slots (NULL_RTX);
3212 #ifdef ACCUMULATE_OUTGOING_ARGS
3213 /* Now mark the segment we just used. */
3214 if (argblock && ! variable_size && arg->stack)
3215 for (i = lower_bound; i < upper_bound; i++)
3216 stack_usage_map[i] = 1;