1 /* Convert function calls to rtl insns, for GNU C compiler.
2 Copyright (C) 1989, 1992, 1993, 1994 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, 675 Mass Ave, Cambridge, MA 02139, USA. */
30 #include "insn-flags.h"
32 /* Decide whether a function's arguments should be processed
33 from first to last or from last to first.
35 They should if the stack and args grow in opposite directions, but
36 only if we have push insns. */
40 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
41 #define PUSH_ARGS_REVERSED /* If it's last to first */
46 /* Like STACK_BOUNDARY but in units of bytes, not bits. */
47 #define STACK_BYTES (STACK_BOUNDARY / BITS_PER_UNIT)
49 /* Data structure and subroutines used within expand_call. */
53 /* Tree node for this argument. */
55 /* Mode for value; TYPE_MODE unless promoted. */
56 enum machine_mode mode
;
57 /* Current RTL value for argument, or 0 if it isn't precomputed. */
59 /* Initially-compute RTL value for argument; only for const functions. */
61 /* Register to pass this argument in, 0 if passed on stack, or an
62 EXPR_LIST if the arg is to be copied into multiple different
65 /* If REG was promoted from the actual mode of the argument expression,
66 indicates whether the promotion is sign- or zero-extended. */
68 /* Number of registers to use. 0 means put the whole arg in registers.
69 Also 0 if not passed in registers. */
71 /* Non-zero if argument must be passed on stack.
72 Note that some arguments may be passed on the stack
73 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
74 pass_on_stack identifies arguments that *cannot* go in registers. */
76 /* Offset of this argument from beginning of stack-args. */
77 struct args_size offset
;
78 /* Similar, but offset to the start of the stack slot. Different from
79 OFFSET if this arg pads downward. */
80 struct args_size slot_offset
;
81 /* Size of this argument on the stack, rounded up for any padding it gets,
82 parts of the argument passed in registers do not count.
83 If REG_PARM_STACK_SPACE is defined, then register parms
84 are counted here as well. */
85 struct args_size size
;
86 /* Location on the stack at which parameter should be stored. The store
87 has already been done if STACK == VALUE. */
89 /* Location on the stack of the start of this argument slot. This can
90 differ from STACK if this arg pads downward. This location is known
91 to be aligned to FUNCTION_ARG_BOUNDARY. */
93 #ifdef ACCUMULATE_OUTGOING_ARGS
94 /* Place that this stack area has been saved, if needed. */
97 #ifdef STRICT_ALIGNMENT
98 /* If an argument's alignment does not permit direct copying into registers,
99 copy in smaller-sized pieces into pseudos. These are stored in a
100 block pointed to by this field. The next field says how many
101 word-sized pseudos we made. */
107 #ifdef ACCUMULATE_OUTGOING_ARGS
108 /* A vector of one char per byte of stack space. A byte if non-zero if
109 the corresponding stack location has been used.
110 This vector is used to prevent a function call within an argument from
111 clobbering any stack already set up. */
112 static char *stack_usage_map
;
114 /* Size of STACK_USAGE_MAP. */
115 static int highest_outgoing_arg_in_use
;
117 /* stack_arg_under_construction is nonzero when an argument may be
118 initialized with a constructor call (including a C function that
119 returns a BLKmode struct) and expand_call must take special action
120 to make sure the object being constructed does not overlap the
121 argument list for the constructor call. */
122 int stack_arg_under_construction
;
125 static int calls_function
PROTO((tree
, int));
126 static int calls_function_1
PROTO((tree
, int));
127 static void emit_call_1
PROTO((rtx
, tree
, int, int, rtx
, rtx
, int,
129 static void store_one_arg
PROTO ((struct arg_data
*, rtx
, int, int,
132 /* If WHICH is 1, return 1 if EXP contains a call to the built-in function
135 If WHICH is 0, return 1 if EXP contains a call to any function.
136 Actually, we only need return 1 if evaluating EXP would require pushing
137 arguments on the stack, but that is too difficult to compute, so we just
138 assume any function call might require the stack. */
140 static tree calls_function_save_exprs
;
143 calls_function (exp
, which
)
148 calls_function_save_exprs
= 0;
149 val
= calls_function_1 (exp
, which
);
150 calls_function_save_exprs
= 0;
155 calls_function_1 (exp
, which
)
160 enum tree_code code
= TREE_CODE (exp
);
161 int type
= TREE_CODE_CLASS (code
);
162 int length
= tree_code_length
[(int) code
];
164 /* If this code is langauge-specific, we don't know what it will do. */
165 if ((int) code
>= NUM_TREE_CODES
)
168 /* Only expressions and references can contain calls. */
169 if (type
!= 'e' && type
!= '<' && type
!= '1' && type
!= '2' && type
!= 'r'
178 else if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
179 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
182 tree fndecl
= TREE_OPERAND (TREE_OPERAND (exp
, 0), 0);
184 if ((DECL_BUILT_IN (fndecl
)
185 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_ALLOCA
)
186 || (DECL_SAVED_INSNS (fndecl
)
187 && (FUNCTION_FLAGS (DECL_SAVED_INSNS (fndecl
))
188 & FUNCTION_FLAGS_CALLS_ALLOCA
)))
192 /* Third operand is RTL. */
197 if (SAVE_EXPR_RTL (exp
) != 0)
199 if (value_member (exp
, calls_function_save_exprs
))
201 calls_function_save_exprs
= tree_cons (NULL_TREE
, exp
,
202 calls_function_save_exprs
);
203 return (TREE_OPERAND (exp
, 0) != 0
204 && calls_function_1 (TREE_OPERAND (exp
, 0), which
));
210 for (local
= BLOCK_VARS (exp
); local
; local
= TREE_CHAIN (local
))
211 if (DECL_INITIAL (local
) != 0
212 && calls_function_1 (DECL_INITIAL (local
), which
))
216 register tree subblock
;
218 for (subblock
= BLOCK_SUBBLOCKS (exp
);
220 subblock
= TREE_CHAIN (subblock
))
221 if (calls_function_1 (subblock
, which
))
226 case METHOD_CALL_EXPR
:
230 case WITH_CLEANUP_EXPR
:
238 for (i
= 0; i
< length
; i
++)
239 if (TREE_OPERAND (exp
, i
) != 0
240 && calls_function_1 (TREE_OPERAND (exp
, i
), which
))
246 /* Force FUNEXP into a form suitable for the address of a CALL,
247 and return that as an rtx. Also load the static chain register
248 if FNDECL is a nested function.
250 CALL_FUSAGE points to a variable holding the prospective
251 CALL_INSN_FUNCTION_USAGE information. */
254 prepare_call_address (funexp
, fndecl
, call_fusage
, reg_parm_seen
)
260 rtx static_chain_value
= 0;
262 funexp
= protect_from_queue (funexp
, 0);
265 /* Get possible static chain value for nested function in C. */
266 static_chain_value
= lookup_static_chain (fndecl
);
268 /* Make a valid memory address and copy constants thru pseudo-regs,
269 but not for a constant address if -fno-function-cse. */
270 if (GET_CODE (funexp
) != SYMBOL_REF
)
272 #ifdef SMALL_REGISTER_CLASSES
273 /* If we are using registers for parameters, force the
274 function address into a register now. */
275 reg_parm_seen
? force_not_mem (memory_address (FUNCTION_MODE
, funexp
))
278 memory_address (FUNCTION_MODE
, funexp
);
281 #ifndef NO_FUNCTION_CSE
282 if (optimize
&& ! flag_no_function_cse
)
283 #ifdef NO_RECURSIVE_FUNCTION_CSE
284 if (fndecl
!= current_function_decl
)
286 funexp
= force_reg (Pmode
, funexp
);
290 if (static_chain_value
!= 0)
292 emit_move_insn (static_chain_rtx
, static_chain_value
);
294 use_reg (call_fusage
, static_chain_rtx
);
300 /* Generate instructions to call function FUNEXP,
301 and optionally pop the results.
302 The CALL_INSN is the first insn generated.
304 FUNTYPE is the data type of the function, or, for a library call,
305 the identifier for the name of the call. This is given to the
306 macro RETURN_POPS_ARGS to determine whether this function pops its own args.
308 STACK_SIZE is the number of bytes of arguments on the stack,
309 rounded up to STACK_BOUNDARY; zero if the size is variable.
310 This is both to put into the call insn and
311 to generate explicit popping code if necessary.
313 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
314 It is zero if this call doesn't want a structure value.
316 NEXT_ARG_REG is the rtx that results from executing
317 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1)
318 just after all the args have had their registers assigned.
319 This could be whatever you like, but normally it is the first
320 arg-register beyond those used for args in this call,
321 or 0 if all the arg-registers are used in this call.
322 It is passed on to `gen_call' so you can put this info in the call insn.
324 VALREG is a hard register in which a value is returned,
325 or 0 if the call does not return a value.
327 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
328 the args to this call were processed.
329 We restore `inhibit_defer_pop' to that value.
331 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
332 denote registers used by the called function.
334 IS_CONST is true if this is a `const' call. */
337 emit_call_1 (funexp
, funtype
, stack_size
, struct_value_size
, next_arg_reg
,
338 valreg
, old_inhibit_defer_pop
, call_fusage
, is_const
)
342 int struct_value_size
;
345 int old_inhibit_defer_pop
;
349 rtx stack_size_rtx
= GEN_INT (stack_size
);
350 rtx struct_value_size_rtx
= GEN_INT (struct_value_size
);
352 int already_popped
= 0;
354 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
355 and we don't want to load it into a register as an optimization,
356 because prepare_call_address already did it if it should be done. */
357 if (GET_CODE (funexp
) != SYMBOL_REF
)
358 funexp
= memory_address (FUNCTION_MODE
, funexp
);
360 #ifndef ACCUMULATE_OUTGOING_ARGS
361 #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop)
362 if (HAVE_call_pop
&& HAVE_call_value_pop
363 && (RETURN_POPS_ARGS (funtype
, stack_size
) > 0 || stack_size
== 0))
365 rtx n_pop
= GEN_INT (RETURN_POPS_ARGS (funtype
, stack_size
));
368 /* If this subroutine pops its own args, record that in the call insn
369 if possible, for the sake of frame pointer elimination. */
371 pat
= gen_call_value_pop (valreg
,
372 gen_rtx (MEM
, FUNCTION_MODE
, funexp
),
373 stack_size_rtx
, next_arg_reg
, n_pop
);
375 pat
= gen_call_pop (gen_rtx (MEM
, FUNCTION_MODE
, funexp
),
376 stack_size_rtx
, next_arg_reg
, n_pop
);
378 emit_call_insn (pat
);
385 #if defined (HAVE_call) && defined (HAVE_call_value)
386 if (HAVE_call
&& HAVE_call_value
)
389 emit_call_insn (gen_call_value (valreg
,
390 gen_rtx (MEM
, FUNCTION_MODE
, funexp
),
391 stack_size_rtx
, next_arg_reg
,
394 emit_call_insn (gen_call (gen_rtx (MEM
, FUNCTION_MODE
, funexp
),
395 stack_size_rtx
, next_arg_reg
,
396 struct_value_size_rtx
));
402 /* Find the CALL insn we just emitted. */
403 for (call_insn
= get_last_insn ();
404 call_insn
&& GET_CODE (call_insn
) != CALL_INSN
;
405 call_insn
= PREV_INSN (call_insn
))
411 /* Put the register usage information on the CALL. If there is already
412 some usage information, put ours at the end. */
413 if (CALL_INSN_FUNCTION_USAGE (call_insn
))
417 for (link
= CALL_INSN_FUNCTION_USAGE (call_insn
); XEXP (link
, 1) != 0;
418 link
= XEXP (link
, 1))
421 XEXP (link
, 1) = call_fusage
;
424 CALL_INSN_FUNCTION_USAGE (call_insn
) = call_fusage
;
426 /* If this is a const call, then set the insn's unchanging bit. */
428 CONST_CALL_P (call_insn
) = 1;
430 /* Restore this now, so that we do defer pops for this call's args
431 if the context of the call as a whole permits. */
432 inhibit_defer_pop
= old_inhibit_defer_pop
;
434 #ifndef ACCUMULATE_OUTGOING_ARGS
435 /* If returning from the subroutine does not automatically pop the args,
436 we need an instruction to pop them sooner or later.
437 Perhaps do it now; perhaps just record how much space to pop later.
439 If returning from the subroutine does pop the args, indicate that the
440 stack pointer will be changed. */
442 if (stack_size
!= 0 && RETURN_POPS_ARGS (funtype
, stack_size
) > 0)
445 CALL_INSN_FUNCTION_USAGE (call_insn
) =
446 gen_rtx (EXPR_LIST
, CLOBBER
, stack_pointer_rtx
,
447 CALL_INSN_FUNCTION_USAGE (call_insn
));
448 stack_size
-= RETURN_POPS_ARGS (funtype
, stack_size
);
449 stack_size_rtx
= GEN_INT (stack_size
);
454 if (flag_defer_pop
&& inhibit_defer_pop
== 0 && !is_const
)
455 pending_stack_adjust
+= stack_size
;
457 adjust_stack (stack_size_rtx
);
462 /* Generate all the code for a function call
463 and return an rtx for its value.
464 Store the value in TARGET (specified as an rtx) if convenient.
465 If the value is stored in TARGET then TARGET is returned.
466 If IGNORE is nonzero, then we ignore the value of the function call. */
469 expand_call (exp
, target
, ignore
)
474 /* List of actual parameters. */
475 tree actparms
= TREE_OPERAND (exp
, 1);
476 /* RTX for the function to be called. */
478 /* Tree node for the function to be called (not the address!). */
480 /* Data type of the function. */
482 /* Declaration of the function being called,
483 or 0 if the function is computed (not known by name). */
487 /* Register in which non-BLKmode value will be returned,
488 or 0 if no value or if value is BLKmode. */
490 /* Address where we should return a BLKmode value;
491 0 if value not BLKmode. */
492 rtx structure_value_addr
= 0;
493 /* Nonzero if that address is being passed by treating it as
494 an extra, implicit first parameter. Otherwise,
495 it is passed by being copied directly into struct_value_rtx. */
496 int structure_value_addr_parm
= 0;
497 /* Size of aggregate value wanted, or zero if none wanted
498 or if we are using the non-reentrant PCC calling convention
499 or expecting the value in registers. */
500 int struct_value_size
= 0;
501 /* Nonzero if called function returns an aggregate in memory PCC style,
502 by returning the address of where to find it. */
503 int pcc_struct_value
= 0;
505 /* Number of actual parameters in this call, including struct value addr. */
507 /* Number of named args. Args after this are anonymous ones
508 and they must all go on the stack. */
510 /* Count arg position in order args appear. */
513 /* Vector of information about each argument.
514 Arguments are numbered in the order they will be pushed,
515 not the order they are written. */
516 struct arg_data
*args
;
518 /* Total size in bytes of all the stack-parms scanned so far. */
519 struct args_size args_size
;
520 /* Size of arguments before any adjustments (such as rounding). */
521 struct args_size original_args_size
;
522 /* Data on reg parms scanned so far. */
523 CUMULATIVE_ARGS args_so_far
;
524 /* Nonzero if a reg parm has been scanned. */
526 /* Nonzero if this is an indirect function call. */
527 int current_call_is_indirect
= 0;
529 /* Nonzero if we must avoid push-insns in the args for this call.
530 If stack space is allocated for register parameters, but not by the
531 caller, then it is preallocated in the fixed part of the stack frame.
532 So the entire argument block must then be preallocated (i.e., we
533 ignore PUSH_ROUNDING in that case). */
535 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
536 int must_preallocate
= 1;
539 int must_preallocate
= 0;
541 int must_preallocate
= 1;
545 /* Size of the stack reserved for parameter registers. */
546 int reg_parm_stack_space
= 0;
548 /* 1 if scanning parms front to back, -1 if scanning back to front. */
550 /* Address of space preallocated for stack parms
551 (on machines that lack push insns), or 0 if space not preallocated. */
554 /* Nonzero if it is plausible that this is a call to alloca. */
556 /* Nonzero if this is a call to setjmp or a related function. */
558 /* Nonzero if this is a call to `longjmp'. */
560 /* Nonzero if this is a call to an inline function. */
561 int is_integrable
= 0;
562 /* Nonzero if this is a call to a `const' function.
563 Note that only explicitly named functions are handled as `const' here. */
565 /* Nonzero if this is a call to a `volatile' function. */
567 #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE)
568 /* Define the boundary of the register parm stack space that needs to be
570 int low_to_save
= -1, high_to_save
;
571 rtx save_area
= 0; /* Place that it is saved */
574 #ifdef ACCUMULATE_OUTGOING_ARGS
575 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
576 char *initial_stack_usage_map
= stack_usage_map
;
579 rtx old_stack_level
= 0;
580 int old_pending_adj
= 0;
581 int old_stack_arg_under_construction
;
582 int old_inhibit_defer_pop
= inhibit_defer_pop
;
583 tree old_cleanups
= cleanups_this_call
;
588 /* See if we can find a DECL-node for the actual function.
589 As a result, decide whether this is a call to an integrable function. */
591 p
= TREE_OPERAND (exp
, 0);
592 if (TREE_CODE (p
) == ADDR_EXPR
)
594 fndecl
= TREE_OPERAND (p
, 0);
595 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
600 && fndecl
!= current_function_decl
601 && DECL_SAVED_INSNS (fndecl
))
603 else if (! TREE_ADDRESSABLE (fndecl
))
605 /* In case this function later becomes inlinable,
606 record that there was already a non-inline call to it.
608 Use abstraction instead of setting TREE_ADDRESSABLE
610 if (DECL_INLINE (fndecl
) && warn_inline
&& !flag_no_inline
)
611 warning_with_decl (fndecl
, "can't inline call to `%s'");
612 mark_addressable (fndecl
);
615 if (TREE_READONLY (fndecl
) && ! TREE_THIS_VOLATILE (fndecl
)
616 && TYPE_MODE (TREE_TYPE (exp
)) != VOIDmode
)
619 if (TREE_THIS_VOLATILE (fndecl
))
624 /* If we don't have specific function to call, see if we have a
625 constant or `noreturn' function from the type. */
628 is_const
= TREE_READONLY (TREE_TYPE (TREE_TYPE (p
)));
629 is_volatile
= TREE_THIS_VOLATILE (TREE_TYPE (TREE_TYPE (p
)));
632 #ifdef REG_PARM_STACK_SPACE
633 #ifdef MAYBE_REG_PARM_STACK_SPACE
634 reg_parm_stack_space
= MAYBE_REG_PARM_STACK_SPACE
;
636 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
640 /* Warn if this value is an aggregate type,
641 regardless of which calling convention we are using for it. */
642 if (warn_aggregate_return
&& AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
643 warning ("function call has aggregate value");
645 /* Set up a place to return a structure. */
647 /* Cater to broken compilers. */
648 if (aggregate_value_p (exp
))
650 /* This call returns a big structure. */
653 #ifdef PCC_STATIC_STRUCT_RETURN
655 pcc_struct_value
= 1;
656 /* Easier than making that case work right. */
659 /* In case this is a static function, note that it has been
661 if (! TREE_ADDRESSABLE (fndecl
))
662 mark_addressable (fndecl
);
666 #else /* not PCC_STATIC_STRUCT_RETURN */
668 struct_value_size
= int_size_in_bytes (TREE_TYPE (exp
));
670 if (struct_value_size
< 0)
673 if (target
&& GET_CODE (target
) == MEM
)
674 structure_value_addr
= XEXP (target
, 0);
677 /* Assign a temporary on the stack to hold the value. */
679 /* For variable-sized objects, we must be called with a target
680 specified. If we were to allocate space on the stack here,
681 we would have no way of knowing when to free it. */
684 = XEXP (assign_stack_temp (BLKmode
, struct_value_size
, 1), 0);
688 #endif /* not PCC_STATIC_STRUCT_RETURN */
691 /* If called function is inline, try to integrate it. */
696 rtx before_call
= get_last_insn ();
698 temp
= expand_inline_function (fndecl
, actparms
, target
,
699 ignore
, TREE_TYPE (exp
),
700 structure_value_addr
);
702 /* If inlining succeeded, return. */
703 if ((HOST_WIDE_INT
) temp
!= -1)
705 if (flag_short_temps
)
707 /* Perform all cleanups needed for the arguments of this
708 call (i.e. destructors in C++). It is ok if these
709 destructors clobber RETURN_VALUE_REG, because the
710 only time we care about this is when TARGET is that
711 register. But in C++, we take care to never return
712 that register directly. */
713 expand_cleanups_to (old_cleanups
);
716 #ifdef ACCUMULATE_OUTGOING_ARGS
717 /* If the outgoing argument list must be preserved, push
718 the stack before executing the inlined function if it
721 for (i
= reg_parm_stack_space
- 1; i
>= 0; i
--)
722 if (i
< highest_outgoing_arg_in_use
&& stack_usage_map
[i
] != 0)
725 if (stack_arg_under_construction
|| i
>= 0)
727 rtx insn
= NEXT_INSN (before_call
), seq
;
729 /* Look for a call in the inline function code.
730 If OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl)) is
731 nonzero then there is a call and it is not necessary
732 to scan the insns. */
734 if (OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl
)) == 0)
735 for (; insn
; insn
= NEXT_INSN (insn
))
736 if (GET_CODE (insn
) == CALL_INSN
)
741 /* Reserve enough stack space so that the largest
742 argument list of any function call in the inline
743 function does not overlap the argument list being
744 evaluated. This is usually an overestimate because
745 allocate_dynamic_stack_space reserves space for an
746 outgoing argument list in addition to the requested
747 space, but there is no way to ask for stack space such
748 that an argument list of a certain length can be
749 safely constructed. */
751 int adjust
= OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl
));
752 #ifdef REG_PARM_STACK_SPACE
753 /* Add the stack space reserved for register arguments
754 in the inline function. What is really needed is the
755 largest value of reg_parm_stack_space in the inline
756 function, but that is not available. Using the current
757 value of reg_parm_stack_space is wrong, but gives
758 correct results on all supported machines. */
759 adjust
+= reg_parm_stack_space
;
762 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
763 allocate_dynamic_stack_space (GEN_INT (adjust
),
764 NULL_RTX
, BITS_PER_UNIT
);
767 emit_insns_before (seq
, NEXT_INSN (before_call
));
768 emit_stack_restore (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
773 /* If the result is equivalent to TARGET, return TARGET to simplify
774 checks in store_expr. They can be equivalent but not equal in the
775 case of a function that returns BLKmode. */
776 if (temp
!= target
&& rtx_equal_p (temp
, target
))
781 /* If inlining failed, mark FNDECL as needing to be compiled
782 separately after all. If function was declared inline,
784 if (DECL_INLINE (fndecl
) && warn_inline
&& !flag_no_inline
785 && ! TREE_ADDRESSABLE (fndecl
))
786 warning_with_decl (fndecl
, "can't inline call to `%s'");
787 mark_addressable (fndecl
);
790 /* When calling a const function, we must pop the stack args right away,
791 so that the pop is deleted or moved with the call. */
795 function_call_count
++;
797 if (fndecl
&& DECL_NAME (fndecl
))
798 name
= IDENTIFIER_POINTER (DECL_NAME (fndecl
));
800 /* On some machines (such as the PA) indirect calls have a different
801 calling convention than normal calls. FUNCTION_ARG in the target
802 description can look at current_call_is_indirect to determine which
803 calling convention to use. */
804 current_call_is_indirect
= (fndecl
== 0);
806 = TREE_CODE (TREE_OPERAND (exp
, 0)) == NON_LVALUE_EXPR
? 1 : 0;
810 /* Unless it's a call to a specific function that isn't alloca,
811 if it has one argument, we must assume it might be alloca. */
814 (!(fndecl
!= 0 && strcmp (name
, "alloca"))
816 && TREE_CHAIN (actparms
) == 0);
818 /* We assume that alloca will always be called by name. It
819 makes no sense to pass it as a pointer-to-function to
820 anything that does not understand its behavior. */
822 (name
&& ((IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 6
824 && ! strcmp (name
, "alloca"))
825 || (IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 16
827 && ! strcmp (name
, "__builtin_alloca"))));
830 /* See if this is a call to a function that can return more than once
831 or a call to longjmp. */
836 if (name
!= 0 && IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) <= 15)
840 /* Disregard prefix _, __ or __x. */
843 if (name
[1] == '_' && name
[2] == 'x')
845 else if (name
[1] == '_')
855 && (! strcmp (tname
, "setjmp")
856 || ! strcmp (tname
, "setjmp_syscall")))
858 && ! strcmp (tname
, "sigsetjmp"))
860 && ! strcmp (tname
, "savectx")));
862 && ! strcmp (tname
, "siglongjmp"))
865 else if ((tname
[0] == 'q' && tname
[1] == 's'
866 && ! strcmp (tname
, "qsetjmp"))
867 || (tname
[0] == 'v' && tname
[1] == 'f'
868 && ! strcmp (tname
, "vfork")))
871 else if (tname
[0] == 'l' && tname
[1] == 'o'
872 && ! strcmp (tname
, "longjmp"))
877 current_function_calls_alloca
= 1;
879 /* Don't let pending stack adjusts add up to too much.
880 Also, do all pending adjustments now
881 if there is any chance this might be a call to alloca. */
883 if (pending_stack_adjust
>= 32
884 || (pending_stack_adjust
> 0 && may_be_alloca
))
885 do_pending_stack_adjust ();
887 /* Operand 0 is a pointer-to-function; get the type of the function. */
888 funtype
= TREE_TYPE (TREE_OPERAND (exp
, 0));
889 if (TREE_CODE (funtype
) != POINTER_TYPE
)
891 funtype
= TREE_TYPE (funtype
);
893 /* Push the temporary stack slot level so that we can free any temporaries
897 /* Start updating where the next arg would go. */
898 INIT_CUMULATIVE_ARGS (args_so_far
, funtype
, NULL_RTX
);
900 /* If struct_value_rtx is 0, it means pass the address
901 as if it were an extra parameter. */
902 if (structure_value_addr
&& struct_value_rtx
== 0)
904 #ifdef ACCUMULATE_OUTGOING_ARGS
905 /* If the stack will be adjusted, make sure the structure address
906 does not refer to virtual_outgoing_args_rtx. */
907 rtx temp
= (stack_arg_under_construction
908 ? copy_addr_to_reg (structure_value_addr
)
909 : force_reg (Pmode
, structure_value_addr
));
911 rtx temp
= force_reg (Pmode
, structure_value_addr
);
915 = tree_cons (error_mark_node
,
916 make_tree (build_pointer_type (TREE_TYPE (funtype
)),
919 structure_value_addr_parm
= 1;
922 /* Count the arguments and set NUM_ACTUALS. */
923 for (p
= actparms
, i
= 0; p
; p
= TREE_CHAIN (p
)) i
++;
926 /* Compute number of named args.
927 Normally, don't include the last named arg if anonymous args follow.
928 (If no anonymous args follow, the result of list_length
929 is actually one too large.)
931 If SETUP_INCOMING_VARARGS is defined, this machine will be able to
932 place unnamed args that were passed in registers into the stack. So
933 treat all args as named. This allows the insns emitting for a specific
934 argument list to be independent of the function declaration.
936 If SETUP_INCOMING_VARARGS is not defined, we do not have any reliable
937 way to pass unnamed args in registers, so we must force them into
939 #ifndef SETUP_INCOMING_VARARGS
940 if (TYPE_ARG_TYPES (funtype
) != 0)
942 = list_length (TYPE_ARG_TYPES (funtype
)) - 1
943 /* Count the struct value address, if it is passed as a parm. */
944 + structure_value_addr_parm
;
947 /* If we know nothing, treat all args as named. */
948 n_named_args
= num_actuals
;
950 /* Make a vector to hold all the information about each arg. */
951 args
= (struct arg_data
*) alloca (num_actuals
* sizeof (struct arg_data
));
952 bzero ((char *) args
, num_actuals
* sizeof (struct arg_data
));
954 args_size
.constant
= 0;
957 /* In this loop, we consider args in the order they are written.
958 We fill up ARGS from the front of from the back if necessary
959 so that in any case the first arg to be pushed ends up at the front. */
961 #ifdef PUSH_ARGS_REVERSED
962 i
= num_actuals
- 1, inc
= -1;
963 /* In this case, must reverse order of args
964 so that we compute and push the last arg first. */
969 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
970 for (p
= actparms
, argpos
= 0; p
; p
= TREE_CHAIN (p
), i
+= inc
, argpos
++)
972 tree type
= TREE_TYPE (TREE_VALUE (p
));
974 enum machine_mode mode
;
976 args
[i
].tree_value
= TREE_VALUE (p
);
978 /* Replace erroneous argument with constant zero. */
979 if (type
== error_mark_node
|| TYPE_SIZE (type
) == 0)
980 args
[i
].tree_value
= integer_zero_node
, type
= integer_type_node
;
982 /* Decide where to pass this arg.
984 args[i].reg is nonzero if all or part is passed in registers.
986 args[i].partial is nonzero if part but not all is passed in registers,
987 and the exact value says how many words are passed in registers.
989 args[i].pass_on_stack is nonzero if the argument must at least be
990 computed on the stack. It may then be loaded back into registers
991 if args[i].reg is nonzero.
993 These decisions are driven by the FUNCTION_... macros and must agree
994 with those made by function.c. */
996 /* See if this argument should be passed by invisible reference. */
997 if ((TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
998 && contains_placeholder_p (TYPE_SIZE (type
)))
999 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
1000 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far
, TYPE_MODE (type
),
1001 type
, argpos
< n_named_args
)
1005 #ifdef FUNCTION_ARG_CALLEE_COPIES
1006 if (FUNCTION_ARG_CALLEE_COPIES (args_so_far
, TYPE_MODE (type
), type
,
1007 argpos
< n_named_args
)
1008 /* If it's in a register, we must make a copy of it too. */
1009 /* ??? Is this a sufficient test? Is there a better one? */
1010 && !(TREE_CODE (args
[i
].tree_value
) == VAR_DECL
1011 && REG_P (DECL_RTL (args
[i
].tree_value
))))
1013 args
[i
].tree_value
= build1 (ADDR_EXPR
,
1014 build_pointer_type (type
),
1015 args
[i
].tree_value
);
1016 type
= build_pointer_type (type
);
1021 /* We make a copy of the object and pass the address to the
1022 function being called. */
1025 if (TYPE_SIZE (type
) == 0
1026 || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
1028 /* This is a variable-sized object. Make space on the stack
1030 rtx size_rtx
= expr_size (TREE_VALUE (p
));
1032 if (old_stack_level
== 0)
1034 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
1035 old_pending_adj
= pending_stack_adjust
;
1036 pending_stack_adjust
= 0;
1039 copy
= gen_rtx (MEM
, BLKmode
,
1040 allocate_dynamic_stack_space (size_rtx
,
1042 TYPE_ALIGN (type
)));
1046 int size
= int_size_in_bytes (type
);
1047 copy
= assign_stack_temp (TYPE_MODE (type
), size
, 1);
1050 MEM_IN_STRUCT_P (copy
) = AGGREGATE_TYPE_P (type
);
1052 store_expr (args
[i
].tree_value
, copy
, 0);
1054 args
[i
].tree_value
= build1 (ADDR_EXPR
,
1055 build_pointer_type (type
),
1056 make_tree (type
, copy
));
1057 type
= build_pointer_type (type
);
1061 mode
= TYPE_MODE (type
);
1062 unsignedp
= TREE_UNSIGNED (type
);
1064 #ifdef PROMOTE_FUNCTION_ARGS
1065 mode
= promote_mode (type
, mode
, &unsignedp
, 1);
1068 args
[i
].unsignedp
= unsignedp
;
1069 args
[i
].mode
= mode
;
1070 args
[i
].reg
= FUNCTION_ARG (args_so_far
, mode
, type
,
1071 argpos
< n_named_args
);
1072 #ifdef FUNCTION_ARG_PARTIAL_NREGS
1075 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, mode
, type
,
1076 argpos
< n_named_args
);
1079 args
[i
].pass_on_stack
= MUST_PASS_IN_STACK (mode
, type
);
1081 /* If FUNCTION_ARG returned an (expr_list (nil) FOO), it means that
1082 we are to pass this arg in the register(s) designated by FOO, but
1083 also to pass it in the stack. */
1084 if (args
[i
].reg
&& GET_CODE (args
[i
].reg
) == EXPR_LIST
1085 && XEXP (args
[i
].reg
, 0) == 0)
1086 args
[i
].pass_on_stack
= 1, args
[i
].reg
= XEXP (args
[i
].reg
, 1);
1088 /* If this is an addressable type, we must preallocate the stack
1089 since we must evaluate the object into its final location.
1091 If this is to be passed in both registers and the stack, it is simpler
1093 if (TREE_ADDRESSABLE (type
)
1094 || (args
[i
].pass_on_stack
&& args
[i
].reg
!= 0))
1095 must_preallocate
= 1;
1097 /* If this is an addressable type, we cannot pre-evaluate it. Thus,
1098 we cannot consider this function call constant. */
1099 if (TREE_ADDRESSABLE (type
))
1102 /* Compute the stack-size of this argument. */
1103 if (args
[i
].reg
== 0 || args
[i
].partial
!= 0
1104 #ifdef REG_PARM_STACK_SPACE
1105 || reg_parm_stack_space
> 0
1107 || args
[i
].pass_on_stack
)
1108 locate_and_pad_parm (mode
, type
,
1109 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1114 fndecl
, &args_size
, &args
[i
].offset
,
1117 #ifndef ARGS_GROW_DOWNWARD
1118 args
[i
].slot_offset
= args_size
;
1121 #ifndef REG_PARM_STACK_SPACE
1122 /* If a part of the arg was put into registers,
1123 don't include that part in the amount pushed. */
1124 if (! args
[i
].pass_on_stack
)
1125 args
[i
].size
.constant
-= ((args
[i
].partial
* UNITS_PER_WORD
)
1126 / (PARM_BOUNDARY
/ BITS_PER_UNIT
)
1127 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
1130 /* Update ARGS_SIZE, the total stack space for args so far. */
1132 args_size
.constant
+= args
[i
].size
.constant
;
1133 if (args
[i
].size
.var
)
1135 ADD_PARM_SIZE (args_size
, args
[i
].size
.var
);
1138 /* Since the slot offset points to the bottom of the slot,
1139 we must record it after incrementing if the args grow down. */
1140 #ifdef ARGS_GROW_DOWNWARD
1141 args
[i
].slot_offset
= args_size
;
1143 args
[i
].slot_offset
.constant
= -args_size
.constant
;
1146 SUB_PARM_SIZE (args
[i
].slot_offset
, args_size
.var
);
1150 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1151 have been used, etc. */
1153 FUNCTION_ARG_ADVANCE (args_so_far
, TYPE_MODE (type
), type
,
1154 argpos
< n_named_args
);
1157 #ifdef FINAL_REG_PARM_STACK_SPACE
1158 reg_parm_stack_space
= FINAL_REG_PARM_STACK_SPACE (args_size
.constant
,
1162 /* Compute the actual size of the argument block required. The variable
1163 and constant sizes must be combined, the size may have to be rounded,
1164 and there may be a minimum required size. */
1166 original_args_size
= args_size
;
1169 /* If this function requires a variable-sized argument list, don't try to
1170 make a cse'able block for this call. We may be able to do this
1171 eventually, but it is too complicated to keep track of what insns go
1172 in the cse'able block and which don't. */
1175 must_preallocate
= 1;
1177 args_size
.var
= ARGS_SIZE_TREE (args_size
);
1178 args_size
.constant
= 0;
1180 #ifdef STACK_BOUNDARY
1181 if (STACK_BOUNDARY
!= BITS_PER_UNIT
)
1182 args_size
.var
= round_up (args_size
.var
, STACK_BYTES
);
1185 #ifdef REG_PARM_STACK_SPACE
1186 if (reg_parm_stack_space
> 0)
1189 = size_binop (MAX_EXPR
, args_size
.var
,
1190 size_int (REG_PARM_STACK_SPACE (fndecl
)));
1192 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1193 /* The area corresponding to register parameters is not to count in
1194 the size of the block we need. So make the adjustment. */
1196 = size_binop (MINUS_EXPR
, args_size
.var
,
1197 size_int (reg_parm_stack_space
));
1204 #ifdef STACK_BOUNDARY
1205 args_size
.constant
= (((args_size
.constant
+ (STACK_BYTES
- 1))
1206 / STACK_BYTES
) * STACK_BYTES
);
1209 #ifdef REG_PARM_STACK_SPACE
1210 args_size
.constant
= MAX (args_size
.constant
,
1211 reg_parm_stack_space
);
1212 #ifdef MAYBE_REG_PARM_STACK_SPACE
1213 if (reg_parm_stack_space
== 0)
1214 args_size
.constant
= 0;
1216 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1217 args_size
.constant
-= reg_parm_stack_space
;
1222 /* See if we have or want to preallocate stack space.
1224 If we would have to push a partially-in-regs parm
1225 before other stack parms, preallocate stack space instead.
1227 If the size of some parm is not a multiple of the required stack
1228 alignment, we must preallocate.
1230 If the total size of arguments that would otherwise create a copy in
1231 a temporary (such as a CALL) is more than half the total argument list
1232 size, preallocation is faster.
1234 Another reason to preallocate is if we have a machine (like the m88k)
1235 where stack alignment is required to be maintained between every
1236 pair of insns, not just when the call is made. However, we assume here
1237 that such machines either do not have push insns (and hence preallocation
1238 would occur anyway) or the problem is taken care of with
1241 if (! must_preallocate
)
1243 int partial_seen
= 0;
1244 int copy_to_evaluate_size
= 0;
1246 for (i
= 0; i
< num_actuals
&& ! must_preallocate
; i
++)
1248 if (args
[i
].partial
> 0 && ! args
[i
].pass_on_stack
)
1250 else if (partial_seen
&& args
[i
].reg
== 0)
1251 must_preallocate
= 1;
1253 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
1254 && (TREE_CODE (args
[i
].tree_value
) == CALL_EXPR
1255 || TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
1256 || TREE_CODE (args
[i
].tree_value
) == COND_EXPR
1257 || TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
))))
1258 copy_to_evaluate_size
1259 += int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1262 if (copy_to_evaluate_size
* 2 >= args_size
.constant
1263 && args_size
.constant
> 0)
1264 must_preallocate
= 1;
1267 /* If the structure value address will reference the stack pointer, we must
1268 stabilize it. We don't need to do this if we know that we are not going
1269 to adjust the stack pointer in processing this call. */
1271 if (structure_value_addr
1272 && (reg_mentioned_p (virtual_stack_dynamic_rtx
, structure_value_addr
)
1273 || reg_mentioned_p (virtual_outgoing_args_rtx
, structure_value_addr
))
1275 #ifndef ACCUMULATE_OUTGOING_ARGS
1276 || args_size
.constant
1279 structure_value_addr
= copy_to_reg (structure_value_addr
);
1281 /* If this function call is cse'able, precompute all the parameters.
1282 Note that if the parameter is constructed into a temporary, this will
1283 cause an additional copy because the parameter will be constructed
1284 into a temporary location and then copied into the outgoing arguments.
1285 If a parameter contains a call to alloca and this function uses the
1286 stack, precompute the parameter. */
1288 /* If we preallocated the stack space, and some arguments must be passed
1289 on the stack, then we must precompute any parameter which contains a
1290 function call which will store arguments on the stack.
1291 Otherwise, evaluating the parameter may clobber previous parameters
1292 which have already been stored into the stack. */
1294 for (i
= 0; i
< num_actuals
; i
++)
1296 || ((args_size
.var
!= 0 || args_size
.constant
!= 0)
1297 && calls_function (args
[i
].tree_value
, 1))
1298 || (must_preallocate
&& (args_size
.var
!= 0 || args_size
.constant
!= 0)
1299 && calls_function (args
[i
].tree_value
, 0)))
1303 args
[i
].initial_value
= args
[i
].value
1304 = expand_expr (args
[i
].tree_value
, NULL_RTX
, VOIDmode
, 0);
1306 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) != args
[i
].mode
)
1308 = convert_modes (args
[i
].mode
,
1309 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
1310 args
[i
].value
, args
[i
].unsignedp
);
1312 preserve_temp_slots (args
[i
].value
);
1315 /* ANSI doesn't require a sequence point here,
1316 but PCC has one, so this will avoid some problems. */
1320 /* Now we are about to start emitting insns that can be deleted
1321 if a libcall is deleted. */
1325 /* If we have no actual push instructions, or shouldn't use them,
1326 make space for all args right now. */
1328 if (args_size
.var
!= 0)
1330 if (old_stack_level
== 0)
1332 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
1333 old_pending_adj
= pending_stack_adjust
;
1334 pending_stack_adjust
= 0;
1335 #ifdef ACCUMULATE_OUTGOING_ARGS
1336 /* stack_arg_under_construction says whether a stack arg is
1337 being constructed at the old stack level. Pushing the stack
1338 gets a clean outgoing argument block. */
1339 old_stack_arg_under_construction
= stack_arg_under_construction
;
1340 stack_arg_under_construction
= 0;
1343 argblock
= push_block (ARGS_SIZE_RTX (args_size
), 0, 0);
1345 else if (must_preallocate
)
1347 /* Note that we must go through the motions of allocating an argument
1348 block even if the size is zero because we may be storing args
1349 in the area reserved for register arguments, which may be part of
1351 int needed
= args_size
.constant
;
1353 #ifdef ACCUMULATE_OUTGOING_ARGS
1354 /* Store the maximum argument space used. It will be pushed by the
1357 Since the stack pointer will never be pushed, it is possible for
1358 the evaluation of a parm to clobber something we have already
1359 written to the stack. Since most function calls on RISC machines
1360 do not use the stack, this is uncommon, but must work correctly.
1362 Therefore, we save any area of the stack that was already written
1363 and that we are using. Here we set up to do this by making a new
1364 stack usage map from the old one. The actual save will be done
1367 Another approach might be to try to reorder the argument
1368 evaluations to avoid this conflicting stack usage. */
1370 if (needed
> current_function_outgoing_args_size
)
1371 current_function_outgoing_args_size
= needed
;
1373 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1374 /* Since we will be writing into the entire argument area, the
1375 map must be allocated for its entire size, not just the part that
1376 is the responsibility of the caller. */
1377 needed
+= reg_parm_stack_space
;
1380 #ifdef ARGS_GROW_DOWNWARD
1381 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
1384 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
, needed
);
1386 stack_usage_map
= (char *) alloca (highest_outgoing_arg_in_use
);
1388 if (initial_highest_arg_in_use
)
1389 bcopy (initial_stack_usage_map
, stack_usage_map
,
1390 initial_highest_arg_in_use
);
1392 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
1393 bzero (&stack_usage_map
[initial_highest_arg_in_use
],
1394 highest_outgoing_arg_in_use
- initial_highest_arg_in_use
);
1397 /* The address of the outgoing argument list must not be copied to a
1398 register here, because argblock would be left pointing to the
1399 wrong place after the call to allocate_dynamic_stack_space below. */
1401 argblock
= virtual_outgoing_args_rtx
;
1403 #else /* not ACCUMULATE_OUTGOING_ARGS */
1404 if (inhibit_defer_pop
== 0)
1406 /* Try to reuse some or all of the pending_stack_adjust
1407 to get this space. Maybe we can avoid any pushing. */
1408 if (needed
> pending_stack_adjust
)
1410 needed
-= pending_stack_adjust
;
1411 pending_stack_adjust
= 0;
1415 pending_stack_adjust
-= needed
;
1419 /* Special case this because overhead of `push_block' in this
1420 case is non-trivial. */
1422 argblock
= virtual_outgoing_args_rtx
;
1424 argblock
= push_block (GEN_INT (needed
), 0, 0);
1426 /* We only really need to call `copy_to_reg' in the case where push
1427 insns are going to be used to pass ARGBLOCK to a function
1428 call in ARGS. In that case, the stack pointer changes value
1429 from the allocation point to the call point, and hence
1430 the value of VIRTUAL_OUTGOING_ARGS_RTX changes as well.
1431 But might as well always do it. */
1432 argblock
= copy_to_reg (argblock
);
1433 #endif /* not ACCUMULATE_OUTGOING_ARGS */
1437 #ifdef ACCUMULATE_OUTGOING_ARGS
1438 /* The save/restore code in store_one_arg handles all cases except one:
1439 a constructor call (including a C function returning a BLKmode struct)
1440 to initialize an argument. */
1441 if (stack_arg_under_construction
)
1443 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1444 rtx push_size
= GEN_INT (reg_parm_stack_space
+ args_size
.constant
);
1446 rtx push_size
= GEN_INT (args_size
.constant
);
1448 if (old_stack_level
== 0)
1450 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
1451 old_pending_adj
= pending_stack_adjust
;
1452 pending_stack_adjust
= 0;
1453 /* stack_arg_under_construction says whether a stack arg is
1454 being constructed at the old stack level. Pushing the stack
1455 gets a clean outgoing argument block. */
1456 old_stack_arg_under_construction
= stack_arg_under_construction
;
1457 stack_arg_under_construction
= 0;
1458 /* Make a new map for the new argument list. */
1459 stack_usage_map
= (char *)alloca (highest_outgoing_arg_in_use
);
1460 bzero (stack_usage_map
, highest_outgoing_arg_in_use
);
1461 highest_outgoing_arg_in_use
= 0;
1463 allocate_dynamic_stack_space (push_size
, NULL_RTX
, BITS_PER_UNIT
);
1465 /* If argument evaluation might modify the stack pointer, copy the
1466 address of the argument list to a register. */
1467 for (i
= 0; i
< num_actuals
; i
++)
1468 if (args
[i
].pass_on_stack
)
1470 argblock
= copy_addr_to_reg (argblock
);
1476 /* If we preallocated stack space, compute the address of each argument.
1477 We need not ensure it is a valid memory address here; it will be
1478 validized when it is used. */
1481 rtx arg_reg
= argblock
;
1484 if (GET_CODE (argblock
) == PLUS
)
1485 arg_reg
= XEXP (argblock
, 0), arg_offset
= INTVAL (XEXP (argblock
, 1));
1487 for (i
= 0; i
< num_actuals
; i
++)
1489 rtx offset
= ARGS_SIZE_RTX (args
[i
].offset
);
1490 rtx slot_offset
= ARGS_SIZE_RTX (args
[i
].slot_offset
);
1493 /* Skip this parm if it will not be passed on the stack. */
1494 if (! args
[i
].pass_on_stack
&& args
[i
].reg
!= 0)
1497 if (GET_CODE (offset
) == CONST_INT
)
1498 addr
= plus_constant (arg_reg
, INTVAL (offset
));
1500 addr
= gen_rtx (PLUS
, Pmode
, arg_reg
, offset
);
1502 addr
= plus_constant (addr
, arg_offset
);
1503 args
[i
].stack
= gen_rtx (MEM
, args
[i
].mode
, addr
);
1504 MEM_IN_STRUCT_P (args
[i
].stack
)
1505 = AGGREGATE_TYPE_P (TREE_TYPE (args
[i
].tree_value
));
1507 if (GET_CODE (slot_offset
) == CONST_INT
)
1508 addr
= plus_constant (arg_reg
, INTVAL (slot_offset
));
1510 addr
= gen_rtx (PLUS
, Pmode
, arg_reg
, slot_offset
);
1512 addr
= plus_constant (addr
, arg_offset
);
1513 args
[i
].stack_slot
= gen_rtx (MEM
, args
[i
].mode
, addr
);
1517 #ifdef PUSH_ARGS_REVERSED
1518 #ifdef STACK_BOUNDARY
1519 /* If we push args individually in reverse order, perform stack alignment
1520 before the first push (the last arg). */
1522 anti_adjust_stack (GEN_INT (args_size
.constant
1523 - original_args_size
.constant
));
1527 /* Don't try to defer pops if preallocating, not even from the first arg,
1528 since ARGBLOCK probably refers to the SP. */
1532 /* Get the function to call, in the form of RTL. */
1535 /* If this is the first use of the function, see if we need to
1536 make an external definition for it. */
1537 if (! TREE_USED (fndecl
))
1539 assemble_external (fndecl
);
1540 TREE_USED (fndecl
) = 1;
1543 /* Get a SYMBOL_REF rtx for the function address. */
1544 funexp
= XEXP (DECL_RTL (fndecl
), 0);
1547 /* Generate an rtx (probably a pseudo-register) for the address. */
1550 funexp
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, VOIDmode
, 0);
1551 pop_temp_slots (); /* FUNEXP can't be BLKmode */
1555 /* Figure out the register where the value, if any, will come back. */
1557 if (TYPE_MODE (TREE_TYPE (exp
)) != VOIDmode
1558 && ! structure_value_addr
)
1560 if (pcc_struct_value
)
1561 valreg
= hard_function_value (build_pointer_type (TREE_TYPE (exp
)),
1564 valreg
= hard_function_value (TREE_TYPE (exp
), fndecl
);
1567 /* Precompute all register parameters. It isn't safe to compute anything
1568 once we have started filling any specific hard regs. */
1570 for (i
= 0; i
< num_actuals
; i
++)
1571 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
)
1575 if (args
[i
].value
== 0)
1578 args
[i
].value
= expand_expr (args
[i
].tree_value
, NULL_RTX
,
1580 preserve_temp_slots (args
[i
].value
);
1583 /* ANSI doesn't require a sequence point here,
1584 but PCC has one, so this will avoid some problems. */
1588 /* If we are to promote the function arg to a wider mode,
1591 if (args
[i
].mode
!= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)))
1593 = convert_modes (args
[i
].mode
,
1594 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
1595 args
[i
].value
, args
[i
].unsignedp
);
1597 /* If the value is expensive, and we are inside an appropriately
1598 short loop, put the value into a pseudo and then put the pseudo
1601 For small register classes, also do this if this call uses
1602 register parameters. This is to avoid reload conflicts while
1603 loading the parameters registers. */
1605 if ((! (GET_CODE (args
[i
].value
) == REG
1606 || (GET_CODE (args
[i
].value
) == SUBREG
1607 && GET_CODE (SUBREG_REG (args
[i
].value
)) == REG
)))
1608 && args
[i
].mode
!= BLKmode
1609 && rtx_cost (args
[i
].value
, SET
) > 2
1610 #ifdef SMALL_REGISTER_CLASSES
1611 && (reg_parm_seen
|| preserve_subexpressions_p ()))
1613 && preserve_subexpressions_p ())
1615 args
[i
].value
= copy_to_mode_reg (args
[i
].mode
, args
[i
].value
);
1618 #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE)
1619 /* The argument list is the property of the called routine and it
1620 may clobber it. If the fixed area has been used for previous
1621 parameters, we must save and restore it.
1623 Here we compute the boundary of the that needs to be saved, if any. */
1625 #ifdef ARGS_GROW_DOWNWARD
1626 for (i
= 0; i
< reg_parm_stack_space
+ 1; i
++)
1628 for (i
= 0; i
< reg_parm_stack_space
; i
++)
1631 if (i
>= highest_outgoing_arg_in_use
1632 || stack_usage_map
[i
] == 0)
1635 if (low_to_save
== -1)
1641 if (low_to_save
>= 0)
1643 int num_to_save
= high_to_save
- low_to_save
+ 1;
1644 enum machine_mode save_mode
1645 = mode_for_size (num_to_save
* BITS_PER_UNIT
, MODE_INT
, 1);
1648 /* If we don't have the required alignment, must do this in BLKmode. */
1649 if ((low_to_save
& (MIN (GET_MODE_SIZE (save_mode
),
1650 BIGGEST_ALIGNMENT
/ UNITS_PER_WORD
) - 1)))
1651 save_mode
= BLKmode
;
1653 stack_area
= gen_rtx (MEM
, save_mode
,
1654 memory_address (save_mode
,
1656 #ifdef ARGS_GROW_DOWNWARD
1657 plus_constant (argblock
,
1660 plus_constant (argblock
,
1664 if (save_mode
== BLKmode
)
1666 save_area
= assign_stack_temp (BLKmode
, num_to_save
, 1);
1667 emit_block_move (validize_mem (save_area
), stack_area
,
1668 GEN_INT (num_to_save
),
1669 PARM_BOUNDARY
/ BITS_PER_UNIT
);
1673 save_area
= gen_reg_rtx (save_mode
);
1674 emit_move_insn (save_area
, stack_area
);
1680 /* Now store (and compute if necessary) all non-register parms.
1681 These come before register parms, since they can require block-moves,
1682 which could clobber the registers used for register parms.
1683 Parms which have partial registers are not stored here,
1684 but we do preallocate space here if they want that. */
1686 for (i
= 0; i
< num_actuals
; i
++)
1687 if (args
[i
].reg
== 0 || args
[i
].pass_on_stack
)
1688 store_one_arg (&args
[i
], argblock
, may_be_alloca
,
1689 args_size
.var
!= 0, fndecl
, reg_parm_stack_space
);
1691 #ifdef STRICT_ALIGNMENT
1692 /* If we have a parm that is passed in registers but not in memory
1693 and whose alignment does not permit a direct copy into registers,
1694 make a group of pseudos that correspond to each register that we
1697 for (i
= 0; i
< num_actuals
; i
++)
1698 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
1699 && args
[i
].mode
== BLKmode
1700 && (TYPE_ALIGN (TREE_TYPE (args
[i
].tree_value
))
1701 < MIN (BIGGEST_ALIGNMENT
, BITS_PER_WORD
)))
1703 int bytes
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1704 int big_endian_correction
= 0;
1706 args
[i
].n_aligned_regs
1707 = args
[i
].partial
? args
[i
].partial
1708 : (bytes
+ (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
1710 args
[i
].aligned_regs
= (rtx
*) alloca (sizeof (rtx
)
1711 * args
[i
].n_aligned_regs
);
1713 /* Structures smaller than a word are aligned to the least signifcant
1714 byte (to the right). On a BYTES_BIG_ENDIAN machine, this means we
1715 must skip the empty high order bytes when calculating the bit
1717 if (BYTES_BIG_ENDIAN
&& bytes
< UNITS_PER_WORD
)
1718 big_endian_correction
= (BITS_PER_WORD
- (bytes
* BITS_PER_UNIT
));
1720 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1722 rtx reg
= gen_reg_rtx (word_mode
);
1723 rtx word
= operand_subword_force (args
[i
].value
, j
, BLKmode
);
1724 int bitsize
= TYPE_ALIGN (TREE_TYPE (args
[i
].tree_value
));
1727 args
[i
].aligned_regs
[j
] = reg
;
1729 /* Clobber REG and move each partword into it. Ensure we don't
1730 go past the end of the structure. Note that the loop below
1731 works because we've already verified that padding
1732 and endianness are compatible. */
1734 emit_insn (gen_rtx (CLOBBER
, VOIDmode
, reg
));
1737 bitpos
< BITS_PER_WORD
&& bytes
> 0;
1738 bitpos
+= bitsize
, bytes
-= bitsize
/ BITS_PER_UNIT
)
1740 int xbitpos
= bitpos
+ big_endian_correction
;
1742 store_bit_field (reg
, bitsize
, xbitpos
, word_mode
,
1743 extract_bit_field (word
, bitsize
, bitpos
, 1,
1744 NULL_RTX
, word_mode
,
1746 bitsize
/ BITS_PER_UNIT
,
1748 bitsize
/ BITS_PER_UNIT
, BITS_PER_WORD
);
1754 /* Now store any partially-in-registers parm.
1755 This is the last place a block-move can happen. */
1757 for (i
= 0; i
< num_actuals
; i
++)
1758 if (args
[i
].partial
!= 0 && ! args
[i
].pass_on_stack
)
1759 store_one_arg (&args
[i
], argblock
, may_be_alloca
,
1760 args_size
.var
!= 0, fndecl
, reg_parm_stack_space
);
1762 #ifndef PUSH_ARGS_REVERSED
1763 #ifdef STACK_BOUNDARY
1764 /* If we pushed args in forward order, perform stack alignment
1765 after pushing the last arg. */
1767 anti_adjust_stack (GEN_INT (args_size
.constant
1768 - original_args_size
.constant
));
1772 /* If register arguments require space on the stack and stack space
1773 was not preallocated, allocate stack space here for arguments
1774 passed in registers. */
1775 #if ! defined(ACCUMULATE_OUTGOING_ARGS) && defined(OUTGOING_REG_PARM_STACK_SPACE)
1776 if (must_preallocate
== 0 && reg_parm_stack_space
> 0)
1777 anti_adjust_stack (GEN_INT (reg_parm_stack_space
));
1780 /* Pass the function the address in which to return a structure value. */
1781 if (structure_value_addr
&& ! structure_value_addr_parm
)
1783 emit_move_insn (struct_value_rtx
,
1785 force_operand (structure_value_addr
,
1787 if (GET_CODE (struct_value_rtx
) == REG
)
1788 use_reg (&call_fusage
, struct_value_rtx
);
1791 funexp
= prepare_call_address (funexp
, fndecl
, &call_fusage
, reg_parm_seen
);
1793 /* Now do the register loads required for any wholly-register parms or any
1794 parms which are passed both on the stack and in a register. Their
1795 expressions were already evaluated.
1797 Mark all register-parms as living through the call, putting these USE
1798 insns in the CALL_INSN_FUNCTION_USAGE field. */
1800 for (i
= 0; i
< num_actuals
; i
++)
1802 rtx list
= args
[i
].reg
;
1803 int partial
= args
[i
].partial
;
1810 /* Process each register that needs to get this arg. */
1811 if (GET_CODE (list
) == EXPR_LIST
)
1812 reg
= XEXP (list
, 0), list
= XEXP (list
, 1);
1814 reg
= list
, list
= 0;
1816 /* Set to non-negative if must move a word at a time, even if just
1817 one word (e.g, partial == 1 && mode == DFmode). Set to -1 if
1818 we just use a normal move insn. This value can be zero if the
1819 argument is a zero size structure with no fields. */
1820 nregs
= (partial
? partial
1821 : (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
1822 ? ((int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
))
1823 + (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
)
1826 /* If simple case, just do move. If normal partial, store_one_arg
1827 has already loaded the register for us. In all other cases,
1828 load the register(s) from memory. */
1831 emit_move_insn (reg
, args
[i
].value
);
1833 #ifdef STRICT_ALIGNMENT
1834 /* If we have pre-computed the values to put in the registers in
1835 the case of non-aligned structures, copy them in now. */
1837 else if (args
[i
].n_aligned_regs
!= 0)
1838 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1839 emit_move_insn (gen_rtx (REG
, word_mode
, REGNO (reg
) + j
),
1840 args
[i
].aligned_regs
[j
]);
1843 else if (args
[i
].partial
== 0 || args
[i
].pass_on_stack
)
1844 move_block_to_reg (REGNO (reg
),
1845 validize_mem (args
[i
].value
), nregs
,
1849 use_reg (&call_fusage
, reg
);
1851 use_regs (&call_fusage
, REGNO (reg
), nregs
== 0 ? 1 : nregs
);
1853 /* PARTIAL referred only to the first register, so clear it for the
1859 /* Perform postincrements before actually calling the function. */
1862 /* All arguments and registers used for the call must be set up by now! */
1864 /* Generate the actual call instruction. */
1865 emit_call_1 (funexp
, funtype
, args_size
.constant
, struct_value_size
,
1866 FUNCTION_ARG (args_so_far
, VOIDmode
, void_type_node
, 1),
1867 valreg
, old_inhibit_defer_pop
, call_fusage
, is_const
);
1869 /* If call is cse'able, make appropriate pair of reg-notes around it.
1870 Test valreg so we don't crash; may safely ignore `const'
1871 if return type is void. */
1872 if (is_const
&& valreg
!= 0)
1875 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
1878 /* Construct an "equal form" for the value which mentions all the
1879 arguments in order as well as the function name. */
1880 #ifdef PUSH_ARGS_REVERSED
1881 for (i
= 0; i
< num_actuals
; i
++)
1882 note
= gen_rtx (EXPR_LIST
, VOIDmode
, args
[i
].initial_value
, note
);
1884 for (i
= num_actuals
- 1; i
>= 0; i
--)
1885 note
= gen_rtx (EXPR_LIST
, VOIDmode
, args
[i
].initial_value
, note
);
1887 note
= gen_rtx (EXPR_LIST
, VOIDmode
, funexp
, note
);
1889 insns
= get_insns ();
1892 emit_libcall_block (insns
, temp
, valreg
, note
);
1897 /* For calls to `setjmp', etc., inform flow.c it should complain
1898 if nonvolatile values are live. */
1902 emit_note (name
, NOTE_INSN_SETJMP
);
1903 current_function_calls_setjmp
= 1;
1907 current_function_calls_longjmp
= 1;
1909 /* Notice functions that cannot return.
1910 If optimizing, insns emitted below will be dead.
1911 If not optimizing, they will exist, which is useful
1912 if the user uses the `return' command in the debugger. */
1914 if (is_volatile
|| is_longjmp
)
1917 /* If value type not void, return an rtx for the value. */
1919 /* If there are cleanups to be called, don't use a hard reg as target. */
1920 if (cleanups_this_call
!= old_cleanups
1921 && target
&& REG_P (target
)
1922 && REGNO (target
) < FIRST_PSEUDO_REGISTER
)
1925 if (TYPE_MODE (TREE_TYPE (exp
)) == VOIDmode
1928 target
= const0_rtx
;
1930 else if (structure_value_addr
)
1932 if (target
== 0 || GET_CODE (target
) != MEM
)
1934 target
= gen_rtx (MEM
, TYPE_MODE (TREE_TYPE (exp
)),
1935 memory_address (TYPE_MODE (TREE_TYPE (exp
)),
1936 structure_value_addr
));
1937 MEM_IN_STRUCT_P (target
) = AGGREGATE_TYPE_P (TREE_TYPE (exp
));
1940 else if (pcc_struct_value
)
1944 /* We used leave the value in the location that it is
1945 returned in, but that causes problems if it is used more
1946 than once in one expression. Rather than trying to track
1947 when a copy is required, we always copy when TARGET is
1948 not specified. This calling sequence is only used on
1949 a few machines and TARGET is usually nonzero. */
1950 if (TYPE_MODE (TREE_TYPE (exp
)) == BLKmode
)
1952 target
= assign_stack_temp (BLKmode
,
1953 int_size_in_bytes (TREE_TYPE (exp
)),
1956 MEM_IN_STRUCT_P (target
) = AGGREGATE_TYPE_P (TREE_TYPE (exp
));
1958 /* Save this temp slot around the pop below. */
1959 preserve_temp_slots (target
);
1962 target
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp
)));
1965 if (TYPE_MODE (TREE_TYPE (exp
)) != BLKmode
)
1966 emit_move_insn (target
, gen_rtx (MEM
, TYPE_MODE (TREE_TYPE (exp
)),
1967 copy_to_reg (valreg
)));
1969 emit_block_move (target
, gen_rtx (MEM
, BLKmode
, copy_to_reg (valreg
)),
1971 TYPE_ALIGN (TREE_TYPE (exp
)) / BITS_PER_UNIT
);
1973 else if (target
&& GET_MODE (target
) == TYPE_MODE (TREE_TYPE (exp
))
1974 && GET_MODE (target
) == GET_MODE (valreg
))
1975 /* TARGET and VALREG cannot be equal at this point because the latter
1976 would not have REG_FUNCTION_VALUE_P true, while the former would if
1977 it were referring to the same register.
1979 If they refer to the same register, this move will be a no-op, except
1980 when function inlining is being done. */
1981 emit_move_insn (target
, valreg
);
1983 target
= copy_to_reg (valreg
);
1985 #ifdef PROMOTE_FUNCTION_RETURN
1986 /* If we promoted this return value, make the proper SUBREG. TARGET
1987 might be const0_rtx here, so be careful. */
1988 if (GET_CODE (target
) == REG
1989 && GET_MODE (target
) != TYPE_MODE (TREE_TYPE (exp
)))
1991 tree type
= TREE_TYPE (exp
);
1992 int unsignedp
= TREE_UNSIGNED (type
);
1994 /* If we don't promote as expected, something is wrong. */
1995 if (GET_MODE (target
)
1996 != promote_mode (type
, TYPE_MODE (type
), &unsignedp
, 1))
1999 target
= gen_rtx (SUBREG
, TYPE_MODE (type
), target
, 0);
2000 SUBREG_PROMOTED_VAR_P (target
) = 1;
2001 SUBREG_PROMOTED_UNSIGNED_P (target
) = unsignedp
;
2005 if (flag_short_temps
)
2007 /* Perform all cleanups needed for the arguments of this call
2008 (i.e. destructors in C++). */
2009 expand_cleanups_to (old_cleanups
);
2012 /* If size of args is variable or this was a constructor call for a stack
2013 argument, restore saved stack-pointer value. */
2015 if (old_stack_level
)
2017 emit_stack_restore (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
2018 pending_stack_adjust
= old_pending_adj
;
2019 #ifdef ACCUMULATE_OUTGOING_ARGS
2020 stack_arg_under_construction
= old_stack_arg_under_construction
;
2021 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
2022 stack_usage_map
= initial_stack_usage_map
;
2025 #ifdef ACCUMULATE_OUTGOING_ARGS
2028 #ifdef REG_PARM_STACK_SPACE
2031 enum machine_mode save_mode
= GET_MODE (save_area
);
2033 = gen_rtx (MEM
, save_mode
,
2034 memory_address (save_mode
,
2035 #ifdef ARGS_GROW_DOWNWARD
2036 plus_constant (argblock
, - high_to_save
)
2038 plus_constant (argblock
, low_to_save
)
2042 if (save_mode
!= BLKmode
)
2043 emit_move_insn (stack_area
, save_area
);
2045 emit_block_move (stack_area
, validize_mem (save_area
),
2046 GEN_INT (high_to_save
- low_to_save
+ 1),
2047 PARM_BOUNDARY
/ BITS_PER_UNIT
);
2051 /* If we saved any argument areas, restore them. */
2052 for (i
= 0; i
< num_actuals
; i
++)
2053 if (args
[i
].save_area
)
2055 enum machine_mode save_mode
= GET_MODE (args
[i
].save_area
);
2057 = gen_rtx (MEM
, save_mode
,
2058 memory_address (save_mode
,
2059 XEXP (args
[i
].stack_slot
, 0)));
2061 if (save_mode
!= BLKmode
)
2062 emit_move_insn (stack_area
, args
[i
].save_area
);
2064 emit_block_move (stack_area
, validize_mem (args
[i
].save_area
),
2065 GEN_INT (args
[i
].size
.constant
),
2066 PARM_BOUNDARY
/ BITS_PER_UNIT
);
2069 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
2070 stack_usage_map
= initial_stack_usage_map
;
2074 /* If this was alloca, record the new stack level for nonlocal gotos.
2075 Check for the handler slots since we might not have a save area
2076 for non-local gotos. */
2078 if (may_be_alloca
&& nonlocal_goto_handler_slot
!= 0)
2079 emit_stack_save (SAVE_NONLOCAL
, &nonlocal_goto_stack_level
, NULL_RTX
);
2086 /* Output a library call to function FUN (a SYMBOL_REF rtx)
2087 (emitting the queue unless NO_QUEUE is nonzero),
2088 for a value of mode OUTMODE,
2089 with NARGS different arguments, passed as alternating rtx values
2090 and machine_modes to convert them to.
2091 The rtx values should have been passed through protect_from_queue already.
2093 NO_QUEUE will be true if and only if the library call is a `const' call
2094 which will be enclosed in REG_LIBCALL/REG_RETVAL notes; it is equivalent
2095 to the variable is_const in expand_call.
2097 NO_QUEUE must be true for const calls, because if it isn't, then
2098 any pending increment will be emitted between REG_LIBCALL/REG_RETVAL notes,
2099 and will be lost if the libcall sequence is optimized away.
2101 NO_QUEUE must be false for non-const calls, because if it isn't, the
2102 call insn will have its CONST_CALL_P bit set, and it will be incorrectly
2103 optimized. For instance, the instruction scheduler may incorrectly
2104 move memory references across the non-const call. */
2107 emit_library_call
VPROTO((rtx orgfun
, int no_queue
, enum machine_mode outmode
,
2113 enum machine_mode outmode
;
2117 /* Total size in bytes of all the stack-parms scanned so far. */
2118 struct args_size args_size
;
2119 /* Size of arguments before any adjustments (such as rounding). */
2120 struct args_size original_args_size
;
2121 register int argnum
;
2126 CUMULATIVE_ARGS args_so_far
;
2127 struct arg
{ rtx value
; enum machine_mode mode
; rtx reg
; int partial
;
2128 struct args_size offset
; struct args_size size
; };
2130 int old_inhibit_defer_pop
= inhibit_defer_pop
;
2131 rtx call_fusage
= 0;
2132 /* library calls are never indirect calls. */
2133 int current_call_is_indirect
= 0;
2135 VA_START (p
, nargs
);
2138 orgfun
= va_arg (p
, rtx
);
2139 no_queue
= va_arg (p
, int);
2140 outmode
= va_arg (p
, enum machine_mode
);
2141 nargs
= va_arg (p
, int);
2146 /* Copy all the libcall-arguments out of the varargs data
2147 and into a vector ARGVEC.
2149 Compute how to pass each argument. We only support a very small subset
2150 of the full argument passing conventions to limit complexity here since
2151 library functions shouldn't have many args. */
2153 argvec
= (struct arg
*) alloca (nargs
* sizeof (struct arg
));
2155 INIT_CUMULATIVE_ARGS (args_so_far
, NULL_TREE
, fun
);
2157 args_size
.constant
= 0;
2162 for (count
= 0; count
< nargs
; count
++)
2164 rtx val
= va_arg (p
, rtx
);
2165 enum machine_mode mode
= va_arg (p
, enum machine_mode
);
2167 /* We cannot convert the arg value to the mode the library wants here;
2168 must do it earlier where we know the signedness of the arg. */
2170 || (GET_MODE (val
) != mode
&& GET_MODE (val
) != VOIDmode
))
2173 /* On some machines, there's no way to pass a float to a library fcn.
2174 Pass it as a double instead. */
2175 #ifdef LIBGCC_NEEDS_DOUBLE
2176 if (LIBGCC_NEEDS_DOUBLE
&& mode
== SFmode
)
2177 val
= convert_modes (DFmode
, SFmode
, val
, 0), mode
= DFmode
;
2180 /* There's no need to call protect_from_queue, because
2181 either emit_move_insn or emit_push_insn will do that. */
2183 /* Make sure it is a reasonable operand for a move or push insn. */
2184 if (GET_CODE (val
) != REG
&& GET_CODE (val
) != MEM
2185 && ! (CONSTANT_P (val
) && LEGITIMATE_CONSTANT_P (val
)))
2186 val
= force_operand (val
, NULL_RTX
);
2188 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
2189 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far
, mode
, NULL_TREE
, 1))
2191 /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can
2192 be viewed as just an efficiency improvement. */
2193 rtx slot
= assign_stack_temp (mode
, GET_MODE_SIZE (mode
), 0);
2194 emit_move_insn (slot
, val
);
2195 val
= XEXP (slot
, 0);
2200 argvec
[count
].value
= val
;
2201 argvec
[count
].mode
= mode
;
2203 argvec
[count
].reg
= FUNCTION_ARG (args_so_far
, mode
, NULL_TREE
, 1);
2204 if (argvec
[count
].reg
&& GET_CODE (argvec
[count
].reg
) == EXPR_LIST
)
2206 #ifdef FUNCTION_ARG_PARTIAL_NREGS
2207 argvec
[count
].partial
2208 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, mode
, NULL_TREE
, 1);
2210 argvec
[count
].partial
= 0;
2213 locate_and_pad_parm (mode
, NULL_TREE
,
2214 argvec
[count
].reg
&& argvec
[count
].partial
== 0,
2215 NULL_TREE
, &args_size
, &argvec
[count
].offset
,
2216 &argvec
[count
].size
);
2218 if (argvec
[count
].size
.var
)
2221 #ifndef REG_PARM_STACK_SPACE
2222 if (argvec
[count
].partial
)
2223 argvec
[count
].size
.constant
-= argvec
[count
].partial
* UNITS_PER_WORD
;
2226 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
2227 #ifdef REG_PARM_STACK_SPACE
2231 args_size
.constant
+= argvec
[count
].size
.constant
;
2233 #ifdef ACCUMULATE_OUTGOING_ARGS
2234 /* If this arg is actually passed on the stack, it might be
2235 clobbering something we already put there (this library call might
2236 be inside the evaluation of an argument to a function whose call
2237 requires the stack). This will only occur when the library call
2238 has sufficient args to run out of argument registers. Abort in
2239 this case; if this ever occurs, code must be added to save and
2240 restore the arg slot. */
2242 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0)
2246 FUNCTION_ARG_ADVANCE (args_so_far
, mode
, (tree
)0, 1);
2250 /* If this machine requires an external definition for library
2251 functions, write one out. */
2252 assemble_external_libcall (fun
);
2254 original_args_size
= args_size
;
2255 #ifdef STACK_BOUNDARY
2256 args_size
.constant
= (((args_size
.constant
+ (STACK_BYTES
- 1))
2257 / STACK_BYTES
) * STACK_BYTES
);
2260 #ifdef REG_PARM_STACK_SPACE
2261 args_size
.constant
= MAX (args_size
.constant
,
2262 REG_PARM_STACK_SPACE (NULL_TREE
));
2263 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2264 args_size
.constant
-= REG_PARM_STACK_SPACE (NULL_TREE
);
2268 #ifdef ACCUMULATE_OUTGOING_ARGS
2269 if (args_size
.constant
> current_function_outgoing_args_size
)
2270 current_function_outgoing_args_size
= args_size
.constant
;
2271 args_size
.constant
= 0;
2274 #ifndef PUSH_ROUNDING
2275 argblock
= push_block (GEN_INT (args_size
.constant
), 0, 0);
2278 #ifdef PUSH_ARGS_REVERSED
2279 #ifdef STACK_BOUNDARY
2280 /* If we push args individually in reverse order, perform stack alignment
2281 before the first push (the last arg). */
2283 anti_adjust_stack (GEN_INT (args_size
.constant
2284 - original_args_size
.constant
));
2288 #ifdef PUSH_ARGS_REVERSED
2296 /* Push the args that need to be pushed. */
2298 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
2300 register enum machine_mode mode
= argvec
[argnum
].mode
;
2301 register rtx val
= argvec
[argnum
].value
;
2302 rtx reg
= argvec
[argnum
].reg
;
2303 int partial
= argvec
[argnum
].partial
;
2305 if (! (reg
!= 0 && partial
== 0))
2306 emit_push_insn (val
, mode
, NULL_TREE
, NULL_RTX
, 0, partial
, reg
, 0,
2307 argblock
, GEN_INT (argvec
[count
].offset
.constant
));
2311 #ifndef PUSH_ARGS_REVERSED
2312 #ifdef STACK_BOUNDARY
2313 /* If we pushed args in forward order, perform stack alignment
2314 after pushing the last arg. */
2316 anti_adjust_stack (GEN_INT (args_size
.constant
2317 - original_args_size
.constant
));
2321 #ifdef PUSH_ARGS_REVERSED
2327 fun
= prepare_call_address (fun
, NULL_TREE
, &call_fusage
, 0);
2329 /* Now load any reg parms into their regs. */
2331 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
2333 register enum machine_mode mode
= argvec
[argnum
].mode
;
2334 register rtx val
= argvec
[argnum
].value
;
2335 rtx reg
= argvec
[argnum
].reg
;
2336 int partial
= argvec
[argnum
].partial
;
2338 if (reg
!= 0 && partial
== 0)
2339 emit_move_insn (reg
, val
);
2343 /* For version 1.37, try deleting this entirely. */
2347 /* Any regs containing parms remain in use through the call. */
2348 for (count
= 0; count
< nargs
; count
++)
2349 if (argvec
[count
].reg
!= 0)
2350 use_reg (&call_fusage
, argvec
[count
].reg
);
2352 /* Don't allow popping to be deferred, since then
2353 cse'ing of library calls could delete a call and leave the pop. */
2356 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
2357 will set inhibit_defer_pop to that value. */
2359 emit_call_1 (fun
, get_identifier (XSTR (orgfun
, 0)), args_size
.constant
, 0,
2360 FUNCTION_ARG (args_so_far
, VOIDmode
, void_type_node
, 1),
2361 outmode
!= VOIDmode
? hard_libcall_value (outmode
) : NULL_RTX
,
2362 old_inhibit_defer_pop
+ 1, call_fusage
, no_queue
);
2366 /* Now restore inhibit_defer_pop to its actual original value. */
2370 /* Like emit_library_call except that an extra argument, VALUE,
2371 comes second and says where to store the result.
2372 (If VALUE is zero, this function chooses a convenient way
2373 to return the value.
2375 This function returns an rtx for where the value is to be found.
2376 If VALUE is nonzero, VALUE is returned. */
2379 emit_library_call_value
VPROTO((rtx orgfun
, rtx value
, int no_queue
,
2380 enum machine_mode outmode
, int nargs
, ...))
2386 enum machine_mode outmode
;
2390 /* Total size in bytes of all the stack-parms scanned so far. */
2391 struct args_size args_size
;
2392 /* Size of arguments before any adjustments (such as rounding). */
2393 struct args_size original_args_size
;
2394 register int argnum
;
2399 CUMULATIVE_ARGS args_so_far
;
2400 struct arg
{ rtx value
; enum machine_mode mode
; rtx reg
; int partial
;
2401 struct args_size offset
; struct args_size size
; };
2403 int old_inhibit_defer_pop
= inhibit_defer_pop
;
2404 rtx call_fusage
= 0;
2406 int pcc_struct_value
= 0;
2407 int struct_value_size
= 0;
2408 /* library calls are never indirect calls. */
2409 int current_call_is_indirect
= 0;
2412 VA_START (p
, nargs
);
2415 orgfun
= va_arg (p
, rtx
);
2416 value
= va_arg (p
, rtx
);
2417 no_queue
= va_arg (p
, int);
2418 outmode
= va_arg (p
, enum machine_mode
);
2419 nargs
= va_arg (p
, int);
2422 is_const
= no_queue
;
2425 /* If this kind of value comes back in memory,
2426 decide where in memory it should come back. */
2427 if (aggregate_value_p (type_for_mode (outmode
, 0)))
2429 #ifdef PCC_STATIC_STRUCT_RETURN
2431 = hard_function_value (build_pointer_type (type_for_mode (outmode
, 0)),
2433 mem_value
= gen_rtx (MEM
, outmode
, pointer_reg
);
2434 pcc_struct_value
= 1;
2436 value
= gen_reg_rtx (outmode
);
2437 #else /* not PCC_STATIC_STRUCT_RETURN */
2438 struct_value_size
= GET_MODE_SIZE (outmode
);
2439 if (value
!= 0 && GET_CODE (value
) == MEM
)
2442 mem_value
= assign_stack_temp (outmode
, GET_MODE_SIZE (outmode
), 0);
2445 /* This call returns a big structure. */
2449 /* ??? Unfinished: must pass the memory address as an argument. */
2451 /* Copy all the libcall-arguments out of the varargs data
2452 and into a vector ARGVEC.
2454 Compute how to pass each argument. We only support a very small subset
2455 of the full argument passing conventions to limit complexity here since
2456 library functions shouldn't have many args. */
2458 argvec
= (struct arg
*) alloca ((nargs
+ 1) * sizeof (struct arg
));
2460 INIT_CUMULATIVE_ARGS (args_so_far
, NULL_TREE
, fun
);
2462 args_size
.constant
= 0;
2469 /* If there's a structure value address to be passed,
2470 either pass it in the special place, or pass it as an extra argument. */
2471 if (mem_value
&& struct_value_rtx
== 0 && ! pcc_struct_value
)
2473 rtx addr
= XEXP (mem_value
, 0);
2476 /* Make sure it is a reasonable operand for a move or push insn. */
2477 if (GET_CODE (addr
) != REG
&& GET_CODE (addr
) != MEM
2478 && ! (CONSTANT_P (addr
) && LEGITIMATE_CONSTANT_P (addr
)))
2479 addr
= force_operand (addr
, NULL_RTX
);
2481 argvec
[count
].value
= addr
;
2482 argvec
[count
].mode
= Pmode
;
2483 argvec
[count
].partial
= 0;
2485 argvec
[count
].reg
= FUNCTION_ARG (args_so_far
, Pmode
, NULL_TREE
, 1);
2486 #ifdef FUNCTION_ARG_PARTIAL_NREGS
2487 if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, Pmode
, NULL_TREE
, 1))
2491 locate_and_pad_parm (Pmode
, NULL_TREE
,
2492 argvec
[count
].reg
&& argvec
[count
].partial
== 0,
2493 NULL_TREE
, &args_size
, &argvec
[count
].offset
,
2494 &argvec
[count
].size
);
2497 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
2498 #ifdef REG_PARM_STACK_SPACE
2502 args_size
.constant
+= argvec
[count
].size
.constant
;
2504 FUNCTION_ARG_ADVANCE (args_so_far
, Pmode
, (tree
)0, 1);
2509 for (; count
< nargs
; count
++)
2511 rtx val
= va_arg (p
, rtx
);
2512 enum machine_mode mode
= va_arg (p
, enum machine_mode
);
2514 /* We cannot convert the arg value to the mode the library wants here;
2515 must do it earlier where we know the signedness of the arg. */
2517 || (GET_MODE (val
) != mode
&& GET_MODE (val
) != VOIDmode
))
2520 /* On some machines, there's no way to pass a float to a library fcn.
2521 Pass it as a double instead. */
2522 #ifdef LIBGCC_NEEDS_DOUBLE
2523 if (LIBGCC_NEEDS_DOUBLE
&& mode
== SFmode
)
2524 val
= convert_modes (DFmode
, SFmode
, val
, 0), mode
= DFmode
;
2527 /* There's no need to call protect_from_queue, because
2528 either emit_move_insn or emit_push_insn will do that. */
2530 /* Make sure it is a reasonable operand for a move or push insn. */
2531 if (GET_CODE (val
) != REG
&& GET_CODE (val
) != MEM
2532 && ! (CONSTANT_P (val
) && LEGITIMATE_CONSTANT_P (val
)))
2533 val
= force_operand (val
, NULL_RTX
);
2535 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
2536 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far
, mode
, NULL_TREE
, 1))
2538 /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can
2539 be viewed as just an efficiency improvement. */
2540 rtx slot
= assign_stack_temp (mode
, GET_MODE_SIZE (mode
), 0);
2541 emit_move_insn (slot
, val
);
2542 val
= XEXP (slot
, 0);
2547 argvec
[count
].value
= val
;
2548 argvec
[count
].mode
= mode
;
2550 argvec
[count
].reg
= FUNCTION_ARG (args_so_far
, mode
, NULL_TREE
, 1);
2551 if (argvec
[count
].reg
&& GET_CODE (argvec
[count
].reg
) == EXPR_LIST
)
2553 #ifdef FUNCTION_ARG_PARTIAL_NREGS
2554 argvec
[count
].partial
2555 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, mode
, NULL_TREE
, 1);
2557 argvec
[count
].partial
= 0;
2560 locate_and_pad_parm (mode
, NULL_TREE
,
2561 argvec
[count
].reg
&& argvec
[count
].partial
== 0,
2562 NULL_TREE
, &args_size
, &argvec
[count
].offset
,
2563 &argvec
[count
].size
);
2565 if (argvec
[count
].size
.var
)
2568 #ifndef REG_PARM_STACK_SPACE
2569 if (argvec
[count
].partial
)
2570 argvec
[count
].size
.constant
-= argvec
[count
].partial
* UNITS_PER_WORD
;
2573 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
2574 #ifdef REG_PARM_STACK_SPACE
2578 args_size
.constant
+= argvec
[count
].size
.constant
;
2580 #ifdef ACCUMULATE_OUTGOING_ARGS
2581 /* If this arg is actually passed on the stack, it might be
2582 clobbering something we already put there (this library call might
2583 be inside the evaluation of an argument to a function whose call
2584 requires the stack). This will only occur when the library call
2585 has sufficient args to run out of argument registers. Abort in
2586 this case; if this ever occurs, code must be added to save and
2587 restore the arg slot. */
2589 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0)
2593 FUNCTION_ARG_ADVANCE (args_so_far
, mode
, (tree
)0, 1);
2597 /* If this machine requires an external definition for library
2598 functions, write one out. */
2599 assemble_external_libcall (fun
);
2601 original_args_size
= args_size
;
2602 #ifdef STACK_BOUNDARY
2603 args_size
.constant
= (((args_size
.constant
+ (STACK_BYTES
- 1))
2604 / STACK_BYTES
) * STACK_BYTES
);
2607 #ifdef REG_PARM_STACK_SPACE
2608 args_size
.constant
= MAX (args_size
.constant
,
2609 REG_PARM_STACK_SPACE (NULL_TREE
));
2610 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2611 args_size
.constant
-= REG_PARM_STACK_SPACE (NULL_TREE
);
2615 #ifdef ACCUMULATE_OUTGOING_ARGS
2616 if (args_size
.constant
> current_function_outgoing_args_size
)
2617 current_function_outgoing_args_size
= args_size
.constant
;
2618 args_size
.constant
= 0;
2621 #ifndef PUSH_ROUNDING
2622 argblock
= push_block (GEN_INT (args_size
.constant
), 0, 0);
2625 #ifdef PUSH_ARGS_REVERSED
2626 #ifdef STACK_BOUNDARY
2627 /* If we push args individually in reverse order, perform stack alignment
2628 before the first push (the last arg). */
2630 anti_adjust_stack (GEN_INT (args_size
.constant
2631 - original_args_size
.constant
));
2635 #ifdef PUSH_ARGS_REVERSED
2643 /* Push the args that need to be pushed. */
2645 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
2647 register enum machine_mode mode
= argvec
[argnum
].mode
;
2648 register rtx val
= argvec
[argnum
].value
;
2649 rtx reg
= argvec
[argnum
].reg
;
2650 int partial
= argvec
[argnum
].partial
;
2652 if (! (reg
!= 0 && partial
== 0))
2653 emit_push_insn (val
, mode
, NULL_TREE
, NULL_RTX
, 0, partial
, reg
, 0,
2654 argblock
, GEN_INT (argvec
[count
].offset
.constant
));
2658 #ifndef PUSH_ARGS_REVERSED
2659 #ifdef STACK_BOUNDARY
2660 /* If we pushed args in forward order, perform stack alignment
2661 after pushing the last arg. */
2663 anti_adjust_stack (GEN_INT (args_size
.constant
2664 - original_args_size
.constant
));
2668 #ifdef PUSH_ARGS_REVERSED
2674 fun
= prepare_call_address (fun
, NULL_TREE
, &call_fusage
, 0);
2676 /* Now load any reg parms into their regs. */
2678 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
2680 register enum machine_mode mode
= argvec
[argnum
].mode
;
2681 register rtx val
= argvec
[argnum
].value
;
2682 rtx reg
= argvec
[argnum
].reg
;
2683 int partial
= argvec
[argnum
].partial
;
2685 if (reg
!= 0 && partial
== 0)
2686 emit_move_insn (reg
, val
);
2691 /* For version 1.37, try deleting this entirely. */
2696 /* Any regs containing parms remain in use through the call. */
2697 for (count
= 0; count
< nargs
; count
++)
2698 if (argvec
[count
].reg
!= 0)
2699 use_reg (&call_fusage
, argvec
[count
].reg
);
2701 /* Pass the function the address in which to return a structure value. */
2702 if (mem_value
!= 0 && struct_value_rtx
!= 0 && ! pcc_struct_value
)
2704 emit_move_insn (struct_value_rtx
,
2706 force_operand (XEXP (mem_value
, 0),
2708 if (GET_CODE (struct_value_rtx
) == REG
)
2709 use_reg (&call_fusage
, struct_value_rtx
);
2712 /* Don't allow popping to be deferred, since then
2713 cse'ing of library calls could delete a call and leave the pop. */
2716 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
2717 will set inhibit_defer_pop to that value. */
2719 emit_call_1 (fun
, get_identifier (XSTR (orgfun
, 0)), args_size
.constant
,
2721 FUNCTION_ARG (args_so_far
, VOIDmode
, void_type_node
, 1),
2722 (outmode
!= VOIDmode
&& mem_value
== 0
2723 ? hard_libcall_value (outmode
) : NULL_RTX
),
2724 old_inhibit_defer_pop
+ 1, call_fusage
, is_const
);
2726 /* Now restore inhibit_defer_pop to its actual original value. */
2731 /* Copy the value to the right place. */
2732 if (outmode
!= VOIDmode
)
2738 if (value
!= mem_value
)
2739 emit_move_insn (value
, mem_value
);
2741 else if (value
!= 0)
2742 emit_move_insn (value
, hard_libcall_value (outmode
));
2744 value
= hard_libcall_value (outmode
);
2751 /* Return an rtx which represents a suitable home on the stack
2752 given TYPE, the type of the argument looking for a home.
2753 This is called only for BLKmode arguments.
2755 SIZE is the size needed for this target.
2756 ARGS_ADDR is the address of the bottom of the argument block for this call.
2757 OFFSET describes this parameter's offset into ARGS_ADDR. It is meaningless
2758 if this machine uses push insns. */
2761 target_for_arg (type
, size
, args_addr
, offset
)
2765 struct args_size offset
;
2768 rtx offset_rtx
= ARGS_SIZE_RTX (offset
);
2770 /* We do not call memory_address if possible,
2771 because we want to address as close to the stack
2772 as possible. For non-variable sized arguments,
2773 this will be stack-pointer relative addressing. */
2774 if (GET_CODE (offset_rtx
) == CONST_INT
)
2775 target
= plus_constant (args_addr
, INTVAL (offset_rtx
));
2778 /* I have no idea how to guarantee that this
2779 will work in the presence of register parameters. */
2780 target
= gen_rtx (PLUS
, Pmode
, args_addr
, offset_rtx
);
2781 target
= memory_address (QImode
, target
);
2784 return gen_rtx (MEM
, BLKmode
, target
);
2788 /* Store a single argument for a function call
2789 into the register or memory area where it must be passed.
2790 *ARG describes the argument value and where to pass it.
2792 ARGBLOCK is the address of the stack-block for all the arguments,
2793 or 0 on a machine where arguments are pushed individually.
2795 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
2796 so must be careful about how the stack is used.
2798 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
2799 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
2800 that we need not worry about saving and restoring the stack.
2802 FNDECL is the declaration of the function we are calling. */
2805 store_one_arg (arg
, argblock
, may_be_alloca
, variable_size
, fndecl
,
2806 reg_parm_stack_space
)
2807 struct arg_data
*arg
;
2812 int reg_parm_stack_space
;
2814 register tree pval
= arg
->tree_value
;
2818 int i
, lower_bound
, upper_bound
;
2820 if (TREE_CODE (pval
) == ERROR_MARK
)
2823 /* Push a new temporary level for any temporaries we make for
2827 #ifdef ACCUMULATE_OUTGOING_ARGS
2828 /* If this is being stored into a pre-allocated, fixed-size, stack area,
2829 save any previous data at that location. */
2830 if (argblock
&& ! variable_size
&& arg
->stack
)
2832 #ifdef ARGS_GROW_DOWNWARD
2833 /* stack_slot is negative, but we want to index stack_usage_map */
2834 /* with positive values. */
2835 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
2836 upper_bound
= -INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1)) + 1;
2840 lower_bound
= upper_bound
- arg
->size
.constant
;
2842 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
2843 lower_bound
= INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1));
2847 upper_bound
= lower_bound
+ arg
->size
.constant
;
2850 for (i
= lower_bound
; i
< upper_bound
; i
++)
2851 if (stack_usage_map
[i
]
2852 #ifdef REG_PARM_STACK_SPACE
2853 /* Don't store things in the fixed argument area at this point;
2854 it has already been saved. */
2855 && i
> reg_parm_stack_space
2860 if (i
!= upper_bound
)
2862 /* We need to make a save area. See what mode we can make it. */
2863 enum machine_mode save_mode
2864 = mode_for_size (arg
->size
.constant
* BITS_PER_UNIT
, MODE_INT
, 1);
2866 = gen_rtx (MEM
, save_mode
,
2867 memory_address (save_mode
, XEXP (arg
->stack_slot
, 0)));
2869 if (save_mode
== BLKmode
)
2871 arg
->save_area
= assign_stack_temp (BLKmode
,
2872 arg
->size
.constant
, 1);
2873 preserve_temp_slots (arg
->save_area
);
2874 emit_block_move (validize_mem (arg
->save_area
), stack_area
,
2875 GEN_INT (arg
->size
.constant
),
2876 PARM_BOUNDARY
/ BITS_PER_UNIT
);
2880 arg
->save_area
= gen_reg_rtx (save_mode
);
2881 emit_move_insn (arg
->save_area
, stack_area
);
2887 /* If this isn't going to be placed on both the stack and in registers,
2888 set up the register and number of words. */
2889 if (! arg
->pass_on_stack
)
2890 reg
= arg
->reg
, partial
= arg
->partial
;
2892 if (reg
!= 0 && partial
== 0)
2893 /* Being passed entirely in a register. We shouldn't be called in
2897 #ifdef STRICT_ALIGNMENT
2898 /* If this arg needs special alignment, don't load the registers
2900 if (arg
->n_aligned_regs
!= 0)
2904 /* If this is being partially passed in a register, but multiple locations
2905 are specified, we assume that the one partially used is the one that is
2907 if (reg
&& GET_CODE (reg
) == EXPR_LIST
)
2908 reg
= XEXP (reg
, 0);
2910 /* If this is being passed partially in a register, we can't evaluate
2911 it directly into its stack slot. Otherwise, we can. */
2912 if (arg
->value
== 0)
2914 #ifdef ACCUMULATE_OUTGOING_ARGS
2915 /* stack_arg_under_construction is nonzero if a function argument is
2916 being evaluated directly into the outgoing argument list and
2917 expand_call must take special action to preserve the argument list
2918 if it is called recursively.
2920 For scalar function arguments stack_usage_map is sufficient to
2921 determine which stack slots must be saved and restored. Scalar
2922 arguments in general have pass_on_stack == 0.
2924 If this argument is initialized by a function which takes the
2925 address of the argument (a C++ constructor or a C function
2926 returning a BLKmode structure), then stack_usage_map is
2927 insufficient and expand_call must push the stack around the
2928 function call. Such arguments have pass_on_stack == 1.
2930 Note that it is always safe to set stack_arg_under_construction,
2931 but this generates suboptimal code if set when not needed. */
2933 if (arg
->pass_on_stack
)
2934 stack_arg_under_construction
++;
2936 arg
->value
= expand_expr (pval
,
2938 || TYPE_MODE (TREE_TYPE (pval
)) != arg
->mode
)
2939 ? NULL_RTX
: arg
->stack
,
2942 /* If we are promoting object (or for any other reason) the mode
2943 doesn't agree, convert the mode. */
2945 if (arg
->mode
!= TYPE_MODE (TREE_TYPE (pval
)))
2946 arg
->value
= convert_modes (arg
->mode
, TYPE_MODE (TREE_TYPE (pval
)),
2947 arg
->value
, arg
->unsignedp
);
2949 #ifdef ACCUMULATE_OUTGOING_ARGS
2950 if (arg
->pass_on_stack
)
2951 stack_arg_under_construction
--;
2955 /* Don't allow anything left on stack from computation
2956 of argument to alloca. */
2958 do_pending_stack_adjust ();
2960 if (arg
->value
== arg
->stack
)
2961 /* If the value is already in the stack slot, we are done. */
2963 else if (arg
->mode
!= BLKmode
)
2967 /* Argument is a scalar, not entirely passed in registers.
2968 (If part is passed in registers, arg->partial says how much
2969 and emit_push_insn will take care of putting it there.)
2971 Push it, and if its size is less than the
2972 amount of space allocated to it,
2973 also bump stack pointer by the additional space.
2974 Note that in C the default argument promotions
2975 will prevent such mismatches. */
2977 size
= GET_MODE_SIZE (arg
->mode
);
2978 /* Compute how much space the push instruction will push.
2979 On many machines, pushing a byte will advance the stack
2980 pointer by a halfword. */
2981 #ifdef PUSH_ROUNDING
2982 size
= PUSH_ROUNDING (size
);
2986 /* Compute how much space the argument should get:
2987 round up to a multiple of the alignment for arguments. */
2988 if (none
!= FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)))
2989 used
= (((size
+ PARM_BOUNDARY
/ BITS_PER_UNIT
- 1)
2990 / (PARM_BOUNDARY
/ BITS_PER_UNIT
))
2991 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
2993 /* This isn't already where we want it on the stack, so put it there.
2994 This can either be done with push or copy insns. */
2995 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), NULL_RTX
,
2996 0, partial
, reg
, used
- size
,
2997 argblock
, ARGS_SIZE_RTX (arg
->offset
));
3001 /* BLKmode, at least partly to be pushed. */
3003 register int excess
;
3006 /* Pushing a nonscalar.
3007 If part is passed in registers, PARTIAL says how much
3008 and emit_push_insn will take care of putting it there. */
3010 /* Round its size up to a multiple
3011 of the allocation unit for arguments. */
3013 if (arg
->size
.var
!= 0)
3016 size_rtx
= ARGS_SIZE_RTX (arg
->size
);
3020 /* PUSH_ROUNDING has no effect on us, because
3021 emit_push_insn for BLKmode is careful to avoid it. */
3022 excess
= (arg
->size
.constant
- int_size_in_bytes (TREE_TYPE (pval
))
3023 + partial
* UNITS_PER_WORD
);
3024 size_rtx
= expr_size (pval
);
3027 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), size_rtx
,
3028 TYPE_ALIGN (TREE_TYPE (pval
)) / BITS_PER_UNIT
, partial
,
3029 reg
, excess
, argblock
, ARGS_SIZE_RTX (arg
->offset
));
3033 /* Unless this is a partially-in-register argument, the argument is now
3036 ??? Note that this can change arg->value from arg->stack to
3037 arg->stack_slot and it matters when they are not the same.
3038 It isn't totally clear that this is correct in all cases. */
3040 arg
->value
= arg
->stack_slot
;
3042 /* Once we have pushed something, pops can't safely
3043 be deferred during the rest of the arguments. */
3046 /* ANSI doesn't require a sequence point here,
3047 but PCC has one, so this will avoid some problems. */
3050 /* Free any temporary slots made in processing this argument. */
3054 #ifdef ACCUMULATE_OUTGOING_ARGS
3055 /* Now mark the segment we just used. */
3056 if (argblock
&& ! variable_size
&& arg
->stack
)
3057 for (i
= lower_bound
; i
< upper_bound
; i
++)
3058 stack_usage_map
[i
] = 1;