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 was promoted from the actual mode of the argument expression,
68 indicates whether the promotion is sign- or zero-extended. */
70 /* Number of registers to use. 0 means put the whole arg in registers.
71 Also 0 if not passed in registers. */
73 /* Nonzero if argument must be passed on stack.
74 Note that some arguments may be passed on the stack
75 even though pass_on_stack is zero, just because FUNCTION_ARG says so.
76 pass_on_stack identifies arguments that *cannot* go in registers. */
78 /* Some fields packaged up for locate_and_pad_parm. */
79 struct locate_and_pad_arg_data locate
;
80 /* Location on the stack at which parameter should be stored. The store
81 has already been done if STACK == VALUE. */
83 /* Location on the stack of the start of this argument slot. This can
84 differ from STACK if this arg pads downward. This location is known
85 to be aligned to FUNCTION_ARG_BOUNDARY. */
87 /* Place that this stack area has been saved, if needed. */
89 /* If an argument's alignment does not permit direct copying into registers,
90 copy in smaller-sized pieces into pseudos. These are stored in a
91 block pointed to by this field. The next field says how many
92 word-sized pseudos we made. */
97 /* A vector of one char per byte of stack space. A byte if nonzero if
98 the corresponding stack location has been used.
99 This vector is used to prevent a function call within an argument from
100 clobbering any stack already set up. */
101 static char *stack_usage_map
;
103 /* Size of STACK_USAGE_MAP. */
104 static int highest_outgoing_arg_in_use
;
106 /* A bitmap of virtual-incoming stack space. Bit is set if the corresponding
107 stack location's tail call argument has been already stored into the stack.
108 This bitmap is used to prevent sibling call optimization if function tries
109 to use parent's incoming argument slots when they have been already
110 overwritten with tail call arguments. */
111 static sbitmap stored_args_map
;
113 /* stack_arg_under_construction is nonzero when an argument may be
114 initialized with a constructor call (including a C function that
115 returns a BLKmode struct) and expand_call must take special action
116 to make sure the object being constructed does not overlap the
117 argument list for the constructor call. */
118 int stack_arg_under_construction
;
120 static int calls_function (tree
, int);
121 static int calls_function_1 (tree
, int);
123 static void emit_call_1 (rtx
, 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 rtx
try_to_integrate (tree
, tree
, rtx
, int, tree
, rtx
);
146 static int check_sibcall_argument_overlap_1 (rtx
);
147 static int check_sibcall_argument_overlap (rtx
, struct arg_data
*, int);
149 static int combine_pending_stack_adjustment_and_call (int, struct args_size
*,
151 static tree
fix_unsafe_tree (tree
);
152 static bool shift_returned_value (tree
, rtx
*);
154 #ifdef REG_PARM_STACK_SPACE
155 static rtx
save_fixed_argument_area (int, rtx
, int *, int *);
156 static void restore_fixed_argument_area (rtx
, rtx
, int, int);
159 /* If WHICH is 1, return 1 if EXP contains a call to the built-in function
162 If WHICH is 0, return 1 if EXP contains a call to any function.
163 Actually, we only need return 1 if evaluating EXP would require pushing
164 arguments on the stack, but that is too difficult to compute, so we just
165 assume any function call might require the stack. */
167 static tree calls_function_save_exprs
;
170 calls_function (tree exp
, int which
)
174 calls_function_save_exprs
= 0;
175 val
= calls_function_1 (exp
, which
);
176 calls_function_save_exprs
= 0;
180 /* Recursive function to do the work of above function. */
183 calls_function_1 (tree exp
, int which
)
186 enum tree_code code
= TREE_CODE (exp
);
187 int class = TREE_CODE_CLASS (code
);
188 int length
= first_rtl_op (code
);
190 /* If this code is language-specific, we don't know what it will do. */
191 if ((int) code
>= NUM_TREE_CODES
)
199 else if ((TREE_CODE (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))))
201 && (TYPE_RETURNS_STACK_DEPRESSED
202 (TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0))))))
204 else if (TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
205 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
207 && (special_function_p (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
209 & ECF_MAY_BE_ALLOCA
))
218 for (tem
= CONSTRUCTOR_ELTS (exp
); tem
!= 0; tem
= TREE_CHAIN (tem
))
219 if (calls_function_1 (TREE_VALUE (tem
), which
))
226 if (SAVE_EXPR_RTL (exp
) != 0)
228 if (value_member (exp
, calls_function_save_exprs
))
230 calls_function_save_exprs
= tree_cons (NULL_TREE
, exp
,
231 calls_function_save_exprs
);
232 return (TREE_OPERAND (exp
, 0) != 0
233 && calls_function_1 (TREE_OPERAND (exp
, 0), which
));
240 for (local
= BLOCK_VARS (exp
); local
; local
= TREE_CHAIN (local
))
241 if (DECL_INITIAL (local
) != 0
242 && calls_function_1 (DECL_INITIAL (local
), which
))
245 for (subblock
= BLOCK_SUBBLOCKS (exp
);
247 subblock
= TREE_CHAIN (subblock
))
248 if (calls_function_1 (subblock
, which
))
254 for (; exp
!= 0; exp
= TREE_CHAIN (exp
))
255 if (calls_function_1 (TREE_VALUE (exp
), which
))
263 /* Only expressions and blocks can contain calls. */
264 if (! IS_EXPR_CODE_CLASS (class) && class != 'b')
267 for (i
= 0; i
< length
; i
++)
268 if (TREE_OPERAND (exp
, i
) != 0
269 && calls_function_1 (TREE_OPERAND (exp
, i
), which
))
275 /* Force FUNEXP into a form suitable for the address of a CALL,
276 and return that as an rtx. Also load the static chain register
277 if FNDECL is a nested function.
279 CALL_FUSAGE points to a variable holding the prospective
280 CALL_INSN_FUNCTION_USAGE information. */
283 prepare_call_address (rtx funexp
, tree fndecl
, rtx
*call_fusage
,
284 int reg_parm_seen
, int sibcallp
)
286 rtx static_chain_value
= 0;
288 funexp
= protect_from_queue (funexp
, 0);
291 /* Get possible static chain value for nested function in C. */
292 static_chain_value
= lookup_static_chain (fndecl
);
294 /* Make a valid memory address and copy constants through pseudo-regs,
295 but not for a constant address if -fno-function-cse. */
296 if (GET_CODE (funexp
) != SYMBOL_REF
)
297 /* If we are using registers for parameters, force the
298 function address into a register now. */
299 funexp
= ((SMALL_REGISTER_CLASSES
&& reg_parm_seen
)
300 ? force_not_mem (memory_address (FUNCTION_MODE
, funexp
))
301 : memory_address (FUNCTION_MODE
, funexp
));
304 #ifndef NO_FUNCTION_CSE
305 if (optimize
&& ! flag_no_function_cse
)
306 #ifdef NO_RECURSIVE_FUNCTION_CSE
307 if (fndecl
!= current_function_decl
)
309 funexp
= force_reg (Pmode
, funexp
);
313 if (static_chain_value
!= 0)
315 emit_move_insn (static_chain_rtx
, static_chain_value
);
317 if (GET_CODE (static_chain_rtx
) == REG
)
318 use_reg (call_fusage
, static_chain_rtx
);
324 /* Generate instructions to call function FUNEXP,
325 and optionally pop the results.
326 The CALL_INSN is the first insn generated.
328 FNDECL is the declaration node of the function. This is given to the
329 macro RETURN_POPS_ARGS to determine whether this function pops its own args.
331 FUNTYPE is the data type of the function. This is given to the macro
332 RETURN_POPS_ARGS to determine whether this function pops its own args.
333 We used to allow an identifier for library functions, but that doesn't
334 work when the return type is an aggregate type and the calling convention
335 says that the pointer to this aggregate is to be popped by the callee.
337 STACK_SIZE is the number of bytes of arguments on the stack,
338 ROUNDED_STACK_SIZE is that number rounded up to
339 PREFERRED_STACK_BOUNDARY; zero if the size is variable. This is
340 both to put into the call insn and to generate explicit popping
343 STRUCT_VALUE_SIZE is the number of bytes wanted in a structure value.
344 It is zero if this call doesn't want a structure value.
346 NEXT_ARG_REG is the rtx that results from executing
347 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1)
348 just after all the args have had their registers assigned.
349 This could be whatever you like, but normally it is the first
350 arg-register beyond those used for args in this call,
351 or 0 if all the arg-registers are used in this call.
352 It is passed on to `gen_call' so you can put this info in the call insn.
354 VALREG is a hard register in which a value is returned,
355 or 0 if the call does not return a value.
357 OLD_INHIBIT_DEFER_POP is the value that `inhibit_defer_pop' had before
358 the args to this call were processed.
359 We restore `inhibit_defer_pop' to that value.
361 CALL_FUSAGE is either empty or an EXPR_LIST of USE expressions that
362 denote registers used by the called function. */
365 emit_call_1 (rtx funexp
, tree fndecl ATTRIBUTE_UNUSED
, tree funtype ATTRIBUTE_UNUSED
,
366 HOST_WIDE_INT stack_size ATTRIBUTE_UNUSED
,
367 HOST_WIDE_INT rounded_stack_size
,
368 HOST_WIDE_INT struct_value_size ATTRIBUTE_UNUSED
,
369 rtx next_arg_reg ATTRIBUTE_UNUSED
, rtx valreg
,
370 int old_inhibit_defer_pop
, rtx call_fusage
, int ecf_flags
,
371 CUMULATIVE_ARGS
*args_so_far ATTRIBUTE_UNUSED
)
373 rtx rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
375 int already_popped
= 0;
376 HOST_WIDE_INT n_popped
= RETURN_POPS_ARGS (fndecl
, funtype
, stack_size
);
377 #if defined (HAVE_call) && defined (HAVE_call_value)
378 rtx struct_value_size_rtx
;
379 struct_value_size_rtx
= GEN_INT (struct_value_size
);
382 #ifdef CALL_POPS_ARGS
383 n_popped
+= CALL_POPS_ARGS (* args_so_far
);
386 /* Ensure address is valid. SYMBOL_REF is already valid, so no need,
387 and we don't want to load it into a register as an optimization,
388 because prepare_call_address already did it if it should be done. */
389 if (GET_CODE (funexp
) != SYMBOL_REF
)
390 funexp
= memory_address (FUNCTION_MODE
, funexp
);
392 #if defined (HAVE_sibcall_pop) && defined (HAVE_sibcall_value_pop)
393 if ((ecf_flags
& ECF_SIBCALL
)
394 && HAVE_sibcall_pop
&& HAVE_sibcall_value_pop
395 && (n_popped
> 0 || stack_size
== 0))
397 rtx n_pop
= GEN_INT (n_popped
);
400 /* If this subroutine pops its own args, record that in the call insn
401 if possible, for the sake of frame pointer elimination. */
404 pat
= GEN_SIBCALL_VALUE_POP (valreg
,
405 gen_rtx_MEM (FUNCTION_MODE
, funexp
),
406 rounded_stack_size_rtx
, next_arg_reg
,
409 pat
= GEN_SIBCALL_POP (gen_rtx_MEM (FUNCTION_MODE
, funexp
),
410 rounded_stack_size_rtx
, next_arg_reg
, n_pop
);
412 emit_call_insn (pat
);
418 #if defined (HAVE_call_pop) && defined (HAVE_call_value_pop)
419 /* If the target has "call" or "call_value" insns, then prefer them
420 if no arguments are actually popped. If the target does not have
421 "call" or "call_value" insns, then we must use the popping versions
422 even if the call has no arguments to pop. */
423 #if defined (HAVE_call) && defined (HAVE_call_value)
424 if (HAVE_call
&& HAVE_call_value
&& HAVE_call_pop
&& HAVE_call_value_pop
425 && n_popped
> 0 && ! (ecf_flags
& ECF_SP_DEPRESSED
))
427 if (HAVE_call_pop
&& HAVE_call_value_pop
)
430 rtx n_pop
= GEN_INT (n_popped
);
433 /* If this subroutine pops its own args, record that in the call insn
434 if possible, for the sake of frame pointer elimination. */
437 pat
= GEN_CALL_VALUE_POP (valreg
,
438 gen_rtx_MEM (FUNCTION_MODE
, funexp
),
439 rounded_stack_size_rtx
, next_arg_reg
, n_pop
);
441 pat
= GEN_CALL_POP (gen_rtx_MEM (FUNCTION_MODE
, funexp
),
442 rounded_stack_size_rtx
, next_arg_reg
, n_pop
);
444 emit_call_insn (pat
);
450 #if defined (HAVE_sibcall) && defined (HAVE_sibcall_value)
451 if ((ecf_flags
& ECF_SIBCALL
)
452 && HAVE_sibcall
&& HAVE_sibcall_value
)
455 emit_call_insn (GEN_SIBCALL_VALUE (valreg
,
456 gen_rtx_MEM (FUNCTION_MODE
, funexp
),
457 rounded_stack_size_rtx
,
458 next_arg_reg
, NULL_RTX
));
460 emit_call_insn (GEN_SIBCALL (gen_rtx_MEM (FUNCTION_MODE
, funexp
),
461 rounded_stack_size_rtx
, next_arg_reg
,
462 struct_value_size_rtx
));
467 #if defined (HAVE_call) && defined (HAVE_call_value)
468 if (HAVE_call
&& HAVE_call_value
)
471 emit_call_insn (GEN_CALL_VALUE (valreg
,
472 gen_rtx_MEM (FUNCTION_MODE
, funexp
),
473 rounded_stack_size_rtx
, next_arg_reg
,
476 emit_call_insn (GEN_CALL (gen_rtx_MEM (FUNCTION_MODE
, funexp
),
477 rounded_stack_size_rtx
, next_arg_reg
,
478 struct_value_size_rtx
));
484 /* Find the call we just emitted. */
485 call_insn
= last_call_insn ();
487 /* Mark memory as used for "pure" function call. */
488 if (ecf_flags
& ECF_PURE
)
492 gen_rtx_USE (VOIDmode
,
493 gen_rtx_MEM (BLKmode
, gen_rtx_SCRATCH (VOIDmode
))),
496 /* Put the register usage information there. */
497 add_function_usage_to (call_insn
, call_fusage
);
499 /* If this is a const call, then set the insn's unchanging bit. */
500 if (ecf_flags
& (ECF_CONST
| ECF_PURE
))
501 CONST_OR_PURE_CALL_P (call_insn
) = 1;
503 /* If this call can't throw, attach a REG_EH_REGION reg note to that
505 if (ecf_flags
& ECF_NOTHROW
)
506 REG_NOTES (call_insn
) = gen_rtx_EXPR_LIST (REG_EH_REGION
, const0_rtx
,
507 REG_NOTES (call_insn
));
509 note_eh_region_may_contain_throw ();
511 if (ecf_flags
& ECF_NORETURN
)
512 REG_NOTES (call_insn
) = gen_rtx_EXPR_LIST (REG_NORETURN
, const0_rtx
,
513 REG_NOTES (call_insn
));
514 if (ecf_flags
& ECF_ALWAYS_RETURN
)
515 REG_NOTES (call_insn
) = gen_rtx_EXPR_LIST (REG_ALWAYS_RETURN
, const0_rtx
,
516 REG_NOTES (call_insn
));
518 if (ecf_flags
& ECF_RETURNS_TWICE
)
520 REG_NOTES (call_insn
) = gen_rtx_EXPR_LIST (REG_SETJMP
, const0_rtx
,
521 REG_NOTES (call_insn
));
522 current_function_calls_setjmp
= 1;
525 SIBLING_CALL_P (call_insn
) = ((ecf_flags
& ECF_SIBCALL
) != 0);
527 /* Restore this now, so that we do defer pops for this call's args
528 if the context of the call as a whole permits. */
529 inhibit_defer_pop
= old_inhibit_defer_pop
;
534 CALL_INSN_FUNCTION_USAGE (call_insn
)
535 = gen_rtx_EXPR_LIST (VOIDmode
,
536 gen_rtx_CLOBBER (VOIDmode
, stack_pointer_rtx
),
537 CALL_INSN_FUNCTION_USAGE (call_insn
));
538 rounded_stack_size
-= n_popped
;
539 rounded_stack_size_rtx
= GEN_INT (rounded_stack_size
);
540 stack_pointer_delta
-= n_popped
;
543 if (!ACCUMULATE_OUTGOING_ARGS
)
545 /* If returning from the subroutine does not automatically pop the args,
546 we need an instruction to pop them sooner or later.
547 Perhaps do it now; perhaps just record how much space to pop later.
549 If returning from the subroutine does pop the args, indicate that the
550 stack pointer will be changed. */
552 if (rounded_stack_size
!= 0)
554 if (ecf_flags
& (ECF_SP_DEPRESSED
| ECF_NORETURN
| ECF_LONGJMP
))
555 /* Just pretend we did the pop. */
556 stack_pointer_delta
-= rounded_stack_size
;
557 else if (flag_defer_pop
&& inhibit_defer_pop
== 0
558 && ! (ecf_flags
& (ECF_CONST
| ECF_PURE
)))
559 pending_stack_adjust
+= rounded_stack_size
;
561 adjust_stack (rounded_stack_size_rtx
);
564 /* When we accumulate outgoing args, we must avoid any stack manipulations.
565 Restore the stack pointer to its original value now. Usually
566 ACCUMULATE_OUTGOING_ARGS targets don't get here, but there are exceptions.
567 On i386 ACCUMULATE_OUTGOING_ARGS can be enabled on demand, and
568 popping variants of functions exist as well.
570 ??? We may optimize similar to defer_pop above, but it is
571 probably not worthwhile.
573 ??? It will be worthwhile to enable combine_stack_adjustments even for
576 anti_adjust_stack (GEN_INT (n_popped
));
579 /* Determine if the function identified by NAME and FNDECL is one with
580 special properties we wish to know about.
582 For example, if the function might return more than one time (setjmp), then
583 set RETURNS_TWICE to a nonzero value.
585 Similarly set LONGJMP for if the function is in the longjmp family.
587 Set MAY_BE_ALLOCA for any memory allocation function that might allocate
588 space from the stack such as alloca. */
591 special_function_p (tree fndecl
, int flags
)
593 if (! (flags
& ECF_MALLOC
)
594 && fndecl
&& DECL_NAME (fndecl
)
595 && IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) <= 17
596 /* Exclude functions not at the file scope, or not `extern',
597 since they are not the magic functions we would otherwise
599 FIXME: this should be handled with attributes, not with this
600 hacky imitation of DECL_ASSEMBLER_NAME. It's (also) wrong
601 because you can declare fork() inside a function if you
603 && (DECL_CONTEXT (fndecl
) == NULL_TREE
604 || TREE_CODE (DECL_CONTEXT (fndecl
)) == TRANSLATION_UNIT_DECL
)
605 && TREE_PUBLIC (fndecl
))
607 const char *name
= IDENTIFIER_POINTER (DECL_NAME (fndecl
));
608 const char *tname
= name
;
610 /* We assume that alloca will always be called by name. It
611 makes no sense to pass it as a pointer-to-function to
612 anything that does not understand its behavior. */
613 if (((IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 6
615 && ! strcmp (name
, "alloca"))
616 || (IDENTIFIER_LENGTH (DECL_NAME (fndecl
)) == 16
618 && ! strcmp (name
, "__builtin_alloca"))))
619 flags
|= ECF_MAY_BE_ALLOCA
;
621 /* Disregard prefix _, __ or __x. */
624 if (name
[1] == '_' && name
[2] == 'x')
626 else if (name
[1] == '_')
635 && (! strcmp (tname
, "setjmp")
636 || ! strcmp (tname
, "setjmp_syscall")))
638 && ! strcmp (tname
, "sigsetjmp"))
640 && ! strcmp (tname
, "savectx")))
641 flags
|= ECF_RETURNS_TWICE
;
644 && ! strcmp (tname
, "siglongjmp"))
645 flags
|= ECF_LONGJMP
;
647 else if ((tname
[0] == 'q' && tname
[1] == 's'
648 && ! strcmp (tname
, "qsetjmp"))
649 || (tname
[0] == 'v' && tname
[1] == 'f'
650 && ! strcmp (tname
, "vfork")))
651 flags
|= ECF_RETURNS_TWICE
;
653 else if (tname
[0] == 'l' && tname
[1] == 'o'
654 && ! strcmp (tname
, "longjmp"))
655 flags
|= ECF_LONGJMP
;
657 else if ((tname
[0] == 'f' && tname
[1] == 'o'
658 && ! strcmp (tname
, "fork"))
659 /* Linux specific: __clone. check NAME to insist on the
660 leading underscores, to avoid polluting the ISO / POSIX
662 || (name
[0] == '_' && name
[1] == '_'
663 && ! strcmp (tname
, "clone"))
664 || (tname
[0] == 'e' && tname
[1] == 'x' && tname
[2] == 'e'
665 && tname
[3] == 'c' && (tname
[4] == 'l' || tname
[4] == 'v')
667 || ((tname
[5] == 'p' || tname
[5] == 'e')
668 && tname
[6] == '\0'))))
669 flags
|= ECF_FORK_OR_EXEC
;
674 /* Return nonzero when tree represent call to longjmp. */
677 setjmp_call_p (tree fndecl
)
679 return special_function_p (fndecl
, 0) & ECF_RETURNS_TWICE
;
682 /* Return true when exp contains alloca call. */
684 alloca_call_p (tree exp
)
686 if (TREE_CODE (exp
) == CALL_EXPR
687 && TREE_CODE (TREE_OPERAND (exp
, 0)) == ADDR_EXPR
688 && (TREE_CODE (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0))
690 && (special_function_p (TREE_OPERAND (TREE_OPERAND (exp
, 0), 0),
691 0) & ECF_MAY_BE_ALLOCA
))
696 /* Detect flags (function attributes) from the function decl or type node. */
699 flags_from_decl_or_type (tree exp
)
706 struct cgraph_rtl_info
*i
= cgraph_rtl_info (exp
);
707 type
= TREE_TYPE (exp
);
711 if (i
->pure_function
)
712 flags
|= ECF_PURE
| ECF_LIBCALL_BLOCK
;
713 if (i
->const_function
)
714 flags
|= ECF_CONST
| ECF_LIBCALL_BLOCK
;
717 /* The function exp may have the `malloc' attribute. */
718 if (DECL_IS_MALLOC (exp
))
721 /* The function exp may have the `pure' attribute. */
722 if (DECL_IS_PURE (exp
))
723 flags
|= ECF_PURE
| ECF_LIBCALL_BLOCK
;
725 if (TREE_NOTHROW (exp
))
726 flags
|= ECF_NOTHROW
;
728 if (TREE_READONLY (exp
) && ! TREE_THIS_VOLATILE (exp
))
729 flags
|= ECF_LIBCALL_BLOCK
;
732 if (TREE_READONLY (exp
) && ! TREE_THIS_VOLATILE (exp
))
735 if (TREE_THIS_VOLATILE (exp
))
736 flags
|= ECF_NORETURN
;
738 /* Mark if the function returns with the stack pointer depressed. We
739 cannot consider it pure or constant in that case. */
740 if (TREE_CODE (type
) == FUNCTION_TYPE
&& TYPE_RETURNS_STACK_DEPRESSED (type
))
742 flags
|= ECF_SP_DEPRESSED
;
743 flags
&= ~(ECF_PURE
| ECF_CONST
| ECF_LIBCALL_BLOCK
);
749 /* Detect flags from a CALL_EXPR. */
752 call_expr_flags (tree t
)
755 tree decl
= get_callee_fndecl (t
);
758 flags
= flags_from_decl_or_type (decl
);
761 t
= TREE_TYPE (TREE_OPERAND (t
, 0));
762 if (t
&& TREE_CODE (t
) == POINTER_TYPE
)
763 flags
= flags_from_decl_or_type (TREE_TYPE (t
));
771 /* Precompute all register parameters as described by ARGS, storing values
772 into fields within the ARGS array.
774 NUM_ACTUALS indicates the total number elements in the ARGS array.
776 Set REG_PARM_SEEN if we encounter a register parameter. */
779 precompute_register_parameters (int num_actuals
, struct arg_data
*args
, int *reg_parm_seen
)
785 for (i
= 0; i
< num_actuals
; i
++)
786 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
)
790 if (args
[i
].value
== 0)
793 args
[i
].value
= expand_expr (args
[i
].tree_value
, NULL_RTX
,
795 preserve_temp_slots (args
[i
].value
);
798 /* ANSI doesn't require a sequence point here,
799 but PCC has one, so this will avoid some problems. */
803 /* If the value is a non-legitimate constant, force it into a
804 pseudo now. TLS symbols sometimes need a call to resolve. */
805 if (CONSTANT_P (args
[i
].value
)
806 && !LEGITIMATE_CONSTANT_P (args
[i
].value
))
807 args
[i
].value
= force_reg (args
[i
].mode
, args
[i
].value
);
809 /* If we are to promote the function arg to a wider mode,
812 if (args
[i
].mode
!= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)))
814 = convert_modes (args
[i
].mode
,
815 TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)),
816 args
[i
].value
, args
[i
].unsignedp
);
818 /* If the value is expensive, and we are inside an appropriately
819 short loop, put the value into a pseudo and then put the pseudo
822 For small register classes, also do this if this call uses
823 register parameters. This is to avoid reload conflicts while
824 loading the parameters registers. */
826 if ((! (GET_CODE (args
[i
].value
) == REG
827 || (GET_CODE (args
[i
].value
) == SUBREG
828 && GET_CODE (SUBREG_REG (args
[i
].value
)) == REG
)))
829 && args
[i
].mode
!= BLKmode
830 && rtx_cost (args
[i
].value
, SET
) > COSTS_N_INSNS (1)
831 && ((SMALL_REGISTER_CLASSES
&& *reg_parm_seen
)
832 || preserve_subexpressions_p ()))
833 args
[i
].value
= copy_to_mode_reg (args
[i
].mode
, args
[i
].value
);
837 #ifdef REG_PARM_STACK_SPACE
839 /* The argument list is the property of the called routine and it
840 may clobber it. If the fixed area has been used for previous
841 parameters, we must save and restore it. */
844 save_fixed_argument_area (int reg_parm_stack_space
, rtx argblock
, int *low_to_save
, int *high_to_save
)
849 /* Compute the boundary of the area that needs to be saved, if any. */
850 high
= reg_parm_stack_space
;
851 #ifdef ARGS_GROW_DOWNWARD
854 if (high
> highest_outgoing_arg_in_use
)
855 high
= highest_outgoing_arg_in_use
;
857 for (low
= 0; low
< high
; low
++)
858 if (stack_usage_map
[low
] != 0)
861 enum machine_mode save_mode
;
866 while (stack_usage_map
[--high
] == 0)
870 *high_to_save
= high
;
872 num_to_save
= high
- low
+ 1;
873 save_mode
= mode_for_size (num_to_save
* BITS_PER_UNIT
, MODE_INT
, 1);
875 /* If we don't have the required alignment, must do this
877 if ((low
& (MIN (GET_MODE_SIZE (save_mode
),
878 BIGGEST_ALIGNMENT
/ UNITS_PER_WORD
) - 1)))
881 #ifdef ARGS_GROW_DOWNWARD
886 stack_area
= gen_rtx_MEM (save_mode
,
887 memory_address (save_mode
,
888 plus_constant (argblock
,
891 set_mem_align (stack_area
, PARM_BOUNDARY
);
892 if (save_mode
== BLKmode
)
894 save_area
= assign_stack_temp (BLKmode
, num_to_save
, 0);
895 emit_block_move (validize_mem (save_area
), stack_area
,
896 GEN_INT (num_to_save
), BLOCK_OP_CALL_PARM
);
900 save_area
= gen_reg_rtx (save_mode
);
901 emit_move_insn (save_area
, stack_area
);
911 restore_fixed_argument_area (rtx save_area
, rtx argblock
, int high_to_save
, int low_to_save
)
913 enum machine_mode save_mode
= GET_MODE (save_area
);
917 #ifdef ARGS_GROW_DOWNWARD
918 delta
= -high_to_save
;
922 stack_area
= gen_rtx_MEM (save_mode
,
923 memory_address (save_mode
,
924 plus_constant (argblock
, delta
)));
925 set_mem_align (stack_area
, PARM_BOUNDARY
);
927 if (save_mode
!= BLKmode
)
928 emit_move_insn (stack_area
, save_area
);
930 emit_block_move (stack_area
, validize_mem (save_area
),
931 GEN_INT (high_to_save
- low_to_save
+ 1),
934 #endif /* REG_PARM_STACK_SPACE */
936 /* If any elements in ARGS refer to parameters that are to be passed in
937 registers, but not in memory, and whose alignment does not permit a
938 direct copy into registers. Copy the values into a group of pseudos
939 which we will later copy into the appropriate hard registers.
941 Pseudos for each unaligned argument will be stored into the array
942 args[argnum].aligned_regs. The caller is responsible for deallocating
943 the aligned_regs array if it is nonzero. */
946 store_unaligned_arguments_into_pseudos (struct arg_data
*args
, int num_actuals
)
950 for (i
= 0; i
< num_actuals
; i
++)
951 if (args
[i
].reg
!= 0 && ! args
[i
].pass_on_stack
952 && args
[i
].mode
== BLKmode
953 && (TYPE_ALIGN (TREE_TYPE (args
[i
].tree_value
))
954 < (unsigned int) MIN (BIGGEST_ALIGNMENT
, BITS_PER_WORD
)))
956 int bytes
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
957 int nregs
= (bytes
+ UNITS_PER_WORD
- 1) / UNITS_PER_WORD
;
958 int endian_correction
= 0;
960 args
[i
].n_aligned_regs
= args
[i
].partial
? args
[i
].partial
: nregs
;
961 args
[i
].aligned_regs
= xmalloc (sizeof (rtx
) * args
[i
].n_aligned_regs
);
963 /* Structures smaller than a word are normally aligned to the
964 least significant byte. On a BYTES_BIG_ENDIAN machine,
965 this means we must skip the empty high order bytes when
966 calculating the bit offset. */
967 if (bytes
< UNITS_PER_WORD
968 #ifdef BLOCK_REG_PADDING
969 && (BLOCK_REG_PADDING (args
[i
].mode
,
970 TREE_TYPE (args
[i
].tree_value
), 1)
976 endian_correction
= BITS_PER_WORD
- bytes
* BITS_PER_UNIT
;
978 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
980 rtx reg
= gen_reg_rtx (word_mode
);
981 rtx word
= operand_subword_force (args
[i
].value
, j
, BLKmode
);
982 int bitsize
= MIN (bytes
* BITS_PER_UNIT
, BITS_PER_WORD
);
984 args
[i
].aligned_regs
[j
] = reg
;
985 word
= extract_bit_field (word
, bitsize
, 0, 1, NULL_RTX
,
986 word_mode
, word_mode
, BITS_PER_WORD
);
988 /* There is no need to restrict this code to loading items
989 in TYPE_ALIGN sized hunks. The bitfield instructions can
990 load up entire word sized registers efficiently.
992 ??? This may not be needed anymore.
993 We use to emit a clobber here but that doesn't let later
994 passes optimize the instructions we emit. By storing 0 into
995 the register later passes know the first AND to zero out the
996 bitfield being set in the register is unnecessary. The store
997 of 0 will be deleted as will at least the first AND. */
999 emit_move_insn (reg
, const0_rtx
);
1001 bytes
-= bitsize
/ BITS_PER_UNIT
;
1002 store_bit_field (reg
, bitsize
, endian_correction
, word_mode
,
1003 word
, BITS_PER_WORD
);
1008 /* Fill in ARGS_SIZE and ARGS array based on the parameters found in
1011 NUM_ACTUALS is the total number of parameters.
1013 N_NAMED_ARGS is the total number of named arguments.
1015 FNDECL is the tree code for the target of this call (if known)
1017 ARGS_SO_FAR holds state needed by the target to know where to place
1020 REG_PARM_STACK_SPACE is the number of bytes of stack space reserved
1021 for arguments which are passed in registers.
1023 OLD_STACK_LEVEL is a pointer to an rtx which olds the old stack level
1024 and may be modified by this routine.
1026 OLD_PENDING_ADJ, MUST_PREALLOCATE and FLAGS are pointers to integer
1027 flags which may may be modified by this routine.
1029 CALL_FROM_THUNK_P is true if this call is the jump from a thunk to
1030 the thunked-to function. */
1033 initialize_argument_information (int num_actuals ATTRIBUTE_UNUSED
,
1034 struct arg_data
*args
,
1035 struct args_size
*args_size
,
1036 int n_named_args ATTRIBUTE_UNUSED
,
1037 tree actparms
, tree fndecl
,
1038 CUMULATIVE_ARGS
*args_so_far
,
1039 int reg_parm_stack_space
,
1040 rtx
*old_stack_level
, int *old_pending_adj
,
1041 int *must_preallocate
, int *ecf_flags
,
1042 bool call_from_thunk_p
)
1044 /* 1 if scanning parms front to back, -1 if scanning back to front. */
1047 /* Count arg position in order args appear. */
1053 args_size
->constant
= 0;
1056 /* In this loop, we consider args in the order they are written.
1057 We fill up ARGS from the front or from the back if necessary
1058 so that in any case the first arg to be pushed ends up at the front. */
1060 if (PUSH_ARGS_REVERSED
)
1062 i
= num_actuals
- 1, inc
= -1;
1063 /* In this case, must reverse order of args
1064 so that we compute and push the last arg first. */
1071 /* I counts args in order (to be) pushed; ARGPOS counts in order written. */
1072 for (p
= actparms
, argpos
= 0; p
; p
= TREE_CHAIN (p
), i
+= inc
, argpos
++)
1074 tree type
= TREE_TYPE (TREE_VALUE (p
));
1076 enum machine_mode mode
;
1078 args
[i
].tree_value
= TREE_VALUE (p
);
1080 /* Replace erroneous argument with constant zero. */
1081 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
1082 args
[i
].tree_value
= integer_zero_node
, type
= integer_type_node
;
1084 /* If TYPE is a transparent union, pass things the way we would
1085 pass the first field of the union. We have already verified that
1086 the modes are the same. */
1087 if (TREE_CODE (type
) == UNION_TYPE
&& TYPE_TRANSPARENT_UNION (type
))
1088 type
= TREE_TYPE (TYPE_FIELDS (type
));
1090 /* Decide where to pass this arg.
1092 args[i].reg is nonzero if all or part is passed in registers.
1094 args[i].partial is nonzero if part but not all is passed in registers,
1095 and the exact value says how many words are passed in registers.
1097 args[i].pass_on_stack is nonzero if the argument must at least be
1098 computed on the stack. It may then be loaded back into registers
1099 if args[i].reg is nonzero.
1101 These decisions are driven by the FUNCTION_... macros and must agree
1102 with those made by function.c. */
1104 /* See if this argument should be passed by invisible reference. */
1105 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
1106 || TREE_ADDRESSABLE (type
)
1107 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
1108 || FUNCTION_ARG_PASS_BY_REFERENCE (*args_so_far
, TYPE_MODE (type
),
1109 type
, argpos
< n_named_args
)
1113 /* If we're compiling a thunk, pass through invisible
1114 references instead of making a copy. */
1115 if (call_from_thunk_p
1116 #ifdef FUNCTION_ARG_CALLEE_COPIES
1117 || (FUNCTION_ARG_CALLEE_COPIES (*args_so_far
, TYPE_MODE (type
),
1118 type
, argpos
< n_named_args
)
1119 /* If it's in a register, we must make a copy of it too. */
1120 /* ??? Is this a sufficient test? Is there a better one? */
1121 && !(TREE_CODE (args
[i
].tree_value
) == VAR_DECL
1122 && REG_P (DECL_RTL (args
[i
].tree_value
)))
1123 && ! TREE_ADDRESSABLE (type
))
1127 /* C++ uses a TARGET_EXPR to indicate that we want to make a
1128 new object from the argument. If we are passing by
1129 invisible reference, the callee will do that for us, so we
1130 can strip off the TARGET_EXPR. This is not always safe,
1131 but it is safe in the only case where this is a useful
1132 optimization; namely, when the argument is a plain object.
1133 In that case, the frontend is just asking the backend to
1134 make a bitwise copy of the argument. */
1136 if (TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
1137 && (DECL_P (TREE_OPERAND (args
[i
].tree_value
, 1)))
1138 && ! REG_P (DECL_RTL (TREE_OPERAND (args
[i
].tree_value
, 1))))
1139 args
[i
].tree_value
= TREE_OPERAND (args
[i
].tree_value
, 1);
1141 args
[i
].tree_value
= build1 (ADDR_EXPR
,
1142 build_pointer_type (type
),
1143 args
[i
].tree_value
);
1144 type
= build_pointer_type (type
);
1146 else if (TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
)
1148 /* In the V3 C++ ABI, parameters are destroyed in the caller.
1149 We implement this by passing the address of the temporary
1150 rather than expanding it into another allocated slot. */
1151 args
[i
].tree_value
= build1 (ADDR_EXPR
,
1152 build_pointer_type (type
),
1153 args
[i
].tree_value
);
1154 type
= build_pointer_type (type
);
1158 /* We make a copy of the object and pass the address to the
1159 function being called. */
1162 if (!COMPLETE_TYPE_P (type
)
1163 || TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
1164 || (flag_stack_check
&& ! STACK_CHECK_BUILTIN
1165 && (0 < compare_tree_int (TYPE_SIZE_UNIT (type
),
1166 STACK_CHECK_MAX_VAR_SIZE
))))
1168 /* This is a variable-sized object. Make space on the stack
1170 rtx size_rtx
= expr_size (TREE_VALUE (p
));
1172 if (*old_stack_level
== 0)
1174 emit_stack_save (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
1175 *old_pending_adj
= pending_stack_adjust
;
1176 pending_stack_adjust
= 0;
1179 copy
= gen_rtx_MEM (BLKmode
,
1180 allocate_dynamic_stack_space
1181 (size_rtx
, NULL_RTX
, TYPE_ALIGN (type
)));
1182 set_mem_attributes (copy
, type
, 1);
1185 copy
= assign_temp (type
, 0, 1, 0);
1187 store_expr (args
[i
].tree_value
, copy
, 0);
1188 *ecf_flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LIBCALL_BLOCK
);
1190 args
[i
].tree_value
= build1 (ADDR_EXPR
,
1191 build_pointer_type (type
),
1192 make_tree (type
, copy
));
1193 type
= build_pointer_type (type
);
1197 mode
= TYPE_MODE (type
);
1198 unsignedp
= TREE_UNSIGNED (type
);
1200 if (targetm
.calls
.promote_function_args (fndecl
? TREE_TYPE (fndecl
) : 0))
1201 mode
= promote_mode (type
, mode
, &unsignedp
, 1);
1203 args
[i
].unsignedp
= unsignedp
;
1204 args
[i
].mode
= mode
;
1206 args
[i
].reg
= FUNCTION_ARG (*args_so_far
, mode
, type
,
1207 argpos
< n_named_args
);
1208 #ifdef FUNCTION_INCOMING_ARG
1209 /* If this is a sibling call and the machine has register windows, the
1210 register window has to be unwinded before calling the routine, so
1211 arguments have to go into the incoming registers. */
1212 args
[i
].tail_call_reg
= FUNCTION_INCOMING_ARG (*args_so_far
, mode
, type
,
1213 argpos
< n_named_args
);
1215 args
[i
].tail_call_reg
= args
[i
].reg
;
1218 #ifdef FUNCTION_ARG_PARTIAL_NREGS
1221 = FUNCTION_ARG_PARTIAL_NREGS (*args_so_far
, mode
, type
,
1222 argpos
< n_named_args
);
1225 args
[i
].pass_on_stack
= MUST_PASS_IN_STACK (mode
, type
);
1227 /* If FUNCTION_ARG returned a (parallel [(expr_list (nil) ...) ...]),
1228 it means that we are to pass this arg in the register(s) designated
1229 by the PARALLEL, but also to pass it in the stack. */
1230 if (args
[i
].reg
&& GET_CODE (args
[i
].reg
) == PARALLEL
1231 && XEXP (XVECEXP (args
[i
].reg
, 0, 0), 0) == 0)
1232 args
[i
].pass_on_stack
= 1;
1234 /* If this is an addressable type, we must preallocate the stack
1235 since we must evaluate the object into its final location.
1237 If this is to be passed in both registers and the stack, it is simpler
1239 if (TREE_ADDRESSABLE (type
)
1240 || (args
[i
].pass_on_stack
&& args
[i
].reg
!= 0))
1241 *must_preallocate
= 1;
1243 /* If this is an addressable type, we cannot pre-evaluate it. Thus,
1244 we cannot consider this function call constant. */
1245 if (TREE_ADDRESSABLE (type
))
1246 *ecf_flags
&= ~ECF_LIBCALL_BLOCK
;
1248 /* Compute the stack-size of this argument. */
1249 if (args
[i
].reg
== 0 || args
[i
].partial
!= 0
1250 || reg_parm_stack_space
> 0
1251 || args
[i
].pass_on_stack
)
1252 locate_and_pad_parm (mode
, type
,
1253 #ifdef STACK_PARMS_IN_REG_PARM_AREA
1258 args
[i
].pass_on_stack
? 0 : args
[i
].partial
,
1259 fndecl
, args_size
, &args
[i
].locate
);
1260 #ifdef BLOCK_REG_PADDING
1262 /* The argument is passed entirely in registers. See at which
1263 end it should be padded. */
1264 args
[i
].locate
.where_pad
=
1265 BLOCK_REG_PADDING (mode
, type
,
1266 int_size_in_bytes (type
) <= UNITS_PER_WORD
);
1269 /* Update ARGS_SIZE, the total stack space for args so far. */
1271 args_size
->constant
+= args
[i
].locate
.size
.constant
;
1272 if (args
[i
].locate
.size
.var
)
1273 ADD_PARM_SIZE (*args_size
, args
[i
].locate
.size
.var
);
1275 /* Increment ARGS_SO_FAR, which has info about which arg-registers
1276 have been used, etc. */
1278 FUNCTION_ARG_ADVANCE (*args_so_far
, TYPE_MODE (type
), type
,
1279 argpos
< n_named_args
);
1283 /* Update ARGS_SIZE to contain the total size for the argument block.
1284 Return the original constant component of the argument block's size.
1286 REG_PARM_STACK_SPACE holds the number of bytes of stack space reserved
1287 for arguments passed in registers. */
1290 compute_argument_block_size (int reg_parm_stack_space
,
1291 struct args_size
*args_size
,
1292 int preferred_stack_boundary ATTRIBUTE_UNUSED
)
1294 int unadjusted_args_size
= args_size
->constant
;
1296 /* For accumulate outgoing args mode we don't need to align, since the frame
1297 will be already aligned. Align to STACK_BOUNDARY in order to prevent
1298 backends from generating misaligned frame sizes. */
1299 if (ACCUMULATE_OUTGOING_ARGS
&& preferred_stack_boundary
> STACK_BOUNDARY
)
1300 preferred_stack_boundary
= STACK_BOUNDARY
;
1302 /* Compute the actual size of the argument block required. The variable
1303 and constant sizes must be combined, the size may have to be rounded,
1304 and there may be a minimum required size. */
1308 args_size
->var
= ARGS_SIZE_TREE (*args_size
);
1309 args_size
->constant
= 0;
1311 preferred_stack_boundary
/= BITS_PER_UNIT
;
1312 if (preferred_stack_boundary
> 1)
1314 /* We don't handle this case yet. To handle it correctly we have
1315 to add the delta, round and subtract the delta.
1316 Currently no machine description requires this support. */
1317 if (stack_pointer_delta
& (preferred_stack_boundary
- 1))
1319 args_size
->var
= round_up (args_size
->var
, preferred_stack_boundary
);
1322 if (reg_parm_stack_space
> 0)
1325 = size_binop (MAX_EXPR
, args_size
->var
,
1326 ssize_int (reg_parm_stack_space
));
1328 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1329 /* The area corresponding to register parameters is not to count in
1330 the size of the block we need. So make the adjustment. */
1332 = size_binop (MINUS_EXPR
, args_size
->var
,
1333 ssize_int (reg_parm_stack_space
));
1339 preferred_stack_boundary
/= BITS_PER_UNIT
;
1340 if (preferred_stack_boundary
< 1)
1341 preferred_stack_boundary
= 1;
1342 args_size
->constant
= (((args_size
->constant
1343 + stack_pointer_delta
1344 + preferred_stack_boundary
- 1)
1345 / preferred_stack_boundary
1346 * preferred_stack_boundary
)
1347 - stack_pointer_delta
);
1349 args_size
->constant
= MAX (args_size
->constant
,
1350 reg_parm_stack_space
);
1352 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1353 args_size
->constant
-= reg_parm_stack_space
;
1356 return unadjusted_args_size
;
1359 /* Precompute parameters as needed for a function call.
1361 FLAGS is mask of ECF_* constants.
1363 NUM_ACTUALS is the number of arguments.
1365 ARGS is an array containing information for each argument; this
1366 routine fills in the INITIAL_VALUE and VALUE fields for each
1367 precomputed argument. */
1370 precompute_arguments (int flags
, int num_actuals
, struct arg_data
*args
)
1374 /* If this is a libcall, then precompute all arguments so that we do not
1375 get extraneous instructions emitted as part of the libcall sequence.
1377 If this target defines ACCUMULATE_OUTGOING_ARGS to true, then we must
1378 precompute all arguments that contain function calls. Otherwise,
1379 computing arguments for a subcall may clobber arguments for this call.
1381 If this target defines ACCUMULATE_OUTGOING_ARGS to false, then we only
1382 need to precompute arguments that change the stack pointer, such as calls
1383 to alloca, and calls that do not pop all of their arguments. */
1385 for (i
= 0; i
< num_actuals
; i
++)
1386 if ((flags
& ECF_LIBCALL_BLOCK
)
1387 || calls_function (args
[i
].tree_value
, !ACCUMULATE_OUTGOING_ARGS
))
1389 enum machine_mode mode
;
1391 /* If this is an addressable type, we cannot pre-evaluate it. */
1392 if (TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
)))
1396 = expand_expr (args
[i
].tree_value
, NULL_RTX
, VOIDmode
, 0);
1398 /* ANSI doesn't require a sequence point here,
1399 but PCC has one, so this will avoid some problems. */
1402 args
[i
].initial_value
= args
[i
].value
1403 = protect_from_queue (args
[i
].value
, 0);
1405 mode
= TYPE_MODE (TREE_TYPE (args
[i
].tree_value
));
1406 if (mode
!= args
[i
].mode
)
1409 = convert_modes (args
[i
].mode
, mode
,
1410 args
[i
].value
, args
[i
].unsignedp
);
1411 #ifdef PROMOTE_FOR_CALL_ONLY
1412 /* CSE will replace this only if it contains args[i].value
1413 pseudo, so convert it down to the declared mode using
1415 if (GET_CODE (args
[i
].value
) == REG
1416 && GET_MODE_CLASS (args
[i
].mode
) == MODE_INT
)
1418 args
[i
].initial_value
1419 = gen_lowpart_SUBREG (mode
, args
[i
].value
);
1420 SUBREG_PROMOTED_VAR_P (args
[i
].initial_value
) = 1;
1421 SUBREG_PROMOTED_UNSIGNED_SET (args
[i
].initial_value
,
1429 /* Given the current state of MUST_PREALLOCATE and information about
1430 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
1431 compute and return the final value for MUST_PREALLOCATE. */
1434 finalize_must_preallocate (int must_preallocate
, int num_actuals
, struct arg_data
*args
, struct args_size
*args_size
)
1436 /* See if we have or want to preallocate stack space.
1438 If we would have to push a partially-in-regs parm
1439 before other stack parms, preallocate stack space instead.
1441 If the size of some parm is not a multiple of the required stack
1442 alignment, we must preallocate.
1444 If the total size of arguments that would otherwise create a copy in
1445 a temporary (such as a CALL) is more than half the total argument list
1446 size, preallocation is faster.
1448 Another reason to preallocate is if we have a machine (like the m88k)
1449 where stack alignment is required to be maintained between every
1450 pair of insns, not just when the call is made. However, we assume here
1451 that such machines either do not have push insns (and hence preallocation
1452 would occur anyway) or the problem is taken care of with
1455 if (! must_preallocate
)
1457 int partial_seen
= 0;
1458 int copy_to_evaluate_size
= 0;
1461 for (i
= 0; i
< num_actuals
&& ! must_preallocate
; i
++)
1463 if (args
[i
].partial
> 0 && ! args
[i
].pass_on_stack
)
1465 else if (partial_seen
&& args
[i
].reg
== 0)
1466 must_preallocate
= 1;
1468 if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
1469 && (TREE_CODE (args
[i
].tree_value
) == CALL_EXPR
1470 || TREE_CODE (args
[i
].tree_value
) == TARGET_EXPR
1471 || TREE_CODE (args
[i
].tree_value
) == COND_EXPR
1472 || TREE_ADDRESSABLE (TREE_TYPE (args
[i
].tree_value
))))
1473 copy_to_evaluate_size
1474 += int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1477 if (copy_to_evaluate_size
* 2 >= args_size
->constant
1478 && args_size
->constant
> 0)
1479 must_preallocate
= 1;
1481 return must_preallocate
;
1484 /* If we preallocated stack space, compute the address of each argument
1485 and store it into the ARGS array.
1487 We need not ensure it is a valid memory address here; it will be
1488 validized when it is used.
1490 ARGBLOCK is an rtx for the address of the outgoing arguments. */
1493 compute_argument_addresses (struct arg_data
*args
, rtx argblock
, int num_actuals
)
1497 rtx arg_reg
= argblock
;
1498 int i
, arg_offset
= 0;
1500 if (GET_CODE (argblock
) == PLUS
)
1501 arg_reg
= XEXP (argblock
, 0), arg_offset
= INTVAL (XEXP (argblock
, 1));
1503 for (i
= 0; i
< num_actuals
; i
++)
1505 rtx offset
= ARGS_SIZE_RTX (args
[i
].locate
.offset
);
1506 rtx slot_offset
= ARGS_SIZE_RTX (args
[i
].locate
.slot_offset
);
1509 /* Skip this parm if it will not be passed on the stack. */
1510 if (! args
[i
].pass_on_stack
&& args
[i
].reg
!= 0)
1513 if (GET_CODE (offset
) == CONST_INT
)
1514 addr
= plus_constant (arg_reg
, INTVAL (offset
));
1516 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, offset
);
1518 addr
= plus_constant (addr
, arg_offset
);
1519 args
[i
].stack
= gen_rtx_MEM (args
[i
].mode
, addr
);
1520 set_mem_align (args
[i
].stack
, PARM_BOUNDARY
);
1521 set_mem_attributes (args
[i
].stack
,
1522 TREE_TYPE (args
[i
].tree_value
), 1);
1524 if (GET_CODE (slot_offset
) == CONST_INT
)
1525 addr
= plus_constant (arg_reg
, INTVAL (slot_offset
));
1527 addr
= gen_rtx_PLUS (Pmode
, arg_reg
, slot_offset
);
1529 addr
= plus_constant (addr
, arg_offset
);
1530 args
[i
].stack_slot
= gen_rtx_MEM (args
[i
].mode
, addr
);
1531 set_mem_align (args
[i
].stack_slot
, PARM_BOUNDARY
);
1532 set_mem_attributes (args
[i
].stack_slot
,
1533 TREE_TYPE (args
[i
].tree_value
), 1);
1535 /* Function incoming arguments may overlap with sibling call
1536 outgoing arguments and we cannot allow reordering of reads
1537 from function arguments with stores to outgoing arguments
1538 of sibling calls. */
1539 set_mem_alias_set (args
[i
].stack
, 0);
1540 set_mem_alias_set (args
[i
].stack_slot
, 0);
1545 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
1546 in a call instruction.
1548 FNDECL is the tree node for the target function. For an indirect call
1549 FNDECL will be NULL_TREE.
1551 ADDR is the operand 0 of CALL_EXPR for this call. */
1554 rtx_for_function_call (tree fndecl
, tree addr
)
1558 /* Get the function to call, in the form of RTL. */
1561 /* If this is the first use of the function, see if we need to
1562 make an external definition for it. */
1563 if (! TREE_USED (fndecl
))
1565 assemble_external (fndecl
);
1566 TREE_USED (fndecl
) = 1;
1569 /* Get a SYMBOL_REF rtx for the function address. */
1570 funexp
= XEXP (DECL_RTL (fndecl
), 0);
1573 /* Generate an rtx (probably a pseudo-register) for the address. */
1576 funexp
= expand_expr (addr
, NULL_RTX
, VOIDmode
, 0);
1577 pop_temp_slots (); /* FUNEXP can't be BLKmode. */
1583 /* Do the register loads required for any wholly-register parms or any
1584 parms which are passed both on the stack and in a register. Their
1585 expressions were already evaluated.
1587 Mark all register-parms as living through the call, putting these USE
1588 insns in the CALL_INSN_FUNCTION_USAGE field.
1590 When IS_SIBCALL, perform the check_sibcall_overlap_argument_overlap
1591 checking, setting *SIBCALL_FAILURE if appropriate. */
1594 load_register_parameters (struct arg_data
*args
, int num_actuals
,
1595 rtx
*call_fusage
, int flags
, int is_sibcall
,
1596 int *sibcall_failure
)
1600 for (i
= 0; i
< num_actuals
; i
++)
1602 rtx reg
= ((flags
& ECF_SIBCALL
)
1603 ? args
[i
].tail_call_reg
: args
[i
].reg
);
1606 int partial
= args
[i
].partial
;
1609 rtx before_arg
= get_last_insn ();
1610 /* Set to non-negative if must move a word at a time, even if just
1611 one word (e.g, partial == 1 && mode == DFmode). Set to -1 if
1612 we just use a normal move insn. This value can be zero if the
1613 argument is a zero size structure with no fields. */
1617 else if (TYPE_MODE (TREE_TYPE (args
[i
].tree_value
)) == BLKmode
)
1619 size
= int_size_in_bytes (TREE_TYPE (args
[i
].tree_value
));
1620 nregs
= (size
+ (UNITS_PER_WORD
- 1)) / UNITS_PER_WORD
;
1623 size
= GET_MODE_SIZE (args
[i
].mode
);
1625 /* Handle calls that pass values in multiple non-contiguous
1626 locations. The Irix 6 ABI has examples of this. */
1628 if (GET_CODE (reg
) == PARALLEL
)
1630 tree type
= TREE_TYPE (args
[i
].tree_value
);
1631 emit_group_load (reg
, args
[i
].value
, type
,
1632 int_size_in_bytes (type
));
1635 /* If simple case, just do move. If normal partial, store_one_arg
1636 has already loaded the register for us. In all other cases,
1637 load the register(s) from memory. */
1639 else if (nregs
== -1)
1641 emit_move_insn (reg
, args
[i
].value
);
1642 #ifdef BLOCK_REG_PADDING
1643 /* Handle case where we have a value that needs shifting
1644 up to the msb. eg. a QImode value and we're padding
1645 upward on a BYTES_BIG_ENDIAN machine. */
1646 if (size
< UNITS_PER_WORD
1647 && (args
[i
].locate
.where_pad
1648 == (BYTES_BIG_ENDIAN
? upward
: downward
)))
1651 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
1653 /* Assigning REG here rather than a temp makes CALL_FUSAGE
1654 report the whole reg as used. Strictly speaking, the
1655 call only uses SIZE bytes at the msb end, but it doesn't
1656 seem worth generating rtl to say that. */
1657 reg
= gen_rtx_REG (word_mode
, REGNO (reg
));
1658 x
= expand_binop (word_mode
, ashl_optab
, reg
,
1659 GEN_INT (shift
), reg
, 1, OPTAB_WIDEN
);
1661 emit_move_insn (reg
, x
);
1666 /* If we have pre-computed the values to put in the registers in
1667 the case of non-aligned structures, copy them in now. */
1669 else if (args
[i
].n_aligned_regs
!= 0)
1670 for (j
= 0; j
< args
[i
].n_aligned_regs
; j
++)
1671 emit_move_insn (gen_rtx_REG (word_mode
, REGNO (reg
) + j
),
1672 args
[i
].aligned_regs
[j
]);
1674 else if (partial
== 0 || args
[i
].pass_on_stack
)
1676 rtx mem
= validize_mem (args
[i
].value
);
1678 /* Handle a BLKmode that needs shifting. */
1679 if (nregs
== 1 && size
< UNITS_PER_WORD
1680 #ifdef BLOCK_REG_PADDING
1681 && args
[i
].locate
.where_pad
== downward
1687 rtx tem
= operand_subword_force (mem
, 0, args
[i
].mode
);
1688 rtx ri
= gen_rtx_REG (word_mode
, REGNO (reg
));
1689 rtx x
= gen_reg_rtx (word_mode
);
1690 int shift
= (UNITS_PER_WORD
- size
) * BITS_PER_UNIT
;
1691 optab dir
= BYTES_BIG_ENDIAN
? lshr_optab
: ashl_optab
;
1693 emit_move_insn (x
, tem
);
1694 x
= expand_binop (word_mode
, dir
, x
, GEN_INT (shift
),
1695 ri
, 1, OPTAB_WIDEN
);
1697 emit_move_insn (ri
, x
);
1700 move_block_to_reg (REGNO (reg
), mem
, nregs
, args
[i
].mode
);
1703 /* When a parameter is a block, and perhaps in other cases, it is
1704 possible that it did a load from an argument slot that was
1705 already clobbered. */
1707 && check_sibcall_argument_overlap (before_arg
, &args
[i
], 0))
1708 *sibcall_failure
= 1;
1710 /* Handle calls that pass values in multiple non-contiguous
1711 locations. The Irix 6 ABI has examples of this. */
1712 if (GET_CODE (reg
) == PARALLEL
)
1713 use_group_regs (call_fusage
, reg
);
1714 else if (nregs
== -1)
1715 use_reg (call_fusage
, reg
);
1717 use_regs (call_fusage
, REGNO (reg
), nregs
== 0 ? 1 : nregs
);
1722 /* Try to integrate function. See expand_inline_function for documentation
1723 about the parameters. */
1726 try_to_integrate (tree fndecl
, tree actparms
, rtx target
, int ignore
,
1727 tree type
, rtx structure_value_addr
)
1732 rtx old_stack_level
= 0;
1733 int reg_parm_stack_space
= 0;
1735 #ifdef REG_PARM_STACK_SPACE
1736 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
1739 before_call
= get_last_insn ();
1741 timevar_push (TV_INTEGRATION
);
1743 temp
= expand_inline_function (fndecl
, actparms
, target
,
1745 structure_value_addr
);
1747 timevar_pop (TV_INTEGRATION
);
1749 /* If inlining succeeded, return. */
1750 if (temp
!= (rtx
) (size_t) - 1)
1752 if (ACCUMULATE_OUTGOING_ARGS
)
1754 /* If the outgoing argument list must be preserved, push
1755 the stack before executing the inlined function if it
1758 i
= reg_parm_stack_space
;
1759 if (i
> highest_outgoing_arg_in_use
)
1760 i
= highest_outgoing_arg_in_use
;
1761 while (--i
>= 0 && stack_usage_map
[i
] == 0)
1764 if (stack_arg_under_construction
|| i
>= 0)
1767 = before_call
? NEXT_INSN (before_call
) : get_insns ();
1768 rtx insn
= NULL_RTX
, seq
;
1770 /* Look for a call in the inline function code.
1771 If DECL_STRUCT_FUNCTION (fndecl)->outgoing_args_size is
1772 nonzero then there is a call and it is not necessary
1773 to scan the insns. */
1775 if (DECL_STRUCT_FUNCTION (fndecl
)->outgoing_args_size
== 0)
1776 for (insn
= first_insn
; insn
; insn
= NEXT_INSN (insn
))
1777 if (GET_CODE (insn
) == CALL_INSN
)
1782 /* Reserve enough stack space so that the largest
1783 argument list of any function call in the inline
1784 function does not overlap the argument list being
1785 evaluated. This is usually an overestimate because
1786 allocate_dynamic_stack_space reserves space for an
1787 outgoing argument list in addition to the requested
1788 space, but there is no way to ask for stack space such
1789 that an argument list of a certain length can be
1792 Add the stack space reserved for register arguments, if
1793 any, in the inline function. What is really needed is the
1794 largest value of reg_parm_stack_space in the inline
1795 function, but that is not available. Using the current
1796 value of reg_parm_stack_space is wrong, but gives
1797 correct results on all supported machines. */
1800 (DECL_STRUCT_FUNCTION (fndecl
)->outgoing_args_size
1801 + reg_parm_stack_space
);
1804 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
1805 allocate_dynamic_stack_space (GEN_INT (adjust
),
1806 NULL_RTX
, BITS_PER_UNIT
);
1809 emit_insn_before (seq
, first_insn
);
1810 emit_stack_restore (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
1815 /* If the result is equivalent to TARGET, return TARGET to simplify
1816 checks in store_expr. They can be equivalent but not equal in the
1817 case of a function that returns BLKmode. */
1818 if (temp
!= target
&& rtx_equal_p (temp
, target
))
1823 /* If inlining failed, mark FNDECL as needing to be compiled
1824 separately after all. If function was declared inline,
1826 if (DECL_INLINE (fndecl
) && warn_inline
&& !flag_no_inline
1827 && optimize
> 0 && !TREE_ADDRESSABLE (fndecl
))
1829 warning ("%Jinlining failed in call to '%F'", fndecl
, fndecl
);
1830 warning ("called from here");
1832 lang_hooks
.mark_addressable (fndecl
);
1833 return (rtx
) (size_t) - 1;
1836 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
1837 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
1838 bytes, then we would need to push some additional bytes to pad the
1839 arguments. So, we compute an adjust to the stack pointer for an
1840 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
1841 bytes. Then, when the arguments are pushed the stack will be perfectly
1842 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
1843 be popped after the call. Returns the adjustment. */
1846 combine_pending_stack_adjustment_and_call (int unadjusted_args_size
,
1847 struct args_size
*args_size
,
1848 int preferred_unit_stack_boundary
)
1850 /* The number of bytes to pop so that the stack will be
1851 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
1852 HOST_WIDE_INT adjustment
;
1853 /* The alignment of the stack after the arguments are pushed, if we
1854 just pushed the arguments without adjust the stack here. */
1855 HOST_WIDE_INT unadjusted_alignment
;
1857 unadjusted_alignment
1858 = ((stack_pointer_delta
+ unadjusted_args_size
)
1859 % preferred_unit_stack_boundary
);
1861 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
1862 as possible -- leaving just enough left to cancel out the
1863 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
1864 PENDING_STACK_ADJUST is non-negative, and congruent to
1865 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
1867 /* Begin by trying to pop all the bytes. */
1868 unadjusted_alignment
1869 = (unadjusted_alignment
1870 - (pending_stack_adjust
% preferred_unit_stack_boundary
));
1871 adjustment
= pending_stack_adjust
;
1872 /* Push enough additional bytes that the stack will be aligned
1873 after the arguments are pushed. */
1874 if (preferred_unit_stack_boundary
> 1)
1876 if (unadjusted_alignment
> 0)
1877 adjustment
-= preferred_unit_stack_boundary
- unadjusted_alignment
;
1879 adjustment
+= unadjusted_alignment
;
1882 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
1883 bytes after the call. The right number is the entire
1884 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
1885 by the arguments in the first place. */
1887 = pending_stack_adjust
- adjustment
+ unadjusted_args_size
;
1892 /* Scan X expression if it does not dereference any argument slots
1893 we already clobbered by tail call arguments (as noted in stored_args_map
1895 Return nonzero if X expression dereferences such argument slots,
1899 check_sibcall_argument_overlap_1 (rtx x
)
1909 code
= GET_CODE (x
);
1913 if (XEXP (x
, 0) == current_function_internal_arg_pointer
)
1915 else if (GET_CODE (XEXP (x
, 0)) == PLUS
1916 && XEXP (XEXP (x
, 0), 0) ==
1917 current_function_internal_arg_pointer
1918 && GET_CODE (XEXP (XEXP (x
, 0), 1)) == CONST_INT
)
1919 i
= INTVAL (XEXP (XEXP (x
, 0), 1));
1923 #ifdef ARGS_GROW_DOWNWARD
1924 i
= -i
- GET_MODE_SIZE (GET_MODE (x
));
1927 for (k
= 0; k
< GET_MODE_SIZE (GET_MODE (x
)); k
++)
1928 if (i
+ k
< stored_args_map
->n_bits
1929 && TEST_BIT (stored_args_map
, i
+ k
))
1935 /* Scan all subexpressions. */
1936 fmt
= GET_RTX_FORMAT (code
);
1937 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++, fmt
++)
1941 if (check_sibcall_argument_overlap_1 (XEXP (x
, i
)))
1944 else if (*fmt
== 'E')
1946 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
1947 if (check_sibcall_argument_overlap_1 (XVECEXP (x
, i
, j
)))
1954 /* Scan sequence after INSN if it does not dereference any argument slots
1955 we already clobbered by tail call arguments (as noted in stored_args_map
1956 bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to
1957 stored_args_map bitmap afterwards (when ARG is a register MARK_STORED_ARGS_MAP
1958 should be 0). Return nonzero if sequence after INSN dereferences such argument
1959 slots, zero otherwise. */
1962 check_sibcall_argument_overlap (rtx insn
, struct arg_data
*arg
, int mark_stored_args_map
)
1966 if (insn
== NULL_RTX
)
1967 insn
= get_insns ();
1969 insn
= NEXT_INSN (insn
);
1971 for (; insn
; insn
= NEXT_INSN (insn
))
1973 && check_sibcall_argument_overlap_1 (PATTERN (insn
)))
1976 if (mark_stored_args_map
)
1978 #ifdef ARGS_GROW_DOWNWARD
1979 low
= -arg
->locate
.slot_offset
.constant
- arg
->locate
.size
.constant
;
1981 low
= arg
->locate
.slot_offset
.constant
;
1984 for (high
= low
+ arg
->locate
.size
.constant
; low
< high
; low
++)
1985 SET_BIT (stored_args_map
, low
);
1987 return insn
!= NULL_RTX
;
1991 fix_unsafe_tree (tree t
)
1993 switch (unsafe_for_reeval (t
))
1998 case 1: /* Mildly unsafe. */
1999 t
= unsave_expr (t
);
2002 case 2: /* Wildly unsafe. */
2004 tree var
= build_decl (VAR_DECL
, NULL_TREE
,
2007 expand_expr (t
, NULL_RTX
, VOIDmode
, EXPAND_NORMAL
));
2019 /* If function value *VALUE was returned at the most significant end of a
2020 register, shift it towards the least significant end and convert it to
2021 TYPE's mode. Return true and update *VALUE if some action was needed.
2023 TYPE is the type of the function's return value, which is known not
2024 to have mode BLKmode. */
2027 shift_returned_value (tree type
, rtx
*value
)
2029 if (targetm
.calls
.return_in_msb (type
))
2031 HOST_WIDE_INT shift
;
2033 shift
= (GET_MODE_BITSIZE (GET_MODE (*value
))
2034 - BITS_PER_UNIT
* int_size_in_bytes (type
));
2037 *value
= expand_binop (GET_MODE (*value
), lshr_optab
, *value
,
2038 GEN_INT (shift
), 0, 1, OPTAB_WIDEN
);
2039 *value
= convert_to_mode (TYPE_MODE (type
), *value
, 0);
2046 /* Generate all the code for a function call
2047 and return an rtx for its value.
2048 Store the value in TARGET (specified as an rtx) if convenient.
2049 If the value is stored in TARGET then TARGET is returned.
2050 If IGNORE is nonzero, then we ignore the value of the function call. */
2053 expand_call (tree exp
, rtx target
, int ignore
)
2055 /* Nonzero if we are currently expanding a call. */
2056 static int currently_expanding_call
= 0;
2058 /* List of actual parameters. */
2059 tree actparms
= TREE_OPERAND (exp
, 1);
2060 /* RTX for the function to be called. */
2062 /* Sequence of insns to perform a tail recursive "call". */
2063 rtx tail_recursion_insns
= NULL_RTX
;
2064 /* Sequence of insns to perform a normal "call". */
2065 rtx normal_call_insns
= NULL_RTX
;
2066 /* Sequence of insns to perform a tail recursive "call". */
2067 rtx tail_call_insns
= NULL_RTX
;
2068 /* Data type of the function. */
2070 tree type_arg_types
;
2071 /* Declaration of the function being called,
2072 or 0 if the function is computed (not known by name). */
2074 /* The type of the function being called. */
2077 int try_tail_call
= 1;
2078 int try_tail_recursion
= 1;
2081 /* Register in which non-BLKmode value will be returned,
2082 or 0 if no value or if value is BLKmode. */
2084 /* Address where we should return a BLKmode value;
2085 0 if value not BLKmode. */
2086 rtx structure_value_addr
= 0;
2087 /* Nonzero if that address is being passed by treating it as
2088 an extra, implicit first parameter. Otherwise,
2089 it is passed by being copied directly into struct_value_rtx. */
2090 int structure_value_addr_parm
= 0;
2091 /* Size of aggregate value wanted, or zero if none wanted
2092 or if we are using the non-reentrant PCC calling convention
2093 or expecting the value in registers. */
2094 HOST_WIDE_INT struct_value_size
= 0;
2095 /* Nonzero if called function returns an aggregate in memory PCC style,
2096 by returning the address of where to find it. */
2097 int pcc_struct_value
= 0;
2098 rtx struct_value
= 0;
2100 /* Number of actual parameters in this call, including struct value addr. */
2102 /* Number of named args. Args after this are anonymous ones
2103 and they must all go on the stack. */
2106 /* Vector of information about each argument.
2107 Arguments are numbered in the order they will be pushed,
2108 not the order they are written. */
2109 struct arg_data
*args
;
2111 /* Total size in bytes of all the stack-parms scanned so far. */
2112 struct args_size args_size
;
2113 struct args_size adjusted_args_size
;
2114 /* Size of arguments before any adjustments (such as rounding). */
2115 int unadjusted_args_size
;
2116 /* Data on reg parms scanned so far. */
2117 CUMULATIVE_ARGS args_so_far
;
2118 /* Nonzero if a reg parm has been scanned. */
2120 /* Nonzero if this is an indirect function call. */
2122 /* Nonzero if we must avoid push-insns in the args for this call.
2123 If stack space is allocated for register parameters, but not by the
2124 caller, then it is preallocated in the fixed part of the stack frame.
2125 So the entire argument block must then be preallocated (i.e., we
2126 ignore PUSH_ROUNDING in that case). */
2128 int must_preallocate
= !PUSH_ARGS
;
2130 /* Size of the stack reserved for parameter registers. */
2131 int reg_parm_stack_space
= 0;
2133 /* Address of space preallocated for stack parms
2134 (on machines that lack push insns), or 0 if space not preallocated. */
2137 /* Mask of ECF_ flags. */
2139 /* Nonzero if this is a call to an inline function. */
2140 int is_integrable
= 0;
2141 #ifdef REG_PARM_STACK_SPACE
2142 /* Define the boundary of the register parm stack space that needs to be
2144 int low_to_save
, high_to_save
;
2145 rtx save_area
= 0; /* Place that it is saved */
2148 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
2149 rtx temp_target
= 0;
2150 char *initial_stack_usage_map
= stack_usage_map
;
2152 int old_stack_allocated
;
2154 /* State variables to track stack modifications. */
2155 rtx old_stack_level
= 0;
2156 int old_stack_arg_under_construction
= 0;
2157 int old_pending_adj
= 0;
2158 int old_inhibit_defer_pop
= inhibit_defer_pop
;
2160 /* Some stack pointer alterations we make are performed via
2161 allocate_dynamic_stack_space. This modifies the stack_pointer_delta,
2162 which we then also need to save/restore along the way. */
2163 int old_stack_pointer_delta
= 0;
2166 tree p
= TREE_OPERAND (exp
, 0);
2167 tree addr
= TREE_OPERAND (exp
, 0);
2169 /* The alignment of the stack, in bits. */
2170 HOST_WIDE_INT preferred_stack_boundary
;
2171 /* The alignment of the stack, in bytes. */
2172 HOST_WIDE_INT preferred_unit_stack_boundary
;
2174 /* See if this is "nothrow" function call. */
2175 if (TREE_NOTHROW (exp
))
2176 flags
|= ECF_NOTHROW
;
2178 /* See if we can find a DECL-node for the actual function.
2179 As a result, decide whether this is a call to an integrable function. */
2181 fndecl
= get_callee_fndecl (exp
);
2184 fntype
= TREE_TYPE (fndecl
);
2186 && fndecl
!= current_function_decl
2187 && DECL_INLINE (fndecl
)
2188 && DECL_STRUCT_FUNCTION (fndecl
)
2189 && DECL_STRUCT_FUNCTION (fndecl
)->inlinable
)
2191 else if (! TREE_ADDRESSABLE (fndecl
))
2193 /* In case this function later becomes inlinable,
2194 record that there was already a non-inline call to it.
2196 Use abstraction instead of setting TREE_ADDRESSABLE
2198 if (DECL_INLINE (fndecl
) && warn_inline
&& !flag_no_inline
2201 warning ("%Jcan't inline call to '%F'", fndecl
, fndecl
);
2202 warning ("called from here");
2204 lang_hooks
.mark_addressable (fndecl
);
2208 && lookup_attribute ("warn_unused_result",
2209 TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
2210 warning ("ignoring return value of `%D', "
2211 "declared with attribute warn_unused_result", fndecl
);
2213 flags
|= flags_from_decl_or_type (fndecl
);
2216 /* If we don't have specific function to call, see if we have a
2217 attributes set in the type. */
2220 fntype
= TREE_TYPE (TREE_TYPE (p
));
2222 && lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (fntype
)))
2223 warning ("ignoring return value of function "
2224 "declared with attribute warn_unused_result");
2225 flags
|= flags_from_decl_or_type (fntype
);
2228 struct_value
= targetm
.calls
.struct_value_rtx (fntype
, 0);
2230 /* Warn if this value is an aggregate type,
2231 regardless of which calling convention we are using for it. */
2232 if (warn_aggregate_return
&& AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
2233 warning ("function call has aggregate value");
2235 /* If the result of a pure or const function call is ignored (or void),
2236 and none of its arguments are volatile, we can avoid expanding the
2237 call and just evaluate the arguments for side-effects. */
2238 if ((flags
& (ECF_CONST
| ECF_PURE
))
2239 && (ignore
|| target
== const0_rtx
2240 || TYPE_MODE (TREE_TYPE (exp
)) == VOIDmode
))
2242 bool volatilep
= false;
2245 for (arg
= actparms
; arg
; arg
= TREE_CHAIN (arg
))
2246 if (TREE_THIS_VOLATILE (TREE_VALUE (arg
)))
2254 for (arg
= actparms
; arg
; arg
= TREE_CHAIN (arg
))
2255 expand_expr (TREE_VALUE (arg
), const0_rtx
,
2256 VOIDmode
, EXPAND_NORMAL
);
2261 #ifdef REG_PARM_STACK_SPACE
2262 reg_parm_stack_space
= REG_PARM_STACK_SPACE (fndecl
);
2265 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2266 if (reg_parm_stack_space
> 0 && PUSH_ARGS
)
2267 must_preallocate
= 1;
2270 /* Set up a place to return a structure. */
2272 /* Cater to broken compilers. */
2273 if (aggregate_value_p (exp
, fndecl
))
2275 /* This call returns a big structure. */
2276 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LIBCALL_BLOCK
);
2278 #ifdef PCC_STATIC_STRUCT_RETURN
2280 pcc_struct_value
= 1;
2281 /* Easier than making that case work right. */
2284 /* In case this is a static function, note that it has been
2286 if (! TREE_ADDRESSABLE (fndecl
))
2287 lang_hooks
.mark_addressable (fndecl
);
2291 #else /* not PCC_STATIC_STRUCT_RETURN */
2293 struct_value_size
= int_size_in_bytes (TREE_TYPE (exp
));
2295 if (CALL_EXPR_HAS_RETURN_SLOT_ADDR (exp
))
2297 /* The structure value address arg is already in actparms.
2298 Pull it out. It might be nice to just leave it there, but
2299 we need to set structure_value_addr. */
2300 tree return_arg
= TREE_VALUE (actparms
);
2301 actparms
= TREE_CHAIN (actparms
);
2302 structure_value_addr
= expand_expr (return_arg
, NULL_RTX
,
2303 VOIDmode
, EXPAND_NORMAL
);
2305 else if (target
&& GET_CODE (target
) == MEM
)
2306 structure_value_addr
= XEXP (target
, 0);
2309 /* For variable-sized objects, we must be called with a target
2310 specified. If we were to allocate space on the stack here,
2311 we would have no way of knowing when to free it. */
2312 rtx d
= assign_temp (TREE_TYPE (exp
), 1, 1, 1);
2314 mark_temp_addr_taken (d
);
2315 structure_value_addr
= XEXP (d
, 0);
2319 #endif /* not PCC_STATIC_STRUCT_RETURN */
2322 /* If called function is inline, try to integrate it. */
2326 rtx temp
= try_to_integrate (fndecl
, actparms
, target
,
2327 ignore
, TREE_TYPE (exp
),
2328 structure_value_addr
);
2329 if (temp
!= (rtx
) (size_t) - 1)
2333 /* Figure out the amount to which the stack should be aligned. */
2334 preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
2337 struct cgraph_rtl_info
*i
= cgraph_rtl_info (fndecl
);
2338 if (i
&& i
->preferred_incoming_stack_boundary
)
2339 preferred_stack_boundary
= i
->preferred_incoming_stack_boundary
;
2342 /* Operand 0 is a pointer-to-function; get the type of the function. */
2343 funtype
= TREE_TYPE (addr
);
2344 if (! POINTER_TYPE_P (funtype
))
2346 funtype
= TREE_TYPE (funtype
);
2348 /* Munge the tree to split complex arguments into their imaginary
2350 if (targetm
.calls
.split_complex_arg
)
2352 type_arg_types
= split_complex_types (TYPE_ARG_TYPES (funtype
));
2353 actparms
= split_complex_values (actparms
);
2356 type_arg_types
= TYPE_ARG_TYPES (funtype
);
2358 /* See if this is a call to a function that can return more than once
2359 or a call to longjmp or malloc. */
2360 flags
|= special_function_p (fndecl
, flags
);
2362 if (flags
& ECF_MAY_BE_ALLOCA
)
2363 current_function_calls_alloca
= 1;
2365 /* If struct_value_rtx is 0, it means pass the address
2366 as if it were an extra parameter. */
2367 if (structure_value_addr
&& struct_value
== 0)
2369 /* If structure_value_addr is a REG other than
2370 virtual_outgoing_args_rtx, we can use always use it. If it
2371 is not a REG, we must always copy it into a register.
2372 If it is virtual_outgoing_args_rtx, we must copy it to another
2373 register in some cases. */
2374 rtx temp
= (GET_CODE (structure_value_addr
) != REG
2375 || (ACCUMULATE_OUTGOING_ARGS
2376 && stack_arg_under_construction
2377 && structure_value_addr
== virtual_outgoing_args_rtx
)
2378 ? copy_addr_to_reg (convert_memory_address
2379 (Pmode
, structure_value_addr
))
2380 : structure_value_addr
);
2383 = tree_cons (error_mark_node
,
2384 make_tree (build_pointer_type (TREE_TYPE (funtype
)),
2387 structure_value_addr_parm
= 1;
2390 /* Count the arguments and set NUM_ACTUALS. */
2391 for (p
= actparms
, num_actuals
= 0; p
; p
= TREE_CHAIN (p
))
2394 /* Compute number of named args.
2395 Normally, don't include the last named arg if anonymous args follow.
2396 We do include the last named arg if
2397 targetm.calls.strict_argument_naming() returns nonzero.
2398 (If no anonymous args follow, the result of list_length is actually
2399 one too large. This is harmless.)
2401 If targetm.calls.pretend_outgoing_varargs_named() returns
2402 nonzero, and targetm.calls.strict_argument_naming() returns zero,
2403 this machine will be able to place unnamed args that were passed
2404 in registers into the stack. So treat all args as named. This
2405 allows the insns emitting for a specific argument list to be
2406 independent of the function declaration.
2408 If targetm.calls.pretend_outgoing_varargs_named() returns zero,
2409 we do not have any reliable way to pass unnamed args in
2410 registers, so we must force them into memory. */
2412 if ((targetm
.calls
.strict_argument_naming (&args_so_far
)
2413 || ! targetm
.calls
.pretend_outgoing_varargs_named (&args_so_far
))
2414 && type_arg_types
!= 0)
2416 = (list_length (type_arg_types
)
2417 /* Don't include the last named arg. */
2418 - (targetm
.calls
.strict_argument_naming (&args_so_far
) ? 0 : 1)
2419 /* Count the struct value address, if it is passed as a parm. */
2420 + structure_value_addr_parm
);
2422 /* If we know nothing, treat all args as named. */
2423 n_named_args
= num_actuals
;
2425 /* Start updating where the next arg would go.
2427 On some machines (such as the PA) indirect calls have a different
2428 calling convention than normal calls. The fourth argument in
2429 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
2431 INIT_CUMULATIVE_ARGS (args_so_far
, funtype
, NULL_RTX
, fndecl
, n_named_args
);
2433 /* Make a vector to hold all the information about each arg. */
2434 args
= alloca (num_actuals
* sizeof (struct arg_data
));
2435 memset (args
, 0, num_actuals
* sizeof (struct arg_data
));
2437 /* Build up entries in the ARGS array, compute the size of the
2438 arguments into ARGS_SIZE, etc. */
2439 initialize_argument_information (num_actuals
, args
, &args_size
,
2440 n_named_args
, actparms
, fndecl
,
2441 &args_so_far
, reg_parm_stack_space
,
2442 &old_stack_level
, &old_pending_adj
,
2443 &must_preallocate
, &flags
,
2444 CALL_FROM_THUNK_P (exp
));
2448 /* If this function requires a variable-sized argument list, don't
2449 try to make a cse'able block for this call. We may be able to
2450 do this eventually, but it is too complicated to keep track of
2451 what insns go in the cse'able block and which don't. */
2453 flags
&= ~ECF_LIBCALL_BLOCK
;
2454 must_preallocate
= 1;
2457 /* Now make final decision about preallocating stack space. */
2458 must_preallocate
= finalize_must_preallocate (must_preallocate
,
2462 /* If the structure value address will reference the stack pointer, we
2463 must stabilize it. We don't need to do this if we know that we are
2464 not going to adjust the stack pointer in processing this call. */
2466 if (structure_value_addr
2467 && (reg_mentioned_p (virtual_stack_dynamic_rtx
, structure_value_addr
)
2468 || reg_mentioned_p (virtual_outgoing_args_rtx
,
2469 structure_value_addr
))
2471 || (!ACCUMULATE_OUTGOING_ARGS
&& args_size
.constant
)))
2472 structure_value_addr
= copy_to_reg (structure_value_addr
);
2474 /* Tail calls can make things harder to debug, and we're traditionally
2475 pushed these optimizations into -O2. Don't try if we're already
2476 expanding a call, as that means we're an argument. Don't try if
2477 there's cleanups, as we know there's code to follow the call.
2479 If rtx_equal_function_value_matters is false, that means we've
2480 finished with regular parsing. Which means that some of the
2481 machinery we use to generate tail-calls is no longer in place.
2482 This is most often true of sjlj-exceptions, which we couldn't
2483 tail-call to anyway.
2485 If current_nesting_level () == 0, we're being called after
2486 the function body has been expanded. This can happen when
2487 setting up trampolines in expand_function_end. */
2488 if (currently_expanding_call
++ != 0
2489 || !flag_optimize_sibling_calls
2490 || !rtx_equal_function_value_matters
2491 || current_nesting_level () == 0
2492 || any_pending_cleanups ()
2494 try_tail_call
= try_tail_recursion
= 0;
2496 /* Tail recursion fails, when we are not dealing with recursive calls. */
2497 if (!try_tail_recursion
2498 || TREE_CODE (addr
) != ADDR_EXPR
2499 || TREE_OPERAND (addr
, 0) != current_function_decl
)
2500 try_tail_recursion
= 0;
2502 /* Rest of purposes for tail call optimizations to fail. */
2504 #ifdef HAVE_sibcall_epilogue
2505 !HAVE_sibcall_epilogue
2510 /* Doing sibling call optimization needs some work, since
2511 structure_value_addr can be allocated on the stack.
2512 It does not seem worth the effort since few optimizable
2513 sibling calls will return a structure. */
2514 || structure_value_addr
!= NULL_RTX
2515 /* Check whether the target is able to optimize the call
2517 || !targetm
.function_ok_for_sibcall (fndecl
, exp
)
2518 /* Functions that do not return exactly once may not be sibcall
2520 || (flags
& (ECF_RETURNS_TWICE
| ECF_LONGJMP
| ECF_NORETURN
))
2521 || TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (addr
)))
2522 /* If the called function is nested in the current one, it might access
2523 some of the caller's arguments, but could clobber them beforehand if
2524 the argument areas are shared. */
2525 || (fndecl
&& decl_function_context (fndecl
) == current_function_decl
)
2526 /* If this function requires more stack slots than the current
2527 function, we cannot change it into a sibling call. */
2528 || args_size
.constant
> current_function_args_size
2529 /* If the callee pops its own arguments, then it must pop exactly
2530 the same number of arguments as the current function. */
2531 || (RETURN_POPS_ARGS (fndecl
, funtype
, args_size
.constant
)
2532 != RETURN_POPS_ARGS (current_function_decl
,
2533 TREE_TYPE (current_function_decl
),
2534 current_function_args_size
))
2535 || !lang_hooks
.decls
.ok_for_sibcall (fndecl
))
2538 if (try_tail_call
|| try_tail_recursion
)
2541 actparms
= NULL_TREE
;
2542 /* Ok, we're going to give the tail call the old college try.
2543 This means we're going to evaluate the function arguments
2544 up to three times. There are two degrees of badness we can
2545 encounter, those that can be unsaved and those that can't.
2546 (See unsafe_for_reeval commentary for details.)
2548 Generate a new argument list. Pass safe arguments through
2549 unchanged. For the easy badness wrap them in UNSAVE_EXPRs.
2550 For hard badness, evaluate them now and put their resulting
2551 rtx in a temporary VAR_DECL.
2553 initialize_argument_information has ordered the array for the
2554 order to be pushed, and we must remember this when reconstructing
2555 the original argument order. */
2557 if (PUSH_ARGS_REVERSED
)
2566 i
= num_actuals
- 1;
2570 for (; i
!= end
; i
+= inc
)
2572 args
[i
].tree_value
= fix_unsafe_tree (args
[i
].tree_value
);
2573 /* We need to build actparms for optimize_tail_recursion. We can
2574 safely trash away TREE_PURPOSE, since it is unused by this
2576 if (try_tail_recursion
)
2577 actparms
= tree_cons (NULL_TREE
, args
[i
].tree_value
, actparms
);
2579 /* Do the same for the function address if it is an expression. */
2581 addr
= fix_unsafe_tree (addr
);
2582 /* Expanding one of those dangerous arguments could have added
2583 cleanups, but otherwise give it a whirl. */
2584 if (any_pending_cleanups ())
2585 try_tail_call
= try_tail_recursion
= 0;
2588 /* Generate a tail recursion sequence when calling ourselves. */
2590 if (try_tail_recursion
)
2592 /* We want to emit any pending stack adjustments before the tail
2593 recursion "call". That way we know any adjustment after the tail
2594 recursion call can be ignored if we indeed use the tail recursion
2596 int save_pending_stack_adjust
= pending_stack_adjust
;
2597 int save_stack_pointer_delta
= stack_pointer_delta
;
2599 /* Emit any queued insns now; otherwise they would end up in
2600 only one of the alternates. */
2603 /* Use a new sequence to hold any RTL we generate. We do not even
2604 know if we will use this RTL yet. The final decision can not be
2605 made until after RTL generation for the entire function is
2608 /* If expanding any of the arguments creates cleanups, we can't
2609 do a tailcall. So, we'll need to pop the pending cleanups
2610 list. If, however, all goes well, and there are no cleanups
2611 then the call to expand_start_target_temps will have no
2613 expand_start_target_temps ();
2614 if (optimize_tail_recursion (actparms
, get_last_insn ()))
2616 if (any_pending_cleanups ())
2617 try_tail_call
= try_tail_recursion
= 0;
2619 tail_recursion_insns
= get_insns ();
2621 expand_end_target_temps ();
2624 /* Restore the original pending stack adjustment for the sibling and
2625 normal call cases below. */
2626 pending_stack_adjust
= save_pending_stack_adjust
;
2627 stack_pointer_delta
= save_stack_pointer_delta
;
2630 if (profile_arc_flag
&& (flags
& ECF_FORK_OR_EXEC
))
2632 /* A fork duplicates the profile information, and an exec discards
2633 it. We can't rely on fork/exec to be paired. So write out the
2634 profile information we have gathered so far, and clear it. */
2635 /* ??? When Linux's __clone is called with CLONE_VM set, profiling
2636 is subject to race conditions, just as with multithreaded
2639 emit_library_call (gcov_flush_libfunc
, LCT_ALWAYS_RETURN
, VOIDmode
, 0);
2642 /* Ensure current function's preferred stack boundary is at least
2643 what we need. We don't have to increase alignment for recursive
2645 if (cfun
->preferred_stack_boundary
< preferred_stack_boundary
2646 && fndecl
!= current_function_decl
)
2647 cfun
->preferred_stack_boundary
= preferred_stack_boundary
;
2648 if (fndecl
== current_function_decl
)
2649 cfun
->recursive_call_emit
= true;
2651 preferred_unit_stack_boundary
= preferred_stack_boundary
/ BITS_PER_UNIT
;
2653 function_call_count
++;
2655 /* We want to make two insn chains; one for a sibling call, the other
2656 for a normal call. We will select one of the two chains after
2657 initial RTL generation is complete. */
2658 for (pass
= try_tail_call
? 0 : 1; pass
< 2; pass
++)
2660 int sibcall_failure
= 0;
2661 /* We want to emit any pending stack adjustments before the tail
2662 recursion "call". That way we know any adjustment after the tail
2663 recursion call can be ignored if we indeed use the tail recursion
2665 int save_pending_stack_adjust
= 0;
2666 int save_stack_pointer_delta
= 0;
2668 rtx before_call
, next_arg_reg
;
2672 /* Emit any queued insns now; otherwise they would end up in
2673 only one of the alternates. */
2676 /* State variables we need to save and restore between
2678 save_pending_stack_adjust
= pending_stack_adjust
;
2679 save_stack_pointer_delta
= stack_pointer_delta
;
2682 flags
&= ~ECF_SIBCALL
;
2684 flags
|= ECF_SIBCALL
;
2686 /* Other state variables that we must reinitialize each time
2687 through the loop (that are not initialized by the loop itself). */
2691 /* Start a new sequence for the normal call case.
2693 From this point on, if the sibling call fails, we want to set
2694 sibcall_failure instead of continuing the loop. */
2699 /* We know at this point that there are not currently any
2700 pending cleanups. If, however, in the process of evaluating
2701 the arguments we were to create some, we'll need to be
2702 able to get rid of them. */
2703 expand_start_target_temps ();
2706 /* Don't let pending stack adjusts add up to too much.
2707 Also, do all pending adjustments now if there is any chance
2708 this might be a call to alloca or if we are expanding a sibling
2709 call sequence or if we are calling a function that is to return
2710 with stack pointer depressed. */
2711 if (pending_stack_adjust
>= 32
2712 || (pending_stack_adjust
> 0
2713 && (flags
& (ECF_MAY_BE_ALLOCA
| ECF_SP_DEPRESSED
)))
2715 do_pending_stack_adjust ();
2717 /* When calling a const function, we must pop the stack args right away,
2718 so that the pop is deleted or moved with the call. */
2719 if (pass
&& (flags
& ECF_LIBCALL_BLOCK
))
2722 /* Precompute any arguments as needed. */
2724 precompute_arguments (flags
, num_actuals
, args
);
2726 /* Now we are about to start emitting insns that can be deleted
2727 if a libcall is deleted. */
2728 if (pass
&& (flags
& (ECF_LIBCALL_BLOCK
| ECF_MALLOC
)))
2731 adjusted_args_size
= args_size
;
2732 /* Compute the actual size of the argument block required. The variable
2733 and constant sizes must be combined, the size may have to be rounded,
2734 and there may be a minimum required size. When generating a sibcall
2735 pattern, do not round up, since we'll be re-using whatever space our
2737 unadjusted_args_size
2738 = compute_argument_block_size (reg_parm_stack_space
,
2739 &adjusted_args_size
,
2741 : preferred_stack_boundary
));
2743 old_stack_allocated
= stack_pointer_delta
- pending_stack_adjust
;
2745 /* The argument block when performing a sibling call is the
2746 incoming argument block. */
2749 argblock
= virtual_incoming_args_rtx
;
2751 #ifdef STACK_GROWS_DOWNWARD
2752 = plus_constant (argblock
, current_function_pretend_args_size
);
2754 = plus_constant (argblock
, -current_function_pretend_args_size
);
2756 stored_args_map
= sbitmap_alloc (args_size
.constant
);
2757 sbitmap_zero (stored_args_map
);
2760 /* If we have no actual push instructions, or shouldn't use them,
2761 make space for all args right now. */
2762 else if (adjusted_args_size
.var
!= 0)
2764 if (old_stack_level
== 0)
2766 emit_stack_save (SAVE_BLOCK
, &old_stack_level
, NULL_RTX
);
2767 old_stack_pointer_delta
= stack_pointer_delta
;
2768 old_pending_adj
= pending_stack_adjust
;
2769 pending_stack_adjust
= 0;
2770 /* stack_arg_under_construction says whether a stack arg is
2771 being constructed at the old stack level. Pushing the stack
2772 gets a clean outgoing argument block. */
2773 old_stack_arg_under_construction
= stack_arg_under_construction
;
2774 stack_arg_under_construction
= 0;
2776 argblock
= push_block (ARGS_SIZE_RTX (adjusted_args_size
), 0, 0);
2780 /* Note that we must go through the motions of allocating an argument
2781 block even if the size is zero because we may be storing args
2782 in the area reserved for register arguments, which may be part of
2785 int needed
= adjusted_args_size
.constant
;
2787 /* Store the maximum argument space used. It will be pushed by
2788 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
2791 if (needed
> current_function_outgoing_args_size
)
2792 current_function_outgoing_args_size
= needed
;
2794 if (must_preallocate
)
2796 if (ACCUMULATE_OUTGOING_ARGS
)
2798 /* Since the stack pointer will never be pushed, it is
2799 possible for the evaluation of a parm to clobber
2800 something we have already written to the stack.
2801 Since most function calls on RISC machines do not use
2802 the stack, this is uncommon, but must work correctly.
2804 Therefore, we save any area of the stack that was already
2805 written and that we are using. Here we set up to do this
2806 by making a new stack usage map from the old one. The
2807 actual save will be done by store_one_arg.
2809 Another approach might be to try to reorder the argument
2810 evaluations to avoid this conflicting stack usage. */
2812 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2813 /* Since we will be writing into the entire argument area,
2814 the map must be allocated for its entire size, not just
2815 the part that is the responsibility of the caller. */
2816 needed
+= reg_parm_stack_space
;
2819 #ifdef ARGS_GROW_DOWNWARD
2820 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
2823 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
2826 stack_usage_map
= alloca (highest_outgoing_arg_in_use
);
2828 if (initial_highest_arg_in_use
)
2829 memcpy (stack_usage_map
, initial_stack_usage_map
,
2830 initial_highest_arg_in_use
);
2832 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
2833 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
2834 (highest_outgoing_arg_in_use
2835 - initial_highest_arg_in_use
));
2838 /* The address of the outgoing argument list must not be
2839 copied to a register here, because argblock would be left
2840 pointing to the wrong place after the call to
2841 allocate_dynamic_stack_space below. */
2843 argblock
= virtual_outgoing_args_rtx
;
2847 if (inhibit_defer_pop
== 0)
2849 /* Try to reuse some or all of the pending_stack_adjust
2850 to get this space. */
2852 = (combine_pending_stack_adjustment_and_call
2853 (unadjusted_args_size
,
2854 &adjusted_args_size
,
2855 preferred_unit_stack_boundary
));
2857 /* combine_pending_stack_adjustment_and_call computes
2858 an adjustment before the arguments are allocated.
2859 Account for them and see whether or not the stack
2860 needs to go up or down. */
2861 needed
= unadjusted_args_size
- needed
;
2865 /* We're releasing stack space. */
2866 /* ??? We can avoid any adjustment at all if we're
2867 already aligned. FIXME. */
2868 pending_stack_adjust
= -needed
;
2869 do_pending_stack_adjust ();
2873 /* We need to allocate space. We'll do that in
2874 push_block below. */
2875 pending_stack_adjust
= 0;
2878 /* Special case this because overhead of `push_block' in
2879 this case is non-trivial. */
2881 argblock
= virtual_outgoing_args_rtx
;
2884 argblock
= push_block (GEN_INT (needed
), 0, 0);
2885 #ifdef ARGS_GROW_DOWNWARD
2886 argblock
= plus_constant (argblock
, needed
);
2890 /* We only really need to call `copy_to_reg' in the case
2891 where push insns are going to be used to pass ARGBLOCK
2892 to a function call in ARGS. In that case, the stack
2893 pointer changes value from the allocation point to the
2894 call point, and hence the value of
2895 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
2896 as well always do it. */
2897 argblock
= copy_to_reg (argblock
);
2902 if (ACCUMULATE_OUTGOING_ARGS
)
2904 /* The save/restore code in store_one_arg handles all
2905 cases except one: a constructor call (including a C
2906 function returning a BLKmode struct) to initialize
2908 if (stack_arg_under_construction
)
2910 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2911 rtx push_size
= GEN_INT (reg_parm_stack_space
2912 + adjusted_args_size
.constant
);
2914 rtx push_size
= GEN_INT (adjusted_args_size
.constant
);
2916 if (old_stack_level
== 0)
2918 emit_stack_save (SAVE_BLOCK
, &old_stack_level
,
2920 old_stack_pointer_delta
= stack_pointer_delta
;
2921 old_pending_adj
= pending_stack_adjust
;
2922 pending_stack_adjust
= 0;
2923 /* stack_arg_under_construction says whether a stack
2924 arg is being constructed at the old stack level.
2925 Pushing the stack gets a clean outgoing argument
2927 old_stack_arg_under_construction
2928 = stack_arg_under_construction
;
2929 stack_arg_under_construction
= 0;
2930 /* Make a new map for the new argument list. */
2931 stack_usage_map
= alloca (highest_outgoing_arg_in_use
);
2932 memset (stack_usage_map
, 0, highest_outgoing_arg_in_use
);
2933 highest_outgoing_arg_in_use
= 0;
2935 allocate_dynamic_stack_space (push_size
, NULL_RTX
,
2939 /* If argument evaluation might modify the stack pointer,
2940 copy the address of the argument list to a register. */
2941 for (i
= 0; i
< num_actuals
; i
++)
2942 if (args
[i
].pass_on_stack
)
2944 argblock
= copy_addr_to_reg (argblock
);
2949 compute_argument_addresses (args
, argblock
, num_actuals
);
2951 /* If we push args individually in reverse order, perform stack alignment
2952 before the first push (the last arg). */
2953 if (PUSH_ARGS_REVERSED
&& argblock
== 0
2954 && adjusted_args_size
.constant
!= unadjusted_args_size
)
2956 /* When the stack adjustment is pending, we get better code
2957 by combining the adjustments. */
2958 if (pending_stack_adjust
2959 && ! (flags
& ECF_LIBCALL_BLOCK
)
2960 && ! inhibit_defer_pop
)
2962 pending_stack_adjust
2963 = (combine_pending_stack_adjustment_and_call
2964 (unadjusted_args_size
,
2965 &adjusted_args_size
,
2966 preferred_unit_stack_boundary
));
2967 do_pending_stack_adjust ();
2969 else if (argblock
== 0)
2970 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
2971 - unadjusted_args_size
));
2973 /* Now that the stack is properly aligned, pops can't safely
2974 be deferred during the evaluation of the arguments. */
2977 funexp
= rtx_for_function_call (fndecl
, addr
);
2979 /* Figure out the register where the value, if any, will come back. */
2981 if (TYPE_MODE (TREE_TYPE (exp
)) != VOIDmode
2982 && ! structure_value_addr
)
2984 if (pcc_struct_value
)
2985 valreg
= hard_function_value (build_pointer_type (TREE_TYPE (exp
)),
2986 fndecl
, (pass
== 0));
2988 valreg
= hard_function_value (TREE_TYPE (exp
), fndecl
, (pass
== 0));
2991 /* Precompute all register parameters. It isn't safe to compute anything
2992 once we have started filling any specific hard regs. */
2993 precompute_register_parameters (num_actuals
, args
, ®_parm_seen
);
2995 #ifdef REG_PARM_STACK_SPACE
2996 /* Save the fixed argument area if it's part of the caller's frame and
2997 is clobbered by argument setup for this call. */
2998 if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
2999 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
3000 &low_to_save
, &high_to_save
);
3003 /* Now store (and compute if necessary) all non-register parms.
3004 These come before register parms, since they can require block-moves,
3005 which could clobber the registers used for register parms.
3006 Parms which have partial registers are not stored here,
3007 but we do preallocate space here if they want that. */
3009 for (i
= 0; i
< num_actuals
; i
++)
3010 if (args
[i
].reg
== 0 || args
[i
].pass_on_stack
)
3012 rtx before_arg
= get_last_insn ();
3014 if (store_one_arg (&args
[i
], argblock
, flags
,
3015 adjusted_args_size
.var
!= 0,
3016 reg_parm_stack_space
)
3018 && check_sibcall_argument_overlap (before_arg
,
3020 sibcall_failure
= 1;
3022 if (flags
& ECF_CONST
3024 && args
[i
].value
== args
[i
].stack
)
3025 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3026 gen_rtx_USE (VOIDmode
,
3031 /* If we have a parm that is passed in registers but not in memory
3032 and whose alignment does not permit a direct copy into registers,
3033 make a group of pseudos that correspond to each register that we
3035 if (STRICT_ALIGNMENT
)
3036 store_unaligned_arguments_into_pseudos (args
, num_actuals
);
3038 /* Now store any partially-in-registers parm.
3039 This is the last place a block-move can happen. */
3041 for (i
= 0; i
< num_actuals
; i
++)
3042 if (args
[i
].partial
!= 0 && ! args
[i
].pass_on_stack
)
3044 rtx before_arg
= get_last_insn ();
3046 if (store_one_arg (&args
[i
], argblock
, flags
,
3047 adjusted_args_size
.var
!= 0,
3048 reg_parm_stack_space
)
3050 && check_sibcall_argument_overlap (before_arg
,
3052 sibcall_failure
= 1;
3055 /* If we pushed args in forward order, perform stack alignment
3056 after pushing the last arg. */
3057 if (!PUSH_ARGS_REVERSED
&& argblock
== 0)
3058 anti_adjust_stack (GEN_INT (adjusted_args_size
.constant
3059 - unadjusted_args_size
));
3061 /* If register arguments require space on the stack and stack space
3062 was not preallocated, allocate stack space here for arguments
3063 passed in registers. */
3064 #ifdef OUTGOING_REG_PARM_STACK_SPACE
3065 if (!ACCUMULATE_OUTGOING_ARGS
3066 && must_preallocate
== 0 && reg_parm_stack_space
> 0)
3067 anti_adjust_stack (GEN_INT (reg_parm_stack_space
));
3070 /* Pass the function the address in which to return a
3072 if (pass
!= 0 && structure_value_addr
&& ! structure_value_addr_parm
)
3074 structure_value_addr
3075 = convert_memory_address (Pmode
, structure_value_addr
);
3076 emit_move_insn (struct_value
,
3078 force_operand (structure_value_addr
,
3081 if (GET_CODE (struct_value
) == REG
)
3082 use_reg (&call_fusage
, struct_value
);
3085 funexp
= prepare_call_address (funexp
, fndecl
, &call_fusage
,
3086 reg_parm_seen
, pass
== 0);
3088 load_register_parameters (args
, num_actuals
, &call_fusage
, flags
,
3089 pass
== 0, &sibcall_failure
);
3091 /* Perform postincrements before actually calling the function. */
3094 /* Save a pointer to the last insn before the call, so that we can
3095 later safely search backwards to find the CALL_INSN. */
3096 before_call
= get_last_insn ();
3098 /* Set up next argument register. For sibling calls on machines
3099 with register windows this should be the incoming register. */
3100 #ifdef FUNCTION_INCOMING_ARG
3102 next_arg_reg
= FUNCTION_INCOMING_ARG (args_so_far
, VOIDmode
,
3106 next_arg_reg
= FUNCTION_ARG (args_so_far
, VOIDmode
,
3109 /* All arguments and registers used for the call must be set up by
3112 /* Stack must be properly aligned now. */
3113 if (pass
&& stack_pointer_delta
% preferred_unit_stack_boundary
)
3116 /* Generate the actual call instruction. */
3117 emit_call_1 (funexp
, fndecl
, funtype
, unadjusted_args_size
,
3118 adjusted_args_size
.constant
, struct_value_size
,
3119 next_arg_reg
, valreg
, old_inhibit_defer_pop
, call_fusage
,
3120 flags
, & args_so_far
);
3122 /* If call is cse'able, make appropriate pair of reg-notes around it.
3123 Test valreg so we don't crash; may safely ignore `const'
3124 if return type is void. Disable for PARALLEL return values, because
3125 we have no way to move such values into a pseudo register. */
3126 if (pass
&& (flags
& ECF_LIBCALL_BLOCK
))
3130 bool failed
= valreg
== 0 || GET_CODE (valreg
) == PARALLEL
;
3132 insns
= get_insns ();
3134 /* Expansion of block moves possibly introduced a loop that may
3135 not appear inside libcall block. */
3136 for (insn
= insns
; insn
; insn
= NEXT_INSN (insn
))
3137 if (GET_CODE (insn
) == JUMP_INSN
)
3148 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
3150 /* Mark the return value as a pointer if needed. */
3151 if (TREE_CODE (TREE_TYPE (exp
)) == POINTER_TYPE
)
3152 mark_reg_pointer (temp
,
3153 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp
))));
3156 if (flag_unsafe_math_optimizations
3158 && DECL_BUILT_IN (fndecl
)
3159 && (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_SQRT
3160 || DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_SQRTF
3161 || DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_SQRTL
))
3162 note
= gen_rtx_fmt_e (SQRT
,
3164 args
[0].initial_value
);
3167 /* Construct an "equal form" for the value which
3168 mentions all the arguments in order as well as
3169 the function name. */
3170 for (i
= 0; i
< num_actuals
; i
++)
3171 note
= gen_rtx_EXPR_LIST (VOIDmode
,
3172 args
[i
].initial_value
, note
);
3173 note
= gen_rtx_EXPR_LIST (VOIDmode
, funexp
, note
);
3175 if (flags
& ECF_PURE
)
3176 note
= gen_rtx_EXPR_LIST (VOIDmode
,
3177 gen_rtx_USE (VOIDmode
,
3178 gen_rtx_MEM (BLKmode
,
3179 gen_rtx_SCRATCH (VOIDmode
))),
3182 emit_libcall_block (insns
, temp
, valreg
, note
);
3187 else if (pass
&& (flags
& ECF_MALLOC
))
3189 rtx temp
= gen_reg_rtx (GET_MODE (valreg
));
3192 /* The return value from a malloc-like function is a pointer. */
3193 if (TREE_CODE (TREE_TYPE (exp
)) == POINTER_TYPE
)
3194 mark_reg_pointer (temp
, BIGGEST_ALIGNMENT
);
3196 emit_move_insn (temp
, valreg
);
3198 /* The return value from a malloc-like function can not alias
3200 last
= get_last_insn ();
3202 gen_rtx_EXPR_LIST (REG_NOALIAS
, temp
, REG_NOTES (last
));
3204 /* Write out the sequence. */
3205 insns
= get_insns ();
3211 /* For calls to `setjmp', etc., inform flow.c it should complain
3212 if nonvolatile values are live. For functions that cannot return,
3213 inform flow that control does not fall through. */
3215 if ((flags
& (ECF_NORETURN
| ECF_LONGJMP
)) || pass
== 0)
3217 /* The barrier must be emitted
3218 immediately after the CALL_INSN. Some ports emit more
3219 than just a CALL_INSN above, so we must search for it here. */
3221 rtx last
= get_last_insn ();
3222 while (GET_CODE (last
) != CALL_INSN
)
3224 last
= PREV_INSN (last
);
3225 /* There was no CALL_INSN? */
3226 if (last
== before_call
)
3230 emit_barrier_after (last
);
3232 /* Stack adjustments after a noreturn call are dead code.
3233 However when NO_DEFER_POP is in effect, we must preserve
3234 stack_pointer_delta. */
3235 if (inhibit_defer_pop
== 0)
3237 stack_pointer_delta
= old_stack_allocated
;
3238 pending_stack_adjust
= 0;
3242 if (flags
& ECF_LONGJMP
)
3243 current_function_calls_longjmp
= 1;
3245 /* If value type not void, return an rtx for the value. */
3247 /* If there are cleanups to be called, don't use a hard reg as target.
3248 We need to double check this and see if it matters anymore. */
3249 if (any_pending_cleanups ())
3251 if (target
&& REG_P (target
)
3252 && REGNO (target
) < FIRST_PSEUDO_REGISTER
)
3254 sibcall_failure
= 1;
3257 if (TYPE_MODE (TREE_TYPE (exp
)) == VOIDmode
3259 target
= const0_rtx
;
3260 else if (structure_value_addr
)
3262 if (target
== 0 || GET_CODE (target
) != MEM
)
3265 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3266 memory_address (TYPE_MODE (TREE_TYPE (exp
)),
3267 structure_value_addr
));
3268 set_mem_attributes (target
, exp
, 1);
3271 else if (pcc_struct_value
)
3273 /* This is the special C++ case where we need to
3274 know what the true target was. We take care to
3275 never use this value more than once in one expression. */
3276 target
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3277 copy_to_reg (valreg
));
3278 set_mem_attributes (target
, exp
, 1);
3280 /* Handle calls that return values in multiple non-contiguous locations.
3281 The Irix 6 ABI has examples of this. */
3282 else if (GET_CODE (valreg
) == PARALLEL
)
3284 /* Second condition is added because "target" is freed at the
3285 the end of "pass0" for -O2 when call is made to
3286 expand_end_target_temps (). Its "in_use" flag has been set
3287 to false, so allocate a new temp. */
3288 if (target
== 0 || (pass
== 1 && target
== temp_target
))
3290 /* This will only be assigned once, so it can be readonly. */
3291 tree nt
= build_qualified_type (TREE_TYPE (exp
),
3292 (TYPE_QUALS (TREE_TYPE (exp
))
3293 | TYPE_QUAL_CONST
));
3295 target
= assign_temp (nt
, 0, 1, 1);
3296 temp_target
= target
;
3297 preserve_temp_slots (target
);
3300 if (! rtx_equal_p (target
, valreg
))
3301 emit_group_store (target
, valreg
, TREE_TYPE (exp
),
3302 int_size_in_bytes (TREE_TYPE (exp
)));
3304 /* We can not support sibling calls for this case. */
3305 sibcall_failure
= 1;
3308 && GET_MODE (target
) == TYPE_MODE (TREE_TYPE (exp
))
3309 && GET_MODE (target
) == GET_MODE (valreg
))
3311 /* TARGET and VALREG cannot be equal at this point because the
3312 latter would not have REG_FUNCTION_VALUE_P true, while the
3313 former would if it were referring to the same register.
3315 If they refer to the same register, this move will be a no-op,
3316 except when function inlining is being done. */
3317 emit_move_insn (target
, valreg
);
3319 /* If we are setting a MEM, this code must be executed. Since it is
3320 emitted after the call insn, sibcall optimization cannot be
3321 performed in that case. */
3322 if (GET_CODE (target
) == MEM
)
3323 sibcall_failure
= 1;
3325 else if (TYPE_MODE (TREE_TYPE (exp
)) == BLKmode
)
3327 target
= copy_blkmode_from_reg (target
, valreg
, TREE_TYPE (exp
));
3329 /* We can not support sibling calls for this case. */
3330 sibcall_failure
= 1;
3334 if (shift_returned_value (TREE_TYPE (exp
), &valreg
))
3335 sibcall_failure
= 1;
3337 target
= copy_to_reg (valreg
);
3340 if (targetm
.calls
.promote_function_return(funtype
))
3342 /* If we promoted this return value, make the proper SUBREG. TARGET
3343 might be const0_rtx here, so be careful. */
3344 if (GET_CODE (target
) == REG
3345 && TYPE_MODE (TREE_TYPE (exp
)) != BLKmode
3346 && GET_MODE (target
) != TYPE_MODE (TREE_TYPE (exp
)))
3348 tree type
= TREE_TYPE (exp
);
3349 int unsignedp
= TREE_UNSIGNED (type
);
3352 /* If we don't promote as expected, something is wrong. */
3353 if (GET_MODE (target
)
3354 != promote_mode (type
, TYPE_MODE (type
), &unsignedp
, 1))
3357 if ((WORDS_BIG_ENDIAN
|| BYTES_BIG_ENDIAN
)
3358 && GET_MODE_SIZE (GET_MODE (target
))
3359 > GET_MODE_SIZE (TYPE_MODE (type
)))
3361 offset
= GET_MODE_SIZE (GET_MODE (target
))
3362 - GET_MODE_SIZE (TYPE_MODE (type
));
3363 if (! BYTES_BIG_ENDIAN
)
3364 offset
= (offset
/ UNITS_PER_WORD
) * UNITS_PER_WORD
;
3365 else if (! WORDS_BIG_ENDIAN
)
3366 offset
%= UNITS_PER_WORD
;
3368 target
= gen_rtx_SUBREG (TYPE_MODE (type
), target
, offset
);
3369 SUBREG_PROMOTED_VAR_P (target
) = 1;
3370 SUBREG_PROMOTED_UNSIGNED_SET (target
, unsignedp
);
3374 /* If size of args is variable or this was a constructor call for a stack
3375 argument, restore saved stack-pointer value. */
3377 if (old_stack_level
&& ! (flags
& ECF_SP_DEPRESSED
))
3379 emit_stack_restore (SAVE_BLOCK
, old_stack_level
, NULL_RTX
);
3380 stack_pointer_delta
= old_stack_pointer_delta
;
3381 pending_stack_adjust
= old_pending_adj
;
3382 stack_arg_under_construction
= old_stack_arg_under_construction
;
3383 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
3384 stack_usage_map
= initial_stack_usage_map
;
3385 sibcall_failure
= 1;
3387 else if (ACCUMULATE_OUTGOING_ARGS
&& pass
)
3389 #ifdef REG_PARM_STACK_SPACE
3391 restore_fixed_argument_area (save_area
, argblock
,
3392 high_to_save
, low_to_save
);
3395 /* If we saved any argument areas, restore them. */
3396 for (i
= 0; i
< num_actuals
; i
++)
3397 if (args
[i
].save_area
)
3399 enum machine_mode save_mode
= GET_MODE (args
[i
].save_area
);
3401 = gen_rtx_MEM (save_mode
,
3402 memory_address (save_mode
,
3403 XEXP (args
[i
].stack_slot
, 0)));
3405 if (save_mode
!= BLKmode
)
3406 emit_move_insn (stack_area
, args
[i
].save_area
);
3408 emit_block_move (stack_area
, args
[i
].save_area
,
3409 GEN_INT (args
[i
].locate
.size
.constant
),
3410 BLOCK_OP_CALL_PARM
);
3413 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
3414 stack_usage_map
= initial_stack_usage_map
;
3417 /* If this was alloca, record the new stack level for nonlocal gotos.
3418 Check for the handler slots since we might not have a save area
3419 for non-local gotos. */
3421 if ((flags
& ECF_MAY_BE_ALLOCA
) && nonlocal_goto_handler_slots
!= 0)
3422 emit_stack_save (SAVE_NONLOCAL
, &nonlocal_goto_stack_level
, NULL_RTX
);
3424 /* Free up storage we no longer need. */
3425 for (i
= 0; i
< num_actuals
; ++i
)
3426 if (args
[i
].aligned_regs
)
3427 free (args
[i
].aligned_regs
);
3431 /* Undo the fake expand_start_target_temps we did earlier. If
3432 there had been any cleanups created, we've already set
3434 expand_end_target_temps ();
3437 /* If this function is returning into a memory location marked as
3438 readonly, it means it is initializing that location. We normally treat
3439 functions as not clobbering such locations, so we need to specify that
3440 this one does. We do this by adding the appropriate CLOBBER to the
3441 CALL_INSN function usage list. This cannot be done by emitting a
3442 standalone CLOBBER after the call because the latter would be ignored
3443 by at least the delay slot scheduling pass. We do this now instead of
3444 adding to call_fusage before the call to emit_call_1 because TARGET
3445 may be modified in the meantime. */
3446 if (structure_value_addr
!= 0 && target
!= 0
3447 && GET_CODE (target
) == MEM
&& RTX_UNCHANGING_P (target
))
3448 add_function_usage_to
3450 gen_rtx_EXPR_LIST (VOIDmode
, gen_rtx_CLOBBER (VOIDmode
, target
),
3453 insns
= get_insns ();
3458 tail_call_insns
= insns
;
3460 /* Restore the pending stack adjustment now that we have
3461 finished generating the sibling call sequence. */
3463 pending_stack_adjust
= save_pending_stack_adjust
;
3464 stack_pointer_delta
= save_stack_pointer_delta
;
3466 /* Prepare arg structure for next iteration. */
3467 for (i
= 0; i
< num_actuals
; i
++)
3470 args
[i
].aligned_regs
= 0;
3474 sbitmap_free (stored_args_map
);
3478 normal_call_insns
= insns
;
3480 /* Verify that we've deallocated all the stack we used. */
3481 if (! (flags
& (ECF_NORETURN
| ECF_LONGJMP
))
3482 && old_stack_allocated
!= stack_pointer_delta
3483 - pending_stack_adjust
)
3487 /* If something prevents making this a sibling call,
3488 zero out the sequence. */
3489 if (sibcall_failure
)
3490 tail_call_insns
= NULL_RTX
;
3493 /* The function optimize_sibling_and_tail_recursive_calls doesn't
3494 handle CALL_PLACEHOLDERs inside other CALL_PLACEHOLDERs. This
3495 can happen if the arguments to this function call an inline
3496 function who's expansion contains another CALL_PLACEHOLDER.
3498 If there are any C_Ps in any of these sequences, replace them
3499 with their normal call. */
3501 for (insn
= normal_call_insns
; insn
; insn
= NEXT_INSN (insn
))
3502 if (GET_CODE (insn
) == CALL_INSN
3503 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
3504 replace_call_placeholder (insn
, sibcall_use_normal
);
3506 for (insn
= tail_call_insns
; insn
; insn
= NEXT_INSN (insn
))
3507 if (GET_CODE (insn
) == CALL_INSN
3508 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
3509 replace_call_placeholder (insn
, sibcall_use_normal
);
3511 for (insn
= tail_recursion_insns
; insn
; insn
= NEXT_INSN (insn
))
3512 if (GET_CODE (insn
) == CALL_INSN
3513 && GET_CODE (PATTERN (insn
)) == CALL_PLACEHOLDER
)
3514 replace_call_placeholder (insn
, sibcall_use_normal
);
3516 /* If this was a potential tail recursion site, then emit a
3517 CALL_PLACEHOLDER with the normal and the tail recursion streams.
3518 One of them will be selected later. */
3519 if (tail_recursion_insns
|| tail_call_insns
)
3521 /* The tail recursion label must be kept around. We could expose
3522 its use in the CALL_PLACEHOLDER, but that creates unwanted edges
3523 and makes determining true tail recursion sites difficult.
3525 So we set LABEL_PRESERVE_P here, then clear it when we select
3526 one of the call sequences after rtl generation is complete. */
3527 if (tail_recursion_insns
)
3528 LABEL_PRESERVE_P (tail_recursion_label
) = 1;
3529 emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode
, normal_call_insns
,
3531 tail_recursion_insns
,
3532 tail_recursion_label
));
3535 emit_insn (normal_call_insns
);
3537 currently_expanding_call
--;
3539 /* If this function returns with the stack pointer depressed, ensure
3540 this block saves and restores the stack pointer, show it was
3541 changed, and adjust for any outgoing arg space. */
3542 if (flags
& ECF_SP_DEPRESSED
)
3544 clear_pending_stack_adjust ();
3545 emit_insn (gen_rtx_CLOBBER (VOIDmode
, stack_pointer_rtx
));
3546 emit_move_insn (virtual_stack_dynamic_rtx
, stack_pointer_rtx
);
3547 save_stack_pointer ();
3553 /* Traverse an argument list in VALUES and expand all complex
3554 arguments into their components. */
3556 split_complex_values (tree values
)
3560 /* Before allocating memory, check for the common case of no complex. */
3561 for (p
= values
; p
; p
= TREE_CHAIN (p
))
3563 tree type
= TREE_TYPE (TREE_VALUE (p
));
3564 if (type
&& TREE_CODE (type
) == COMPLEX_TYPE
3565 && targetm
.calls
.split_complex_arg (type
))
3571 values
= copy_list (values
);
3573 for (p
= values
; p
; p
= TREE_CHAIN (p
))
3575 tree complex_value
= TREE_VALUE (p
);
3578 complex_type
= TREE_TYPE (complex_value
);
3582 if (TREE_CODE (complex_type
) == COMPLEX_TYPE
3583 && targetm
.calls
.split_complex_arg (complex_type
))
3586 tree real
, imag
, next
;
3588 subtype
= TREE_TYPE (complex_type
);
3589 complex_value
= save_expr (complex_value
);
3590 real
= build1 (REALPART_EXPR
, subtype
, complex_value
);
3591 imag
= build1 (IMAGPART_EXPR
, subtype
, complex_value
);
3593 TREE_VALUE (p
) = real
;
3594 next
= TREE_CHAIN (p
);
3595 imag
= build_tree_list (NULL_TREE
, imag
);
3596 TREE_CHAIN (p
) = imag
;
3597 TREE_CHAIN (imag
) = next
;
3599 /* Skip the newly created node. */
3607 /* Traverse a list of TYPES and expand all complex types into their
3610 split_complex_types (tree types
)
3614 /* Before allocating memory, check for the common case of no complex. */
3615 for (p
= types
; p
; p
= TREE_CHAIN (p
))
3617 tree type
= TREE_VALUE (p
);
3618 if (TREE_CODE (type
) == COMPLEX_TYPE
3619 && targetm
.calls
.split_complex_arg (type
))
3625 types
= copy_list (types
);
3627 for (p
= types
; p
; p
= TREE_CHAIN (p
))
3629 tree complex_type
= TREE_VALUE (p
);
3631 if (TREE_CODE (complex_type
) == COMPLEX_TYPE
3632 && targetm
.calls
.split_complex_arg (complex_type
))
3636 /* Rewrite complex type with component type. */
3637 TREE_VALUE (p
) = TREE_TYPE (complex_type
);
3638 next
= TREE_CHAIN (p
);
3640 /* Add another component type for the imaginary part. */
3641 imag
= build_tree_list (NULL_TREE
, TREE_VALUE (p
));
3642 TREE_CHAIN (p
) = imag
;
3643 TREE_CHAIN (imag
) = next
;
3645 /* Skip the newly created node. */
3653 /* Output a library call to function FUN (a SYMBOL_REF rtx).
3654 The RETVAL parameter specifies whether return value needs to be saved, other
3655 parameters are documented in the emit_library_call function below. */
3658 emit_library_call_value_1 (int retval
, rtx orgfun
, rtx value
,
3659 enum libcall_type fn_type
,
3660 enum machine_mode outmode
, int nargs
, va_list p
)
3662 /* Total size in bytes of all the stack-parms scanned so far. */
3663 struct args_size args_size
;
3664 /* Size of arguments before any adjustments (such as rounding). */
3665 struct args_size original_args_size
;
3671 CUMULATIVE_ARGS args_so_far
;
3675 enum machine_mode mode
;
3678 struct locate_and_pad_arg_data locate
;
3682 int old_inhibit_defer_pop
= inhibit_defer_pop
;
3683 rtx call_fusage
= 0;
3686 int pcc_struct_value
= 0;
3687 int struct_value_size
= 0;
3689 int reg_parm_stack_space
= 0;
3692 tree tfom
; /* type_for_mode (outmode, 0) */
3694 #ifdef REG_PARM_STACK_SPACE
3695 /* Define the boundary of the register parm stack space that needs to be
3697 int low_to_save
, high_to_save
;
3698 rtx save_area
= 0; /* Place that it is saved. */
3701 /* Size of the stack reserved for parameter registers. */
3702 int initial_highest_arg_in_use
= highest_outgoing_arg_in_use
;
3703 char *initial_stack_usage_map
= stack_usage_map
;
3705 rtx struct_value
= targetm
.calls
.struct_value_rtx (0, 0);
3707 #ifdef REG_PARM_STACK_SPACE
3708 reg_parm_stack_space
= REG_PARM_STACK_SPACE ((tree
) 0);
3711 /* By default, library functions can not throw. */
3712 flags
= ECF_NOTHROW
;
3724 case LCT_CONST_MAKE_BLOCK
:
3725 flags
|= ECF_CONST
| ECF_LIBCALL_BLOCK
;
3727 case LCT_PURE_MAKE_BLOCK
:
3728 flags
|= ECF_PURE
| ECF_LIBCALL_BLOCK
;
3731 flags
|= ECF_NORETURN
;
3734 flags
= ECF_NORETURN
;
3736 case LCT_ALWAYS_RETURN
:
3737 flags
= ECF_ALWAYS_RETURN
;
3739 case LCT_RETURNS_TWICE
:
3740 flags
= ECF_RETURNS_TWICE
;
3745 /* Ensure current function's preferred stack boundary is at least
3747 if (cfun
->preferred_stack_boundary
< PREFERRED_STACK_BOUNDARY
)
3748 cfun
->preferred_stack_boundary
= PREFERRED_STACK_BOUNDARY
;
3750 /* If this kind of value comes back in memory,
3751 decide where in memory it should come back. */
3752 if (outmode
!= VOIDmode
)
3754 tfom
= lang_hooks
.types
.type_for_mode (outmode
, 0);
3755 if (aggregate_value_p (tfom
, 0))
3757 #ifdef PCC_STATIC_STRUCT_RETURN
3759 = hard_function_value (build_pointer_type (tfom
), 0, 0);
3760 mem_value
= gen_rtx_MEM (outmode
, pointer_reg
);
3761 pcc_struct_value
= 1;
3763 value
= gen_reg_rtx (outmode
);
3764 #else /* not PCC_STATIC_STRUCT_RETURN */
3765 struct_value_size
= GET_MODE_SIZE (outmode
);
3766 if (value
!= 0 && GET_CODE (value
) == MEM
)
3769 mem_value
= assign_temp (tfom
, 0, 1, 1);
3771 /* This call returns a big structure. */
3772 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LIBCALL_BLOCK
);
3776 tfom
= void_type_node
;
3778 /* ??? Unfinished: must pass the memory address as an argument. */
3780 /* Copy all the libcall-arguments out of the varargs data
3781 and into a vector ARGVEC.
3783 Compute how to pass each argument. We only support a very small subset
3784 of the full argument passing conventions to limit complexity here since
3785 library functions shouldn't have many args. */
3787 argvec
= alloca ((nargs
+ 1) * sizeof (struct arg
));
3788 memset (argvec
, 0, (nargs
+ 1) * sizeof (struct arg
));
3790 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
3791 INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far
, outmode
, fun
);
3793 INIT_CUMULATIVE_ARGS (args_so_far
, NULL_TREE
, fun
, 0, nargs
);
3796 args_size
.constant
= 0;
3801 /* Now we are about to start emitting insns that can be deleted
3802 if a libcall is deleted. */
3803 if (flags
& ECF_LIBCALL_BLOCK
)
3808 /* If there's a structure value address to be passed,
3809 either pass it in the special place, or pass it as an extra argument. */
3810 if (mem_value
&& struct_value
== 0 && ! pcc_struct_value
)
3812 rtx addr
= XEXP (mem_value
, 0);
3815 /* Make sure it is a reasonable operand for a move or push insn. */
3816 if (GET_CODE (addr
) != REG
&& GET_CODE (addr
) != MEM
3817 && ! (CONSTANT_P (addr
) && LEGITIMATE_CONSTANT_P (addr
)))
3818 addr
= force_operand (addr
, NULL_RTX
);
3820 argvec
[count
].value
= addr
;
3821 argvec
[count
].mode
= Pmode
;
3822 argvec
[count
].partial
= 0;
3824 argvec
[count
].reg
= FUNCTION_ARG (args_so_far
, Pmode
, NULL_TREE
, 1);
3825 #ifdef FUNCTION_ARG_PARTIAL_NREGS
3826 if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, Pmode
, NULL_TREE
, 1))
3830 locate_and_pad_parm (Pmode
, NULL_TREE
,
3831 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3834 argvec
[count
].reg
!= 0,
3836 0, NULL_TREE
, &args_size
, &argvec
[count
].locate
);
3838 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
3839 || reg_parm_stack_space
> 0)
3840 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
3842 FUNCTION_ARG_ADVANCE (args_so_far
, Pmode
, (tree
) 0, 1);
3847 for (; count
< nargs
; count
++)
3849 rtx val
= va_arg (p
, rtx
);
3850 enum machine_mode mode
= va_arg (p
, enum machine_mode
);
3852 /* We cannot convert the arg value to the mode the library wants here;
3853 must do it earlier where we know the signedness of the arg. */
3855 || (GET_MODE (val
) != mode
&& GET_MODE (val
) != VOIDmode
))
3858 /* There's no need to call protect_from_queue, because
3859 either emit_move_insn or emit_push_insn will do that. */
3861 /* Make sure it is a reasonable operand for a move or push insn. */
3862 if (GET_CODE (val
) != REG
&& GET_CODE (val
) != MEM
3863 && ! (CONSTANT_P (val
) && LEGITIMATE_CONSTANT_P (val
)))
3864 val
= force_operand (val
, NULL_RTX
);
3866 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
3867 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far
, mode
, NULL_TREE
, 1))
3871 #ifdef FUNCTION_ARG_CALLEE_COPIES
3872 && ! FUNCTION_ARG_CALLEE_COPIES (args_so_far
, mode
,
3877 /* loop.c won't look at CALL_INSN_FUNCTION_USAGE of const/pure
3878 functions, so we have to pretend this isn't such a function. */
3879 if (flags
& ECF_LIBCALL_BLOCK
)
3881 rtx insns
= get_insns ();
3885 flags
&= ~(ECF_CONST
| ECF_PURE
| ECF_LIBCALL_BLOCK
);
3887 /* If this was a CONST function, it is now PURE since
3888 it now reads memory. */
3889 if (flags
& ECF_CONST
)
3891 flags
&= ~ECF_CONST
;
3895 if (GET_MODE (val
) == MEM
&& ! must_copy
)
3899 slot
= assign_temp (lang_hooks
.types
.type_for_mode (mode
, 0),
3901 emit_move_insn (slot
, val
);
3905 tree type
= lang_hooks
.types
.type_for_mode (mode
, 0);
3908 = gen_rtx_MEM (mode
,
3909 expand_expr (build1 (ADDR_EXPR
,
3910 build_pointer_type (type
),
3911 make_tree (type
, val
)),
3912 NULL_RTX
, VOIDmode
, 0));
3915 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3916 gen_rtx_USE (VOIDmode
, slot
),
3919 call_fusage
= gen_rtx_EXPR_LIST (VOIDmode
,
3920 gen_rtx_CLOBBER (VOIDmode
,
3925 val
= force_operand (XEXP (slot
, 0), NULL_RTX
);
3929 argvec
[count
].value
= val
;
3930 argvec
[count
].mode
= mode
;
3932 argvec
[count
].reg
= FUNCTION_ARG (args_so_far
, mode
, NULL_TREE
, 1);
3934 #ifdef FUNCTION_ARG_PARTIAL_NREGS
3935 argvec
[count
].partial
3936 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far
, mode
, NULL_TREE
, 1);
3938 argvec
[count
].partial
= 0;
3941 locate_and_pad_parm (mode
, NULL_TREE
,
3942 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3945 argvec
[count
].reg
!= 0,
3947 argvec
[count
].partial
,
3948 NULL_TREE
, &args_size
, &argvec
[count
].locate
);
3950 if (argvec
[count
].locate
.size
.var
)
3953 if (argvec
[count
].reg
== 0 || argvec
[count
].partial
!= 0
3954 || reg_parm_stack_space
> 0)
3955 args_size
.constant
+= argvec
[count
].locate
.size
.constant
;
3957 FUNCTION_ARG_ADVANCE (args_so_far
, mode
, (tree
) 0, 1);
3960 /* If this machine requires an external definition for library
3961 functions, write one out. */
3962 assemble_external_libcall (fun
);
3964 original_args_size
= args_size
;
3965 args_size
.constant
= (((args_size
.constant
3966 + stack_pointer_delta
3970 - stack_pointer_delta
);
3972 args_size
.constant
= MAX (args_size
.constant
,
3973 reg_parm_stack_space
);
3975 #ifndef OUTGOING_REG_PARM_STACK_SPACE
3976 args_size
.constant
-= reg_parm_stack_space
;
3979 if (args_size
.constant
> current_function_outgoing_args_size
)
3980 current_function_outgoing_args_size
= args_size
.constant
;
3982 if (ACCUMULATE_OUTGOING_ARGS
)
3984 /* Since the stack pointer will never be pushed, it is possible for
3985 the evaluation of a parm to clobber something we have already
3986 written to the stack. Since most function calls on RISC machines
3987 do not use the stack, this is uncommon, but must work correctly.
3989 Therefore, we save any area of the stack that was already written
3990 and that we are using. Here we set up to do this by making a new
3991 stack usage map from the old one.
3993 Another approach might be to try to reorder the argument
3994 evaluations to avoid this conflicting stack usage. */
3996 needed
= args_size
.constant
;
3998 #ifndef OUTGOING_REG_PARM_STACK_SPACE
3999 /* Since we will be writing into the entire argument area, the
4000 map must be allocated for its entire size, not just the part that
4001 is the responsibility of the caller. */
4002 needed
+= reg_parm_stack_space
;
4005 #ifdef ARGS_GROW_DOWNWARD
4006 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
4009 highest_outgoing_arg_in_use
= MAX (initial_highest_arg_in_use
,
4012 stack_usage_map
= alloca (highest_outgoing_arg_in_use
);
4014 if (initial_highest_arg_in_use
)
4015 memcpy (stack_usage_map
, initial_stack_usage_map
,
4016 initial_highest_arg_in_use
);
4018 if (initial_highest_arg_in_use
!= highest_outgoing_arg_in_use
)
4019 memset (&stack_usage_map
[initial_highest_arg_in_use
], 0,
4020 highest_outgoing_arg_in_use
- initial_highest_arg_in_use
);
4023 /* We must be careful to use virtual regs before they're instantiated,
4024 and real regs afterwards. Loop optimization, for example, can create
4025 new libcalls after we've instantiated the virtual regs, and if we
4026 use virtuals anyway, they won't match the rtl patterns. */
4028 if (virtuals_instantiated
)
4029 argblock
= plus_constant (stack_pointer_rtx
, STACK_POINTER_OFFSET
);
4031 argblock
= virtual_outgoing_args_rtx
;
4036 argblock
= push_block (GEN_INT (args_size
.constant
), 0, 0);
4039 /* If we push args individually in reverse order, perform stack alignment
4040 before the first push (the last arg). */
4041 if (argblock
== 0 && PUSH_ARGS_REVERSED
)
4042 anti_adjust_stack (GEN_INT (args_size
.constant
4043 - original_args_size
.constant
));
4045 if (PUSH_ARGS_REVERSED
)
4056 #ifdef REG_PARM_STACK_SPACE
4057 if (ACCUMULATE_OUTGOING_ARGS
)
4059 /* The argument list is the property of the called routine and it
4060 may clobber it. If the fixed area has been used for previous
4061 parameters, we must save and restore it. */
4062 save_area
= save_fixed_argument_area (reg_parm_stack_space
, argblock
,
4063 &low_to_save
, &high_to_save
);
4067 /* Push the args that need to be pushed. */
4069 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4070 are to be pushed. */
4071 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
4073 enum machine_mode mode
= argvec
[argnum
].mode
;
4074 rtx val
= argvec
[argnum
].value
;
4075 rtx reg
= argvec
[argnum
].reg
;
4076 int partial
= argvec
[argnum
].partial
;
4077 int lower_bound
= 0, upper_bound
= 0, i
;
4079 if (! (reg
!= 0 && partial
== 0))
4081 if (ACCUMULATE_OUTGOING_ARGS
)
4083 /* If this is being stored into a pre-allocated, fixed-size,
4084 stack area, save any previous data at that location. */
4086 #ifdef ARGS_GROW_DOWNWARD
4087 /* stack_slot is negative, but we want to index stack_usage_map
4088 with positive values. */
4089 upper_bound
= -argvec
[argnum
].locate
.offset
.constant
+ 1;
4090 lower_bound
= upper_bound
- argvec
[argnum
].locate
.size
.constant
;
4092 lower_bound
= argvec
[argnum
].locate
.offset
.constant
;
4093 upper_bound
= lower_bound
+ argvec
[argnum
].locate
.size
.constant
;
4097 /* Don't worry about things in the fixed argument area;
4098 it has already been saved. */
4099 if (i
< reg_parm_stack_space
)
4100 i
= reg_parm_stack_space
;
4101 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
4104 if (i
< upper_bound
)
4106 /* We need to make a save area. */
4108 = argvec
[argnum
].locate
.size
.constant
* BITS_PER_UNIT
;
4109 enum machine_mode save_mode
4110 = mode_for_size (size
, MODE_INT
, 1);
4112 = plus_constant (argblock
,
4113 argvec
[argnum
].locate
.offset
.constant
);
4115 = gen_rtx_MEM (save_mode
, memory_address (save_mode
, adr
));
4117 if (save_mode
== BLKmode
)
4119 argvec
[argnum
].save_area
4120 = assign_stack_temp (BLKmode
,
4121 argvec
[argnum
].locate
.size
.constant
,
4124 emit_block_move (validize_mem (argvec
[argnum
].save_area
),
4126 GEN_INT (argvec
[argnum
].locate
.size
.constant
),
4127 BLOCK_OP_CALL_PARM
);
4131 argvec
[argnum
].save_area
= gen_reg_rtx (save_mode
);
4133 emit_move_insn (argvec
[argnum
].save_area
, stack_area
);
4138 emit_push_insn (val
, mode
, NULL_TREE
, NULL_RTX
, PARM_BOUNDARY
,
4139 partial
, reg
, 0, argblock
,
4140 GEN_INT (argvec
[argnum
].locate
.offset
.constant
),
4141 reg_parm_stack_space
,
4142 ARGS_SIZE_RTX (argvec
[argnum
].locate
.alignment_pad
));
4144 /* Now mark the segment we just used. */
4145 if (ACCUMULATE_OUTGOING_ARGS
)
4146 for (i
= lower_bound
; i
< upper_bound
; i
++)
4147 stack_usage_map
[i
] = 1;
4153 /* If we pushed args in forward order, perform stack alignment
4154 after pushing the last arg. */
4155 if (argblock
== 0 && !PUSH_ARGS_REVERSED
)
4156 anti_adjust_stack (GEN_INT (args_size
.constant
4157 - original_args_size
.constant
));
4159 if (PUSH_ARGS_REVERSED
)
4164 fun
= prepare_call_address (fun
, NULL_TREE
, &call_fusage
, 0, 0);
4166 /* Now load any reg parms into their regs. */
4168 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4169 are to be pushed. */
4170 for (count
= 0; count
< nargs
; count
++, argnum
+= inc
)
4172 rtx val
= argvec
[argnum
].value
;
4173 rtx reg
= argvec
[argnum
].reg
;
4174 int partial
= argvec
[argnum
].partial
;
4176 /* Handle calls that pass values in multiple non-contiguous
4177 locations. The PA64 has examples of this for library calls. */
4178 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
4179 emit_group_load (reg
, val
, NULL_TREE
, GET_MODE_SIZE (GET_MODE (val
)));
4180 else if (reg
!= 0 && partial
== 0)
4181 emit_move_insn (reg
, val
);
4186 /* Any regs containing parms remain in use through the call. */
4187 for (count
= 0; count
< nargs
; count
++)
4189 rtx reg
= argvec
[count
].reg
;
4190 if (reg
!= 0 && GET_CODE (reg
) == PARALLEL
)
4191 use_group_regs (&call_fusage
, reg
);
4193 use_reg (&call_fusage
, reg
);
4196 /* Pass the function the address in which to return a structure value. */
4197 if (mem_value
!= 0 && struct_value
!= 0 && ! pcc_struct_value
)
4199 emit_move_insn (struct_value
,
4201 force_operand (XEXP (mem_value
, 0),
4203 if (GET_CODE (struct_value
) == REG
)
4204 use_reg (&call_fusage
, struct_value
);
4207 /* Don't allow popping to be deferred, since then
4208 cse'ing of library calls could delete a call and leave the pop. */
4210 valreg
= (mem_value
== 0 && outmode
!= VOIDmode
4211 ? hard_libcall_value (outmode
) : NULL_RTX
);
4213 /* Stack must be properly aligned now. */
4214 if (stack_pointer_delta
& (PREFERRED_STACK_BOUNDARY
/ BITS_PER_UNIT
- 1))
4217 before_call
= get_last_insn ();
4219 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
4220 will set inhibit_defer_pop to that value. */
4221 /* The return type is needed to decide how many bytes the function pops.
4222 Signedness plays no role in that, so for simplicity, we pretend it's
4223 always signed. We also assume that the list of arguments passed has
4224 no impact, so we pretend it is unknown. */
4227 get_identifier (XSTR (orgfun
, 0)),
4228 build_function_type (tfom
, NULL_TREE
),
4229 original_args_size
.constant
, args_size
.constant
,
4231 FUNCTION_ARG (args_so_far
, VOIDmode
, void_type_node
, 1),
4233 old_inhibit_defer_pop
+ 1, call_fusage
, flags
, & args_so_far
);
4235 /* For calls to `setjmp', etc., inform flow.c it should complain
4236 if nonvolatile values are live. For functions that cannot return,
4237 inform flow that control does not fall through. */
4239 if (flags
& (ECF_NORETURN
| ECF_LONGJMP
))
4241 /* The barrier note must be emitted
4242 immediately after the CALL_INSN. Some ports emit more than
4243 just a CALL_INSN above, so we must search for it here. */
4245 rtx last
= get_last_insn ();
4246 while (GET_CODE (last
) != CALL_INSN
)
4248 last
= PREV_INSN (last
);
4249 /* There was no CALL_INSN? */
4250 if (last
== before_call
)
4254 emit_barrier_after (last
);
4257 /* Now restore inhibit_defer_pop to its actual original value. */
4260 /* If call is cse'able, make appropriate pair of reg-notes around it.
4261 Test valreg so we don't crash; may safely ignore `const'
4262 if return type is void. Disable for PARALLEL return values, because
4263 we have no way to move such values into a pseudo register. */
4264 if (flags
& ECF_LIBCALL_BLOCK
)
4270 insns
= get_insns ();
4280 if (GET_CODE (valreg
) == PARALLEL
)
4282 temp
= gen_reg_rtx (outmode
);
4283 emit_group_store (temp
, valreg
, NULL_TREE
,
4284 GET_MODE_SIZE (outmode
));
4288 temp
= gen_reg_rtx (GET_MODE (valreg
));
4290 /* Construct an "equal form" for the value which mentions all the
4291 arguments in order as well as the function name. */
4292 for (i
= 0; i
< nargs
; i
++)
4293 note
= gen_rtx_EXPR_LIST (VOIDmode
, argvec
[i
].value
, note
);
4294 note
= gen_rtx_EXPR_LIST (VOIDmode
, fun
, note
);
4296 insns
= get_insns ();
4299 if (flags
& ECF_PURE
)
4300 note
= gen_rtx_EXPR_LIST (VOIDmode
,
4301 gen_rtx_USE (VOIDmode
,
4302 gen_rtx_MEM (BLKmode
,
4303 gen_rtx_SCRATCH (VOIDmode
))),
4306 emit_libcall_block (insns
, temp
, valreg
, note
);
4313 /* Copy the value to the right place. */
4314 if (outmode
!= VOIDmode
&& retval
)
4320 if (value
!= mem_value
)
4321 emit_move_insn (value
, mem_value
);
4323 else if (GET_CODE (valreg
) == PARALLEL
)
4326 value
= gen_reg_rtx (outmode
);
4327 emit_group_store (value
, valreg
, NULL_TREE
, GET_MODE_SIZE (outmode
));
4329 else if (value
!= 0)
4330 emit_move_insn (value
, valreg
);
4335 if (ACCUMULATE_OUTGOING_ARGS
)
4337 #ifdef REG_PARM_STACK_SPACE
4339 restore_fixed_argument_area (save_area
, argblock
,
4340 high_to_save
, low_to_save
);
4343 /* If we saved any argument areas, restore them. */
4344 for (count
= 0; count
< nargs
; count
++)
4345 if (argvec
[count
].save_area
)
4347 enum machine_mode save_mode
= GET_MODE (argvec
[count
].save_area
);
4348 rtx adr
= plus_constant (argblock
,
4349 argvec
[count
].locate
.offset
.constant
);
4350 rtx stack_area
= gen_rtx_MEM (save_mode
,
4351 memory_address (save_mode
, adr
));
4353 if (save_mode
== BLKmode
)
4354 emit_block_move (stack_area
,
4355 validize_mem (argvec
[count
].save_area
),
4356 GEN_INT (argvec
[count
].locate
.size
.constant
),
4357 BLOCK_OP_CALL_PARM
);
4359 emit_move_insn (stack_area
, argvec
[count
].save_area
);
4362 highest_outgoing_arg_in_use
= initial_highest_arg_in_use
;
4363 stack_usage_map
= initial_stack_usage_map
;
4370 /* Output a library call to function FUN (a SYMBOL_REF rtx)
4371 (emitting the queue unless NO_QUEUE is nonzero),
4372 for a value of mode OUTMODE,
4373 with NARGS different arguments, passed as alternating rtx values
4374 and machine_modes to convert them to.
4375 The rtx values should have been passed through protect_from_queue already.
4377 FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for `const'
4378 calls, LCT_PURE for `pure' calls, LCT_CONST_MAKE_BLOCK for `const' calls
4379 which should be enclosed in REG_LIBCALL/REG_RETVAL notes,
4380 LCT_PURE_MAKE_BLOCK for `purep' calls which should be enclosed in
4381 REG_LIBCALL/REG_RETVAL notes with extra (use (memory (scratch)),
4382 or other LCT_ value for other types of library calls. */
4385 emit_library_call (rtx orgfun
, enum libcall_type fn_type
,
4386 enum machine_mode outmode
, int nargs
, ...)
4390 va_start (p
, nargs
);
4391 emit_library_call_value_1 (0, orgfun
, NULL_RTX
, fn_type
, outmode
, nargs
, p
);
4395 /* Like emit_library_call except that an extra argument, VALUE,
4396 comes second and says where to store the result.
4397 (If VALUE is zero, this function chooses a convenient way
4398 to return the value.
4400 This function returns an rtx for where the value is to be found.
4401 If VALUE is nonzero, VALUE is returned. */
4404 emit_library_call_value (rtx orgfun
, rtx value
,
4405 enum libcall_type fn_type
,
4406 enum machine_mode outmode
, int nargs
, ...)
4411 va_start (p
, nargs
);
4412 result
= emit_library_call_value_1 (1, orgfun
, value
, fn_type
, outmode
,
4419 /* Store a single argument for a function call
4420 into the register or memory area where it must be passed.
4421 *ARG describes the argument value and where to pass it.
4423 ARGBLOCK is the address of the stack-block for all the arguments,
4424 or 0 on a machine where arguments are pushed individually.
4426 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
4427 so must be careful about how the stack is used.
4429 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
4430 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
4431 that we need not worry about saving and restoring the stack.
4433 FNDECL is the declaration of the function we are calling.
4435 Return nonzero if this arg should cause sibcall failure,
4439 store_one_arg (struct arg_data
*arg
, rtx argblock
, int flags
,
4440 int variable_size ATTRIBUTE_UNUSED
, int reg_parm_stack_space
)
4442 tree pval
= arg
->tree_value
;
4446 int i
, lower_bound
= 0, upper_bound
= 0;
4447 int sibcall_failure
= 0;
4449 if (TREE_CODE (pval
) == ERROR_MARK
)
4452 /* Push a new temporary level for any temporaries we make for
4456 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
))
4458 /* If this is being stored into a pre-allocated, fixed-size, stack area,
4459 save any previous data at that location. */
4460 if (argblock
&& ! variable_size
&& arg
->stack
)
4462 #ifdef ARGS_GROW_DOWNWARD
4463 /* stack_slot is negative, but we want to index stack_usage_map
4464 with positive values. */
4465 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
4466 upper_bound
= -INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1)) + 1;
4470 lower_bound
= upper_bound
- arg
->locate
.size
.constant
;
4472 if (GET_CODE (XEXP (arg
->stack_slot
, 0)) == PLUS
)
4473 lower_bound
= INTVAL (XEXP (XEXP (arg
->stack_slot
, 0), 1));
4477 upper_bound
= lower_bound
+ arg
->locate
.size
.constant
;
4481 /* Don't worry about things in the fixed argument area;
4482 it has already been saved. */
4483 if (i
< reg_parm_stack_space
)
4484 i
= reg_parm_stack_space
;
4485 while (i
< upper_bound
&& stack_usage_map
[i
] == 0)
4488 if (i
< upper_bound
)
4490 /* We need to make a save area. */
4491 unsigned int size
= arg
->locate
.size
.constant
* BITS_PER_UNIT
;
4492 enum machine_mode save_mode
= mode_for_size (size
, MODE_INT
, 1);
4493 rtx adr
= memory_address (save_mode
, XEXP (arg
->stack_slot
, 0));
4494 rtx stack_area
= gen_rtx_MEM (save_mode
, adr
);
4496 if (save_mode
== BLKmode
)
4498 tree ot
= TREE_TYPE (arg
->tree_value
);
4499 tree nt
= build_qualified_type (ot
, (TYPE_QUALS (ot
)
4500 | TYPE_QUAL_CONST
));
4502 arg
->save_area
= assign_temp (nt
, 0, 1, 1);
4503 preserve_temp_slots (arg
->save_area
);
4504 emit_block_move (validize_mem (arg
->save_area
), stack_area
,
4505 expr_size (arg
->tree_value
),
4506 BLOCK_OP_CALL_PARM
);
4510 arg
->save_area
= gen_reg_rtx (save_mode
);
4511 emit_move_insn (arg
->save_area
, stack_area
);
4517 /* If this isn't going to be placed on both the stack and in registers,
4518 set up the register and number of words. */
4519 if (! arg
->pass_on_stack
)
4521 if (flags
& ECF_SIBCALL
)
4522 reg
= arg
->tail_call_reg
;
4525 partial
= arg
->partial
;
4528 if (reg
!= 0 && partial
== 0)
4529 /* Being passed entirely in a register. We shouldn't be called in
4533 /* If this arg needs special alignment, don't load the registers
4535 if (arg
->n_aligned_regs
!= 0)
4538 /* If this is being passed partially in a register, we can't evaluate
4539 it directly into its stack slot. Otherwise, we can. */
4540 if (arg
->value
== 0)
4542 /* stack_arg_under_construction is nonzero if a function argument is
4543 being evaluated directly into the outgoing argument list and
4544 expand_call must take special action to preserve the argument list
4545 if it is called recursively.
4547 For scalar function arguments stack_usage_map is sufficient to
4548 determine which stack slots must be saved and restored. Scalar
4549 arguments in general have pass_on_stack == 0.
4551 If this argument is initialized by a function which takes the
4552 address of the argument (a C++ constructor or a C function
4553 returning a BLKmode structure), then stack_usage_map is
4554 insufficient and expand_call must push the stack around the
4555 function call. Such arguments have pass_on_stack == 1.
4557 Note that it is always safe to set stack_arg_under_construction,
4558 but this generates suboptimal code if set when not needed. */
4560 if (arg
->pass_on_stack
)
4561 stack_arg_under_construction
++;
4563 arg
->value
= expand_expr (pval
,
4565 || TYPE_MODE (TREE_TYPE (pval
)) != arg
->mode
)
4566 ? NULL_RTX
: arg
->stack
,
4567 VOIDmode
, EXPAND_STACK_PARM
);
4569 /* If we are promoting object (or for any other reason) the mode
4570 doesn't agree, convert the mode. */
4572 if (arg
->mode
!= TYPE_MODE (TREE_TYPE (pval
)))
4573 arg
->value
= convert_modes (arg
->mode
, TYPE_MODE (TREE_TYPE (pval
)),
4574 arg
->value
, arg
->unsignedp
);
4576 if (arg
->pass_on_stack
)
4577 stack_arg_under_construction
--;
4580 /* Don't allow anything left on stack from computation
4581 of argument to alloca. */
4582 if (flags
& ECF_MAY_BE_ALLOCA
)
4583 do_pending_stack_adjust ();
4585 if (arg
->value
== arg
->stack
)
4586 /* If the value is already in the stack slot, we are done. */
4588 else if (arg
->mode
!= BLKmode
)
4592 /* Argument is a scalar, not entirely passed in registers.
4593 (If part is passed in registers, arg->partial says how much
4594 and emit_push_insn will take care of putting it there.)
4596 Push it, and if its size is less than the
4597 amount of space allocated to it,
4598 also bump stack pointer by the additional space.
4599 Note that in C the default argument promotions
4600 will prevent such mismatches. */
4602 size
= GET_MODE_SIZE (arg
->mode
);
4603 /* Compute how much space the push instruction will push.
4604 On many machines, pushing a byte will advance the stack
4605 pointer by a halfword. */
4606 #ifdef PUSH_ROUNDING
4607 size
= PUSH_ROUNDING (size
);
4611 /* Compute how much space the argument should get:
4612 round up to a multiple of the alignment for arguments. */
4613 if (none
!= FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)))
4614 used
= (((size
+ PARM_BOUNDARY
/ BITS_PER_UNIT
- 1)
4615 / (PARM_BOUNDARY
/ BITS_PER_UNIT
))
4616 * (PARM_BOUNDARY
/ BITS_PER_UNIT
));
4618 /* This isn't already where we want it on the stack, so put it there.
4619 This can either be done with push or copy insns. */
4620 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), NULL_RTX
,
4621 PARM_BOUNDARY
, partial
, reg
, used
- size
, argblock
,
4622 ARGS_SIZE_RTX (arg
->locate
.offset
), reg_parm_stack_space
,
4623 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
));
4625 /* Unless this is a partially-in-register argument, the argument is now
4628 arg
->value
= arg
->stack
;
4632 /* BLKmode, at least partly to be pushed. */
4634 unsigned int parm_align
;
4638 /* Pushing a nonscalar.
4639 If part is passed in registers, PARTIAL says how much
4640 and emit_push_insn will take care of putting it there. */
4642 /* Round its size up to a multiple
4643 of the allocation unit for arguments. */
4645 if (arg
->locate
.size
.var
!= 0)
4648 size_rtx
= ARGS_SIZE_RTX (arg
->locate
.size
);
4652 /* PUSH_ROUNDING has no effect on us, because
4653 emit_push_insn for BLKmode is careful to avoid it. */
4654 if (reg
&& GET_CODE (reg
) == PARALLEL
)
4656 /* Use the size of the elt to compute excess. */
4657 rtx elt
= XEXP (XVECEXP (reg
, 0, 0), 0);
4658 excess
= (arg
->locate
.size
.constant
4659 - int_size_in_bytes (TREE_TYPE (pval
))
4660 + partial
* GET_MODE_SIZE (GET_MODE (elt
)));
4663 excess
= (arg
->locate
.size
.constant
4664 - int_size_in_bytes (TREE_TYPE (pval
))
4665 + partial
* UNITS_PER_WORD
);
4666 size_rtx
= expand_expr (size_in_bytes (TREE_TYPE (pval
)),
4667 NULL_RTX
, TYPE_MODE (sizetype
), 0);
4670 /* Some types will require stricter alignment, which will be
4671 provided for elsewhere in argument layout. */
4672 parm_align
= MAX (PARM_BOUNDARY
, TYPE_ALIGN (TREE_TYPE (pval
)));
4674 /* When an argument is padded down, the block is aligned to
4675 PARM_BOUNDARY, but the actual argument isn't. */
4676 if (FUNCTION_ARG_PADDING (arg
->mode
, TREE_TYPE (pval
)) == downward
)
4678 if (arg
->locate
.size
.var
)
4679 parm_align
= BITS_PER_UNIT
;
4682 unsigned int excess_align
= (excess
& -excess
) * BITS_PER_UNIT
;
4683 parm_align
= MIN (parm_align
, excess_align
);
4687 if ((flags
& ECF_SIBCALL
) && GET_CODE (arg
->value
) == MEM
)
4689 /* emit_push_insn might not work properly if arg->value and
4690 argblock + arg->locate.offset areas overlap. */
4694 if (XEXP (x
, 0) == current_function_internal_arg_pointer
4695 || (GET_CODE (XEXP (x
, 0)) == PLUS
4696 && XEXP (XEXP (x
, 0), 0) ==
4697 current_function_internal_arg_pointer
4698 && GET_CODE (XEXP (XEXP (x
, 0), 1)) == CONST_INT
))
4700 if (XEXP (x
, 0) != current_function_internal_arg_pointer
)
4701 i
= INTVAL (XEXP (XEXP (x
, 0), 1));
4703 /* expand_call should ensure this. */
4704 if (arg
->locate
.offset
.var
|| GET_CODE (size_rtx
) != CONST_INT
)
4707 if (arg
->locate
.offset
.constant
> i
)
4709 if (arg
->locate
.offset
.constant
< i
+ INTVAL (size_rtx
))
4710 sibcall_failure
= 1;
4712 else if (arg
->locate
.offset
.constant
< i
)
4714 if (i
< arg
->locate
.offset
.constant
+ INTVAL (size_rtx
))
4715 sibcall_failure
= 1;
4720 emit_push_insn (arg
->value
, arg
->mode
, TREE_TYPE (pval
), size_rtx
,
4721 parm_align
, partial
, reg
, excess
, argblock
,
4722 ARGS_SIZE_RTX (arg
->locate
.offset
), reg_parm_stack_space
,
4723 ARGS_SIZE_RTX (arg
->locate
.alignment_pad
));
4725 /* Unless this is a partially-in-register argument, the argument is now
4728 ??? Unlike the case above, in which we want the actual
4729 address of the data, so that we can load it directly into a
4730 register, here we want the address of the stack slot, so that
4731 it's properly aligned for word-by-word copying or something
4732 like that. It's not clear that this is always correct. */
4734 arg
->value
= arg
->stack_slot
;
4737 /* Mark all slots this store used. */
4738 if (ACCUMULATE_OUTGOING_ARGS
&& !(flags
& ECF_SIBCALL
)
4739 && argblock
&& ! variable_size
&& arg
->stack
)
4740 for (i
= lower_bound
; i
< upper_bound
; i
++)
4741 stack_usage_map
[i
] = 1;
4743 /* Once we have pushed something, pops can't safely
4744 be deferred during the rest of the arguments. */
4747 /* ANSI doesn't require a sequence point here,
4748 but PCC has one, so this will avoid some problems. */
4751 /* Free any temporary slots made in processing this argument. Show
4752 that we might have taken the address of something and pushed that
4754 preserve_temp_slots (NULL_RTX
);
4758 return sibcall_failure
;
4761 /* Nonzero if we do not know how to pass TYPE solely in registers.
4762 We cannot do so in the following cases:
4764 - if the type has variable size
4765 - if the type is marked as addressable (it is required to be constructed
4767 - if the padding and mode of the type is such that a copy into a register
4768 would put it into the wrong part of the register.
4770 Which padding can't be supported depends on the byte endianness.
4772 A value in a register is implicitly padded at the most significant end.
4773 On a big-endian machine, that is the lower end in memory.
4774 So a value padded in memory at the upper end can't go in a register.
4775 For a little-endian machine, the reverse is true. */
4778 default_must_pass_in_stack (enum machine_mode mode
, tree type
)
4783 /* If the type has variable size... */
4784 if (TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4787 /* If the type is marked as addressable (it is required
4788 to be constructed into the stack)... */
4789 if (TREE_ADDRESSABLE (type
))
4792 /* If the padding and mode of the type is such that a copy into
4793 a register would put it into the wrong part of the register. */
4795 && int_size_in_bytes (type
) % (PARM_BOUNDARY
/ BITS_PER_UNIT
)
4796 && (FUNCTION_ARG_PADDING (mode
, type
)
4797 == (BYTES_BIG_ENDIAN
? upward
: downward
)))