1 /* Convert function calls to rtl insns, for GNU C compiler.
2 Copyright (C) 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998
3 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
36 #ifndef ACCUMULATE_OUTGOING_ARGS
37 #define ACCUMULATE_OUTGOING_ARGS 0
40 /* Supply a default definition for PUSH_ARGS. */
43 #define PUSH_ARGS !ACCUMULATE_OUTGOING_ARGS
49 #if !defined FUNCTION_OK_FOR_SIBCALL
50 #define FUNCTION_OK_FOR_SIBCALL(DECL) 1
53 #if !defined PREFERRED_STACK_BOUNDARY && defined STACK_BOUNDARY
54 #define PREFERRED_STACK_BOUNDARY STACK_BOUNDARY
57 /* Decide whether a function's arguments should be processed
58 from first to last or from last to first.
60 They should if the stack and args grow in opposite directions, but
61 only if we have push insns. */
65 #if defined (STACK_GROWS_DOWNWARD) != defined (ARGS_GROW_DOWNWARD)
66 #define PUSH_ARGS_REVERSED PUSH_ARGS
71 #ifndef PUSH_ARGS_REVERSED
72 #define PUSH_ARGS_REVERSED 0
75 /* Like PREFERRED_STACK_BOUNDARY but in units of bytes, not bits. */
76 #define STACK_BYTES (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)
78 /* Data structure and subroutines used within expand_call. */
82 /* Tree node for this argument. */
84 /* Mode for value; TYPE_MODE unless promoted. */
85 enum machine_mode mode
;
86 /* Current RTL value for argument, or 0 if it isn't precomputed. */
88 /* Initially-compute RTL value for argument; only for const functions. */
90 /* Register to pass this argument in, 0 if passed on stack, or an
91 PARALLEL if the arg is to be copied into multiple non-contiguous
94 /* Register to pass this argument in when generating tail call sequence.
95 This is not the same register as for normal calls on machines with
98 /* If REG was promoted from the actual mode of the argument expression,
99 indicates whether the promotion is sign- or zero-extended. */
101 /* Number of registers to use. 0 means put the whole arg in registers.
102 Also 0 if not passed in registers. */
104 /* Non-zero if argument must be passed on stack.
105 Note that some arguments may be passed on the stack
106 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
107 pass_on_stack identifies arguments that *cannot* go in registers. */
109 /* Offset of this argument from beginning of stack-args. */
110 struct args_size offset
;
111 /* Similar, but offset to the start of the stack slot. Different from
112 OFFSET if this arg pads downward. */
113 struct args_size slot_offset
;
114 /* Size of this argument on the stack, rounded up for any padding it gets,
115 parts of the argument passed in registers do not count.
116 If REG_PARM_STACK_SPACE is defined, then register parms
117 are counted here as well. */
118 struct args_size size
;
119 /* Location on the stack at which parameter should be stored. The store
120 has already been done if STACK == VALUE. */
122 /* Location on the stack of the start of this argument slot. This can
123 differ from STACK if this arg pads downward. This location is known
124 to be aligned to FUNCTION_ARG_BOUNDARY. */
126 /* Place that this stack area has been saved, if needed. */
128 /* If an argument's alignment does not permit direct copying into registers,
129 copy in smaller-sized pieces into pseudos. These are stored in a
130 block pointed to by this field. The next field says how many
131 word-sized pseudos we made. */
134 /* The amount that the stack pointer needs to be adjusted to
135 force alignment for the next argument. */
136 struct args_size alignment_pad
;
139 /* A vector of one char per byte of stack space. A byte if non-zero if
140 the corresponding stack location has been used.
141 This vector is used to prevent a function call within an argument from
142 clobbering any stack already set up. */
143 static char *stack_usage_map
;
145 /* Size of STACK_USAGE_MAP. */
146 static int highest_outgoing_arg_in_use
;
148 /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding
149 stack location's tail call argument has been already stored into the stack.
150 This bitmap is used to prevent sibling call optimization if function tries
151 to use parent's incoming argument slots when they have been already
152 overwritten with tail call arguments. */
153 static sbitmap stored_args_map
;
155 /* stack_arg_under_construction is nonzero when an argument may be
156 initialized with a constructor call (including a C function that
157 returns a BLKmode struct) and expand_call must take special action
158 to make sure the object being constructed does not overlap the
159 argument list for the constructor call. */
160 int stack_arg_under_construction
;
162 static int calls_function
PARAMS ((tree
, int));
163 static int calls_function_1
PARAMS ((tree
, int));
165 /* Nonzero if this is a call to a `const' function. */
167 /* Nonzero if this is a call to a `volatile' function. */
168 #define ECF_NORETURN 2
169 /* Nonzero if this is a call to malloc or a related function. */
171 /* Nonzero if it is plausible that this is a call to alloca. */
172 #define ECF_MAY_BE_ALLOCA 8
173 /* Nonzero if this is a call to a function that won't throw an exception. */
174 #define ECF_NOTHROW 16
175 /* Nonzero if this is a call to setjmp or a related function. */
176 #define ECF_RETURNS_TWICE 32
177 /* Nonzero if this is a call to `longjmp'. */
178 #define ECF_LONGJMP 64
179 /* Nonzero if this is a syscall that makes a new process in the image of
181 #define ECF_FORK_OR_EXEC 128
182 #define ECF_SIBCALL 256
183 /* Nonzero if this is a call to "pure" function (like const function,
184 but may read memory. */
186 /* Nonzero if this is a call to a function that returns with the stack
187 pointer depressed. */
188 #define ECF_SP_DEPRESSED 1024
190 static void emit_call_1
PARAMS ((rtx
, tree
, tree
, HOST_WIDE_INT
,
191 HOST_WIDE_INT
, HOST_WIDE_INT
, rtx
,
192 rtx
, int, rtx
, int));
193 static void precompute_register_parameters
PARAMS ((int,
196 static int store_one_arg
PARAMS ((struct arg_data
*, rtx
, int, int,
198 static void store_unaligned_arguments_into_pseudos
PARAMS ((struct arg_data
*,
200 static int finalize_must_preallocate
PARAMS ((int, int,
202 struct args_size
*));
203 static void precompute_arguments
PARAMS ((int, int,
205 static int compute_argument_block_size
PARAMS ((int,
208 static void initialize_argument_information
PARAMS ((int,
215 static void compute_argument_addresses
PARAMS ((struct arg_data
*,
217 static rtx rtx_for_function_call
PARAMS ((tree
, tree
));
218 static void load_register_parameters
PARAMS ((struct arg_data
*,
220 static rtx emit_library_call_value_1
PARAMS ((int, rtx
, rtx
,
224 static int special_function_p
PARAMS ((tree
, int));
225 static int flags_from_decl_or_type
PARAMS ((tree
));
226 static rtx try_to_integrate
PARAMS ((tree
, tree
, rtx
,
228 static int check_sibcall_argument_overlap_1
PARAMS ((rtx
));
229 static int check_sibcall_argument_overlap
PARAMS ((rtx
, struct arg_data
*));
231 static int combine_pending_stack_adjustment_and_call
232 PARAMS ((int, struct args_size
*, int));
234 #ifdef REG_PARM_STACK_SPACE
235 static rtx save_fixed_argument_area
PARAMS ((int, rtx
, int *, int *));
236 static void restore_fixed_argument_area
PARAMS ((rtx
, rtx
, int, int));
239 /* If WHICH is 1, return 1 if EXP contains a call to the built-in function
242 If WHICH is 0, return 1 if EXP contains a call to any function.
243 Actually, we only need return 1 if evaluating EXP would require pushing
244 arguments on the stack, but that is too difficult to compute, so we just
245 assume any function call might require the stack. */
247 static tree calls_function_save_exprs
;
250 calls_function (exp
, which
)
256 calls_function_save_exprs
= 0;
257 val
= calls_function_1 (exp
, which
);
258 calls_function_save_exprs
= 0;
262 /* Recursive function to do the work of above function. */
265 calls_function_1 (exp
, which
)
270 enum tree_code code
= TREE_CODE (exp
);
271 int class = TREE_CODE_CLASS (code
);
272 int length
= first_rtl_op (code
);
274 /* If this code is language-specific, we don't know what it will do. */
275 if ((int) code
>= NUM_TREE_CODES
)
283 else if ((TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))))
285 && (TYPE_RETURNS_STACK_DEPRESSED
286 (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))))))
288 else if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
289 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
291 && (special_function_p (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
293 & ECF_MAY_BE_ALLOCA
))
302 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
!= 0; tem
= TREE_CHAIN (tem
))
303 if (calls_function_1 (TREE_VALUE (tem
), which
))
310 if (SAVE_EXPR_RTL (exp
) != 0)
312 if (value_member (exp
, calls_function_save_exprs
))
314 calls_function_save_exprs
= tree_cons (NULL_TREE
, exp
,
315 calls_function_save_exprs
);
316 return (TREE_OPERAND (exp
, 0) != 0
317 && calls_function_1 (TREE_OPERAND (exp
, 0), which
));
322 register tree subblock
;
324 for (local
= BLOCK_VARS (exp
); local
; local
= TREE_CHAIN (local
))
325 if (DECL_INITIAL (local
) != 0
326 && calls_function_1 (DECL_INITIAL (local
), which
))
329 for (subblock
= BLOCK_SUBBLOCKS (exp
);
331 subblock
= TREE_CHAIN (subblock
))
332 if (calls_function_1 (subblock
, which
))
338 for (; exp
!= 0; exp
= TREE_CHAIN (exp
))
339 if (calls_function_1 (TREE_VALUE (exp
), which
))
347 /* Only expressions, references, and blocks can contain calls. */
348 if (! IS_EXPR_CODE_CLASS (class) && class != 'r' && class != 'b')
351 for (i
= 0; i
< length
; i
++)
352 if (TREE_OPERAND (exp
, i
) != 0
353 && calls_function_1 (TREE_OPERAND (exp
, i
), which
))
359 /* Force FUNEXP into a form suitable for the address of a CALL,
360 and return that as an rtx. Also load the static chain register
361 if FNDECL is a nested function.
363 CALL_FUSAGE points to a variable holding the prospective
364 CALL_INSN_FUNCTION_USAGE information. */
367 prepare_call_address (funexp
, fndecl
, call_fusage
, reg_parm_seen
)
373 rtx static_chain_value
= 0;
375 funexp
= protect_from_queue (funexp
, 0);
378 /* Get possible static chain value for nested function in C. */
379 static_chain_value
= lookup_static_chain (fndecl
);
381 /* Make a valid memory address and copy constants thru pseudo-regs,
382 but not for a constant address if -fno-function-cse. */
383 if (GET_CODE (funexp
) != SYMBOL_REF
)
384 /* If we are using registers for parameters, force the
385 function address into a register now. */
386 funexp
= ((SMALL_REGISTER_CLASSES
&& reg_parm_seen
)
387 ? force_not_mem (memory_address (FUNCTION_MODE
, funexp
))
388 : memory_address (FUNCTION_MODE
, funexp
));
391 #ifndef NO_FUNCTION_CSE
392 if (optimize
&& ! flag_no_function_cse
)
393 #ifdef NO_RECURSIVE_FUNCTION_CSE
394 if (fndecl
!= current_function_decl
)
396 funexp
= force_reg (Pmode
, funexp
);
400 if (static_chain_value
!= 0)
402 emit_move_insn (static_chain_rtx
, static_chain_value
);
404 if (GET_CODE (static_chain_rtx
) == REG
)
405 use_reg (call_fusage
, static_chain_rtx
);
411 /* Generate instructions to call function FUNEXP,
412 and optionally pop the results.
413 The CALL_INSN is the first insn generated.
415 FNDECL is the declaration node of the function. This is given to the
416 macro RETURN_POPS_ARGS to determine whether this function pops its own args.
418 FUNTYPE is the data type of the function. This is given to the macro
419 RETURN_POPS_ARGS to determine whether this function pops its own args.
420 We used to allow an identifier for library functions, but that doesn't
421 work when the return type is an aggregate type and the calling convention
422 says that the pointer to this aggregate is to be popped by the callee.
424 STACK_SIZE is the number of bytes of arguments on the stack,
425 ROUNDED_STACK_SIZE is that number rounded up to
426 PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is
427 both to put into the call insn and to generate explicit popping
430 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
431 It is zero if this call doesn't want a structure value.
433 NEXT_ARG_REG is the rtx that results from executing
434 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1)
435 just after all the args have had their registers assigned.
436 This could be whatever you like, but normally it is the first
437 arg-register beyond those used for args in this call,
438 or 0 if all the arg-registers are used in this call.
439 It is passed on to `gen_call' so you can put this info in the call insn.
441 VALREG is a hard register in which a value is returned,
442 or 0 if the call does not return a value.
444 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
445 the args to this call were processed.
446 We restore `inhibit_defer_pop' to that value.
448 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
449 denote registers used by the called function. */
452 emit_call_1 (funexp
, fndecl
, funtype
, stack_size
, rounded_stack_size
,
453 struct_value_size
, next_arg_reg
, valreg
, old_inhibit_defer_pop
,
454 call_fusage
, ecf_flags
)
456 tree fndecl ATTRIBUTE_UNUSED
;
457 tree funtype ATTRIBUTE_UNUSED
;
458 HOST_WIDE_INT stack_size ATTRIBUTE_UNUSED
;
459 HOST_WIDE_INT rounded_stack_size
;
460 HOST_WIDE_INT struct_value_size ATTRIBUTE_UNUSED
;
463 int old_inhibit_defer_pop
;
467 rtx rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
469 int already_popped
= 0;
470 HOST_WIDE_INT n_popped
= RETURN_POPS_ARGS (fndecl
, funtype
, stack_size
);
471 #if defined (HAVE_call) && defined (HAVE_call_value)
472 rtx struct_value_size_rtx
;
473 struct_value_size_rtx
= GEN_INT (struct_value_size
);
476 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
477 and we don't want to load it into a register as an optimization,
478 because prepare_call_address already did it if it should be done. */
479 if (GET_CODE (funexp
) != SYMBOL_REF
)
480 funexp
= memory_address (FUNCTION_MODE
, funexp
);
482 #if defined (HAVE_sibcall_pop) && defined (HAVE_sibcall_value_pop)
483 if ((ecf_flags
& ECF_SIBCALL
)
484 && HAVE_sibcall_pop
&& HAVE_sibcall_value_pop
485 && (n_popped
> 0 || stack_size
== 0))
487 rtx n_pop
= GEN_INT (n_popped
));
490 /* If this subroutine pops its own args, record that in the call insn
491 if possible, for the sake of frame pointer elimination. */
494 pat
= GEN_SIBCALL_VALUE_POP (valreg
,
495 gen_rtx_MEM (FUNCTION_MODE
, funexp
),
496 rounded_stack_size_rtx
, next_arg_reg
,
499 pat
= GEN_SIBCALL_POP (gen_rtx_MEM (FUNCTION_MODE
, funexp
),
500 rounded_stack_size_rtx
, next_arg_reg
, n_pop
);
502 emit_call_insn (pat
);
508 #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop)
509 /* If the target has "call" or "call_value" insns, then prefer them
510 if no arguments are actually popped. If the target does not have
511 "call" or "call_value" insns, then we must use the popping versions
512 even if the call has no arguments to pop. */
513 #if defined (HAVE_call) && defined (HAVE_call_value)
514 if (HAVE_call
&& HAVE_call_value
&& HAVE_call_pop
&& HAVE_call_value_pop
515 && n_popped
> 0 && ! (ecf_flags
& ECF_SP_DEPRESSED
))
517 if (HAVE_call_pop
&& HAVE_call_value_pop
)
520 rtx n_pop
= GEN_INT (n_popped
);
523 /* If this subroutine pops its own args, record that in the call insn
524 if possible, for the sake of frame pointer elimination. */
527 pat
= GEN_CALL_VALUE_POP (valreg
,
528 gen_rtx_MEM (FUNCTION_MODE
, funexp
),
529 rounded_stack_size_rtx
, next_arg_reg
, n_pop
);
531 pat
= GEN_CALL_POP (gen_rtx_MEM (FUNCTION_MODE
, funexp
),
532 rounded_stack_size_rtx
, next_arg_reg
, n_pop
);
534 emit_call_insn (pat
);
540 #if defined (HAVE_sibcall) && defined (HAVE_sibcall_value)
541 if ((ecf_flags
& ECF_SIBCALL
)
542 && HAVE_sibcall
&& HAVE_sibcall_value
)
545 emit_call_insn (GEN_SIBCALL_VALUE (valreg
,
546 gen_rtx_MEM (FUNCTION_MODE
, funexp
),
547 rounded_stack_size_rtx
,
548 next_arg_reg
, NULL_RTX
));
550 emit_call_insn (GEN_SIBCALL (gen_rtx_MEM (FUNCTION_MODE
, funexp
),
551 rounded_stack_size_rtx
, next_arg_reg
,
552 struct_value_size_rtx
));
557 #if defined (HAVE_call) && defined (HAVE_call_value)
558 if (HAVE_call
&& HAVE_call_value
)
561 emit_call_insn (GEN_CALL_VALUE (valreg
,
562 gen_rtx_MEM (FUNCTION_MODE
, funexp
),
563 rounded_stack_size_rtx
, next_arg_reg
,
566 emit_call_insn (GEN_CALL (gen_rtx_MEM (FUNCTION_MODE
, funexp
),
567 rounded_stack_size_rtx
, next_arg_reg
,
568 struct_value_size_rtx
));
574 /* Find the CALL insn we just emitted. */
575 for (call_insn
= get_last_insn ();
576 call_insn
&& GET_CODE (call_insn
) != CALL_INSN
;
577 call_insn
= PREV_INSN (call_insn
))
583 /* Mark memory as used for "pure" function call. */
584 if (ecf_flags
& ECF_PURE
)
586 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
587 gen_rtx_USE (VOIDmode
,
588 gen_rtx_MEM (BLKmode
,
589 gen_rtx_SCRATCH (VOIDmode
))), call_fusage
);
592 /* Put the register usage information on the CALL. If there is already
593 some usage information, put ours at the end. */
594 if (CALL_INSN_FUNCTION_USAGE (call_insn
))
598 for (link
= CALL_INSN_FUNCTION_USAGE (call_insn
); XEXP (link
, 1) != 0;
599 link
= XEXP (link
, 1))
602 XEXP (link
, 1) = call_fusage
;
605 CALL_INSN_FUNCTION_USAGE (call_insn
) = call_fusage
;
607 /* If this is a const call, then set the insn's unchanging bit. */
608 if (ecf_flags
& (ECF_CONST
| ECF_PURE
))
609 CONST_CALL_P (call_insn
) = 1;
611 /* If this call can't throw, attach a REG_EH_REGION reg note to that
613 if (ecf_flags
& ECF_NOTHROW
)
614 REG_NOTES (call_insn
) = gen_rtx_EXPR_LIST (REG_EH_REGION
, const0_rtx
,
615 REG_NOTES (call_insn
));
617 if (ecf_flags
& ECF_NORETURN
)
618 REG_NOTES (call_insn
) = gen_rtx_EXPR_LIST (REG_NORETURN
, const0_rtx
,
619 REG_NOTES (call_insn
));
621 SIBLING_CALL_P (call_insn
) = ((ecf_flags
& ECF_SIBCALL
) != 0);
623 /* Restore this now, so that we do defer pops for this call's args
624 if the context of the call as a whole permits. */
625 inhibit_defer_pop
= old_inhibit_defer_pop
;
630 CALL_INSN_FUNCTION_USAGE (call_insn
)
631 = gen_rtx_EXPR_LIST (VOIDmode
,
632 gen_rtx_CLOBBER (VOIDmode
, stack_pointer_rtx
),
633 CALL_INSN_FUNCTION_USAGE (call_insn
));
634 rounded_stack_size
-= n_popped
;
635 rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
636 stack_pointer_delta
-= n_popped
;
639 if (!ACCUMULATE_OUTGOING_ARGS
)
641 /* If returning from the subroutine does not automatically pop the args,
642 we need an instruction to pop them sooner or later.
643 Perhaps do it now; perhaps just record how much space to pop later.
645 If returning from the subroutine does pop the args, indicate that the
646 stack pointer will be changed. */
648 if (rounded_stack_size
!= 0 && ! (ecf_flags
& ECF_SP_DEPRESSED
))
650 if (flag_defer_pop
&& inhibit_defer_pop
== 0
651 && ! (ecf_flags
& (ECF_CONST
| ECF_PURE
)))
652 pending_stack_adjust
+= rounded_stack_size
;
654 adjust_stack (rounded_stack_size_rtx
);
657 /* When we accumulate outgoing args, we must avoid any stack manipulations.
658 Restore the stack pointer to its original value now. Usually
659 ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions.
660 On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and
661 popping variants of functions exist as well.
663 ??? We may optimize similar to defer_pop above, but it is
664 probably not worthwhile.
666 ??? It will be worthwhile to enable combine_stack_adjustments even for
669 anti_adjust_stack (GEN_INT (n_popped
));
672 /* Determine if the function identified by NAME and FNDECL is one with
673 special properties we wish to know about.
675 For example, if the function might return more than one time (setjmp), then
676 set RETURNS_TWICE to a nonzero value.
678 Similarly set LONGJMP for if the function is in the longjmp family.
680 Set MALLOC for any of the standard memory allocation functions which
681 allocate from the heap.
683 Set MAY_BE_ALLOCA for any memory allocation function that might allocate
684 space from the stack such as alloca. */
687 special_function_p (fndecl
, flags
)
691 if (! (flags
& ECF_MALLOC
)
692 && fndecl
&& DECL_NAME (fndecl
)
693 && IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) <= 17
694 /* Exclude functions not at the file scope, or not `extern',
695 since they are not the magic functions we would otherwise
697 && DECL_CONTEXT (fndecl
) == NULL_TREE
&& TREE_PUBLIC (fndecl
))
699 const char *name
= IDENTIFIER_POINTER (DECL_NAME (fndecl
));
700 const char *tname
= name
;
702 /* We assume that alloca will always be called by name. It
703 makes no sense to pass it as a pointer-to-function to
704 anything that does not understand its behavior. */
705 if (((IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 6
707 && ! strcmp (name
, "alloca"))
708 || (IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 16
710 && ! strcmp (name
, "__builtin_alloca"))))
711 flags
|= ECF_MAY_BE_ALLOCA
;
713 /* Disregard prefix _, __ or __x. */
716 if (name
[1] == '_' && name
[2] == 'x')
718 else if (name
[1] == '_')
727 && (! strcmp (tname
, "setjmp")
728 || ! strcmp (tname
, "setjmp_syscall")))
730 && ! strcmp (tname
, "sigsetjmp"))
732 && ! strcmp (tname
, "savectx")))
733 flags
|= ECF_RETURNS_TWICE
;
736 && ! strcmp (tname
, "siglongjmp"))
737 flags
|= ECF_LONGJMP
;
739 else if ((tname
[0] == 'q' && tname
[1] == 's'
740 && ! strcmp (tname
, "qsetjmp"))
741 || (tname
[0] == 'v' && tname
[1] == 'f'
742 && ! strcmp (tname
, "vfork")))
743 flags
|= ECF_RETURNS_TWICE
;
745 else if (tname
[0] == 'l' && tname
[1] == 'o'
746 && ! strcmp (tname
, "longjmp"))
747 flags
|= ECF_LONGJMP
;
749 else if ((tname
[0] == 'f' && tname
[1] == 'o'
750 && ! strcmp (tname
, "fork"))
751 /* Linux specific: __clone. check NAME to insist on the
752 leading underscores, to avoid polluting the ISO / POSIX
754 || (name
[0] == '_' && name
[1] == '_'
755 && ! strcmp (tname
, "clone"))
756 || (tname
[0] == 'e' && tname
[1] == 'x' && tname
[2] == 'e'
757 && tname
[3] == 'c' && (tname
[4] == 'l' || tname
[4] == 'v')
759 || ((tname
[5] == 'p' || tname
[5] == 'e')
760 && tname
[6] == '\0'))))
761 flags
|= ECF_FORK_OR_EXEC
;
763 /* Do not add any more malloc-like functions to this list,
764 instead mark them as malloc functions using the malloc attribute.
765 Note, realloc is not suitable for attribute malloc since
766 it may return the same address across multiple calls.
767 C++ operator new is not suitable because it is not required
768 to return a unique pointer; indeed, the standard placement new
769 just returns its argument. */
770 else if (TYPE_MODE (TREE_TYPE (TREE_TYPE (fndecl
))) == Pmode
771 && (! strcmp (tname
, "malloc")
772 || ! strcmp (tname
, "calloc")
773 || ! strcmp (tname
, "strdup")))
779 /* Return nonzero when tree represent call to longjmp. */
782 setjmp_call_p (fndecl
)
785 return special_function_p (fndecl
, 0) & ECF_RETURNS_TWICE
;
788 /* Detect flags (function attributes) from the function type node. */
791 flags_from_decl_or_type (exp
)
796 /* ??? We can't set IS_MALLOC for function types? */
799 /* The function exp may have the `malloc' attribute. */
800 if (DECL_P (exp
) && DECL_IS_MALLOC (exp
))
803 /* The function exp may have the `pure' attribute. */
804 if (DECL_P (exp
) && DECL_IS_PURE (exp
))
807 if (TREE_NOTHROW (exp
))
808 flags
|= ECF_NOTHROW
;
811 if (TREE_READONLY (exp
) && ! TREE_THIS_VOLATILE (exp
))
814 if (TREE_THIS_VOLATILE (exp
))
815 flags
|= ECF_NORETURN
;
820 /* Precompute all register parameters as described by ARGS, storing values
821 into fields within the ARGS array.
823 NUM_ACTUALS indicates the total number elements in the ARGS array.
825 Set REG_PARM_SEEN if we encounter a register parameter. */
828 precompute_register_parameters (num_actuals
, args
, reg_parm_seen
)
830 struct arg_data
*args
;
837 for (i
= 0; i
< num_actuals
; i
++)
838 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
)
842 if (args
[i
].value
== 0)
845 args
[i
].value
= expand_expr (args
[i
].tree_value
, NULL_RTX
,
847 preserve_temp_slots (args
[i
].value
);
850 /* ANSI doesn't require a sequence point here,
851 but PCC has one, so this will avoid some problems. */
855 /* If we are to promote the function arg to a wider mode,
858 if (args
[i
].mode
!= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)))
860 = convert_modes (args
[i
].mode
,
861 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
862 args
[i
].value
, args
[i
].unsignedp
);
864 /* If the value is expensive, and we are inside an appropriately
865 short loop, put the value into a pseudo and then put the pseudo
868 For small register classes, also do this if this call uses
869 register parameters. This is to avoid reload conflicts while
870 loading the parameters registers. */
872 if ((! (GET_CODE (args
[i
].value
) == REG
873 || (GET_CODE (args
[i
].value
) == SUBREG
874 && GET_CODE (SUBREG_REG (args
[i
].value
)) == REG
)))
875 && args
[i
].mode
!= BLKmode
876 && rtx_cost (args
[i
].value
, SET
) > COSTS_N_INSNS (1)
877 && ((SMALL_REGISTER_CLASSES
&& *reg_parm_seen
)
878 || preserve_subexpressions_p ()))
879 args
[i
].value
= copy_to_mode_reg (args
[i
].mode
, args
[i
].value
);
883 #ifdef REG_PARM_STACK_SPACE
885 /* The argument list is the property of the called routine and it
886 may clobber it. If the fixed area has been used for previous
887 parameters, we must save and restore it. */
890 save_fixed_argument_area (reg_parm_stack_space
, argblock
,
891 low_to_save
, high_to_save
)
892 int reg_parm_stack_space
;
898 rtx save_area
= NULL_RTX
;
900 /* Compute the boundary of the that needs to be saved, if any. */
901 #ifdef ARGS_GROW_DOWNWARD
902 for (i
= 0; i
< reg_parm_stack_space
+ 1; i
++)
904 for (i
= 0; i
< reg_parm_stack_space
; i
++)
907 if (i
>= highest_outgoing_arg_in_use
908 || stack_usage_map
[i
] == 0)
911 if (*low_to_save
== -1)
917 if (*low_to_save
>= 0)
919 int num_to_save
= *high_to_save
- *low_to_save
+ 1;
920 enum machine_mode save_mode
921 = mode_for_size (num_to_save
* BITS_PER_UNIT
, MODE_INT
, 1);
924 /* If we don't have the required alignment, must do this in BLKmode. */
925 if ((*low_to_save
& (MIN (GET_MODE_SIZE (save_mode
),
926 BIGGEST_ALIGNMENT
/ UNITS_PER_WORD
) - 1)))
929 #ifdef ARGS_GROW_DOWNWARD
931 = gen_rtx_MEM (save_mode
,
932 memory_address (save_mode
,
933 plus_constant (argblock
,
936 stack_area
= gen_rtx_MEM (save_mode
,
937 memory_address (save_mode
,
938 plus_constant (argblock
,
941 if (save_mode
== BLKmode
)
943 save_area
= assign_stack_temp (BLKmode
, num_to_save
, 0);
944 /* Cannot use emit_block_move here because it can be done by a
945 library call which in turn gets into this place again and deadly
946 infinite recursion happens. */
947 move_by_pieces (validize_mem (save_area
), stack_area
, num_to_save
,
952 save_area
= gen_reg_rtx (save_mode
);
953 emit_move_insn (save_area
, stack_area
);
960 restore_fixed_argument_area (save_area
, argblock
, high_to_save
, low_to_save
)
966 enum machine_mode save_mode
= GET_MODE (save_area
);
967 #ifdef ARGS_GROW_DOWNWARD
969 = gen_rtx_MEM (save_mode
,
970 memory_address (save_mode
,
971 plus_constant (argblock
,
975 = gen_rtx_MEM (save_mode
,
976 memory_address (save_mode
,
977 plus_constant (argblock
,
981 if (save_mode
!= BLKmode
)
982 emit_move_insn (stack_area
, save_area
);
984 /* Cannot use emit_block_move here because it can be done by a library
985 call which in turn gets into this place again and deadly infinite
986 recursion happens. */
987 move_by_pieces (stack_area
, validize_mem (save_area
),
988 high_to_save
- low_to_save
+ 1, PARM_BOUNDARY
);
992 /* If any elements in ARGS refer to parameters that are to be passed in
993 registers, but not in memory, and whose alignment does not permit a
994 direct copy into registers. Copy the values into a group of pseudos
995 which we will later copy into the appropriate hard registers.
997 Pseudos for each unaligned argument will be stored into the array
998 args[argnum].aligned_regs. The caller is responsible for deallocating
999 the aligned_regs array if it is nonzero. */
1002 store_unaligned_arguments_into_pseudos (args
, num_actuals
)
1003 struct arg_data
*args
;
1008 for (i
= 0; i
< num_actuals
; i
++)
1009 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
1010 && args
[i
].mode
== BLKmode
1011 && (TYPE_ALIGN (TREE_TYPE (args
[i
].tree_value
))
1012 < (unsigned int) MIN (BIGGEST_ALIGNMENT
, BITS_PER_WORD
)))
1014 int bytes
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1015 int big_endian_correction
= 0;
1017 args
[i
].n_aligned_regs
1018 = args
[i
].partial
? args
[i
].partial
1019 : (bytes
+ (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
1021 args
[i
].aligned_regs
= (rtx
*) xmalloc (sizeof (rtx
)
1022 * args
[i
].n_aligned_regs
);
1024 /* Structures smaller than a word are aligned to the least
1025 significant byte (to the right). On a BYTES_BIG_ENDIAN machine,
1026 this means we must skip the empty high order bytes when
1027 calculating the bit offset. */
1028 if (BYTES_BIG_ENDIAN
&& bytes
< UNITS_PER_WORD
)
1029 big_endian_correction
= (BITS_PER_WORD
- (bytes
* BITS_PER_UNIT
));
1031 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1033 rtx reg
= gen_reg_rtx (word_mode
);
1034 rtx word
= operand_subword_force (args
[i
].value
, j
, BLKmode
);
1035 int bitsize
= MIN (bytes
* BITS_PER_UNIT
, BITS_PER_WORD
);
1036 int bitalign
= TYPE_ALIGN (TREE_TYPE (args
[i
].tree_value
));
1038 args
[i
].aligned_regs
[j
] = reg
;
1040 /* There is no need to restrict this code to loading items
1041 in TYPE_ALIGN sized hunks. The bitfield instructions can
1042 load up entire word sized registers efficiently.
1044 ??? This may not be needed anymore.
1045 We use to emit a clobber here but that doesn't let later
1046 passes optimize the instructions we emit. By storing 0 into
1047 the register later passes know the first AND to zero out the
1048 bitfield being set in the register is unnecessary. The store
1049 of 0 will be deleted as will at least the first AND. */
1051 emit_move_insn (reg
, const0_rtx
);
1053 bytes
-= bitsize
/ BITS_PER_UNIT
;
1054 store_bit_field (reg
, bitsize
, big_endian_correction
, word_mode
,
1055 extract_bit_field (word
, bitsize
, 0, 1, NULL_RTX
,
1056 word_mode
, word_mode
, bitalign
,
1058 bitalign
, BITS_PER_WORD
);
1063 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1066 NUM_ACTUALS is the total number of parameters.
1068 N_NAMED_ARGS is the total number of named arguments.
1070 FNDECL is the tree code for the target of this call (if known)
1072 ARGS_SO_FAR holds state needed by the target to know where to place
1075 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1076 for arguments which are passed in registers.
1078 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1079 and may be modified by this routine.
1081 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
1082 flags which may may be modified by this routine. */
1085 initialize_argument_information (num_actuals
, args
, args_size
, n_named_args
,
1086 actparms
, fndecl
, args_so_far
,
1087 reg_parm_stack_space
, old_stack_level
,
1088 old_pending_adj
, must_preallocate
,
1090 int num_actuals ATTRIBUTE_UNUSED
;
1091 struct arg_data
*args
;
1092 struct args_size
*args_size
;
1093 int n_named_args ATTRIBUTE_UNUSED
;
1096 CUMULATIVE_ARGS
*args_so_far
;
1097 int reg_parm_stack_space
;
1098 rtx
*old_stack_level
;
1099 int *old_pending_adj
;
1100 int *must_preallocate
;
1103 /* 1 if scanning parms front to back, -1 if scanning back to front. */
1106 /* Count arg position in order args appear. */
1109 struct args_size alignment_pad
;
1113 args_size
->constant
= 0;
1116 /* In this loop, we consider args in the order they are written.
1117 We fill up ARGS from the front or from the back if necessary
1118 so that in any case the first arg to be pushed ends up at the front. */
1120 if (PUSH_ARGS_REVERSED
)
1122 i
= num_actuals
- 1, inc
= -1;
1123 /* In this case, must reverse order of args
1124 so that we compute and push the last arg first. */
1131 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1132 for (p
= actparms
, argpos
= 0; p
; p
= TREE_CHAIN (p
), i
+= inc
, argpos
++)
1134 tree type
= TREE_TYPE (TREE_VALUE (p
));
1136 enum machine_mode mode
;
1138 args
[i
].tree_value
= TREE_VALUE (p
);
1140 /* Replace erroneous argument with constant zero. */
1141 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
1142 args
[i
].tree_value
= integer_zero_node
, type
= integer_type_node
;
1144 /* If TYPE is a transparent union, pass things the way we would
1145 pass the first field of the union. We have already verified that
1146 the modes are the same. */
1147 if (TREE_CODE (type
) == UNION_TYPE
&& TYPE_TRANSPARENT_UNION (type
))
1148 type
= TREE_TYPE (TYPE_FIELDS (type
));
1150 /* Decide where to pass this arg.
1152 args[i].reg is nonzero if all or part is passed in registers.
1154 args[i].partial is nonzero if part but not all is passed in registers,
1155 and the exact value says how many words are passed in registers.
1157 args[i].pass_on_stack is nonzero if the argument must at least be
1158 computed on the stack. It may then be loaded back into registers
1159 if args[i].reg is nonzero.
1161 These decisions are driven by the FUNCTION_... macros and must agree
1162 with those made by function.c. */
1164 /* See if this argument should be passed by invisible reference. */
1165 if ((TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
1166 && contains_placeholder_p (TYPE_SIZE (type
)))
1167 || TREE_ADDRESSABLE (type
)
1168 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
1169 || FUNCTION_ARG_PASS_BY_REFERENCE (*args_so_far
, TYPE_MODE (type
),
1170 type
, argpos
< n_named_args
)
1174 /* If we're compiling a thunk, pass through invisible
1175 references instead of making a copy. */
1176 if (current_function_is_thunk
1177 #ifdef FUNCTION_ARG_CALLEE_COPIES
1178 || (FUNCTION_ARG_CALLEE_COPIES (*args_so_far
, TYPE_MODE (type
),
1179 type
, argpos
< n_named_args
)
1180 /* If it's in a register, we must make a copy of it too. */
1181 /* ??? Is this a sufficient test? Is there a better one? */
1182 && !(TREE_CODE (args
[i
].tree_value
) == VAR_DECL
1183 && REG_P (DECL_RTL (args
[i
].tree_value
)))
1184 && ! TREE_ADDRESSABLE (type
))
1188 /* C++ uses a TARGET_EXPR to indicate that we want to make a
1189 new object from the argument. If we are passing by
1190 invisible reference, the callee will do that for us, so we
1191 can strip off the TARGET_EXPR. This is not always safe,
1192 but it is safe in the only case where this is a useful
1193 optimization; namely, when the argument is a plain object.
1194 In that case, the frontend is just asking the backend to
1195 make a bitwise copy of the argument. */
1197 if (TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
1198 && (DECL_P (TREE_OPERAND (args
[i
].tree_value
, 1)))
1199 && ! REG_P (DECL_RTL (TREE_OPERAND (args
[i
].tree_value
, 1))))
1200 args
[i
].tree_value
= TREE_OPERAND (args
[i
].tree_value
, 1);
1202 args
[i
].tree_value
= build1 (ADDR_EXPR
,
1203 build_pointer_type (type
),
1204 args
[i
].tree_value
);
1205 type
= build_pointer_type (type
);
1209 /* We make a copy of the object and pass the address to the
1210 function being called. */
1213 if (!COMPLETE_TYPE_P (type
)
1214 || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
1215 || (flag_stack_check
&& ! STACK_CHECK_BUILTIN
1216 && (0 < compare_tree_int (TYPE_SIZE_UNIT (type
),
1217 STACK_CHECK_MAX_VAR_SIZE
))))
1219 /* This is a variable-sized object. Make space on the stack
1221 rtx size_rtx
= expr_size (TREE_VALUE (p
));
1223 if (*old_stack_level
== 0)
1225 emit_stack_save (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
1226 *old_pending_adj
= pending_stack_adjust
;
1227 pending_stack_adjust
= 0;
1230 copy
= gen_rtx_MEM (BLKmode
,
1231 allocate_dynamic_stack_space
1232 (size_rtx
, NULL_RTX
, TYPE_ALIGN (type
)));
1233 set_mem_attributes (copy
, type
, 1);
1236 copy
= assign_temp (type
, 0, 1, 0);
1238 store_expr (args
[i
].tree_value
, copy
, 0);
1239 *ecf_flags
&= ~(ECF_CONST
| ECF_PURE
);
1241 args
[i
].tree_value
= build1 (ADDR_EXPR
,
1242 build_pointer_type (type
),
1243 make_tree (type
, copy
));
1244 type
= build_pointer_type (type
);
1248 mode
= TYPE_MODE (type
);
1249 unsignedp
= TREE_UNSIGNED (type
);
1251 #ifdef PROMOTE_FUNCTION_ARGS
1252 mode
= promote_mode (type
, mode
, &unsignedp
, 1);
1255 args
[i
].unsignedp
= unsignedp
;
1256 args
[i
].mode
= mode
;
1258 args
[i
].reg
= FUNCTION_ARG (*args_so_far
, mode
, type
,
1259 argpos
< n_named_args
);
1260 #ifdef FUNCTION_INCOMING_ARG
1261 /* If this is a sibling call and the machine has register windows, the
1262 register window has to be unwinded before calling the routine, so
1263 arguments have to go into the incoming registers. */
1264 args
[i
].tail_call_reg
= FUNCTION_INCOMING_ARG (*args_so_far
, mode
, type
,
1265 argpos
< n_named_args
);
1267 args
[i
].tail_call_reg
= args
[i
].reg
;
1270 #ifdef FUNCTION_ARG_PARTIAL_NREGS
1273 = FUNCTION_ARG_PARTIAL_NREGS (*args_so_far
, mode
, type
,
1274 argpos
< n_named_args
);
1277 args
[i
].pass_on_stack
= MUST_PASS_IN_STACK (mode
, type
);
1279 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1280 it means that we are to pass this arg in the register(s) designated
1281 by the PARALLEL, but also to pass it in the stack. */
1282 if (args
[i
].reg
&& GET_CODE (args
[i
].reg
) == PARALLEL
1283 && XEXP (XVECEXP (args
[i
].reg
, 0, 0), 0) == 0)
1284 args
[i
].pass_on_stack
= 1;
1286 /* If this is an addressable type, we must preallocate the stack
1287 since we must evaluate the object into its final location.
1289 If this is to be passed in both registers and the stack, it is simpler
1291 if (TREE_ADDRESSABLE (type
)
1292 || (args
[i
].pass_on_stack
&& args
[i
].reg
!= 0))
1293 *must_preallocate
= 1;
1295 /* If this is an addressable type, we cannot pre-evaluate it. Thus,
1296 we cannot consider this function call constant. */
1297 if (TREE_ADDRESSABLE (type
))
1298 *ecf_flags
&= ~(ECF_CONST
| ECF_PURE
);
1300 /* Compute the stack-size of this argument. */
1301 if (args
[i
].reg
== 0 || args
[i
].partial
!= 0
1302 || reg_parm_stack_space
> 0
1303 || args
[i
].pass_on_stack
)
1304 locate_and_pad_parm (mode
, type
,
1305 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1310 fndecl
, args_size
, &args
[i
].offset
,
1311 &args
[i
].size
, &alignment_pad
);
1313 #ifndef ARGS_GROW_DOWNWARD
1314 args
[i
].slot_offset
= *args_size
;
1317 args
[i
].alignment_pad
= alignment_pad
;
1319 /* If a part of the arg was put into registers,
1320 don't include that part in the amount pushed. */
1321 if (reg_parm_stack_space
== 0 && ! args
[i
].pass_on_stack
)
1322 args
[i
].size
.constant
-= ((args
[i
].partial
* UNITS_PER_WORD
)
1323 / (PARM_BOUNDARY
/ BITS_PER_UNIT
)
1324 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
1326 /* Update ARGS_SIZE, the total stack space for args so far. */
1328 args_size
->constant
+= args
[i
].size
.constant
;
1329 if (args
[i
].size
.var
)
1331 ADD_PARM_SIZE (*args_size
, args
[i
].size
.var
);
1334 /* Since the slot offset points to the bottom of the slot,
1335 we must record it after incrementing if the args grow down. */
1336 #ifdef ARGS_GROW_DOWNWARD
1337 args
[i
].slot_offset
= *args_size
;
1339 args
[i
].slot_offset
.constant
= -args_size
->constant
;
1341 SUB_PARM_SIZE (args
[i
].slot_offset
, args_size
->var
);
1344 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1345 have been used, etc. */
1347 FUNCTION_ARG_ADVANCE (*args_so_far
, TYPE_MODE (type
), type
,
1348 argpos
< n_named_args
);
1352 /* Update ARGS_SIZE to contain the total size for the argument block.
1353 Return the original constant component of the argument block's size.
1355 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
1356 for arguments passed in registers. */
1359 compute_argument_block_size (reg_parm_stack_space
, args_size
,
1360 preferred_stack_boundary
)
1361 int reg_parm_stack_space
;
1362 struct args_size
*args_size
;
1363 int preferred_stack_boundary ATTRIBUTE_UNUSED
;
1365 int unadjusted_args_size
= args_size
->constant
;
1367 /* For accumulate outgoing args mode we don't need to align, since the frame
1368 will be already aligned. Align to STACK_BOUNDARY in order to prevent
1369 backends from generating missaligned frame sizes. */
1370 #ifdef STACK_BOUNDARY
1371 if (ACCUMULATE_OUTGOING_ARGS
&& preferred_stack_boundary
> STACK_BOUNDARY
)
1372 preferred_stack_boundary
= STACK_BOUNDARY
;
1375 /* Compute the actual size of the argument block required. The variable
1376 and constant sizes must be combined, the size may have to be rounded,
1377 and there may be a minimum required size. */
1381 args_size
->var
= ARGS_SIZE_TREE (*args_size
);
1382 args_size
->constant
= 0;
1384 #ifdef PREFERRED_STACK_BOUNDARY
1385 preferred_stack_boundary
/= BITS_PER_UNIT
;
1386 if (preferred_stack_boundary
> 1)
1388 /* We don't handle this case yet. To handle it correctly we have
1389 to add the delta, round and substract the delta.
1390 Currently no machine description requires this support. */
1391 if (stack_pointer_delta
& (preferred_stack_boundary
- 1))
1393 args_size
->var
= round_up (args_size
->var
, preferred_stack_boundary
);
1397 if (reg_parm_stack_space
> 0)
1400 = size_binop (MAX_EXPR
, args_size
->var
,
1401 ssize_int (reg_parm_stack_space
));
1403 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1404 /* The area corresponding to register parameters is not to count in
1405 the size of the block we need. So make the adjustment. */
1407 = size_binop (MINUS_EXPR
, args_size
->var
,
1408 ssize_int (reg_parm_stack_space
));
1414 #ifdef PREFERRED_STACK_BOUNDARY
1415 preferred_stack_boundary
/= BITS_PER_UNIT
;
1416 if (preferred_stack_boundary
< 1)
1417 preferred_stack_boundary
= 1;
1418 args_size
->constant
= (((args_size
->constant
1419 + stack_pointer_delta
1420 + preferred_stack_boundary
- 1)
1421 / preferred_stack_boundary
1422 * preferred_stack_boundary
)
1423 - stack_pointer_delta
);
1426 args_size
->constant
= MAX (args_size
->constant
,
1427 reg_parm_stack_space
);
1429 #ifdef MAYBE_REG_PARM_STACK_SPACE
1430 if (reg_parm_stack_space
== 0)
1431 args_size
->constant
= 0;
1434 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1435 args_size
->constant
-= reg_parm_stack_space
;
1438 return unadjusted_args_size
;
1441 /* Precompute parameters as needed for a function call.
1443 FLAGS is mask of ECF_* constants.
1445 NUM_ACTUALS is the number of arguments.
1447 ARGS is an array containing information for each argument; this
1448 routine fills in the INITIAL_VALUE and VALUE fields for each
1449 precomputed argument. */
1452 precompute_arguments (flags
, num_actuals
, args
)
1455 struct arg_data
*args
;
1459 /* If this function call is cse'able, precompute all the parameters.
1460 Note that if the parameter is constructed into a temporary, this will
1461 cause an additional copy because the parameter will be constructed
1462 into a temporary location and then copied into the outgoing arguments.
1463 If a parameter contains a call to alloca and this function uses the
1464 stack, precompute the parameter. */
1466 /* If we preallocated the stack space, and some arguments must be passed
1467 on the stack, then we must precompute any parameter which contains a
1468 function call which will store arguments on the stack.
1469 Otherwise, evaluating the parameter may clobber previous parameters
1470 which have already been stored into the stack. (we have code to avoid
1471 such case by saving the ougoing stack arguments, but it results in
1474 for (i
= 0; i
< num_actuals
; i
++)
1475 if ((flags
& (ECF_CONST
| ECF_PURE
))
1476 || calls_function (args
[i
].tree_value
, !ACCUMULATE_OUTGOING_ARGS
))
1478 /* If this is an addressable type, we cannot pre-evaluate it. */
1479 if (TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
)))
1485 = expand_expr (args
[i
].tree_value
, NULL_RTX
, VOIDmode
, 0);
1487 preserve_temp_slots (args
[i
].value
);
1490 /* ANSI doesn't require a sequence point here,
1491 but PCC has one, so this will avoid some problems. */
1494 args
[i
].initial_value
= args
[i
].value
1495 = protect_from_queue (args
[i
].value
, 0);
1497 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) != args
[i
].mode
)
1500 = convert_modes (args
[i
].mode
,
1501 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
1502 args
[i
].value
, args
[i
].unsignedp
);
1503 #ifdef PROMOTE_FOR_CALL_ONLY
1504 /* CSE will replace this only if it contains args[i].value
1505 pseudo, so convert it down to the declared mode using
1507 if (GET_CODE (args
[i
].value
) == REG
1508 && GET_MODE_CLASS (args
[i
].mode
) == MODE_INT
)
1510 args
[i
].initial_value
1511 = gen_rtx_SUBREG (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
1513 SUBREG_PROMOTED_VAR_P (args
[i
].initial_value
) = 1;
1514 SUBREG_PROMOTED_UNSIGNED_P (args
[i
].initial_value
)
1515 = args
[i
].unsignedp
;
1522 /* Given the current state of MUST_PREALLOCATE and information about
1523 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
1524 compute and return the final value for MUST_PREALLOCATE. */
1527 finalize_must_preallocate (must_preallocate
, num_actuals
, args
, args_size
)
1528 int must_preallocate
;
1530 struct arg_data
*args
;
1531 struct args_size
*args_size
;
1533 /* See if we have or want to preallocate stack space.
1535 If we would have to push a partially-in-regs parm
1536 before other stack parms, preallocate stack space instead.
1538 If the size of some parm is not a multiple of the required stack
1539 alignment, we must preallocate.
1541 If the total size of arguments that would otherwise create a copy in
1542 a temporary (such as a CALL) is more than half the total argument list
1543 size, preallocation is faster.
1545 Another reason to preallocate is if we have a machine (like the m88k)
1546 where stack alignment is required to be maintained between every
1547 pair of insns, not just when the call is made. However, we assume here
1548 that such machines either do not have push insns (and hence preallocation
1549 would occur anyway) or the problem is taken care of with
1552 if (! must_preallocate
)
1554 int partial_seen
= 0;
1555 int copy_to_evaluate_size
= 0;
1558 for (i
= 0; i
< num_actuals
&& ! must_preallocate
; i
++)
1560 if (args
[i
].partial
> 0 && ! args
[i
].pass_on_stack
)
1562 else if (partial_seen
&& args
[i
].reg
== 0)
1563 must_preallocate
= 1;
1565 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
1566 && (TREE_CODE (args
[i
].tree_value
) == CALL_EXPR
1567 || TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
1568 || TREE_CODE (args
[i
].tree_value
) == COND_EXPR
1569 || TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
))))
1570 copy_to_evaluate_size
1571 += int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1574 if (copy_to_evaluate_size
* 2 >= args_size
->constant
1575 && args_size
->constant
> 0)
1576 must_preallocate
= 1;
1578 return must_preallocate
;
1581 /* If we preallocated stack space, compute the address of each argument
1582 and store it into the ARGS array.
1584 We need not ensure it is a valid memory address here; it will be
1585 validized when it is used.
1587 ARGBLOCK is an rtx for the address of the outgoing arguments. */
1590 compute_argument_addresses (args
, argblock
, num_actuals
)
1591 struct arg_data
*args
;
1597 rtx arg_reg
= argblock
;
1598 int i
, arg_offset
= 0;
1600 if (GET_CODE (argblock
) == PLUS
)
1601 arg_reg
= XEXP (argblock
, 0), arg_offset
= INTVAL (XEXP (argblock
, 1));
1603 for (i
= 0; i
< num_actuals
; i
++)
1605 rtx offset
= ARGS_SIZE_RTX (args
[i
].offset
);
1606 rtx slot_offset
= ARGS_SIZE_RTX (args
[i
].slot_offset
);
1609 /* Skip this parm if it will not be passed on the stack. */
1610 if (! args
[i
].pass_on_stack
&& args
[i
].reg
!= 0)
1613 if (GET_CODE (offset
) == CONST_INT
)
1614 addr
= plus_constant (arg_reg
, INTVAL (offset
));
1616 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, offset
);
1618 addr
= plus_constant (addr
, arg_offset
);
1619 args
[i
].stack
= gen_rtx_MEM (args
[i
].mode
, addr
);
1620 set_mem_attributes (args
[i
].stack
,
1621 TREE_TYPE (args
[i
].tree_value
), 1);
1623 if (GET_CODE (slot_offset
) == CONST_INT
)
1624 addr
= plus_constant (arg_reg
, INTVAL (slot_offset
));
1626 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, slot_offset
);
1628 addr
= plus_constant (addr
, arg_offset
);
1629 args
[i
].stack_slot
= gen_rtx_MEM (args
[i
].mode
, addr
);
1630 set_mem_attributes (args
[i
].stack_slot
,
1631 TREE_TYPE (args
[i
].tree_value
), 1);
1633 /* Function incoming arguments may overlap with sibling call
1634 outgoing arguments and we cannot allow reordering of reads
1635 from function arguments with stores to outgoing arguments
1636 of sibling calls. */
1637 MEM_ALIAS_SET (args
[i
].stack
) = 0;
1638 MEM_ALIAS_SET (args
[i
].stack_slot
) = 0;
1643 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
1644 in a call instruction.
1646 FNDECL is the tree node for the target function. For an indirect call
1647 FNDECL will be NULL_TREE.
1649 EXP is the CALL_EXPR for this call. */
1652 rtx_for_function_call (fndecl
, exp
)
1658 /* Get the function to call, in the form of RTL. */
1661 /* If this is the first use of the function, see if we need to
1662 make an external definition for it. */
1663 if (! TREE_USED (fndecl
))
1665 assemble_external (fndecl
);
1666 TREE_USED (fndecl
) = 1;
1669 /* Get a SYMBOL_REF rtx for the function address. */
1670 funexp
= XEXP (DECL_RTL (fndecl
), 0);
1673 /* Generate an rtx (probably a pseudo-register) for the address. */
1678 expand_expr (TREE_OPERAND (exp
, 0), NULL_RTX
, VOIDmode
, 0);
1679 pop_temp_slots (); /* FUNEXP can't be BLKmode. */
1681 /* Check the function is executable. */
1682 if (current_function_check_memory_usage
)
1684 #ifdef POINTERS_EXTEND_UNSIGNED
1685 /* It might be OK to convert funexp in place, but there's
1686 a lot going on between here and when it happens naturally
1687 that this seems safer. */
1688 funaddr
= convert_memory_address (Pmode
, funexp
);
1690 emit_library_call (chkr_check_exec_libfunc
, LCT_CONST_MAKE_BLOCK
,
1691 VOIDmode
, 1, funaddr
, Pmode
);
1698 /* Do the register loads required for any wholly-register parms or any
1699 parms which are passed both on the stack and in a register. Their
1700 expressions were already evaluated.
1702 Mark all register-parms as living through the call, putting these USE
1703 insns in the CALL_INSN_FUNCTION_USAGE field. */
1706 load_register_parameters (args
, num_actuals
, call_fusage
, flags
)
1707 struct arg_data
*args
;
1714 #ifdef LOAD_ARGS_REVERSED
1715 for (i
= num_actuals
- 1; i
>= 0; i
--)
1717 for (i
= 0; i
< num_actuals
; i
++)
1720 rtx reg
= ((flags
& ECF_SIBCALL
)
1721 ? args
[i
].tail_call_reg
: args
[i
].reg
);
1722 int partial
= args
[i
].partial
;
1727 /* Set to non-negative if must move a word at a time, even if just
1728 one word (e.g, partial == 1 && mode == DFmode). Set to -1 if
1729 we just use a normal move insn. This value can be zero if the
1730 argument is a zero size structure with no fields. */
1731 nregs
= (partial
? partial
1732 : (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
1733 ? ((int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
))
1734 + (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
)
1737 /* Handle calls that pass values in multiple non-contiguous
1738 locations. The Irix 6 ABI has examples of this. */
1740 if (GET_CODE (reg
) == PARALLEL
)
1741 emit_group_load (reg
, args
[i
].value
,
1742 int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
)),
1743 TYPE_ALIGN (TREE_TYPE (args
[i
].tree_value
)));
1745 /* If simple case, just do move. If normal partial, store_one_arg
1746 has already loaded the register for us. In all other cases,
1747 load the register(s) from memory. */
1749 else if (nregs
== -1)
1750 emit_move_insn (reg
, args
[i
].value
);
1752 /* If we have pre-computed the values to put in the registers in
1753 the case of non-aligned structures, copy them in now. */
1755 else if (args
[i
].n_aligned_regs
!= 0)
1756 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1757 emit_move_insn (gen_rtx_REG (word_mode
, REGNO (reg
) + j
),
1758 args
[i
].aligned_regs
[j
]);
1760 else if (partial
== 0 || args
[i
].pass_on_stack
)
1761 move_block_to_reg (REGNO (reg
),
1762 validize_mem (args
[i
].value
), nregs
,
1765 /* Handle calls that pass values in multiple non-contiguous
1766 locations. The Irix 6 ABI has examples of this. */
1767 if (GET_CODE (reg
) == PARALLEL
)
1768 use_group_regs (call_fusage
, reg
);
1769 else if (nregs
== -1)
1770 use_reg (call_fusage
, reg
);
1772 use_regs (call_fusage
, REGNO (reg
), nregs
== 0 ? 1 : nregs
);
1777 /* Try to integrate function. See expand_inline_function for documentation
1778 about the parameters. */
1781 try_to_integrate (fndecl
, actparms
, target
, ignore
, type
, structure_value_addr
)
1787 rtx structure_value_addr
;
1792 rtx old_stack_level
= 0;
1793 int reg_parm_stack_space
= 0;
1795 #ifdef REG_PARM_STACK_SPACE
1796 #ifdef MAYBE_REG_PARM_STACK_SPACE
1797 reg_parm_stack_space
= MAYBE_REG_PARM_STACK_SPACE
;
1799 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
1803 before_call
= get_last_insn ();
1805 timevar_push (TV_INTEGRATION
);
1807 temp
= expand_inline_function (fndecl
, actparms
, target
,
1809 structure_value_addr
);
1811 timevar_pop (TV_INTEGRATION
);
1813 /* If inlining succeeded, return. */
1814 if (temp
!= (rtx
) (HOST_WIDE_INT
) - 1)
1816 if (ACCUMULATE_OUTGOING_ARGS
)
1818 /* If the outgoing argument list must be preserved, push
1819 the stack before executing the inlined function if it
1822 for (i
= reg_parm_stack_space
- 1; i
>= 0; i
--)
1823 if (i
< highest_outgoing_arg_in_use
&& stack_usage_map
[i
] != 0)
1826 if (stack_arg_under_construction
|| i
>= 0)
1829 = before_call
? NEXT_INSN (before_call
) : get_insns ();
1830 rtx insn
= NULL_RTX
, seq
;
1832 /* Look for a call in the inline function code.
1833 If DECL_SAVED_INSNS (fndecl)->outgoing_args_size is
1834 nonzero then there is a call and it is not necessary
1835 to scan the insns. */
1837 if (DECL_SAVED_INSNS (fndecl
)->outgoing_args_size
== 0)
1838 for (insn
= first_insn
; insn
; insn
= NEXT_INSN (insn
))
1839 if (GET_CODE (insn
) == CALL_INSN
)
1844 /* Reserve enough stack space so that the largest
1845 argument list of any function call in the inline
1846 function does not overlap the argument list being
1847 evaluated. This is usually an overestimate because
1848 allocate_dynamic_stack_space reserves space for an
1849 outgoing argument list in addition to the requested
1850 space, but there is no way to ask for stack space such
1851 that an argument list of a certain length can be
1854 Add the stack space reserved for register arguments, if
1855 any, in the inline function. What is really needed is the
1856 largest value of reg_parm_stack_space in the inline
1857 function, but that is not available. Using the current
1858 value of reg_parm_stack_space is wrong, but gives
1859 correct results on all supported machines. */
1861 int adjust
= (DECL_SAVED_INSNS (fndecl
)->outgoing_args_size
1862 + reg_parm_stack_space
);
1865 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
1866 allocate_dynamic_stack_space (GEN_INT (adjust
),
1867 NULL_RTX
, BITS_PER_UNIT
);
1870 emit_insns_before (seq
, first_insn
);
1871 emit_stack_restore (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
1876 /* If the result is equivalent to TARGET, return TARGET to simplify
1877 checks in store_expr. They can be equivalent but not equal in the
1878 case of a function that returns BLKmode. */
1879 if (temp
!= target
&& rtx_equal_p (temp
, target
))
1884 /* If inlining failed, mark FNDECL as needing to be compiled
1885 separately after all. If function was declared inline,
1887 if (DECL_INLINE (fndecl
) && warn_inline
&& !flag_no_inline
1888 && optimize
> 0 && !TREE_ADDRESSABLE (fndecl
))
1890 warning_with_decl (fndecl
, "inlining failed in call to `%s'");
1891 warning ("called from here");
1893 mark_addressable (fndecl
);
1894 return (rtx
) (HOST_WIDE_INT
) - 1;
1897 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
1898 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
1899 bytes, then we would need to push some additional bytes to pad the
1900 arguments. So, we compute an adjust to the stack pointer for an
1901 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
1902 bytes. Then, when the arguments are pushed the stack will be perfectly
1903 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
1904 be popped after the call. Returns the adjustment. */
1907 combine_pending_stack_adjustment_and_call (unadjusted_args_size
,
1909 preferred_unit_stack_boundary
)
1910 int unadjusted_args_size
;
1911 struct args_size
*args_size
;
1912 int preferred_unit_stack_boundary
;
1914 /* The number of bytes to pop so that the stack will be
1915 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
1916 HOST_WIDE_INT adjustment
;
1917 /* The alignment of the stack after the arguments are pushed, if we
1918 just pushed the arguments without adjust the stack here. */
1919 HOST_WIDE_INT unadjusted_alignment
;
1921 unadjusted_alignment
1922 = ((stack_pointer_delta
+ unadjusted_args_size
)
1923 % preferred_unit_stack_boundary
);
1925 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
1926 as possible -- leaving just enough left to cancel out the
1927 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
1928 PENDING_STACK_ADJUST is non-negative, and congruent to
1929 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
1931 /* Begin by trying to pop all the bytes. */
1932 unadjusted_alignment
1933 = (unadjusted_alignment
1934 - (pending_stack_adjust
% preferred_unit_stack_boundary
));
1935 adjustment
= pending_stack_adjust
;
1936 /* Push enough additional bytes that the stack will be aligned
1937 after the arguments are pushed. */
1938 if (preferred_unit_stack_boundary
> 1)
1940 if (unadjusted_alignment
> 0)
1941 adjustment
-= preferred_unit_stack_boundary
- unadjusted_alignment
;
1943 adjustment
+= unadjusted_alignment
;
1946 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
1947 bytes after the call. The right number is the entire
1948 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
1949 by the arguments in the first place. */
1951 = pending_stack_adjust
- adjustment
+ unadjusted_args_size
;
1956 /* Scan X expression if it does not dereference any argument slots
1957 we already clobbered by tail call arguments (as noted in stored_args_map
1959 Return non-zero if X expression dereferences such argument slots,
1963 check_sibcall_argument_overlap_1 (x
)
1974 code
= GET_CODE (x
);
1978 if (XEXP (x
, 0) == current_function_internal_arg_pointer
)
1980 else if (GET_CODE (XEXP (x
, 0)) == PLUS
1981 && XEXP (XEXP (x
, 0), 0) ==
1982 current_function_internal_arg_pointer
1983 && GET_CODE (XEXP (XEXP (x
, 0), 1)) == CONST_INT
)
1984 i
= INTVAL (XEXP (XEXP (x
, 0), 1));
1988 #ifdef ARGS_GROW_DOWNWARD
1989 i
= -i
- GET_MODE_SIZE (GET_MODE (x
));
1992 for (k
= 0; k
< GET_MODE_SIZE (GET_MODE (x
)); k
++)
1993 if (i
+ k
< stored_args_map
->n_bits
1994 && TEST_BIT (stored_args_map
, i
+ k
))
2000 /* Scan all subexpressions. */
2001 fmt
= GET_RTX_FORMAT (code
);
2002 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
2006 if (check_sibcall_argument_overlap_1 (XEXP (x
, i
)))
2009 else if (*fmt
== 'E')
2011 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2012 if (check_sibcall_argument_overlap_1 (XVECEXP (x
, i
, j
)))
2019 /* Scan sequence after INSN if it does not dereference any argument slots
2020 we already clobbered by tail call arguments (as noted in stored_args_map
2021 bitmap). Add stack slots for ARG to stored_args_map bitmap afterwards.
2022 Return non-zero if sequence after INSN dereferences such argument slots,
2026 check_sibcall_argument_overlap (insn
, arg
)
2028 struct arg_data
*arg
;
2032 if (insn
== NULL_RTX
)
2033 insn
= get_insns ();
2035 insn
= NEXT_INSN (insn
);
2037 for (; insn
; insn
= NEXT_INSN (insn
))
2039 && check_sibcall_argument_overlap_1 (PATTERN (insn
)))
2042 #ifdef ARGS_GROW_DOWNWARD
2043 low
= -arg
->offset
.constant
- arg
->size
.constant
;
2045 low
= arg
->offset
.constant
;
2048 for (high
= low
+ arg
->size
.constant
; low
< high
; low
++)
2049 SET_BIT (stored_args_map
, low
);
2050 return insn
!= NULL_RTX
;
2053 /* Generate all the code for a function call
2054 and return an rtx for its value.
2055 Store the value in TARGET (specified as an rtx) if convenient.
2056 If the value is stored in TARGET then TARGET is returned.
2057 If IGNORE is nonzero, then we ignore the value of the function call. */
2060 expand_call (exp
, target
, ignore
)
2065 /* Nonzero if we are currently expanding a call. */
2066 static int currently_expanding_call
= 0;
2068 /* List of actual parameters. */
2069 tree actparms
= TREE_OPERAND (exp
, 1);
2070 /* RTX for the function to be called. */
2072 /* Sequence of insns to perform a tail recursive "call". */
2073 rtx tail_recursion_insns
= NULL_RTX
;
2074 /* Sequence of insns to perform a normal "call". */
2075 rtx normal_call_insns
= NULL_RTX
;
2076 /* Sequence of insns to perform a tail recursive "call". */
2077 rtx tail_call_insns
= NULL_RTX
;
2078 /* Data type of the function. */
2080 /* Declaration of the function being called,
2081 or 0 if the function is computed (not known by name). */
2084 int try_tail_call
= 1;
2085 int try_tail_recursion
= 1;
2088 /* Register in which non-BLKmode value will be returned,
2089 or 0 if no value or if value is BLKmode. */
2091 /* Address where we should return a BLKmode value;
2092 0 if value not BLKmode. */
2093 rtx structure_value_addr
= 0;
2094 /* Nonzero if that address is being passed by treating it as
2095 an extra, implicit first parameter. Otherwise,
2096 it is passed by being copied directly into struct_value_rtx. */
2097 int structure_value_addr_parm
= 0;
2098 /* Size of aggregate value wanted, or zero if none wanted
2099 or if we are using the non-reentrant PCC calling convention
2100 or expecting the value in registers. */
2101 HOST_WIDE_INT struct_value_size
= 0;
2102 /* Nonzero if called function returns an aggregate in memory PCC style,
2103 by returning the address of where to find it. */
2104 int pcc_struct_value
= 0;
2106 /* Number of actual parameters in this call, including struct value addr. */
2108 /* Number of named args. Args after this are anonymous ones
2109 and they must all go on the stack. */
2112 /* Vector of information about each argument.
2113 Arguments are numbered in the order they will be pushed,
2114 not the order they are written. */
2115 struct arg_data
*args
;
2117 /* Total size in bytes of all the stack-parms scanned so far. */
2118 struct args_size args_size
;
2119 struct args_size adjusted_args_size
;
2120 /* Size of arguments before any adjustments (such as rounding). */
2121 int unadjusted_args_size
;
2122 /* Data on reg parms scanned so far. */
2123 CUMULATIVE_ARGS args_so_far
;
2124 /* Nonzero if a reg parm has been scanned. */
2126 /* Nonzero if this is an indirect function call. */
2128 /* Nonzero if we must avoid push-insns in the args for this call.
2129 If stack space is allocated for register parameters, but not by the
2130 caller, then it is preallocated in the fixed part of the stack frame.
2131 So the entire argument block must then be preallocated (i.e., we
2132 ignore PUSH_ROUNDING in that case). */
2134 int must_preallocate
= !PUSH_ARGS
;
2136 /* Size of the stack reserved for parameter registers. */
2137 int reg_parm_stack_space
= 0;
2139 /* Address of space preallocated for stack parms
2140 (on machines that lack push insns), or 0 if space not preallocated. */
2143 /* Mask of ECF_ flags. */
2145 /* Nonzero if this is a call to an inline function. */
2146 int is_integrable
= 0;
2147 #ifdef REG_PARM_STACK_SPACE
2148 /* Define the boundary of the register parm stack space that needs to be
2150 int low_to_save
= -1, high_to_save
;
2151 rtx save_area
= 0; /* Place that it is saved */
2154 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
2155 char *initial_stack_usage_map
= stack_usage_map
;
2156 int old_stack_arg_under_construction
= 0;
2158 rtx old_stack_level
= 0;
2159 int old_pending_adj
= 0;
2160 int old_inhibit_defer_pop
= inhibit_defer_pop
;
2161 int old_stack_allocated
;
2163 register tree p
= TREE_OPERAND (exp
, 0);
2165 /* The alignment of the stack, in bits. */
2166 HOST_WIDE_INT preferred_stack_boundary
;
2167 /* The alignment of the stack, in bytes. */
2168 HOST_WIDE_INT preferred_unit_stack_boundary
;
2170 /* The value of the function call can be put in a hard register. But
2171 if -fcheck-memory-usage, code which invokes functions (and thus
2172 damages some hard registers) can be inserted before using the value.
2173 So, target is always a pseudo-register in that case. */
2174 if (current_function_check_memory_usage
)
2177 /* See if this is "nothrow" function call. */
2178 if (TREE_NOTHROW (exp
))
2179 flags
|= ECF_NOTHROW
;
2181 /* See if we can find a DECL-node for the actual function.
2182 As a result, decide whether this is a call to an integrable function. */
2184 fndecl
= get_callee_fndecl (exp
);
2188 && fndecl
!= current_function_decl
2189 && DECL_INLINE (fndecl
)
2190 && DECL_SAVED_INSNS (fndecl
)
2191 && DECL_SAVED_INSNS (fndecl
)->inlinable
)
2193 else if (! TREE_ADDRESSABLE (fndecl
))
2195 /* In case this function later becomes inlinable,
2196 record that there was already a non-inline call to it.
2198 Use abstraction instead of setting TREE_ADDRESSABLE
2200 if (DECL_INLINE (fndecl
) && warn_inline
&& !flag_no_inline
2203 warning_with_decl (fndecl
, "can't inline call to `%s'");
2204 warning ("called from here");
2206 mark_addressable (fndecl
);
2209 flags
|= flags_from_decl_or_type (fndecl
);
2212 /* If we don't have specific function to call, see if we have a
2213 attributes set in the type. */
2215 flags
|= flags_from_decl_or_type (TREE_TYPE (TREE_TYPE (p
)));
2217 /* Mark if the function returns with the stack pointer depressed. */
2218 if (TREE_CODE (TREE_TYPE (TREE_TYPE (p
))) == FUNCTION_TYPE
2219 && TYPE_RETURNS_STACK_DEPRESSED (TREE_TYPE (TREE_TYPE (p
))))
2221 flags
|= ECF_SP_DEPRESSED
;
2222 flags
&= ~(ECF_PURE
| ECF_CONST
);
2225 #ifdef REG_PARM_STACK_SPACE
2226 #ifdef MAYBE_REG_PARM_STACK_SPACE
2227 reg_parm_stack_space
= MAYBE_REG_PARM_STACK_SPACE
;
2229 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
2233 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2234 if (reg_parm_stack_space
> 0 && PUSH_ARGS
)
2235 must_preallocate
= 1;
2238 /* Warn if this value is an aggregate type,
2239 regardless of which calling convention we are using for it. */
2240 if (warn_aggregate_return
&& AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
2241 warning ("function call has aggregate value");
2243 /* Set up a place to return a structure. */
2245 /* Cater to broken compilers. */
2246 if (aggregate_value_p (exp
))
2248 /* This call returns a big structure. */
2249 flags
&= ~(ECF_CONST
| ECF_PURE
);
2251 #ifdef PCC_STATIC_STRUCT_RETURN
2253 pcc_struct_value
= 1;
2254 /* Easier than making that case work right. */
2257 /* In case this is a static function, note that it has been
2259 if (! TREE_ADDRESSABLE (fndecl
))
2260 mark_addressable (fndecl
);
2264 #else /* not PCC_STATIC_STRUCT_RETURN */
2266 struct_value_size
= int_size_in_bytes (TREE_TYPE (exp
));
2268 if (target
&& GET_CODE (target
) == MEM
)
2269 structure_value_addr
= XEXP (target
, 0);
2272 /* For variable-sized objects, we must be called with a target
2273 specified. If we were to allocate space on the stack here,
2274 we would have no way of knowing when to free it. */
2275 rtx d
= assign_temp (TREE_TYPE (exp
), 1, 1, 1);
2277 mark_temp_addr_taken (d
);
2278 structure_value_addr
= XEXP (d
, 0);
2282 #endif /* not PCC_STATIC_STRUCT_RETURN */
2285 /* If called function is inline, try to integrate it. */
2289 rtx temp
= try_to_integrate (fndecl
, actparms
, target
,
2290 ignore
, TREE_TYPE (exp
),
2291 structure_value_addr
);
2292 if (temp
!= (rtx
) (HOST_WIDE_INT
) - 1)
2296 /* Figure out the amount to which the stack should be aligned. */
2297 #ifdef PREFERRED_STACK_BOUNDARY
2298 preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
2300 preferred_stack_boundary
= STACK_BOUNDARY
;
2303 /* Operand 0 is a pointer-to-function; get the type of the function. */
2304 funtype
= TREE_TYPE (TREE_OPERAND (exp
, 0));
2305 if (! POINTER_TYPE_P (funtype
))
2307 funtype
= TREE_TYPE (funtype
);
2309 /* See if this is a call to a function that can return more than once
2310 or a call to longjmp or malloc. */
2311 flags
|= special_function_p (fndecl
, flags
);
2313 if (flags
& ECF_MAY_BE_ALLOCA
)
2314 current_function_calls_alloca
= 1;
2316 /* If struct_value_rtx is 0, it means pass the address
2317 as if it were an extra parameter. */
2318 if (structure_value_addr
&& struct_value_rtx
== 0)
2320 /* If structure_value_addr is a REG other than
2321 virtual_outgoing_args_rtx, we can use always use it. If it
2322 is not a REG, we must always copy it into a register.
2323 If it is virtual_outgoing_args_rtx, we must copy it to another
2324 register in some cases. */
2325 rtx temp
= (GET_CODE (structure_value_addr
) != REG
2326 || (ACCUMULATE_OUTGOING_ARGS
2327 && stack_arg_under_construction
2328 && structure_value_addr
== virtual_outgoing_args_rtx
)
2329 ? copy_addr_to_reg (structure_value_addr
)
2330 : structure_value_addr
);
2333 = tree_cons (error_mark_node
,
2334 make_tree (build_pointer_type (TREE_TYPE (funtype
)),
2337 structure_value_addr_parm
= 1;
2340 /* Count the arguments and set NUM_ACTUALS. */
2341 for (p
= actparms
, num_actuals
= 0; p
; p
= TREE_CHAIN (p
))
2344 /* Compute number of named args.
2345 Normally, don't include the last named arg if anonymous args follow.
2346 We do include the last named arg if STRICT_ARGUMENT_NAMING is nonzero.
2347 (If no anonymous args follow, the result of list_length is actually
2348 one too large. This is harmless.)
2350 If PRETEND_OUTGOING_VARARGS_NAMED is set and STRICT_ARGUMENT_NAMING is
2351 zero, this machine will be able to place unnamed args that were
2352 passed in registers into the stack. So treat all args as named.
2353 This allows the insns emitting for a specific argument list to be
2354 independent of the function declaration.
2356 If PRETEND_OUTGOING_VARARGS_NAMED is not set, we do not have any
2357 reliable way to pass unnamed args in registers, so we must force
2358 them into memory. */
2360 if ((STRICT_ARGUMENT_NAMING
2361 || ! PRETEND_OUTGOING_VARARGS_NAMED
)
2362 && TYPE_ARG_TYPES (funtype
) != 0)
2364 = (list_length (TYPE_ARG_TYPES (funtype
))
2365 /* Don't include the last named arg. */
2366 - (STRICT_ARGUMENT_NAMING
? 0 : 1)
2367 /* Count the struct value address, if it is passed as a parm. */
2368 + structure_value_addr_parm
);
2370 /* If we know nothing, treat all args as named. */
2371 n_named_args
= num_actuals
;
2373 /* Start updating where the next arg would go.
2375 On some machines (such as the PA) indirect calls have a different
2376 calling convention than normal calls. The last argument in
2377 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
2379 INIT_CUMULATIVE_ARGS (args_so_far
, funtype
, NULL_RTX
, (fndecl
== 0));
2381 /* Make a vector to hold all the information about each arg. */
2382 args
= (struct arg_data
*) alloca (num_actuals
* sizeof (struct arg_data
));
2383 memset ((char *) args
, 0, num_actuals
* sizeof (struct arg_data
));
2385 /* Build up entries in the ARGS array, compute the size of the
2386 arguments into ARGS_SIZE, etc. */
2387 initialize_argument_information (num_actuals
, args
, &args_size
,
2388 n_named_args
, actparms
, fndecl
,
2389 &args_so_far
, reg_parm_stack_space
,
2390 &old_stack_level
, &old_pending_adj
,
2391 &must_preallocate
, &flags
);
2395 /* If this function requires a variable-sized argument list, don't
2396 try to make a cse'able block for this call. We may be able to
2397 do this eventually, but it is too complicated to keep track of
2398 what insns go in the cse'able block and which don't. */
2400 flags
&= ~(ECF_CONST
| ECF_PURE
);
2401 must_preallocate
= 1;
2404 /* Now make final decision about preallocating stack space. */
2405 must_preallocate
= finalize_must_preallocate (must_preallocate
,
2409 /* If the structure value address will reference the stack pointer, we
2410 must stabilize it. We don't need to do this if we know that we are
2411 not going to adjust the stack pointer in processing this call. */
2413 if (structure_value_addr
2414 && (reg_mentioned_p (virtual_stack_dynamic_rtx
, structure_value_addr
)
2415 || reg_mentioned_p (virtual_outgoing_args_rtx
,
2416 structure_value_addr
))
2418 || (!ACCUMULATE_OUTGOING_ARGS
&& args_size
.constant
)))
2419 structure_value_addr
= copy_to_reg (structure_value_addr
);
2421 /* Tail calls can make things harder to debug, and we're traditionally
2422 pushed these optimizations into -O2. Don't try if we're already
2423 expanding a call, as that means we're an argument. Don't try if
2424 there's cleanups, as we know there's code to follow the call.
2426 If rtx_equal_function_value_matters is false, that means we've
2427 finished with regular parsing. Which means that some of the
2428 machinery we use to generate tail-calls is no longer in place.
2429 This is most often true of sjlj-exceptions, which we couldn't
2430 tail-call to anyway. */
2432 if (currently_expanding_call
++ != 0
2433 || !flag_optimize_sibling_calls
2434 || !rtx_equal_function_value_matters
2435 || any_pending_cleanups (1)
2437 try_tail_call
= try_tail_recursion
= 0;
2439 /* Tail recursion fails, when we are not dealing with recursive calls. */
2440 if (!try_tail_recursion
2441 || TREE_CODE (TREE_OPERAND (exp
, 0)) != ADDR_EXPR
2442 || TREE_OPERAND (TREE_OPERAND (exp
, 0), 0) != current_function_decl
)
2443 try_tail_recursion
= 0;
2445 /* Rest of purposes for tail call optimizations to fail. */
2447 #ifdef HAVE_sibcall_epilogue
2448 !HAVE_sibcall_epilogue
2453 /* Doing sibling call optimization needs some work, since
2454 structure_value_addr can be allocated on the stack.
2455 It does not seem worth the effort since few optimizable
2456 sibling calls will return a structure. */
2457 || structure_value_addr
!= NULL_RTX
2458 /* If the register holding the address is a callee saved
2459 register, then we lose. We have no way to prevent that,
2460 so we only allow calls to named functions. */
2461 /* ??? This could be done by having the insn constraints
2462 use a register class that is all call-clobbered. Any
2463 reload insns generated to fix things up would appear
2464 before the sibcall_epilogue. */
2465 || fndecl
== NULL_TREE
2466 || (flags
& (ECF_RETURNS_TWICE
| ECF_LONGJMP
))
2467 || TREE_THIS_VOLATILE (fndecl
)
2468 || !FUNCTION_OK_FOR_SIBCALL (fndecl
)
2469 /* If this function requires more stack slots than the current
2470 function, we cannot change it into a sibling call. */
2471 || args_size
.constant
> current_function_args_size
2472 /* If the callee pops its own arguments, then it must pop exactly
2473 the same number of arguments as the current function. */
2474 || RETURN_POPS_ARGS (fndecl
, funtype
, args_size
.constant
)
2475 != RETURN_POPS_ARGS (current_function_decl
,
2476 TREE_TYPE (current_function_decl
),
2477 current_function_args_size
))
2480 if (try_tail_call
|| try_tail_recursion
)
2483 actparms
= NULL_TREE
;
2484 /* Ok, we're going to give the tail call the old college try.
2485 This means we're going to evaluate the function arguments
2486 up to three times. There are two degrees of badness we can
2487 encounter, those that can be unsaved and those that can't.
2488 (See unsafe_for_reeval commentary for details.)
2490 Generate a new argument list. Pass safe arguments through
2491 unchanged. For the easy badness wrap them in UNSAVE_EXPRs.
2492 For hard badness, evaluate them now and put their resulting
2493 rtx in a temporary VAR_DECL.
2495 initialize_argument_information has ordered the array for the
2496 order to be pushed, and we must remember this when reconstructing
2497 the original argument orde. */
2499 if (PUSH_ARGS_REVERSED
)
2508 i
= num_actuals
- 1;
2512 for (; i
!= end
; i
+= inc
)
2514 switch (unsafe_for_reeval (args
[i
].tree_value
))
2519 case 1: /* Mildly unsafe. */
2520 args
[i
].tree_value
= unsave_expr (args
[i
].tree_value
);
2523 case 2: /* Wildly unsafe. */
2525 tree var
= build_decl (VAR_DECL
, NULL_TREE
,
2526 TREE_TYPE (args
[i
].tree_value
));
2528 expand_expr (args
[i
].tree_value
, NULL_RTX
,
2529 VOIDmode
, EXPAND_NORMAL
));
2530 args
[i
].tree_value
= var
;
2537 /* We need to build actparms for optimize_tail_recursion. We can
2538 safely trash away TREE_PURPOSE, since it is unused by this
2540 if (try_tail_recursion
)
2541 actparms
= tree_cons (NULL_TREE
, args
[i
].tree_value
, actparms
);
2543 /* Expanding one of those dangerous arguments could have added
2544 cleanups, but otherwise give it a whirl. */
2545 if (any_pending_cleanups (1))
2546 try_tail_call
= try_tail_recursion
= 0;
2549 /* Generate a tail recursion sequence when calling ourselves. */
2551 if (try_tail_recursion
)
2553 /* We want to emit any pending stack adjustments before the tail
2554 recursion "call". That way we know any adjustment after the tail
2555 recursion call can be ignored if we indeed use the tail recursion
2557 int save_pending_stack_adjust
= pending_stack_adjust
;
2558 int save_stack_pointer_delta
= stack_pointer_delta
;
2560 /* Emit any queued insns now; otherwise they would end up in
2561 only one of the alternates. */
2564 /* Use a new sequence to hold any RTL we generate. We do not even
2565 know if we will use this RTL yet. The final decision can not be
2566 made until after RTL generation for the entire function is
2569 /* If expanding any of the arguments creates cleanups, we can't
2570 do a tailcall. So, we'll need to pop the pending cleanups
2571 list. If, however, all goes well, and there are no cleanups
2572 then the call to expand_start_target_temps will have no
2574 expand_start_target_temps ();
2575 if (optimize_tail_recursion (actparms
, get_last_insn ()))
2577 if (any_pending_cleanups (1))
2578 try_tail_call
= try_tail_recursion
= 0;
2580 tail_recursion_insns
= get_insns ();
2582 expand_end_target_temps ();
2585 /* Restore the original pending stack adjustment for the sibling and
2586 normal call cases below. */
2587 pending_stack_adjust
= save_pending_stack_adjust
;
2588 stack_pointer_delta
= save_stack_pointer_delta
;
2591 if (profile_arc_flag
&& (flags
& ECF_FORK_OR_EXEC
))
2593 /* A fork duplicates the profile information, and an exec discards
2594 it. We can't rely on fork/exec to be paired. So write out the
2595 profile information we have gathered so far, and clear it. */
2596 /* ??? When Linux's __clone is called with CLONE_VM set, profiling
2597 is subject to race conditions, just as with multithreaded
2600 emit_library_call (gen_rtx_SYMBOL_REF (Pmode
, "__bb_fork_func"), 0,
2604 /* Ensure current function's preferred stack boundary is at least
2605 what we need. We don't have to increase alignment for recursive
2607 if (cfun
->preferred_stack_boundary
< preferred_stack_boundary
2608 && fndecl
!= current_function_decl
)
2609 cfun
->preferred_stack_boundary
= preferred_stack_boundary
;
2611 preferred_unit_stack_boundary
= preferred_stack_boundary
/ BITS_PER_UNIT
;
2613 function_call_count
++;
2615 /* We want to make two insn chains; one for a sibling call, the other
2616 for a normal call. We will select one of the two chains after
2617 initial RTL generation is complete. */
2618 for (pass
= 0; pass
< 2; pass
++)
2620 int sibcall_failure
= 0;
2621 /* We want to emit ay pending stack adjustments before the tail
2622 recursion "call". That way we know any adjustment after the tail
2623 recursion call can be ignored if we indeed use the tail recursion
2625 int save_pending_stack_adjust
= 0;
2626 int save_stack_pointer_delta
= 0;
2628 rtx before_call
, next_arg_reg
;
2632 if (! try_tail_call
)
2635 /* Emit any queued insns now; otherwise they would end up in
2636 only one of the alternates. */
2639 /* State variables we need to save and restore between
2641 save_pending_stack_adjust
= pending_stack_adjust
;
2642 save_stack_pointer_delta
= stack_pointer_delta
;
2645 flags
&= ~ECF_SIBCALL
;
2647 flags
|= ECF_SIBCALL
;
2649 /* Other state variables that we must reinitialize each time
2650 through the loop (that are not initialized by the loop itself). */
2654 /* Start a new sequence for the normal call case.
2656 From this point on, if the sibling call fails, we want to set
2657 sibcall_failure instead of continuing the loop. */
2662 /* We know at this point that there are not currently any
2663 pending cleanups. If, however, in the process of evaluating
2664 the arguments we were to create some, we'll need to be
2665 able to get rid of them. */
2666 expand_start_target_temps ();
2669 /* Don't let pending stack adjusts add up to too much.
2670 Also, do all pending adjustments now if there is any chance
2671 this might be a call to alloca or if we are expanding a sibling
2673 if (pending_stack_adjust
>= 32
2674 || (pending_stack_adjust
> 0 && (flags
& ECF_MAY_BE_ALLOCA
))
2676 do_pending_stack_adjust ();
2678 /* When calling a const function, we must pop the stack args right away,
2679 so that the pop is deleted or moved with the call. */
2680 if (flags
& (ECF_CONST
| ECF_PURE
))
2683 /* Push the temporary stack slot level so that we can free any
2684 temporaries we make. */
2687 #ifdef FINAL_REG_PARM_STACK_SPACE
2688 reg_parm_stack_space
= FINAL_REG_PARM_STACK_SPACE (args_size
.constant
,
2691 /* Precompute any arguments as needed. */
2693 precompute_arguments (flags
, num_actuals
, args
);
2695 /* Now we are about to start emitting insns that can be deleted
2696 if a libcall is deleted. */
2697 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_MALLOC
))
2700 adjusted_args_size
= args_size
;
2701 /* Compute the actual size of the argument block required. The variable
2702 and constant sizes must be combined, the size may have to be rounded,
2703 and there may be a minimum required size. When generating a sibcall
2704 pattern, do not round up, since we'll be re-using whatever space our
2706 unadjusted_args_size
2707 = compute_argument_block_size (reg_parm_stack_space
,
2708 &adjusted_args_size
,
2710 : preferred_stack_boundary
));
2712 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
2714 /* The argument block when performing a sibling call is the
2715 incoming argument block. */
2718 argblock
= virtual_incoming_args_rtx
;
2719 stored_args_map
= sbitmap_alloc (args_size
.constant
);
2720 sbitmap_zero (stored_args_map
);
2723 /* If we have no actual push instructions, or shouldn't use them,
2724 make space for all args right now. */
2725 else if (adjusted_args_size
.var
!= 0)
2727 if (old_stack_level
== 0)
2729 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
2730 old_pending_adj
= pending_stack_adjust
;
2731 pending_stack_adjust
= 0;
2732 /* stack_arg_under_construction says whether a stack arg is
2733 being constructed at the old stack level. Pushing the stack
2734 gets a clean outgoing argument block. */
2735 old_stack_arg_under_construction
= stack_arg_under_construction
;
2736 stack_arg_under_construction
= 0;
2738 argblock
= push_block (ARGS_SIZE_RTX (adjusted_args_size
), 0, 0);
2742 /* Note that we must go through the motions of allocating an argument
2743 block even if the size is zero because we may be storing args
2744 in the area reserved for register arguments, which may be part of
2747 int needed
= adjusted_args_size
.constant
;
2749 /* Store the maximum argument space used. It will be pushed by
2750 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
2753 if (needed
> current_function_outgoing_args_size
)
2754 current_function_outgoing_args_size
= needed
;
2756 if (must_preallocate
)
2758 if (ACCUMULATE_OUTGOING_ARGS
)
2760 /* Since the stack pointer will never be pushed, it is
2761 possible for the evaluation of a parm to clobber
2762 something we have already written to the stack.
2763 Since most function calls on RISC machines do not use
2764 the stack, this is uncommon, but must work correctly.
2766 Therefore, we save any area of the stack that was already
2767 written and that we are using. Here we set up to do this
2768 by making a new stack usage map from the old one. The
2769 actual save will be done by store_one_arg.
2771 Another approach might be to try to reorder the argument
2772 evaluations to avoid this conflicting stack usage. */
2774 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2775 /* Since we will be writing into the entire argument area,
2776 the map must be allocated for its entire size, not just
2777 the part that is the responsibility of the caller. */
2778 needed
+= reg_parm_stack_space
;
2781 #ifdef ARGS_GROW_DOWNWARD
2782 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
2785 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
2789 = (char *) alloca (highest_outgoing_arg_in_use
);
2791 if (initial_highest_arg_in_use
)
2792 memcpy (stack_usage_map
, initial_stack_usage_map
,
2793 initial_highest_arg_in_use
);
2795 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
2796 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
2797 (highest_outgoing_arg_in_use
2798 - initial_highest_arg_in_use
));
2801 /* The address of the outgoing argument list must not be
2802 copied to a register here, because argblock would be left
2803 pointing to the wrong place after the call to
2804 allocate_dynamic_stack_space below. */
2806 argblock
= virtual_outgoing_args_rtx
;
2810 if (inhibit_defer_pop
== 0)
2812 /* Try to reuse some or all of the pending_stack_adjust
2813 to get this space. */
2815 = (combine_pending_stack_adjustment_and_call
2816 (unadjusted_args_size
,
2817 &adjusted_args_size
,
2818 preferred_unit_stack_boundary
));
2820 /* combine_pending_stack_adjustment_and_call computes
2821 an adjustment before the arguments are allocated.
2822 Account for them and see whether or not the stack
2823 needs to go up or down. */
2824 needed
= unadjusted_args_size
- needed
;
2828 /* We're releasing stack space. */
2829 /* ??? We can avoid any adjustment at all if we're
2830 already aligned. FIXME. */
2831 pending_stack_adjust
= -needed
;
2832 do_pending_stack_adjust ();
2836 /* We need to allocate space. We'll do that in
2837 push_block below. */
2838 pending_stack_adjust
= 0;
2841 /* Special case this because overhead of `push_block' in
2842 this case is non-trivial. */
2844 argblock
= virtual_outgoing_args_rtx
;
2846 argblock
= push_block (GEN_INT (needed
), 0, 0);
2848 /* We only really need to call `copy_to_reg' in the case
2849 where push insns are going to be used to pass ARGBLOCK
2850 to a function call in ARGS. In that case, the stack
2851 pointer changes value from the allocation point to the
2852 call point, and hence the value of
2853 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
2854 as well always do it. */
2855 argblock
= copy_to_reg (argblock
);
2857 /* The save/restore code in store_one_arg handles all
2858 cases except one: a constructor call (including a C
2859 function returning a BLKmode struct) to initialize
2861 if (stack_arg_under_construction
)
2863 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2864 rtx push_size
= GEN_INT (reg_parm_stack_space
2865 + adjusted_args_size
.constant
);
2867 rtx push_size
= GEN_INT (adjusted_args_size
.constant
);
2869 if (old_stack_level
== 0)
2871 emit_stack_save (SAVE_BLOCK
, &old_stack_level
,
2873 old_pending_adj
= pending_stack_adjust
;
2874 pending_stack_adjust
= 0;
2875 /* stack_arg_under_construction says whether a stack
2876 arg is being constructed at the old stack level.
2877 Pushing the stack gets a clean outgoing argument
2879 old_stack_arg_under_construction
2880 = stack_arg_under_construction
;
2881 stack_arg_under_construction
= 0;
2882 /* Make a new map for the new argument list. */
2883 stack_usage_map
= (char *)
2884 alloca (highest_outgoing_arg_in_use
);
2885 memset (stack_usage_map
, 0, highest_outgoing_arg_in_use
);
2886 highest_outgoing_arg_in_use
= 0;
2888 allocate_dynamic_stack_space (push_size
, NULL_RTX
,
2891 /* If argument evaluation might modify the stack pointer,
2892 copy the address of the argument list to a register. */
2893 for (i
= 0; i
< num_actuals
; i
++)
2894 if (args
[i
].pass_on_stack
)
2896 argblock
= copy_addr_to_reg (argblock
);
2903 compute_argument_addresses (args
, argblock
, num_actuals
);
2905 #ifdef PREFERRED_STACK_BOUNDARY
2906 /* If we push args individually in reverse order, perform stack alignment
2907 before the first push (the last arg). */
2908 if (PUSH_ARGS_REVERSED
&& argblock
== 0
2909 && adjusted_args_size
.constant
!= unadjusted_args_size
)
2911 /* When the stack adjustment is pending, we get better code
2912 by combining the adjustments. */
2913 if (pending_stack_adjust
2914 && ! (flags
& (ECF_CONST
| ECF_PURE
))
2915 && ! inhibit_defer_pop
)
2917 pending_stack_adjust
2918 = (combine_pending_stack_adjustment_and_call
2919 (unadjusted_args_size
,
2920 &adjusted_args_size
,
2921 preferred_unit_stack_boundary
));
2922 do_pending_stack_adjust ();
2924 else if (argblock
== 0)
2925 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
2926 - unadjusted_args_size
));
2928 /* Now that the stack is properly aligned, pops can't safely
2929 be deferred during the evaluation of the arguments. */
2933 /* Don't try to defer pops if preallocating, not even from the first arg,
2934 since ARGBLOCK probably refers to the SP. */
2938 funexp
= rtx_for_function_call (fndecl
, exp
);
2940 /* Figure out the register where the value, if any, will come back. */
2942 if (TYPE_MODE (TREE_TYPE (exp
)) != VOIDmode
2943 && ! structure_value_addr
)
2945 if (pcc_struct_value
)
2946 valreg
= hard_function_value (build_pointer_type (TREE_TYPE (exp
)),
2947 fndecl
, (pass
== 0));
2949 valreg
= hard_function_value (TREE_TYPE (exp
), fndecl
, (pass
== 0));
2952 /* Precompute all register parameters. It isn't safe to compute anything
2953 once we have started filling any specific hard regs. */
2954 precompute_register_parameters (num_actuals
, args
, ®_parm_seen
);
2956 #ifdef REG_PARM_STACK_SPACE
2957 /* Save the fixed argument area if it's part of the caller's frame and
2958 is clobbered by argument setup for this call. */
2959 if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
2960 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
2961 &low_to_save
, &high_to_save
);
2964 /* Now store (and compute if necessary) all non-register parms.
2965 These come before register parms, since they can require block-moves,
2966 which could clobber the registers used for register parms.
2967 Parms which have partial registers are not stored here,
2968 but we do preallocate space here if they want that. */
2970 for (i
= 0; i
< num_actuals
; i
++)
2971 if (args
[i
].reg
== 0 || args
[i
].pass_on_stack
)
2973 rtx before_arg
= get_last_insn ();
2975 if (store_one_arg (&args
[i
], argblock
, flags
,
2976 adjusted_args_size
.var
!= 0,
2977 reg_parm_stack_space
)
2979 && check_sibcall_argument_overlap (before_arg
,
2981 sibcall_failure
= 1;
2984 /* If we have a parm that is passed in registers but not in memory
2985 and whose alignment does not permit a direct copy into registers,
2986 make a group of pseudos that correspond to each register that we
2988 if (STRICT_ALIGNMENT
)
2989 store_unaligned_arguments_into_pseudos (args
, num_actuals
);
2991 /* Now store any partially-in-registers parm.
2992 This is the last place a block-move can happen. */
2994 for (i
= 0; i
< num_actuals
; i
++)
2995 if (args
[i
].partial
!= 0 && ! args
[i
].pass_on_stack
)
2997 rtx before_arg
= get_last_insn ();
2999 if (store_one_arg (&args
[i
], argblock
, flags
,
3000 adjusted_args_size
.var
!= 0,
3001 reg_parm_stack_space
)
3003 && check_sibcall_argument_overlap (before_arg
,
3005 sibcall_failure
= 1;
3008 #ifdef PREFERRED_STACK_BOUNDARY
3009 /* If we pushed args in forward order, perform stack alignment
3010 after pushing the last arg. */
3011 if (!PUSH_ARGS_REVERSED
&& argblock
== 0)
3012 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
3013 - unadjusted_args_size
));
3016 /* If register arguments require space on the stack and stack space
3017 was not preallocated, allocate stack space here for arguments
3018 passed in registers. */
3019 #ifdef OUTGOING_REG_PARM_STACK_SPACE
3020 if (!ACCUMULATE_OUTGOING_ARGS
3021 && must_preallocate
== 0 && reg_parm_stack_space
> 0)
3022 anti_adjust_stack (GEN_INT (reg_parm_stack_space
));
3025 /* Pass the function the address in which to return a
3027 if (pass
!= 0 && structure_value_addr
&& ! structure_value_addr_parm
)
3029 emit_move_insn (struct_value_rtx
,
3031 force_operand (structure_value_addr
,
3034 /* Mark the memory for the aggregate as write-only. */
3035 if (current_function_check_memory_usage
)
3036 emit_library_call (chkr_set_right_libfunc
, LCT_CONST_MAKE_BLOCK
,
3038 structure_value_addr
, ptr_mode
,
3039 GEN_INT (struct_value_size
),
3040 TYPE_MODE (sizetype
),
3041 GEN_INT (MEMORY_USE_WO
),
3042 TYPE_MODE (integer_type_node
));
3044 if (GET_CODE (struct_value_rtx
) == REG
)
3045 use_reg (&call_fusage
, struct_value_rtx
);
3048 funexp
= prepare_call_address (funexp
, fndecl
, &call_fusage
,
3051 load_register_parameters (args
, num_actuals
, &call_fusage
, flags
);
3053 /* Perform postincrements before actually calling the function. */
3056 /* Save a pointer to the last insn before the call, so that we can
3057 later safely search backwards to find the CALL_INSN. */
3058 before_call
= get_last_insn ();
3060 /* Set up next argument register. For sibling calls on machines
3061 with register windows this should be the incoming register. */
3062 #ifdef FUNCTION_INCOMING_ARG
3064 next_arg_reg
= FUNCTION_INCOMING_ARG (args_so_far
, VOIDmode
,
3068 next_arg_reg
= FUNCTION_ARG (args_so_far
, VOIDmode
,
3071 /* All arguments and registers used for the call must be set up by
3074 #ifdef PREFERRED_STACK_BOUNDARY
3075 /* Stack must be properly aligned now. */
3076 if (pass
&& stack_pointer_delta
% preferred_unit_stack_boundary
)
3080 /* Generate the actual call instruction. */
3081 emit_call_1 (funexp
, fndecl
, funtype
, unadjusted_args_size
,
3082 adjusted_args_size
.constant
, struct_value_size
,
3083 next_arg_reg
, valreg
, old_inhibit_defer_pop
, call_fusage
,
3086 /* Verify that we've deallocated all the stack we used. */
3088 && old_stack_allocated
!= stack_pointer_delta
- pending_stack_adjust
)
3091 /* If call is cse'able, make appropriate pair of reg-notes around it.
3092 Test valreg so we don't crash; may safely ignore `const'
3093 if return type is void. Disable for PARALLEL return values, because
3094 we have no way to move such values into a pseudo register. */
3096 && (flags
& (ECF_CONST
| ECF_PURE
))
3097 && valreg
!= 0 && GET_CODE (valreg
) != PARALLEL
)
3100 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
3103 /* Mark the return value as a pointer if needed. */
3104 if (TREE_CODE (TREE_TYPE (exp
)) == POINTER_TYPE
)
3105 mark_reg_pointer (temp
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp
))));
3107 /* Construct an "equal form" for the value which mentions all the
3108 arguments in order as well as the function name. */
3109 for (i
= 0; i
< num_actuals
; i
++)
3110 note
= gen_rtx_EXPR_LIST (VOIDmode
, args
[i
].initial_value
, note
);
3111 note
= gen_rtx_EXPR_LIST (VOIDmode
, funexp
, note
);
3113 insns
= get_insns ();
3116 if (flags
& ECF_PURE
)
3117 note
= gen_rtx_EXPR_LIST (VOIDmode
,
3118 gen_rtx_USE (VOIDmode
,
3119 gen_rtx_MEM (BLKmode
,
3120 gen_rtx_SCRATCH (VOIDmode
))), note
);
3122 emit_libcall_block (insns
, temp
, valreg
, note
);
3126 else if (flags
& (ECF_CONST
| ECF_PURE
))
3128 /* Otherwise, just write out the sequence without a note. */
3129 rtx insns
= get_insns ();
3134 else if (flags
& ECF_MALLOC
)
3136 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
3139 /* The return value from a malloc-like function is a pointer. */
3140 if (TREE_CODE (TREE_TYPE (exp
)) == POINTER_TYPE
)
3141 mark_reg_pointer (temp
, BIGGEST_ALIGNMENT
);
3143 emit_move_insn (temp
, valreg
);
3145 /* The return value from a malloc-like function can not alias
3147 last
= get_last_insn ();
3149 gen_rtx_EXPR_LIST (REG_NOALIAS
, temp
, REG_NOTES (last
));
3151 /* Write out the sequence. */
3152 insns
= get_insns ();
3158 /* For calls to `setjmp', etc., inform flow.c it should complain
3159 if nonvolatile values are live. For functions that cannot return,
3160 inform flow that control does not fall through. */
3162 if ((flags
& (ECF_RETURNS_TWICE
| ECF_NORETURN
| ECF_LONGJMP
)) || pass
== 0)
3164 /* The barrier or NOTE_INSN_SETJMP note must be emitted
3165 immediately after the CALL_INSN. Some ports emit more
3166 than just a CALL_INSN above, so we must search for it here. */
3168 rtx last
= get_last_insn ();
3169 while (GET_CODE (last
) != CALL_INSN
)
3171 last
= PREV_INSN (last
);
3172 /* There was no CALL_INSN? */
3173 if (last
== before_call
)
3177 if (flags
& ECF_RETURNS_TWICE
)
3179 emit_note_after (NOTE_INSN_SETJMP
, last
);
3180 current_function_calls_setjmp
= 1;
3183 emit_barrier_after (last
);
3186 if (flags
& ECF_LONGJMP
)
3187 current_function_calls_longjmp
= 1;
3189 /* If this function is returning into a memory location marked as
3190 readonly, it means it is initializing that location. But we normally
3191 treat functions as not clobbering such locations, so we need to
3192 specify that this one does. */
3193 if (target
!= 0 && GET_CODE (target
) == MEM
3194 && structure_value_addr
!= 0 && RTX_UNCHANGING_P (target
))
3195 emit_insn (gen_rtx_CLOBBER (VOIDmode
, target
));
3197 /* If value type not void, return an rtx for the value. */
3199 /* If there are cleanups to be called, don't use a hard reg as target.
3200 We need to double check this and see if it matters anymore. */
3201 if (any_pending_cleanups (1))
3203 if (target
&& REG_P (target
)
3204 && REGNO (target
) < FIRST_PSEUDO_REGISTER
)
3206 sibcall_failure
= 1;
3209 if (TYPE_MODE (TREE_TYPE (exp
)) == VOIDmode
3212 target
= const0_rtx
;
3214 else if (structure_value_addr
)
3216 if (target
== 0 || GET_CODE (target
) != MEM
)
3219 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3220 memory_address (TYPE_MODE (TREE_TYPE (exp
)),
3221 structure_value_addr
));
3222 set_mem_attributes (target
, exp
, 1);
3225 else if (pcc_struct_value
)
3227 /* This is the special C++ case where we need to
3228 know what the true target was. We take care to
3229 never use this value more than once in one expression. */
3230 target
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3231 copy_to_reg (valreg
));
3232 set_mem_attributes (target
, exp
, 1);
3234 /* Handle calls that return values in multiple non-contiguous locations.
3235 The Irix 6 ABI has examples of this. */
3236 else if (GET_CODE (valreg
) == PARALLEL
)
3240 /* This will only be assigned once, so it can be readonly. */
3241 tree nt
= build_qualified_type (TREE_TYPE (exp
),
3242 (TYPE_QUALS (TREE_TYPE (exp
))
3243 | TYPE_QUAL_CONST
));
3245 target
= assign_temp (nt
, 0, 1, 1);
3246 preserve_temp_slots (target
);
3249 if (! rtx_equal_p (target
, valreg
))
3250 emit_group_store (target
, valreg
,
3251 int_size_in_bytes (TREE_TYPE (exp
)),
3252 TYPE_ALIGN (TREE_TYPE (exp
)));
3254 /* We can not support sibling calls for this case. */
3255 sibcall_failure
= 1;
3258 && GET_MODE (target
) == TYPE_MODE (TREE_TYPE (exp
))
3259 && GET_MODE (target
) == GET_MODE (valreg
))
3261 /* TARGET and VALREG cannot be equal at this point because the
3262 latter would not have REG_FUNCTION_VALUE_P true, while the
3263 former would if it were referring to the same register.
3265 If they refer to the same register, this move will be a no-op,
3266 except when function inlining is being done. */
3267 emit_move_insn (target
, valreg
);
3269 else if (TYPE_MODE (TREE_TYPE (exp
)) == BLKmode
)
3271 target
= copy_blkmode_from_reg (target
, valreg
, TREE_TYPE (exp
));
3273 /* We can not support sibling calls for this case. */
3274 sibcall_failure
= 1;
3277 target
= copy_to_reg (valreg
);
3279 #ifdef PROMOTE_FUNCTION_RETURN
3280 /* If we promoted this return value, make the proper SUBREG. TARGET
3281 might be const0_rtx here, so be careful. */
3282 if (GET_CODE (target
) == REG
3283 && TYPE_MODE (TREE_TYPE (exp
)) != BLKmode
3284 && GET_MODE (target
) != TYPE_MODE (TREE_TYPE (exp
)))
3286 tree type
= TREE_TYPE (exp
);
3287 int unsignedp
= TREE_UNSIGNED (type
);
3289 /* If we don't promote as expected, something is wrong. */
3290 if (GET_MODE (target
)
3291 != promote_mode (type
, TYPE_MODE (type
), &unsignedp
, 1))
3294 target
= gen_rtx_SUBREG (TYPE_MODE (type
), target
, 0);
3295 SUBREG_PROMOTED_VAR_P (target
) = 1;
3296 SUBREG_PROMOTED_UNSIGNED_P (target
) = unsignedp
;
3300 /* If size of args is variable or this was a constructor call for a stack
3301 argument, restore saved stack-pointer value. */
3303 if (old_stack_level
&& ! (flags
& ECF_SP_DEPRESSED
))
3305 emit_stack_restore (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
3306 pending_stack_adjust
= old_pending_adj
;
3307 stack_arg_under_construction
= old_stack_arg_under_construction
;
3308 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
3309 stack_usage_map
= initial_stack_usage_map
;
3310 sibcall_failure
= 1;
3312 else if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
3314 #ifdef REG_PARM_STACK_SPACE
3317 restore_fixed_argument_area (save_area
, argblock
,
3318 high_to_save
, low_to_save
);
3322 /* If we saved any argument areas, restore them. */
3323 for (i
= 0; i
< num_actuals
; i
++)
3324 if (args
[i
].save_area
)
3326 enum machine_mode save_mode
= GET_MODE (args
[i
].save_area
);
3328 = gen_rtx_MEM (save_mode
,
3329 memory_address (save_mode
,
3330 XEXP (args
[i
].stack_slot
, 0)));
3332 if (save_mode
!= BLKmode
)
3333 emit_move_insn (stack_area
, args
[i
].save_area
);
3335 emit_block_move (stack_area
,
3336 validize_mem (args
[i
].save_area
),
3337 GEN_INT (args
[i
].size
.constant
),
3341 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
3342 stack_usage_map
= initial_stack_usage_map
;
3345 /* If this was alloca, record the new stack level for nonlocal gotos.
3346 Check for the handler slots since we might not have a save area
3347 for non-local gotos. */
3349 if ((flags
& ECF_MAY_BE_ALLOCA
) && nonlocal_goto_handler_slots
!= 0)
3350 emit_stack_save (SAVE_NONLOCAL
, &nonlocal_goto_stack_level
, NULL_RTX
);
3354 /* Free up storage we no longer need. */
3355 for (i
= 0; i
< num_actuals
; ++i
)
3356 if (args
[i
].aligned_regs
)
3357 free (args
[i
].aligned_regs
);
3361 /* Undo the fake expand_start_target_temps we did earlier. If
3362 there had been any cleanups created, we've already set
3364 expand_end_target_temps ();
3367 insns
= get_insns ();
3372 tail_call_insns
= insns
;
3374 /* Restore the pending stack adjustment now that we have
3375 finished generating the sibling call sequence. */
3377 pending_stack_adjust
= save_pending_stack_adjust
;
3378 stack_pointer_delta
= save_stack_pointer_delta
;
3380 /* Prepare arg structure for next iteration. */
3381 for (i
= 0; i
< num_actuals
; i
++)
3384 args
[i
].aligned_regs
= 0;
3388 sbitmap_free (stored_args_map
);
3391 normal_call_insns
= insns
;
3393 /* If something prevents making this a sibling call,
3394 zero out the sequence. */
3395 if (sibcall_failure
)
3396 tail_call_insns
= NULL_RTX
;
3399 /* The function optimize_sibling_and_tail_recursive_calls doesn't
3400 handle CALL_PLACEHOLDERs inside other CALL_PLACEHOLDERs. This
3401 can happen if the arguments to this function call an inline
3402 function who's expansion contains another CALL_PLACEHOLDER.
3404 If there are any C_Ps in any of these sequences, replace them
3405 with their normal call. */
3407 for (insn
= normal_call_insns
; insn
; insn
= NEXT_INSN (insn
))
3408 if (GET_CODE (insn
) == CALL_INSN
3409 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
3410 replace_call_placeholder (insn
, sibcall_use_normal
);
3412 for (insn
= tail_call_insns
; insn
; insn
= NEXT_INSN (insn
))
3413 if (GET_CODE (insn
) == CALL_INSN
3414 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
3415 replace_call_placeholder (insn
, sibcall_use_normal
);
3417 for (insn
= tail_recursion_insns
; insn
; insn
= NEXT_INSN (insn
))
3418 if (GET_CODE (insn
) == CALL_INSN
3419 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
3420 replace_call_placeholder (insn
, sibcall_use_normal
);
3422 /* If this was a potential tail recursion site, then emit a
3423 CALL_PLACEHOLDER with the normal and the tail recursion streams.
3424 One of them will be selected later. */
3425 if (tail_recursion_insns
|| tail_call_insns
)
3427 /* The tail recursion label must be kept around. We could expose
3428 its use in the CALL_PLACEHOLDER, but that creates unwanted edges
3429 and makes determining true tail recursion sites difficult.
3431 So we set LABEL_PRESERVE_P here, then clear it when we select
3432 one of the call sequences after rtl generation is complete. */
3433 if (tail_recursion_insns
)
3434 LABEL_PRESERVE_P (tail_recursion_label
) = 1;
3435 emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode
, normal_call_insns
,
3437 tail_recursion_insns
,
3438 tail_recursion_label
));
3441 emit_insns (normal_call_insns
);
3443 currently_expanding_call
--;
3445 /* If this function returns with the stack pointer depressed, ensure
3446 this block saves and restores the stack pointer, show it was
3447 changed, and adjust for any outgoing arg space. */
3448 if (flags
& ECF_SP_DEPRESSED
)
3450 clear_pending_stack_adjust ();
3451 emit_insn (gen_rtx (CLOBBER
, VOIDmode
, stack_pointer_rtx
));
3452 emit_move_insn (virtual_stack_dynamic_rtx
, stack_pointer_rtx
);
3453 save_stack_pointer ();
3459 /* Output a library call to function FUN (a SYMBOL_REF rtx).
3460 The RETVAL parameter specifies whether return value needs to be saved, other
3461 parameters are documented in the emit_library_call function bellow. */
3463 emit_library_call_value_1 (retval
, orgfun
, value
, fn_type
, outmode
, nargs
, p
)
3467 enum libcall_type fn_type
;
3468 enum machine_mode outmode
;
3472 /* Total size in bytes of all the stack-parms scanned so far. */
3473 struct args_size args_size
;
3474 /* Size of arguments before any adjustments (such as rounding). */
3475 struct args_size original_args_size
;
3476 register int argnum
;
3480 struct args_size alignment_pad
;
3482 CUMULATIVE_ARGS args_so_far
;
3486 enum machine_mode mode
;
3489 struct args_size offset
;
3490 struct args_size size
;
3494 int old_inhibit_defer_pop
= inhibit_defer_pop
;
3495 rtx call_fusage
= 0;
3498 int pcc_struct_value
= 0;
3499 int struct_value_size
= 0;
3501 int reg_parm_stack_space
= 0;
3505 #ifdef REG_PARM_STACK_SPACE
3506 /* Define the boundary of the register parm stack space that needs to be
3508 int low_to_save
= -1, high_to_save
= 0;
3509 rtx save_area
= 0; /* Place that it is saved. */
3512 /* Size of the stack reserved for parameter registers. */
3513 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
3514 char *initial_stack_usage_map
= stack_usage_map
;
3516 #ifdef REG_PARM_STACK_SPACE
3517 #ifdef MAYBE_REG_PARM_STACK_SPACE
3518 reg_parm_stack_space
= MAYBE_REG_PARM_STACK_SPACE
;
3520 reg_parm_stack_space
= REG_PARM_STACK_SPACE ((tree
) 0);
3524 /* By default, library functions can not throw. */
3525 flags
= ECF_NOTHROW
;
3532 /* Nothing to do here. */
3534 case LCT_CONST_MAKE_BLOCK
:
3537 case LCT_PURE_MAKE_BLOCK
:
3541 flags
|= ECF_NORETURN
;
3544 flags
= ECF_NORETURN
;
3549 #ifdef PREFERRED_STACK_BOUNDARY
3550 /* Ensure current function's preferred stack boundary is at least
3552 if (cfun
->preferred_stack_boundary
< PREFERRED_STACK_BOUNDARY
)
3553 cfun
->preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
3556 /* If this kind of value comes back in memory,
3557 decide where in memory it should come back. */
3558 if (outmode
!= VOIDmode
&& aggregate_value_p (type_for_mode (outmode
, 0)))
3560 #ifdef PCC_STATIC_STRUCT_RETURN
3562 = hard_function_value (build_pointer_type (type_for_mode (outmode
, 0)),
3564 mem_value
= gen_rtx_MEM (outmode
, pointer_reg
);
3565 pcc_struct_value
= 1;
3567 value
= gen_reg_rtx (outmode
);
3568 #else /* not PCC_STATIC_STRUCT_RETURN */
3569 struct_value_size
= GET_MODE_SIZE (outmode
);
3570 if (value
!= 0 && GET_CODE (value
) == MEM
)
3573 mem_value
= assign_temp (type_for_mode (outmode
, 0), 0, 1, 1);
3576 /* This call returns a big structure. */
3577 flags
&= ~(ECF_CONST
| ECF_PURE
);
3580 /* ??? Unfinished: must pass the memory address as an argument. */
3582 /* Copy all the libcall-arguments out of the varargs data
3583 and into a vector ARGVEC.
3585 Compute how to pass each argument. We only support a very small subset
3586 of the full argument passing conventions to limit complexity here since
3587 library functions shouldn't have many args. */
3589 argvec
= (struct arg
*) alloca ((nargs
+ 1) * sizeof (struct arg
));
3590 memset ((char *) argvec
, 0, (nargs
+ 1) * sizeof (struct arg
));
3592 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
3593 INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far
, outmode
, fun
);
3595 INIT_CUMULATIVE_ARGS (args_so_far
, NULL_TREE
, fun
, 0);
3598 args_size
.constant
= 0;
3603 /* Now we are about to start emitting insns that can be deleted
3604 if a libcall is deleted. */
3605 if (flags
& (ECF_CONST
| ECF_PURE
))
3610 /* If there's a structure value address to be passed,
3611 either pass it in the special place, or pass it as an extra argument. */
3612 if (mem_value
&& struct_value_rtx
== 0 && ! pcc_struct_value
)
3614 rtx addr
= XEXP (mem_value
, 0);
3617 /* Make sure it is a reasonable operand for a move or push insn. */
3618 if (GET_CODE (addr
) != REG
&& GET_CODE (addr
) != MEM
3619 && ! (CONSTANT_P (addr
) && LEGITIMATE_CONSTANT_P (addr
)))
3620 addr
= force_operand (addr
, NULL_RTX
);
3622 argvec
[count
].value
= addr
;
3623 argvec
[count
].mode
= Pmode
;
3624 argvec
[count
].partial
= 0;
3626 argvec
[count
].reg
= FUNCTION_ARG (args_so_far
, Pmode
, NULL_TREE
, 1);
3627 #ifdef FUNCTION_ARG_PARTIAL_NREGS
3628 if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, Pmode
, NULL_TREE
, 1))
3632 locate_and_pad_parm (Pmode
, NULL_TREE
,
3633 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3636 argvec
[count
].reg
!= 0,
3638 NULL_TREE
, &args_size
, &argvec
[count
].offset
,
3639 &argvec
[count
].size
, &alignment_pad
);
3641 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
3642 || reg_parm_stack_space
> 0)
3643 args_size
.constant
+= argvec
[count
].size
.constant
;
3645 FUNCTION_ARG_ADVANCE (args_so_far
, Pmode
, (tree
) 0, 1);
3650 for (; count
< nargs
; count
++)
3652 rtx val
= va_arg (p
, rtx
);
3653 enum machine_mode mode
= va_arg (p
, enum machine_mode
);
3655 /* We cannot convert the arg value to the mode the library wants here;
3656 must do it earlier where we know the signedness of the arg. */
3658 || (GET_MODE (val
) != mode
&& GET_MODE (val
) != VOIDmode
))
3661 /* On some machines, there's no way to pass a float to a library fcn.
3662 Pass it as a double instead. */
3663 #ifdef LIBGCC_NEEDS_DOUBLE
3664 if (LIBGCC_NEEDS_DOUBLE
&& mode
== SFmode
)
3665 val
= convert_modes (DFmode
, SFmode
, val
, 0), mode
= DFmode
;
3668 /* There's no need to call protect_from_queue, because
3669 either emit_move_insn or emit_push_insn will do that. */
3671 /* Make sure it is a reasonable operand for a move or push insn. */
3672 if (GET_CODE (val
) != REG
&& GET_CODE (val
) != MEM
3673 && ! (CONSTANT_P (val
) && LEGITIMATE_CONSTANT_P (val
)))
3674 val
= force_operand (val
, NULL_RTX
);
3676 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
3677 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far
, mode
, NULL_TREE
, 1))
3681 #ifdef FUNCTION_ARG_CALLEE_COPIES
3682 && ! FUNCTION_ARG_CALLEE_COPIES (args_so_far
, mode
,
3687 if (GET_MODE (val
) == MEM
&& ! must_copy
)
3691 slot
= assign_temp (type_for_mode (mode
, 0), 0, 1, 1);
3692 emit_move_insn (slot
, val
);
3696 tree type
= type_for_mode (mode
, 0);
3698 slot
= gen_rtx_MEM (mode
,
3699 expand_expr (build1 (ADDR_EXPR
,
3702 make_tree (type
, val
)),
3703 NULL_RTX
, VOIDmode
, 0));
3706 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3707 gen_rtx_USE (VOIDmode
, slot
),
3710 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3711 gen_rtx_CLOBBER (VOIDmode
,
3716 val
= force_operand (XEXP (slot
, 0), NULL_RTX
);
3720 argvec
[count
].value
= val
;
3721 argvec
[count
].mode
= mode
;
3723 argvec
[count
].reg
= FUNCTION_ARG (args_so_far
, mode
, NULL_TREE
, 1);
3725 #ifdef FUNCTION_ARG_PARTIAL_NREGS
3726 argvec
[count
].partial
3727 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, mode
, NULL_TREE
, 1);
3729 argvec
[count
].partial
= 0;
3732 locate_and_pad_parm (mode
, NULL_TREE
,
3733 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3736 argvec
[count
].reg
!= 0,
3738 NULL_TREE
, &args_size
, &argvec
[count
].offset
,
3739 &argvec
[count
].size
, &alignment_pad
);
3741 if (argvec
[count
].size
.var
)
3744 if (reg_parm_stack_space
== 0 && argvec
[count
].partial
)
3745 argvec
[count
].size
.constant
-= argvec
[count
].partial
* UNITS_PER_WORD
;
3747 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
3748 || reg_parm_stack_space
> 0)
3749 args_size
.constant
+= argvec
[count
].size
.constant
;
3751 FUNCTION_ARG_ADVANCE (args_so_far
, mode
, (tree
) 0, 1);
3754 #ifdef FINAL_REG_PARM_STACK_SPACE
3755 reg_parm_stack_space
= FINAL_REG_PARM_STACK_SPACE (args_size
.constant
,
3758 /* If this machine requires an external definition for library
3759 functions, write one out. */
3760 assemble_external_libcall (fun
);
3762 original_args_size
= args_size
;
3763 #ifdef PREFERRED_STACK_BOUNDARY
3764 args_size
.constant
= (((args_size
.constant
3765 + stack_pointer_delta
3769 - stack_pointer_delta
);
3772 args_size
.constant
= MAX (args_size
.constant
,
3773 reg_parm_stack_space
);
3775 #ifndef OUTGOING_REG_PARM_STACK_SPACE
3776 args_size
.constant
-= reg_parm_stack_space
;
3779 if (args_size
.constant
> current_function_outgoing_args_size
)
3780 current_function_outgoing_args_size
= args_size
.constant
;
3782 if (ACCUMULATE_OUTGOING_ARGS
)
3784 /* Since the stack pointer will never be pushed, it is possible for
3785 the evaluation of a parm to clobber something we have already
3786 written to the stack. Since most function calls on RISC machines
3787 do not use the stack, this is uncommon, but must work correctly.
3789 Therefore, we save any area of the stack that was already written
3790 and that we are using. Here we set up to do this by making a new
3791 stack usage map from the old one.
3793 Another approach might be to try to reorder the argument
3794 evaluations to avoid this conflicting stack usage. */
3796 needed
= args_size
.constant
;
3798 #ifndef OUTGOING_REG_PARM_STACK_SPACE
3799 /* Since we will be writing into the entire argument area, the
3800 map must be allocated for its entire size, not just the part that
3801 is the responsibility of the caller. */
3802 needed
+= reg_parm_stack_space
;
3805 #ifdef ARGS_GROW_DOWNWARD
3806 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
3809 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
3812 stack_usage_map
= (char *) alloca (highest_outgoing_arg_in_use
);
3814 if (initial_highest_arg_in_use
)
3815 memcpy (stack_usage_map
, initial_stack_usage_map
,
3816 initial_highest_arg_in_use
);
3818 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
3819 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
3820 highest_outgoing_arg_in_use
- initial_highest_arg_in_use
);
3823 /* The address of the outgoing argument list must not be copied to a
3824 register here, because argblock would be left pointing to the
3825 wrong place after the call to allocate_dynamic_stack_space below. */
3827 argblock
= virtual_outgoing_args_rtx
;
3832 argblock
= push_block (GEN_INT (args_size
.constant
), 0, 0);
3835 #ifdef PREFERRED_STACK_BOUNDARY
3836 /* If we push args individually in reverse order, perform stack alignment
3837 before the first push (the last arg). */
3838 if (argblock
== 0 && PUSH_ARGS_REVERSED
)
3839 anti_adjust_stack (GEN_INT (args_size
.constant
3840 - original_args_size
.constant
));
3843 if (PUSH_ARGS_REVERSED
)
3854 #ifdef REG_PARM_STACK_SPACE
3855 if (ACCUMULATE_OUTGOING_ARGS
)
3857 /* The argument list is the property of the called routine and it
3858 may clobber it. If the fixed area has been used for previous
3859 parameters, we must save and restore it.
3861 Here we compute the boundary of the that needs to be saved, if any. */
3863 #ifdef ARGS_GROW_DOWNWARD
3864 for (count
= 0; count
< reg_parm_stack_space
+ 1; count
++)
3866 for (count
= 0; count
< reg_parm_stack_space
; count
++)
3869 if (count
>= highest_outgoing_arg_in_use
3870 || stack_usage_map
[count
] == 0)
3873 if (low_to_save
== -1)
3874 low_to_save
= count
;
3876 high_to_save
= count
;
3879 if (low_to_save
>= 0)
3881 int num_to_save
= high_to_save
- low_to_save
+ 1;
3882 enum machine_mode save_mode
3883 = mode_for_size (num_to_save
* BITS_PER_UNIT
, MODE_INT
, 1);
3886 /* If we don't have the required alignment, must do this in BLKmode. */
3887 if ((low_to_save
& (MIN (GET_MODE_SIZE (save_mode
),
3888 BIGGEST_ALIGNMENT
/ UNITS_PER_WORD
) - 1)))
3889 save_mode
= BLKmode
;
3891 #ifdef ARGS_GROW_DOWNWARD
3892 stack_area
= gen_rtx_MEM (save_mode
,
3893 memory_address (save_mode
,
3894 plus_constant (argblock
,
3897 stack_area
= gen_rtx_MEM (save_mode
,
3898 memory_address (save_mode
,
3899 plus_constant (argblock
,
3902 if (save_mode
== BLKmode
)
3904 save_area
= assign_stack_temp (BLKmode
, num_to_save
, 0);
3905 emit_block_move (validize_mem (save_area
), stack_area
,
3906 GEN_INT (num_to_save
), PARM_BOUNDARY
);
3910 save_area
= gen_reg_rtx (save_mode
);
3911 emit_move_insn (save_area
, stack_area
);
3917 /* Push the args that need to be pushed. */
3919 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
3920 are to be pushed. */
3921 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
3923 register enum machine_mode mode
= argvec
[argnum
].mode
;
3924 register rtx val
= argvec
[argnum
].value
;
3925 rtx reg
= argvec
[argnum
].reg
;
3926 int partial
= argvec
[argnum
].partial
;
3927 int lower_bound
= 0, upper_bound
= 0, i
;
3929 if (! (reg
!= 0 && partial
== 0))
3931 if (ACCUMULATE_OUTGOING_ARGS
)
3933 /* If this is being stored into a pre-allocated, fixed-size,
3934 stack area, save any previous data at that location. */
3936 #ifdef ARGS_GROW_DOWNWARD
3937 /* stack_slot is negative, but we want to index stack_usage_map
3938 with positive values. */
3939 upper_bound
= -argvec
[argnum
].offset
.constant
+ 1;
3940 lower_bound
= upper_bound
- argvec
[argnum
].size
.constant
;
3942 lower_bound
= argvec
[argnum
].offset
.constant
;
3943 upper_bound
= lower_bound
+ argvec
[argnum
].size
.constant
;
3946 for (i
= lower_bound
; i
< upper_bound
; i
++)
3947 if (stack_usage_map
[i
]
3948 /* Don't store things in the fixed argument area at this
3949 point; it has already been saved. */
3950 && i
> reg_parm_stack_space
)
3953 if (i
!= upper_bound
)
3955 /* We need to make a save area. See what mode we can make
3957 enum machine_mode save_mode
3958 = mode_for_size (argvec
[argnum
].size
.constant
3966 plus_constant (argblock
,
3967 argvec
[argnum
].offset
.constant
)));
3968 argvec
[argnum
].save_area
= gen_reg_rtx (save_mode
);
3970 emit_move_insn (argvec
[argnum
].save_area
, stack_area
);
3974 emit_push_insn (val
, mode
, NULL_TREE
, NULL_RTX
, 0, partial
, reg
, 0,
3975 argblock
, GEN_INT (argvec
[argnum
].offset
.constant
),
3976 reg_parm_stack_space
, ARGS_SIZE_RTX (alignment_pad
));
3978 /* Now mark the segment we just used. */
3979 if (ACCUMULATE_OUTGOING_ARGS
)
3980 for (i
= lower_bound
; i
< upper_bound
; i
++)
3981 stack_usage_map
[i
] = 1;
3987 #ifdef PREFERRED_STACK_BOUNDARY
3988 /* If we pushed args in forward order, perform stack alignment
3989 after pushing the last arg. */
3990 if (argblock
== 0 && !PUSH_ARGS_REVERSED
)
3991 anti_adjust_stack (GEN_INT (args_size
.constant
3992 - original_args_size
.constant
));
3995 if (PUSH_ARGS_REVERSED
)
4000 fun
= prepare_call_address (fun
, NULL_TREE
, &call_fusage
, 0);
4002 /* Now load any reg parms into their regs. */
4004 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4005 are to be pushed. */
4006 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
4008 register rtx val
= argvec
[argnum
].value
;
4009 rtx reg
= argvec
[argnum
].reg
;
4010 int partial
= argvec
[argnum
].partial
;
4012 /* Handle calls that pass values in multiple non-contiguous
4013 locations. The PA64 has examples of this for library calls. */
4014 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
4015 emit_group_load (reg
, val
,
4016 GET_MODE_SIZE (GET_MODE (val
)),
4017 GET_MODE_ALIGNMENT (GET_MODE (val
)));
4018 else if (reg
!= 0 && partial
== 0)
4019 emit_move_insn (reg
, val
);
4024 /* Any regs containing parms remain in use through the call. */
4025 for (count
= 0; count
< nargs
; count
++)
4027 rtx reg
= argvec
[count
].reg
;
4028 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
4029 use_group_regs (&call_fusage
, reg
);
4031 use_reg (&call_fusage
, reg
);
4034 /* Pass the function the address in which to return a structure value. */
4035 if (mem_value
!= 0 && struct_value_rtx
!= 0 && ! pcc_struct_value
)
4037 emit_move_insn (struct_value_rtx
,
4039 force_operand (XEXP (mem_value
, 0),
4041 if (GET_CODE (struct_value_rtx
) == REG
)
4042 use_reg (&call_fusage
, struct_value_rtx
);
4045 /* Don't allow popping to be deferred, since then
4046 cse'ing of library calls could delete a call and leave the pop. */
4048 valreg
= (mem_value
== 0 && outmode
!= VOIDmode
4049 ? hard_libcall_value (outmode
) : NULL_RTX
);
4051 #ifdef PREFERRED_STACK_BOUNDARY
4052 /* Stack must be properly aligned now. */
4053 if (stack_pointer_delta
& (PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
- 1))
4057 before_call
= get_last_insn ();
4059 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
4060 will set inhibit_defer_pop to that value. */
4061 /* The return type is needed to decide how many bytes the function pops.
4062 Signedness plays no role in that, so for simplicity, we pretend it's
4063 always signed. We also assume that the list of arguments passed has
4064 no impact, so we pretend it is unknown. */
4067 get_identifier (XSTR (orgfun
, 0)),
4068 build_function_type (outmode
== VOIDmode
? void_type_node
4069 : type_for_mode (outmode
, 0), NULL_TREE
),
4070 original_args_size
.constant
, args_size
.constant
,
4072 FUNCTION_ARG (args_so_far
, VOIDmode
, void_type_node
, 1),
4074 old_inhibit_defer_pop
+ 1, call_fusage
, flags
);
4076 /* For calls to `setjmp', etc., inform flow.c it should complain
4077 if nonvolatile values are live. For functions that cannot return,
4078 inform flow that control does not fall through. */
4080 if (flags
& (ECF_RETURNS_TWICE
| ECF_NORETURN
| ECF_LONGJMP
))
4082 /* The barrier or NOTE_INSN_SETJMP note must be emitted
4083 immediately after the CALL_INSN. Some ports emit more than
4084 just a CALL_INSN above, so we must search for it here. */
4086 rtx last
= get_last_insn ();
4087 while (GET_CODE (last
) != CALL_INSN
)
4089 last
= PREV_INSN (last
);
4090 /* There was no CALL_INSN? */
4091 if (last
== before_call
)
4095 if (flags
& ECF_RETURNS_TWICE
)
4097 emit_note_after (NOTE_INSN_SETJMP
, last
);
4098 current_function_calls_setjmp
= 1;
4101 emit_barrier_after (last
);
4104 /* Now restore inhibit_defer_pop to its actual original value. */
4107 /* If call is cse'able, make appropriate pair of reg-notes around it.
4108 Test valreg so we don't crash; may safely ignore `const'
4109 if return type is void. Disable for PARALLEL return values, because
4110 we have no way to move such values into a pseudo register. */
4111 if ((flags
& (ECF_CONST
| ECF_PURE
))
4112 && valreg
!= 0 && GET_CODE (valreg
) != PARALLEL
)
4115 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
4119 /* Construct an "equal form" for the value which mentions all the
4120 arguments in order as well as the function name. */
4121 for (i
= 0; i
< nargs
; i
++)
4122 note
= gen_rtx_EXPR_LIST (VOIDmode
, argvec
[i
].value
, note
);
4123 note
= gen_rtx_EXPR_LIST (VOIDmode
, fun
, note
);
4125 insns
= get_insns ();
4128 if (flags
& ECF_PURE
)
4129 note
= gen_rtx_EXPR_LIST (VOIDmode
,
4130 gen_rtx_USE (VOIDmode
,
4131 gen_rtx_MEM (BLKmode
,
4132 gen_rtx_SCRATCH (VOIDmode
))), note
);
4134 emit_libcall_block (insns
, temp
, valreg
, note
);
4138 else if (flags
& (ECF_CONST
| ECF_PURE
))
4140 /* Otherwise, just write out the sequence without a note. */
4141 rtx insns
= get_insns ();
4148 /* Copy the value to the right place. */
4149 if (outmode
!= VOIDmode
&& retval
)
4155 if (value
!= mem_value
)
4156 emit_move_insn (value
, mem_value
);
4158 else if (value
!= 0)
4159 emit_move_insn (value
, hard_libcall_value (outmode
));
4161 value
= hard_libcall_value (outmode
);
4164 if (ACCUMULATE_OUTGOING_ARGS
)
4166 #ifdef REG_PARM_STACK_SPACE
4169 enum machine_mode save_mode
= GET_MODE (save_area
);
4170 #ifdef ARGS_GROW_DOWNWARD
4172 = gen_rtx_MEM (save_mode
,
4173 memory_address (save_mode
,
4174 plus_constant (argblock
,
4178 = gen_rtx_MEM (save_mode
,
4179 memory_address (save_mode
,
4180 plus_constant (argblock
, low_to_save
)));
4182 if (save_mode
!= BLKmode
)
4183 emit_move_insn (stack_area
, save_area
);
4185 emit_block_move (stack_area
, validize_mem (save_area
),
4186 GEN_INT (high_to_save
- low_to_save
+ 1),
4191 /* If we saved any argument areas, restore them. */
4192 for (count
= 0; count
< nargs
; count
++)
4193 if (argvec
[count
].save_area
)
4195 enum machine_mode save_mode
= GET_MODE (argvec
[count
].save_area
);
4197 = gen_rtx_MEM (save_mode
,
4200 plus_constant (argblock
,
4201 argvec
[count
].offset
.constant
)));
4203 emit_move_insn (stack_area
, argvec
[count
].save_area
);
4206 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
4207 stack_usage_map
= initial_stack_usage_map
;
4214 /* Output a library call to function FUN (a SYMBOL_REF rtx)
4215 (emitting the queue unless NO_QUEUE is nonzero),
4216 for a value of mode OUTMODE,
4217 with NARGS different arguments, passed as alternating rtx values
4218 and machine_modes to convert them to.
4219 The rtx values should have been passed through protect_from_queue already.
4221 FN_TYPE will is zero for `normal' calls, one for `const' calls, wich
4222 which will be enclosed in REG_LIBCALL/REG_RETVAL notes and two for `pure'
4223 calls, that are handled like `const' calls with extra
4224 (use (memory (scratch)). */
4227 emit_library_call
VPARAMS((rtx orgfun
, enum libcall_type fn_type
,
4228 enum machine_mode outmode
, int nargs
, ...))
4230 #ifndef ANSI_PROTOTYPES
4233 enum machine_mode outmode
;
4238 VA_START (p
, nargs
);
4240 #ifndef ANSI_PROTOTYPES
4241 orgfun
= va_arg (p
, rtx
);
4242 fn_type
= va_arg (p
, int);
4243 outmode
= va_arg (p
, enum machine_mode
);
4244 nargs
= va_arg (p
, int);
4247 emit_library_call_value_1 (0, orgfun
, NULL_RTX
, fn_type
, outmode
, nargs
, p
);
4252 /* Like emit_library_call except that an extra argument, VALUE,
4253 comes second and says where to store the result.
4254 (If VALUE is zero, this function chooses a convenient way
4255 to return the value.
4257 This function returns an rtx for where the value is to be found.
4258 If VALUE is nonzero, VALUE is returned. */
4261 emit_library_call_value
VPARAMS((rtx orgfun
, rtx value
,
4262 enum libcall_type fn_type
,
4263 enum machine_mode outmode
, int nargs
, ...))
4265 #ifndef ANSI_PROTOTYPES
4269 enum machine_mode outmode
;
4274 VA_START (p
, nargs
);
4276 #ifndef ANSI_PROTOTYPES
4277 orgfun
= va_arg (p
, rtx
);
4278 value
= va_arg (p
, rtx
);
4279 fn_type
= va_arg (p
, int);
4280 outmode
= va_arg (p
, enum machine_mode
);
4281 nargs
= va_arg (p
, int);
4284 value
= emit_library_call_value_1 (1, orgfun
, value
, fn_type
, outmode
, nargs
, p
);
4292 /* Return an rtx which represents a suitable home on the stack
4293 given TYPE, the type of the argument looking for a home.
4294 This is called only for BLKmode arguments.
4296 SIZE is the size needed for this target.
4297 ARGS_ADDR is the address of the bottom of the argument block for this call.
4298 OFFSET describes this parameter's offset into ARGS_ADDR. It is meaningless
4299 if this machine uses push insns. */
4302 target_for_arg (type
, size
, args_addr
, offset
)
4306 struct args_size offset
;
4309 rtx offset_rtx
= ARGS_SIZE_RTX (offset
);
4311 /* We do not call memory_address if possible,
4312 because we want to address as close to the stack
4313 as possible. For non-variable sized arguments,
4314 this will be stack-pointer relative addressing. */
4315 if (GET_CODE (offset_rtx
) == CONST_INT
)
4316 target
= plus_constant (args_addr
, INTVAL (offset_rtx
));
4319 /* I have no idea how to guarantee that this
4320 will work in the presence of register parameters. */
4321 target
= gen_rtx_PLUS (Pmode
, args_addr
, offset_rtx
);
4322 target
= memory_address (QImode
, target
);
4325 return gen_rtx_MEM (BLKmode
, target
);
4329 /* Store a single argument for a function call
4330 into the register or memory area where it must be passed.
4331 *ARG describes the argument value and where to pass it.
4333 ARGBLOCK is the address of the stack-block for all the arguments,
4334 or 0 on a machine where arguments are pushed individually.
4336 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
4337 so must be careful about how the stack is used.
4339 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
4340 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
4341 that we need not worry about saving and restoring the stack.
4343 FNDECL is the declaration of the function we are calling.
4345 Return non-zero if this arg should cause sibcall failure,
4349 store_one_arg (arg
, argblock
, flags
, variable_size
, reg_parm_stack_space
)
4350 struct arg_data
*arg
;
4353 int variable_size ATTRIBUTE_UNUSED
;
4354 int reg_parm_stack_space
;
4356 register tree pval
= arg
->tree_value
;
4360 int i
, lower_bound
= 0, upper_bound
= 0;
4361 int sibcall_failure
= 0;
4363 if (TREE_CODE (pval
) == ERROR_MARK
)
4366 /* Push a new temporary level for any temporaries we make for
4370 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
))
4372 /* If this is being stored into a pre-allocated, fixed-size, stack area,
4373 save any previous data at that location. */
4374 if (argblock
&& ! variable_size
&& arg
->stack
)
4376 #ifdef ARGS_GROW_DOWNWARD
4377 /* stack_slot is negative, but we want to index stack_usage_map
4378 with positive values. */
4379 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
4380 upper_bound
= -INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1)) + 1;
4384 lower_bound
= upper_bound
- arg
->size
.constant
;
4386 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
4387 lower_bound
= INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1));
4391 upper_bound
= lower_bound
+ arg
->size
.constant
;
4394 for (i
= lower_bound
; i
< upper_bound
; i
++)
4395 if (stack_usage_map
[i
]
4396 /* Don't store things in the fixed argument area at this point;
4397 it has already been saved. */
4398 && i
> reg_parm_stack_space
)
4401 if (i
!= upper_bound
)
4403 /* We need to make a save area. See what mode we can make it. */
4404 enum machine_mode save_mode
4405 = mode_for_size (arg
->size
.constant
* BITS_PER_UNIT
, MODE_INT
, 1);
4407 = gen_rtx_MEM (save_mode
,
4408 memory_address (save_mode
,
4409 XEXP (arg
->stack_slot
, 0)));
4411 if (save_mode
== BLKmode
)
4413 tree ot
= TREE_TYPE (arg
->tree_value
);
4414 tree nt
= build_qualified_type (ot
, (TYPE_QUALS (ot
)
4415 | TYPE_QUAL_CONST
));
4417 arg
->save_area
= assign_temp (nt
, 0, 1, 1);
4418 preserve_temp_slots (arg
->save_area
);
4419 emit_block_move (validize_mem (arg
->save_area
), stack_area
,
4420 expr_size (arg
->tree_value
),
4421 MIN (PARM_BOUNDARY
, TYPE_ALIGN (nt
)));
4425 arg
->save_area
= gen_reg_rtx (save_mode
);
4426 emit_move_insn (arg
->save_area
, stack_area
);
4430 /* Now that we have saved any slots that will be overwritten by this
4431 store, mark all slots this store will use. We must do this before
4432 we actually expand the argument since the expansion itself may
4433 trigger library calls which might need to use the same stack slot. */
4434 if (argblock
&& ! variable_size
&& arg
->stack
)
4435 for (i
= lower_bound
; i
< upper_bound
; i
++)
4436 stack_usage_map
[i
] = 1;
4439 /* If this isn't going to be placed on both the stack and in registers,
4440 set up the register and number of words. */
4441 if (! arg
->pass_on_stack
)
4442 reg
= arg
->reg
, partial
= arg
->partial
;
4444 if (reg
!= 0 && partial
== 0)
4445 /* Being passed entirely in a register. We shouldn't be called in
4449 /* If this arg needs special alignment, don't load the registers
4451 if (arg
->n_aligned_regs
!= 0)
4454 /* If this is being passed partially in a register, we can't evaluate
4455 it directly into its stack slot. Otherwise, we can. */
4456 if (arg
->value
== 0)
4458 /* stack_arg_under_construction is nonzero if a function argument is
4459 being evaluated directly into the outgoing argument list and
4460 expand_call must take special action to preserve the argument list
4461 if it is called recursively.
4463 For scalar function arguments stack_usage_map is sufficient to
4464 determine which stack slots must be saved and restored. Scalar
4465 arguments in general have pass_on_stack == 0.
4467 If this argument is initialized by a function which takes the
4468 address of the argument (a C++ constructor or a C function
4469 returning a BLKmode structure), then stack_usage_map is
4470 insufficient and expand_call must push the stack around the
4471 function call. Such arguments have pass_on_stack == 1.
4473 Note that it is always safe to set stack_arg_under_construction,
4474 but this generates suboptimal code if set when not needed. */
4476 if (arg
->pass_on_stack
)
4477 stack_arg_under_construction
++;
4479 arg
->value
= expand_expr (pval
,
4481 || TYPE_MODE (TREE_TYPE (pval
)) != arg
->mode
)
4482 ? NULL_RTX
: arg
->stack
,
4485 /* If we are promoting object (or for any other reason) the mode
4486 doesn't agree, convert the mode. */
4488 if (arg
->mode
!= TYPE_MODE (TREE_TYPE (pval
)))
4489 arg
->value
= convert_modes (arg
->mode
, TYPE_MODE (TREE_TYPE (pval
)),
4490 arg
->value
, arg
->unsignedp
);
4492 if (arg
->pass_on_stack
)
4493 stack_arg_under_construction
--;
4496 /* Don't allow anything left on stack from computation
4497 of argument to alloca. */
4498 if (flags
& ECF_MAY_BE_ALLOCA
)
4499 do_pending_stack_adjust ();
4501 if (arg
->value
== arg
->stack
)
4503 /* If the value is already in the stack slot, we are done. */
4504 if (current_function_check_memory_usage
&& GET_CODE (arg
->stack
) == MEM
)
4506 emit_library_call (chkr_set_right_libfunc
, LCT_CONST_MAKE_BLOCK
,
4507 VOIDmode
, 3, XEXP (arg
->stack
, 0), Pmode
,
4508 ARGS_SIZE_RTX (arg
->size
),
4509 TYPE_MODE (sizetype
),
4510 GEN_INT (MEMORY_USE_RW
),
4511 TYPE_MODE (integer_type_node
));
4514 else if (arg
->mode
!= BLKmode
)
4518 /* Argument is a scalar, not entirely passed in registers.
4519 (If part is passed in registers, arg->partial says how much
4520 and emit_push_insn will take care of putting it there.)
4522 Push it, and if its size is less than the
4523 amount of space allocated to it,
4524 also bump stack pointer by the additional space.
4525 Note that in C the default argument promotions
4526 will prevent such mismatches. */
4528 size
= GET_MODE_SIZE (arg
->mode
);
4529 /* Compute how much space the push instruction will push.
4530 On many machines, pushing a byte will advance the stack
4531 pointer by a halfword. */
4532 #ifdef PUSH_ROUNDING
4533 size
= PUSH_ROUNDING (size
);
4537 /* Compute how much space the argument should get:
4538 round up to a multiple of the alignment for arguments. */
4539 if (none
!= FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)))
4540 used
= (((size
+ PARM_BOUNDARY
/ BITS_PER_UNIT
- 1)
4541 / (PARM_BOUNDARY
/ BITS_PER_UNIT
))
4542 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
4544 /* This isn't already where we want it on the stack, so put it there.
4545 This can either be done with push or copy insns. */
4546 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), NULL_RTX
, 0,
4547 partial
, reg
, used
- size
, argblock
,
4548 ARGS_SIZE_RTX (arg
->offset
), reg_parm_stack_space
,
4549 ARGS_SIZE_RTX (arg
->alignment_pad
));
4553 /* BLKmode, at least partly to be pushed. */
4555 register int excess
;
4558 /* Pushing a nonscalar.
4559 If part is passed in registers, PARTIAL says how much
4560 and emit_push_insn will take care of putting it there. */
4562 /* Round its size up to a multiple
4563 of the allocation unit for arguments. */
4565 if (arg
->size
.var
!= 0)
4568 size_rtx
= ARGS_SIZE_RTX (arg
->size
);
4572 /* PUSH_ROUNDING has no effect on us, because
4573 emit_push_insn for BLKmode is careful to avoid it. */
4574 excess
= (arg
->size
.constant
- int_size_in_bytes (TREE_TYPE (pval
))
4575 + partial
* UNITS_PER_WORD
);
4576 size_rtx
= expr_size (pval
);
4579 if ((flags
& ECF_SIBCALL
) && GET_CODE (arg
->value
) == MEM
)
4581 /* emit_push_insn might not work properly if arg->value and
4582 argblock + arg->offset areas overlap. */
4586 if (XEXP (x
, 0) == current_function_internal_arg_pointer
4587 || (GET_CODE (XEXP (x
, 0)) == PLUS
4588 && XEXP (XEXP (x
, 0), 0) ==
4589 current_function_internal_arg_pointer
4590 && GET_CODE (XEXP (XEXP (x
, 0), 1)) == CONST_INT
))
4592 if (XEXP (x
, 0) != current_function_internal_arg_pointer
)
4593 i
= INTVAL (XEXP (XEXP (x
, 0), 1));
4595 /* expand_call should ensure this */
4596 if (arg
->offset
.var
|| GET_CODE (size_rtx
) != CONST_INT
)
4599 if (arg
->offset
.constant
> i
)
4601 if (arg
->offset
.constant
< i
+ INTVAL (size_rtx
))
4602 sibcall_failure
= 1;
4604 else if (arg
->offset
.constant
< i
)
4606 if (i
< arg
->offset
.constant
+ INTVAL (size_rtx
))
4607 sibcall_failure
= 1;
4612 /* If parm is passed both in stack and in register and offset is
4613 greater than reg_parm_stack_space, split the offset. */
4614 if (arg
->reg
&& arg
->pass_on_stack
)
4616 if (arg
->offset
.constant
< reg_parm_stack_space
&& arg
->offset
.var
)
4617 error ("variable offset is passed paritially in stack and in reg");
4618 else if (arg
->offset
.constant
< reg_parm_stack_space
&& arg
->size
.var
)
4619 error ("variable size is passed partially in stack and in reg");
4620 else if (arg
->offset
.constant
< reg_parm_stack_space
4621 && ((arg
->offset
.constant
+ arg
->size
.constant
)
4622 > reg_parm_stack_space
))
4624 rtx size_rtx1
= GEN_INT (reg_parm_stack_space
- arg
->offset
.constant
);
4625 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), size_rtx1
,
4626 TYPE_ALIGN (TREE_TYPE (pval
)), partial
, reg
,
4627 excess
, argblock
, ARGS_SIZE_RTX (arg
->offset
),
4628 reg_parm_stack_space
,
4629 ARGS_SIZE_RTX (arg
->alignment_pad
));
4631 size_rtx
= GEN_INT (INTVAL(size_rtx
) - reg_parm_stack_space
);
4636 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), size_rtx
,
4637 TYPE_ALIGN (TREE_TYPE (pval
)), partial
, reg
, excess
,
4638 argblock
, ARGS_SIZE_RTX (arg
->offset
),
4639 reg_parm_stack_space
,
4640 ARGS_SIZE_RTX (arg
->alignment_pad
));
4643 /* Unless this is a partially-in-register argument, the argument is now
4646 ??? Note that this can change arg->value from arg->stack to
4647 arg->stack_slot and it matters when they are not the same.
4648 It isn't totally clear that this is correct in all cases. */
4650 arg
->value
= arg
->stack_slot
;
4652 /* Once we have pushed something, pops can't safely
4653 be deferred during the rest of the arguments. */
4656 /* ANSI doesn't require a sequence point here,
4657 but PCC has one, so this will avoid some problems. */
4660 /* Free any temporary slots made in processing this argument. Show
4661 that we might have taken the address of something and pushed that
4663 preserve_temp_slots (NULL_RTX
);
4667 return sibcall_failure
;