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. */
33 #include "insn-flags.h"
35 /* Decide whether a function's arguments should be processed
36 from first to last or from last to first.
38 They should if the stack and args grow in opposite directions, but
39 only if we have push insns. */
43 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
44 #define PUSH_ARGS_REVERSED /* If it's last to first */
49 /* Like STACK_BOUNDARY but in units of bytes, not bits. */
50 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
52 /* Data structure and subroutines used within expand_call. */
56 /* Tree node for this argument. */
58 /* Mode for value; TYPE_MODE unless promoted. */
59 enum machine_mode mode;
60 /* Current RTL value for argument, or 0 if it isn't precomputed. */
62 /* Initially-compute RTL value for argument; only for const functions. */
64 /* Register to pass this argument in, 0 if passed on stack, or an
65 PARALLEL if the arg is to be copied into multiple non-contiguous
68 /* If REG was promoted from the actual mode of the argument expression,
69 indicates whether the promotion is sign- or zero-extended. */
71 /* Number of registers to use. 0 means put the whole arg in registers.
72 Also 0 if not passed in registers. */
74 /* Non-zero if argument must be passed on stack.
75 Note that some arguments may be passed on the stack
76 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
77 pass_on_stack identifies arguments that *cannot* go in registers. */
79 /* Offset of this argument from beginning of stack-args. */
80 struct args_size offset;
81 /* Similar, but offset to the start of the stack slot. Different from
82 OFFSET if this arg pads downward. */
83 struct args_size slot_offset;
84 /* Size of this argument on the stack, rounded up for any padding it gets,
85 parts of the argument passed in registers do not count.
86 If REG_PARM_STACK_SPACE is defined, then register parms
87 are counted here as well. */
88 struct args_size size;
89 /* Location on the stack at which parameter should be stored. The store
90 has already been done if STACK == VALUE. */
92 /* Location on the stack of the start of this argument slot. This can
93 differ from STACK if this arg pads downward. This location is known
94 to be aligned to FUNCTION_ARG_BOUNDARY. */
96 #ifdef ACCUMULATE_OUTGOING_ARGS
97 /* Place that this stack area has been saved, if needed. */
100 /* If an argument's alignment does not permit direct copying into registers,
101 copy in smaller-sized pieces into pseudos. These are stored in a
102 block pointed to by this field. The next field says how many
103 word-sized pseudos we made. */
108 #ifdef ACCUMULATE_OUTGOING_ARGS
109 /* A vector of one char per byte of stack space. A byte if non-zero if
110 the corresponding stack location has been used.
111 This vector is used to prevent a function call within an argument from
112 clobbering any stack already set up. */
113 static char *stack_usage_map;
115 /* Size of STACK_USAGE_MAP. */
116 static int highest_outgoing_arg_in_use;
118 /* stack_arg_under_construction is nonzero when an argument may be
119 initialized with a constructor call (including a C function that
120 returns a BLKmode struct) and expand_call must take special action
121 to make sure the object being constructed does not overlap the
122 argument list for the constructor call. */
123 int stack_arg_under_construction;
126 static int calls_function PROTO((tree, int));
127 static int calls_function_1 PROTO((tree, int));
128 static void emit_call_1 PROTO((rtx, tree, tree, int, int, rtx, rtx,
130 static void store_one_arg PROTO ((struct arg_data *, rtx, int, int,
133 /* If WHICH is 1, return 1 if EXP contains a call to the built-in function
136 If WHICH is 0, return 1 if EXP contains a call to any function.
137 Actually, we only need return 1 if evaluating EXP would require pushing
138 arguments on the stack, but that is too difficult to compute, so we just
139 assume any function call might require the stack. */
141 static tree calls_function_save_exprs;
144 calls_function (exp, which)
149 calls_function_save_exprs = 0;
150 val = calls_function_1 (exp, which);
151 calls_function_save_exprs = 0;
156 calls_function_1 (exp, which)
161 enum tree_code code = TREE_CODE (exp);
162 int type = TREE_CODE_CLASS (code);
163 int length = tree_code_length[(int) code];
165 /* If this code is language-specific, we don't know what it will do. */
166 if ((int) code >= NUM_TREE_CODES)
169 /* Only expressions and references can contain calls. */
170 if (type != 'e' && type != '<' && type != '1' && type != '2' && type != 'r'
179 else if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR
180 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp, 0), 0))
183 tree fndecl = TREE_OPERAND (TREE_OPERAND (exp, 0), 0);
185 if ((DECL_BUILT_IN (fndecl)
186 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_ALLOCA)
187 || (DECL_SAVED_INSNS (fndecl)
188 && (FUNCTION_FLAGS (DECL_SAVED_INSNS (fndecl))
189 & FUNCTION_FLAGS_CALLS_ALLOCA)))
193 /* Third operand is RTL. */
198 if (SAVE_EXPR_RTL (exp) != 0)
200 if (value_member (exp, calls_function_save_exprs))
202 calls_function_save_exprs = tree_cons (NULL_TREE, exp,
203 calls_function_save_exprs);
204 return (TREE_OPERAND (exp, 0) != 0
205 && calls_function_1 (TREE_OPERAND (exp, 0), which));
211 for (local = BLOCK_VARS (exp); local; local = TREE_CHAIN (local))
212 if (DECL_INITIAL (local) != 0
213 && calls_function_1 (DECL_INITIAL (local), which))
217 register tree subblock;
219 for (subblock = BLOCK_SUBBLOCKS (exp);
221 subblock = TREE_CHAIN (subblock))
222 if (calls_function_1 (subblock, which))
227 case METHOD_CALL_EXPR:
231 case WITH_CLEANUP_EXPR:
242 for (i = 0; i < length; i++)
243 if (TREE_OPERAND (exp, i) != 0
244 && calls_function_1 (TREE_OPERAND (exp, i), which))
250 /* Force FUNEXP into a form suitable for the address of a CALL,
251 and return that as an rtx. Also load the static chain register
252 if FNDECL is a nested function.
254 CALL_FUSAGE points to a variable holding the prospective
255 CALL_INSN_FUNCTION_USAGE information. */
258 prepare_call_address (funexp, fndecl, call_fusage, reg_parm_seen)
264 rtx static_chain_value = 0;
266 funexp = protect_from_queue (funexp, 0);
269 /* Get possible static chain value for nested function in C. */
270 static_chain_value = lookup_static_chain (fndecl);
272 /* Make a valid memory address and copy constants thru pseudo-regs,
273 but not for a constant address if -fno-function-cse. */
274 if (GET_CODE (funexp) != SYMBOL_REF)
275 /* If we are using registers for parameters, force the
276 function address into a register now. */
277 funexp = ((SMALL_REGISTER_CLASSES && reg_parm_seen)
278 ? force_not_mem (memory_address (FUNCTION_MODE, funexp))
279 : memory_address (FUNCTION_MODE, funexp));
282 #ifndef NO_FUNCTION_CSE
283 if (optimize && ! flag_no_function_cse)
284 #ifdef NO_RECURSIVE_FUNCTION_CSE
285 if (fndecl != current_function_decl)
287 funexp = force_reg (Pmode, funexp);
291 if (static_chain_value != 0)
293 emit_move_insn (static_chain_rtx, static_chain_value);
295 if (GET_CODE (static_chain_rtx) == REG)
296 use_reg (call_fusage, static_chain_rtx);
302 /* Generate instructions to call function FUNEXP,
303 and optionally pop the results.
304 The CALL_INSN is the first insn generated.
306 FNDECL is the declaration node of the function. This is given to the
307 macro RETURN_POPS_ARGS to determine whether this function pops its own args.
309 FUNTYPE is the data type of the function. This is given to the macro
310 RETURN_POPS_ARGS to determine whether this function pops its own args.
311 We used to allow an identifier for library functions, but that doesn't
312 work when the return type is an aggregate type and the calling convention
313 says that the pointer to this aggregate is to be popped by the callee.
315 STACK_SIZE is the number of bytes of arguments on the stack,
316 rounded up to STACK_BOUNDARY; zero if the size is variable.
317 This is both to put into the call insn and
318 to generate explicit popping code if necessary.
320 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
321 It is zero if this call doesn't want a structure value.
323 NEXT_ARG_REG is the rtx that results from executing
324 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1)
325 just after all the args have had their registers assigned.
326 This could be whatever you like, but normally it is the first
327 arg-register beyond those used for args in this call,
328 or 0 if all the arg-registers are used in this call.
329 It is passed on to `gen_call' so you can put this info in the call insn.
331 VALREG is a hard register in which a value is returned,
332 or 0 if the call does not return a value.
334 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
335 the args to this call were processed.
336 We restore `inhibit_defer_pop' to that value.
338 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
339 denote registers used by the called function.
341 IS_CONST is true if this is a `const' call. */
344 emit_call_1 (funexp, fndecl, funtype, stack_size, struct_value_size,
345 next_arg_reg, valreg, old_inhibit_defer_pop, call_fusage,
351 int struct_value_size;
354 int old_inhibit_defer_pop;
358 rtx stack_size_rtx = GEN_INT (stack_size);
359 rtx struct_value_size_rtx = GEN_INT (struct_value_size);
361 int already_popped = 0;
363 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
364 and we don't want to load it into a register as an optimization,
365 because prepare_call_address already did it if it should be done. */
366 if (GET_CODE (funexp) != SYMBOL_REF)
367 funexp = memory_address (FUNCTION_MODE, funexp);
369 #ifndef ACCUMULATE_OUTGOING_ARGS
370 #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop)
371 if (HAVE_call_pop && HAVE_call_value_pop
372 && (RETURN_POPS_ARGS (fndecl, funtype, stack_size) > 0
375 rtx n_pop = GEN_INT (RETURN_POPS_ARGS (fndecl, funtype, stack_size));
378 /* If this subroutine pops its own args, record that in the call insn
379 if possible, for the sake of frame pointer elimination. */
382 pat = gen_call_value_pop (valreg,
383 gen_rtx (MEM, FUNCTION_MODE, funexp),
384 stack_size_rtx, next_arg_reg, n_pop);
386 pat = gen_call_pop (gen_rtx (MEM, FUNCTION_MODE, funexp),
387 stack_size_rtx, next_arg_reg, n_pop);
389 emit_call_insn (pat);
396 #if defined (HAVE_call) && defined (HAVE_call_value)
397 if (HAVE_call && HAVE_call_value)
400 emit_call_insn (gen_call_value (valreg,
401 gen_rtx (MEM, FUNCTION_MODE, funexp),
402 stack_size_rtx, next_arg_reg,
405 emit_call_insn (gen_call (gen_rtx (MEM, FUNCTION_MODE, funexp),
406 stack_size_rtx, next_arg_reg,
407 struct_value_size_rtx));
413 /* Find the CALL insn we just emitted. */
414 for (call_insn = get_last_insn ();
415 call_insn && GET_CODE (call_insn) != CALL_INSN;
416 call_insn = PREV_INSN (call_insn))
422 /* Put the register usage information on the CALL. If there is already
423 some usage information, put ours at the end. */
424 if (CALL_INSN_FUNCTION_USAGE (call_insn))
428 for (link = CALL_INSN_FUNCTION_USAGE (call_insn); XEXP (link, 1) != 0;
429 link = XEXP (link, 1))
432 XEXP (link, 1) = call_fusage;
435 CALL_INSN_FUNCTION_USAGE (call_insn) = call_fusage;
437 /* If this is a const call, then set the insn's unchanging bit. */
439 CONST_CALL_P (call_insn) = 1;
441 /* Restore this now, so that we do defer pops for this call's args
442 if the context of the call as a whole permits. */
443 inhibit_defer_pop = old_inhibit_defer_pop;
445 #ifndef ACCUMULATE_OUTGOING_ARGS
446 /* If returning from the subroutine does not automatically pop the args,
447 we need an instruction to pop them sooner or later.
448 Perhaps do it now; perhaps just record how much space to pop later.
450 If returning from the subroutine does pop the args, indicate that the
451 stack pointer will be changed. */
453 if (stack_size != 0 && RETURN_POPS_ARGS (fndecl, funtype, stack_size) > 0)
456 CALL_INSN_FUNCTION_USAGE (call_insn)
457 = gen_rtx (EXPR_LIST, VOIDmode,
458 gen_rtx (CLOBBER, VOIDmode, stack_pointer_rtx),
459 CALL_INSN_FUNCTION_USAGE (call_insn));
460 stack_size -= RETURN_POPS_ARGS (fndecl, funtype, stack_size);
461 stack_size_rtx = GEN_INT (stack_size);
466 if (flag_defer_pop && inhibit_defer_pop == 0 && !is_const)
467 pending_stack_adjust += stack_size;
469 adjust_stack (stack_size_rtx);
474 /* Generate all the code for a function call
475 and return an rtx for its value.
476 Store the value in TARGET (specified as an rtx) if convenient.
477 If the value is stored in TARGET then TARGET is returned.
478 If IGNORE is nonzero, then we ignore the value of the function call. */
481 expand_call (exp, target, ignore)
486 /* List of actual parameters. */
487 tree actparms = TREE_OPERAND (exp, 1);
488 /* RTX for the function to be called. */
490 /* Tree node for the function to be called (not the address!). */
492 /* Data type of the function. */
494 /* Declaration of the function being called,
495 or 0 if the function is computed (not known by name). */
499 /* Register in which non-BLKmode value will be returned,
500 or 0 if no value or if value is BLKmode. */
502 /* Address where we should return a BLKmode value;
503 0 if value not BLKmode. */
504 rtx structure_value_addr = 0;
505 /* Nonzero if that address is being passed by treating it as
506 an extra, implicit first parameter. Otherwise,
507 it is passed by being copied directly into struct_value_rtx. */
508 int structure_value_addr_parm = 0;
509 /* Size of aggregate value wanted, or zero if none wanted
510 or if we are using the non-reentrant PCC calling convention
511 or expecting the value in registers. */
512 int struct_value_size = 0;
513 /* Nonzero if called function returns an aggregate in memory PCC style,
514 by returning the address of where to find it. */
515 int pcc_struct_value = 0;
517 /* Number of actual parameters in this call, including struct value addr. */
519 /* Number of named args. Args after this are anonymous ones
520 and they must all go on the stack. */
522 /* Count arg position in order args appear. */
525 /* Vector of information about each argument.
526 Arguments are numbered in the order they will be pushed,
527 not the order they are written. */
528 struct arg_data *args;
530 /* Total size in bytes of all the stack-parms scanned so far. */
531 struct args_size args_size;
532 /* Size of arguments before any adjustments (such as rounding). */
533 struct args_size original_args_size;
534 /* Data on reg parms scanned so far. */
535 CUMULATIVE_ARGS args_so_far;
536 /* Nonzero if a reg parm has been scanned. */
538 /* Nonzero if this is an indirect function call. */
540 /* Nonzero if we must avoid push-insns in the args for this call.
541 If stack space is allocated for register parameters, but not by the
542 caller, then it is preallocated in the fixed part of the stack frame.
543 So the entire argument block must then be preallocated (i.e., we
544 ignore PUSH_ROUNDING in that case). */
546 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
547 int must_preallocate = 1;
550 int must_preallocate = 0;
552 int must_preallocate = 1;
556 /* Size of the stack reserved for parameter registers. */
557 int reg_parm_stack_space = 0;
559 /* 1 if scanning parms front to back, -1 if scanning back to front. */
561 /* Address of space preallocated for stack parms
562 (on machines that lack push insns), or 0 if space not preallocated. */
565 /* Nonzero if it is plausible that this is a call to alloca. */
567 /* Nonzero if this is a call to malloc or a related function. */
569 /* Nonzero if this is a call to setjmp or a related function. */
571 /* Nonzero if this is a call to `longjmp'. */
573 /* Nonzero if this is a call to an inline function. */
574 int is_integrable = 0;
575 /* Nonzero if this is a call to a `const' function.
576 Note that only explicitly named functions are handled as `const' here. */
578 /* Nonzero if this is a call to a `volatile' function. */
580 #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE)
581 /* Define the boundary of the register parm stack space that needs to be
583 int low_to_save = -1, high_to_save;
584 rtx save_area = 0; /* Place that it is saved */
587 #ifdef ACCUMULATE_OUTGOING_ARGS
588 int initial_highest_arg_in_use = highest_outgoing_arg_in_use;
589 char *initial_stack_usage_map = stack_usage_map;
592 rtx old_stack_level = 0;
593 int old_pending_adj = 0;
594 int old_stack_arg_under_construction;
595 int old_inhibit_defer_pop = inhibit_defer_pop;
600 /* The value of the function call can be put in a hard register. But
601 if -fcheck-memory-usage, code which invokes functions (and thus
602 damages some hard registers) can be inserted before using the value.
603 So, target is always a pseudo-register in that case. */
604 if (flag_check_memory_usage)
607 /* See if we can find a DECL-node for the actual function.
608 As a result, decide whether this is a call to an integrable function. */
610 p = TREE_OPERAND (exp, 0);
611 if (TREE_CODE (p) == ADDR_EXPR)
613 fndecl = TREE_OPERAND (p, 0);
614 if (TREE_CODE (fndecl) != FUNCTION_DECL)
619 && fndecl != current_function_decl
620 && DECL_INLINE (fndecl)
621 && DECL_SAVED_INSNS (fndecl)
622 && RTX_INTEGRATED_P (DECL_SAVED_INSNS (fndecl)))
624 else if (! TREE_ADDRESSABLE (fndecl))
626 /* In case this function later becomes inlinable,
627 record that there was already a non-inline call to it.
629 Use abstraction instead of setting TREE_ADDRESSABLE
631 if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline
634 warning_with_decl (fndecl, "can't inline call to `%s'");
635 warning ("called from here");
637 mark_addressable (fndecl);
640 if (TREE_READONLY (fndecl) && ! TREE_THIS_VOLATILE (fndecl)
641 && TYPE_MODE (TREE_TYPE (exp)) != VOIDmode)
644 if (TREE_THIS_VOLATILE (fndecl))
649 /* If we don't have specific function to call, see if we have a
650 constant or `noreturn' function from the type. */
653 is_const = TREE_READONLY (TREE_TYPE (TREE_TYPE (p)));
654 is_volatile = TREE_THIS_VOLATILE (TREE_TYPE (TREE_TYPE (p)));
657 #ifdef REG_PARM_STACK_SPACE
658 #ifdef MAYBE_REG_PARM_STACK_SPACE
659 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
661 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
665 /* Warn if this value is an aggregate type,
666 regardless of which calling convention we are using for it. */
667 if (warn_aggregate_return && AGGREGATE_TYPE_P (TREE_TYPE (exp)))
668 warning ("function call has aggregate value");
670 /* Set up a place to return a structure. */
672 /* Cater to broken compilers. */
673 if (aggregate_value_p (exp))
675 /* This call returns a big structure. */
678 #ifdef PCC_STATIC_STRUCT_RETURN
680 pcc_struct_value = 1;
681 /* Easier than making that case work right. */
684 /* In case this is a static function, note that it has been
686 if (! TREE_ADDRESSABLE (fndecl))
687 mark_addressable (fndecl);
691 #else /* not PCC_STATIC_STRUCT_RETURN */
693 struct_value_size = int_size_in_bytes (TREE_TYPE (exp));
695 if (target && GET_CODE (target) == MEM)
696 structure_value_addr = XEXP (target, 0);
699 /* Assign a temporary to hold the value. */
702 /* For variable-sized objects, we must be called with a target
703 specified. If we were to allocate space on the stack here,
704 we would have no way of knowing when to free it. */
706 if (struct_value_size < 0)
709 /* This DECL is just something to feed to mark_addressable;
710 it doesn't get pushed. */
711 d = build_decl (VAR_DECL, NULL_TREE, TREE_TYPE (exp));
712 DECL_RTL (d) = assign_temp (TREE_TYPE (exp), 1, 0, 1);
713 mark_addressable (d);
714 structure_value_addr = XEXP (DECL_RTL (d), 0);
715 MEM_IN_STRUCT_P (structure_value_addr)
716 = AGGREGATE_TYPE_P (TREE_TYPE (exp));
720 #endif /* not PCC_STATIC_STRUCT_RETURN */
723 /* If called function is inline, try to integrate it. */
728 rtx before_call = get_last_insn ();
730 temp = expand_inline_function (fndecl, actparms, target,
731 ignore, TREE_TYPE (exp),
732 structure_value_addr);
734 /* If inlining succeeded, return. */
735 if ((HOST_WIDE_INT) temp != -1)
737 #ifdef ACCUMULATE_OUTGOING_ARGS
738 /* If the outgoing argument list must be preserved, push
739 the stack before executing the inlined function if it
742 for (i = reg_parm_stack_space - 1; i >= 0; i--)
743 if (i < highest_outgoing_arg_in_use && stack_usage_map[i] != 0)
746 if (stack_arg_under_construction || i >= 0)
749 = before_call ? NEXT_INSN (before_call) : get_insns ();
752 /* Look for a call in the inline function code.
753 If OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl)) is
754 nonzero then there is a call and it is not necessary
755 to scan the insns. */
757 if (OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl)) == 0)
758 for (insn = first_insn; insn; insn = NEXT_INSN (insn))
759 if (GET_CODE (insn) == CALL_INSN)
764 /* Reserve enough stack space so that the largest
765 argument list of any function call in the inline
766 function does not overlap the argument list being
767 evaluated. This is usually an overestimate because
768 allocate_dynamic_stack_space reserves space for an
769 outgoing argument list in addition to the requested
770 space, but there is no way to ask for stack space such
771 that an argument list of a certain length can be
772 safely constructed. */
774 int adjust = OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl));
775 #ifdef REG_PARM_STACK_SPACE
776 /* Add the stack space reserved for register arguments
777 in the inline function. What is really needed is the
778 largest value of reg_parm_stack_space in the inline
779 function, but that is not available. Using the current
780 value of reg_parm_stack_space is wrong, but gives
781 correct results on all supported machines. */
782 adjust += reg_parm_stack_space;
785 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
786 allocate_dynamic_stack_space (GEN_INT (adjust),
787 NULL_RTX, BITS_PER_UNIT);
790 emit_insns_before (seq, first_insn);
791 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
796 /* If the result is equivalent to TARGET, return TARGET to simplify
797 checks in store_expr. They can be equivalent but not equal in the
798 case of a function that returns BLKmode. */
799 if (temp != target && rtx_equal_p (temp, target))
804 /* If inlining failed, mark FNDECL as needing to be compiled
805 separately after all. If function was declared inline,
807 if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline
808 && optimize > 0 && ! TREE_ADDRESSABLE (fndecl))
810 warning_with_decl (fndecl, "inlining failed in call to `%s'");
811 warning ("called from here");
813 mark_addressable (fndecl);
816 /* When calling a const function, we must pop the stack args right away,
817 so that the pop is deleted or moved with the call. */
821 function_call_count++;
823 if (fndecl && DECL_NAME (fndecl))
824 name = IDENTIFIER_POINTER (DECL_NAME (fndecl));
827 /* Unless it's a call to a specific function that isn't alloca,
828 if it has one argument, we must assume it might be alloca. */
831 = (!(fndecl != 0 && strcmp (name, "alloca"))
833 && TREE_CHAIN (actparms) == 0);
835 /* We assume that alloca will always be called by name. It
836 makes no sense to pass it as a pointer-to-function to
837 anything that does not understand its behavior. */
839 = (name && ((IDENTIFIER_LENGTH (DECL_NAME (fndecl)) == 6
841 && ! strcmp (name, "alloca"))
842 || (IDENTIFIER_LENGTH (DECL_NAME (fndecl)) == 16
844 && ! strcmp (name, "__builtin_alloca"))));
847 /* See if this is a call to a function that can return more than once
848 or a call to longjmp. */
854 if (name != 0 && IDENTIFIER_LENGTH (DECL_NAME (fndecl)) <= 15)
858 /* Disregard prefix _, __ or __x. */
861 if (name[1] == '_' && name[2] == 'x')
863 else if (name[1] == '_')
873 && (! strcmp (tname, "setjmp")
874 || ! strcmp (tname, "setjmp_syscall")))
876 && ! strcmp (tname, "sigsetjmp"))
878 && ! strcmp (tname, "savectx")));
880 && ! strcmp (tname, "siglongjmp"))
883 else if ((tname[0] == 'q' && tname[1] == 's'
884 && ! strcmp (tname, "qsetjmp"))
885 || (tname[0] == 'v' && tname[1] == 'f'
886 && ! strcmp (tname, "vfork")))
889 else if (tname[0] == 'l' && tname[1] == 'o'
890 && ! strcmp (tname, "longjmp"))
892 /* Only recognize malloc when alias analysis is enabled. */
893 else if (flag_alias_check
894 && ((tname[0] == 'm' && ! strcmp(tname + 1, "alloc"))
895 || (tname[0] == 'c' && ! strcmp(tname + 1, "alloc"))
896 || (tname[0] == 'r' && ! strcmp(tname + 1, "ealloc"))))
901 current_function_calls_alloca = 1;
903 /* Don't let pending stack adjusts add up to too much.
904 Also, do all pending adjustments now
905 if there is any chance this might be a call to alloca. */
907 if (pending_stack_adjust >= 32
908 || (pending_stack_adjust > 0 && may_be_alloca))
909 do_pending_stack_adjust ();
911 /* Operand 0 is a pointer-to-function; get the type of the function. */
912 funtype = TREE_TYPE (TREE_OPERAND (exp, 0));
913 if (TREE_CODE (funtype) != POINTER_TYPE)
915 funtype = TREE_TYPE (funtype);
917 /* Push the temporary stack slot level so that we can free any temporaries
921 /* Start updating where the next arg would go.
923 On some machines (such as the PA) indirect calls have a different
924 calling convention than normal calls. The last argument in
925 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
927 INIT_CUMULATIVE_ARGS (args_so_far, funtype, NULL_RTX, (fndecl == 0));
929 /* If struct_value_rtx is 0, it means pass the address
930 as if it were an extra parameter. */
931 if (structure_value_addr && struct_value_rtx == 0)
933 /* If structure_value_addr is a REG other than
934 virtual_outgoing_args_rtx, we can use always use it. If it
935 is not a REG, we must always copy it into a register.
936 If it is virtual_outgoing_args_rtx, we must copy it to another
937 register in some cases. */
938 rtx temp = (GET_CODE (structure_value_addr) != REG
939 #ifdef ACCUMULATE_OUTGOING_ARGS
940 || (stack_arg_under_construction
941 && structure_value_addr == virtual_outgoing_args_rtx)
943 ? copy_addr_to_reg (structure_value_addr)
944 : structure_value_addr);
947 = tree_cons (error_mark_node,
948 make_tree (build_pointer_type (TREE_TYPE (funtype)),
951 structure_value_addr_parm = 1;
954 /* Count the arguments and set NUM_ACTUALS. */
955 for (p = actparms, i = 0; p; p = TREE_CHAIN (p)) i++;
958 /* Compute number of named args.
959 Normally, don't include the last named arg if anonymous args follow.
960 We do include the last named arg if STRICT_ARGUMENT_NAMING is defined.
961 (If no anonymous args follow, the result of list_length is actually
962 one too large. This is harmless.)
964 If SETUP_INCOMING_VARARGS is defined and STRICT_ARGUMENT_NAMING is not,
965 this machine will be able to place unnamed args that were passed in
966 registers into the stack. So treat all args as named. This allows the
967 insns emitting for a specific argument list to be independent of the
968 function declaration.
970 If SETUP_INCOMING_VARARGS is not defined, we do not have any reliable
971 way to pass unnamed args in registers, so we must force them into
973 #if !defined(SETUP_INCOMING_VARARGS) || defined(STRICT_ARGUMENT_NAMING)
974 if (TYPE_ARG_TYPES (funtype) != 0)
976 = (list_length (TYPE_ARG_TYPES (funtype))
977 #ifndef STRICT_ARGUMENT_NAMING
978 /* Don't include the last named arg. */
981 /* Count the struct value address, if it is passed as a parm. */
982 + structure_value_addr_parm);
985 /* If we know nothing, treat all args as named. */
986 n_named_args = num_actuals;
988 /* Make a vector to hold all the information about each arg. */
989 args = (struct arg_data *) alloca (num_actuals * sizeof (struct arg_data));
990 bzero ((char *) args, num_actuals * sizeof (struct arg_data));
992 args_size.constant = 0;
995 /* In this loop, we consider args in the order they are written.
996 We fill up ARGS from the front or from the back if necessary
997 so that in any case the first arg to be pushed ends up at the front. */
999 #ifdef PUSH_ARGS_REVERSED
1000 i = num_actuals - 1, inc = -1;
1001 /* In this case, must reverse order of args
1002 so that we compute and push the last arg first. */
1007 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1008 for (p = actparms, argpos = 0; p; p = TREE_CHAIN (p), i += inc, argpos++)
1010 tree type = TREE_TYPE (TREE_VALUE (p));
1012 enum machine_mode mode;
1014 args[i].tree_value = TREE_VALUE (p);
1016 /* Replace erroneous argument with constant zero. */
1017 if (type == error_mark_node || TYPE_SIZE (type) == 0)
1018 args[i].tree_value = integer_zero_node, type = integer_type_node;
1020 /* If TYPE is a transparent union, pass things the way we would
1021 pass the first field of the union. We have already verified that
1022 the modes are the same. */
1023 if (TYPE_TRANSPARENT_UNION (type))
1024 type = TREE_TYPE (TYPE_FIELDS (type));
1026 /* Decide where to pass this arg.
1028 args[i].reg is nonzero if all or part is passed in registers.
1030 args[i].partial is nonzero if part but not all is passed in registers,
1031 and the exact value says how many words are passed in registers.
1033 args[i].pass_on_stack is nonzero if the argument must at least be
1034 computed on the stack. It may then be loaded back into registers
1035 if args[i].reg is nonzero.
1037 These decisions are driven by the FUNCTION_... macros and must agree
1038 with those made by function.c. */
1040 /* See if this argument should be passed by invisible reference. */
1041 if ((TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST
1042 && contains_placeholder_p (TYPE_SIZE (type)))
1043 || TREE_ADDRESSABLE (type)
1044 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
1045 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, TYPE_MODE (type),
1046 type, argpos < n_named_args)
1050 /* If we're compiling a thunk, pass through invisible
1051 references instead of making a copy. */
1052 if (current_function_is_thunk
1053 #ifdef FUNCTION_ARG_CALLEE_COPIES
1054 || (FUNCTION_ARG_CALLEE_COPIES (args_so_far, TYPE_MODE (type),
1055 type, argpos < n_named_args)
1056 /* If it's in a register, we must make a copy of it too. */
1057 /* ??? Is this a sufficient test? Is there a better one? */
1058 && !(TREE_CODE (args[i].tree_value) == VAR_DECL
1059 && REG_P (DECL_RTL (args[i].tree_value)))
1060 && ! TREE_ADDRESSABLE (type))
1064 args[i].tree_value = build1 (ADDR_EXPR,
1065 build_pointer_type (type),
1066 args[i].tree_value);
1067 type = build_pointer_type (type);
1071 /* We make a copy of the object and pass the address to the
1072 function being called. */
1075 if (TYPE_SIZE (type) == 0
1076 || TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST
1077 || (flag_stack_check && ! STACK_CHECK_BUILTIN
1078 && (TREE_INT_CST_HIGH (TYPE_SIZE (type)) != 0
1079 || (TREE_INT_CST_LOW (TYPE_SIZE (type))
1080 > STACK_CHECK_MAX_VAR_SIZE * BITS_PER_UNIT))))
1082 /* This is a variable-sized object. Make space on the stack
1084 rtx size_rtx = expr_size (TREE_VALUE (p));
1086 if (old_stack_level == 0)
1088 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1089 old_pending_adj = pending_stack_adjust;
1090 pending_stack_adjust = 0;
1093 copy = gen_rtx (MEM, BLKmode,
1094 allocate_dynamic_stack_space (size_rtx,
1096 TYPE_ALIGN (type)));
1100 int size = int_size_in_bytes (type);
1101 copy = assign_stack_temp (TYPE_MODE (type), size, 0);
1104 MEM_IN_STRUCT_P (copy) = AGGREGATE_TYPE_P (type);
1106 store_expr (args[i].tree_value, copy, 0);
1109 args[i].tree_value = build1 (ADDR_EXPR,
1110 build_pointer_type (type),
1111 make_tree (type, copy));
1112 type = build_pointer_type (type);
1116 mode = TYPE_MODE (type);
1117 unsignedp = TREE_UNSIGNED (type);
1119 #ifdef PROMOTE_FUNCTION_ARGS
1120 mode = promote_mode (type, mode, &unsignedp, 1);
1123 args[i].unsignedp = unsignedp;
1124 args[i].mode = mode;
1125 args[i].reg = FUNCTION_ARG (args_so_far, mode, type,
1126 argpos < n_named_args);
1127 #ifdef FUNCTION_ARG_PARTIAL_NREGS
1130 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, type,
1131 argpos < n_named_args);
1134 args[i].pass_on_stack = MUST_PASS_IN_STACK (mode, type);
1136 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1137 it means that we are to pass this arg in the register(s) designated
1138 by the PARALLEL, but also to pass it in the stack. */
1139 if (args[i].reg && GET_CODE (args[i].reg) == PARALLEL
1140 && XEXP (XVECEXP (args[i].reg, 0, 0), 0) == 0)
1141 args[i].pass_on_stack = 1;
1143 /* If this is an addressable type, we must preallocate the stack
1144 since we must evaluate the object into its final location.
1146 If this is to be passed in both registers and the stack, it is simpler
1148 if (TREE_ADDRESSABLE (type)
1149 || (args[i].pass_on_stack && args[i].reg != 0))
1150 must_preallocate = 1;
1152 /* If this is an addressable type, we cannot pre-evaluate it. Thus,
1153 we cannot consider this function call constant. */
1154 if (TREE_ADDRESSABLE (type))
1157 /* Compute the stack-size of this argument. */
1158 if (args[i].reg == 0 || args[i].partial != 0
1159 #ifdef REG_PARM_STACK_SPACE
1160 || reg_parm_stack_space > 0
1162 || args[i].pass_on_stack)
1163 locate_and_pad_parm (mode, type,
1164 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1169 fndecl, &args_size, &args[i].offset,
1172 #ifndef ARGS_GROW_DOWNWARD
1173 args[i].slot_offset = args_size;
1176 #ifndef REG_PARM_STACK_SPACE
1177 /* If a part of the arg was put into registers,
1178 don't include that part in the amount pushed. */
1179 if (! args[i].pass_on_stack)
1180 args[i].size.constant -= ((args[i].partial * UNITS_PER_WORD)
1181 / (PARM_BOUNDARY / BITS_PER_UNIT)
1182 * (PARM_BOUNDARY / BITS_PER_UNIT));
1185 /* Update ARGS_SIZE, the total stack space for args so far. */
1187 args_size.constant += args[i].size.constant;
1188 if (args[i].size.var)
1190 ADD_PARM_SIZE (args_size, args[i].size.var);
1193 /* Since the slot offset points to the bottom of the slot,
1194 we must record it after incrementing if the args grow down. */
1195 #ifdef ARGS_GROW_DOWNWARD
1196 args[i].slot_offset = args_size;
1198 args[i].slot_offset.constant = -args_size.constant;
1201 SUB_PARM_SIZE (args[i].slot_offset, args_size.var);
1205 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1206 have been used, etc. */
1208 FUNCTION_ARG_ADVANCE (args_so_far, TYPE_MODE (type), type,
1209 argpos < n_named_args);
1212 #ifdef FINAL_REG_PARM_STACK_SPACE
1213 reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant,
1217 /* Compute the actual size of the argument block required. The variable
1218 and constant sizes must be combined, the size may have to be rounded,
1219 and there may be a minimum required size. */
1221 original_args_size = args_size;
1224 /* If this function requires a variable-sized argument list, don't try to
1225 make a cse'able block for this call. We may be able to do this
1226 eventually, but it is too complicated to keep track of what insns go
1227 in the cse'able block and which don't. */
1230 must_preallocate = 1;
1232 args_size.var = ARGS_SIZE_TREE (args_size);
1233 args_size.constant = 0;
1235 #ifdef STACK_BOUNDARY
1236 if (STACK_BOUNDARY != BITS_PER_UNIT)
1237 args_size.var = round_up (args_size.var, STACK_BYTES);
1240 #ifdef REG_PARM_STACK_SPACE
1241 if (reg_parm_stack_space > 0)
1244 = size_binop (MAX_EXPR, args_size.var,
1245 size_int (REG_PARM_STACK_SPACE (fndecl)));
1247 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1248 /* The area corresponding to register parameters is not to count in
1249 the size of the block we need. So make the adjustment. */
1251 = size_binop (MINUS_EXPR, args_size.var,
1252 size_int (reg_parm_stack_space));
1259 #ifdef STACK_BOUNDARY
1260 args_size.constant = (((args_size.constant + (STACK_BYTES - 1))
1261 / STACK_BYTES) * STACK_BYTES);
1264 #ifdef REG_PARM_STACK_SPACE
1265 args_size.constant = MAX (args_size.constant,
1266 reg_parm_stack_space);
1267 #ifdef MAYBE_REG_PARM_STACK_SPACE
1268 if (reg_parm_stack_space == 0)
1269 args_size.constant = 0;
1271 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1272 args_size.constant -= reg_parm_stack_space;
1277 /* See if we have or want to preallocate stack space.
1279 If we would have to push a partially-in-regs parm
1280 before other stack parms, preallocate stack space instead.
1282 If the size of some parm is not a multiple of the required stack
1283 alignment, we must preallocate.
1285 If the total size of arguments that would otherwise create a copy in
1286 a temporary (such as a CALL) is more than half the total argument list
1287 size, preallocation is faster.
1289 Another reason to preallocate is if we have a machine (like the m88k)
1290 where stack alignment is required to be maintained between every
1291 pair of insns, not just when the call is made. However, we assume here
1292 that such machines either do not have push insns (and hence preallocation
1293 would occur anyway) or the problem is taken care of with
1296 if (! must_preallocate)
1298 int partial_seen = 0;
1299 int copy_to_evaluate_size = 0;
1301 for (i = 0; i < num_actuals && ! must_preallocate; i++)
1303 if (args[i].partial > 0 && ! args[i].pass_on_stack)
1305 else if (partial_seen && args[i].reg == 0)
1306 must_preallocate = 1;
1308 if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode
1309 && (TREE_CODE (args[i].tree_value) == CALL_EXPR
1310 || TREE_CODE (args[i].tree_value) == TARGET_EXPR
1311 || TREE_CODE (args[i].tree_value) == COND_EXPR
1312 || TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value))))
1313 copy_to_evaluate_size
1314 += int_size_in_bytes (TREE_TYPE (args[i].tree_value));
1317 if (copy_to_evaluate_size * 2 >= args_size.constant
1318 && args_size.constant > 0)
1319 must_preallocate = 1;
1322 /* If the structure value address will reference the stack pointer, we must
1323 stabilize it. We don't need to do this if we know that we are not going
1324 to adjust the stack pointer in processing this call. */
1326 if (structure_value_addr
1327 && (reg_mentioned_p (virtual_stack_dynamic_rtx, structure_value_addr)
1328 || reg_mentioned_p (virtual_outgoing_args_rtx, structure_value_addr))
1330 #ifndef ACCUMULATE_OUTGOING_ARGS
1331 || args_size.constant
1334 structure_value_addr = copy_to_reg (structure_value_addr);
1336 /* If this function call is cse'able, precompute all the parameters.
1337 Note that if the parameter is constructed into a temporary, this will
1338 cause an additional copy because the parameter will be constructed
1339 into a temporary location and then copied into the outgoing arguments.
1340 If a parameter contains a call to alloca and this function uses the
1341 stack, precompute the parameter. */
1343 /* If we preallocated the stack space, and some arguments must be passed
1344 on the stack, then we must precompute any parameter which contains a
1345 function call which will store arguments on the stack.
1346 Otherwise, evaluating the parameter may clobber previous parameters
1347 which have already been stored into the stack. */
1349 for (i = 0; i < num_actuals; i++)
1351 || ((args_size.var != 0 || args_size.constant != 0)
1352 && calls_function (args[i].tree_value, 1))
1353 || (must_preallocate && (args_size.var != 0 || args_size.constant != 0)
1354 && calls_function (args[i].tree_value, 0)))
1356 /* If this is an addressable type, we cannot pre-evaluate it. */
1357 if (TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value)))
1362 args[i].initial_value = args[i].value
1363 = expand_expr (args[i].tree_value, NULL_RTX, VOIDmode, 0);
1365 preserve_temp_slots (args[i].value);
1368 /* ANSI doesn't require a sequence point here,
1369 but PCC has one, so this will avoid some problems. */
1372 args[i].initial_value = args[i].value
1373 = protect_from_queue (args[i].initial_value, 0);
1375 if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) != args[i].mode)
1377 = convert_modes (args[i].mode,
1378 TYPE_MODE (TREE_TYPE (args[i].tree_value)),
1379 args[i].value, args[i].unsignedp);
1382 /* Now we are about to start emitting insns that can be deleted
1383 if a libcall is deleted. */
1384 if (is_const || is_malloc)
1387 /* If we have no actual push instructions, or shouldn't use them,
1388 make space for all args right now. */
1390 if (args_size.var != 0)
1392 if (old_stack_level == 0)
1394 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1395 old_pending_adj = pending_stack_adjust;
1396 pending_stack_adjust = 0;
1397 #ifdef ACCUMULATE_OUTGOING_ARGS
1398 /* stack_arg_under_construction says whether a stack arg is
1399 being constructed at the old stack level. Pushing the stack
1400 gets a clean outgoing argument block. */
1401 old_stack_arg_under_construction = stack_arg_under_construction;
1402 stack_arg_under_construction = 0;
1405 argblock = push_block (ARGS_SIZE_RTX (args_size), 0, 0);
1409 /* Note that we must go through the motions of allocating an argument
1410 block even if the size is zero because we may be storing args
1411 in the area reserved for register arguments, which may be part of
1414 int needed = args_size.constant;
1416 /* Store the maximum argument space used. It will be pushed by
1417 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
1420 if (needed > current_function_outgoing_args_size)
1421 current_function_outgoing_args_size = needed;
1423 if (must_preallocate)
1425 #ifdef ACCUMULATE_OUTGOING_ARGS
1426 /* Since the stack pointer will never be pushed, it is possible for
1427 the evaluation of a parm to clobber something we have already
1428 written to the stack. Since most function calls on RISC machines
1429 do not use the stack, this is uncommon, but must work correctly.
1431 Therefore, we save any area of the stack that was already written
1432 and that we are using. Here we set up to do this by making a new
1433 stack usage map from the old one. The actual save will be done
1436 Another approach might be to try to reorder the argument
1437 evaluations to avoid this conflicting stack usage. */
1439 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1440 /* Since we will be writing into the entire argument area, the
1441 map must be allocated for its entire size, not just the part that
1442 is the responsibility of the caller. */
1443 needed += reg_parm_stack_space;
1446 #ifdef ARGS_GROW_DOWNWARD
1447 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
1450 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
1453 stack_usage_map = (char *) alloca (highest_outgoing_arg_in_use);
1455 if (initial_highest_arg_in_use)
1456 bcopy (initial_stack_usage_map, stack_usage_map,
1457 initial_highest_arg_in_use);
1459 if (initial_highest_arg_in_use != highest_outgoing_arg_in_use)
1460 bzero (&stack_usage_map[initial_highest_arg_in_use],
1461 highest_outgoing_arg_in_use - initial_highest_arg_in_use);
1464 /* The address of the outgoing argument list must not be copied to a
1465 register here, because argblock would be left pointing to the
1466 wrong place after the call to allocate_dynamic_stack_space below.
1469 argblock = virtual_outgoing_args_rtx;
1471 #else /* not ACCUMULATE_OUTGOING_ARGS */
1472 if (inhibit_defer_pop == 0)
1474 /* Try to reuse some or all of the pending_stack_adjust
1475 to get this space. Maybe we can avoid any pushing. */
1476 if (needed > pending_stack_adjust)
1478 needed -= pending_stack_adjust;
1479 pending_stack_adjust = 0;
1483 pending_stack_adjust -= needed;
1487 /* Special case this because overhead of `push_block' in this
1488 case is non-trivial. */
1490 argblock = virtual_outgoing_args_rtx;
1492 argblock = push_block (GEN_INT (needed), 0, 0);
1494 /* We only really need to call `copy_to_reg' in the case where push
1495 insns are going to be used to pass ARGBLOCK to a function
1496 call in ARGS. In that case, the stack pointer changes value
1497 from the allocation point to the call point, and hence
1498 the value of VIRTUAL_OUTGOING_ARGS_RTX changes as well.
1499 But might as well always do it. */
1500 argblock = copy_to_reg (argblock);
1501 #endif /* not ACCUMULATE_OUTGOING_ARGS */
1505 #ifdef ACCUMULATE_OUTGOING_ARGS
1506 /* The save/restore code in store_one_arg handles all cases except one:
1507 a constructor call (including a C function returning a BLKmode struct)
1508 to initialize an argument. */
1509 if (stack_arg_under_construction)
1511 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1512 rtx push_size = GEN_INT (reg_parm_stack_space + args_size.constant);
1514 rtx push_size = GEN_INT (args_size.constant);
1516 if (old_stack_level == 0)
1518 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1519 old_pending_adj = pending_stack_adjust;
1520 pending_stack_adjust = 0;
1521 /* stack_arg_under_construction says whether a stack arg is
1522 being constructed at the old stack level. Pushing the stack
1523 gets a clean outgoing argument block. */
1524 old_stack_arg_under_construction = stack_arg_under_construction;
1525 stack_arg_under_construction = 0;
1526 /* Make a new map for the new argument list. */
1527 stack_usage_map = (char *)alloca (highest_outgoing_arg_in_use);
1528 bzero (stack_usage_map, highest_outgoing_arg_in_use);
1529 highest_outgoing_arg_in_use = 0;
1531 allocate_dynamic_stack_space (push_size, NULL_RTX, BITS_PER_UNIT);
1533 /* If argument evaluation might modify the stack pointer, copy the
1534 address of the argument list to a register. */
1535 for (i = 0; i < num_actuals; i++)
1536 if (args[i].pass_on_stack)
1538 argblock = copy_addr_to_reg (argblock);
1544 /* If we preallocated stack space, compute the address of each argument.
1545 We need not ensure it is a valid memory address here; it will be
1546 validized when it is used. */
1549 rtx arg_reg = argblock;
1552 if (GET_CODE (argblock) == PLUS)
1553 arg_reg = XEXP (argblock, 0), arg_offset = INTVAL (XEXP (argblock, 1));
1555 for (i = 0; i < num_actuals; i++)
1557 rtx offset = ARGS_SIZE_RTX (args[i].offset);
1558 rtx slot_offset = ARGS_SIZE_RTX (args[i].slot_offset);
1561 /* Skip this parm if it will not be passed on the stack. */
1562 if (! args[i].pass_on_stack && args[i].reg != 0)
1565 if (GET_CODE (offset) == CONST_INT)
1566 addr = plus_constant (arg_reg, INTVAL (offset));
1568 addr = gen_rtx (PLUS, Pmode, arg_reg, offset);
1570 addr = plus_constant (addr, arg_offset);
1571 args[i].stack = gen_rtx (MEM, args[i].mode, addr);
1572 MEM_IN_STRUCT_P (args[i].stack)
1573 = AGGREGATE_TYPE_P (TREE_TYPE (args[i].tree_value));
1575 if (GET_CODE (slot_offset) == CONST_INT)
1576 addr = plus_constant (arg_reg, INTVAL (slot_offset));
1578 addr = gen_rtx (PLUS, Pmode, arg_reg, slot_offset);
1580 addr = plus_constant (addr, arg_offset);
1581 args[i].stack_slot = gen_rtx (MEM, args[i].mode, addr);
1585 #ifdef PUSH_ARGS_REVERSED
1586 #ifdef STACK_BOUNDARY
1587 /* If we push args individually in reverse order, perform stack alignment
1588 before the first push (the last arg). */
1590 anti_adjust_stack (GEN_INT (args_size.constant
1591 - original_args_size.constant));
1595 /* Don't try to defer pops if preallocating, not even from the first arg,
1596 since ARGBLOCK probably refers to the SP. */
1600 /* Get the function to call, in the form of RTL. */
1603 /* If this is the first use of the function, see if we need to
1604 make an external definition for it. */
1605 if (! TREE_USED (fndecl))
1607 assemble_external (fndecl);
1608 TREE_USED (fndecl) = 1;
1611 /* Get a SYMBOL_REF rtx for the function address. */
1612 funexp = XEXP (DECL_RTL (fndecl), 0);
1615 /* Generate an rtx (probably a pseudo-register) for the address. */
1618 funexp = expand_expr (TREE_OPERAND (exp, 0), NULL_RTX, VOIDmode, 0);
1619 pop_temp_slots (); /* FUNEXP can't be BLKmode */
1621 /* Check the function is executable. */
1622 if (flag_check_memory_usage)
1623 emit_library_call (chkr_check_exec_libfunc, 1,
1629 /* Figure out the register where the value, if any, will come back. */
1631 if (TYPE_MODE (TREE_TYPE (exp)) != VOIDmode
1632 && ! structure_value_addr)
1634 if (pcc_struct_value)
1635 valreg = hard_function_value (build_pointer_type (TREE_TYPE (exp)),
1638 valreg = hard_function_value (TREE_TYPE (exp), fndecl);
1641 /* Precompute all register parameters. It isn't safe to compute anything
1642 once we have started filling any specific hard regs. */
1644 for (i = 0; i < num_actuals; i++)
1645 if (args[i].reg != 0 && ! args[i].pass_on_stack)
1649 if (args[i].value == 0)
1652 args[i].value = expand_expr (args[i].tree_value, NULL_RTX,
1654 preserve_temp_slots (args[i].value);
1657 /* ANSI doesn't require a sequence point here,
1658 but PCC has one, so this will avoid some problems. */
1662 /* If we are to promote the function arg to a wider mode,
1665 if (args[i].mode != TYPE_MODE (TREE_TYPE (args[i].tree_value)))
1667 = convert_modes (args[i].mode,
1668 TYPE_MODE (TREE_TYPE (args[i].tree_value)),
1669 args[i].value, args[i].unsignedp);
1671 /* If the value is expensive, and we are inside an appropriately
1672 short loop, put the value into a pseudo and then put the pseudo
1675 For small register classes, also do this if this call uses
1676 register parameters. This is to avoid reload conflicts while
1677 loading the parameters registers. */
1679 if ((! (GET_CODE (args[i].value) == REG
1680 || (GET_CODE (args[i].value) == SUBREG
1681 && GET_CODE (SUBREG_REG (args[i].value)) == REG)))
1682 && args[i].mode != BLKmode
1683 && rtx_cost (args[i].value, SET) > 2
1684 && ((SMALL_REGISTER_CLASSES && reg_parm_seen)
1685 || preserve_subexpressions_p ()))
1686 args[i].value = copy_to_mode_reg (args[i].mode, args[i].value);
1689 #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE)
1690 /* The argument list is the property of the called routine and it
1691 may clobber it. If the fixed area has been used for previous
1692 parameters, we must save and restore it.
1694 Here we compute the boundary of the that needs to be saved, if any. */
1696 #ifdef ARGS_GROW_DOWNWARD
1697 for (i = 0; i < reg_parm_stack_space + 1; i++)
1699 for (i = 0; i < reg_parm_stack_space; i++)
1702 if (i >= highest_outgoing_arg_in_use
1703 || stack_usage_map[i] == 0)
1706 if (low_to_save == -1)
1712 if (low_to_save >= 0)
1714 int num_to_save = high_to_save - low_to_save + 1;
1715 enum machine_mode save_mode
1716 = mode_for_size (num_to_save * BITS_PER_UNIT, MODE_INT, 1);
1719 /* If we don't have the required alignment, must do this in BLKmode. */
1720 if ((low_to_save & (MIN (GET_MODE_SIZE (save_mode),
1721 BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1)))
1722 save_mode = BLKmode;
1724 stack_area = gen_rtx (MEM, save_mode,
1725 memory_address (save_mode,
1727 #ifdef ARGS_GROW_DOWNWARD
1728 plus_constant (argblock,
1731 plus_constant (argblock,
1735 if (save_mode == BLKmode)
1737 save_area = assign_stack_temp (BLKmode, num_to_save, 0);
1738 MEM_IN_STRUCT_P (save_area) = 0;
1739 emit_block_move (validize_mem (save_area), stack_area,
1740 GEN_INT (num_to_save),
1741 PARM_BOUNDARY / BITS_PER_UNIT);
1745 save_area = gen_reg_rtx (save_mode);
1746 emit_move_insn (save_area, stack_area);
1752 /* Now store (and compute if necessary) all non-register parms.
1753 These come before register parms, since they can require block-moves,
1754 which could clobber the registers used for register parms.
1755 Parms which have partial registers are not stored here,
1756 but we do preallocate space here if they want that. */
1758 for (i = 0; i < num_actuals; i++)
1759 if (args[i].reg == 0 || args[i].pass_on_stack)
1760 store_one_arg (&args[i], argblock, may_be_alloca,
1761 args_size.var != 0, fndecl, reg_parm_stack_space);
1763 /* If we have a parm that is passed in registers but not in memory
1764 and whose alignment does not permit a direct copy into registers,
1765 make a group of pseudos that correspond to each register that we
1768 if (STRICT_ALIGNMENT)
1769 for (i = 0; i < num_actuals; i++)
1770 if (args[i].reg != 0 && ! args[i].pass_on_stack
1771 && args[i].mode == BLKmode
1772 && (TYPE_ALIGN (TREE_TYPE (args[i].tree_value))
1773 < MIN (BIGGEST_ALIGNMENT, BITS_PER_WORD)))
1775 int bytes = int_size_in_bytes (TREE_TYPE (args[i].tree_value));
1776 int big_endian_correction = 0;
1778 args[i].n_aligned_regs
1779 = args[i].partial ? args[i].partial
1780 : (bytes + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
1782 args[i].aligned_regs = (rtx *) alloca (sizeof (rtx)
1783 * args[i].n_aligned_regs);
1785 /* Structures smaller than a word are aligned to the least
1786 significant byte (to the right). On a BYTES_BIG_ENDIAN machine,
1787 this means we must skip the empty high order bytes when
1788 calculating the bit offset. */
1789 if (BYTES_BIG_ENDIAN && bytes < UNITS_PER_WORD)
1790 big_endian_correction = (BITS_PER_WORD - (bytes * BITS_PER_UNIT));
1792 for (j = 0; j < args[i].n_aligned_regs; j++)
1794 rtx reg = gen_reg_rtx (word_mode);
1795 rtx word = operand_subword_force (args[i].value, j, BLKmode);
1796 int bitsize = TYPE_ALIGN (TREE_TYPE (args[i].tree_value));
1799 args[i].aligned_regs[j] = reg;
1801 /* Clobber REG and move each partword into it. Ensure we don't
1802 go past the end of the structure. Note that the loop below
1803 works because we've already verified that padding
1804 and endianness are compatible.
1806 We use to emit a clobber here but that doesn't let later
1807 passes optimize the instructions we emit. By storing 0 into
1808 the register later passes know the first AND to zero out the
1809 bitfield being set in the register is unnecessary. The store
1810 of 0 will be deleted as will at least the first AND. */
1812 emit_move_insn (reg, const0_rtx);
1815 bitpos < BITS_PER_WORD && bytes > 0;
1816 bitpos += bitsize, bytes -= bitsize / BITS_PER_UNIT)
1818 int xbitpos = bitpos + big_endian_correction;
1820 store_bit_field (reg, bitsize, xbitpos, word_mode,
1821 extract_bit_field (word, bitsize, bitpos, 1,
1822 NULL_RTX, word_mode,
1824 bitsize / BITS_PER_UNIT,
1826 bitsize / BITS_PER_UNIT, BITS_PER_WORD);
1831 /* Now store any partially-in-registers parm.
1832 This is the last place a block-move can happen. */
1834 for (i = 0; i < num_actuals; i++)
1835 if (args[i].partial != 0 && ! args[i].pass_on_stack)
1836 store_one_arg (&args[i], argblock, may_be_alloca,
1837 args_size.var != 0, fndecl, reg_parm_stack_space);
1839 #ifndef PUSH_ARGS_REVERSED
1840 #ifdef STACK_BOUNDARY
1841 /* If we pushed args in forward order, perform stack alignment
1842 after pushing the last arg. */
1844 anti_adjust_stack (GEN_INT (args_size.constant
1845 - original_args_size.constant));
1849 /* If register arguments require space on the stack and stack space
1850 was not preallocated, allocate stack space here for arguments
1851 passed in registers. */
1852 #if ! defined(ACCUMULATE_OUTGOING_ARGS) && defined(OUTGOING_REG_PARM_STACK_SPACE)
1853 if (must_preallocate == 0 && reg_parm_stack_space > 0)
1854 anti_adjust_stack (GEN_INT (reg_parm_stack_space));
1857 /* Pass the function the address in which to return a structure value. */
1858 if (structure_value_addr && ! structure_value_addr_parm)
1860 emit_move_insn (struct_value_rtx,
1862 force_operand (structure_value_addr,
1865 /* Mark the memory for the aggregate as write-only. */
1866 if (flag_check_memory_usage)
1867 emit_library_call (chkr_set_right_libfunc, 1,
1869 structure_value_addr, ptr_mode,
1870 GEN_INT (struct_value_size), TYPE_MODE (sizetype),
1871 GEN_INT (MEMORY_USE_WO),
1872 TYPE_MODE (integer_type_node));
1874 if (GET_CODE (struct_value_rtx) == REG)
1875 use_reg (&call_fusage, struct_value_rtx);
1878 funexp = prepare_call_address (funexp, fndecl, &call_fusage, reg_parm_seen);
1880 /* Now do the register loads required for any wholly-register parms or any
1881 parms which are passed both on the stack and in a register. Their
1882 expressions were already evaluated.
1884 Mark all register-parms as living through the call, putting these USE
1885 insns in the CALL_INSN_FUNCTION_USAGE field. */
1887 for (i = 0; i < num_actuals; i++)
1889 rtx reg = args[i].reg;
1890 int partial = args[i].partial;
1895 /* Set to non-negative if must move a word at a time, even if just
1896 one word (e.g, partial == 1 && mode == DFmode). Set to -1 if
1897 we just use a normal move insn. This value can be zero if the
1898 argument is a zero size structure with no fields. */
1899 nregs = (partial ? partial
1900 : (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode
1901 ? ((int_size_in_bytes (TREE_TYPE (args[i].tree_value))
1902 + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD)
1905 /* Handle calls that pass values in multiple non-contiguous
1906 locations. The Irix 6 ABI has examples of this. */
1908 if (GET_CODE (reg) == PARALLEL)
1909 emit_group_load (reg, args[i].value);
1911 /* If simple case, just do move. If normal partial, store_one_arg
1912 has already loaded the register for us. In all other cases,
1913 load the register(s) from memory. */
1915 else if (nregs == -1)
1916 emit_move_insn (reg, args[i].value);
1918 /* If we have pre-computed the values to put in the registers in
1919 the case of non-aligned structures, copy them in now. */
1921 else if (args[i].n_aligned_regs != 0)
1922 for (j = 0; j < args[i].n_aligned_regs; j++)
1923 emit_move_insn (gen_rtx (REG, word_mode, REGNO (reg) + j),
1924 args[i].aligned_regs[j]);
1926 else if (partial == 0 || args[i].pass_on_stack)
1927 move_block_to_reg (REGNO (reg),
1928 validize_mem (args[i].value), nregs,
1931 /* Handle calls that pass values in multiple non-contiguous
1932 locations. The Irix 6 ABI has examples of this. */
1933 if (GET_CODE (reg) == PARALLEL)
1934 use_group_regs (&call_fusage, reg);
1935 else if (nregs == -1)
1936 use_reg (&call_fusage, reg);
1938 use_regs (&call_fusage, REGNO (reg), nregs == 0 ? 1 : nregs);
1942 /* Perform postincrements before actually calling the function. */
1945 /* All arguments and registers used for the call must be set up by now! */
1947 /* Generate the actual call instruction. */
1948 emit_call_1 (funexp, fndecl, funtype, args_size.constant, struct_value_size,
1949 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1),
1950 valreg, old_inhibit_defer_pop, call_fusage, is_const);
1952 /* If call is cse'able, make appropriate pair of reg-notes around it.
1953 Test valreg so we don't crash; may safely ignore `const'
1954 if return type is void. Disable for PARALLEL return values, because
1955 we have no way to move such values into a pseudo register. */
1956 if (is_const && valreg != 0 && GET_CODE (valreg) != PARALLEL)
1959 rtx temp = gen_reg_rtx (GET_MODE (valreg));
1962 /* Mark the return value as a pointer if needed. */
1963 if (TREE_CODE (TREE_TYPE (exp)) == POINTER_TYPE)
1965 tree pointed_to = TREE_TYPE (TREE_TYPE (exp));
1966 mark_reg_pointer (temp, TYPE_ALIGN (pointed_to) / BITS_PER_UNIT);
1969 /* Construct an "equal form" for the value which mentions all the
1970 arguments in order as well as the function name. */
1971 #ifdef PUSH_ARGS_REVERSED
1972 for (i = 0; i < num_actuals; i++)
1973 note = gen_rtx (EXPR_LIST, VOIDmode, args[i].initial_value, note);
1975 for (i = num_actuals - 1; i >= 0; i--)
1976 note = gen_rtx (EXPR_LIST, VOIDmode, args[i].initial_value, note);
1978 note = gen_rtx (EXPR_LIST, VOIDmode, funexp, note);
1980 insns = get_insns ();
1983 emit_libcall_block (insns, temp, valreg, note);
1989 /* Otherwise, just write out the sequence without a note. */
1990 rtx insns = get_insns ();
1997 rtx temp = gen_reg_rtx (GET_MODE (valreg));
2000 /* The return value from a malloc-like function is a pointer. */
2001 if (TREE_CODE (TREE_TYPE (exp)) == POINTER_TYPE)
2002 mark_reg_pointer (temp, BIGGEST_ALIGNMENT / BITS_PER_UNIT);
2004 emit_move_insn (temp, valreg);
2006 /* The return value from a malloc-like function can not alias
2008 last = get_last_insn ();
2010 gen_rtx (EXPR_LIST, REG_NOALIAS, temp, REG_NOTES (last));
2012 /* Write out the sequence. */
2013 insns = get_insns ();
2019 /* For calls to `setjmp', etc., inform flow.c it should complain
2020 if nonvolatile values are live. */
2024 emit_note (name, NOTE_INSN_SETJMP);
2025 current_function_calls_setjmp = 1;
2029 current_function_calls_longjmp = 1;
2031 /* Notice functions that cannot return.
2032 If optimizing, insns emitted below will be dead.
2033 If not optimizing, they will exist, which is useful
2034 if the user uses the `return' command in the debugger. */
2036 if (is_volatile || is_longjmp)
2039 /* If value type not void, return an rtx for the value. */
2041 /* If there are cleanups to be called, don't use a hard reg as target.
2042 We need to double check this and see if it matters anymore. */
2043 if (any_pending_cleanups (1)
2044 && target && REG_P (target)
2045 && REGNO (target) < FIRST_PSEUDO_REGISTER)
2048 if (TYPE_MODE (TREE_TYPE (exp)) == VOIDmode
2051 target = const0_rtx;
2053 else if (structure_value_addr)
2055 if (target == 0 || GET_CODE (target) != MEM)
2057 target = gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)),
2058 memory_address (TYPE_MODE (TREE_TYPE (exp)),
2059 structure_value_addr));
2060 MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp));
2063 else if (pcc_struct_value)
2065 /* This is the special C++ case where we need to
2066 know what the true target was. We take care to
2067 never use this value more than once in one expression. */
2068 target = gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)),
2069 copy_to_reg (valreg));
2070 MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp));
2072 /* Handle calls that return values in multiple non-contiguous locations.
2073 The Irix 6 ABI has examples of this. */
2074 else if (GET_CODE (valreg) == PARALLEL)
2078 int bytes = int_size_in_bytes (TREE_TYPE (exp));
2079 target = assign_stack_temp (TYPE_MODE (TREE_TYPE (exp)), bytes, 0);
2080 MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp));
2081 preserve_temp_slots (target);
2084 emit_group_store (target, valreg);
2086 else if (target && GET_MODE (target) == TYPE_MODE (TREE_TYPE (exp))
2087 && GET_MODE (target) == GET_MODE (valreg))
2088 /* TARGET and VALREG cannot be equal at this point because the latter
2089 would not have REG_FUNCTION_VALUE_P true, while the former would if
2090 it were referring to the same register.
2092 If they refer to the same register, this move will be a no-op, except
2093 when function inlining is being done. */
2094 emit_move_insn (target, valreg);
2095 else if (TYPE_MODE (TREE_TYPE (exp)) == BLKmode)
2097 /* Some machines (the PA for example) want to return all small
2098 structures in registers regardless of the structure's alignment.
2100 Deal with them explicitly by copying from the return registers
2101 into the target MEM locations. */
2102 int bytes = int_size_in_bytes (TREE_TYPE (exp));
2103 int n_regs = (bytes + UNITS_PER_WORD - 1) / UNITS_PER_WORD;
2105 enum machine_mode tmpmode;
2107 int bitsize = MIN (TYPE_ALIGN (TREE_TYPE (exp)), BITS_PER_WORD);
2108 int bitpos, xbitpos, big_endian_correction = 0;
2112 target = assign_stack_temp (BLKmode, bytes, 0);
2113 MEM_IN_STRUCT_P (target) = AGGREGATE_TYPE_P (TREE_TYPE (exp));
2114 preserve_temp_slots (target);
2117 /* This code assumes valreg is at least a full word. If it isn't,
2118 copy it into a new pseudo which is a full word. */
2119 if (GET_MODE (valreg) != BLKmode
2120 && GET_MODE_SIZE (GET_MODE (valreg)) < UNITS_PER_WORD)
2121 valreg = convert_to_mode (word_mode, valreg,
2122 TREE_UNSIGNED (TREE_TYPE (exp)));
2124 /* Structures whose size is not a multiple of a word are aligned
2125 to the least significant byte (to the right). On a BYTES_BIG_ENDIAN
2126 machine, this means we must skip the empty high order bytes when
2127 calculating the bit offset. */
2128 if (BYTES_BIG_ENDIAN && bytes % UNITS_PER_WORD)
2129 big_endian_correction = (BITS_PER_WORD - ((bytes % UNITS_PER_WORD)
2132 /* Copy the structure BITSIZE bites at a time.
2134 We could probably emit more efficient code for machines
2135 which do not use strict alignment, but it doesn't seem
2136 worth the effort at the current time. */
2137 for (bitpos = 0, xbitpos = big_endian_correction;
2138 bitpos < bytes * BITS_PER_UNIT;
2139 bitpos += bitsize, xbitpos += bitsize)
2142 /* We need a new source operand each time xbitpos is on a
2143 word boundary and when xbitpos == big_endian_correction
2144 (the first time through). */
2145 if (xbitpos % BITS_PER_WORD == 0
2146 || xbitpos == big_endian_correction)
2147 src = operand_subword_force (valreg,
2148 xbitpos / BITS_PER_WORD,
2151 /* We need a new destination operand each time bitpos is on
2153 if (bitpos % BITS_PER_WORD == 0)
2154 dst = operand_subword (target, bitpos / BITS_PER_WORD, 1, BLKmode);
2156 /* Use xbitpos for the source extraction (right justified) and
2157 xbitpos for the destination store (left justified). */
2158 store_bit_field (dst, bitsize, bitpos % BITS_PER_WORD, word_mode,
2159 extract_bit_field (src, bitsize,
2160 xbitpos % BITS_PER_WORD, 1,
2161 NULL_RTX, word_mode,
2163 bitsize / BITS_PER_UNIT,
2165 bitsize / BITS_PER_UNIT, BITS_PER_WORD);
2169 target = copy_to_reg (valreg);
2171 #ifdef PROMOTE_FUNCTION_RETURN
2172 /* If we promoted this return value, make the proper SUBREG. TARGET
2173 might be const0_rtx here, so be careful. */
2174 if (GET_CODE (target) == REG
2175 && TYPE_MODE (TREE_TYPE (exp)) != BLKmode
2176 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
2178 tree type = TREE_TYPE (exp);
2179 int unsignedp = TREE_UNSIGNED (type);
2181 /* If we don't promote as expected, something is wrong. */
2182 if (GET_MODE (target)
2183 != promote_mode (type, TYPE_MODE (type), &unsignedp, 1))
2186 target = gen_rtx (SUBREG, TYPE_MODE (type), target, 0);
2187 SUBREG_PROMOTED_VAR_P (target) = 1;
2188 SUBREG_PROMOTED_UNSIGNED_P (target) = unsignedp;
2192 /* If size of args is variable or this was a constructor call for a stack
2193 argument, restore saved stack-pointer value. */
2195 if (old_stack_level)
2197 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
2198 pending_stack_adjust = old_pending_adj;
2199 #ifdef ACCUMULATE_OUTGOING_ARGS
2200 stack_arg_under_construction = old_stack_arg_under_construction;
2201 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
2202 stack_usage_map = initial_stack_usage_map;
2205 #ifdef ACCUMULATE_OUTGOING_ARGS
2208 #ifdef REG_PARM_STACK_SPACE
2211 enum machine_mode save_mode = GET_MODE (save_area);
2213 = gen_rtx (MEM, save_mode,
2214 memory_address (save_mode,
2215 #ifdef ARGS_GROW_DOWNWARD
2216 plus_constant (argblock, - high_to_save)
2218 plus_constant (argblock, low_to_save)
2222 if (save_mode != BLKmode)
2223 emit_move_insn (stack_area, save_area);
2225 emit_block_move (stack_area, validize_mem (save_area),
2226 GEN_INT (high_to_save - low_to_save + 1),
2227 PARM_BOUNDARY / BITS_PER_UNIT);
2231 /* If we saved any argument areas, restore them. */
2232 for (i = 0; i < num_actuals; i++)
2233 if (args[i].save_area)
2235 enum machine_mode save_mode = GET_MODE (args[i].save_area);
2237 = gen_rtx (MEM, save_mode,
2238 memory_address (save_mode,
2239 XEXP (args[i].stack_slot, 0)));
2241 if (save_mode != BLKmode)
2242 emit_move_insn (stack_area, args[i].save_area);
2244 emit_block_move (stack_area, validize_mem (args[i].save_area),
2245 GEN_INT (args[i].size.constant),
2246 PARM_BOUNDARY / BITS_PER_UNIT);
2249 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
2250 stack_usage_map = initial_stack_usage_map;
2254 /* If this was alloca, record the new stack level for nonlocal gotos.
2255 Check for the handler slots since we might not have a save area
2256 for non-local gotos. */
2258 if (may_be_alloca && nonlocal_goto_handler_slot != 0)
2259 emit_stack_save (SAVE_NONLOCAL, &nonlocal_goto_stack_level, NULL_RTX);
2266 /* Output a library call to function FUN (a SYMBOL_REF rtx)
2267 (emitting the queue unless NO_QUEUE is nonzero),
2268 for a value of mode OUTMODE,
2269 with NARGS different arguments, passed as alternating rtx values
2270 and machine_modes to convert them to.
2271 The rtx values should have been passed through protect_from_queue already.
2273 NO_QUEUE will be true if and only if the library call is a `const' call
2274 which will be enclosed in REG_LIBCALL/REG_RETVAL notes; it is equivalent
2275 to the variable is_const in expand_call.
2277 NO_QUEUE must be true for const calls, because if it isn't, then
2278 any pending increment will be emitted between REG_LIBCALL/REG_RETVAL notes,
2279 and will be lost if the libcall sequence is optimized away.
2281 NO_QUEUE must be false for non-const calls, because if it isn't, the
2282 call insn will have its CONST_CALL_P bit set, and it will be incorrectly
2283 optimized. For instance, the instruction scheduler may incorrectly
2284 move memory references across the non-const call. */
2287 emit_library_call VPROTO((rtx orgfun, int no_queue, enum machine_mode outmode,
2293 enum machine_mode outmode;
2297 /* Total size in bytes of all the stack-parms scanned so far. */
2298 struct args_size args_size;
2299 /* Size of arguments before any adjustments (such as rounding). */
2300 struct args_size original_args_size;
2301 register int argnum;
2306 CUMULATIVE_ARGS args_so_far;
2307 struct arg { rtx value; enum machine_mode mode; rtx reg; int partial;
2308 struct args_size offset; struct args_size size; rtx save_area; };
2310 int old_inhibit_defer_pop = inhibit_defer_pop;
2311 rtx call_fusage = 0;
2312 /* Size of the stack reserved for parameter registers. */
2313 int reg_parm_stack_space = 0;
2314 #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE)
2315 /* Define the boundary of the register parm stack space that needs to be
2317 int low_to_save = -1, high_to_save;
2318 rtx save_area = 0; /* Place that it is saved */
2321 #ifdef ACCUMULATE_OUTGOING_ARGS
2322 int initial_highest_arg_in_use = highest_outgoing_arg_in_use;
2323 char *initial_stack_usage_map = stack_usage_map;
2327 #ifdef REG_PARM_STACK_SPACE
2328 #ifdef MAYBE_REG_PARM_STACK_SPACE
2329 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
2331 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
2335 VA_START (p, nargs);
2338 orgfun = va_arg (p, rtx);
2339 no_queue = va_arg (p, int);
2340 outmode = va_arg (p, enum machine_mode);
2341 nargs = va_arg (p, int);
2346 /* Copy all the libcall-arguments out of the varargs data
2347 and into a vector ARGVEC.
2349 Compute how to pass each argument. We only support a very small subset
2350 of the full argument passing conventions to limit complexity here since
2351 library functions shouldn't have many args. */
2353 argvec = (struct arg *) alloca (nargs * sizeof (struct arg));
2354 bzero ((char *) argvec, nargs * sizeof (struct arg));
2357 INIT_CUMULATIVE_ARGS (args_so_far, NULL_TREE, fun, 0);
2359 args_size.constant = 0;
2364 for (count = 0; count < nargs; count++)
2366 rtx val = va_arg (p, rtx);
2367 enum machine_mode mode = va_arg (p, enum machine_mode);
2369 /* We cannot convert the arg value to the mode the library wants here;
2370 must do it earlier where we know the signedness of the arg. */
2372 || (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode))
2375 /* On some machines, there's no way to pass a float to a library fcn.
2376 Pass it as a double instead. */
2377 #ifdef LIBGCC_NEEDS_DOUBLE
2378 if (LIBGCC_NEEDS_DOUBLE && mode == SFmode)
2379 val = convert_modes (DFmode, SFmode, val, 0), mode = DFmode;
2382 /* There's no need to call protect_from_queue, because
2383 either emit_move_insn or emit_push_insn will do that. */
2385 /* Make sure it is a reasonable operand for a move or push insn. */
2386 if (GET_CODE (val) != REG && GET_CODE (val) != MEM
2387 && ! (CONSTANT_P (val) && LEGITIMATE_CONSTANT_P (val)))
2388 val = force_operand (val, NULL_RTX);
2390 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
2391 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, mode, NULL_TREE, 1))
2393 /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can
2394 be viewed as just an efficiency improvement. */
2395 rtx slot = assign_stack_temp (mode, GET_MODE_SIZE (mode), 0);
2396 emit_move_insn (slot, val);
2397 val = force_operand (XEXP (slot, 0), NULL_RTX);
2402 argvec[count].value = val;
2403 argvec[count].mode = mode;
2405 argvec[count].reg = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
2406 if (argvec[count].reg && GET_CODE (argvec[count].reg) == PARALLEL)
2408 #ifdef FUNCTION_ARG_PARTIAL_NREGS
2409 argvec[count].partial
2410 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, NULL_TREE, 1);
2412 argvec[count].partial = 0;
2415 locate_and_pad_parm (mode, NULL_TREE,
2416 argvec[count].reg && argvec[count].partial == 0,
2417 NULL_TREE, &args_size, &argvec[count].offset,
2418 &argvec[count].size);
2420 if (argvec[count].size.var)
2423 #ifndef REG_PARM_STACK_SPACE
2424 if (argvec[count].partial)
2425 argvec[count].size.constant -= argvec[count].partial * UNITS_PER_WORD;
2428 if (argvec[count].reg == 0 || argvec[count].partial != 0
2429 #ifdef REG_PARM_STACK_SPACE
2433 args_size.constant += argvec[count].size.constant;
2435 FUNCTION_ARG_ADVANCE (args_so_far, mode, (tree) 0, 1);
2439 #ifdef FINAL_REG_PARM_STACK_SPACE
2440 reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant,
2444 /* If this machine requires an external definition for library
2445 functions, write one out. */
2446 assemble_external_libcall (fun);
2448 original_args_size = args_size;
2449 #ifdef STACK_BOUNDARY
2450 args_size.constant = (((args_size.constant + (STACK_BYTES - 1))
2451 / STACK_BYTES) * STACK_BYTES);
2454 #ifdef REG_PARM_STACK_SPACE
2455 args_size.constant = MAX (args_size.constant,
2456 reg_parm_stack_space);
2457 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2458 args_size.constant -= reg_parm_stack_space;
2462 if (args_size.constant > current_function_outgoing_args_size)
2463 current_function_outgoing_args_size = args_size.constant;
2465 #ifdef ACCUMULATE_OUTGOING_ARGS
2466 /* Since the stack pointer will never be pushed, it is possible for
2467 the evaluation of a parm to clobber something we have already
2468 written to the stack. Since most function calls on RISC machines
2469 do not use the stack, this is uncommon, but must work correctly.
2471 Therefore, we save any area of the stack that was already written
2472 and that we are using. Here we set up to do this by making a new
2473 stack usage map from the old one.
2475 Another approach might be to try to reorder the argument
2476 evaluations to avoid this conflicting stack usage. */
2478 needed = args_size.constant;
2479 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
2480 /* Since we will be writing into the entire argument area, the
2481 map must be allocated for its entire size, not just the part that
2482 is the responsibility of the caller. */
2483 needed += reg_parm_stack_space;
2486 #ifdef ARGS_GROW_DOWNWARD
2487 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
2490 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
2493 stack_usage_map = (char *) alloca (highest_outgoing_arg_in_use);
2495 if (initial_highest_arg_in_use)
2496 bcopy (initial_stack_usage_map, stack_usage_map,
2497 initial_highest_arg_in_use);
2499 if (initial_highest_arg_in_use != highest_outgoing_arg_in_use)
2500 bzero (&stack_usage_map[initial_highest_arg_in_use],
2501 highest_outgoing_arg_in_use - initial_highest_arg_in_use);
2504 /* The address of the outgoing argument list must not be copied to a
2505 register here, because argblock would be left pointing to the
2506 wrong place after the call to allocate_dynamic_stack_space below.
2509 argblock = virtual_outgoing_args_rtx;
2510 #else /* not ACCUMULATE_OUTGOING_ARGS */
2511 #ifndef PUSH_ROUNDING
2512 argblock = push_block (GEN_INT (args_size.constant), 0, 0);
2516 #ifdef PUSH_ARGS_REVERSED
2517 #ifdef STACK_BOUNDARY
2518 /* If we push args individually in reverse order, perform stack alignment
2519 before the first push (the last arg). */
2521 anti_adjust_stack (GEN_INT (args_size.constant
2522 - original_args_size.constant));
2526 #ifdef PUSH_ARGS_REVERSED
2534 #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE)
2535 /* The argument list is the property of the called routine and it
2536 may clobber it. If the fixed area has been used for previous
2537 parameters, we must save and restore it.
2539 Here we compute the boundary of the that needs to be saved, if any. */
2541 #ifdef ARGS_GROW_DOWNWARD
2542 for (count = 0; count < reg_parm_stack_space + 1; count++)
2544 for (count = 0; count < reg_parm_stack_space; count++)
2547 if (count >= highest_outgoing_arg_in_use
2548 || stack_usage_map[count] == 0)
2551 if (low_to_save == -1)
2552 low_to_save = count;
2554 high_to_save = count;
2557 if (low_to_save >= 0)
2559 int num_to_save = high_to_save - low_to_save + 1;
2560 enum machine_mode save_mode
2561 = mode_for_size (num_to_save * BITS_PER_UNIT, MODE_INT, 1);
2564 /* If we don't have the required alignment, must do this in BLKmode. */
2565 if ((low_to_save & (MIN (GET_MODE_SIZE (save_mode),
2566 BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1)))
2567 save_mode = BLKmode;
2569 stack_area = gen_rtx (MEM, save_mode,
2570 memory_address (save_mode,
2572 #ifdef ARGS_GROW_DOWNWARD
2573 plus_constant (argblock,
2576 plus_constant (argblock,
2580 if (save_mode == BLKmode)
2582 save_area = assign_stack_temp (BLKmode, num_to_save, 0);
2583 MEM_IN_STRUCT_P (save_area) = 0;
2584 emit_block_move (validize_mem (save_area), stack_area,
2585 GEN_INT (num_to_save),
2586 PARM_BOUNDARY / BITS_PER_UNIT);
2590 save_area = gen_reg_rtx (save_mode);
2591 emit_move_insn (save_area, stack_area);
2596 /* Push the args that need to be pushed. */
2598 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
2599 are to be pushed. */
2600 for (count = 0; count < nargs; count++, argnum += inc)
2602 register enum machine_mode mode = argvec[argnum].mode;
2603 register rtx val = argvec[argnum].value;
2604 rtx reg = argvec[argnum].reg;
2605 int partial = argvec[argnum].partial;
2606 int lower_bound, upper_bound, i;
2608 if (! (reg != 0 && partial == 0))
2610 #ifdef ACCUMULATE_OUTGOING_ARGS
2611 /* If this is being stored into a pre-allocated, fixed-size, stack
2612 area, save any previous data at that location. */
2614 #ifdef ARGS_GROW_DOWNWARD
2615 /* stack_slot is negative, but we want to index stack_usage_map
2616 with positive values. */
2617 upper_bound = -argvec[argnum].offset.constant + 1;
2618 lower_bound = upper_bound - argvec[argnum].size.constant;
2620 lower_bound = argvec[argnum].offset.constant;
2621 upper_bound = lower_bound + argvec[argnum].size.constant;
2624 for (i = lower_bound; i < upper_bound; i++)
2625 if (stack_usage_map[i]
2626 #ifdef REG_PARM_STACK_SPACE
2627 /* Don't store things in the fixed argument area at this point;
2628 it has already been saved. */
2629 && i > reg_parm_stack_space
2634 if (i != upper_bound)
2636 /* We need to make a save area. See what mode we can make it. */
2637 enum machine_mode save_mode
2638 = mode_for_size (argvec[argnum].size.constant * BITS_PER_UNIT,
2641 = gen_rtx (MEM, save_mode,
2642 memory_address (save_mode, plus_constant (argblock,
2643 argvec[argnum].offset.constant)));
2644 argvec[argnum].save_area = gen_reg_rtx (save_mode);
2645 emit_move_insn (argvec[argnum].save_area, stack_area);
2648 emit_push_insn (val, mode, NULL_TREE, NULL_RTX, 0, partial, reg, 0,
2649 argblock, GEN_INT (argvec[argnum].offset.constant));
2651 #ifdef ACCUMULATE_OUTGOING_ARGS
2652 /* Now mark the segment we just used. */
2653 for (i = lower_bound; i < upper_bound; i++)
2654 stack_usage_map[i] = 1;
2661 #ifndef PUSH_ARGS_REVERSED
2662 #ifdef STACK_BOUNDARY
2663 /* If we pushed args in forward order, perform stack alignment
2664 after pushing the last arg. */
2666 anti_adjust_stack (GEN_INT (args_size.constant
2667 - original_args_size.constant));
2671 #ifdef PUSH_ARGS_REVERSED
2677 fun = prepare_call_address (fun, NULL_TREE, &call_fusage, 0);
2679 /* Now load any reg parms into their regs. */
2681 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
2682 are to be pushed. */
2683 for (count = 0; count < nargs; count++, argnum += inc)
2685 register enum machine_mode mode = argvec[argnum].mode;
2686 register rtx val = argvec[argnum].value;
2687 rtx reg = argvec[argnum].reg;
2688 int partial = argvec[argnum].partial;
2690 if (reg != 0 && partial == 0)
2691 emit_move_insn (reg, val);
2695 /* For version 1.37, try deleting this entirely. */
2699 /* Any regs containing parms remain in use through the call. */
2700 for (count = 0; count < nargs; count++)
2701 if (argvec[count].reg != 0)
2702 use_reg (&call_fusage, argvec[count].reg);
2704 /* Don't allow popping to be deferred, since then
2705 cse'ing of library calls could delete a call and leave the pop. */
2708 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
2709 will set inhibit_defer_pop to that value. */
2711 /* The return type is needed to decide how many bytes the function pops.
2712 Signedness plays no role in that, so for simplicity, we pretend it's
2713 always signed. We also assume that the list of arguments passed has
2714 no impact, so we pretend it is unknown. */
2717 get_identifier (XSTR (orgfun, 0)),
2718 build_function_type (outmode == VOIDmode ? void_type_node
2719 : type_for_mode (outmode, 0), NULL_TREE),
2720 args_size.constant, 0,
2721 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1),
2722 outmode != VOIDmode ? hard_libcall_value (outmode) : NULL_RTX,
2723 old_inhibit_defer_pop + 1, call_fusage, no_queue);
2727 /* Now restore inhibit_defer_pop to its actual original value. */
2730 #ifdef ACCUMULATE_OUTGOING_ARGS
2731 #ifdef REG_PARM_STACK_SPACE
2734 enum machine_mode save_mode = GET_MODE (save_area);
2736 = gen_rtx (MEM, save_mode,
2737 memory_address (save_mode,
2738 #ifdef ARGS_GROW_DOWNWARD
2739 plus_constant (argblock, - high_to_save)
2741 plus_constant (argblock, low_to_save)
2745 if (save_mode != BLKmode)
2746 emit_move_insn (stack_area, save_area);
2748 emit_block_move (stack_area, validize_mem (save_area),
2749 GEN_INT (high_to_save - low_to_save + 1),
2750 PARM_BOUNDARY / BITS_PER_UNIT);
2754 /* If we saved any argument areas, restore them. */
2755 for (count = 0; count < nargs; count++)
2756 if (argvec[count].save_area)
2758 enum machine_mode save_mode = GET_MODE (argvec[count].save_area);
2760 = gen_rtx (MEM, save_mode,
2761 memory_address (save_mode, plus_constant (argblock,
2762 argvec[count].offset.constant)));
2764 emit_move_insn (stack_area, argvec[count].save_area);
2767 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
2768 stack_usage_map = initial_stack_usage_map;
2772 /* Like emit_library_call except that an extra argument, VALUE,
2773 comes second and says where to store the result.
2774 (If VALUE is zero, this function chooses a convenient way
2775 to return the value.
2777 This function returns an rtx for where the value is to be found.
2778 If VALUE is nonzero, VALUE is returned. */
2781 emit_library_call_value VPROTO((rtx orgfun, rtx value, int no_queue,
2782 enum machine_mode outmode, int nargs, ...))
2788 enum machine_mode outmode;
2792 /* Total size in bytes of all the stack-parms scanned so far. */
2793 struct args_size args_size;
2794 /* Size of arguments before any adjustments (such as rounding). */
2795 struct args_size original_args_size;
2796 register int argnum;
2801 CUMULATIVE_ARGS args_so_far;
2802 struct arg { rtx value; enum machine_mode mode; rtx reg; int partial;
2803 struct args_size offset; struct args_size size; rtx save_area; };
2805 int old_inhibit_defer_pop = inhibit_defer_pop;
2806 rtx call_fusage = 0;
2807 /* Size of the stack reserved for parameter registers. */
2808 int reg_parm_stack_space = 0;
2810 int pcc_struct_value = 0;
2811 int struct_value_size = 0;
2815 #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE)
2816 /* Define the boundary of the register parm stack space that needs to be
2818 int low_to_save = -1, high_to_save;
2819 rtx save_area = 0; /* Place that it is saved */
2822 #ifdef ACCUMULATE_OUTGOING_ARGS
2823 int initial_highest_arg_in_use = highest_outgoing_arg_in_use;
2824 char *initial_stack_usage_map = stack_usage_map;
2827 #ifdef REG_PARM_STACK_SPACE
2828 #ifdef MAYBE_REG_PARM_STACK_SPACE
2829 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
2831 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
2835 VA_START (p, nargs);
2838 orgfun = va_arg (p, rtx);
2839 value = va_arg (p, rtx);
2840 no_queue = va_arg (p, int);
2841 outmode = va_arg (p, enum machine_mode);
2842 nargs = va_arg (p, int);
2845 is_const = no_queue;
2848 /* If this kind of value comes back in memory,
2849 decide where in memory it should come back. */
2850 if (aggregate_value_p (type_for_mode (outmode, 0)))
2852 #ifdef PCC_STATIC_STRUCT_RETURN
2854 = hard_function_value (build_pointer_type (type_for_mode (outmode, 0)),
2856 mem_value = gen_rtx (MEM, outmode, pointer_reg);
2857 pcc_struct_value = 1;
2859 value = gen_reg_rtx (outmode);
2860 #else /* not PCC_STATIC_STRUCT_RETURN */
2861 struct_value_size = GET_MODE_SIZE (outmode);
2862 if (value != 0 && GET_CODE (value) == MEM)
2865 mem_value = assign_stack_temp (outmode, GET_MODE_SIZE (outmode), 0);
2868 /* This call returns a big structure. */
2872 /* ??? Unfinished: must pass the memory address as an argument. */
2874 /* Copy all the libcall-arguments out of the varargs data
2875 and into a vector ARGVEC.
2877 Compute how to pass each argument. We only support a very small subset
2878 of the full argument passing conventions to limit complexity here since
2879 library functions shouldn't have many args. */
2881 argvec = (struct arg *) alloca ((nargs + 1) * sizeof (struct arg));
2882 bzero ((char *) argvec, (nargs + 1) * sizeof (struct arg));
2884 INIT_CUMULATIVE_ARGS (args_so_far, NULL_TREE, fun, 0);
2886 args_size.constant = 0;
2893 /* If there's a structure value address to be passed,
2894 either pass it in the special place, or pass it as an extra argument. */
2895 if (mem_value && struct_value_rtx == 0 && ! pcc_struct_value)
2897 rtx addr = XEXP (mem_value, 0);
2900 /* Make sure it is a reasonable operand for a move or push insn. */
2901 if (GET_CODE (addr) != REG && GET_CODE (addr) != MEM
2902 && ! (CONSTANT_P (addr) && LEGITIMATE_CONSTANT_P (addr)))
2903 addr = force_operand (addr, NULL_RTX);
2905 argvec[count].value = addr;
2906 argvec[count].mode = Pmode;
2907 argvec[count].partial = 0;
2909 argvec[count].reg = FUNCTION_ARG (args_so_far, Pmode, NULL_TREE, 1);
2910 #ifdef FUNCTION_ARG_PARTIAL_NREGS
2911 if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far, Pmode, NULL_TREE, 1))
2915 locate_and_pad_parm (Pmode, NULL_TREE,
2916 argvec[count].reg && argvec[count].partial == 0,
2917 NULL_TREE, &args_size, &argvec[count].offset,
2918 &argvec[count].size);
2921 if (argvec[count].reg == 0 || argvec[count].partial != 0
2922 #ifdef REG_PARM_STACK_SPACE
2926 args_size.constant += argvec[count].size.constant;
2928 FUNCTION_ARG_ADVANCE (args_so_far, Pmode, (tree) 0, 1);
2933 for (; count < nargs; count++)
2935 rtx val = va_arg (p, rtx);
2936 enum machine_mode mode = va_arg (p, enum machine_mode);
2938 /* We cannot convert the arg value to the mode the library wants here;
2939 must do it earlier where we know the signedness of the arg. */
2941 || (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode))
2944 /* On some machines, there's no way to pass a float to a library fcn.
2945 Pass it as a double instead. */
2946 #ifdef LIBGCC_NEEDS_DOUBLE
2947 if (LIBGCC_NEEDS_DOUBLE && mode == SFmode)
2948 val = convert_modes (DFmode, SFmode, val, 0), mode = DFmode;
2951 /* There's no need to call protect_from_queue, because
2952 either emit_move_insn or emit_push_insn will do that. */
2954 /* Make sure it is a reasonable operand for a move or push insn. */
2955 if (GET_CODE (val) != REG && GET_CODE (val) != MEM
2956 && ! (CONSTANT_P (val) && LEGITIMATE_CONSTANT_P (val)))
2957 val = force_operand (val, NULL_RTX);
2959 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
2960 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, mode, NULL_TREE, 1))
2962 /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can
2963 be viewed as just an efficiency improvement. */
2964 rtx slot = assign_stack_temp (mode, GET_MODE_SIZE (mode), 0);
2965 emit_move_insn (slot, val);
2966 val = XEXP (slot, 0);
2971 argvec[count].value = val;
2972 argvec[count].mode = mode;
2974 argvec[count].reg = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
2975 if (argvec[count].reg && GET_CODE (argvec[count].reg) == PARALLEL)
2977 #ifdef FUNCTION_ARG_PARTIAL_NREGS
2978 argvec[count].partial
2979 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, NULL_TREE, 1);
2981 argvec[count].partial = 0;
2984 locate_and_pad_parm (mode, NULL_TREE,
2985 argvec[count].reg && argvec[count].partial == 0,
2986 NULL_TREE, &args_size, &argvec[count].offset,
2987 &argvec[count].size);
2989 if (argvec[count].size.var)
2992 #ifndef REG_PARM_STACK_SPACE
2993 if (argvec[count].partial)
2994 argvec[count].size.constant -= argvec[count].partial * UNITS_PER_WORD;
2997 if (argvec[count].reg == 0 || argvec[count].partial != 0
2998 #ifdef REG_PARM_STACK_SPACE
3002 args_size.constant += argvec[count].size.constant;
3004 FUNCTION_ARG_ADVANCE (args_so_far, mode, (tree) 0, 1);
3008 #ifdef FINAL_REG_PARM_STACK_SPACE
3009 reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant,
3012 /* If this machine requires an external definition for library
3013 functions, write one out. */
3014 assemble_external_libcall (fun);
3016 original_args_size = args_size;
3017 #ifdef STACK_BOUNDARY
3018 args_size.constant = (((args_size.constant + (STACK_BYTES - 1))
3019 / STACK_BYTES) * STACK_BYTES);
3022 #ifdef REG_PARM_STACK_SPACE
3023 args_size.constant = MAX (args_size.constant,
3024 reg_parm_stack_space);
3025 #ifndef OUTGOING_REG_PARM_STACK_SPACE
3026 args_size.constant -= reg_parm_stack_space;
3030 if (args_size.constant > current_function_outgoing_args_size)
3031 current_function_outgoing_args_size = args_size.constant;
3033 #ifdef ACCUMULATE_OUTGOING_ARGS
3034 /* Since the stack pointer will never be pushed, it is possible for
3035 the evaluation of a parm to clobber something we have already
3036 written to the stack. Since most function calls on RISC machines
3037 do not use the stack, this is uncommon, but must work correctly.
3039 Therefore, we save any area of the stack that was already written
3040 and that we are using. Here we set up to do this by making a new
3041 stack usage map from the old one.
3043 Another approach might be to try to reorder the argument
3044 evaluations to avoid this conflicting stack usage. */
3046 needed = args_size.constant;
3047 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
3048 /* Since we will be writing into the entire argument area, the
3049 map must be allocated for its entire size, not just the part that
3050 is the responsibility of the caller. */
3051 needed += reg_parm_stack_space;
3054 #ifdef ARGS_GROW_DOWNWARD
3055 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
3058 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
3061 stack_usage_map = (char *) alloca (highest_outgoing_arg_in_use);
3063 if (initial_highest_arg_in_use)
3064 bcopy (initial_stack_usage_map, stack_usage_map,
3065 initial_highest_arg_in_use);
3067 if (initial_highest_arg_in_use != highest_outgoing_arg_in_use)
3068 bzero (&stack_usage_map[initial_highest_arg_in_use],
3069 highest_outgoing_arg_in_use - initial_highest_arg_in_use);
3072 /* The address of the outgoing argument list must not be copied to a
3073 register here, because argblock would be left pointing to the
3074 wrong place after the call to allocate_dynamic_stack_space below.
3077 argblock = virtual_outgoing_args_rtx;
3078 #else /* not ACCUMULATE_OUTGOING_ARGS */
3079 #ifndef PUSH_ROUNDING
3080 argblock = push_block (GEN_INT (args_size.constant), 0, 0);
3084 #ifdef PUSH_ARGS_REVERSED
3085 #ifdef STACK_BOUNDARY
3086 /* If we push args individually in reverse order, perform stack alignment
3087 before the first push (the last arg). */
3089 anti_adjust_stack (GEN_INT (args_size.constant
3090 - original_args_size.constant));
3094 #ifdef PUSH_ARGS_REVERSED
3102 #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE)
3103 /* The argument list is the property of the called routine and it
3104 may clobber it. If the fixed area has been used for previous
3105 parameters, we must save and restore it.
3107 Here we compute the boundary of the that needs to be saved, if any. */
3109 #ifdef ARGS_GROW_DOWNWARD
3110 for (count = 0; count < reg_parm_stack_space + 1; count++)
3112 for (count = 0; count < reg_parm_stack_space; count++)
3115 if (count >= highest_outgoing_arg_in_use
3116 || stack_usage_map[count] == 0)
3119 if (low_to_save == -1)
3120 low_to_save = count;
3122 high_to_save = count;
3125 if (low_to_save >= 0)
3127 int num_to_save = high_to_save - low_to_save + 1;
3128 enum machine_mode save_mode
3129 = mode_for_size (num_to_save * BITS_PER_UNIT, MODE_INT, 1);
3132 /* If we don't have the required alignment, must do this in BLKmode. */
3133 if ((low_to_save & (MIN (GET_MODE_SIZE (save_mode),
3134 BIGGEST_ALIGNMENT / UNITS_PER_WORD) - 1)))
3135 save_mode = BLKmode;
3137 stack_area = gen_rtx (MEM, save_mode,
3138 memory_address (save_mode,
3140 #ifdef ARGS_GROW_DOWNWARD
3141 plus_constant (argblock,
3144 plus_constant (argblock,
3148 if (save_mode == BLKmode)
3150 save_area = assign_stack_temp (BLKmode, num_to_save, 0);
3151 MEM_IN_STRUCT_P (save_area) = 0;
3152 emit_block_move (validize_mem (save_area), stack_area,
3153 GEN_INT (num_to_save),
3154 PARM_BOUNDARY / BITS_PER_UNIT);
3158 save_area = gen_reg_rtx (save_mode);
3159 emit_move_insn (save_area, stack_area);
3164 /* Push the args that need to be pushed. */
3166 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
3167 are to be pushed. */
3168 for (count = 0; count < nargs; count++, argnum += inc)
3170 register enum machine_mode mode = argvec[argnum].mode;
3171 register rtx val = argvec[argnum].value;
3172 rtx reg = argvec[argnum].reg;
3173 int partial = argvec[argnum].partial;
3174 int lower_bound, upper_bound, i;
3176 if (! (reg != 0 && partial == 0))
3178 #ifdef ACCUMULATE_OUTGOING_ARGS
3179 /* If this is being stored into a pre-allocated, fixed-size, stack
3180 area, save any previous data at that location. */
3182 #ifdef ARGS_GROW_DOWNWARD
3183 /* stack_slot is negative, but we want to index stack_usage_map
3184 with positive values. */
3185 upper_bound = -argvec[argnum].offset.constant + 1;
3186 lower_bound = upper_bound - argvec[argnum].size.constant;
3188 lower_bound = argvec[argnum].offset.constant;
3189 upper_bound = lower_bound + argvec[argnum].size.constant;
3192 for (i = lower_bound; i < upper_bound; i++)
3193 if (stack_usage_map[i]
3194 #ifdef REG_PARM_STACK_SPACE
3195 /* Don't store things in the fixed argument area at this point;
3196 it has already been saved. */
3197 && i > reg_parm_stack_space
3202 if (i != upper_bound)
3204 /* We need to make a save area. See what mode we can make it. */
3205 enum machine_mode save_mode
3206 = mode_for_size (argvec[argnum].size.constant * BITS_PER_UNIT,
3209 = gen_rtx (MEM, save_mode,
3210 memory_address (save_mode, plus_constant (argblock,
3211 argvec[argnum].offset.constant)));
3212 argvec[argnum].save_area = gen_reg_rtx (save_mode);
3213 emit_move_insn (argvec[argnum].save_area, stack_area);
3216 emit_push_insn (val, mode, NULL_TREE, NULL_RTX, 0, partial, reg, 0,
3217 argblock, GEN_INT (argvec[argnum].offset.constant));
3219 #ifdef ACCUMULATE_OUTGOING_ARGS
3220 /* Now mark the segment we just used. */
3221 for (i = lower_bound; i < upper_bound; i++)
3222 stack_usage_map[i] = 1;
3229 #ifndef PUSH_ARGS_REVERSED
3230 #ifdef STACK_BOUNDARY
3231 /* If we pushed args in forward order, perform stack alignment
3232 after pushing the last arg. */
3234 anti_adjust_stack (GEN_INT (args_size.constant
3235 - original_args_size.constant));
3239 #ifdef PUSH_ARGS_REVERSED
3245 fun = prepare_call_address (fun, NULL_TREE, &call_fusage, 0);
3247 /* Now load any reg parms into their regs. */
3249 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
3250 are to be pushed. */
3251 for (count = 0; count < nargs; count++, argnum += inc)
3253 register enum machine_mode mode = argvec[argnum].mode;
3254 register rtx val = argvec[argnum].value;
3255 rtx reg = argvec[argnum].reg;
3256 int partial = argvec[argnum].partial;
3258 if (reg != 0 && partial == 0)
3259 emit_move_insn (reg, val);
3264 /* For version 1.37, try deleting this entirely. */
3269 /* Any regs containing parms remain in use through the call. */
3270 for (count = 0; count < nargs; count++)
3271 if (argvec[count].reg != 0)
3272 use_reg (&call_fusage, argvec[count].reg);
3274 /* Pass the function the address in which to return a structure value. */
3275 if (mem_value != 0 && struct_value_rtx != 0 && ! pcc_struct_value)
3277 emit_move_insn (struct_value_rtx,
3279 force_operand (XEXP (mem_value, 0),
3281 if (GET_CODE (struct_value_rtx) == REG)
3282 use_reg (&call_fusage, struct_value_rtx);
3285 /* Don't allow popping to be deferred, since then
3286 cse'ing of library calls could delete a call and leave the pop. */
3289 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
3290 will set inhibit_defer_pop to that value. */
3291 /* See the comment in emit_library_call about the function type we build
3295 get_identifier (XSTR (orgfun, 0)),
3296 build_function_type (type_for_mode (outmode, 0), NULL_TREE),
3297 args_size.constant, struct_value_size,
3298 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1),
3299 mem_value == 0 ? hard_libcall_value (outmode) : NULL_RTX,
3300 old_inhibit_defer_pop + 1, call_fusage, is_const);
3302 /* Now restore inhibit_defer_pop to its actual original value. */
3307 /* Copy the value to the right place. */
3308 if (outmode != VOIDmode)
3314 if (value != mem_value)
3315 emit_move_insn (value, mem_value);
3317 else if (value != 0)
3318 emit_move_insn (value, hard_libcall_value (outmode));
3320 value = hard_libcall_value (outmode);
3323 #ifdef ACCUMULATE_OUTGOING_ARGS
3324 #ifdef REG_PARM_STACK_SPACE
3327 enum machine_mode save_mode = GET_MODE (save_area);
3329 = gen_rtx (MEM, save_mode,
3330 memory_address (save_mode,
3331 #ifdef ARGS_GROW_DOWNWARD
3332 plus_constant (argblock, - high_to_save)
3334 plus_constant (argblock, low_to_save)
3338 if (save_mode != BLKmode)
3339 emit_move_insn (stack_area, save_area);
3341 emit_block_move (stack_area, validize_mem (save_area),
3342 GEN_INT (high_to_save - low_to_save + 1),
3343 PARM_BOUNDARY / BITS_PER_UNIT);
3347 /* If we saved any argument areas, restore them. */
3348 for (count = 0; count < nargs; count++)
3349 if (argvec[count].save_area)
3351 enum machine_mode save_mode = GET_MODE (argvec[count].save_area);
3353 = gen_rtx (MEM, save_mode,
3354 memory_address (save_mode, plus_constant (argblock,
3355 argvec[count].offset.constant)));
3357 emit_move_insn (stack_area, argvec[count].save_area);
3360 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
3361 stack_usage_map = initial_stack_usage_map;
3368 /* Return an rtx which represents a suitable home on the stack
3369 given TYPE, the type of the argument looking for a home.
3370 This is called only for BLKmode arguments.
3372 SIZE is the size needed for this target.
3373 ARGS_ADDR is the address of the bottom of the argument block for this call.
3374 OFFSET describes this parameter's offset into ARGS_ADDR. It is meaningless
3375 if this machine uses push insns. */
3378 target_for_arg (type, size, args_addr, offset)
3382 struct args_size offset;
3385 rtx offset_rtx = ARGS_SIZE_RTX (offset);
3387 /* We do not call memory_address if possible,
3388 because we want to address as close to the stack
3389 as possible. For non-variable sized arguments,
3390 this will be stack-pointer relative addressing. */
3391 if (GET_CODE (offset_rtx) == CONST_INT)
3392 target = plus_constant (args_addr, INTVAL (offset_rtx));
3395 /* I have no idea how to guarantee that this
3396 will work in the presence of register parameters. */
3397 target = gen_rtx (PLUS, Pmode, args_addr, offset_rtx);
3398 target = memory_address (QImode, target);
3401 return gen_rtx (MEM, BLKmode, target);
3405 /* Store a single argument for a function call
3406 into the register or memory area where it must be passed.
3407 *ARG describes the argument value and where to pass it.
3409 ARGBLOCK is the address of the stack-block for all the arguments,
3410 or 0 on a machine where arguments are pushed individually.
3412 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
3413 so must be careful about how the stack is used.
3415 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
3416 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
3417 that we need not worry about saving and restoring the stack.
3419 FNDECL is the declaration of the function we are calling. */
3422 store_one_arg (arg, argblock, may_be_alloca, variable_size, fndecl,
3423 reg_parm_stack_space)
3424 struct arg_data *arg;
3429 int reg_parm_stack_space;
3431 register tree pval = arg->tree_value;
3435 int i, lower_bound, upper_bound;
3437 if (TREE_CODE (pval) == ERROR_MARK)
3440 /* Push a new temporary level for any temporaries we make for
3444 #ifdef ACCUMULATE_OUTGOING_ARGS
3445 /* If this is being stored into a pre-allocated, fixed-size, stack area,
3446 save any previous data at that location. */
3447 if (argblock && ! variable_size && arg->stack)
3449 #ifdef ARGS_GROW_DOWNWARD
3450 /* stack_slot is negative, but we want to index stack_usage_map
3451 with positive values. */
3452 if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS)
3453 upper_bound = -INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1)) + 1;
3457 lower_bound = upper_bound - arg->size.constant;
3459 if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS)
3460 lower_bound = INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1));
3464 upper_bound = lower_bound + arg->size.constant;
3467 for (i = lower_bound; i < upper_bound; i++)
3468 if (stack_usage_map[i]
3469 #ifdef REG_PARM_STACK_SPACE
3470 /* Don't store things in the fixed argument area at this point;
3471 it has already been saved. */
3472 && i > reg_parm_stack_space
3477 if (i != upper_bound)
3479 /* We need to make a save area. See what mode we can make it. */
3480 enum machine_mode save_mode
3481 = mode_for_size (arg->size.constant * BITS_PER_UNIT, MODE_INT, 1);
3483 = gen_rtx (MEM, save_mode,
3484 memory_address (save_mode, XEXP (arg->stack_slot, 0)));
3486 if (save_mode == BLKmode)
3488 arg->save_area = assign_stack_temp (BLKmode,
3489 arg->size.constant, 0);
3490 MEM_IN_STRUCT_P (arg->save_area)
3491 = AGGREGATE_TYPE_P (TREE_TYPE (arg->tree_value));
3492 preserve_temp_slots (arg->save_area);
3493 emit_block_move (validize_mem (arg->save_area), stack_area,
3494 GEN_INT (arg->size.constant),
3495 PARM_BOUNDARY / BITS_PER_UNIT);
3499 arg->save_area = gen_reg_rtx (save_mode);
3500 emit_move_insn (arg->save_area, stack_area);
3506 /* If this isn't going to be placed on both the stack and in registers,
3507 set up the register and number of words. */
3508 if (! arg->pass_on_stack)
3509 reg = arg->reg, partial = arg->partial;
3511 if (reg != 0 && partial == 0)
3512 /* Being passed entirely in a register. We shouldn't be called in
3516 /* If this arg needs special alignment, don't load the registers
3518 if (arg->n_aligned_regs != 0)
3521 /* If this is being passed partially in a register, we can't evaluate
3522 it directly into its stack slot. Otherwise, we can. */
3523 if (arg->value == 0)
3525 #ifdef ACCUMULATE_OUTGOING_ARGS
3526 /* stack_arg_under_construction is nonzero if a function argument is
3527 being evaluated directly into the outgoing argument list and
3528 expand_call must take special action to preserve the argument list
3529 if it is called recursively.
3531 For scalar function arguments stack_usage_map is sufficient to
3532 determine which stack slots must be saved and restored. Scalar
3533 arguments in general have pass_on_stack == 0.
3535 If this argument is initialized by a function which takes the
3536 address of the argument (a C++ constructor or a C function
3537 returning a BLKmode structure), then stack_usage_map is
3538 insufficient and expand_call must push the stack around the
3539 function call. Such arguments have pass_on_stack == 1.
3541 Note that it is always safe to set stack_arg_under_construction,
3542 but this generates suboptimal code if set when not needed. */
3544 if (arg->pass_on_stack)
3545 stack_arg_under_construction++;
3547 arg->value = expand_expr (pval,
3549 || TYPE_MODE (TREE_TYPE (pval)) != arg->mode)
3550 ? NULL_RTX : arg->stack,
3553 /* If we are promoting object (or for any other reason) the mode
3554 doesn't agree, convert the mode. */
3556 if (arg->mode != TYPE_MODE (TREE_TYPE (pval)))
3557 arg->value = convert_modes (arg->mode, TYPE_MODE (TREE_TYPE (pval)),
3558 arg->value, arg->unsignedp);
3560 #ifdef ACCUMULATE_OUTGOING_ARGS
3561 if (arg->pass_on_stack)
3562 stack_arg_under_construction--;
3566 /* Don't allow anything left on stack from computation
3567 of argument to alloca. */
3569 do_pending_stack_adjust ();
3571 if (arg->value == arg->stack)
3573 /* If the value is already in the stack slot, we are done. */
3574 if (flag_check_memory_usage && GET_CODE (arg->stack) == MEM)
3576 if (arg->mode == BLKmode)
3579 emit_library_call (chkr_set_right_libfunc, 1, VOIDmode, 3,
3580 XEXP (arg->stack, 0), ptr_mode,
3581 GEN_INT (GET_MODE_SIZE (arg->mode)),
3582 TYPE_MODE (sizetype),
3583 GEN_INT (MEMORY_USE_RW),
3584 TYPE_MODE (integer_type_node));
3587 else if (arg->mode != BLKmode)
3591 /* Argument is a scalar, not entirely passed in registers.
3592 (If part is passed in registers, arg->partial says how much
3593 and emit_push_insn will take care of putting it there.)
3595 Push it, and if its size is less than the
3596 amount of space allocated to it,
3597 also bump stack pointer by the additional space.
3598 Note that in C the default argument promotions
3599 will prevent such mismatches. */
3601 size = GET_MODE_SIZE (arg->mode);
3602 /* Compute how much space the push instruction will push.
3603 On many machines, pushing a byte will advance the stack
3604 pointer by a halfword. */
3605 #ifdef PUSH_ROUNDING
3606 size = PUSH_ROUNDING (size);
3610 /* Compute how much space the argument should get:
3611 round up to a multiple of the alignment for arguments. */
3612 if (none != FUNCTION_ARG_PADDING (arg->mode, TREE_TYPE (pval)))
3613 used = (((size + PARM_BOUNDARY / BITS_PER_UNIT - 1)
3614 / (PARM_BOUNDARY / BITS_PER_UNIT))
3615 * (PARM_BOUNDARY / BITS_PER_UNIT));
3617 /* This isn't already where we want it on the stack, so put it there.
3618 This can either be done with push or copy insns. */
3619 emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), NULL_RTX,
3620 0, partial, reg, used - size,
3621 argblock, ARGS_SIZE_RTX (arg->offset));
3625 /* BLKmode, at least partly to be pushed. */
3627 register int excess;
3630 /* Pushing a nonscalar.
3631 If part is passed in registers, PARTIAL says how much
3632 and emit_push_insn will take care of putting it there. */
3634 /* Round its size up to a multiple
3635 of the allocation unit for arguments. */
3637 if (arg->size.var != 0)
3640 size_rtx = ARGS_SIZE_RTX (arg->size);
3644 /* PUSH_ROUNDING has no effect on us, because
3645 emit_push_insn for BLKmode is careful to avoid it. */
3646 excess = (arg->size.constant - int_size_in_bytes (TREE_TYPE (pval))
3647 + partial * UNITS_PER_WORD);
3648 size_rtx = expr_size (pval);
3651 emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), size_rtx,
3652 TYPE_ALIGN (TREE_TYPE (pval)) / BITS_PER_UNIT, partial,
3653 reg, excess, argblock, ARGS_SIZE_RTX (arg->offset));
3657 /* Unless this is a partially-in-register argument, the argument is now
3660 ??? Note that this can change arg->value from arg->stack to
3661 arg->stack_slot and it matters when they are not the same.
3662 It isn't totally clear that this is correct in all cases. */
3664 arg->value = arg->stack_slot;
3666 /* Once we have pushed something, pops can't safely
3667 be deferred during the rest of the arguments. */
3670 /* ANSI doesn't require a sequence point here,
3671 but PCC has one, so this will avoid some problems. */
3674 /* Free any temporary slots made in processing this argument. Show
3675 that we might have taken the address of something and pushed that
3677 preserve_temp_slots (NULL_RTX);
3681 #ifdef ACCUMULATE_OUTGOING_ARGS
3682 /* Now mark the segment we just used. */
3683 if (argblock && ! variable_size && arg->stack)
3684 for (i = lower_bound; i < upper_bound; i++)
3685 stack_usage_map[i] = 1;