1 /* Convert function calls to rtl insns, for GNU C compiler.
2 Copyright (C) 1989, 1992, 1993, 1994, 1995 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
, VOIDmode
,
447 gen_rtx (CLOBBER
, VOIDmode
, stack_pointer_rtx
),
448 CALL_INSN_FUNCTION_USAGE (call_insn
));
449 stack_size
-= RETURN_POPS_ARGS (funtype
, stack_size
);
450 stack_size_rtx
= GEN_INT (stack_size
);
455 if (flag_defer_pop
&& inhibit_defer_pop
== 0 && !is_const
)
456 pending_stack_adjust
+= stack_size
;
458 adjust_stack (stack_size_rtx
);
463 /* Generate all the code for a function call
464 and return an rtx for its value.
465 Store the value in TARGET (specified as an rtx) if convenient.
466 If the value is stored in TARGET then TARGET is returned.
467 If IGNORE is nonzero, then we ignore the value of the function call. */
470 expand_call (exp
, target
, ignore
)
475 /* List of actual parameters. */
476 tree actparms
= TREE_OPERAND (exp
, 1);
477 /* RTX for the function to be called. */
479 /* Tree node for the function to be called (not the address!). */
481 /* Data type of the function. */
483 /* Declaration of the function being called,
484 or 0 if the function is computed (not known by name). */
488 /* Register in which non-BLKmode value will be returned,
489 or 0 if no value or if value is BLKmode. */
491 /* Address where we should return a BLKmode value;
492 0 if value not BLKmode. */
493 rtx structure_value_addr
= 0;
494 /* Nonzero if that address is being passed by treating it as
495 an extra, implicit first parameter. Otherwise,
496 it is passed by being copied directly into struct_value_rtx. */
497 int structure_value_addr_parm
= 0;
498 /* Size of aggregate value wanted, or zero if none wanted
499 or if we are using the non-reentrant PCC calling convention
500 or expecting the value in registers. */
501 int struct_value_size
= 0;
502 /* Nonzero if called function returns an aggregate in memory PCC style,
503 by returning the address of where to find it. */
504 int pcc_struct_value
= 0;
506 /* Number of actual parameters in this call, including struct value addr. */
508 /* Number of named args. Args after this are anonymous ones
509 and they must all go on the stack. */
511 /* Count arg position in order args appear. */
514 /* Vector of information about each argument.
515 Arguments are numbered in the order they will be pushed,
516 not the order they are written. */
517 struct arg_data
*args
;
519 /* Total size in bytes of all the stack-parms scanned so far. */
520 struct args_size args_size
;
521 /* Size of arguments before any adjustments (such as rounding). */
522 struct args_size original_args_size
;
523 /* Data on reg parms scanned so far. */
524 CUMULATIVE_ARGS args_so_far
;
525 /* Nonzero if a reg parm has been scanned. */
527 /* Nonzero if this is an indirect function call. */
528 int current_call_is_indirect
= 0;
530 /* Nonzero if we must avoid push-insns in the args for this call.
531 If stack space is allocated for register parameters, but not by the
532 caller, then it is preallocated in the fixed part of the stack frame.
533 So the entire argument block must then be preallocated (i.e., we
534 ignore PUSH_ROUNDING in that case). */
536 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
537 int must_preallocate
= 1;
540 int must_preallocate
= 0;
542 int must_preallocate
= 1;
546 /* Size of the stack reserved for parameter registers. */
547 int reg_parm_stack_space
= 0;
549 /* 1 if scanning parms front to back, -1 if scanning back to front. */
551 /* Address of space preallocated for stack parms
552 (on machines that lack push insns), or 0 if space not preallocated. */
555 /* Nonzero if it is plausible that this is a call to alloca. */
557 /* Nonzero if this is a call to setjmp or a related function. */
559 /* Nonzero if this is a call to `longjmp'. */
561 /* Nonzero if this is a call to an inline function. */
562 int is_integrable
= 0;
563 /* Nonzero if this is a call to a `const' function.
564 Note that only explicitly named functions are handled as `const' here. */
566 /* Nonzero if this is a call to a `volatile' function. */
568 #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE)
569 /* Define the boundary of the register parm stack space that needs to be
571 int low_to_save
= -1, high_to_save
;
572 rtx save_area
= 0; /* Place that it is saved */
575 #ifdef ACCUMULATE_OUTGOING_ARGS
576 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
577 char *initial_stack_usage_map
= stack_usage_map
;
580 rtx old_stack_level
= 0;
581 int old_pending_adj
= 0;
582 int old_stack_arg_under_construction
;
583 int old_inhibit_defer_pop
= inhibit_defer_pop
;
584 tree old_cleanups
= cleanups_this_call
;
589 /* See if we can find a DECL-node for the actual function.
590 As a result, decide whether this is a call to an integrable function. */
592 p
= TREE_OPERAND (exp
, 0);
593 if (TREE_CODE (p
) == ADDR_EXPR
)
595 fndecl
= TREE_OPERAND (p
, 0);
596 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
601 && fndecl
!= current_function_decl
602 && DECL_INLINE (fndecl
)
603 && DECL_SAVED_INSNS (fndecl
))
605 else if (! TREE_ADDRESSABLE (fndecl
))
607 /* In case this function later becomes inlinable,
608 record that there was already a non-inline call to it.
610 Use abstraction instead of setting TREE_ADDRESSABLE
612 if (DECL_INLINE (fndecl
) && warn_inline
&& !flag_no_inline
)
613 warning_with_decl (fndecl
, "can't inline call to `%s'");
614 mark_addressable (fndecl
);
617 if (TREE_READONLY (fndecl
) && ! TREE_THIS_VOLATILE (fndecl
)
618 && TYPE_MODE (TREE_TYPE (exp
)) != VOIDmode
)
621 if (TREE_THIS_VOLATILE (fndecl
))
626 /* If we don't have specific function to call, see if we have a
627 constant or `noreturn' function from the type. */
630 is_const
= TREE_READONLY (TREE_TYPE (TREE_TYPE (p
)));
631 is_volatile
= TREE_THIS_VOLATILE (TREE_TYPE (TREE_TYPE (p
)));
634 #ifdef REG_PARM_STACK_SPACE
635 #ifdef MAYBE_REG_PARM_STACK_SPACE
636 reg_parm_stack_space
= MAYBE_REG_PARM_STACK_SPACE
;
638 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
642 /* Warn if this value is an aggregate type,
643 regardless of which calling convention we are using for it. */
644 if (warn_aggregate_return
&& AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
645 warning ("function call has aggregate value");
647 /* Set up a place to return a structure. */
649 /* Cater to broken compilers. */
650 if (aggregate_value_p (exp
))
652 /* This call returns a big structure. */
655 #ifdef PCC_STATIC_STRUCT_RETURN
657 pcc_struct_value
= 1;
658 /* Easier than making that case work right. */
661 /* In case this is a static function, note that it has been
663 if (! TREE_ADDRESSABLE (fndecl
))
664 mark_addressable (fndecl
);
668 #else /* not PCC_STATIC_STRUCT_RETURN */
670 struct_value_size
= int_size_in_bytes (TREE_TYPE (exp
));
672 if (target
&& GET_CODE (target
) == MEM
)
673 structure_value_addr
= XEXP (target
, 0);
676 /* Assign a temporary on the stack to hold the value. */
678 /* For variable-sized objects, we must be called with a target
679 specified. If we were to allocate space on the stack here,
680 we would have no way of knowing when to free it. */
682 if (struct_value_size
< 0)
686 = XEXP (assign_stack_temp (BLKmode
, struct_value_size
, 1), 0);
687 MEM_IN_STRUCT_P (structure_value_addr
)
688 = AGGREGATE_TYPE_P (TREE_TYPE (exp
));
692 #endif /* not PCC_STATIC_STRUCT_RETURN */
695 /* If called function is inline, try to integrate it. */
700 rtx before_call
= get_last_insn ();
702 temp
= expand_inline_function (fndecl
, actparms
, target
,
703 ignore
, TREE_TYPE (exp
),
704 structure_value_addr
);
706 /* If inlining succeeded, return. */
707 if ((HOST_WIDE_INT
) temp
!= -1)
709 if (flag_short_temps
)
711 /* Perform all cleanups needed for the arguments of this
712 call (i.e. destructors in C++). It is ok if these
713 destructors clobber RETURN_VALUE_REG, because the
714 only time we care about this is when TARGET is that
715 register. But in C++, we take care to never return
716 that register directly. */
717 expand_cleanups_to (old_cleanups
);
720 #ifdef ACCUMULATE_OUTGOING_ARGS
721 /* If the outgoing argument list must be preserved, push
722 the stack before executing the inlined function if it
725 for (i
= reg_parm_stack_space
- 1; i
>= 0; i
--)
726 if (i
< highest_outgoing_arg_in_use
&& stack_usage_map
[i
] != 0)
729 if (stack_arg_under_construction
|| i
>= 0)
731 rtx insn
= NEXT_INSN (before_call
), seq
;
733 /* Look for a call in the inline function code.
734 If OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl)) is
735 nonzero then there is a call and it is not necessary
736 to scan the insns. */
738 if (OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl
)) == 0)
739 for (; insn
; insn
= NEXT_INSN (insn
))
740 if (GET_CODE (insn
) == CALL_INSN
)
745 /* Reserve enough stack space so that the largest
746 argument list of any function call in the inline
747 function does not overlap the argument list being
748 evaluated. This is usually an overestimate because
749 allocate_dynamic_stack_space reserves space for an
750 outgoing argument list in addition to the requested
751 space, but there is no way to ask for stack space such
752 that an argument list of a certain length can be
753 safely constructed. */
755 int adjust
= OUTGOING_ARGS_SIZE (DECL_SAVED_INSNS (fndecl
));
756 #ifdef REG_PARM_STACK_SPACE
757 /* Add the stack space reserved for register arguments
758 in the inline function. What is really needed is the
759 largest value of reg_parm_stack_space in the inline
760 function, but that is not available. Using the current
761 value of reg_parm_stack_space is wrong, but gives
762 correct results on all supported machines. */
763 adjust
+= reg_parm_stack_space
;
766 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
767 allocate_dynamic_stack_space (GEN_INT (adjust
),
768 NULL_RTX
, BITS_PER_UNIT
);
771 emit_insns_before (seq
, NEXT_INSN (before_call
));
772 emit_stack_restore (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
777 /* If the result is equivalent to TARGET, return TARGET to simplify
778 checks in store_expr. They can be equivalent but not equal in the
779 case of a function that returns BLKmode. */
780 if (temp
!= target
&& rtx_equal_p (temp
, target
))
785 /* If inlining failed, mark FNDECL as needing to be compiled
786 separately after all. If function was declared inline,
788 if (DECL_INLINE (fndecl
) && warn_inline
&& !flag_no_inline
789 && ! TREE_ADDRESSABLE (fndecl
))
790 warning_with_decl (fndecl
, "can't inline call to `%s'");
791 mark_addressable (fndecl
);
794 /* When calling a const function, we must pop the stack args right away,
795 so that the pop is deleted or moved with the call. */
799 function_call_count
++;
801 if (fndecl
&& DECL_NAME (fndecl
))
802 name
= IDENTIFIER_POINTER (DECL_NAME (fndecl
));
804 /* On some machines (such as the PA) indirect calls have a different
805 calling convention than normal calls. FUNCTION_ARG in the target
806 description can look at current_call_is_indirect to determine which
807 calling convention to use. */
808 current_call_is_indirect
= (fndecl
== 0);
810 = TREE_CODE (TREE_OPERAND (exp
, 0)) == NON_LVALUE_EXPR
? 1 : 0;
814 /* Unless it's a call to a specific function that isn't alloca,
815 if it has one argument, we must assume it might be alloca. */
818 (!(fndecl
!= 0 && strcmp (name
, "alloca"))
820 && TREE_CHAIN (actparms
) == 0);
822 /* We assume that alloca will always be called by name. It
823 makes no sense to pass it as a pointer-to-function to
824 anything that does not understand its behavior. */
826 (name
&& ((IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 6
828 && ! strcmp (name
, "alloca"))
829 || (IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 16
831 && ! strcmp (name
, "__builtin_alloca"))));
834 /* See if this is a call to a function that can return more than once
835 or a call to longjmp. */
840 if (name
!= 0 && IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) <= 15)
844 /* Disregard prefix _, __ or __x. */
847 if (name
[1] == '_' && name
[2] == 'x')
849 else if (name
[1] == '_')
859 && (! strcmp (tname
, "setjmp")
860 || ! strcmp (tname
, "setjmp_syscall")))
862 && ! strcmp (tname
, "sigsetjmp"))
864 && ! strcmp (tname
, "savectx")));
866 && ! strcmp (tname
, "siglongjmp"))
869 else if ((tname
[0] == 'q' && tname
[1] == 's'
870 && ! strcmp (tname
, "qsetjmp"))
871 || (tname
[0] == 'v' && tname
[1] == 'f'
872 && ! strcmp (tname
, "vfork")))
875 else if (tname
[0] == 'l' && tname
[1] == 'o'
876 && ! strcmp (tname
, "longjmp"))
881 current_function_calls_alloca
= 1;
883 /* Don't let pending stack adjusts add up to too much.
884 Also, do all pending adjustments now
885 if there is any chance this might be a call to alloca. */
887 if (pending_stack_adjust
>= 32
888 || (pending_stack_adjust
> 0 && may_be_alloca
))
889 do_pending_stack_adjust ();
891 /* Operand 0 is a pointer-to-function; get the type of the function. */
892 funtype
= TREE_TYPE (TREE_OPERAND (exp
, 0));
893 if (TREE_CODE (funtype
) != POINTER_TYPE
)
895 funtype
= TREE_TYPE (funtype
);
897 /* Push the temporary stack slot level so that we can free any temporaries
901 /* Start updating where the next arg would go. */
902 INIT_CUMULATIVE_ARGS (args_so_far
, funtype
, NULL_RTX
);
904 /* If struct_value_rtx is 0, it means pass the address
905 as if it were an extra parameter. */
906 if (structure_value_addr
&& struct_value_rtx
== 0)
908 /* If structure_value_addr is a REG other than
909 virtual_outgoing_args_rtx, we can use always use it. If it
910 is not a REG, we must always copy it into a register.
911 If it is virtual_outgoing_args_rtx, we must copy it to another
912 register in some cases. */
913 rtx temp
= (GET_CODE (structure_value_addr
) != REG
914 #ifdef ACCUMULATE_OUTGOING_ARGS
915 || (stack_arg_under_construction
916 && structure_value_addr
== virtual_outgoing_args_rtx
)
918 ? copy_addr_to_reg (structure_value_addr
)
919 : structure_value_addr
);
922 = tree_cons (error_mark_node
,
923 make_tree (build_pointer_type (TREE_TYPE (funtype
)),
926 structure_value_addr_parm
= 1;
929 /* Count the arguments and set NUM_ACTUALS. */
930 for (p
= actparms
, i
= 0; p
; p
= TREE_CHAIN (p
)) i
++;
933 /* Compute number of named args.
934 Normally, don't include the last named arg if anonymous args follow.
935 (If no anonymous args follow, the result of list_length
936 is actually one too large.)
938 If SETUP_INCOMING_VARARGS is defined, this machine will be able to
939 place unnamed args that were passed in registers into the stack. So
940 treat all args as named. This allows the insns emitting for a specific
941 argument list to be independent of the function declaration.
943 If SETUP_INCOMING_VARARGS is not defined, we do not have any reliable
944 way to pass unnamed args in registers, so we must force them into
946 #ifndef SETUP_INCOMING_VARARGS
947 if (TYPE_ARG_TYPES (funtype
) != 0)
949 = list_length (TYPE_ARG_TYPES (funtype
)) - 1
950 /* Count the struct value address, if it is passed as a parm. */
951 + structure_value_addr_parm
;
954 /* If we know nothing, treat all args as named. */
955 n_named_args
= num_actuals
;
957 /* Make a vector to hold all the information about each arg. */
958 args
= (struct arg_data
*) alloca (num_actuals
* sizeof (struct arg_data
));
959 bzero ((char *) args
, num_actuals
* sizeof (struct arg_data
));
961 args_size
.constant
= 0;
964 /* In this loop, we consider args in the order they are written.
965 We fill up ARGS from the front of from the back if necessary
966 so that in any case the first arg to be pushed ends up at the front. */
968 #ifdef PUSH_ARGS_REVERSED
969 i
= num_actuals
- 1, inc
= -1;
970 /* In this case, must reverse order of args
971 so that we compute and push the last arg first. */
976 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
977 for (p
= actparms
, argpos
= 0; p
; p
= TREE_CHAIN (p
), i
+= inc
, argpos
++)
979 tree type
= TREE_TYPE (TREE_VALUE (p
));
981 enum machine_mode mode
;
983 args
[i
].tree_value
= TREE_VALUE (p
);
985 /* Replace erroneous argument with constant zero. */
986 if (type
== error_mark_node
|| TYPE_SIZE (type
) == 0)
987 args
[i
].tree_value
= integer_zero_node
, type
= integer_type_node
;
989 /* If TYPE is a transparent union, pass things the way we would
990 pass the first field of the union. We have already verified that
991 the modes are the same. */
992 if (TYPE_TRANSPARENT_UNION (type
))
993 type
= TREE_TYPE (TYPE_FIELDS (type
));
995 /* Decide where to pass this arg.
997 args[i].reg is nonzero if all or part is passed in registers.
999 args[i].partial is nonzero if part but not all is passed in registers,
1000 and the exact value says how many words are passed in registers.
1002 args[i].pass_on_stack is nonzero if the argument must at least be
1003 computed on the stack. It may then be loaded back into registers
1004 if args[i].reg is nonzero.
1006 These decisions are driven by the FUNCTION_... macros and must agree
1007 with those made by function.c. */
1009 /* See if this argument should be passed by invisible reference. */
1010 if ((TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
1011 && contains_placeholder_p (TYPE_SIZE (type
)))
1012 || TYPE_NEEDS_CONSTRUCTING (type
)
1013 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
1014 || FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far
, TYPE_MODE (type
),
1015 type
, argpos
< n_named_args
)
1019 #ifdef FUNCTION_ARG_CALLEE_COPIES
1020 if (FUNCTION_ARG_CALLEE_COPIES (args_so_far
, TYPE_MODE (type
), type
,
1021 argpos
< n_named_args
)
1022 /* If it's in a register, we must make a copy of it too. */
1023 /* ??? Is this a sufficient test? Is there a better one? */
1024 && !(TREE_CODE (args
[i
].tree_value
) == VAR_DECL
1025 && REG_P (DECL_RTL (args
[i
].tree_value
))))
1027 args
[i
].tree_value
= build1 (ADDR_EXPR
,
1028 build_pointer_type (type
),
1029 args
[i
].tree_value
);
1030 type
= build_pointer_type (type
);
1035 /* We make a copy of the object and pass the address to the
1036 function being called. */
1039 if (TYPE_SIZE (type
) == 0
1040 || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
1042 /* This is a variable-sized object. Make space on the stack
1044 rtx size_rtx
= expr_size (TREE_VALUE (p
));
1046 if (old_stack_level
== 0)
1048 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
1049 old_pending_adj
= pending_stack_adjust
;
1050 pending_stack_adjust
= 0;
1053 copy
= gen_rtx (MEM
, BLKmode
,
1054 allocate_dynamic_stack_space (size_rtx
,
1056 TYPE_ALIGN (type
)));
1060 int size
= int_size_in_bytes (type
);
1061 copy
= assign_stack_temp (TYPE_MODE (type
), size
, 1);
1064 MEM_IN_STRUCT_P (copy
) = AGGREGATE_TYPE_P (type
);
1066 store_expr (args
[i
].tree_value
, copy
, 0);
1068 args
[i
].tree_value
= build1 (ADDR_EXPR
,
1069 build_pointer_type (type
),
1070 make_tree (type
, copy
));
1071 type
= build_pointer_type (type
);
1075 mode
= TYPE_MODE (type
);
1076 unsignedp
= TREE_UNSIGNED (type
);
1078 #ifdef PROMOTE_FUNCTION_ARGS
1079 mode
= promote_mode (type
, mode
, &unsignedp
, 1);
1082 args
[i
].unsignedp
= unsignedp
;
1083 args
[i
].mode
= mode
;
1084 args
[i
].reg
= FUNCTION_ARG (args_so_far
, mode
, type
,
1085 argpos
< n_named_args
);
1086 #ifdef FUNCTION_ARG_PARTIAL_NREGS
1089 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, mode
, type
,
1090 argpos
< n_named_args
);
1093 args
[i
].pass_on_stack
= MUST_PASS_IN_STACK (mode
, type
);
1095 /* If FUNCTION_ARG returned an (expr_list (nil) FOO), it means that
1096 we are to pass this arg in the register(s) designated by FOO, but
1097 also to pass it in the stack. */
1098 if (args
[i
].reg
&& GET_CODE (args
[i
].reg
) == EXPR_LIST
1099 && XEXP (args
[i
].reg
, 0) == 0)
1100 args
[i
].pass_on_stack
= 1, args
[i
].reg
= XEXP (args
[i
].reg
, 1);
1102 /* If this is an addressable type, we must preallocate the stack
1103 since we must evaluate the object into its final location.
1105 If this is to be passed in both registers and the stack, it is simpler
1107 if (TREE_ADDRESSABLE (type
)
1108 || (args
[i
].pass_on_stack
&& args
[i
].reg
!= 0))
1109 must_preallocate
= 1;
1111 /* If this is an addressable type, we cannot pre-evaluate it. Thus,
1112 we cannot consider this function call constant. */
1113 if (TREE_ADDRESSABLE (type
))
1116 /* Compute the stack-size of this argument. */
1117 if (args
[i
].reg
== 0 || args
[i
].partial
!= 0
1118 #ifdef REG_PARM_STACK_SPACE
1119 || reg_parm_stack_space
> 0
1121 || args
[i
].pass_on_stack
)
1122 locate_and_pad_parm (mode
, type
,
1123 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1128 fndecl
, &args_size
, &args
[i
].offset
,
1131 #ifndef ARGS_GROW_DOWNWARD
1132 args
[i
].slot_offset
= args_size
;
1135 #ifndef REG_PARM_STACK_SPACE
1136 /* If a part of the arg was put into registers,
1137 don't include that part in the amount pushed. */
1138 if (! args
[i
].pass_on_stack
)
1139 args
[i
].size
.constant
-= ((args
[i
].partial
* UNITS_PER_WORD
)
1140 / (PARM_BOUNDARY
/ BITS_PER_UNIT
)
1141 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
1144 /* Update ARGS_SIZE, the total stack space for args so far. */
1146 args_size
.constant
+= args
[i
].size
.constant
;
1147 if (args
[i
].size
.var
)
1149 ADD_PARM_SIZE (args_size
, args
[i
].size
.var
);
1152 /* Since the slot offset points to the bottom of the slot,
1153 we must record it after incrementing if the args grow down. */
1154 #ifdef ARGS_GROW_DOWNWARD
1155 args
[i
].slot_offset
= args_size
;
1157 args
[i
].slot_offset
.constant
= -args_size
.constant
;
1160 SUB_PARM_SIZE (args
[i
].slot_offset
, args_size
.var
);
1164 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1165 have been used, etc. */
1167 FUNCTION_ARG_ADVANCE (args_so_far
, TYPE_MODE (type
), type
,
1168 argpos
< n_named_args
);
1171 #ifdef FINAL_REG_PARM_STACK_SPACE
1172 reg_parm_stack_space
= FINAL_REG_PARM_STACK_SPACE (args_size
.constant
,
1176 /* Compute the actual size of the argument block required. The variable
1177 and constant sizes must be combined, the size may have to be rounded,
1178 and there may be a minimum required size. */
1180 original_args_size
= args_size
;
1183 /* If this function requires a variable-sized argument list, don't try to
1184 make a cse'able block for this call. We may be able to do this
1185 eventually, but it is too complicated to keep track of what insns go
1186 in the cse'able block and which don't. */
1189 must_preallocate
= 1;
1191 args_size
.var
= ARGS_SIZE_TREE (args_size
);
1192 args_size
.constant
= 0;
1194 #ifdef STACK_BOUNDARY
1195 if (STACK_BOUNDARY
!= BITS_PER_UNIT
)
1196 args_size
.var
= round_up (args_size
.var
, STACK_BYTES
);
1199 #ifdef REG_PARM_STACK_SPACE
1200 if (reg_parm_stack_space
> 0)
1203 = size_binop (MAX_EXPR
, args_size
.var
,
1204 size_int (REG_PARM_STACK_SPACE (fndecl
)));
1206 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1207 /* The area corresponding to register parameters is not to count in
1208 the size of the block we need. So make the adjustment. */
1210 = size_binop (MINUS_EXPR
, args_size
.var
,
1211 size_int (reg_parm_stack_space
));
1218 #ifdef STACK_BOUNDARY
1219 args_size
.constant
= (((args_size
.constant
+ (STACK_BYTES
- 1))
1220 / STACK_BYTES
) * STACK_BYTES
);
1223 #ifdef REG_PARM_STACK_SPACE
1224 args_size
.constant
= MAX (args_size
.constant
,
1225 reg_parm_stack_space
);
1226 #ifdef MAYBE_REG_PARM_STACK_SPACE
1227 if (reg_parm_stack_space
== 0)
1228 args_size
.constant
= 0;
1230 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1231 args_size
.constant
-= reg_parm_stack_space
;
1236 /* See if we have or want to preallocate stack space.
1238 If we would have to push a partially-in-regs parm
1239 before other stack parms, preallocate stack space instead.
1241 If the size of some parm is not a multiple of the required stack
1242 alignment, we must preallocate.
1244 If the total size of arguments that would otherwise create a copy in
1245 a temporary (such as a CALL) is more than half the total argument list
1246 size, preallocation is faster.
1248 Another reason to preallocate is if we have a machine (like the m88k)
1249 where stack alignment is required to be maintained between every
1250 pair of insns, not just when the call is made. However, we assume here
1251 that such machines either do not have push insns (and hence preallocation
1252 would occur anyway) or the problem is taken care of with
1255 if (! must_preallocate
)
1257 int partial_seen
= 0;
1258 int copy_to_evaluate_size
= 0;
1260 for (i
= 0; i
< num_actuals
&& ! must_preallocate
; i
++)
1262 if (args
[i
].partial
> 0 && ! args
[i
].pass_on_stack
)
1264 else if (partial_seen
&& args
[i
].reg
== 0)
1265 must_preallocate
= 1;
1267 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
1268 && (TREE_CODE (args
[i
].tree_value
) == CALL_EXPR
1269 || TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
1270 || TREE_CODE (args
[i
].tree_value
) == COND_EXPR
1271 || TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
))))
1272 copy_to_evaluate_size
1273 += int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1276 if (copy_to_evaluate_size
* 2 >= args_size
.constant
1277 && args_size
.constant
> 0)
1278 must_preallocate
= 1;
1281 /* If the structure value address will reference the stack pointer, we must
1282 stabilize it. We don't need to do this if we know that we are not going
1283 to adjust the stack pointer in processing this call. */
1285 if (structure_value_addr
1286 && (reg_mentioned_p (virtual_stack_dynamic_rtx
, structure_value_addr
)
1287 || reg_mentioned_p (virtual_outgoing_args_rtx
, structure_value_addr
))
1289 #ifndef ACCUMULATE_OUTGOING_ARGS
1290 || args_size
.constant
1293 structure_value_addr
= copy_to_reg (structure_value_addr
);
1295 /* If this function call is cse'able, precompute all the parameters.
1296 Note that if the parameter is constructed into a temporary, this will
1297 cause an additional copy because the parameter will be constructed
1298 into a temporary location and then copied into the outgoing arguments.
1299 If a parameter contains a call to alloca and this function uses the
1300 stack, precompute the parameter. */
1302 /* If we preallocated the stack space, and some arguments must be passed
1303 on the stack, then we must precompute any parameter which contains a
1304 function call which will store arguments on the stack.
1305 Otherwise, evaluating the parameter may clobber previous parameters
1306 which have already been stored into the stack. */
1308 for (i
= 0; i
< num_actuals
; i
++)
1310 || ((args_size
.var
!= 0 || args_size
.constant
!= 0)
1311 && calls_function (args
[i
].tree_value
, 1))
1312 || (must_preallocate
&& (args_size
.var
!= 0 || args_size
.constant
!= 0)
1313 && calls_function (args
[i
].tree_value
, 0)))
1317 args
[i
].initial_value
= args
[i
].value
1318 = expand_expr (args
[i
].tree_value
, NULL_RTX
, VOIDmode
, 0);
1320 preserve_temp_slots (args
[i
].value
);
1323 /* ANSI doesn't require a sequence point here,
1324 but PCC has one, so this will avoid some problems. */
1327 args
[i
].initial_value
= args
[i
].value
1328 = protect_from_queue (args
[i
].initial_value
, 0);
1330 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) != args
[i
].mode
)
1332 = convert_modes (args
[i
].mode
,
1333 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
1334 args
[i
].value
, args
[i
].unsignedp
);
1337 /* Now we are about to start emitting insns that can be deleted
1338 if a libcall is deleted. */
1342 /* If we have no actual push instructions, or shouldn't use them,
1343 make space for all args right now. */
1345 if (args_size
.var
!= 0)
1347 if (old_stack_level
== 0)
1349 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
1350 old_pending_adj
= pending_stack_adjust
;
1351 pending_stack_adjust
= 0;
1352 #ifdef ACCUMULATE_OUTGOING_ARGS
1353 /* stack_arg_under_construction says whether a stack arg is
1354 being constructed at the old stack level. Pushing the stack
1355 gets a clean outgoing argument block. */
1356 old_stack_arg_under_construction
= stack_arg_under_construction
;
1357 stack_arg_under_construction
= 0;
1360 argblock
= push_block (ARGS_SIZE_RTX (args_size
), 0, 0);
1364 /* Note that we must go through the motions of allocating an argument
1365 block even if the size is zero because we may be storing args
1366 in the area reserved for register arguments, which may be part of
1369 int needed
= args_size
.constant
;
1371 /* Store the maximum argument space used. It will be pushed by the
1372 prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow checking). */
1374 if (needed
> current_function_outgoing_args_size
)
1375 current_function_outgoing_args_size
= needed
;
1377 if (must_preallocate
)
1379 #ifdef ACCUMULATE_OUTGOING_ARGS
1380 /* Since the stack pointer will never be pushed, it is possible for
1381 the evaluation of a parm to clobber something we have already
1382 written to the stack. Since most function calls on RISC machines
1383 do not use the stack, this is uncommon, but must work correctly.
1385 Therefore, we save any area of the stack that was already written
1386 and that we are using. Here we set up to do this by making a new
1387 stack usage map from the old one. The actual save will be done
1390 Another approach might be to try to reorder the argument
1391 evaluations to avoid this conflicting stack usage. */
1393 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1394 /* Since we will be writing into the entire argument area, the
1395 map must be allocated for its entire size, not just the part that
1396 is the responsibility of the caller. */
1397 needed
+= reg_parm_stack_space
;
1400 #ifdef ARGS_GROW_DOWNWARD
1401 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
1404 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
1407 stack_usage_map
= (char *) alloca (highest_outgoing_arg_in_use
);
1409 if (initial_highest_arg_in_use
)
1410 bcopy (initial_stack_usage_map
, stack_usage_map
,
1411 initial_highest_arg_in_use
);
1413 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
1414 bzero (&stack_usage_map
[initial_highest_arg_in_use
],
1415 highest_outgoing_arg_in_use
- initial_highest_arg_in_use
);
1418 /* The address of the outgoing argument list must not be copied to a
1419 register here, because argblock would be left pointing to the
1420 wrong place after the call to allocate_dynamic_stack_space below.
1423 argblock
= virtual_outgoing_args_rtx
;
1425 #else /* not ACCUMULATE_OUTGOING_ARGS */
1426 if (inhibit_defer_pop
== 0)
1428 /* Try to reuse some or all of the pending_stack_adjust
1429 to get this space. Maybe we can avoid any pushing. */
1430 if (needed
> pending_stack_adjust
)
1432 needed
-= pending_stack_adjust
;
1433 pending_stack_adjust
= 0;
1437 pending_stack_adjust
-= needed
;
1441 /* Special case this because overhead of `push_block' in this
1442 case is non-trivial. */
1444 argblock
= virtual_outgoing_args_rtx
;
1446 argblock
= push_block (GEN_INT (needed
), 0, 0);
1448 /* We only really need to call `copy_to_reg' in the case where push
1449 insns are going to be used to pass ARGBLOCK to a function
1450 call in ARGS. In that case, the stack pointer changes value
1451 from the allocation point to the call point, and hence
1452 the value of VIRTUAL_OUTGOING_ARGS_RTX changes as well.
1453 But might as well always do it. */
1454 argblock
= copy_to_reg (argblock
);
1455 #endif /* not ACCUMULATE_OUTGOING_ARGS */
1459 #ifdef ACCUMULATE_OUTGOING_ARGS
1460 /* The save/restore code in store_one_arg handles all cases except one:
1461 a constructor call (including a C function returning a BLKmode struct)
1462 to initialize an argument. */
1463 if (stack_arg_under_construction
)
1465 #if defined(REG_PARM_STACK_SPACE) && ! defined(OUTGOING_REG_PARM_STACK_SPACE)
1466 rtx push_size
= GEN_INT (reg_parm_stack_space
+ args_size
.constant
);
1468 rtx push_size
= GEN_INT (args_size
.constant
);
1470 if (old_stack_level
== 0)
1472 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
1473 old_pending_adj
= pending_stack_adjust
;
1474 pending_stack_adjust
= 0;
1475 /* stack_arg_under_construction says whether a stack arg is
1476 being constructed at the old stack level. Pushing the stack
1477 gets a clean outgoing argument block. */
1478 old_stack_arg_under_construction
= stack_arg_under_construction
;
1479 stack_arg_under_construction
= 0;
1480 /* Make a new map for the new argument list. */
1481 stack_usage_map
= (char *)alloca (highest_outgoing_arg_in_use
);
1482 bzero (stack_usage_map
, highest_outgoing_arg_in_use
);
1483 highest_outgoing_arg_in_use
= 0;
1485 allocate_dynamic_stack_space (push_size
, NULL_RTX
, BITS_PER_UNIT
);
1487 /* If argument evaluation might modify the stack pointer, copy the
1488 address of the argument list to a register. */
1489 for (i
= 0; i
< num_actuals
; i
++)
1490 if (args
[i
].pass_on_stack
)
1492 argblock
= copy_addr_to_reg (argblock
);
1498 /* If we preallocated stack space, compute the address of each argument.
1499 We need not ensure it is a valid memory address here; it will be
1500 validized when it is used. */
1503 rtx arg_reg
= argblock
;
1506 if (GET_CODE (argblock
) == PLUS
)
1507 arg_reg
= XEXP (argblock
, 0), arg_offset
= INTVAL (XEXP (argblock
, 1));
1509 for (i
= 0; i
< num_actuals
; i
++)
1511 rtx offset
= ARGS_SIZE_RTX (args
[i
].offset
);
1512 rtx slot_offset
= ARGS_SIZE_RTX (args
[i
].slot_offset
);
1515 /* Skip this parm if it will not be passed on the stack. */
1516 if (! args
[i
].pass_on_stack
&& args
[i
].reg
!= 0)
1519 if (GET_CODE (offset
) == CONST_INT
)
1520 addr
= plus_constant (arg_reg
, INTVAL (offset
));
1522 addr
= gen_rtx (PLUS
, Pmode
, arg_reg
, offset
);
1524 addr
= plus_constant (addr
, arg_offset
);
1525 args
[i
].stack
= gen_rtx (MEM
, args
[i
].mode
, addr
);
1526 MEM_IN_STRUCT_P (args
[i
].stack
)
1527 = AGGREGATE_TYPE_P (TREE_TYPE (args
[i
].tree_value
));
1529 if (GET_CODE (slot_offset
) == CONST_INT
)
1530 addr
= plus_constant (arg_reg
, INTVAL (slot_offset
));
1532 addr
= gen_rtx (PLUS
, Pmode
, arg_reg
, slot_offset
);
1534 addr
= plus_constant (addr
, arg_offset
);
1535 args
[i
].stack_slot
= gen_rtx (MEM
, args
[i
].mode
, addr
);
1539 #ifdef PUSH_ARGS_REVERSED
1540 #ifdef STACK_BOUNDARY
1541 /* If we push args individually in reverse order, perform stack alignment
1542 before the first push (the last arg). */
1544 anti_adjust_stack (GEN_INT (args_size
.constant
1545 - original_args_size
.constant
));
1549 /* Don't try to defer pops if preallocating, not even from the first arg,
1550 since ARGBLOCK probably refers to the SP. */
1554 /* Get the function to call, in the form of RTL. */
1557 /* If this is the first use of the function, see if we need to
1558 make an external definition for it. */
1559 if (! TREE_USED (fndecl
))
1561 assemble_external (fndecl
);
1562 TREE_USED (fndecl
) = 1;
1565 /* Get a SYMBOL_REF rtx for the function address. */
1566 funexp
= XEXP (DECL_RTL (fndecl
), 0);
1569 /* Generate an rtx (probably a pseudo-register) for the address. */
1572 funexp
= expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, VOIDmode
, 0);
1573 pop_temp_slots (); /* FUNEXP can't be BLKmode */
1577 /* Figure out the register where the value, if any, will come back. */
1579 if (TYPE_MODE (TREE_TYPE (exp
)) != VOIDmode
1580 && ! structure_value_addr
)
1582 if (pcc_struct_value
)
1583 valreg
= hard_function_value (build_pointer_type (TREE_TYPE (exp
)),
1586 valreg
= hard_function_value (TREE_TYPE (exp
), fndecl
);
1589 /* Precompute all register parameters. It isn't safe to compute anything
1590 once we have started filling any specific hard regs. */
1592 for (i
= 0; i
< num_actuals
; i
++)
1593 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
)
1597 if (args
[i
].value
== 0)
1600 args
[i
].value
= expand_expr (args
[i
].tree_value
, NULL_RTX
,
1602 preserve_temp_slots (args
[i
].value
);
1605 /* ANSI doesn't require a sequence point here,
1606 but PCC has one, so this will avoid some problems. */
1610 /* If we are to promote the function arg to a wider mode,
1613 if (args
[i
].mode
!= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)))
1615 = convert_modes (args
[i
].mode
,
1616 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
1617 args
[i
].value
, args
[i
].unsignedp
);
1619 /* If the value is expensive, and we are inside an appropriately
1620 short loop, put the value into a pseudo and then put the pseudo
1623 For small register classes, also do this if this call uses
1624 register parameters. This is to avoid reload conflicts while
1625 loading the parameters registers. */
1627 if ((! (GET_CODE (args
[i
].value
) == REG
1628 || (GET_CODE (args
[i
].value
) == SUBREG
1629 && GET_CODE (SUBREG_REG (args
[i
].value
)) == REG
)))
1630 && args
[i
].mode
!= BLKmode
1631 && rtx_cost (args
[i
].value
, SET
) > 2
1632 #ifdef SMALL_REGISTER_CLASSES
1633 && (reg_parm_seen
|| preserve_subexpressions_p ())
1635 && preserve_subexpressions_p ()
1638 args
[i
].value
= copy_to_mode_reg (args
[i
].mode
, args
[i
].value
);
1641 #if defined(ACCUMULATE_OUTGOING_ARGS) && defined(REG_PARM_STACK_SPACE)
1642 /* The argument list is the property of the called routine and it
1643 may clobber it. If the fixed area has been used for previous
1644 parameters, we must save and restore it.
1646 Here we compute the boundary of the that needs to be saved, if any. */
1648 #ifdef ARGS_GROW_DOWNWARD
1649 for (i
= 0; i
< reg_parm_stack_space
+ 1; i
++)
1651 for (i
= 0; i
< reg_parm_stack_space
; i
++)
1654 if (i
>= highest_outgoing_arg_in_use
1655 || stack_usage_map
[i
] == 0)
1658 if (low_to_save
== -1)
1664 if (low_to_save
>= 0)
1666 int num_to_save
= high_to_save
- low_to_save
+ 1;
1667 enum machine_mode save_mode
1668 = mode_for_size (num_to_save
* BITS_PER_UNIT
, MODE_INT
, 1);
1671 /* If we don't have the required alignment, must do this in BLKmode. */
1672 if ((low_to_save
& (MIN (GET_MODE_SIZE (save_mode
),
1673 BIGGEST_ALIGNMENT
/ UNITS_PER_WORD
) - 1)))
1674 save_mode
= BLKmode
;
1676 stack_area
= gen_rtx (MEM
, save_mode
,
1677 memory_address (save_mode
,
1679 #ifdef ARGS_GROW_DOWNWARD
1680 plus_constant (argblock
,
1683 plus_constant (argblock
,
1687 if (save_mode
== BLKmode
)
1689 save_area
= assign_stack_temp (BLKmode
, num_to_save
, 1);
1690 MEM_IN_STRUCT_P (save_area
) = 0;
1691 emit_block_move (validize_mem (save_area
), stack_area
,
1692 GEN_INT (num_to_save
),
1693 PARM_BOUNDARY
/ BITS_PER_UNIT
);
1697 save_area
= gen_reg_rtx (save_mode
);
1698 emit_move_insn (save_area
, stack_area
);
1704 /* Now store (and compute if necessary) all non-register parms.
1705 These come before register parms, since they can require block-moves,
1706 which could clobber the registers used for register parms.
1707 Parms which have partial registers are not stored here,
1708 but we do preallocate space here if they want that. */
1710 for (i
= 0; i
< num_actuals
; i
++)
1711 if (args
[i
].reg
== 0 || args
[i
].pass_on_stack
)
1712 store_one_arg (&args
[i
], argblock
, may_be_alloca
,
1713 args_size
.var
!= 0, fndecl
, reg_parm_stack_space
);
1715 #ifdef STRICT_ALIGNMENT
1716 /* If we have a parm that is passed in registers but not in memory
1717 and whose alignment does not permit a direct copy into registers,
1718 make a group of pseudos that correspond to each register that we
1721 for (i
= 0; i
< num_actuals
; i
++)
1722 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
1723 && args
[i
].mode
== BLKmode
1724 && (TYPE_ALIGN (TREE_TYPE (args
[i
].tree_value
))
1725 < MIN (BIGGEST_ALIGNMENT
, BITS_PER_WORD
)))
1727 int bytes
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1728 int big_endian_correction
= 0;
1730 args
[i
].n_aligned_regs
1731 = args
[i
].partial
? args
[i
].partial
1732 : (bytes
+ (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
1734 args
[i
].aligned_regs
= (rtx
*) alloca (sizeof (rtx
)
1735 * args
[i
].n_aligned_regs
);
1737 /* Structures smaller than a word are aligned to the least signifcant
1738 byte (to the right). On a BYTES_BIG_ENDIAN machine, this means we
1739 must skip the empty high order bytes when calculating the bit
1741 if (BYTES_BIG_ENDIAN
&& bytes
< UNITS_PER_WORD
)
1742 big_endian_correction
= (BITS_PER_WORD
- (bytes
* BITS_PER_UNIT
));
1744 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1746 rtx reg
= gen_reg_rtx (word_mode
);
1747 rtx word
= operand_subword_force (args
[i
].value
, j
, BLKmode
);
1748 int bitsize
= TYPE_ALIGN (TREE_TYPE (args
[i
].tree_value
));
1751 args
[i
].aligned_regs
[j
] = reg
;
1753 /* Clobber REG and move each partword into it. Ensure we don't
1754 go past the end of the structure. Note that the loop below
1755 works because we've already verified that padding
1756 and endianness are compatible. */
1758 emit_insn (gen_rtx (CLOBBER
, VOIDmode
, reg
));
1761 bitpos
< BITS_PER_WORD
&& bytes
> 0;
1762 bitpos
+= bitsize
, bytes
-= bitsize
/ BITS_PER_UNIT
)
1764 int xbitpos
= bitpos
+ big_endian_correction
;
1766 store_bit_field (reg
, bitsize
, xbitpos
, word_mode
,
1767 extract_bit_field (word
, bitsize
, bitpos
, 1,
1768 NULL_RTX
, word_mode
,
1770 bitsize
/ BITS_PER_UNIT
,
1772 bitsize
/ BITS_PER_UNIT
, BITS_PER_WORD
);
1778 /* Now store any partially-in-registers parm.
1779 This is the last place a block-move can happen. */
1781 for (i
= 0; i
< num_actuals
; i
++)
1782 if (args
[i
].partial
!= 0 && ! args
[i
].pass_on_stack
)
1783 store_one_arg (&args
[i
], argblock
, may_be_alloca
,
1784 args_size
.var
!= 0, fndecl
, reg_parm_stack_space
);
1786 #ifndef PUSH_ARGS_REVERSED
1787 #ifdef STACK_BOUNDARY
1788 /* If we pushed args in forward order, perform stack alignment
1789 after pushing the last arg. */
1791 anti_adjust_stack (GEN_INT (args_size
.constant
1792 - original_args_size
.constant
));
1796 /* If register arguments require space on the stack and stack space
1797 was not preallocated, allocate stack space here for arguments
1798 passed in registers. */
1799 #if ! defined(ACCUMULATE_OUTGOING_ARGS) && defined(OUTGOING_REG_PARM_STACK_SPACE)
1800 if (must_preallocate
== 0 && reg_parm_stack_space
> 0)
1801 anti_adjust_stack (GEN_INT (reg_parm_stack_space
));
1804 /* Pass the function the address in which to return a structure value. */
1805 if (structure_value_addr
&& ! structure_value_addr_parm
)
1807 emit_move_insn (struct_value_rtx
,
1809 force_operand (structure_value_addr
,
1811 if (GET_CODE (struct_value_rtx
) == REG
)
1812 use_reg (&call_fusage
, struct_value_rtx
);
1815 funexp
= prepare_call_address (funexp
, fndecl
, &call_fusage
, reg_parm_seen
);
1817 /* Now do the register loads required for any wholly-register parms or any
1818 parms which are passed both on the stack and in a register. Their
1819 expressions were already evaluated.
1821 Mark all register-parms as living through the call, putting these USE
1822 insns in the CALL_INSN_FUNCTION_USAGE field. */
1824 for (i
= 0; i
< num_actuals
; i
++)
1826 rtx list
= args
[i
].reg
;
1827 int partial
= args
[i
].partial
;
1834 /* Process each register that needs to get this arg. */
1835 if (GET_CODE (list
) == EXPR_LIST
)
1836 reg
= XEXP (list
, 0), list
= XEXP (list
, 1);
1838 reg
= list
, list
= 0;
1840 /* Set to non-negative if must move a word at a time, even if just
1841 one word (e.g, partial == 1 && mode == DFmode). Set to -1 if
1842 we just use a normal move insn. This value can be zero if the
1843 argument is a zero size structure with no fields. */
1844 nregs
= (partial
? partial
1845 : (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
1846 ? ((int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
))
1847 + (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
)
1850 /* If simple case, just do move. If normal partial, store_one_arg
1851 has already loaded the register for us. In all other cases,
1852 load the register(s) from memory. */
1855 emit_move_insn (reg
, args
[i
].value
);
1857 #ifdef STRICT_ALIGNMENT
1858 /* If we have pre-computed the values to put in the registers in
1859 the case of non-aligned structures, copy them in now. */
1861 else if (args
[i
].n_aligned_regs
!= 0)
1862 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1863 emit_move_insn (gen_rtx (REG
, word_mode
, REGNO (reg
) + j
),
1864 args
[i
].aligned_regs
[j
]);
1867 else if (args
[i
].partial
== 0 || args
[i
].pass_on_stack
)
1868 move_block_to_reg (REGNO (reg
),
1869 validize_mem (args
[i
].value
), nregs
,
1873 use_reg (&call_fusage
, reg
);
1875 use_regs (&call_fusage
, REGNO (reg
), nregs
== 0 ? 1 : nregs
);
1877 /* PARTIAL referred only to the first register, so clear it for the
1883 /* Perform postincrements before actually calling the function. */
1886 /* All arguments and registers used for the call must be set up by now! */
1888 /* Generate the actual call instruction. */
1889 emit_call_1 (funexp
, funtype
, args_size
.constant
, struct_value_size
,
1890 FUNCTION_ARG (args_so_far
, VOIDmode
, void_type_node
, 1),
1891 valreg
, old_inhibit_defer_pop
, call_fusage
, is_const
);
1893 /* If call is cse'able, make appropriate pair of reg-notes around it.
1894 Test valreg so we don't crash; may safely ignore `const'
1895 if return type is void. */
1896 if (is_const
&& valreg
!= 0)
1899 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
1902 /* Construct an "equal form" for the value which mentions all the
1903 arguments in order as well as the function name. */
1904 #ifdef PUSH_ARGS_REVERSED
1905 for (i
= 0; i
< num_actuals
; i
++)
1906 note
= gen_rtx (EXPR_LIST
, VOIDmode
, args
[i
].initial_value
, note
);
1908 for (i
= num_actuals
- 1; i
>= 0; i
--)
1909 note
= gen_rtx (EXPR_LIST
, VOIDmode
, args
[i
].initial_value
, note
);
1911 note
= gen_rtx (EXPR_LIST
, VOIDmode
, funexp
, note
);
1913 insns
= get_insns ();
1916 emit_libcall_block (insns
, temp
, valreg
, note
);
1922 /* Otherwise, just write out the sequence without a note. */
1923 rtx insns
= get_insns ();
1929 /* For calls to `setjmp', etc., inform flow.c it should complain
1930 if nonvolatile values are live. */
1934 emit_note (name
, NOTE_INSN_SETJMP
);
1935 current_function_calls_setjmp
= 1;
1939 current_function_calls_longjmp
= 1;
1941 /* Notice functions that cannot return.
1942 If optimizing, insns emitted below will be dead.
1943 If not optimizing, they will exist, which is useful
1944 if the user uses the `return' command in the debugger. */
1946 if (is_volatile
|| is_longjmp
)
1949 /* If value type not void, return an rtx for the value. */
1951 /* If there are cleanups to be called, don't use a hard reg as target. */
1952 if (cleanups_this_call
!= old_cleanups
1953 && target
&& REG_P (target
)
1954 && REGNO (target
) < FIRST_PSEUDO_REGISTER
)
1957 if (TYPE_MODE (TREE_TYPE (exp
)) == VOIDmode
1960 target
= const0_rtx
;
1962 else if (structure_value_addr
)
1964 if (target
== 0 || GET_CODE (target
) != MEM
)
1966 target
= gen_rtx (MEM
, TYPE_MODE (TREE_TYPE (exp
)),
1967 memory_address (TYPE_MODE (TREE_TYPE (exp
)),
1968 structure_value_addr
));
1969 MEM_IN_STRUCT_P (target
) = AGGREGATE_TYPE_P (TREE_TYPE (exp
));
1972 else if (pcc_struct_value
)
1976 /* We used leave the value in the location that it is
1977 returned in, but that causes problems if it is used more
1978 than once in one expression. Rather than trying to track
1979 when a copy is required, we always copy when TARGET is
1980 not specified. This calling sequence is only used on
1981 a few machines and TARGET is usually nonzero. */
1982 if (TYPE_MODE (TREE_TYPE (exp
)) == BLKmode
)
1984 target
= assign_stack_temp (BLKmode
,
1985 int_size_in_bytes (TREE_TYPE (exp
)),
1988 MEM_IN_STRUCT_P (target
) = AGGREGATE_TYPE_P (TREE_TYPE (exp
));
1990 /* Save this temp slot around the pop below. */
1991 preserve_temp_slots (target
);
1994 target
= gen_reg_rtx (TYPE_MODE (TREE_TYPE (exp
)));
1997 if (TYPE_MODE (TREE_TYPE (exp
)) != BLKmode
)
1998 emit_move_insn (target
, gen_rtx (MEM
, TYPE_MODE (TREE_TYPE (exp
)),
1999 copy_to_reg (valreg
)));
2001 emit_block_move (target
, gen_rtx (MEM
, BLKmode
, copy_to_reg (valreg
)),
2003 TYPE_ALIGN (TREE_TYPE (exp
)) / BITS_PER_UNIT
);
2005 else if (target
&& GET_MODE (target
) == TYPE_MODE (TREE_TYPE (exp
))
2006 && GET_MODE (target
) == GET_MODE (valreg
))
2007 /* TARGET and VALREG cannot be equal at this point because the latter
2008 would not have REG_FUNCTION_VALUE_P true, while the former would if
2009 it were referring to the same register.
2011 If they refer to the same register, this move will be a no-op, except
2012 when function inlining is being done. */
2013 emit_move_insn (target
, valreg
);
2014 else if (TYPE_MODE (TREE_TYPE (exp
)) == BLKmode
)
2016 /* Some machines (the PA for example) want to return all small
2017 structures in registers regardless of the structure's alignment.
2019 Deal with them explicitly by copying from the return registers
2020 into the target MEM locations. */
2021 int bytes
= int_size_in_bytes (TREE_TYPE (exp
));
2022 int n_regs
= (bytes
+ UNITS_PER_WORD
- 1) / UNITS_PER_WORD
;
2024 enum machine_mode tmpmode
;
2027 target
= assign_stack_temp (BLKmode
, bytes
, 0);
2028 MEM_IN_STRUCT_P (target
) = AGGREGATE_TYPE_P (TREE_TYPE (exp
));
2030 /* We could probably emit more efficient code for machines
2031 which do not use strict alignment, but it doesn't seem
2032 worth the effort at the current time. */
2033 for (i
= 0; i
< n_regs
; i
++)
2035 rtx src
= operand_subword_force (valreg
, i
, BLKmode
);
2036 rtx dst
= operand_subword (target
, i
, 1, BLKmode
);
2037 int bitsize
= MIN (TYPE_ALIGN (TREE_TYPE (exp
)), BITS_PER_WORD
);
2038 int bitpos
, big_endian_correction
= 0;
2040 /* Should never happen. */
2041 if (src
== NULL
|| dst
== NULL
)
2044 if (BYTES_BIG_ENDIAN
&& bytes
< UNITS_PER_WORD
)
2045 big_endian_correction
2046 = (BITS_PER_WORD
- (bytes
* BITS_PER_UNIT
));
2049 bitpos
< BITS_PER_WORD
&& bytes
> 0;
2050 bitpos
+= bitsize
, bytes
-= bitsize
/ BITS_PER_UNIT
)
2052 int xbitpos
= bitpos
+ big_endian_correction
;
2054 store_bit_field (dst
, bitsize
, xbitpos
, word_mode
,
2055 extract_bit_field (src
, bitsize
, bitpos
, 1,
2056 NULL_RTX
, word_mode
,
2058 bitsize
/ BITS_PER_UNIT
,
2060 bitsize
/ BITS_PER_UNIT
, BITS_PER_WORD
);
2065 target
= copy_to_reg (valreg
);
2067 #ifdef PROMOTE_FUNCTION_RETURN
2068 /* If we promoted this return value, make the proper SUBREG. TARGET
2069 might be const0_rtx here, so be careful. */
2070 if (GET_CODE (target
) == REG
2071 && TYPE_MODE (TREE_TYPE (exp
)) != BLKmode
2072 && GET_MODE (target
) != TYPE_MODE (TREE_TYPE (exp
)))
2074 tree type
= TREE_TYPE (exp
);
2075 int unsignedp
= TREE_UNSIGNED (type
);
2077 /* If we don't promote as expected, something is wrong. */
2078 if (GET_MODE (target
)
2079 != promote_mode (type
, TYPE_MODE (type
), &unsignedp
, 1))
2082 target
= gen_rtx (SUBREG
, TYPE_MODE (type
), target
, 0);
2083 SUBREG_PROMOTED_VAR_P (target
) = 1;
2084 SUBREG_PROMOTED_UNSIGNED_P (target
) = unsignedp
;
2088 if (flag_short_temps
)
2090 /* Perform all cleanups needed for the arguments of this call
2091 (i.e. destructors in C++). */
2092 expand_cleanups_to (old_cleanups
);
2095 /* If size of args is variable or this was a constructor call for a stack
2096 argument, restore saved stack-pointer value. */
2098 if (old_stack_level
)
2100 emit_stack_restore (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
2101 pending_stack_adjust
= old_pending_adj
;
2102 #ifdef ACCUMULATE_OUTGOING_ARGS
2103 stack_arg_under_construction
= old_stack_arg_under_construction
;
2104 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
2105 stack_usage_map
= initial_stack_usage_map
;
2108 #ifdef ACCUMULATE_OUTGOING_ARGS
2111 #ifdef REG_PARM_STACK_SPACE
2114 enum machine_mode save_mode
= GET_MODE (save_area
);
2116 = gen_rtx (MEM
, save_mode
,
2117 memory_address (save_mode
,
2118 #ifdef ARGS_GROW_DOWNWARD
2119 plus_constant (argblock
, - high_to_save
)
2121 plus_constant (argblock
, low_to_save
)
2125 if (save_mode
!= BLKmode
)
2126 emit_move_insn (stack_area
, save_area
);
2128 emit_block_move (stack_area
, validize_mem (save_area
),
2129 GEN_INT (high_to_save
- low_to_save
+ 1),
2130 PARM_BOUNDARY
/ BITS_PER_UNIT
);
2134 /* If we saved any argument areas, restore them. */
2135 for (i
= 0; i
< num_actuals
; i
++)
2136 if (args
[i
].save_area
)
2138 enum machine_mode save_mode
= GET_MODE (args
[i
].save_area
);
2140 = gen_rtx (MEM
, save_mode
,
2141 memory_address (save_mode
,
2142 XEXP (args
[i
].stack_slot
, 0)));
2144 if (save_mode
!= BLKmode
)
2145 emit_move_insn (stack_area
, args
[i
].save_area
);
2147 emit_block_move (stack_area
, validize_mem (args
[i
].save_area
),
2148 GEN_INT (args
[i
].size
.constant
),
2149 PARM_BOUNDARY
/ BITS_PER_UNIT
);
2152 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
2153 stack_usage_map
= initial_stack_usage_map
;
2157 /* If this was alloca, record the new stack level for nonlocal gotos.
2158 Check for the handler slots since we might not have a save area
2159 for non-local gotos. */
2161 if (may_be_alloca
&& nonlocal_goto_handler_slot
!= 0)
2162 emit_stack_save (SAVE_NONLOCAL
, &nonlocal_goto_stack_level
, NULL_RTX
);
2169 /* Output a library call to function FUN (a SYMBOL_REF rtx)
2170 (emitting the queue unless NO_QUEUE is nonzero),
2171 for a value of mode OUTMODE,
2172 with NARGS different arguments, passed as alternating rtx values
2173 and machine_modes to convert them to.
2174 The rtx values should have been passed through protect_from_queue already.
2176 NO_QUEUE will be true if and only if the library call is a `const' call
2177 which will be enclosed in REG_LIBCALL/REG_RETVAL notes; it is equivalent
2178 to the variable is_const in expand_call.
2180 NO_QUEUE must be true for const calls, because if it isn't, then
2181 any pending increment will be emitted between REG_LIBCALL/REG_RETVAL notes,
2182 and will be lost if the libcall sequence is optimized away.
2184 NO_QUEUE must be false for non-const calls, because if it isn't, the
2185 call insn will have its CONST_CALL_P bit set, and it will be incorrectly
2186 optimized. For instance, the instruction scheduler may incorrectly
2187 move memory references across the non-const call. */
2190 emit_library_call
VPROTO((rtx orgfun
, int no_queue
, enum machine_mode outmode
,
2196 enum machine_mode outmode
;
2200 /* Total size in bytes of all the stack-parms scanned so far. */
2201 struct args_size args_size
;
2202 /* Size of arguments before any adjustments (such as rounding). */
2203 struct args_size original_args_size
;
2204 register int argnum
;
2209 CUMULATIVE_ARGS args_so_far
;
2210 struct arg
{ rtx value
; enum machine_mode mode
; rtx reg
; int partial
;
2211 struct args_size offset
; struct args_size size
; };
2213 int old_inhibit_defer_pop
= inhibit_defer_pop
;
2214 rtx call_fusage
= 0;
2215 /* library calls are never indirect calls. */
2216 int current_call_is_indirect
= 0;
2218 VA_START (p
, nargs
);
2221 orgfun
= va_arg (p
, rtx
);
2222 no_queue
= va_arg (p
, int);
2223 outmode
= va_arg (p
, enum machine_mode
);
2224 nargs
= va_arg (p
, int);
2229 /* Copy all the libcall-arguments out of the varargs data
2230 and into a vector ARGVEC.
2232 Compute how to pass each argument. We only support a very small subset
2233 of the full argument passing conventions to limit complexity here since
2234 library functions shouldn't have many args. */
2236 argvec
= (struct arg
*) alloca (nargs
* sizeof (struct arg
));
2238 INIT_CUMULATIVE_ARGS (args_so_far
, NULL_TREE
, fun
);
2240 args_size
.constant
= 0;
2245 for (count
= 0; count
< nargs
; count
++)
2247 rtx val
= va_arg (p
, rtx
);
2248 enum machine_mode mode
= va_arg (p
, enum machine_mode
);
2250 /* We cannot convert the arg value to the mode the library wants here;
2251 must do it earlier where we know the signedness of the arg. */
2253 || (GET_MODE (val
) != mode
&& GET_MODE (val
) != VOIDmode
))
2256 /* On some machines, there's no way to pass a float to a library fcn.
2257 Pass it as a double instead. */
2258 #ifdef LIBGCC_NEEDS_DOUBLE
2259 if (LIBGCC_NEEDS_DOUBLE
&& mode
== SFmode
)
2260 val
= convert_modes (DFmode
, SFmode
, val
, 0), mode
= DFmode
;
2263 /* There's no need to call protect_from_queue, because
2264 either emit_move_insn or emit_push_insn will do that. */
2266 /* Make sure it is a reasonable operand for a move or push insn. */
2267 if (GET_CODE (val
) != REG
&& GET_CODE (val
) != MEM
2268 && ! (CONSTANT_P (val
) && LEGITIMATE_CONSTANT_P (val
)))
2269 val
= force_operand (val
, NULL_RTX
);
2271 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
2272 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far
, mode
, NULL_TREE
, 1))
2274 /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can
2275 be viewed as just an efficiency improvement. */
2276 rtx slot
= assign_stack_temp (mode
, GET_MODE_SIZE (mode
), 0);
2277 emit_move_insn (slot
, val
);
2278 val
= force_operand (XEXP (slot
, 0), NULL_RTX
);
2283 argvec
[count
].value
= val
;
2284 argvec
[count
].mode
= mode
;
2286 argvec
[count
].reg
= FUNCTION_ARG (args_so_far
, mode
, NULL_TREE
, 1);
2287 if (argvec
[count
].reg
&& GET_CODE (argvec
[count
].reg
) == EXPR_LIST
)
2289 #ifdef FUNCTION_ARG_PARTIAL_NREGS
2290 argvec
[count
].partial
2291 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, mode
, NULL_TREE
, 1);
2293 argvec
[count
].partial
= 0;
2296 locate_and_pad_parm (mode
, NULL_TREE
,
2297 argvec
[count
].reg
&& argvec
[count
].partial
== 0,
2298 NULL_TREE
, &args_size
, &argvec
[count
].offset
,
2299 &argvec
[count
].size
);
2301 if (argvec
[count
].size
.var
)
2304 #ifndef REG_PARM_STACK_SPACE
2305 if (argvec
[count
].partial
)
2306 argvec
[count
].size
.constant
-= argvec
[count
].partial
* UNITS_PER_WORD
;
2309 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
2310 #ifdef REG_PARM_STACK_SPACE
2314 args_size
.constant
+= argvec
[count
].size
.constant
;
2316 #ifdef ACCUMULATE_OUTGOING_ARGS
2317 /* If this arg is actually passed on the stack, it might be
2318 clobbering something we already put there (this library call might
2319 be inside the evaluation of an argument to a function whose call
2320 requires the stack). This will only occur when the library call
2321 has sufficient args to run out of argument registers. Abort in
2322 this case; if this ever occurs, code must be added to save and
2323 restore the arg slot. */
2325 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0)
2329 FUNCTION_ARG_ADVANCE (args_so_far
, mode
, (tree
)0, 1);
2333 /* If this machine requires an external definition for library
2334 functions, write one out. */
2335 assemble_external_libcall (fun
);
2337 original_args_size
= args_size
;
2338 #ifdef STACK_BOUNDARY
2339 args_size
.constant
= (((args_size
.constant
+ (STACK_BYTES
- 1))
2340 / STACK_BYTES
) * STACK_BYTES
);
2343 #ifdef REG_PARM_STACK_SPACE
2344 args_size
.constant
= MAX (args_size
.constant
,
2345 REG_PARM_STACK_SPACE (NULL_TREE
));
2346 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2347 args_size
.constant
-= REG_PARM_STACK_SPACE (NULL_TREE
);
2351 if (args_size
.constant
> current_function_outgoing_args_size
)
2352 current_function_outgoing_args_size
= args_size
.constant
;
2354 #ifdef ACCUMULATE_OUTGOING_ARGS
2355 args_size
.constant
= 0;
2358 #ifndef PUSH_ROUNDING
2359 argblock
= push_block (GEN_INT (args_size
.constant
), 0, 0);
2362 #ifdef PUSH_ARGS_REVERSED
2363 #ifdef STACK_BOUNDARY
2364 /* If we push args individually in reverse order, perform stack alignment
2365 before the first push (the last arg). */
2367 anti_adjust_stack (GEN_INT (args_size
.constant
2368 - original_args_size
.constant
));
2372 #ifdef PUSH_ARGS_REVERSED
2380 /* Push the args that need to be pushed. */
2382 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
2384 register enum machine_mode mode
= argvec
[argnum
].mode
;
2385 register rtx val
= argvec
[argnum
].value
;
2386 rtx reg
= argvec
[argnum
].reg
;
2387 int partial
= argvec
[argnum
].partial
;
2389 if (! (reg
!= 0 && partial
== 0))
2390 emit_push_insn (val
, mode
, NULL_TREE
, NULL_RTX
, 0, partial
, reg
, 0,
2391 argblock
, GEN_INT (argvec
[count
].offset
.constant
));
2395 #ifndef PUSH_ARGS_REVERSED
2396 #ifdef STACK_BOUNDARY
2397 /* If we pushed args in forward order, perform stack alignment
2398 after pushing the last arg. */
2400 anti_adjust_stack (GEN_INT (args_size
.constant
2401 - original_args_size
.constant
));
2405 #ifdef PUSH_ARGS_REVERSED
2411 fun
= prepare_call_address (fun
, NULL_TREE
, &call_fusage
, 0);
2413 /* Now load any reg parms into their regs. */
2415 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
2417 register enum machine_mode mode
= argvec
[argnum
].mode
;
2418 register rtx val
= argvec
[argnum
].value
;
2419 rtx reg
= argvec
[argnum
].reg
;
2420 int partial
= argvec
[argnum
].partial
;
2422 if (reg
!= 0 && partial
== 0)
2423 emit_move_insn (reg
, val
);
2427 /* For version 1.37, try deleting this entirely. */
2431 /* Any regs containing parms remain in use through the call. */
2432 for (count
= 0; count
< nargs
; count
++)
2433 if (argvec
[count
].reg
!= 0)
2434 use_reg (&call_fusage
, argvec
[count
].reg
);
2436 /* Don't allow popping to be deferred, since then
2437 cse'ing of library calls could delete a call and leave the pop. */
2440 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
2441 will set inhibit_defer_pop to that value. */
2443 emit_call_1 (fun
, get_identifier (XSTR (orgfun
, 0)), args_size
.constant
, 0,
2444 FUNCTION_ARG (args_so_far
, VOIDmode
, void_type_node
, 1),
2445 outmode
!= VOIDmode
? hard_libcall_value (outmode
) : NULL_RTX
,
2446 old_inhibit_defer_pop
+ 1, call_fusage
, no_queue
);
2450 /* Now restore inhibit_defer_pop to its actual original value. */
2454 /* Like emit_library_call except that an extra argument, VALUE,
2455 comes second and says where to store the result.
2456 (If VALUE is zero, this function chooses a convenient way
2457 to return the value.
2459 This function returns an rtx for where the value is to be found.
2460 If VALUE is nonzero, VALUE is returned. */
2463 emit_library_call_value
VPROTO((rtx orgfun
, rtx value
, int no_queue
,
2464 enum machine_mode outmode
, int nargs
, ...))
2470 enum machine_mode outmode
;
2474 /* Total size in bytes of all the stack-parms scanned so far. */
2475 struct args_size args_size
;
2476 /* Size of arguments before any adjustments (such as rounding). */
2477 struct args_size original_args_size
;
2478 register int argnum
;
2483 CUMULATIVE_ARGS args_so_far
;
2484 struct arg
{ rtx value
; enum machine_mode mode
; rtx reg
; int partial
;
2485 struct args_size offset
; struct args_size size
; };
2487 int old_inhibit_defer_pop
= inhibit_defer_pop
;
2488 rtx call_fusage
= 0;
2490 int pcc_struct_value
= 0;
2491 int struct_value_size
= 0;
2492 /* library calls are never indirect calls. */
2493 int current_call_is_indirect
= 0;
2496 VA_START (p
, nargs
);
2499 orgfun
= va_arg (p
, rtx
);
2500 value
= va_arg (p
, rtx
);
2501 no_queue
= va_arg (p
, int);
2502 outmode
= va_arg (p
, enum machine_mode
);
2503 nargs
= va_arg (p
, int);
2506 is_const
= no_queue
;
2509 /* If this kind of value comes back in memory,
2510 decide where in memory it should come back. */
2511 if (aggregate_value_p (type_for_mode (outmode
, 0)))
2513 #ifdef PCC_STATIC_STRUCT_RETURN
2515 = hard_function_value (build_pointer_type (type_for_mode (outmode
, 0)),
2517 mem_value
= gen_rtx (MEM
, outmode
, pointer_reg
);
2518 pcc_struct_value
= 1;
2520 value
= gen_reg_rtx (outmode
);
2521 #else /* not PCC_STATIC_STRUCT_RETURN */
2522 struct_value_size
= GET_MODE_SIZE (outmode
);
2523 if (value
!= 0 && GET_CODE (value
) == MEM
)
2526 mem_value
= assign_stack_temp (outmode
, GET_MODE_SIZE (outmode
), 0);
2529 /* This call returns a big structure. */
2533 /* ??? Unfinished: must pass the memory address as an argument. */
2535 /* Copy all the libcall-arguments out of the varargs data
2536 and into a vector ARGVEC.
2538 Compute how to pass each argument. We only support a very small subset
2539 of the full argument passing conventions to limit complexity here since
2540 library functions shouldn't have many args. */
2542 argvec
= (struct arg
*) alloca ((nargs
+ 1) * sizeof (struct arg
));
2544 INIT_CUMULATIVE_ARGS (args_so_far
, NULL_TREE
, fun
);
2546 args_size
.constant
= 0;
2553 /* If there's a structure value address to be passed,
2554 either pass it in the special place, or pass it as an extra argument. */
2555 if (mem_value
&& struct_value_rtx
== 0 && ! pcc_struct_value
)
2557 rtx addr
= XEXP (mem_value
, 0);
2560 /* Make sure it is a reasonable operand for a move or push insn. */
2561 if (GET_CODE (addr
) != REG
&& GET_CODE (addr
) != MEM
2562 && ! (CONSTANT_P (addr
) && LEGITIMATE_CONSTANT_P (addr
)))
2563 addr
= force_operand (addr
, NULL_RTX
);
2565 argvec
[count
].value
= addr
;
2566 argvec
[count
].mode
= Pmode
;
2567 argvec
[count
].partial
= 0;
2569 argvec
[count
].reg
= FUNCTION_ARG (args_so_far
, Pmode
, NULL_TREE
, 1);
2570 #ifdef FUNCTION_ARG_PARTIAL_NREGS
2571 if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, Pmode
, NULL_TREE
, 1))
2575 locate_and_pad_parm (Pmode
, NULL_TREE
,
2576 argvec
[count
].reg
&& argvec
[count
].partial
== 0,
2577 NULL_TREE
, &args_size
, &argvec
[count
].offset
,
2578 &argvec
[count
].size
);
2581 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
2582 #ifdef REG_PARM_STACK_SPACE
2586 args_size
.constant
+= argvec
[count
].size
.constant
;
2588 FUNCTION_ARG_ADVANCE (args_so_far
, Pmode
, (tree
)0, 1);
2593 for (; count
< nargs
; count
++)
2595 rtx val
= va_arg (p
, rtx
);
2596 enum machine_mode mode
= va_arg (p
, enum machine_mode
);
2598 /* We cannot convert the arg value to the mode the library wants here;
2599 must do it earlier where we know the signedness of the arg. */
2601 || (GET_MODE (val
) != mode
&& GET_MODE (val
) != VOIDmode
))
2604 /* On some machines, there's no way to pass a float to a library fcn.
2605 Pass it as a double instead. */
2606 #ifdef LIBGCC_NEEDS_DOUBLE
2607 if (LIBGCC_NEEDS_DOUBLE
&& mode
== SFmode
)
2608 val
= convert_modes (DFmode
, SFmode
, val
, 0), mode
= DFmode
;
2611 /* There's no need to call protect_from_queue, because
2612 either emit_move_insn or emit_push_insn will do that. */
2614 /* Make sure it is a reasonable operand for a move or push insn. */
2615 if (GET_CODE (val
) != REG
&& GET_CODE (val
) != MEM
2616 && ! (CONSTANT_P (val
) && LEGITIMATE_CONSTANT_P (val
)))
2617 val
= force_operand (val
, NULL_RTX
);
2619 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
2620 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far
, mode
, NULL_TREE
, 1))
2622 /* We do not support FUNCTION_ARG_CALLEE_COPIES here since it can
2623 be viewed as just an efficiency improvement. */
2624 rtx slot
= assign_stack_temp (mode
, GET_MODE_SIZE (mode
), 0);
2625 emit_move_insn (slot
, val
);
2626 val
= XEXP (slot
, 0);
2631 argvec
[count
].value
= val
;
2632 argvec
[count
].mode
= mode
;
2634 argvec
[count
].reg
= FUNCTION_ARG (args_so_far
, mode
, NULL_TREE
, 1);
2635 if (argvec
[count
].reg
&& GET_CODE (argvec
[count
].reg
) == EXPR_LIST
)
2637 #ifdef FUNCTION_ARG_PARTIAL_NREGS
2638 argvec
[count
].partial
2639 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, mode
, NULL_TREE
, 1);
2641 argvec
[count
].partial
= 0;
2644 locate_and_pad_parm (mode
, NULL_TREE
,
2645 argvec
[count
].reg
&& argvec
[count
].partial
== 0,
2646 NULL_TREE
, &args_size
, &argvec
[count
].offset
,
2647 &argvec
[count
].size
);
2649 if (argvec
[count
].size
.var
)
2652 #ifndef REG_PARM_STACK_SPACE
2653 if (argvec
[count
].partial
)
2654 argvec
[count
].size
.constant
-= argvec
[count
].partial
* UNITS_PER_WORD
;
2657 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
2658 #ifdef REG_PARM_STACK_SPACE
2662 args_size
.constant
+= argvec
[count
].size
.constant
;
2664 #ifdef ACCUMULATE_OUTGOING_ARGS
2665 /* If this arg is actually passed on the stack, it might be
2666 clobbering something we already put there (this library call might
2667 be inside the evaluation of an argument to a function whose call
2668 requires the stack). This will only occur when the library call
2669 has sufficient args to run out of argument registers. Abort in
2670 this case; if this ever occurs, code must be added to save and
2671 restore the arg slot. */
2673 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0)
2677 FUNCTION_ARG_ADVANCE (args_so_far
, mode
, (tree
)0, 1);
2681 /* If this machine requires an external definition for library
2682 functions, write one out. */
2683 assemble_external_libcall (fun
);
2685 original_args_size
= args_size
;
2686 #ifdef STACK_BOUNDARY
2687 args_size
.constant
= (((args_size
.constant
+ (STACK_BYTES
- 1))
2688 / STACK_BYTES
) * STACK_BYTES
);
2691 #ifdef REG_PARM_STACK_SPACE
2692 args_size
.constant
= MAX (args_size
.constant
,
2693 REG_PARM_STACK_SPACE (NULL_TREE
));
2694 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2695 args_size
.constant
-= REG_PARM_STACK_SPACE (NULL_TREE
);
2699 if (args_size
.constant
> current_function_outgoing_args_size
)
2700 current_function_outgoing_args_size
= args_size
.constant
;
2702 #ifdef ACCUMULATE_OUTGOING_ARGS
2703 args_size
.constant
= 0;
2706 #ifndef PUSH_ROUNDING
2707 argblock
= push_block (GEN_INT (args_size
.constant
), 0, 0);
2710 #ifdef PUSH_ARGS_REVERSED
2711 #ifdef STACK_BOUNDARY
2712 /* If we push args individually in reverse order, perform stack alignment
2713 before the first push (the last arg). */
2715 anti_adjust_stack (GEN_INT (args_size
.constant
2716 - original_args_size
.constant
));
2720 #ifdef PUSH_ARGS_REVERSED
2728 /* Push the args that need to be pushed. */
2730 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
2732 register enum machine_mode mode
= argvec
[argnum
].mode
;
2733 register rtx val
= argvec
[argnum
].value
;
2734 rtx reg
= argvec
[argnum
].reg
;
2735 int partial
= argvec
[argnum
].partial
;
2737 if (! (reg
!= 0 && partial
== 0))
2738 emit_push_insn (val
, mode
, NULL_TREE
, NULL_RTX
, 0, partial
, reg
, 0,
2739 argblock
, GEN_INT (argvec
[count
].offset
.constant
));
2743 #ifndef PUSH_ARGS_REVERSED
2744 #ifdef STACK_BOUNDARY
2745 /* If we pushed args in forward order, perform stack alignment
2746 after pushing the last arg. */
2748 anti_adjust_stack (GEN_INT (args_size
.constant
2749 - original_args_size
.constant
));
2753 #ifdef PUSH_ARGS_REVERSED
2759 fun
= prepare_call_address (fun
, NULL_TREE
, &call_fusage
, 0);
2761 /* Now load any reg parms into their regs. */
2763 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
2765 register enum machine_mode mode
= argvec
[argnum
].mode
;
2766 register rtx val
= argvec
[argnum
].value
;
2767 rtx reg
= argvec
[argnum
].reg
;
2768 int partial
= argvec
[argnum
].partial
;
2770 if (reg
!= 0 && partial
== 0)
2771 emit_move_insn (reg
, val
);
2776 /* For version 1.37, try deleting this entirely. */
2781 /* Any regs containing parms remain in use through the call. */
2782 for (count
= 0; count
< nargs
; count
++)
2783 if (argvec
[count
].reg
!= 0)
2784 use_reg (&call_fusage
, argvec
[count
].reg
);
2786 /* Pass the function the address in which to return a structure value. */
2787 if (mem_value
!= 0 && struct_value_rtx
!= 0 && ! pcc_struct_value
)
2789 emit_move_insn (struct_value_rtx
,
2791 force_operand (XEXP (mem_value
, 0),
2793 if (GET_CODE (struct_value_rtx
) == REG
)
2794 use_reg (&call_fusage
, struct_value_rtx
);
2797 /* Don't allow popping to be deferred, since then
2798 cse'ing of library calls could delete a call and leave the pop. */
2801 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
2802 will set inhibit_defer_pop to that value. */
2804 emit_call_1 (fun
, get_identifier (XSTR (orgfun
, 0)), args_size
.constant
,
2806 FUNCTION_ARG (args_so_far
, VOIDmode
, void_type_node
, 1),
2807 (outmode
!= VOIDmode
&& mem_value
== 0
2808 ? hard_libcall_value (outmode
) : NULL_RTX
),
2809 old_inhibit_defer_pop
+ 1, call_fusage
, is_const
);
2811 /* Now restore inhibit_defer_pop to its actual original value. */
2816 /* Copy the value to the right place. */
2817 if (outmode
!= VOIDmode
)
2823 if (value
!= mem_value
)
2824 emit_move_insn (value
, mem_value
);
2826 else if (value
!= 0)
2827 emit_move_insn (value
, hard_libcall_value (outmode
));
2829 value
= hard_libcall_value (outmode
);
2836 /* Return an rtx which represents a suitable home on the stack
2837 given TYPE, the type of the argument looking for a home.
2838 This is called only for BLKmode arguments.
2840 SIZE is the size needed for this target.
2841 ARGS_ADDR is the address of the bottom of the argument block for this call.
2842 OFFSET describes this parameter's offset into ARGS_ADDR. It is meaningless
2843 if this machine uses push insns. */
2846 target_for_arg (type
, size
, args_addr
, offset
)
2850 struct args_size offset
;
2853 rtx offset_rtx
= ARGS_SIZE_RTX (offset
);
2855 /* We do not call memory_address if possible,
2856 because we want to address as close to the stack
2857 as possible. For non-variable sized arguments,
2858 this will be stack-pointer relative addressing. */
2859 if (GET_CODE (offset_rtx
) == CONST_INT
)
2860 target
= plus_constant (args_addr
, INTVAL (offset_rtx
));
2863 /* I have no idea how to guarantee that this
2864 will work in the presence of register parameters. */
2865 target
= gen_rtx (PLUS
, Pmode
, args_addr
, offset_rtx
);
2866 target
= memory_address (QImode
, target
);
2869 return gen_rtx (MEM
, BLKmode
, target
);
2873 /* Store a single argument for a function call
2874 into the register or memory area where it must be passed.
2875 *ARG describes the argument value and where to pass it.
2877 ARGBLOCK is the address of the stack-block for all the arguments,
2878 or 0 on a machine where arguments are pushed individually.
2880 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
2881 so must be careful about how the stack is used.
2883 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
2884 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
2885 that we need not worry about saving and restoring the stack.
2887 FNDECL is the declaration of the function we are calling. */
2890 store_one_arg (arg
, argblock
, may_be_alloca
, variable_size
, fndecl
,
2891 reg_parm_stack_space
)
2892 struct arg_data
*arg
;
2897 int reg_parm_stack_space
;
2899 register tree pval
= arg
->tree_value
;
2903 int i
, lower_bound
, upper_bound
;
2905 if (TREE_CODE (pval
) == ERROR_MARK
)
2908 /* Push a new temporary level for any temporaries we make for
2912 #ifdef ACCUMULATE_OUTGOING_ARGS
2913 /* If this is being stored into a pre-allocated, fixed-size, stack area,
2914 save any previous data at that location. */
2915 if (argblock
&& ! variable_size
&& arg
->stack
)
2917 #ifdef ARGS_GROW_DOWNWARD
2918 /* stack_slot is negative, but we want to index stack_usage_map */
2919 /* with positive values. */
2920 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
2921 upper_bound
= -INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1)) + 1;
2925 lower_bound
= upper_bound
- arg
->size
.constant
;
2927 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
2928 lower_bound
= INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1));
2932 upper_bound
= lower_bound
+ arg
->size
.constant
;
2935 for (i
= lower_bound
; i
< upper_bound
; i
++)
2936 if (stack_usage_map
[i
]
2937 #ifdef REG_PARM_STACK_SPACE
2938 /* Don't store things in the fixed argument area at this point;
2939 it has already been saved. */
2940 && i
> reg_parm_stack_space
2945 if (i
!= upper_bound
)
2947 /* We need to make a save area. See what mode we can make it. */
2948 enum machine_mode save_mode
2949 = mode_for_size (arg
->size
.constant
* BITS_PER_UNIT
, MODE_INT
, 1);
2951 = gen_rtx (MEM
, save_mode
,
2952 memory_address (save_mode
, XEXP (arg
->stack_slot
, 0)));
2954 if (save_mode
== BLKmode
)
2956 arg
->save_area
= assign_stack_temp (BLKmode
,
2957 arg
->size
.constant
, 1);
2958 MEM_IN_STRUCT_P (arg
->save_area
)
2959 = AGGREGATE_TYPE_P (TREE_TYPE (arg
->tree_value
));
2960 preserve_temp_slots (arg
->save_area
);
2961 emit_block_move (validize_mem (arg
->save_area
), stack_area
,
2962 GEN_INT (arg
->size
.constant
),
2963 PARM_BOUNDARY
/ BITS_PER_UNIT
);
2967 arg
->save_area
= gen_reg_rtx (save_mode
);
2968 emit_move_insn (arg
->save_area
, stack_area
);
2974 /* If this isn't going to be placed on both the stack and in registers,
2975 set up the register and number of words. */
2976 if (! arg
->pass_on_stack
)
2977 reg
= arg
->reg
, partial
= arg
->partial
;
2979 if (reg
!= 0 && partial
== 0)
2980 /* Being passed entirely in a register. We shouldn't be called in
2984 #ifdef STRICT_ALIGNMENT
2985 /* If this arg needs special alignment, don't load the registers
2987 if (arg
->n_aligned_regs
!= 0)
2991 /* If this is being partially passed in a register, but multiple locations
2992 are specified, we assume that the one partially used is the one that is
2994 if (reg
&& GET_CODE (reg
) == EXPR_LIST
)
2995 reg
= XEXP (reg
, 0);
2997 /* If this is being passed partially in a register, we can't evaluate
2998 it directly into its stack slot. Otherwise, we can. */
2999 if (arg
->value
== 0)
3001 #ifdef ACCUMULATE_OUTGOING_ARGS
3002 /* stack_arg_under_construction is nonzero if a function argument is
3003 being evaluated directly into the outgoing argument list and
3004 expand_call must take special action to preserve the argument list
3005 if it is called recursively.
3007 For scalar function arguments stack_usage_map is sufficient to
3008 determine which stack slots must be saved and restored. Scalar
3009 arguments in general have pass_on_stack == 0.
3011 If this argument is initialized by a function which takes the
3012 address of the argument (a C++ constructor or a C function
3013 returning a BLKmode structure), then stack_usage_map is
3014 insufficient and expand_call must push the stack around the
3015 function call. Such arguments have pass_on_stack == 1.
3017 Note that it is always safe to set stack_arg_under_construction,
3018 but this generates suboptimal code if set when not needed. */
3020 if (arg
->pass_on_stack
)
3021 stack_arg_under_construction
++;
3023 arg
->value
= expand_expr (pval
,
3025 || TYPE_MODE (TREE_TYPE (pval
)) != arg
->mode
)
3026 ? NULL_RTX
: arg
->stack
,
3029 /* If we are promoting object (or for any other reason) the mode
3030 doesn't agree, convert the mode. */
3032 if (arg
->mode
!= TYPE_MODE (TREE_TYPE (pval
)))
3033 arg
->value
= convert_modes (arg
->mode
, TYPE_MODE (TREE_TYPE (pval
)),
3034 arg
->value
, arg
->unsignedp
);
3036 #ifdef ACCUMULATE_OUTGOING_ARGS
3037 if (arg
->pass_on_stack
)
3038 stack_arg_under_construction
--;
3042 /* Don't allow anything left on stack from computation
3043 of argument to alloca. */
3045 do_pending_stack_adjust ();
3047 if (arg
->value
== arg
->stack
)
3048 /* If the value is already in the stack slot, we are done. */
3050 else if (arg
->mode
!= BLKmode
)
3054 /* Argument is a scalar, not entirely passed in registers.
3055 (If part is passed in registers, arg->partial says how much
3056 and emit_push_insn will take care of putting it there.)
3058 Push it, and if its size is less than the
3059 amount of space allocated to it,
3060 also bump stack pointer by the additional space.
3061 Note that in C the default argument promotions
3062 will prevent such mismatches. */
3064 size
= GET_MODE_SIZE (arg
->mode
);
3065 /* Compute how much space the push instruction will push.
3066 On many machines, pushing a byte will advance the stack
3067 pointer by a halfword. */
3068 #ifdef PUSH_ROUNDING
3069 size
= PUSH_ROUNDING (size
);
3073 /* Compute how much space the argument should get:
3074 round up to a multiple of the alignment for arguments. */
3075 if (none
!= FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)))
3076 used
= (((size
+ PARM_BOUNDARY
/ BITS_PER_UNIT
- 1)
3077 / (PARM_BOUNDARY
/ BITS_PER_UNIT
))
3078 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
3080 /* This isn't already where we want it on the stack, so put it there.
3081 This can either be done with push or copy insns. */
3082 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), NULL_RTX
,
3083 0, partial
, reg
, used
- size
,
3084 argblock
, ARGS_SIZE_RTX (arg
->offset
));
3088 /* BLKmode, at least partly to be pushed. */
3090 register int excess
;
3093 /* Pushing a nonscalar.
3094 If part is passed in registers, PARTIAL says how much
3095 and emit_push_insn will take care of putting it there. */
3097 /* Round its size up to a multiple
3098 of the allocation unit for arguments. */
3100 if (arg
->size
.var
!= 0)
3103 size_rtx
= ARGS_SIZE_RTX (arg
->size
);
3107 /* PUSH_ROUNDING has no effect on us, because
3108 emit_push_insn for BLKmode is careful to avoid it. */
3109 excess
= (arg
->size
.constant
- int_size_in_bytes (TREE_TYPE (pval
))
3110 + partial
* UNITS_PER_WORD
);
3111 size_rtx
= expr_size (pval
);
3114 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), size_rtx
,
3115 TYPE_ALIGN (TREE_TYPE (pval
)) / BITS_PER_UNIT
, partial
,
3116 reg
, excess
, argblock
, ARGS_SIZE_RTX (arg
->offset
));
3120 /* Unless this is a partially-in-register argument, the argument is now
3123 ??? Note that this can change arg->value from arg->stack to
3124 arg->stack_slot and it matters when they are not the same.
3125 It isn't totally clear that this is correct in all cases. */
3127 arg
->value
= arg
->stack_slot
;
3129 /* Once we have pushed something, pops can't safely
3130 be deferred during the rest of the arguments. */
3133 /* ANSI doesn't require a sequence point here,
3134 but PCC has one, so this will avoid some problems. */
3137 /* Free any temporary slots made in processing this argument. Show
3138 that we might have taken the address of something and pushed that
3140 preserve_temp_slots (NULL_RTX
);
3144 #ifdef ACCUMULATE_OUTGOING_ARGS
3145 /* Now mark the segment we just used. */
3146 if (argblock
&& ! variable_size
&& arg
->stack
)
3147 for (i
= lower_bound
; i
< upper_bound
; i
++)
3148 stack_usage_map
[i
] = 1;