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, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
39 #include "langhooks.h"
44 /* Like PREFERRED_STACK_BOUNDARY but in units of bytes, not bits. */
45 #define STACK_BYTES (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT)
47 /* Data structure and subroutines used within expand_call. */
51 /* Tree node for this argument. */
53 /* Mode for value; TYPE_MODE unless promoted. */
54 enum machine_mode mode
;
55 /* Current RTL value for argument, or 0 if it isn't precomputed. */
57 /* Initially-compute RTL value for argument; only for const functions. */
59 /* Register to pass this argument in, 0 if passed on stack, or an
60 PARALLEL if the arg is to be copied into multiple non-contiguous
63 /* Register to pass this argument in when generating tail call sequence.
64 This is not the same register as for normal calls on machines with
67 /* If REG is a PARALLEL, this is a copy of VALUE pulled into the correct
68 form for emit_group_move. */
70 /* If REG was promoted from the actual mode of the argument expression,
71 indicates whether the promotion is sign- or zero-extended. */
73 /* Number of registers to use. 0 means put the whole arg in registers.
74 Also 0 if not passed in registers. */
76 /* Nonzero if argument must be passed on stack.
77 Note that some arguments may be passed on the stack
78 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
79 pass_on_stack identifies arguments that *cannot* go in registers. */
81 /* Some fields packaged up for locate_and_pad_parm. */
82 struct locate_and_pad_arg_data locate
;
83 /* Location on the stack at which parameter should be stored. The store
84 has already been done if STACK == VALUE. */
86 /* Location on the stack of the start of this argument slot. This can
87 differ from STACK if this arg pads downward. This location is known
88 to be aligned to FUNCTION_ARG_BOUNDARY. */
90 /* Place that this stack area has been saved, if needed. */
92 /* If an argument's alignment does not permit direct copying into registers,
93 copy in smaller-sized pieces into pseudos. These are stored in a
94 block pointed to by this field. The next field says how many
95 word-sized pseudos we made. */
100 /* A vector of one char per byte of stack space. A byte if nonzero if
101 the corresponding stack location has been used.
102 This vector is used to prevent a function call within an argument from
103 clobbering any stack already set up. */
104 static char *stack_usage_map
;
106 /* Size of STACK_USAGE_MAP. */
107 static int highest_outgoing_arg_in_use
;
109 /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding
110 stack location's tail call argument has been already stored into the stack.
111 This bitmap is used to prevent sibling call optimization if function tries
112 to use parent's incoming argument slots when they have been already
113 overwritten with tail call arguments. */
114 static sbitmap stored_args_map
;
116 /* stack_arg_under_construction is nonzero when an argument may be
117 initialized with a constructor call (including a C function that
118 returns a BLKmode struct) and expand_call must take special action
119 to make sure the object being constructed does not overlap the
120 argument list for the constructor call. */
121 int stack_arg_under_construction
;
123 static void emit_call_1 (rtx
, tree
, tree
, tree
, HOST_WIDE_INT
, HOST_WIDE_INT
,
124 HOST_WIDE_INT
, rtx
, rtx
, int, rtx
, int,
126 static void precompute_register_parameters (int, struct arg_data
*, int *);
127 static int store_one_arg (struct arg_data
*, rtx
, int, int, int);
128 static void store_unaligned_arguments_into_pseudos (struct arg_data
*, int);
129 static int finalize_must_preallocate (int, int, struct arg_data
*,
131 static void precompute_arguments (int, int, struct arg_data
*);
132 static int compute_argument_block_size (int, struct args_size
*, int);
133 static void initialize_argument_information (int, struct arg_data
*,
134 struct args_size
*, int, tree
,
135 tree
, CUMULATIVE_ARGS
*, int,
136 rtx
*, int *, int *, int *,
138 static void compute_argument_addresses (struct arg_data
*, rtx
, int);
139 static rtx
rtx_for_function_call (tree
, tree
);
140 static void load_register_parameters (struct arg_data
*, int, rtx
*, int,
142 static rtx
emit_library_call_value_1 (int, rtx
, rtx
, enum libcall_type
,
143 enum machine_mode
, int, va_list);
144 static int special_function_p (tree
, int);
145 static int check_sibcall_argument_overlap_1 (rtx
);
146 static int check_sibcall_argument_overlap (rtx
, struct arg_data
*, int);
148 static int combine_pending_stack_adjustment_and_call (int, struct args_size
*,
150 static tree
split_complex_values (tree
);
151 static tree
split_complex_types (tree
);
153 #ifdef REG_PARM_STACK_SPACE
154 static rtx
save_fixed_argument_area (int, rtx
, int *, int *);
155 static void restore_fixed_argument_area (rtx
, rtx
, int, int);
158 /* Force FUNEXP into a form suitable for the address of a CALL,
159 and return that as an rtx. Also load the static chain register
160 if FNDECL is a nested function.
162 CALL_FUSAGE points to a variable holding the prospective
163 CALL_INSN_FUNCTION_USAGE information. */
166 prepare_call_address (rtx funexp
, rtx static_chain_value
,
167 rtx
*call_fusage
, int reg_parm_seen
, int sibcallp
)
169 /* Make a valid memory address and copy constants through pseudo-regs,
170 but not for a constant address if -fno-function-cse. */
171 if (GET_CODE (funexp
) != SYMBOL_REF
)
172 /* If we are using registers for parameters, force the
173 function address into a register now. */
174 funexp
= ((SMALL_REGISTER_CLASSES
&& reg_parm_seen
)
175 ? force_not_mem (memory_address (FUNCTION_MODE
, funexp
))
176 : memory_address (FUNCTION_MODE
, funexp
));
179 #ifndef NO_FUNCTION_CSE
180 if (optimize
&& ! flag_no_function_cse
)
181 funexp
= force_reg (Pmode
, funexp
);
185 if (static_chain_value
!= 0)
187 static_chain_value
= convert_memory_address (Pmode
, static_chain_value
);
188 emit_move_insn (static_chain_rtx
, static_chain_value
);
190 if (REG_P (static_chain_rtx
))
191 use_reg (call_fusage
, static_chain_rtx
);
197 /* Generate instructions to call function FUNEXP,
198 and optionally pop the results.
199 The CALL_INSN is the first insn generated.
201 FNDECL is the declaration node of the function. This is given to the
202 macro RETURN_POPS_ARGS to determine whether this function pops its own args.
204 FUNTYPE is the data type of the function. This is given to the macro
205 RETURN_POPS_ARGS to determine whether this function pops its own args.
206 We used to allow an identifier for library functions, but that doesn't
207 work when the return type is an aggregate type and the calling convention
208 says that the pointer to this aggregate is to be popped by the callee.
210 STACK_SIZE is the number of bytes of arguments on the stack,
211 ROUNDED_STACK_SIZE is that number rounded up to
212 PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is
213 both to put into the call insn and to generate explicit popping
216 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
217 It is zero if this call doesn't want a structure value.
219 NEXT_ARG_REG is the rtx that results from executing
220 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1)
221 just after all the args have had their registers assigned.
222 This could be whatever you like, but normally it is the first
223 arg-register beyond those used for args in this call,
224 or 0 if all the arg-registers are used in this call.
225 It is passed on to `gen_call' so you can put this info in the call insn.
227 VALREG is a hard register in which a value is returned,
228 or 0 if the call does not return a value.
230 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
231 the args to this call were processed.
232 We restore `inhibit_defer_pop' to that value.
234 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
235 denote registers used by the called function. */
238 emit_call_1 (rtx funexp
, tree fntree
, tree fndecl ATTRIBUTE_UNUSED
,
239 tree funtype ATTRIBUTE_UNUSED
,
240 HOST_WIDE_INT stack_size ATTRIBUTE_UNUSED
,
241 HOST_WIDE_INT rounded_stack_size
,
242 HOST_WIDE_INT struct_value_size ATTRIBUTE_UNUSED
,
243 rtx next_arg_reg ATTRIBUTE_UNUSED
, rtx valreg
,
244 int old_inhibit_defer_pop
, rtx call_fusage
, int ecf_flags
,
245 CUMULATIVE_ARGS
*args_so_far ATTRIBUTE_UNUSED
)
247 rtx rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
249 int already_popped
= 0;
250 HOST_WIDE_INT n_popped
= RETURN_POPS_ARGS (fndecl
, funtype
, stack_size
);
251 #if defined (HAVE_call) && defined (HAVE_call_value)
252 rtx struct_value_size_rtx
;
253 struct_value_size_rtx
= GEN_INT (struct_value_size
);
256 #ifdef CALL_POPS_ARGS
257 n_popped
+= CALL_POPS_ARGS (* args_so_far
);
260 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
261 and we don't want to load it into a register as an optimization,
262 because prepare_call_address already did it if it should be done. */
263 if (GET_CODE (funexp
) != SYMBOL_REF
)
264 funexp
= memory_address (FUNCTION_MODE
, funexp
);
266 #if defined (HAVE_sibcall_pop) && defined (HAVE_sibcall_value_pop)
267 if ((ecf_flags
& ECF_SIBCALL
)
268 && HAVE_sibcall_pop
&& HAVE_sibcall_value_pop
269 && (n_popped
> 0 || stack_size
== 0))
271 rtx n_pop
= GEN_INT (n_popped
);
274 /* If this subroutine pops its own args, record that in the call insn
275 if possible, for the sake of frame pointer elimination. */
278 pat
= GEN_SIBCALL_VALUE_POP (valreg
,
279 gen_rtx_MEM (FUNCTION_MODE
, funexp
),
280 rounded_stack_size_rtx
, next_arg_reg
,
283 pat
= GEN_SIBCALL_POP (gen_rtx_MEM (FUNCTION_MODE
, funexp
),
284 rounded_stack_size_rtx
, next_arg_reg
, n_pop
);
286 emit_call_insn (pat
);
292 #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop)
293 /* If the target has "call" or "call_value" insns, then prefer them
294 if no arguments are actually popped. If the target does not have
295 "call" or "call_value" insns, then we must use the popping versions
296 even if the call has no arguments to pop. */
297 #if defined (HAVE_call) && defined (HAVE_call_value)
298 if (HAVE_call
&& HAVE_call_value
&& HAVE_call_pop
&& HAVE_call_value_pop
299 && n_popped
> 0 && ! (ecf_flags
& ECF_SP_DEPRESSED
))
301 if (HAVE_call_pop
&& HAVE_call_value_pop
)
304 rtx n_pop
= GEN_INT (n_popped
);
307 /* If this subroutine pops its own args, record that in the call insn
308 if possible, for the sake of frame pointer elimination. */
311 pat
= GEN_CALL_VALUE_POP (valreg
,
312 gen_rtx_MEM (FUNCTION_MODE
, funexp
),
313 rounded_stack_size_rtx
, next_arg_reg
, n_pop
);
315 pat
= GEN_CALL_POP (gen_rtx_MEM (FUNCTION_MODE
, funexp
),
316 rounded_stack_size_rtx
, next_arg_reg
, n_pop
);
318 emit_call_insn (pat
);
324 #if defined (HAVE_sibcall) && defined (HAVE_sibcall_value)
325 if ((ecf_flags
& ECF_SIBCALL
)
326 && HAVE_sibcall
&& HAVE_sibcall_value
)
329 emit_call_insn (GEN_SIBCALL_VALUE (valreg
,
330 gen_rtx_MEM (FUNCTION_MODE
, funexp
),
331 rounded_stack_size_rtx
,
332 next_arg_reg
, NULL_RTX
));
334 emit_call_insn (GEN_SIBCALL (gen_rtx_MEM (FUNCTION_MODE
, funexp
),
335 rounded_stack_size_rtx
, next_arg_reg
,
336 struct_value_size_rtx
));
341 #if defined (HAVE_call) && defined (HAVE_call_value)
342 if (HAVE_call
&& HAVE_call_value
)
345 emit_call_insn (GEN_CALL_VALUE (valreg
,
346 gen_rtx_MEM (FUNCTION_MODE
, funexp
),
347 rounded_stack_size_rtx
, next_arg_reg
,
350 emit_call_insn (GEN_CALL (gen_rtx_MEM (FUNCTION_MODE
, funexp
),
351 rounded_stack_size_rtx
, next_arg_reg
,
352 struct_value_size_rtx
));
358 /* Find the call we just emitted. */
359 call_insn
= last_call_insn ();
361 /* Mark memory as used for "pure" function call. */
362 if (ecf_flags
& ECF_PURE
)
366 gen_rtx_USE (VOIDmode
,
367 gen_rtx_MEM (BLKmode
, gen_rtx_SCRATCH (VOIDmode
))),
370 /* Put the register usage information there. */
371 add_function_usage_to (call_insn
, call_fusage
);
373 /* If this is a const call, then set the insn's unchanging bit. */
374 if (ecf_flags
& (ECF_CONST
| ECF_PURE
))
375 CONST_OR_PURE_CALL_P (call_insn
) = 1;
377 /* If this call can't throw, attach a REG_EH_REGION reg note to that
379 if (ecf_flags
& ECF_NOTHROW
)
380 REG_NOTES (call_insn
) = gen_rtx_EXPR_LIST (REG_EH_REGION
, const0_rtx
,
381 REG_NOTES (call_insn
));
384 int rn
= lookup_stmt_eh_region (fntree
);
386 /* If rn < 0, then either (1) tree-ssa not used or (2) doesn't
387 throw, which we already took care of. */
389 REG_NOTES (call_insn
) = gen_rtx_EXPR_LIST (REG_EH_REGION
, GEN_INT (rn
),
390 REG_NOTES (call_insn
));
391 note_current_region_may_contain_throw ();
394 if (ecf_flags
& ECF_NORETURN
)
395 REG_NOTES (call_insn
) = gen_rtx_EXPR_LIST (REG_NORETURN
, const0_rtx
,
396 REG_NOTES (call_insn
));
397 if (ecf_flags
& ECF_ALWAYS_RETURN
)
398 REG_NOTES (call_insn
) = gen_rtx_EXPR_LIST (REG_ALWAYS_RETURN
, const0_rtx
,
399 REG_NOTES (call_insn
));
401 if (ecf_flags
& ECF_RETURNS_TWICE
)
403 REG_NOTES (call_insn
) = gen_rtx_EXPR_LIST (REG_SETJMP
, const0_rtx
,
404 REG_NOTES (call_insn
));
405 current_function_calls_setjmp
= 1;
408 SIBLING_CALL_P (call_insn
) = ((ecf_flags
& ECF_SIBCALL
) != 0);
410 /* Restore this now, so that we do defer pops for this call's args
411 if the context of the call as a whole permits. */
412 inhibit_defer_pop
= old_inhibit_defer_pop
;
417 CALL_INSN_FUNCTION_USAGE (call_insn
)
418 = gen_rtx_EXPR_LIST (VOIDmode
,
419 gen_rtx_CLOBBER (VOIDmode
, stack_pointer_rtx
),
420 CALL_INSN_FUNCTION_USAGE (call_insn
));
421 rounded_stack_size
-= n_popped
;
422 rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
423 stack_pointer_delta
-= n_popped
;
426 if (!ACCUMULATE_OUTGOING_ARGS
)
428 /* If returning from the subroutine does not automatically pop the args,
429 we need an instruction to pop them sooner or later.
430 Perhaps do it now; perhaps just record how much space to pop later.
432 If returning from the subroutine does pop the args, indicate that the
433 stack pointer will be changed. */
435 if (rounded_stack_size
!= 0)
437 if (ecf_flags
& (ECF_SP_DEPRESSED
| ECF_NORETURN
))
438 /* Just pretend we did the pop. */
439 stack_pointer_delta
-= rounded_stack_size
;
440 else if (flag_defer_pop
&& inhibit_defer_pop
== 0
441 && ! (ecf_flags
& (ECF_CONST
| ECF_PURE
)))
442 pending_stack_adjust
+= rounded_stack_size
;
444 adjust_stack (rounded_stack_size_rtx
);
447 /* When we accumulate outgoing args, we must avoid any stack manipulations.
448 Restore the stack pointer to its original value now. Usually
449 ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions.
450 On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and
451 popping variants of functions exist as well.
453 ??? We may optimize similar to defer_pop above, but it is
454 probably not worthwhile.
456 ??? It will be worthwhile to enable combine_stack_adjustments even for
459 anti_adjust_stack (GEN_INT (n_popped
));
462 /* Determine if the function identified by NAME and FNDECL is one with
463 special properties we wish to know about.
465 For example, if the function might return more than one time (setjmp), then
466 set RETURNS_TWICE to a nonzero value.
468 Similarly set LONGJMP for if the function is in the longjmp family.
470 Set MAY_BE_ALLOCA for any memory allocation function that might allocate
471 space from the stack such as alloca. */
474 special_function_p (tree fndecl
, int flags
)
476 if (fndecl
&& DECL_NAME (fndecl
)
477 && IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) <= 17
478 /* Exclude functions not at the file scope, or not `extern',
479 since they are not the magic functions we would otherwise
481 FIXME: this should be handled with attributes, not with this
482 hacky imitation of DECL_ASSEMBLER_NAME. It's (also) wrong
483 because you can declare fork() inside a function if you
485 && (DECL_CONTEXT (fndecl
) == NULL_TREE
486 || TREE_CODE (DECL_CONTEXT (fndecl
)) == TRANSLATION_UNIT_DECL
)
487 && TREE_PUBLIC (fndecl
))
489 const char *name
= IDENTIFIER_POINTER (DECL_NAME (fndecl
));
490 const char *tname
= name
;
492 /* We assume that alloca will always be called by name. It
493 makes no sense to pass it as a pointer-to-function to
494 anything that does not understand its behavior. */
495 if (((IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 6
497 && ! strcmp (name
, "alloca"))
498 || (IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 16
500 && ! strcmp (name
, "__builtin_alloca"))))
501 flags
|= ECF_MAY_BE_ALLOCA
;
503 /* Disregard prefix _, __ or __x. */
506 if (name
[1] == '_' && name
[2] == 'x')
508 else if (name
[1] == '_')
517 && (! strcmp (tname
, "setjmp")
518 || ! strcmp (tname
, "setjmp_syscall")))
520 && ! strcmp (tname
, "sigsetjmp"))
522 && ! strcmp (tname
, "savectx")))
523 flags
|= ECF_RETURNS_TWICE
;
526 && ! strcmp (tname
, "siglongjmp"))
527 flags
|= ECF_NORETURN
;
529 else if ((tname
[0] == 'q' && tname
[1] == 's'
530 && ! strcmp (tname
, "qsetjmp"))
531 || (tname
[0] == 'v' && tname
[1] == 'f'
532 && ! strcmp (tname
, "vfork")))
533 flags
|= ECF_RETURNS_TWICE
;
535 else if (tname
[0] == 'l' && tname
[1] == 'o'
536 && ! strcmp (tname
, "longjmp"))
537 flags
|= ECF_NORETURN
;
543 /* Return nonzero when tree represent call to longjmp. */
546 setjmp_call_p (tree fndecl
)
548 return special_function_p (fndecl
, 0) & ECF_RETURNS_TWICE
;
551 /* Return true when exp contains alloca call. */
553 alloca_call_p (tree exp
)
555 if (TREE_CODE (exp
) == CALL_EXPR
556 && TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
557 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
559 && (special_function_p (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
560 0) & ECF_MAY_BE_ALLOCA
))
565 /* Detect flags (function attributes) from the function decl or type node. */
568 flags_from_decl_or_type (tree exp
)
575 struct cgraph_rtl_info
*i
= cgraph_rtl_info (exp
);
576 type
= TREE_TYPE (exp
);
580 if (i
->pure_function
)
581 flags
|= ECF_PURE
| ECF_LIBCALL_BLOCK
;
582 if (i
->const_function
)
583 flags
|= ECF_CONST
| ECF_LIBCALL_BLOCK
;
586 /* The function exp may have the `malloc' attribute. */
587 if (DECL_IS_MALLOC (exp
))
590 /* The function exp may have the `pure' attribute. */
591 if (DECL_IS_PURE (exp
))
592 flags
|= ECF_PURE
| ECF_LIBCALL_BLOCK
;
594 if (TREE_NOTHROW (exp
))
595 flags
|= ECF_NOTHROW
;
597 if (TREE_READONLY (exp
) && ! TREE_THIS_VOLATILE (exp
))
598 flags
|= ECF_LIBCALL_BLOCK
| ECF_CONST
;
600 flags
= special_function_p (exp
, flags
);
602 else if (TYPE_P (exp
) && TYPE_READONLY (exp
) && ! TREE_THIS_VOLATILE (exp
))
605 if (TREE_THIS_VOLATILE (exp
))
606 flags
|= ECF_NORETURN
;
608 /* Mark if the function returns with the stack pointer depressed. We
609 cannot consider it pure or constant in that case. */
610 if (TREE_CODE (type
) == FUNCTION_TYPE
&& TYPE_RETURNS_STACK_DEPRESSED (type
))
612 flags
|= ECF_SP_DEPRESSED
;
613 flags
&= ~(ECF_PURE
| ECF_CONST
| ECF_LIBCALL_BLOCK
);
619 /* Detect flags from a CALL_EXPR. */
622 call_expr_flags (tree t
)
625 tree decl
= get_callee_fndecl (t
);
628 flags
= flags_from_decl_or_type (decl
);
631 t
= TREE_TYPE (TREE_OPERAND (t
, 0));
632 if (t
&& TREE_CODE (t
) == POINTER_TYPE
)
633 flags
= flags_from_decl_or_type (TREE_TYPE (t
));
641 /* Precompute all register parameters as described by ARGS, storing values
642 into fields within the ARGS array.
644 NUM_ACTUALS indicates the total number elements in the ARGS array.
646 Set REG_PARM_SEEN if we encounter a register parameter. */
649 precompute_register_parameters (int num_actuals
, struct arg_data
*args
,
656 for (i
= 0; i
< num_actuals
; i
++)
657 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
)
661 if (args
[i
].value
== 0)
664 args
[i
].value
= expand_expr (args
[i
].tree_value
, NULL_RTX
,
666 preserve_temp_slots (args
[i
].value
);
670 /* If the value is a non-legitimate constant, force it into a
671 pseudo now. TLS symbols sometimes need a call to resolve. */
672 if (CONSTANT_P (args
[i
].value
)
673 && !LEGITIMATE_CONSTANT_P (args
[i
].value
))
674 args
[i
].value
= force_reg (args
[i
].mode
, args
[i
].value
);
676 /* If we are to promote the function arg to a wider mode,
679 if (args
[i
].mode
!= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)))
681 = convert_modes (args
[i
].mode
,
682 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
683 args
[i
].value
, args
[i
].unsignedp
);
685 /* If we're going to have to load the value by parts, pull the
686 parts into pseudos. The part extraction process can involve
687 non-trivial computation. */
688 if (GET_CODE (args
[i
].reg
) == PARALLEL
)
690 tree type
= TREE_TYPE (args
[i
].tree_value
);
691 args
[i
].parallel_value
692 = emit_group_load_into_temps (args
[i
].reg
, args
[i
].value
,
693 type
, int_size_in_bytes (type
));
696 /* If the value is expensive, and we are inside an appropriately
697 short loop, put the value into a pseudo and then put the pseudo
700 For small register classes, also do this if this call uses
701 register parameters. This is to avoid reload conflicts while
702 loading the parameters registers. */
704 else if ((! (REG_P (args
[i
].value
)
705 || (GET_CODE (args
[i
].value
) == SUBREG
706 && REG_P (SUBREG_REG (args
[i
].value
)))))
707 && args
[i
].mode
!= BLKmode
708 && rtx_cost (args
[i
].value
, SET
) > COSTS_N_INSNS (1)
709 && ((SMALL_REGISTER_CLASSES
&& *reg_parm_seen
)
711 args
[i
].value
= copy_to_mode_reg (args
[i
].mode
, args
[i
].value
);
715 #ifdef REG_PARM_STACK_SPACE
717 /* The argument list is the property of the called routine and it
718 may clobber it. If the fixed area has been used for previous
719 parameters, we must save and restore it. */
722 save_fixed_argument_area (int reg_parm_stack_space
, rtx argblock
, int *low_to_save
, int *high_to_save
)
727 /* Compute the boundary of the area that needs to be saved, if any. */
728 high
= reg_parm_stack_space
;
729 #ifdef ARGS_GROW_DOWNWARD
732 if (high
> highest_outgoing_arg_in_use
)
733 high
= highest_outgoing_arg_in_use
;
735 for (low
= 0; low
< high
; low
++)
736 if (stack_usage_map
[low
] != 0)
739 enum machine_mode save_mode
;
744 while (stack_usage_map
[--high
] == 0)
748 *high_to_save
= high
;
750 num_to_save
= high
- low
+ 1;
751 save_mode
= mode_for_size (num_to_save
* BITS_PER_UNIT
, MODE_INT
, 1);
753 /* If we don't have the required alignment, must do this
755 if ((low
& (MIN (GET_MODE_SIZE (save_mode
),
756 BIGGEST_ALIGNMENT
/ UNITS_PER_WORD
) - 1)))
759 #ifdef ARGS_GROW_DOWNWARD
764 stack_area
= gen_rtx_MEM (save_mode
,
765 memory_address (save_mode
,
766 plus_constant (argblock
,
769 set_mem_align (stack_area
, PARM_BOUNDARY
);
770 if (save_mode
== BLKmode
)
772 save_area
= assign_stack_temp (BLKmode
, num_to_save
, 0);
773 emit_block_move (validize_mem (save_area
), stack_area
,
774 GEN_INT (num_to_save
), BLOCK_OP_CALL_PARM
);
778 save_area
= gen_reg_rtx (save_mode
);
779 emit_move_insn (save_area
, stack_area
);
789 restore_fixed_argument_area (rtx save_area
, rtx argblock
, int high_to_save
, int low_to_save
)
791 enum machine_mode save_mode
= GET_MODE (save_area
);
795 #ifdef ARGS_GROW_DOWNWARD
796 delta
= -high_to_save
;
800 stack_area
= gen_rtx_MEM (save_mode
,
801 memory_address (save_mode
,
802 plus_constant (argblock
, delta
)));
803 set_mem_align (stack_area
, PARM_BOUNDARY
);
805 if (save_mode
!= BLKmode
)
806 emit_move_insn (stack_area
, save_area
);
808 emit_block_move (stack_area
, validize_mem (save_area
),
809 GEN_INT (high_to_save
- low_to_save
+ 1),
812 #endif /* REG_PARM_STACK_SPACE */
814 /* If any elements in ARGS refer to parameters that are to be passed in
815 registers, but not in memory, and whose alignment does not permit a
816 direct copy into registers. Copy the values into a group of pseudos
817 which we will later copy into the appropriate hard registers.
819 Pseudos for each unaligned argument will be stored into the array
820 args[argnum].aligned_regs. The caller is responsible for deallocating
821 the aligned_regs array if it is nonzero. */
824 store_unaligned_arguments_into_pseudos (struct arg_data
*args
, int num_actuals
)
828 for (i
= 0; i
< num_actuals
; i
++)
829 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
830 && args
[i
].mode
== BLKmode
831 && (TYPE_ALIGN (TREE_TYPE (args
[i
].tree_value
))
832 < (unsigned int) MIN (BIGGEST_ALIGNMENT
, BITS_PER_WORD
)))
834 int bytes
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
835 int nregs
= (bytes
+ UNITS_PER_WORD
- 1) / UNITS_PER_WORD
;
836 int endian_correction
= 0;
838 args
[i
].n_aligned_regs
= args
[i
].partial
? args
[i
].partial
: nregs
;
839 args
[i
].aligned_regs
= xmalloc (sizeof (rtx
) * args
[i
].n_aligned_regs
);
841 /* Structures smaller than a word are normally aligned to the
842 least significant byte. On a BYTES_BIG_ENDIAN machine,
843 this means we must skip the empty high order bytes when
844 calculating the bit offset. */
845 if (bytes
< UNITS_PER_WORD
846 #ifdef BLOCK_REG_PADDING
847 && (BLOCK_REG_PADDING (args
[i
].mode
,
848 TREE_TYPE (args
[i
].tree_value
), 1)
854 endian_correction
= BITS_PER_WORD
- bytes
* BITS_PER_UNIT
;
856 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
858 rtx reg
= gen_reg_rtx (word_mode
);
859 rtx word
= operand_subword_force (args
[i
].value
, j
, BLKmode
);
860 int bitsize
= MIN (bytes
* BITS_PER_UNIT
, BITS_PER_WORD
);
862 args
[i
].aligned_regs
[j
] = reg
;
863 word
= extract_bit_field (word
, bitsize
, 0, 1, NULL_RTX
,
864 word_mode
, word_mode
);
866 /* There is no need to restrict this code to loading items
867 in TYPE_ALIGN sized hunks. The bitfield instructions can
868 load up entire word sized registers efficiently.
870 ??? This may not be needed anymore.
871 We use to emit a clobber here but that doesn't let later
872 passes optimize the instructions we emit. By storing 0 into
873 the register later passes know the first AND to zero out the
874 bitfield being set in the register is unnecessary. The store
875 of 0 will be deleted as will at least the first AND. */
877 emit_move_insn (reg
, const0_rtx
);
879 bytes
-= bitsize
/ BITS_PER_UNIT
;
880 store_bit_field (reg
, bitsize
, endian_correction
, word_mode
,
886 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
889 NUM_ACTUALS is the total number of parameters.
891 N_NAMED_ARGS is the total number of named arguments.
893 FNDECL is the tree code for the target of this call (if known)
895 ARGS_SO_FAR holds state needed by the target to know where to place
898 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
899 for arguments which are passed in registers.
901 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
902 and may be modified by this routine.
904 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
905 flags which may may be modified by this routine.
907 MAY_TAILCALL is cleared if we encounter an invisible pass-by-reference
908 that requires allocation of stack space.
910 CALL_FROM_THUNK_P is true if this call is the jump from a thunk to
911 the thunked-to function. */
914 initialize_argument_information (int num_actuals ATTRIBUTE_UNUSED
,
915 struct arg_data
*args
,
916 struct args_size
*args_size
,
917 int n_named_args ATTRIBUTE_UNUSED
,
918 tree actparms
, tree fndecl
,
919 CUMULATIVE_ARGS
*args_so_far
,
920 int reg_parm_stack_space
,
921 rtx
*old_stack_level
, int *old_pending_adj
,
922 int *must_preallocate
, int *ecf_flags
,
923 bool *may_tailcall
, bool call_from_thunk_p
)
925 /* 1 if scanning parms front to back, -1 if scanning back to front. */
928 /* Count arg position in order args appear. */
934 args_size
->constant
= 0;
937 /* In this loop, we consider args in the order they are written.
938 We fill up ARGS from the front or from the back if necessary
939 so that in any case the first arg to be pushed ends up at the front. */
941 if (PUSH_ARGS_REVERSED
)
943 i
= num_actuals
- 1, inc
= -1;
944 /* In this case, must reverse order of args
945 so that we compute and push the last arg first. */
952 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
953 for (p
= actparms
, argpos
= 0; p
; p
= TREE_CHAIN (p
), i
+= inc
, argpos
++)
955 tree type
= TREE_TYPE (TREE_VALUE (p
));
957 enum machine_mode mode
;
959 args
[i
].tree_value
= TREE_VALUE (p
);
961 /* Replace erroneous argument with constant zero. */
962 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
963 args
[i
].tree_value
= integer_zero_node
, type
= integer_type_node
;
965 /* If TYPE is a transparent union, pass things the way we would
966 pass the first field of the union. We have already verified that
967 the modes are the same. */
968 if (TREE_CODE (type
) == UNION_TYPE
&& TYPE_TRANSPARENT_UNION (type
))
969 type
= TREE_TYPE (TYPE_FIELDS (type
));
971 /* Decide where to pass this arg.
973 args[i].reg is nonzero if all or part is passed in registers.
975 args[i].partial is nonzero if part but not all is passed in registers,
976 and the exact value says how many words are passed in registers.
978 args[i].pass_on_stack is nonzero if the argument must at least be
979 computed on the stack. It may then be loaded back into registers
980 if args[i].reg is nonzero.
982 These decisions are driven by the FUNCTION_... macros and must agree
983 with those made by function.c. */
985 /* See if this argument should be passed by invisible reference. */
986 if (pass_by_reference (args_so_far
, TYPE_MODE (type
),
987 type
, argpos
< n_named_args
))
993 = reference_callee_copied (args_so_far
, TYPE_MODE (type
),
994 type
, argpos
< n_named_args
);
996 /* If we're compiling a thunk, pass through invisible references
997 instead of making a copy. */
998 if (call_from_thunk_p
1000 && !TREE_ADDRESSABLE (type
)
1001 && (base
= get_base_address (args
[i
].tree_value
))
1002 && (!DECL_P (base
) || MEM_P (DECL_RTL (base
)))))
1004 /* We can't use sibcalls if a callee-copied argument is
1005 stored in the current function's frame. */
1006 if (!call_from_thunk_p
&& DECL_P (base
) && !TREE_STATIC (base
))
1007 *may_tailcall
= false;
1009 args
[i
].tree_value
= build_fold_addr_expr (args
[i
].tree_value
);
1010 type
= TREE_TYPE (args
[i
].tree_value
);
1012 *ecf_flags
&= ~(ECF_CONST
| ECF_LIBCALL_BLOCK
);
1016 /* We make a copy of the object and pass the address to the
1017 function being called. */
1020 if (!COMPLETE_TYPE_P (type
)
1021 || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
1022 || (flag_stack_check
&& ! STACK_CHECK_BUILTIN
1023 && (0 < compare_tree_int (TYPE_SIZE_UNIT (type
),
1024 STACK_CHECK_MAX_VAR_SIZE
))))
1026 /* This is a variable-sized object. Make space on the stack
1028 rtx size_rtx
= expr_size (TREE_VALUE (p
));
1030 if (*old_stack_level
== 0)
1032 emit_stack_save (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
1033 *old_pending_adj
= pending_stack_adjust
;
1034 pending_stack_adjust
= 0;
1037 copy
= gen_rtx_MEM (BLKmode
,
1038 allocate_dynamic_stack_space
1039 (size_rtx
, NULL_RTX
, TYPE_ALIGN (type
)));
1040 set_mem_attributes (copy
, type
, 1);
1043 copy
= assign_temp (type
, 0, 1, 0);
1045 store_expr (args
[i
].tree_value
, copy
, 0);
1048 *ecf_flags
&= ~(ECF_CONST
| ECF_LIBCALL_BLOCK
);
1050 *ecf_flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LIBCALL_BLOCK
);
1053 = build_fold_addr_expr (make_tree (type
, copy
));
1054 type
= TREE_TYPE (args
[i
].tree_value
);
1055 *may_tailcall
= false;
1059 mode
= TYPE_MODE (type
);
1060 unsignedp
= TYPE_UNSIGNED (type
);
1062 if (targetm
.calls
.promote_function_args (fndecl
? TREE_TYPE (fndecl
) : 0))
1063 mode
= promote_mode (type
, mode
, &unsignedp
, 1);
1065 args
[i
].unsignedp
= unsignedp
;
1066 args
[i
].mode
= mode
;
1068 args
[i
].reg
= FUNCTION_ARG (*args_so_far
, mode
, type
,
1069 argpos
< n_named_args
);
1070 #ifdef FUNCTION_INCOMING_ARG
1071 /* If this is a sibling call and the machine has register windows, the
1072 register window has to be unwinded before calling the routine, so
1073 arguments have to go into the incoming registers. */
1074 args
[i
].tail_call_reg
= FUNCTION_INCOMING_ARG (*args_so_far
, mode
, type
,
1075 argpos
< n_named_args
);
1077 args
[i
].tail_call_reg
= args
[i
].reg
;
1082 = FUNCTION_ARG_PARTIAL_NREGS (*args_so_far
, mode
, type
,
1083 argpos
< n_named_args
);
1085 args
[i
].pass_on_stack
= targetm
.calls
.must_pass_in_stack (mode
, type
);
1087 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1088 it means that we are to pass this arg in the register(s) designated
1089 by the PARALLEL, but also to pass it in the stack. */
1090 if (args
[i
].reg
&& GET_CODE (args
[i
].reg
) == PARALLEL
1091 && XEXP (XVECEXP (args
[i
].reg
, 0, 0), 0) == 0)
1092 args
[i
].pass_on_stack
= 1;
1094 /* If this is an addressable type, we must preallocate the stack
1095 since we must evaluate the object into its final location.
1097 If this is to be passed in both registers and the stack, it is simpler
1099 if (TREE_ADDRESSABLE (type
)
1100 || (args
[i
].pass_on_stack
&& args
[i
].reg
!= 0))
1101 *must_preallocate
= 1;
1103 /* If this is an addressable type, we cannot pre-evaluate it. Thus,
1104 we cannot consider this function call constant. */
1105 if (TREE_ADDRESSABLE (type
))
1106 *ecf_flags
&= ~ECF_LIBCALL_BLOCK
;
1108 /* Compute the stack-size of this argument. */
1109 if (args
[i
].reg
== 0 || args
[i
].partial
!= 0
1110 || reg_parm_stack_space
> 0
1111 || args
[i
].pass_on_stack
)
1112 locate_and_pad_parm (mode
, type
,
1113 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1118 args
[i
].pass_on_stack
? 0 : args
[i
].partial
,
1119 fndecl
, args_size
, &args
[i
].locate
);
1120 #ifdef BLOCK_REG_PADDING
1122 /* The argument is passed entirely in registers. See at which
1123 end it should be padded. */
1124 args
[i
].locate
.where_pad
=
1125 BLOCK_REG_PADDING (mode
, type
,
1126 int_size_in_bytes (type
) <= UNITS_PER_WORD
);
1129 /* Update ARGS_SIZE, the total stack space for args so far. */
1131 args_size
->constant
+= args
[i
].locate
.size
.constant
;
1132 if (args
[i
].locate
.size
.var
)
1133 ADD_PARM_SIZE (*args_size
, args
[i
].locate
.size
.var
);
1135 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1136 have been used, etc. */
1138 FUNCTION_ARG_ADVANCE (*args_so_far
, TYPE_MODE (type
), type
,
1139 argpos
< n_named_args
);
1143 /* Update ARGS_SIZE to contain the total size for the argument block.
1144 Return the original constant component of the argument block's size.
1146 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
1147 for arguments passed in registers. */
1150 compute_argument_block_size (int reg_parm_stack_space
,
1151 struct args_size
*args_size
,
1152 int preferred_stack_boundary ATTRIBUTE_UNUSED
)
1154 int unadjusted_args_size
= args_size
->constant
;
1156 /* For accumulate outgoing args mode we don't need to align, since the frame
1157 will be already aligned. Align to STACK_BOUNDARY in order to prevent
1158 backends from generating misaligned frame sizes. */
1159 if (ACCUMULATE_OUTGOING_ARGS
&& preferred_stack_boundary
> STACK_BOUNDARY
)
1160 preferred_stack_boundary
= STACK_BOUNDARY
;
1162 /* Compute the actual size of the argument block required. The variable
1163 and constant sizes must be combined, the size may have to be rounded,
1164 and there may be a minimum required size. */
1168 args_size
->var
= ARGS_SIZE_TREE (*args_size
);
1169 args_size
->constant
= 0;
1171 preferred_stack_boundary
/= BITS_PER_UNIT
;
1172 if (preferred_stack_boundary
> 1)
1174 /* We don't handle this case yet. To handle it correctly we have
1175 to add the delta, round and subtract the delta.
1176 Currently no machine description requires this support. */
1177 gcc_assert (!(stack_pointer_delta
& (preferred_stack_boundary
- 1)));
1178 args_size
->var
= round_up (args_size
->var
, preferred_stack_boundary
);
1181 if (reg_parm_stack_space
> 0)
1184 = size_binop (MAX_EXPR
, args_size
->var
,
1185 ssize_int (reg_parm_stack_space
));
1187 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1188 /* The area corresponding to register parameters is not to count in
1189 the size of the block we need. So make the adjustment. */
1191 = size_binop (MINUS_EXPR
, args_size
->var
,
1192 ssize_int (reg_parm_stack_space
));
1198 preferred_stack_boundary
/= BITS_PER_UNIT
;
1199 if (preferred_stack_boundary
< 1)
1200 preferred_stack_boundary
= 1;
1201 args_size
->constant
= (((args_size
->constant
1202 + stack_pointer_delta
1203 + preferred_stack_boundary
- 1)
1204 / preferred_stack_boundary
1205 * preferred_stack_boundary
)
1206 - stack_pointer_delta
);
1208 args_size
->constant
= MAX (args_size
->constant
,
1209 reg_parm_stack_space
);
1211 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1212 args_size
->constant
-= reg_parm_stack_space
;
1215 return unadjusted_args_size
;
1218 /* Precompute parameters as needed for a function call.
1220 FLAGS is mask of ECF_* constants.
1222 NUM_ACTUALS is the number of arguments.
1224 ARGS is an array containing information for each argument; this
1225 routine fills in the INITIAL_VALUE and VALUE fields for each
1226 precomputed argument. */
1229 precompute_arguments (int flags
, int num_actuals
, struct arg_data
*args
)
1233 /* If this is a libcall, then precompute all arguments so that we do not
1234 get extraneous instructions emitted as part of the libcall sequence. */
1235 if ((flags
& ECF_LIBCALL_BLOCK
) == 0)
1238 for (i
= 0; i
< num_actuals
; i
++)
1240 enum machine_mode mode
;
1242 /* If this is an addressable type, we cannot pre-evaluate it. */
1243 gcc_assert (!TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
)));
1245 args
[i
].initial_value
= args
[i
].value
1246 = expand_expr (args
[i
].tree_value
, NULL_RTX
, VOIDmode
, 0);
1248 mode
= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
));
1249 if (mode
!= args
[i
].mode
)
1252 = convert_modes (args
[i
].mode
, mode
,
1253 args
[i
].value
, args
[i
].unsignedp
);
1254 #if defined(PROMOTE_FUNCTION_MODE) && !defined(PROMOTE_MODE)
1255 /* CSE will replace this only if it contains args[i].value
1256 pseudo, so convert it down to the declared mode using
1258 if (REG_P (args
[i
].value
)
1259 && GET_MODE_CLASS (args
[i
].mode
) == MODE_INT
)
1261 args
[i
].initial_value
1262 = gen_lowpart_SUBREG (mode
, args
[i
].value
);
1263 SUBREG_PROMOTED_VAR_P (args
[i
].initial_value
) = 1;
1264 SUBREG_PROMOTED_UNSIGNED_SET (args
[i
].initial_value
,
1272 /* Given the current state of MUST_PREALLOCATE and information about
1273 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
1274 compute and return the final value for MUST_PREALLOCATE. */
1277 finalize_must_preallocate (int must_preallocate
, int num_actuals
, struct arg_data
*args
, struct args_size
*args_size
)
1279 /* See if we have or want to preallocate stack space.
1281 If we would have to push a partially-in-regs parm
1282 before other stack parms, preallocate stack space instead.
1284 If the size of some parm is not a multiple of the required stack
1285 alignment, we must preallocate.
1287 If the total size of arguments that would otherwise create a copy in
1288 a temporary (such as a CALL) is more than half the total argument list
1289 size, preallocation is faster.
1291 Another reason to preallocate is if we have a machine (like the m88k)
1292 where stack alignment is required to be maintained between every
1293 pair of insns, not just when the call is made. However, we assume here
1294 that such machines either do not have push insns (and hence preallocation
1295 would occur anyway) or the problem is taken care of with
1298 if (! must_preallocate
)
1300 int partial_seen
= 0;
1301 int copy_to_evaluate_size
= 0;
1304 for (i
= 0; i
< num_actuals
&& ! must_preallocate
; i
++)
1306 if (args
[i
].partial
> 0 && ! args
[i
].pass_on_stack
)
1308 else if (partial_seen
&& args
[i
].reg
== 0)
1309 must_preallocate
= 1;
1311 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
1312 && (TREE_CODE (args
[i
].tree_value
) == CALL_EXPR
1313 || TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
1314 || TREE_CODE (args
[i
].tree_value
) == COND_EXPR
1315 || TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
))))
1316 copy_to_evaluate_size
1317 += int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1320 if (copy_to_evaluate_size
* 2 >= args_size
->constant
1321 && args_size
->constant
> 0)
1322 must_preallocate
= 1;
1324 return must_preallocate
;
1327 /* If we preallocated stack space, compute the address of each argument
1328 and store it into the ARGS array.
1330 We need not ensure it is a valid memory address here; it will be
1331 validized when it is used.
1333 ARGBLOCK is an rtx for the address of the outgoing arguments. */
1336 compute_argument_addresses (struct arg_data
*args
, rtx argblock
, int num_actuals
)
1340 rtx arg_reg
= argblock
;
1341 int i
, arg_offset
= 0;
1343 if (GET_CODE (argblock
) == PLUS
)
1344 arg_reg
= XEXP (argblock
, 0), arg_offset
= INTVAL (XEXP (argblock
, 1));
1346 for (i
= 0; i
< num_actuals
; i
++)
1348 rtx offset
= ARGS_SIZE_RTX (args
[i
].locate
.offset
);
1349 rtx slot_offset
= ARGS_SIZE_RTX (args
[i
].locate
.slot_offset
);
1352 /* Skip this parm if it will not be passed on the stack. */
1353 if (! args
[i
].pass_on_stack
&& args
[i
].reg
!= 0)
1356 if (GET_CODE (offset
) == CONST_INT
)
1357 addr
= plus_constant (arg_reg
, INTVAL (offset
));
1359 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, offset
);
1361 addr
= plus_constant (addr
, arg_offset
);
1362 args
[i
].stack
= gen_rtx_MEM (args
[i
].mode
, addr
);
1363 set_mem_align (args
[i
].stack
, PARM_BOUNDARY
);
1364 set_mem_attributes (args
[i
].stack
,
1365 TREE_TYPE (args
[i
].tree_value
), 1);
1367 if (GET_CODE (slot_offset
) == CONST_INT
)
1368 addr
= plus_constant (arg_reg
, INTVAL (slot_offset
));
1370 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, slot_offset
);
1372 addr
= plus_constant (addr
, arg_offset
);
1373 args
[i
].stack_slot
= gen_rtx_MEM (args
[i
].mode
, addr
);
1374 set_mem_align (args
[i
].stack_slot
, PARM_BOUNDARY
);
1375 set_mem_attributes (args
[i
].stack_slot
,
1376 TREE_TYPE (args
[i
].tree_value
), 1);
1378 /* Function incoming arguments may overlap with sibling call
1379 outgoing arguments and we cannot allow reordering of reads
1380 from function arguments with stores to outgoing arguments
1381 of sibling calls. */
1382 set_mem_alias_set (args
[i
].stack
, 0);
1383 set_mem_alias_set (args
[i
].stack_slot
, 0);
1388 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
1389 in a call instruction.
1391 FNDECL is the tree node for the target function. For an indirect call
1392 FNDECL will be NULL_TREE.
1394 ADDR is the operand 0 of CALL_EXPR for this call. */
1397 rtx_for_function_call (tree fndecl
, tree addr
)
1401 /* Get the function to call, in the form of RTL. */
1404 /* If this is the first use of the function, see if we need to
1405 make an external definition for it. */
1406 if (! TREE_USED (fndecl
))
1408 assemble_external (fndecl
);
1409 TREE_USED (fndecl
) = 1;
1412 /* Get a SYMBOL_REF rtx for the function address. */
1413 funexp
= XEXP (DECL_RTL (fndecl
), 0);
1416 /* Generate an rtx (probably a pseudo-register) for the address. */
1419 funexp
= expand_expr (addr
, NULL_RTX
, VOIDmode
, 0);
1420 pop_temp_slots (); /* FUNEXP can't be BLKmode. */
1425 /* Do the register loads required for any wholly-register parms or any
1426 parms which are passed both on the stack and in a register. Their
1427 expressions were already evaluated.
1429 Mark all register-parms as living through the call, putting these USE
1430 insns in the CALL_INSN_FUNCTION_USAGE field.
1432 When IS_SIBCALL, perform the check_sibcall_overlap_argument_overlap
1433 checking, setting *SIBCALL_FAILURE if appropriate. */
1436 load_register_parameters (struct arg_data
*args
, int num_actuals
,
1437 rtx
*call_fusage
, int flags
, int is_sibcall
,
1438 int *sibcall_failure
)
1442 for (i
= 0; i
< num_actuals
; i
++)
1444 rtx reg
= ((flags
& ECF_SIBCALL
)
1445 ? args
[i
].tail_call_reg
: args
[i
].reg
);
1448 int partial
= args
[i
].partial
;
1451 rtx before_arg
= get_last_insn ();
1452 /* Set to non-negative if must move a word at a time, even if just
1453 one word (e.g, partial == 1 && mode == DFmode). Set to -1 if
1454 we just use a normal move insn. This value can be zero if the
1455 argument is a zero size structure with no fields. */
1459 else if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
)
1461 size
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1462 nregs
= (size
+ (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
1465 size
= GET_MODE_SIZE (args
[i
].mode
);
1467 /* Handle calls that pass values in multiple non-contiguous
1468 locations. The Irix 6 ABI has examples of this. */
1470 if (GET_CODE (reg
) == PARALLEL
)
1471 emit_group_move (reg
, args
[i
].parallel_value
);
1473 /* If simple case, just do move. If normal partial, store_one_arg
1474 has already loaded the register for us. In all other cases,
1475 load the register(s) from memory. */
1477 else if (nregs
== -1)
1479 emit_move_insn (reg
, args
[i
].value
);
1480 #ifdef BLOCK_REG_PADDING
1481 /* Handle case where we have a value that needs shifting
1482 up to the msb. eg. a QImode value and we're padding
1483 upward on a BYTES_BIG_ENDIAN machine. */
1484 if (size
< UNITS_PER_WORD
1485 && (args
[i
].locate
.where_pad
1486 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
1489 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
1491 /* Assigning REG here rather than a temp makes CALL_FUSAGE
1492 report the whole reg as used. Strictly speaking, the
1493 call only uses SIZE bytes at the msb end, but it doesn't
1494 seem worth generating rtl to say that. */
1495 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
1496 x
= expand_shift (LSHIFT_EXPR
, word_mode
, reg
,
1497 build_int_cst (NULL_TREE
, shift
),
1500 emit_move_insn (reg
, x
);
1505 /* If we have pre-computed the values to put in the registers in
1506 the case of non-aligned structures, copy them in now. */
1508 else if (args
[i
].n_aligned_regs
!= 0)
1509 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1510 emit_move_insn (gen_rtx_REG (word_mode
, REGNO (reg
) + j
),
1511 args
[i
].aligned_regs
[j
]);
1513 else if (partial
== 0 || args
[i
].pass_on_stack
)
1515 rtx mem
= validize_mem (args
[i
].value
);
1517 /* Handle a BLKmode that needs shifting. */
1518 if (nregs
== 1 && size
< UNITS_PER_WORD
1519 #ifdef BLOCK_REG_PADDING
1520 && args
[i
].locate
.where_pad
== downward
1526 rtx tem
= operand_subword_force (mem
, 0, args
[i
].mode
);
1527 rtx ri
= gen_rtx_REG (word_mode
, REGNO (reg
));
1528 rtx x
= gen_reg_rtx (word_mode
);
1529 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
1530 enum tree_code dir
= BYTES_BIG_ENDIAN
? RSHIFT_EXPR
1533 emit_move_insn (x
, tem
);
1534 x
= expand_shift (dir
, word_mode
, x
,
1535 build_int_cst (NULL_TREE
, shift
),
1538 emit_move_insn (ri
, x
);
1541 move_block_to_reg (REGNO (reg
), mem
, nregs
, args
[i
].mode
);
1544 /* When a parameter is a block, and perhaps in other cases, it is
1545 possible that it did a load from an argument slot that was
1546 already clobbered. */
1548 && check_sibcall_argument_overlap (before_arg
, &args
[i
], 0))
1549 *sibcall_failure
= 1;
1551 /* Handle calls that pass values in multiple non-contiguous
1552 locations. The Irix 6 ABI has examples of this. */
1553 if (GET_CODE (reg
) == PARALLEL
)
1554 use_group_regs (call_fusage
, reg
);
1555 else if (nregs
== -1)
1556 use_reg (call_fusage
, reg
);
1558 use_regs (call_fusage
, REGNO (reg
), nregs
);
1563 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
1564 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
1565 bytes, then we would need to push some additional bytes to pad the
1566 arguments. So, we compute an adjust to the stack pointer for an
1567 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
1568 bytes. Then, when the arguments are pushed the stack will be perfectly
1569 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
1570 be popped after the call. Returns the adjustment. */
1573 combine_pending_stack_adjustment_and_call (int unadjusted_args_size
,
1574 struct args_size
*args_size
,
1575 unsigned int preferred_unit_stack_boundary
)
1577 /* The number of bytes to pop so that the stack will be
1578 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
1579 HOST_WIDE_INT adjustment
;
1580 /* The alignment of the stack after the arguments are pushed, if we
1581 just pushed the arguments without adjust the stack here. */
1582 unsigned HOST_WIDE_INT unadjusted_alignment
;
1584 unadjusted_alignment
1585 = ((stack_pointer_delta
+ unadjusted_args_size
)
1586 % preferred_unit_stack_boundary
);
1588 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
1589 as possible -- leaving just enough left to cancel out the
1590 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
1591 PENDING_STACK_ADJUST is non-negative, and congruent to
1592 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
1594 /* Begin by trying to pop all the bytes. */
1595 unadjusted_alignment
1596 = (unadjusted_alignment
1597 - (pending_stack_adjust
% preferred_unit_stack_boundary
));
1598 adjustment
= pending_stack_adjust
;
1599 /* Push enough additional bytes that the stack will be aligned
1600 after the arguments are pushed. */
1601 if (preferred_unit_stack_boundary
> 1)
1603 if (unadjusted_alignment
> 0)
1604 adjustment
-= preferred_unit_stack_boundary
- unadjusted_alignment
;
1606 adjustment
+= unadjusted_alignment
;
1609 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
1610 bytes after the call. The right number is the entire
1611 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
1612 by the arguments in the first place. */
1614 = pending_stack_adjust
- adjustment
+ unadjusted_args_size
;
1619 /* Scan X expression if it does not dereference any argument slots
1620 we already clobbered by tail call arguments (as noted in stored_args_map
1622 Return nonzero if X expression dereferences such argument slots,
1626 check_sibcall_argument_overlap_1 (rtx x
)
1636 code
= GET_CODE (x
);
1640 if (XEXP (x
, 0) == current_function_internal_arg_pointer
)
1642 else if (GET_CODE (XEXP (x
, 0)) == PLUS
1643 && XEXP (XEXP (x
, 0), 0) ==
1644 current_function_internal_arg_pointer
1645 && GET_CODE (XEXP (XEXP (x
, 0), 1)) == CONST_INT
)
1646 i
= INTVAL (XEXP (XEXP (x
, 0), 1));
1650 #ifdef ARGS_GROW_DOWNWARD
1651 i
= -i
- GET_MODE_SIZE (GET_MODE (x
));
1654 for (k
= 0; k
< GET_MODE_SIZE (GET_MODE (x
)); k
++)
1655 if (i
+ k
< stored_args_map
->n_bits
1656 && TEST_BIT (stored_args_map
, i
+ k
))
1662 /* Scan all subexpressions. */
1663 fmt
= GET_RTX_FORMAT (code
);
1664 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
1668 if (check_sibcall_argument_overlap_1 (XEXP (x
, i
)))
1671 else if (*fmt
== 'E')
1673 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
1674 if (check_sibcall_argument_overlap_1 (XVECEXP (x
, i
, j
)))
1681 /* Scan sequence after INSN if it does not dereference any argument slots
1682 we already clobbered by tail call arguments (as noted in stored_args_map
1683 bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to
1684 stored_args_map bitmap afterwards (when ARG is a register MARK_STORED_ARGS_MAP
1685 should be 0). Return nonzero if sequence after INSN dereferences such argument
1686 slots, zero otherwise. */
1689 check_sibcall_argument_overlap (rtx insn
, struct arg_data
*arg
, int mark_stored_args_map
)
1693 if (insn
== NULL_RTX
)
1694 insn
= get_insns ();
1696 insn
= NEXT_INSN (insn
);
1698 for (; insn
; insn
= NEXT_INSN (insn
))
1700 && check_sibcall_argument_overlap_1 (PATTERN (insn
)))
1703 if (mark_stored_args_map
)
1705 #ifdef ARGS_GROW_DOWNWARD
1706 low
= -arg
->locate
.slot_offset
.constant
- arg
->locate
.size
.constant
;
1708 low
= arg
->locate
.slot_offset
.constant
;
1711 for (high
= low
+ arg
->locate
.size
.constant
; low
< high
; low
++)
1712 SET_BIT (stored_args_map
, low
);
1714 return insn
!= NULL_RTX
;
1717 /* Given that a function returns a value of mode MODE at the most
1718 significant end of hard register VALUE, shift VALUE left or right
1719 as specified by LEFT_P. Return true if some action was needed. */
1722 shift_return_value (enum machine_mode mode
, bool left_p
, rtx value
)
1724 HOST_WIDE_INT shift
;
1726 gcc_assert (REG_P (value
) && HARD_REGISTER_P (value
));
1727 shift
= GET_MODE_BITSIZE (GET_MODE (value
)) - GET_MODE_BITSIZE (mode
);
1731 /* Use ashr rather than lshr for right shifts. This is for the benefit
1732 of the MIPS port, which requires SImode values to be sign-extended
1733 when stored in 64-bit registers. */
1734 if (!force_expand_binop (GET_MODE (value
), left_p
? ashl_optab
: ashr_optab
,
1735 value
, GEN_INT (shift
), value
, 1, OPTAB_WIDEN
))
1740 /* Remove all REG_EQUIV notes found in the insn chain. */
1743 purge_reg_equiv_notes (void)
1747 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
1751 rtx note
= find_reg_note (insn
, REG_EQUIV
, 0);
1754 /* Remove the note and keep looking at the notes for
1756 remove_note (insn
, note
);
1764 /* Generate all the code for a function call
1765 and return an rtx for its value.
1766 Store the value in TARGET (specified as an rtx) if convenient.
1767 If the value is stored in TARGET then TARGET is returned.
1768 If IGNORE is nonzero, then we ignore the value of the function call. */
1771 expand_call (tree exp
, rtx target
, int ignore
)
1773 /* Nonzero if we are currently expanding a call. */
1774 static int currently_expanding_call
= 0;
1776 /* List of actual parameters. */
1777 tree actparms
= TREE_OPERAND (exp
, 1);
1778 /* RTX for the function to be called. */
1780 /* Sequence of insns to perform a normal "call". */
1781 rtx normal_call_insns
= NULL_RTX
;
1782 /* Sequence of insns to perform a tail "call". */
1783 rtx tail_call_insns
= NULL_RTX
;
1784 /* Data type of the function. */
1786 tree type_arg_types
;
1787 /* Declaration of the function being called,
1788 or 0 if the function is computed (not known by name). */
1790 /* The type of the function being called. */
1792 bool try_tail_call
= CALL_EXPR_TAILCALL (exp
);
1795 /* Register in which non-BLKmode value will be returned,
1796 or 0 if no value or if value is BLKmode. */
1798 /* Address where we should return a BLKmode value;
1799 0 if value not BLKmode. */
1800 rtx structure_value_addr
= 0;
1801 /* Nonzero if that address is being passed by treating it as
1802 an extra, implicit first parameter. Otherwise,
1803 it is passed by being copied directly into struct_value_rtx. */
1804 int structure_value_addr_parm
= 0;
1805 /* Size of aggregate value wanted, or zero if none wanted
1806 or if we are using the non-reentrant PCC calling convention
1807 or expecting the value in registers. */
1808 HOST_WIDE_INT struct_value_size
= 0;
1809 /* Nonzero if called function returns an aggregate in memory PCC style,
1810 by returning the address of where to find it. */
1811 int pcc_struct_value
= 0;
1812 rtx struct_value
= 0;
1814 /* Number of actual parameters in this call, including struct value addr. */
1816 /* Number of named args. Args after this are anonymous ones
1817 and they must all go on the stack. */
1820 /* Vector of information about each argument.
1821 Arguments are numbered in the order they will be pushed,
1822 not the order they are written. */
1823 struct arg_data
*args
;
1825 /* Total size in bytes of all the stack-parms scanned so far. */
1826 struct args_size args_size
;
1827 struct args_size adjusted_args_size
;
1828 /* Size of arguments before any adjustments (such as rounding). */
1829 int unadjusted_args_size
;
1830 /* Data on reg parms scanned so far. */
1831 CUMULATIVE_ARGS args_so_far
;
1832 /* Nonzero if a reg parm has been scanned. */
1834 /* Nonzero if this is an indirect function call. */
1836 /* Nonzero if we must avoid push-insns in the args for this call.
1837 If stack space is allocated for register parameters, but not by the
1838 caller, then it is preallocated in the fixed part of the stack frame.
1839 So the entire argument block must then be preallocated (i.e., we
1840 ignore PUSH_ROUNDING in that case). */
1842 int must_preallocate
= !PUSH_ARGS
;
1844 /* Size of the stack reserved for parameter registers. */
1845 int reg_parm_stack_space
= 0;
1847 /* Address of space preallocated for stack parms
1848 (on machines that lack push insns), or 0 if space not preallocated. */
1851 /* Mask of ECF_ flags. */
1853 #ifdef REG_PARM_STACK_SPACE
1854 /* Define the boundary of the register parm stack space that needs to be
1856 int low_to_save
, high_to_save
;
1857 rtx save_area
= 0; /* Place that it is saved */
1860 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
1861 char *initial_stack_usage_map
= stack_usage_map
;
1863 int old_stack_allocated
;
1865 /* State variables to track stack modifications. */
1866 rtx old_stack_level
= 0;
1867 int old_stack_arg_under_construction
= 0;
1868 int old_pending_adj
= 0;
1869 int old_inhibit_defer_pop
= inhibit_defer_pop
;
1871 /* Some stack pointer alterations we make are performed via
1872 allocate_dynamic_stack_space. This modifies the stack_pointer_delta,
1873 which we then also need to save/restore along the way. */
1874 int old_stack_pointer_delta
= 0;
1877 tree p
= TREE_OPERAND (exp
, 0);
1878 tree addr
= TREE_OPERAND (exp
, 0);
1880 /* The alignment of the stack, in bits. */
1881 unsigned HOST_WIDE_INT preferred_stack_boundary
;
1882 /* The alignment of the stack, in bytes. */
1883 unsigned HOST_WIDE_INT preferred_unit_stack_boundary
;
1884 /* The static chain value to use for this call. */
1885 rtx static_chain_value
;
1886 /* See if this is "nothrow" function call. */
1887 if (TREE_NOTHROW (exp
))
1888 flags
|= ECF_NOTHROW
;
1890 /* See if we can find a DECL-node for the actual function, and get the
1891 function attributes (flags) from the function decl or type node. */
1892 fndecl
= get_callee_fndecl (exp
);
1895 fntype
= TREE_TYPE (fndecl
);
1896 flags
|= flags_from_decl_or_type (fndecl
);
1900 fntype
= TREE_TYPE (TREE_TYPE (p
));
1901 flags
|= flags_from_decl_or_type (fntype
);
1904 struct_value
= targetm
.calls
.struct_value_rtx (fntype
, 0);
1906 /* Warn if this value is an aggregate type,
1907 regardless of which calling convention we are using for it. */
1908 if (warn_aggregate_return
&& AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
1909 warning ("function call has aggregate value");
1911 /* If the result of a pure or const function call is ignored (or void),
1912 and none of its arguments are volatile, we can avoid expanding the
1913 call and just evaluate the arguments for side-effects. */
1914 if ((flags
& (ECF_CONST
| ECF_PURE
))
1915 && (ignore
|| target
== const0_rtx
1916 || TYPE_MODE (TREE_TYPE (exp
)) == VOIDmode
))
1918 bool volatilep
= false;
1921 for (arg
= actparms
; arg
; arg
= TREE_CHAIN (arg
))
1922 if (TREE_THIS_VOLATILE (TREE_VALUE (arg
)))
1930 for (arg
= actparms
; arg
; arg
= TREE_CHAIN (arg
))
1931 expand_expr (TREE_VALUE (arg
), const0_rtx
,
1932 VOIDmode
, EXPAND_NORMAL
);
1937 #ifdef REG_PARM_STACK_SPACE
1938 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
1941 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1942 if (reg_parm_stack_space
> 0 && PUSH_ARGS
)
1943 must_preallocate
= 1;
1946 /* Set up a place to return a structure. */
1948 /* Cater to broken compilers. */
1949 if (aggregate_value_p (exp
, fndecl
))
1951 /* This call returns a big structure. */
1952 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LIBCALL_BLOCK
);
1954 #ifdef PCC_STATIC_STRUCT_RETURN
1956 pcc_struct_value
= 1;
1958 #else /* not PCC_STATIC_STRUCT_RETURN */
1960 struct_value_size
= int_size_in_bytes (TREE_TYPE (exp
));
1962 if (CALL_EXPR_HAS_RETURN_SLOT_ADDR (exp
))
1964 /* The structure value address arg is already in actparms.
1965 Pull it out. It might be nice to just leave it there, but
1966 we need to set structure_value_addr. */
1967 tree return_arg
= TREE_VALUE (actparms
);
1968 actparms
= TREE_CHAIN (actparms
);
1969 structure_value_addr
= expand_expr (return_arg
, NULL_RTX
,
1970 VOIDmode
, EXPAND_NORMAL
);
1972 else if (target
&& MEM_P (target
))
1973 structure_value_addr
= XEXP (target
, 0);
1976 /* For variable-sized objects, we must be called with a target
1977 specified. If we were to allocate space on the stack here,
1978 we would have no way of knowing when to free it. */
1979 rtx d
= assign_temp (TREE_TYPE (exp
), 1, 1, 1);
1981 mark_temp_addr_taken (d
);
1982 structure_value_addr
= XEXP (d
, 0);
1986 #endif /* not PCC_STATIC_STRUCT_RETURN */
1989 /* Figure out the amount to which the stack should be aligned. */
1990 preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
1993 struct cgraph_rtl_info
*i
= cgraph_rtl_info (fndecl
);
1994 if (i
&& i
->preferred_incoming_stack_boundary
)
1995 preferred_stack_boundary
= i
->preferred_incoming_stack_boundary
;
1998 /* Operand 0 is a pointer-to-function; get the type of the function. */
1999 funtype
= TREE_TYPE (addr
);
2000 gcc_assert (POINTER_TYPE_P (funtype
));
2001 funtype
= TREE_TYPE (funtype
);
2003 /* Munge the tree to split complex arguments into their imaginary
2005 if (targetm
.calls
.split_complex_arg
)
2007 type_arg_types
= split_complex_types (TYPE_ARG_TYPES (funtype
));
2008 actparms
= split_complex_values (actparms
);
2011 type_arg_types
= TYPE_ARG_TYPES (funtype
);
2013 if (flags
& ECF_MAY_BE_ALLOCA
)
2014 current_function_calls_alloca
= 1;
2016 /* If struct_value_rtx is 0, it means pass the address
2017 as if it were an extra parameter. */
2018 if (structure_value_addr
&& struct_value
== 0)
2020 /* If structure_value_addr is a REG other than
2021 virtual_outgoing_args_rtx, we can use always use it. If it
2022 is not a REG, we must always copy it into a register.
2023 If it is virtual_outgoing_args_rtx, we must copy it to another
2024 register in some cases. */
2025 rtx temp
= (!REG_P (structure_value_addr
)
2026 || (ACCUMULATE_OUTGOING_ARGS
2027 && stack_arg_under_construction
2028 && structure_value_addr
== virtual_outgoing_args_rtx
)
2029 ? copy_addr_to_reg (convert_memory_address
2030 (Pmode
, structure_value_addr
))
2031 : structure_value_addr
);
2034 = tree_cons (error_mark_node
,
2035 make_tree (build_pointer_type (TREE_TYPE (funtype
)),
2038 structure_value_addr_parm
= 1;
2041 /* Count the arguments and set NUM_ACTUALS. */
2042 for (p
= actparms
, num_actuals
= 0; p
; p
= TREE_CHAIN (p
))
2045 /* Compute number of named args.
2046 First, do a raw count of the args for INIT_CUMULATIVE_ARGS. */
2048 if (type_arg_types
!= 0)
2050 = (list_length (type_arg_types
)
2051 /* Count the struct value address, if it is passed as a parm. */
2052 + structure_value_addr_parm
);
2054 /* If we know nothing, treat all args as named. */
2055 n_named_args
= num_actuals
;
2057 /* Start updating where the next arg would go.
2059 On some machines (such as the PA) indirect calls have a different
2060 calling convention than normal calls. The fourth argument in
2061 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
2063 INIT_CUMULATIVE_ARGS (args_so_far
, funtype
, NULL_RTX
, fndecl
, n_named_args
);
2065 /* Now possibly adjust the number of named args.
2066 Normally, don't include the last named arg if anonymous args follow.
2067 We do include the last named arg if
2068 targetm.calls.strict_argument_naming() returns nonzero.
2069 (If no anonymous args follow, the result of list_length is actually
2070 one too large. This is harmless.)
2072 If targetm.calls.pretend_outgoing_varargs_named() returns
2073 nonzero, and targetm.calls.strict_argument_naming() returns zero,
2074 this machine will be able to place unnamed args that were passed
2075 in registers into the stack. So treat all args as named. This
2076 allows the insns emitting for a specific argument list to be
2077 independent of the function declaration.
2079 If targetm.calls.pretend_outgoing_varargs_named() returns zero,
2080 we do not have any reliable way to pass unnamed args in
2081 registers, so we must force them into memory. */
2083 if (type_arg_types
!= 0
2084 && targetm
.calls
.strict_argument_naming (&args_so_far
))
2086 else if (type_arg_types
!= 0
2087 && ! targetm
.calls
.pretend_outgoing_varargs_named (&args_so_far
))
2088 /* Don't include the last named arg. */
2091 /* Treat all args as named. */
2092 n_named_args
= num_actuals
;
2094 /* Make a vector to hold all the information about each arg. */
2095 args
= alloca (num_actuals
* sizeof (struct arg_data
));
2096 memset (args
, 0, num_actuals
* sizeof (struct arg_data
));
2098 /* Build up entries in the ARGS array, compute the size of the
2099 arguments into ARGS_SIZE, etc. */
2100 initialize_argument_information (num_actuals
, args
, &args_size
,
2101 n_named_args
, actparms
, fndecl
,
2102 &args_so_far
, reg_parm_stack_space
,
2103 &old_stack_level
, &old_pending_adj
,
2104 &must_preallocate
, &flags
,
2105 &try_tail_call
, CALL_FROM_THUNK_P (exp
));
2109 /* If this function requires a variable-sized argument list, don't
2110 try to make a cse'able block for this call. We may be able to
2111 do this eventually, but it is too complicated to keep track of
2112 what insns go in the cse'able block and which don't. */
2114 flags
&= ~ECF_LIBCALL_BLOCK
;
2115 must_preallocate
= 1;
2118 /* Now make final decision about preallocating stack space. */
2119 must_preallocate
= finalize_must_preallocate (must_preallocate
,
2123 /* If the structure value address will reference the stack pointer, we
2124 must stabilize it. We don't need to do this if we know that we are
2125 not going to adjust the stack pointer in processing this call. */
2127 if (structure_value_addr
2128 && (reg_mentioned_p (virtual_stack_dynamic_rtx
, structure_value_addr
)
2129 || reg_mentioned_p (virtual_outgoing_args_rtx
,
2130 structure_value_addr
))
2132 || (!ACCUMULATE_OUTGOING_ARGS
&& args_size
.constant
)))
2133 structure_value_addr
= copy_to_reg (structure_value_addr
);
2135 /* Tail calls can make things harder to debug, and we've traditionally
2136 pushed these optimizations into -O2. Don't try if we're already
2137 expanding a call, as that means we're an argument. Don't try if
2138 there's cleanups, as we know there's code to follow the call. */
2140 if (currently_expanding_call
++ != 0
2141 || !flag_optimize_sibling_calls
2143 || lookup_stmt_eh_region (exp
) >= 0)
2146 /* Rest of purposes for tail call optimizations to fail. */
2148 #ifdef HAVE_sibcall_epilogue
2149 !HAVE_sibcall_epilogue
2154 /* Doing sibling call optimization needs some work, since
2155 structure_value_addr can be allocated on the stack.
2156 It does not seem worth the effort since few optimizable
2157 sibling calls will return a structure. */
2158 || structure_value_addr
!= NULL_RTX
2159 /* Check whether the target is able to optimize the call
2161 || !targetm
.function_ok_for_sibcall (fndecl
, exp
)
2162 /* Functions that do not return exactly once may not be sibcall
2164 || (flags
& (ECF_RETURNS_TWICE
| ECF_NORETURN
))
2165 || TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (addr
)))
2166 /* If the called function is nested in the current one, it might access
2167 some of the caller's arguments, but could clobber them beforehand if
2168 the argument areas are shared. */
2169 || (fndecl
&& decl_function_context (fndecl
) == current_function_decl
)
2170 /* If this function requires more stack slots than the current
2171 function, we cannot change it into a sibling call. */
2172 || args_size
.constant
> current_function_args_size
2173 /* If the callee pops its own arguments, then it must pop exactly
2174 the same number of arguments as the current function. */
2175 || (RETURN_POPS_ARGS (fndecl
, funtype
, args_size
.constant
)
2176 != RETURN_POPS_ARGS (current_function_decl
,
2177 TREE_TYPE (current_function_decl
),
2178 current_function_args_size
))
2179 || !lang_hooks
.decls
.ok_for_sibcall (fndecl
))
2182 /* Ensure current function's preferred stack boundary is at least
2183 what we need. We don't have to increase alignment for recursive
2185 if (cfun
->preferred_stack_boundary
< preferred_stack_boundary
2186 && fndecl
!= current_function_decl
)
2187 cfun
->preferred_stack_boundary
= preferred_stack_boundary
;
2188 if (fndecl
== current_function_decl
)
2189 cfun
->recursive_call_emit
= true;
2191 preferred_unit_stack_boundary
= preferred_stack_boundary
/ BITS_PER_UNIT
;
2193 /* We want to make two insn chains; one for a sibling call, the other
2194 for a normal call. We will select one of the two chains after
2195 initial RTL generation is complete. */
2196 for (pass
= try_tail_call
? 0 : 1; pass
< 2; pass
++)
2198 int sibcall_failure
= 0;
2199 /* We want to emit any pending stack adjustments before the tail
2200 recursion "call". That way we know any adjustment after the tail
2201 recursion call can be ignored if we indeed use the tail
2203 int save_pending_stack_adjust
= 0;
2204 int save_stack_pointer_delta
= 0;
2206 rtx before_call
, next_arg_reg
;
2210 /* State variables we need to save and restore between
2212 save_pending_stack_adjust
= pending_stack_adjust
;
2213 save_stack_pointer_delta
= stack_pointer_delta
;
2216 flags
&= ~ECF_SIBCALL
;
2218 flags
|= ECF_SIBCALL
;
2220 /* Other state variables that we must reinitialize each time
2221 through the loop (that are not initialized by the loop itself). */
2225 /* Start a new sequence for the normal call case.
2227 From this point on, if the sibling call fails, we want to set
2228 sibcall_failure instead of continuing the loop. */
2231 /* Don't let pending stack adjusts add up to too much.
2232 Also, do all pending adjustments now if there is any chance
2233 this might be a call to alloca or if we are expanding a sibling
2234 call sequence or if we are calling a function that is to return
2235 with stack pointer depressed. */
2236 if (pending_stack_adjust
>= 32
2237 || (pending_stack_adjust
> 0
2238 && (flags
& (ECF_MAY_BE_ALLOCA
| ECF_SP_DEPRESSED
)))
2240 do_pending_stack_adjust ();
2242 /* When calling a const function, we must pop the stack args right away,
2243 so that the pop is deleted or moved with the call. */
2244 if (pass
&& (flags
& ECF_LIBCALL_BLOCK
))
2247 /* Precompute any arguments as needed. */
2249 precompute_arguments (flags
, num_actuals
, args
);
2251 /* Now we are about to start emitting insns that can be deleted
2252 if a libcall is deleted. */
2253 if (pass
&& (flags
& (ECF_LIBCALL_BLOCK
| ECF_MALLOC
)))
2256 adjusted_args_size
= args_size
;
2257 /* Compute the actual size of the argument block required. The variable
2258 and constant sizes must be combined, the size may have to be rounded,
2259 and there may be a minimum required size. When generating a sibcall
2260 pattern, do not round up, since we'll be re-using whatever space our
2262 unadjusted_args_size
2263 = compute_argument_block_size (reg_parm_stack_space
,
2264 &adjusted_args_size
,
2266 : preferred_stack_boundary
));
2268 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
2270 /* The argument block when performing a sibling call is the
2271 incoming argument block. */
2274 argblock
= virtual_incoming_args_rtx
;
2276 #ifdef STACK_GROWS_DOWNWARD
2277 = plus_constant (argblock
, current_function_pretend_args_size
);
2279 = plus_constant (argblock
, -current_function_pretend_args_size
);
2281 stored_args_map
= sbitmap_alloc (args_size
.constant
);
2282 sbitmap_zero (stored_args_map
);
2285 /* If we have no actual push instructions, or shouldn't use them,
2286 make space for all args right now. */
2287 else if (adjusted_args_size
.var
!= 0)
2289 if (old_stack_level
== 0)
2291 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
2292 old_stack_pointer_delta
= stack_pointer_delta
;
2293 old_pending_adj
= pending_stack_adjust
;
2294 pending_stack_adjust
= 0;
2295 /* stack_arg_under_construction says whether a stack arg is
2296 being constructed at the old stack level. Pushing the stack
2297 gets a clean outgoing argument block. */
2298 old_stack_arg_under_construction
= stack_arg_under_construction
;
2299 stack_arg_under_construction
= 0;
2301 argblock
= push_block (ARGS_SIZE_RTX (adjusted_args_size
), 0, 0);
2305 /* Note that we must go through the motions of allocating an argument
2306 block even if the size is zero because we may be storing args
2307 in the area reserved for register arguments, which may be part of
2310 int needed
= adjusted_args_size
.constant
;
2312 /* Store the maximum argument space used. It will be pushed by
2313 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
2316 if (needed
> current_function_outgoing_args_size
)
2317 current_function_outgoing_args_size
= needed
;
2319 if (must_preallocate
)
2321 if (ACCUMULATE_OUTGOING_ARGS
)
2323 /* Since the stack pointer will never be pushed, it is
2324 possible for the evaluation of a parm to clobber
2325 something we have already written to the stack.
2326 Since most function calls on RISC machines do not use
2327 the stack, this is uncommon, but must work correctly.
2329 Therefore, we save any area of the stack that was already
2330 written and that we are using. Here we set up to do this
2331 by making a new stack usage map from the old one. The
2332 actual save will be done by store_one_arg.
2334 Another approach might be to try to reorder the argument
2335 evaluations to avoid this conflicting stack usage. */
2337 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2338 /* Since we will be writing into the entire argument area,
2339 the map must be allocated for its entire size, not just
2340 the part that is the responsibility of the caller. */
2341 needed
+= reg_parm_stack_space
;
2344 #ifdef ARGS_GROW_DOWNWARD
2345 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
2348 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
2351 stack_usage_map
= alloca (highest_outgoing_arg_in_use
);
2353 if (initial_highest_arg_in_use
)
2354 memcpy (stack_usage_map
, initial_stack_usage_map
,
2355 initial_highest_arg_in_use
);
2357 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
2358 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
2359 (highest_outgoing_arg_in_use
2360 - initial_highest_arg_in_use
));
2363 /* The address of the outgoing argument list must not be
2364 copied to a register here, because argblock would be left
2365 pointing to the wrong place after the call to
2366 allocate_dynamic_stack_space below. */
2368 argblock
= virtual_outgoing_args_rtx
;
2372 if (inhibit_defer_pop
== 0)
2374 /* Try to reuse some or all of the pending_stack_adjust
2375 to get this space. */
2377 = (combine_pending_stack_adjustment_and_call
2378 (unadjusted_args_size
,
2379 &adjusted_args_size
,
2380 preferred_unit_stack_boundary
));
2382 /* combine_pending_stack_adjustment_and_call computes
2383 an adjustment before the arguments are allocated.
2384 Account for them and see whether or not the stack
2385 needs to go up or down. */
2386 needed
= unadjusted_args_size
- needed
;
2390 /* We're releasing stack space. */
2391 /* ??? We can avoid any adjustment at all if we're
2392 already aligned. FIXME. */
2393 pending_stack_adjust
= -needed
;
2394 do_pending_stack_adjust ();
2398 /* We need to allocate space. We'll do that in
2399 push_block below. */
2400 pending_stack_adjust
= 0;
2403 /* Special case this because overhead of `push_block' in
2404 this case is non-trivial. */
2406 argblock
= virtual_outgoing_args_rtx
;
2409 argblock
= push_block (GEN_INT (needed
), 0, 0);
2410 #ifdef ARGS_GROW_DOWNWARD
2411 argblock
= plus_constant (argblock
, needed
);
2415 /* We only really need to call `copy_to_reg' in the case
2416 where push insns are going to be used to pass ARGBLOCK
2417 to a function call in ARGS. In that case, the stack
2418 pointer changes value from the allocation point to the
2419 call point, and hence the value of
2420 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
2421 as well always do it. */
2422 argblock
= copy_to_reg (argblock
);
2427 if (ACCUMULATE_OUTGOING_ARGS
)
2429 /* The save/restore code in store_one_arg handles all
2430 cases except one: a constructor call (including a C
2431 function returning a BLKmode struct) to initialize
2433 if (stack_arg_under_construction
)
2435 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2436 rtx push_size
= GEN_INT (reg_parm_stack_space
2437 + adjusted_args_size
.constant
);
2439 rtx push_size
= GEN_INT (adjusted_args_size
.constant
);
2441 if (old_stack_level
== 0)
2443 emit_stack_save (SAVE_BLOCK
, &old_stack_level
,
2445 old_stack_pointer_delta
= stack_pointer_delta
;
2446 old_pending_adj
= pending_stack_adjust
;
2447 pending_stack_adjust
= 0;
2448 /* stack_arg_under_construction says whether a stack
2449 arg is being constructed at the old stack level.
2450 Pushing the stack gets a clean outgoing argument
2452 old_stack_arg_under_construction
2453 = stack_arg_under_construction
;
2454 stack_arg_under_construction
= 0;
2455 /* Make a new map for the new argument list. */
2456 stack_usage_map
= alloca (highest_outgoing_arg_in_use
);
2457 memset (stack_usage_map
, 0, highest_outgoing_arg_in_use
);
2458 highest_outgoing_arg_in_use
= 0;
2460 allocate_dynamic_stack_space (push_size
, NULL_RTX
,
2464 /* If argument evaluation might modify the stack pointer,
2465 copy the address of the argument list to a register. */
2466 for (i
= 0; i
< num_actuals
; i
++)
2467 if (args
[i
].pass_on_stack
)
2469 argblock
= copy_addr_to_reg (argblock
);
2474 compute_argument_addresses (args
, argblock
, num_actuals
);
2476 /* If we push args individually in reverse order, perform stack alignment
2477 before the first push (the last arg). */
2478 if (PUSH_ARGS_REVERSED
&& argblock
== 0
2479 && adjusted_args_size
.constant
!= unadjusted_args_size
)
2481 /* When the stack adjustment is pending, we get better code
2482 by combining the adjustments. */
2483 if (pending_stack_adjust
2484 && ! (flags
& ECF_LIBCALL_BLOCK
)
2485 && ! inhibit_defer_pop
)
2487 pending_stack_adjust
2488 = (combine_pending_stack_adjustment_and_call
2489 (unadjusted_args_size
,
2490 &adjusted_args_size
,
2491 preferred_unit_stack_boundary
));
2492 do_pending_stack_adjust ();
2494 else if (argblock
== 0)
2495 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
2496 - unadjusted_args_size
));
2498 /* Now that the stack is properly aligned, pops can't safely
2499 be deferred during the evaluation of the arguments. */
2502 funexp
= rtx_for_function_call (fndecl
, addr
);
2504 /* Figure out the register where the value, if any, will come back. */
2506 if (TYPE_MODE (TREE_TYPE (exp
)) != VOIDmode
2507 && ! structure_value_addr
)
2509 if (pcc_struct_value
)
2510 valreg
= hard_function_value (build_pointer_type (TREE_TYPE (exp
)),
2511 fndecl
, (pass
== 0));
2513 valreg
= hard_function_value (TREE_TYPE (exp
), fndecl
, (pass
== 0));
2516 /* Precompute all register parameters. It isn't safe to compute anything
2517 once we have started filling any specific hard regs. */
2518 precompute_register_parameters (num_actuals
, args
, ®_parm_seen
);
2520 if (TREE_OPERAND (exp
, 2))
2521 static_chain_value
= expand_expr (TREE_OPERAND (exp
, 2),
2522 NULL_RTX
, VOIDmode
, 0);
2524 static_chain_value
= 0;
2526 #ifdef REG_PARM_STACK_SPACE
2527 /* Save the fixed argument area if it's part of the caller's frame and
2528 is clobbered by argument setup for this call. */
2529 if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
2530 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
2531 &low_to_save
, &high_to_save
);
2534 /* Now store (and compute if necessary) all non-register parms.
2535 These come before register parms, since they can require block-moves,
2536 which could clobber the registers used for register parms.
2537 Parms which have partial registers are not stored here,
2538 but we do preallocate space here if they want that. */
2540 for (i
= 0; i
< num_actuals
; i
++)
2541 if (args
[i
].reg
== 0 || args
[i
].pass_on_stack
)
2543 rtx before_arg
= get_last_insn ();
2545 if (store_one_arg (&args
[i
], argblock
, flags
,
2546 adjusted_args_size
.var
!= 0,
2547 reg_parm_stack_space
)
2549 && check_sibcall_argument_overlap (before_arg
,
2551 sibcall_failure
= 1;
2553 if (flags
& ECF_CONST
2555 && args
[i
].value
== args
[i
].stack
)
2556 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
2557 gen_rtx_USE (VOIDmode
,
2562 /* If we have a parm that is passed in registers but not in memory
2563 and whose alignment does not permit a direct copy into registers,
2564 make a group of pseudos that correspond to each register that we
2566 if (STRICT_ALIGNMENT
)
2567 store_unaligned_arguments_into_pseudos (args
, num_actuals
);
2569 /* Now store any partially-in-registers parm.
2570 This is the last place a block-move can happen. */
2572 for (i
= 0; i
< num_actuals
; i
++)
2573 if (args
[i
].partial
!= 0 && ! args
[i
].pass_on_stack
)
2575 rtx before_arg
= get_last_insn ();
2577 if (store_one_arg (&args
[i
], argblock
, flags
,
2578 adjusted_args_size
.var
!= 0,
2579 reg_parm_stack_space
)
2581 && check_sibcall_argument_overlap (before_arg
,
2583 sibcall_failure
= 1;
2586 /* If we pushed args in forward order, perform stack alignment
2587 after pushing the last arg. */
2588 if (!PUSH_ARGS_REVERSED
&& argblock
== 0)
2589 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
2590 - unadjusted_args_size
));
2592 /* If register arguments require space on the stack and stack space
2593 was not preallocated, allocate stack space here for arguments
2594 passed in registers. */
2595 #ifdef OUTGOING_REG_PARM_STACK_SPACE
2596 if (!ACCUMULATE_OUTGOING_ARGS
2597 && must_preallocate
== 0 && reg_parm_stack_space
> 0)
2598 anti_adjust_stack (GEN_INT (reg_parm_stack_space
));
2601 /* Pass the function the address in which to return a
2603 if (pass
!= 0 && structure_value_addr
&& ! structure_value_addr_parm
)
2605 structure_value_addr
2606 = convert_memory_address (Pmode
, structure_value_addr
);
2607 emit_move_insn (struct_value
,
2609 force_operand (structure_value_addr
,
2612 if (REG_P (struct_value
))
2613 use_reg (&call_fusage
, struct_value
);
2616 funexp
= prepare_call_address (funexp
, static_chain_value
,
2617 &call_fusage
, reg_parm_seen
, pass
== 0);
2619 load_register_parameters (args
, num_actuals
, &call_fusage
, flags
,
2620 pass
== 0, &sibcall_failure
);
2622 /* Save a pointer to the last insn before the call, so that we can
2623 later safely search backwards to find the CALL_INSN. */
2624 before_call
= get_last_insn ();
2626 /* Set up next argument register. For sibling calls on machines
2627 with register windows this should be the incoming register. */
2628 #ifdef FUNCTION_INCOMING_ARG
2630 next_arg_reg
= FUNCTION_INCOMING_ARG (args_so_far
, VOIDmode
,
2634 next_arg_reg
= FUNCTION_ARG (args_so_far
, VOIDmode
,
2637 /* All arguments and registers used for the call must be set up by
2640 /* Stack must be properly aligned now. */
2642 || !(stack_pointer_delta
% preferred_unit_stack_boundary
));
2644 /* Generate the actual call instruction. */
2645 emit_call_1 (funexp
, exp
, fndecl
, funtype
, unadjusted_args_size
,
2646 adjusted_args_size
.constant
, struct_value_size
,
2647 next_arg_reg
, valreg
, old_inhibit_defer_pop
, call_fusage
,
2648 flags
, & args_so_far
);
2650 /* If a non-BLKmode value is returned at the most significant end
2651 of a register, shift the register right by the appropriate amount
2652 and update VALREG accordingly. BLKmode values are handled by the
2653 group load/store machinery below. */
2654 if (!structure_value_addr
2655 && !pcc_struct_value
2656 && TYPE_MODE (TREE_TYPE (exp
)) != BLKmode
2657 && targetm
.calls
.return_in_msb (TREE_TYPE (exp
)))
2659 if (shift_return_value (TYPE_MODE (TREE_TYPE (exp
)), false, valreg
))
2660 sibcall_failure
= 1;
2661 valreg
= gen_rtx_REG (TYPE_MODE (TREE_TYPE (exp
)), REGNO (valreg
));
2664 /* If call is cse'able, make appropriate pair of reg-notes around it.
2665 Test valreg so we don't crash; may safely ignore `const'
2666 if return type is void. Disable for PARALLEL return values, because
2667 we have no way to move such values into a pseudo register. */
2668 if (pass
&& (flags
& ECF_LIBCALL_BLOCK
))
2672 bool failed
= valreg
== 0 || GET_CODE (valreg
) == PARALLEL
;
2674 insns
= get_insns ();
2676 /* Expansion of block moves possibly introduced a loop that may
2677 not appear inside libcall block. */
2678 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
2690 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
2692 /* Mark the return value as a pointer if needed. */
2693 if (TREE_CODE (TREE_TYPE (exp
)) == POINTER_TYPE
)
2694 mark_reg_pointer (temp
,
2695 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp
))));
2698 if (flag_unsafe_math_optimizations
2700 && DECL_BUILT_IN (fndecl
)
2701 && (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_SQRT
2702 || DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_SQRTF
2703 || DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_SQRTL
))
2704 note
= gen_rtx_fmt_e (SQRT
,
2706 args
[0].initial_value
);
2709 /* Construct an "equal form" for the value which
2710 mentions all the arguments in order as well as
2711 the function name. */
2712 for (i
= 0; i
< num_actuals
; i
++)
2713 note
= gen_rtx_EXPR_LIST (VOIDmode
,
2714 args
[i
].initial_value
, note
);
2715 note
= gen_rtx_EXPR_LIST (VOIDmode
, funexp
, note
);
2717 if (flags
& ECF_PURE
)
2718 note
= gen_rtx_EXPR_LIST (VOIDmode
,
2719 gen_rtx_USE (VOIDmode
,
2720 gen_rtx_MEM (BLKmode
,
2721 gen_rtx_SCRATCH (VOIDmode
))),
2724 emit_libcall_block (insns
, temp
, valreg
, note
);
2729 else if (pass
&& (flags
& ECF_MALLOC
))
2731 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
2734 /* The return value from a malloc-like function is a pointer. */
2735 if (TREE_CODE (TREE_TYPE (exp
)) == POINTER_TYPE
)
2736 mark_reg_pointer (temp
, BIGGEST_ALIGNMENT
);
2738 emit_move_insn (temp
, valreg
);
2740 /* The return value from a malloc-like function can not alias
2742 last
= get_last_insn ();
2744 gen_rtx_EXPR_LIST (REG_NOALIAS
, temp
, REG_NOTES (last
));
2746 /* Write out the sequence. */
2747 insns
= get_insns ();
2753 /* For calls to `setjmp', etc., inform flow.c it should complain
2754 if nonvolatile values are live. For functions that cannot return,
2755 inform flow that control does not fall through. */
2757 if ((flags
& ECF_NORETURN
) || pass
== 0)
2759 /* The barrier must be emitted
2760 immediately after the CALL_INSN. Some ports emit more
2761 than just a CALL_INSN above, so we must search for it here. */
2763 rtx last
= get_last_insn ();
2764 while (!CALL_P (last
))
2766 last
= PREV_INSN (last
);
2767 /* There was no CALL_INSN? */
2768 gcc_assert (last
!= before_call
);
2771 emit_barrier_after (last
);
2773 /* Stack adjustments after a noreturn call are dead code.
2774 However when NO_DEFER_POP is in effect, we must preserve
2775 stack_pointer_delta. */
2776 if (inhibit_defer_pop
== 0)
2778 stack_pointer_delta
= old_stack_allocated
;
2779 pending_stack_adjust
= 0;
2783 /* If value type not void, return an rtx for the value. */
2785 if (TYPE_MODE (TREE_TYPE (exp
)) == VOIDmode
2787 target
= const0_rtx
;
2788 else if (structure_value_addr
)
2790 if (target
== 0 || !MEM_P (target
))
2793 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
2794 memory_address (TYPE_MODE (TREE_TYPE (exp
)),
2795 structure_value_addr
));
2796 set_mem_attributes (target
, exp
, 1);
2799 else if (pcc_struct_value
)
2801 /* This is the special C++ case where we need to
2802 know what the true target was. We take care to
2803 never use this value more than once in one expression. */
2804 target
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
2805 copy_to_reg (valreg
));
2806 set_mem_attributes (target
, exp
, 1);
2808 /* Handle calls that return values in multiple non-contiguous locations.
2809 The Irix 6 ABI has examples of this. */
2810 else if (GET_CODE (valreg
) == PARALLEL
)
2814 /* This will only be assigned once, so it can be readonly. */
2815 tree nt
= build_qualified_type (TREE_TYPE (exp
),
2816 (TYPE_QUALS (TREE_TYPE (exp
))
2817 | TYPE_QUAL_CONST
));
2819 target
= assign_temp (nt
, 0, 1, 1);
2822 if (! rtx_equal_p (target
, valreg
))
2823 emit_group_store (target
, valreg
, TREE_TYPE (exp
),
2824 int_size_in_bytes (TREE_TYPE (exp
)));
2826 /* We can not support sibling calls for this case. */
2827 sibcall_failure
= 1;
2830 && GET_MODE (target
) == TYPE_MODE (TREE_TYPE (exp
))
2831 && GET_MODE (target
) == GET_MODE (valreg
))
2833 /* TARGET and VALREG cannot be equal at this point because the
2834 latter would not have REG_FUNCTION_VALUE_P true, while the
2835 former would if it were referring to the same register.
2837 If they refer to the same register, this move will be a no-op,
2838 except when function inlining is being done. */
2839 emit_move_insn (target
, valreg
);
2841 /* If we are setting a MEM, this code must be executed. Since it is
2842 emitted after the call insn, sibcall optimization cannot be
2843 performed in that case. */
2845 sibcall_failure
= 1;
2847 else if (TYPE_MODE (TREE_TYPE (exp
)) == BLKmode
)
2849 target
= copy_blkmode_from_reg (target
, valreg
, TREE_TYPE (exp
));
2851 /* We can not support sibling calls for this case. */
2852 sibcall_failure
= 1;
2855 target
= copy_to_reg (valreg
);
2857 if (targetm
.calls
.promote_function_return(funtype
))
2859 /* If we promoted this return value, make the proper SUBREG.
2860 TARGET might be const0_rtx here, so be careful. */
2862 && TYPE_MODE (TREE_TYPE (exp
)) != BLKmode
2863 && GET_MODE (target
) != TYPE_MODE (TREE_TYPE (exp
)))
2865 tree type
= TREE_TYPE (exp
);
2866 int unsignedp
= TYPE_UNSIGNED (type
);
2868 enum machine_mode pmode
;
2870 pmode
= promote_mode (type
, TYPE_MODE (type
), &unsignedp
, 1);
2871 /* If we don't promote as expected, something is wrong. */
2872 gcc_assert (GET_MODE (target
) == pmode
);
2874 if ((WORDS_BIG_ENDIAN
|| BYTES_BIG_ENDIAN
)
2875 && (GET_MODE_SIZE (GET_MODE (target
))
2876 > GET_MODE_SIZE (TYPE_MODE (type
))))
2878 offset
= GET_MODE_SIZE (GET_MODE (target
))
2879 - GET_MODE_SIZE (TYPE_MODE (type
));
2880 if (! BYTES_BIG_ENDIAN
)
2881 offset
= (offset
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
2882 else if (! WORDS_BIG_ENDIAN
)
2883 offset
%= UNITS_PER_WORD
;
2885 target
= gen_rtx_SUBREG (TYPE_MODE (type
), target
, offset
);
2886 SUBREG_PROMOTED_VAR_P (target
) = 1;
2887 SUBREG_PROMOTED_UNSIGNED_SET (target
, unsignedp
);
2891 /* If size of args is variable or this was a constructor call for a stack
2892 argument, restore saved stack-pointer value. */
2894 if (old_stack_level
&& ! (flags
& ECF_SP_DEPRESSED
))
2896 emit_stack_restore (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
2897 stack_pointer_delta
= old_stack_pointer_delta
;
2898 pending_stack_adjust
= old_pending_adj
;
2899 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
2900 stack_arg_under_construction
= old_stack_arg_under_construction
;
2901 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
2902 stack_usage_map
= initial_stack_usage_map
;
2903 sibcall_failure
= 1;
2905 else if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
2907 #ifdef REG_PARM_STACK_SPACE
2909 restore_fixed_argument_area (save_area
, argblock
,
2910 high_to_save
, low_to_save
);
2913 /* If we saved any argument areas, restore them. */
2914 for (i
= 0; i
< num_actuals
; i
++)
2915 if (args
[i
].save_area
)
2917 enum machine_mode save_mode
= GET_MODE (args
[i
].save_area
);
2919 = gen_rtx_MEM (save_mode
,
2920 memory_address (save_mode
,
2921 XEXP (args
[i
].stack_slot
, 0)));
2923 if (save_mode
!= BLKmode
)
2924 emit_move_insn (stack_area
, args
[i
].save_area
);
2926 emit_block_move (stack_area
, args
[i
].save_area
,
2927 GEN_INT (args
[i
].locate
.size
.constant
),
2928 BLOCK_OP_CALL_PARM
);
2931 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
2932 stack_usage_map
= initial_stack_usage_map
;
2935 /* If this was alloca, record the new stack level for nonlocal gotos.
2936 Check for the handler slots since we might not have a save area
2937 for non-local gotos. */
2939 if ((flags
& ECF_MAY_BE_ALLOCA
) && cfun
->nonlocal_goto_save_area
!= 0)
2940 update_nonlocal_goto_save_area ();
2942 /* Free up storage we no longer need. */
2943 for (i
= 0; i
< num_actuals
; ++i
)
2944 if (args
[i
].aligned_regs
)
2945 free (args
[i
].aligned_regs
);
2947 insns
= get_insns ();
2952 tail_call_insns
= insns
;
2954 /* Restore the pending stack adjustment now that we have
2955 finished generating the sibling call sequence. */
2957 pending_stack_adjust
= save_pending_stack_adjust
;
2958 stack_pointer_delta
= save_stack_pointer_delta
;
2960 /* Prepare arg structure for next iteration. */
2961 for (i
= 0; i
< num_actuals
; i
++)
2964 args
[i
].aligned_regs
= 0;
2968 sbitmap_free (stored_args_map
);
2972 normal_call_insns
= insns
;
2974 /* Verify that we've deallocated all the stack we used. */
2975 gcc_assert ((flags
& ECF_NORETURN
)
2976 || (old_stack_allocated
2977 == stack_pointer_delta
- pending_stack_adjust
));
2980 /* If something prevents making this a sibling call,
2981 zero out the sequence. */
2982 if (sibcall_failure
)
2983 tail_call_insns
= NULL_RTX
;
2988 /* If tail call production succeeded, we need to remove REG_EQUIV notes on
2989 arguments too, as argument area is now clobbered by the call. */
2990 if (tail_call_insns
)
2992 emit_insn (tail_call_insns
);
2993 cfun
->tail_call_emit
= true;
2996 emit_insn (normal_call_insns
);
2998 currently_expanding_call
--;
3000 /* If this function returns with the stack pointer depressed, ensure
3001 this block saves and restores the stack pointer, show it was
3002 changed, and adjust for any outgoing arg space. */
3003 if (flags
& ECF_SP_DEPRESSED
)
3005 clear_pending_stack_adjust ();
3006 emit_insn (gen_rtx_CLOBBER (VOIDmode
, stack_pointer_rtx
));
3007 emit_move_insn (virtual_stack_dynamic_rtx
, stack_pointer_rtx
);
3013 /* A sibling call sequence invalidates any REG_EQUIV notes made for
3014 this function's incoming arguments.
3016 At the start of RTL generation we know the only REG_EQUIV notes
3017 in the rtl chain are those for incoming arguments, so we can safely
3018 flush any REG_EQUIV note.
3020 This is (slight) overkill. We could keep track of the highest
3021 argument we clobber and be more selective in removing notes, but it
3022 does not seem to be worth the effort. */
3024 fixup_tail_calls (void)
3026 purge_reg_equiv_notes ();
3029 /* Traverse an argument list in VALUES and expand all complex
3030 arguments into their components. */
3032 split_complex_values (tree values
)
3036 /* Before allocating memory, check for the common case of no complex. */
3037 for (p
= values
; p
; p
= TREE_CHAIN (p
))
3039 tree type
= TREE_TYPE (TREE_VALUE (p
));
3040 if (type
&& TREE_CODE (type
) == COMPLEX_TYPE
3041 && targetm
.calls
.split_complex_arg (type
))
3047 values
= copy_list (values
);
3049 for (p
= values
; p
; p
= TREE_CHAIN (p
))
3051 tree complex_value
= TREE_VALUE (p
);
3054 complex_type
= TREE_TYPE (complex_value
);
3058 if (TREE_CODE (complex_type
) == COMPLEX_TYPE
3059 && targetm
.calls
.split_complex_arg (complex_type
))
3062 tree real
, imag
, next
;
3064 subtype
= TREE_TYPE (complex_type
);
3065 complex_value
= save_expr (complex_value
);
3066 real
= build1 (REALPART_EXPR
, subtype
, complex_value
);
3067 imag
= build1 (IMAGPART_EXPR
, subtype
, complex_value
);
3069 TREE_VALUE (p
) = real
;
3070 next
= TREE_CHAIN (p
);
3071 imag
= build_tree_list (NULL_TREE
, imag
);
3072 TREE_CHAIN (p
) = imag
;
3073 TREE_CHAIN (imag
) = next
;
3075 /* Skip the newly created node. */
3083 /* Traverse a list of TYPES and expand all complex types into their
3086 split_complex_types (tree types
)
3090 /* Before allocating memory, check for the common case of no complex. */
3091 for (p
= types
; p
; p
= TREE_CHAIN (p
))
3093 tree type
= TREE_VALUE (p
);
3094 if (TREE_CODE (type
) == COMPLEX_TYPE
3095 && targetm
.calls
.split_complex_arg (type
))
3101 types
= copy_list (types
);
3103 for (p
= types
; p
; p
= TREE_CHAIN (p
))
3105 tree complex_type
= TREE_VALUE (p
);
3107 if (TREE_CODE (complex_type
) == COMPLEX_TYPE
3108 && targetm
.calls
.split_complex_arg (complex_type
))
3112 /* Rewrite complex type with component type. */
3113 TREE_VALUE (p
) = TREE_TYPE (complex_type
);
3114 next
= TREE_CHAIN (p
);
3116 /* Add another component type for the imaginary part. */
3117 imag
= build_tree_list (NULL_TREE
, TREE_VALUE (p
));
3118 TREE_CHAIN (p
) = imag
;
3119 TREE_CHAIN (imag
) = next
;
3121 /* Skip the newly created node. */
3129 /* Output a library call to function FUN (a SYMBOL_REF rtx).
3130 The RETVAL parameter specifies whether return value needs to be saved, other
3131 parameters are documented in the emit_library_call function below. */
3134 emit_library_call_value_1 (int retval
, rtx orgfun
, rtx value
,
3135 enum libcall_type fn_type
,
3136 enum machine_mode outmode
, int nargs
, va_list p
)
3138 /* Total size in bytes of all the stack-parms scanned so far. */
3139 struct args_size args_size
;
3140 /* Size of arguments before any adjustments (such as rounding). */
3141 struct args_size original_args_size
;
3147 CUMULATIVE_ARGS args_so_far
;
3151 enum machine_mode mode
;
3154 struct locate_and_pad_arg_data locate
;
3158 int old_inhibit_defer_pop
= inhibit_defer_pop
;
3159 rtx call_fusage
= 0;
3162 int pcc_struct_value
= 0;
3163 int struct_value_size
= 0;
3165 int reg_parm_stack_space
= 0;
3168 tree tfom
; /* type_for_mode (outmode, 0) */
3170 #ifdef REG_PARM_STACK_SPACE
3171 /* Define the boundary of the register parm stack space that needs to be
3173 int low_to_save
, high_to_save
;
3174 rtx save_area
= 0; /* Place that it is saved. */
3177 /* Size of the stack reserved for parameter registers. */
3178 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
3179 char *initial_stack_usage_map
= stack_usage_map
;
3181 rtx struct_value
= targetm
.calls
.struct_value_rtx (0, 0);
3183 #ifdef REG_PARM_STACK_SPACE
3184 reg_parm_stack_space
= REG_PARM_STACK_SPACE ((tree
) 0);
3187 /* By default, library functions can not throw. */
3188 flags
= ECF_NOTHROW
;
3200 case LCT_CONST_MAKE_BLOCK
:
3201 flags
|= ECF_CONST
| ECF_LIBCALL_BLOCK
;
3203 case LCT_PURE_MAKE_BLOCK
:
3204 flags
|= ECF_PURE
| ECF_LIBCALL_BLOCK
;
3207 flags
|= ECF_NORETURN
;
3210 flags
= ECF_NORETURN
;
3212 case LCT_ALWAYS_RETURN
:
3213 flags
= ECF_ALWAYS_RETURN
;
3215 case LCT_RETURNS_TWICE
:
3216 flags
= ECF_RETURNS_TWICE
;
3221 /* Ensure current function's preferred stack boundary is at least
3223 if (cfun
->preferred_stack_boundary
< PREFERRED_STACK_BOUNDARY
)
3224 cfun
->preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
3226 /* If this kind of value comes back in memory,
3227 decide where in memory it should come back. */
3228 if (outmode
!= VOIDmode
)
3230 tfom
= lang_hooks
.types
.type_for_mode (outmode
, 0);
3231 if (aggregate_value_p (tfom
, 0))
3233 #ifdef PCC_STATIC_STRUCT_RETURN
3235 = hard_function_value (build_pointer_type (tfom
), 0, 0);
3236 mem_value
= gen_rtx_MEM (outmode
, pointer_reg
);
3237 pcc_struct_value
= 1;
3239 value
= gen_reg_rtx (outmode
);
3240 #else /* not PCC_STATIC_STRUCT_RETURN */
3241 struct_value_size
= GET_MODE_SIZE (outmode
);
3242 if (value
!= 0 && MEM_P (value
))
3245 mem_value
= assign_temp (tfom
, 0, 1, 1);
3247 /* This call returns a big structure. */
3248 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LIBCALL_BLOCK
);
3252 tfom
= void_type_node
;
3254 /* ??? Unfinished: must pass the memory address as an argument. */
3256 /* Copy all the libcall-arguments out of the varargs data
3257 and into a vector ARGVEC.
3259 Compute how to pass each argument. We only support a very small subset
3260 of the full argument passing conventions to limit complexity here since
3261 library functions shouldn't have many args. */
3263 argvec
= alloca ((nargs
+ 1) * sizeof (struct arg
));
3264 memset (argvec
, 0, (nargs
+ 1) * sizeof (struct arg
));
3266 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
3267 INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far
, outmode
, fun
);
3269 INIT_CUMULATIVE_ARGS (args_so_far
, NULL_TREE
, fun
, 0, nargs
);
3272 args_size
.constant
= 0;
3277 /* Now we are about to start emitting insns that can be deleted
3278 if a libcall is deleted. */
3279 if (flags
& ECF_LIBCALL_BLOCK
)
3284 /* If there's a structure value address to be passed,
3285 either pass it in the special place, or pass it as an extra argument. */
3286 if (mem_value
&& struct_value
== 0 && ! pcc_struct_value
)
3288 rtx addr
= XEXP (mem_value
, 0);
3293 /* Make sure it is a reasonable operand for a move or push insn. */
3294 if (!REG_P (addr
) && !MEM_P (addr
)
3295 && ! (CONSTANT_P (addr
) && LEGITIMATE_CONSTANT_P (addr
)))
3296 addr
= force_operand (addr
, NULL_RTX
);
3298 argvec
[count
].value
= addr
;
3299 argvec
[count
].mode
= Pmode
;
3300 argvec
[count
].partial
= 0;
3302 argvec
[count
].reg
= FUNCTION_ARG (args_so_far
, Pmode
, NULL_TREE
, 1);
3303 partial
= FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, Pmode
, NULL_TREE
, 1);
3304 gcc_assert (!partial
);
3306 locate_and_pad_parm (Pmode
, NULL_TREE
,
3307 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3310 argvec
[count
].reg
!= 0,
3312 0, NULL_TREE
, &args_size
, &argvec
[count
].locate
);
3314 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
3315 || reg_parm_stack_space
> 0)
3316 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
3318 FUNCTION_ARG_ADVANCE (args_so_far
, Pmode
, (tree
) 0, 1);
3323 for (; count
< nargs
; count
++)
3325 rtx val
= va_arg (p
, rtx
);
3326 enum machine_mode mode
= va_arg (p
, enum machine_mode
);
3328 /* We cannot convert the arg value to the mode the library wants here;
3329 must do it earlier where we know the signedness of the arg. */
3330 gcc_assert (mode
!= BLKmode
3331 && (GET_MODE (val
) == mode
|| GET_MODE (val
) == VOIDmode
));
3333 /* Make sure it is a reasonable operand for a move or push insn. */
3334 if (!REG_P (val
) && !MEM_P (val
)
3335 && ! (CONSTANT_P (val
) && LEGITIMATE_CONSTANT_P (val
)))
3336 val
= force_operand (val
, NULL_RTX
);
3338 if (pass_by_reference (&args_so_far
, mode
, NULL_TREE
, 1))
3342 = !reference_callee_copied (&args_so_far
, mode
, NULL_TREE
, 1);
3344 /* loop.c won't look at CALL_INSN_FUNCTION_USAGE of const/pure
3345 functions, so we have to pretend this isn't such a function. */
3346 if (flags
& ECF_LIBCALL_BLOCK
)
3348 rtx insns
= get_insns ();
3352 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LIBCALL_BLOCK
);
3354 /* If this was a CONST function, it is now PURE since
3355 it now reads memory. */
3356 if (flags
& ECF_CONST
)
3358 flags
&= ~ECF_CONST
;
3362 if (GET_MODE (val
) == MEM
&& !must_copy
)
3366 slot
= assign_temp (lang_hooks
.types
.type_for_mode (mode
, 0),
3368 emit_move_insn (slot
, val
);
3371 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3372 gen_rtx_USE (VOIDmode
, slot
),
3375 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3376 gen_rtx_CLOBBER (VOIDmode
,
3381 val
= force_operand (XEXP (slot
, 0), NULL_RTX
);
3384 argvec
[count
].value
= val
;
3385 argvec
[count
].mode
= mode
;
3387 argvec
[count
].reg
= FUNCTION_ARG (args_so_far
, mode
, NULL_TREE
, 1);
3389 argvec
[count
].partial
3390 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, mode
, NULL_TREE
, 1);
3392 locate_and_pad_parm (mode
, NULL_TREE
,
3393 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3396 argvec
[count
].reg
!= 0,
3398 argvec
[count
].partial
,
3399 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
3401 gcc_assert (!argvec
[count
].locate
.size
.var
);
3403 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
3404 || reg_parm_stack_space
> 0)
3405 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
3407 FUNCTION_ARG_ADVANCE (args_so_far
, mode
, (tree
) 0, 1);
3410 /* If this machine requires an external definition for library
3411 functions, write one out. */
3412 assemble_external_libcall (fun
);
3414 original_args_size
= args_size
;
3415 args_size
.constant
= (((args_size
.constant
3416 + stack_pointer_delta
3420 - stack_pointer_delta
);
3422 args_size
.constant
= MAX (args_size
.constant
,
3423 reg_parm_stack_space
);
3425 #ifndef OUTGOING_REG_PARM_STACK_SPACE
3426 args_size
.constant
-= reg_parm_stack_space
;
3429 if (args_size
.constant
> current_function_outgoing_args_size
)
3430 current_function_outgoing_args_size
= args_size
.constant
;
3432 if (ACCUMULATE_OUTGOING_ARGS
)
3434 /* Since the stack pointer will never be pushed, it is possible for
3435 the evaluation of a parm to clobber something we have already
3436 written to the stack. Since most function calls on RISC machines
3437 do not use the stack, this is uncommon, but must work correctly.
3439 Therefore, we save any area of the stack that was already written
3440 and that we are using. Here we set up to do this by making a new
3441 stack usage map from the old one.
3443 Another approach might be to try to reorder the argument
3444 evaluations to avoid this conflicting stack usage. */
3446 needed
= args_size
.constant
;
3448 #ifndef OUTGOING_REG_PARM_STACK_SPACE
3449 /* Since we will be writing into the entire argument area, the
3450 map must be allocated for its entire size, not just the part that
3451 is the responsibility of the caller. */
3452 needed
+= reg_parm_stack_space
;
3455 #ifdef ARGS_GROW_DOWNWARD
3456 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
3459 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
3462 stack_usage_map
= alloca (highest_outgoing_arg_in_use
);
3464 if (initial_highest_arg_in_use
)
3465 memcpy (stack_usage_map
, initial_stack_usage_map
,
3466 initial_highest_arg_in_use
);
3468 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
3469 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
3470 highest_outgoing_arg_in_use
- initial_highest_arg_in_use
);
3473 /* We must be careful to use virtual regs before they're instantiated,
3474 and real regs afterwards. Loop optimization, for example, can create
3475 new libcalls after we've instantiated the virtual regs, and if we
3476 use virtuals anyway, they won't match the rtl patterns. */
3478 if (virtuals_instantiated
)
3479 argblock
= plus_constant (stack_pointer_rtx
, STACK_POINTER_OFFSET
);
3481 argblock
= virtual_outgoing_args_rtx
;
3486 argblock
= push_block (GEN_INT (args_size
.constant
), 0, 0);
3489 /* If we push args individually in reverse order, perform stack alignment
3490 before the first push (the last arg). */
3491 if (argblock
== 0 && PUSH_ARGS_REVERSED
)
3492 anti_adjust_stack (GEN_INT (args_size
.constant
3493 - original_args_size
.constant
));
3495 if (PUSH_ARGS_REVERSED
)
3506 #ifdef REG_PARM_STACK_SPACE
3507 if (ACCUMULATE_OUTGOING_ARGS
)
3509 /* The argument list is the property of the called routine and it
3510 may clobber it. If the fixed area has been used for previous
3511 parameters, we must save and restore it. */
3512 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
3513 &low_to_save
, &high_to_save
);
3517 /* Push the args that need to be pushed. */
3519 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
3520 are to be pushed. */
3521 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
3523 enum machine_mode mode
= argvec
[argnum
].mode
;
3524 rtx val
= argvec
[argnum
].value
;
3525 rtx reg
= argvec
[argnum
].reg
;
3526 int partial
= argvec
[argnum
].partial
;
3527 int lower_bound
= 0, upper_bound
= 0, i
;
3529 if (! (reg
!= 0 && partial
== 0))
3531 if (ACCUMULATE_OUTGOING_ARGS
)
3533 /* If this is being stored into a pre-allocated, fixed-size,
3534 stack area, save any previous data at that location. */
3536 #ifdef ARGS_GROW_DOWNWARD
3537 /* stack_slot is negative, but we want to index stack_usage_map
3538 with positive values. */
3539 upper_bound
= -argvec
[argnum
].locate
.offset
.constant
+ 1;
3540 lower_bound
= upper_bound
- argvec
[argnum
].locate
.size
.constant
;
3542 lower_bound
= argvec
[argnum
].locate
.offset
.constant
;
3543 upper_bound
= lower_bound
+ argvec
[argnum
].locate
.size
.constant
;
3547 /* Don't worry about things in the fixed argument area;
3548 it has already been saved. */
3549 if (i
< reg_parm_stack_space
)
3550 i
= reg_parm_stack_space
;
3551 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
3554 if (i
< upper_bound
)
3556 /* We need to make a save area. */
3558 = argvec
[argnum
].locate
.size
.constant
* BITS_PER_UNIT
;
3559 enum machine_mode save_mode
3560 = mode_for_size (size
, MODE_INT
, 1);
3562 = plus_constant (argblock
,
3563 argvec
[argnum
].locate
.offset
.constant
);
3565 = gen_rtx_MEM (save_mode
, memory_address (save_mode
, adr
));
3567 if (save_mode
== BLKmode
)
3569 argvec
[argnum
].save_area
3570 = assign_stack_temp (BLKmode
,
3571 argvec
[argnum
].locate
.size
.constant
,
3574 emit_block_move (validize_mem (argvec
[argnum
].save_area
),
3576 GEN_INT (argvec
[argnum
].locate
.size
.constant
),
3577 BLOCK_OP_CALL_PARM
);
3581 argvec
[argnum
].save_area
= gen_reg_rtx (save_mode
);
3583 emit_move_insn (argvec
[argnum
].save_area
, stack_area
);
3588 emit_push_insn (val
, mode
, NULL_TREE
, NULL_RTX
, PARM_BOUNDARY
,
3589 partial
, reg
, 0, argblock
,
3590 GEN_INT (argvec
[argnum
].locate
.offset
.constant
),
3591 reg_parm_stack_space
,
3592 ARGS_SIZE_RTX (argvec
[argnum
].locate
.alignment_pad
));
3594 /* Now mark the segment we just used. */
3595 if (ACCUMULATE_OUTGOING_ARGS
)
3596 for (i
= lower_bound
; i
< upper_bound
; i
++)
3597 stack_usage_map
[i
] = 1;
3603 /* If we pushed args in forward order, perform stack alignment
3604 after pushing the last arg. */
3605 if (argblock
== 0 && !PUSH_ARGS_REVERSED
)
3606 anti_adjust_stack (GEN_INT (args_size
.constant
3607 - original_args_size
.constant
));
3609 if (PUSH_ARGS_REVERSED
)
3614 fun
= prepare_call_address (fun
, NULL
, &call_fusage
, 0, 0);
3616 /* Now load any reg parms into their regs. */
3618 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
3619 are to be pushed. */
3620 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
3622 enum machine_mode mode
= argvec
[argnum
].mode
;
3623 rtx val
= argvec
[argnum
].value
;
3624 rtx reg
= argvec
[argnum
].reg
;
3625 int partial
= argvec
[argnum
].partial
;
3627 /* Handle calls that pass values in multiple non-contiguous
3628 locations. The PA64 has examples of this for library calls. */
3629 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
3630 emit_group_load (reg
, val
, NULL_TREE
, GET_MODE_SIZE (mode
));
3631 else if (reg
!= 0 && partial
== 0)
3632 emit_move_insn (reg
, val
);
3637 /* Any regs containing parms remain in use through the call. */
3638 for (count
= 0; count
< nargs
; count
++)
3640 rtx reg
= argvec
[count
].reg
;
3641 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
3642 use_group_regs (&call_fusage
, reg
);
3644 use_reg (&call_fusage
, reg
);
3647 /* Pass the function the address in which to return a structure value. */
3648 if (mem_value
!= 0 && struct_value
!= 0 && ! pcc_struct_value
)
3650 emit_move_insn (struct_value
,
3652 force_operand (XEXP (mem_value
, 0),
3654 if (REG_P (struct_value
))
3655 use_reg (&call_fusage
, struct_value
);
3658 /* Don't allow popping to be deferred, since then
3659 cse'ing of library calls could delete a call and leave the pop. */
3661 valreg
= (mem_value
== 0 && outmode
!= VOIDmode
3662 ? hard_libcall_value (outmode
) : NULL_RTX
);
3664 /* Stack must be properly aligned now. */
3665 gcc_assert (!(stack_pointer_delta
3666 & (PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
- 1)));
3668 before_call
= get_last_insn ();
3670 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
3671 will set inhibit_defer_pop to that value. */
3672 /* The return type is needed to decide how many bytes the function pops.
3673 Signedness plays no role in that, so for simplicity, we pretend it's
3674 always signed. We also assume that the list of arguments passed has
3675 no impact, so we pretend it is unknown. */
3677 emit_call_1 (fun
, NULL
,
3678 get_identifier (XSTR (orgfun
, 0)),
3679 build_function_type (tfom
, NULL_TREE
),
3680 original_args_size
.constant
, args_size
.constant
,
3682 FUNCTION_ARG (args_so_far
, VOIDmode
, void_type_node
, 1),
3684 old_inhibit_defer_pop
+ 1, call_fusage
, flags
, & args_so_far
);
3686 /* For calls to `setjmp', etc., inform flow.c it should complain
3687 if nonvolatile values are live. For functions that cannot return,
3688 inform flow that control does not fall through. */
3690 if (flags
& ECF_NORETURN
)
3692 /* The barrier note must be emitted
3693 immediately after the CALL_INSN. Some ports emit more than
3694 just a CALL_INSN above, so we must search for it here. */
3696 rtx last
= get_last_insn ();
3697 while (!CALL_P (last
))
3699 last
= PREV_INSN (last
);
3700 /* There was no CALL_INSN? */
3701 gcc_assert (last
!= before_call
);
3704 emit_barrier_after (last
);
3707 /* Now restore inhibit_defer_pop to its actual original value. */
3710 /* If call is cse'able, make appropriate pair of reg-notes around it.
3711 Test valreg so we don't crash; may safely ignore `const'
3712 if return type is void. Disable for PARALLEL return values, because
3713 we have no way to move such values into a pseudo register. */
3714 if (flags
& ECF_LIBCALL_BLOCK
)
3720 insns
= get_insns ();
3730 if (GET_CODE (valreg
) == PARALLEL
)
3732 temp
= gen_reg_rtx (outmode
);
3733 emit_group_store (temp
, valreg
, NULL_TREE
,
3734 GET_MODE_SIZE (outmode
));
3738 temp
= gen_reg_rtx (GET_MODE (valreg
));
3740 /* Construct an "equal form" for the value which mentions all the
3741 arguments in order as well as the function name. */
3742 for (i
= 0; i
< nargs
; i
++)
3743 note
= gen_rtx_EXPR_LIST (VOIDmode
, argvec
[i
].value
, note
);
3744 note
= gen_rtx_EXPR_LIST (VOIDmode
, fun
, note
);
3746 insns
= get_insns ();
3749 if (flags
& ECF_PURE
)
3750 note
= gen_rtx_EXPR_LIST (VOIDmode
,
3751 gen_rtx_USE (VOIDmode
,
3752 gen_rtx_MEM (BLKmode
,
3753 gen_rtx_SCRATCH (VOIDmode
))),
3756 emit_libcall_block (insns
, temp
, valreg
, note
);
3763 /* Copy the value to the right place. */
3764 if (outmode
!= VOIDmode
&& retval
)
3770 if (value
!= mem_value
)
3771 emit_move_insn (value
, mem_value
);
3773 else if (GET_CODE (valreg
) == PARALLEL
)
3776 value
= gen_reg_rtx (outmode
);
3777 emit_group_store (value
, valreg
, NULL_TREE
, GET_MODE_SIZE (outmode
));
3779 else if (value
!= 0)
3780 emit_move_insn (value
, valreg
);
3785 if (ACCUMULATE_OUTGOING_ARGS
)
3787 #ifdef REG_PARM_STACK_SPACE
3789 restore_fixed_argument_area (save_area
, argblock
,
3790 high_to_save
, low_to_save
);
3793 /* If we saved any argument areas, restore them. */
3794 for (count
= 0; count
< nargs
; count
++)
3795 if (argvec
[count
].save_area
)
3797 enum machine_mode save_mode
= GET_MODE (argvec
[count
].save_area
);
3798 rtx adr
= plus_constant (argblock
,
3799 argvec
[count
].locate
.offset
.constant
);
3800 rtx stack_area
= gen_rtx_MEM (save_mode
,
3801 memory_address (save_mode
, adr
));
3803 if (save_mode
== BLKmode
)
3804 emit_block_move (stack_area
,
3805 validize_mem (argvec
[count
].save_area
),
3806 GEN_INT (argvec
[count
].locate
.size
.constant
),
3807 BLOCK_OP_CALL_PARM
);
3809 emit_move_insn (stack_area
, argvec
[count
].save_area
);
3812 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
3813 stack_usage_map
= initial_stack_usage_map
;
3820 /* Output a library call to function FUN (a SYMBOL_REF rtx)
3821 (emitting the queue unless NO_QUEUE is nonzero),
3822 for a value of mode OUTMODE,
3823 with NARGS different arguments, passed as alternating rtx values
3824 and machine_modes to convert them to.
3826 FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for `const'
3827 calls, LCT_PURE for `pure' calls, LCT_CONST_MAKE_BLOCK for `const' calls
3828 which should be enclosed in REG_LIBCALL/REG_RETVAL notes,
3829 LCT_PURE_MAKE_BLOCK for `purep' calls which should be enclosed in
3830 REG_LIBCALL/REG_RETVAL notes with extra (use (memory (scratch)),
3831 or other LCT_ value for other types of library calls. */
3834 emit_library_call (rtx orgfun
, enum libcall_type fn_type
,
3835 enum machine_mode outmode
, int nargs
, ...)
3839 va_start (p
, nargs
);
3840 emit_library_call_value_1 (0, orgfun
, NULL_RTX
, fn_type
, outmode
, nargs
, p
);
3844 /* Like emit_library_call except that an extra argument, VALUE,
3845 comes second and says where to store the result.
3846 (If VALUE is zero, this function chooses a convenient way
3847 to return the value.
3849 This function returns an rtx for where the value is to be found.
3850 If VALUE is nonzero, VALUE is returned. */
3853 emit_library_call_value (rtx orgfun
, rtx value
,
3854 enum libcall_type fn_type
,
3855 enum machine_mode outmode
, int nargs
, ...)
3860 va_start (p
, nargs
);
3861 result
= emit_library_call_value_1 (1, orgfun
, value
, fn_type
, outmode
,
3868 /* Store a single argument for a function call
3869 into the register or memory area where it must be passed.
3870 *ARG describes the argument value and where to pass it.
3872 ARGBLOCK is the address of the stack-block for all the arguments,
3873 or 0 on a machine where arguments are pushed individually.
3875 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
3876 so must be careful about how the stack is used.
3878 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
3879 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
3880 that we need not worry about saving and restoring the stack.
3882 FNDECL is the declaration of the function we are calling.
3884 Return nonzero if this arg should cause sibcall failure,
3888 store_one_arg (struct arg_data
*arg
, rtx argblock
, int flags
,
3889 int variable_size ATTRIBUTE_UNUSED
, int reg_parm_stack_space
)
3891 tree pval
= arg
->tree_value
;
3895 int i
, lower_bound
= 0, upper_bound
= 0;
3896 int sibcall_failure
= 0;
3898 if (TREE_CODE (pval
) == ERROR_MARK
)
3901 /* Push a new temporary level for any temporaries we make for
3905 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
))
3907 /* If this is being stored into a pre-allocated, fixed-size, stack area,
3908 save any previous data at that location. */
3909 if (argblock
&& ! variable_size
&& arg
->stack
)
3911 #ifdef ARGS_GROW_DOWNWARD
3912 /* stack_slot is negative, but we want to index stack_usage_map
3913 with positive values. */
3914 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
3915 upper_bound
= -INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1)) + 1;
3919 lower_bound
= upper_bound
- arg
->locate
.size
.constant
;
3921 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
3922 lower_bound
= INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1));
3926 upper_bound
= lower_bound
+ arg
->locate
.size
.constant
;
3930 /* Don't worry about things in the fixed argument area;
3931 it has already been saved. */
3932 if (i
< reg_parm_stack_space
)
3933 i
= reg_parm_stack_space
;
3934 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
3937 if (i
< upper_bound
)
3939 /* We need to make a save area. */
3940 unsigned int size
= arg
->locate
.size
.constant
* BITS_PER_UNIT
;
3941 enum machine_mode save_mode
= mode_for_size (size
, MODE_INT
, 1);
3942 rtx adr
= memory_address (save_mode
, XEXP (arg
->stack_slot
, 0));
3943 rtx stack_area
= gen_rtx_MEM (save_mode
, adr
);
3945 if (save_mode
== BLKmode
)
3947 tree ot
= TREE_TYPE (arg
->tree_value
);
3948 tree nt
= build_qualified_type (ot
, (TYPE_QUALS (ot
)
3949 | TYPE_QUAL_CONST
));
3951 arg
->save_area
= assign_temp (nt
, 0, 1, 1);
3952 preserve_temp_slots (arg
->save_area
);
3953 emit_block_move (validize_mem (arg
->save_area
), stack_area
,
3954 expr_size (arg
->tree_value
),
3955 BLOCK_OP_CALL_PARM
);
3959 arg
->save_area
= gen_reg_rtx (save_mode
);
3960 emit_move_insn (arg
->save_area
, stack_area
);
3966 /* If this isn't going to be placed on both the stack and in registers,
3967 set up the register and number of words. */
3968 if (! arg
->pass_on_stack
)
3970 if (flags
& ECF_SIBCALL
)
3971 reg
= arg
->tail_call_reg
;
3974 partial
= arg
->partial
;
3977 /* Being passed entirely in a register. We shouldn't be called in
3979 gcc_assert (reg
== 0 || partial
!= 0);
3981 /* If this arg needs special alignment, don't load the registers
3983 if (arg
->n_aligned_regs
!= 0)
3986 /* If this is being passed partially in a register, we can't evaluate
3987 it directly into its stack slot. Otherwise, we can. */
3988 if (arg
->value
== 0)
3990 /* stack_arg_under_construction is nonzero if a function argument is
3991 being evaluated directly into the outgoing argument list and
3992 expand_call must take special action to preserve the argument list
3993 if it is called recursively.
3995 For scalar function arguments stack_usage_map is sufficient to
3996 determine which stack slots must be saved and restored. Scalar
3997 arguments in general have pass_on_stack == 0.
3999 If this argument is initialized by a function which takes the
4000 address of the argument (a C++ constructor or a C function
4001 returning a BLKmode structure), then stack_usage_map is
4002 insufficient and expand_call must push the stack around the
4003 function call. Such arguments have pass_on_stack == 1.
4005 Note that it is always safe to set stack_arg_under_construction,
4006 but this generates suboptimal code if set when not needed. */
4008 if (arg
->pass_on_stack
)
4009 stack_arg_under_construction
++;
4011 arg
->value
= expand_expr (pval
,
4013 || TYPE_MODE (TREE_TYPE (pval
)) != arg
->mode
)
4014 ? NULL_RTX
: arg
->stack
,
4015 VOIDmode
, EXPAND_STACK_PARM
);
4017 /* If we are promoting object (or for any other reason) the mode
4018 doesn't agree, convert the mode. */
4020 if (arg
->mode
!= TYPE_MODE (TREE_TYPE (pval
)))
4021 arg
->value
= convert_modes (arg
->mode
, TYPE_MODE (TREE_TYPE (pval
)),
4022 arg
->value
, arg
->unsignedp
);
4024 if (arg
->pass_on_stack
)
4025 stack_arg_under_construction
--;
4028 /* Don't allow anything left on stack from computation
4029 of argument to alloca. */
4030 if (flags
& ECF_MAY_BE_ALLOCA
)
4031 do_pending_stack_adjust ();
4033 if (arg
->value
== arg
->stack
)
4034 /* If the value is already in the stack slot, we are done. */
4036 else if (arg
->mode
!= BLKmode
)
4040 /* Argument is a scalar, not entirely passed in registers.
4041 (If part is passed in registers, arg->partial says how much
4042 and emit_push_insn will take care of putting it there.)
4044 Push it, and if its size is less than the
4045 amount of space allocated to it,
4046 also bump stack pointer by the additional space.
4047 Note that in C the default argument promotions
4048 will prevent such mismatches. */
4050 size
= GET_MODE_SIZE (arg
->mode
);
4051 /* Compute how much space the push instruction will push.
4052 On many machines, pushing a byte will advance the stack
4053 pointer by a halfword. */
4054 #ifdef PUSH_ROUNDING
4055 size
= PUSH_ROUNDING (size
);
4059 /* Compute how much space the argument should get:
4060 round up to a multiple of the alignment for arguments. */
4061 if (none
!= FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)))
4062 used
= (((size
+ PARM_BOUNDARY
/ BITS_PER_UNIT
- 1)
4063 / (PARM_BOUNDARY
/ BITS_PER_UNIT
))
4064 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
4066 /* This isn't already where we want it on the stack, so put it there.
4067 This can either be done with push or copy insns. */
4068 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), NULL_RTX
,
4069 PARM_BOUNDARY
, partial
, reg
, used
- size
, argblock
,
4070 ARGS_SIZE_RTX (arg
->locate
.offset
), reg_parm_stack_space
,
4071 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
));
4073 /* Unless this is a partially-in-register argument, the argument is now
4076 arg
->value
= arg
->stack
;
4080 /* BLKmode, at least partly to be pushed. */
4082 unsigned int parm_align
;
4086 /* Pushing a nonscalar.
4087 If part is passed in registers, PARTIAL says how much
4088 and emit_push_insn will take care of putting it there. */
4090 /* Round its size up to a multiple
4091 of the allocation unit for arguments. */
4093 if (arg
->locate
.size
.var
!= 0)
4096 size_rtx
= ARGS_SIZE_RTX (arg
->locate
.size
);
4100 /* PUSH_ROUNDING has no effect on us, because
4101 emit_push_insn for BLKmode is careful to avoid it. */
4102 if (reg
&& GET_CODE (reg
) == PARALLEL
)
4104 /* Use the size of the elt to compute excess. */
4105 rtx elt
= XEXP (XVECEXP (reg
, 0, 0), 0);
4106 excess
= (arg
->locate
.size
.constant
4107 - int_size_in_bytes (TREE_TYPE (pval
))
4108 + partial
* GET_MODE_SIZE (GET_MODE (elt
)));
4111 excess
= (arg
->locate
.size
.constant
4112 - int_size_in_bytes (TREE_TYPE (pval
))
4113 + partial
* UNITS_PER_WORD
);
4114 size_rtx
= expand_expr (size_in_bytes (TREE_TYPE (pval
)),
4115 NULL_RTX
, TYPE_MODE (sizetype
), 0);
4118 /* Some types will require stricter alignment, which will be
4119 provided for elsewhere in argument layout. */
4120 parm_align
= MAX (PARM_BOUNDARY
, TYPE_ALIGN (TREE_TYPE (pval
)));
4122 /* When an argument is padded down, the block is aligned to
4123 PARM_BOUNDARY, but the actual argument isn't. */
4124 if (FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)) == downward
)
4126 if (arg
->locate
.size
.var
)
4127 parm_align
= BITS_PER_UNIT
;
4130 unsigned int excess_align
= (excess
& -excess
) * BITS_PER_UNIT
;
4131 parm_align
= MIN (parm_align
, excess_align
);
4135 if ((flags
& ECF_SIBCALL
) && MEM_P (arg
->value
))
4137 /* emit_push_insn might not work properly if arg->value and
4138 argblock + arg->locate.offset areas overlap. */
4142 if (XEXP (x
, 0) == current_function_internal_arg_pointer
4143 || (GET_CODE (XEXP (x
, 0)) == PLUS
4144 && XEXP (XEXP (x
, 0), 0) ==
4145 current_function_internal_arg_pointer
4146 && GET_CODE (XEXP (XEXP (x
, 0), 1)) == CONST_INT
))
4148 if (XEXP (x
, 0) != current_function_internal_arg_pointer
)
4149 i
= INTVAL (XEXP (XEXP (x
, 0), 1));
4151 /* expand_call should ensure this. */
4152 gcc_assert (!arg
->locate
.offset
.var
4153 && GET_CODE (size_rtx
) == CONST_INT
);
4155 if (arg
->locate
.offset
.constant
> i
)
4157 if (arg
->locate
.offset
.constant
< i
+ INTVAL (size_rtx
))
4158 sibcall_failure
= 1;
4160 else if (arg
->locate
.offset
.constant
< i
)
4162 if (i
< arg
->locate
.offset
.constant
+ INTVAL (size_rtx
))
4163 sibcall_failure
= 1;
4168 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), size_rtx
,
4169 parm_align
, partial
, reg
, excess
, argblock
,
4170 ARGS_SIZE_RTX (arg
->locate
.offset
), reg_parm_stack_space
,
4171 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
));
4173 /* Unless this is a partially-in-register argument, the argument is now
4176 ??? Unlike the case above, in which we want the actual
4177 address of the data, so that we can load it directly into a
4178 register, here we want the address of the stack slot, so that
4179 it's properly aligned for word-by-word copying or something
4180 like that. It's not clear that this is always correct. */
4182 arg
->value
= arg
->stack_slot
;
4185 if (arg
->reg
&& GET_CODE (arg
->reg
) == PARALLEL
)
4187 tree type
= TREE_TYPE (arg
->tree_value
);
4189 = emit_group_load_into_temps (arg
->reg
, arg
->value
, type
,
4190 int_size_in_bytes (type
));
4193 /* Mark all slots this store used. */
4194 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
)
4195 && argblock
&& ! variable_size
&& arg
->stack
)
4196 for (i
= lower_bound
; i
< upper_bound
; i
++)
4197 stack_usage_map
[i
] = 1;
4199 /* Once we have pushed something, pops can't safely
4200 be deferred during the rest of the arguments. */
4203 /* Free any temporary slots made in processing this argument. Show
4204 that we might have taken the address of something and pushed that
4206 preserve_temp_slots (NULL_RTX
);
4210 return sibcall_failure
;
4213 /* Nonzero if we do not know how to pass TYPE solely in registers. */
4216 must_pass_in_stack_var_size (enum machine_mode mode ATTRIBUTE_UNUSED
,
4222 /* If the type has variable size... */
4223 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4226 /* If the type is marked as addressable (it is required
4227 to be constructed into the stack)... */
4228 if (TREE_ADDRESSABLE (type
))
4234 /* Another version of the TARGET_MUST_PASS_IN_STACK hook. This one
4235 takes trailing padding of a structure into account. */
4236 /* ??? Should be able to merge these two by examining BLOCK_REG_PADDING. */
4239 must_pass_in_stack_var_size_or_pad (enum machine_mode mode
, tree type
)
4244 /* If the type has variable size... */
4245 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4248 /* If the type is marked as addressable (it is required
4249 to be constructed into the stack)... */
4250 if (TREE_ADDRESSABLE (type
))
4253 /* If the padding and mode of the type is such that a copy into
4254 a register would put it into the wrong part of the register. */
4256 && int_size_in_bytes (type
) % (PARM_BOUNDARY
/ BITS_PER_UNIT
)
4257 && (FUNCTION_ARG_PADDING (mode
, type
)
4258 == (BYTES_BIG_ENDIAN
? upward
: downward
)))