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 #ifdef MAYBE_REG_PARM_STACK_SPACE
1353 if (reg_parm_stack_space == 0)
1354 args_size->constant = 0;
1357 #ifndef OUTGOING_REG_PARM_STACK_SPACE
1358 args_size->constant -= reg_parm_stack_space;
1361 return unadjusted_args_size;
1364 /* Precompute parameters as needed for a function call.
1366 FLAGS is mask of ECF_* constants.
1368 NUM_ACTUALS is the number of arguments.
1370 ARGS is an array containing information for each argument; this
1371 routine fills in the INITIAL_VALUE and VALUE fields for each
1372 precomputed argument. */
1375 precompute_arguments (int flags, int num_actuals, struct arg_data *args)
1379 /* If this function call is cse'able, precompute all the parameters.
1380 Note that if the parameter is constructed into a temporary, this will
1381 cause an additional copy because the parameter will be constructed
1382 into a temporary location and then copied into the outgoing arguments.
1383 If a parameter contains a call to alloca and this function uses the
1384 stack, precompute the parameter. */
1386 /* If we preallocated the stack space, and some arguments must be passed
1387 on the stack, then we must precompute any parameter which contains a
1388 function call which will store arguments on the stack.
1389 Otherwise, evaluating the parameter may clobber previous parameters
1390 which have already been stored into the stack. (we have code to avoid
1391 such case by saving the outgoing stack arguments, but it results in
1394 for (i = 0; i < num_actuals; i++)
1395 if ((flags & ECF_LIBCALL_BLOCK)
1396 || calls_function (args[i].tree_value, !ACCUMULATE_OUTGOING_ARGS))
1398 enum machine_mode mode;
1400 /* If this is an addressable type, we cannot pre-evaluate it. */
1401 if (TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value)))
1405 = expand_expr (args[i].tree_value, NULL_RTX, VOIDmode, 0);
1407 /* ANSI doesn't require a sequence point here,
1408 but PCC has one, so this will avoid some problems. */
1411 args[i].initial_value = args[i].value
1412 = protect_from_queue (args[i].value, 0);
1414 mode = TYPE_MODE (TREE_TYPE (args[i].tree_value));
1415 if (mode != args[i].mode)
1418 = convert_modes (args[i].mode, mode,
1419 args[i].value, args[i].unsignedp);
1420 #ifdef PROMOTE_FOR_CALL_ONLY
1421 /* CSE will replace this only if it contains args[i].value
1422 pseudo, so convert it down to the declared mode using
1424 if (GET_CODE (args[i].value) == REG
1425 && GET_MODE_CLASS (args[i].mode) == MODE_INT)
1427 args[i].initial_value
1428 = gen_lowpart_SUBREG (mode, args[i].value);
1429 SUBREG_PROMOTED_VAR_P (args[i].initial_value) = 1;
1430 SUBREG_PROMOTED_UNSIGNED_SET (args[i].initial_value,
1438 /* Given the current state of MUST_PREALLOCATE and information about
1439 arguments to a function call in NUM_ACTUALS, ARGS and ARGS_SIZE,
1440 compute and return the final value for MUST_PREALLOCATE. */
1443 finalize_must_preallocate (int must_preallocate, int num_actuals, struct arg_data *args, struct args_size *args_size)
1445 /* See if we have or want to preallocate stack space.
1447 If we would have to push a partially-in-regs parm
1448 before other stack parms, preallocate stack space instead.
1450 If the size of some parm is not a multiple of the required stack
1451 alignment, we must preallocate.
1453 If the total size of arguments that would otherwise create a copy in
1454 a temporary (such as a CALL) is more than half the total argument list
1455 size, preallocation is faster.
1457 Another reason to preallocate is if we have a machine (like the m88k)
1458 where stack alignment is required to be maintained between every
1459 pair of insns, not just when the call is made. However, we assume here
1460 that such machines either do not have push insns (and hence preallocation
1461 would occur anyway) or the problem is taken care of with
1464 if (! must_preallocate)
1466 int partial_seen = 0;
1467 int copy_to_evaluate_size = 0;
1470 for (i = 0; i < num_actuals && ! must_preallocate; i++)
1472 if (args[i].partial > 0 && ! args[i].pass_on_stack)
1474 else if (partial_seen && args[i].reg == 0)
1475 must_preallocate = 1;
1477 if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode
1478 && (TREE_CODE (args[i].tree_value) == CALL_EXPR
1479 || TREE_CODE (args[i].tree_value) == TARGET_EXPR
1480 || TREE_CODE (args[i].tree_value) == COND_EXPR
1481 || TREE_ADDRESSABLE (TREE_TYPE (args[i].tree_value))))
1482 copy_to_evaluate_size
1483 += int_size_in_bytes (TREE_TYPE (args[i].tree_value));
1486 if (copy_to_evaluate_size * 2 >= args_size->constant
1487 && args_size->constant > 0)
1488 must_preallocate = 1;
1490 return must_preallocate;
1493 /* If we preallocated stack space, compute the address of each argument
1494 and store it into the ARGS array.
1496 We need not ensure it is a valid memory address here; it will be
1497 validized when it is used.
1499 ARGBLOCK is an rtx for the address of the outgoing arguments. */
1502 compute_argument_addresses (struct arg_data *args, rtx argblock, int num_actuals)
1506 rtx arg_reg = argblock;
1507 int i, arg_offset = 0;
1509 if (GET_CODE (argblock) == PLUS)
1510 arg_reg = XEXP (argblock, 0), arg_offset = INTVAL (XEXP (argblock, 1));
1512 for (i = 0; i < num_actuals; i++)
1514 rtx offset = ARGS_SIZE_RTX (args[i].locate.offset);
1515 rtx slot_offset = ARGS_SIZE_RTX (args[i].locate.slot_offset);
1518 /* Skip this parm if it will not be passed on the stack. */
1519 if (! args[i].pass_on_stack && args[i].reg != 0)
1522 if (GET_CODE (offset) == CONST_INT)
1523 addr = plus_constant (arg_reg, INTVAL (offset));
1525 addr = gen_rtx_PLUS (Pmode, arg_reg, offset);
1527 addr = plus_constant (addr, arg_offset);
1528 args[i].stack = gen_rtx_MEM (args[i].mode, addr);
1529 set_mem_align (args[i].stack, PARM_BOUNDARY);
1530 set_mem_attributes (args[i].stack,
1531 TREE_TYPE (args[i].tree_value), 1);
1533 if (GET_CODE (slot_offset) == CONST_INT)
1534 addr = plus_constant (arg_reg, INTVAL (slot_offset));
1536 addr = gen_rtx_PLUS (Pmode, arg_reg, slot_offset);
1538 addr = plus_constant (addr, arg_offset);
1539 args[i].stack_slot = gen_rtx_MEM (args[i].mode, addr);
1540 set_mem_align (args[i].stack_slot, PARM_BOUNDARY);
1541 set_mem_attributes (args[i].stack_slot,
1542 TREE_TYPE (args[i].tree_value), 1);
1544 /* Function incoming arguments may overlap with sibling call
1545 outgoing arguments and we cannot allow reordering of reads
1546 from function arguments with stores to outgoing arguments
1547 of sibling calls. */
1548 set_mem_alias_set (args[i].stack, 0);
1549 set_mem_alias_set (args[i].stack_slot, 0);
1554 /* Given a FNDECL and EXP, return an rtx suitable for use as a target address
1555 in a call instruction.
1557 FNDECL is the tree node for the target function. For an indirect call
1558 FNDECL will be NULL_TREE.
1560 ADDR is the operand 0 of CALL_EXPR for this call. */
1563 rtx_for_function_call (tree fndecl, tree addr)
1567 /* Get the function to call, in the form of RTL. */
1570 /* If this is the first use of the function, see if we need to
1571 make an external definition for it. */
1572 if (! TREE_USED (fndecl))
1574 assemble_external (fndecl);
1575 TREE_USED (fndecl) = 1;
1578 /* Get a SYMBOL_REF rtx for the function address. */
1579 funexp = XEXP (DECL_RTL (fndecl), 0);
1582 /* Generate an rtx (probably a pseudo-register) for the address. */
1585 funexp = expand_expr (addr, NULL_RTX, VOIDmode, 0);
1586 pop_temp_slots (); /* FUNEXP can't be BLKmode. */
1592 /* Do the register loads required for any wholly-register parms or any
1593 parms which are passed both on the stack and in a register. Their
1594 expressions were already evaluated.
1596 Mark all register-parms as living through the call, putting these USE
1597 insns in the CALL_INSN_FUNCTION_USAGE field.
1599 When IS_SIBCALL, perform the check_sibcall_overlap_argument_overlap
1600 checking, setting *SIBCALL_FAILURE if appropriate. */
1603 load_register_parameters (struct arg_data *args, int num_actuals,
1604 rtx *call_fusage, int flags, int is_sibcall,
1605 int *sibcall_failure)
1609 for (i = 0; i < num_actuals; i++)
1611 rtx reg = ((flags & ECF_SIBCALL)
1612 ? args[i].tail_call_reg : args[i].reg);
1615 int partial = args[i].partial;
1618 rtx before_arg = get_last_insn ();
1619 /* Set to non-negative if must move a word at a time, even if just
1620 one word (e.g, partial == 1 && mode == DFmode). Set to -1 if
1621 we just use a normal move insn. This value can be zero if the
1622 argument is a zero size structure with no fields. */
1626 else if (TYPE_MODE (TREE_TYPE (args[i].tree_value)) == BLKmode)
1628 size = int_size_in_bytes (TREE_TYPE (args[i].tree_value));
1629 nregs = (size + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
1632 size = GET_MODE_SIZE (args[i].mode);
1634 /* Handle calls that pass values in multiple non-contiguous
1635 locations. The Irix 6 ABI has examples of this. */
1637 if (GET_CODE (reg) == PARALLEL)
1639 tree type = TREE_TYPE (args[i].tree_value);
1640 emit_group_load (reg, args[i].value, type,
1641 int_size_in_bytes (type));
1644 /* If simple case, just do move. If normal partial, store_one_arg
1645 has already loaded the register for us. In all other cases,
1646 load the register(s) from memory. */
1648 else if (nregs == -1)
1650 emit_move_insn (reg, args[i].value);
1651 #ifdef BLOCK_REG_PADDING
1652 /* Handle case where we have a value that needs shifting
1653 up to the msb. eg. a QImode value and we're padding
1654 upward on a BYTES_BIG_ENDIAN machine. */
1655 if (size < UNITS_PER_WORD
1656 && (args[i].locate.where_pad
1657 == (BYTES_BIG_ENDIAN ? upward : downward)))
1660 int shift = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
1662 /* Assigning REG here rather than a temp makes CALL_FUSAGE
1663 report the whole reg as used. Strictly speaking, the
1664 call only uses SIZE bytes at the msb end, but it doesn't
1665 seem worth generating rtl to say that. */
1666 reg = gen_rtx_REG (word_mode, REGNO (reg));
1667 x = expand_binop (word_mode, ashl_optab, reg,
1668 GEN_INT (shift), reg, 1, OPTAB_WIDEN);
1670 emit_move_insn (reg, x);
1675 /* If we have pre-computed the values to put in the registers in
1676 the case of non-aligned structures, copy them in now. */
1678 else if (args[i].n_aligned_regs != 0)
1679 for (j = 0; j < args[i].n_aligned_regs; j++)
1680 emit_move_insn (gen_rtx_REG (word_mode, REGNO (reg) + j),
1681 args[i].aligned_regs[j]);
1683 else if (partial == 0 || args[i].pass_on_stack)
1685 rtx mem = validize_mem (args[i].value);
1687 #ifdef BLOCK_REG_PADDING
1688 /* Handle a BLKmode that needs shifting. */
1689 if (nregs == 1 && size < UNITS_PER_WORD
1690 && args[i].locate.where_pad == downward)
1692 rtx tem = operand_subword_force (mem, 0, args[i].mode);
1693 rtx ri = gen_rtx_REG (word_mode, REGNO (reg));
1694 rtx x = gen_reg_rtx (word_mode);
1695 int shift = (UNITS_PER_WORD - size) * BITS_PER_UNIT;
1696 optab dir = BYTES_BIG_ENDIAN ? lshr_optab : ashl_optab;
1698 emit_move_insn (x, tem);
1699 x = expand_binop (word_mode, dir, x, GEN_INT (shift),
1700 ri, 1, OPTAB_WIDEN);
1702 emit_move_insn (ri, x);
1706 move_block_to_reg (REGNO (reg), mem, nregs, args[i].mode);
1709 /* When a parameter is a block, and perhaps in other cases, it is
1710 possible that it did a load from an argument slot that was
1711 already clobbered. */
1713 && check_sibcall_argument_overlap (before_arg, &args[i], 0))
1714 *sibcall_failure = 1;
1716 /* Handle calls that pass values in multiple non-contiguous
1717 locations. The Irix 6 ABI has examples of this. */
1718 if (GET_CODE (reg) == PARALLEL)
1719 use_group_regs (call_fusage, reg);
1720 else if (nregs == -1)
1721 use_reg (call_fusage, reg);
1723 use_regs (call_fusage, REGNO (reg), nregs == 0 ? 1 : nregs);
1728 /* Try to integrate function. See expand_inline_function for documentation
1729 about the parameters. */
1732 try_to_integrate (tree fndecl, tree actparms, rtx target, int ignore,
1733 tree type, rtx structure_value_addr)
1738 rtx old_stack_level = 0;
1739 int reg_parm_stack_space = 0;
1741 #ifdef REG_PARM_STACK_SPACE
1742 #ifdef MAYBE_REG_PARM_STACK_SPACE
1743 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
1745 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
1749 before_call = get_last_insn ();
1751 timevar_push (TV_INTEGRATION);
1753 temp = expand_inline_function (fndecl, actparms, target,
1755 structure_value_addr);
1757 timevar_pop (TV_INTEGRATION);
1759 /* If inlining succeeded, return. */
1760 if (temp != (rtx) (size_t) - 1)
1762 if (ACCUMULATE_OUTGOING_ARGS)
1764 /* If the outgoing argument list must be preserved, push
1765 the stack before executing the inlined function if it
1768 i = reg_parm_stack_space;
1769 if (i > highest_outgoing_arg_in_use)
1770 i = highest_outgoing_arg_in_use;
1771 while (--i >= 0 && stack_usage_map[i] == 0)
1774 if (stack_arg_under_construction || i >= 0)
1777 = before_call ? NEXT_INSN (before_call) : get_insns ();
1778 rtx insn = NULL_RTX, seq;
1780 /* Look for a call in the inline function code.
1781 If DECL_SAVED_INSNS (fndecl)->outgoing_args_size is
1782 nonzero then there is a call and it is not necessary
1783 to scan the insns. */
1785 if (DECL_SAVED_INSNS (fndecl)->outgoing_args_size == 0)
1786 for (insn = first_insn; insn; insn = NEXT_INSN (insn))
1787 if (GET_CODE (insn) == CALL_INSN)
1792 /* Reserve enough stack space so that the largest
1793 argument list of any function call in the inline
1794 function does not overlap the argument list being
1795 evaluated. This is usually an overestimate because
1796 allocate_dynamic_stack_space reserves space for an
1797 outgoing argument list in addition to the requested
1798 space, but there is no way to ask for stack space such
1799 that an argument list of a certain length can be
1802 Add the stack space reserved for register arguments, if
1803 any, in the inline function. What is really needed is the
1804 largest value of reg_parm_stack_space in the inline
1805 function, but that is not available. Using the current
1806 value of reg_parm_stack_space is wrong, but gives
1807 correct results on all supported machines. */
1809 int adjust = (DECL_SAVED_INSNS (fndecl)->outgoing_args_size
1810 + reg_parm_stack_space);
1813 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
1814 allocate_dynamic_stack_space (GEN_INT (adjust),
1815 NULL_RTX, BITS_PER_UNIT);
1818 emit_insn_before (seq, first_insn);
1819 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
1824 /* If the result is equivalent to TARGET, return TARGET to simplify
1825 checks in store_expr. They can be equivalent but not equal in the
1826 case of a function that returns BLKmode. */
1827 if (temp != target && rtx_equal_p (temp, target))
1832 /* If inlining failed, mark FNDECL as needing to be compiled
1833 separately after all. If function was declared inline,
1835 if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline
1836 && optimize > 0 && !TREE_ADDRESSABLE (fndecl))
1838 warning ("%Jinlining failed in call to '%F'", fndecl, fndecl);
1839 warning ("called from here");
1841 (*lang_hooks.mark_addressable) (fndecl);
1842 return (rtx) (size_t) - 1;
1845 /* We need to pop PENDING_STACK_ADJUST bytes. But, if the arguments
1846 wouldn't fill up an even multiple of PREFERRED_UNIT_STACK_BOUNDARY
1847 bytes, then we would need to push some additional bytes to pad the
1848 arguments. So, we compute an adjust to the stack pointer for an
1849 amount that will leave the stack under-aligned by UNADJUSTED_ARGS_SIZE
1850 bytes. Then, when the arguments are pushed the stack will be perfectly
1851 aligned. ARGS_SIZE->CONSTANT is set to the number of bytes that should
1852 be popped after the call. Returns the adjustment. */
1855 combine_pending_stack_adjustment_and_call (int unadjusted_args_size,
1856 struct args_size *args_size,
1857 int preferred_unit_stack_boundary)
1859 /* The number of bytes to pop so that the stack will be
1860 under-aligned by UNADJUSTED_ARGS_SIZE bytes. */
1861 HOST_WIDE_INT adjustment;
1862 /* The alignment of the stack after the arguments are pushed, if we
1863 just pushed the arguments without adjust the stack here. */
1864 HOST_WIDE_INT unadjusted_alignment;
1866 unadjusted_alignment
1867 = ((stack_pointer_delta + unadjusted_args_size)
1868 % preferred_unit_stack_boundary);
1870 /* We want to get rid of as many of the PENDING_STACK_ADJUST bytes
1871 as possible -- leaving just enough left to cancel out the
1872 UNADJUSTED_ALIGNMENT. In other words, we want to ensure that the
1873 PENDING_STACK_ADJUST is non-negative, and congruent to
1874 -UNADJUSTED_ALIGNMENT modulo the PREFERRED_UNIT_STACK_BOUNDARY. */
1876 /* Begin by trying to pop all the bytes. */
1877 unadjusted_alignment
1878 = (unadjusted_alignment
1879 - (pending_stack_adjust % preferred_unit_stack_boundary));
1880 adjustment = pending_stack_adjust;
1881 /* Push enough additional bytes that the stack will be aligned
1882 after the arguments are pushed. */
1883 if (preferred_unit_stack_boundary > 1)
1885 if (unadjusted_alignment > 0)
1886 adjustment -= preferred_unit_stack_boundary - unadjusted_alignment;
1888 adjustment += unadjusted_alignment;
1891 /* Now, sets ARGS_SIZE->CONSTANT so that we pop the right number of
1892 bytes after the call. The right number is the entire
1893 PENDING_STACK_ADJUST less our ADJUSTMENT plus the amount required
1894 by the arguments in the first place. */
1896 = pending_stack_adjust - adjustment + unadjusted_args_size;
1901 /* Scan X expression if it does not dereference any argument slots
1902 we already clobbered by tail call arguments (as noted in stored_args_map
1904 Return nonzero if X expression dereferences such argument slots,
1908 check_sibcall_argument_overlap_1 (rtx x)
1918 code = GET_CODE (x);
1922 if (XEXP (x, 0) == current_function_internal_arg_pointer)
1924 else if (GET_CODE (XEXP (x, 0)) == PLUS
1925 && XEXP (XEXP (x, 0), 0) ==
1926 current_function_internal_arg_pointer
1927 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT)
1928 i = INTVAL (XEXP (XEXP (x, 0), 1));
1932 #ifdef ARGS_GROW_DOWNWARD
1933 i = -i - GET_MODE_SIZE (GET_MODE (x));
1936 for (k = 0; k < GET_MODE_SIZE (GET_MODE (x)); k++)
1937 if (i + k < stored_args_map->n_bits
1938 && TEST_BIT (stored_args_map, i + k))
1944 /* Scan all subexpressions. */
1945 fmt = GET_RTX_FORMAT (code);
1946 for (i = 0; i < GET_RTX_LENGTH (code); i++, fmt++)
1950 if (check_sibcall_argument_overlap_1 (XEXP (x, i)))
1953 else if (*fmt == 'E')
1955 for (j = 0; j < XVECLEN (x, i); j++)
1956 if (check_sibcall_argument_overlap_1 (XVECEXP (x, i, j)))
1963 /* Scan sequence after INSN if it does not dereference any argument slots
1964 we already clobbered by tail call arguments (as noted in stored_args_map
1965 bitmap). If MARK_STORED_ARGS_MAP, add stack slots for ARG to
1966 stored_args_map bitmap afterwards (when ARG is a register MARK_STORED_ARGS_MAP
1967 should be 0). Return nonzero if sequence after INSN dereferences such argument
1968 slots, zero otherwise. */
1971 check_sibcall_argument_overlap (rtx insn, struct arg_data *arg, int mark_stored_args_map)
1975 if (insn == NULL_RTX)
1976 insn = get_insns ();
1978 insn = NEXT_INSN (insn);
1980 for (; insn; insn = NEXT_INSN (insn))
1982 && check_sibcall_argument_overlap_1 (PATTERN (insn)))
1985 if (mark_stored_args_map)
1987 #ifdef ARGS_GROW_DOWNWARD
1988 low = -arg->locate.slot_offset.constant - arg->locate.size.constant;
1990 low = arg->locate.slot_offset.constant;
1993 for (high = low + arg->locate.size.constant; low < high; low++)
1994 SET_BIT (stored_args_map, low);
1996 return insn != NULL_RTX;
2000 fix_unsafe_tree (tree t)
2002 switch (unsafe_for_reeval (t))
2007 case 1: /* Mildly unsafe. */
2008 t = unsave_expr (t);
2011 case 2: /* Wildly unsafe. */
2013 tree var = build_decl (VAR_DECL, NULL_TREE,
2016 expand_expr (t, NULL_RTX, VOIDmode, EXPAND_NORMAL));
2028 /* If function value *VALUE was returned at the most significant end of a
2029 register, shift it towards the least significant end and convert it to
2030 TYPE's mode. Return true and update *VALUE if some action was needed.
2032 TYPE is the type of the function's return value, which is known not
2033 to have mode BLKmode. */
2036 shift_returned_value (tree type, rtx *value)
2038 if (targetm.calls.return_in_msb (type))
2040 HOST_WIDE_INT shift;
2042 shift = (GET_MODE_BITSIZE (GET_MODE (*value))
2043 - BITS_PER_UNIT * int_size_in_bytes (type));
2046 *value = expand_binop (GET_MODE (*value), lshr_optab, *value,
2047 GEN_INT (shift), 0, 1, OPTAB_WIDEN);
2048 *value = convert_to_mode (TYPE_MODE (type), *value, 0);
2055 /* Generate all the code for a function call
2056 and return an rtx for its value.
2057 Store the value in TARGET (specified as an rtx) if convenient.
2058 If the value is stored in TARGET then TARGET is returned.
2059 If IGNORE is nonzero, then we ignore the value of the function call. */
2062 expand_call (tree exp, rtx target, int ignore)
2064 /* Nonzero if we are currently expanding a call. */
2065 static int currently_expanding_call = 0;
2067 /* List of actual parameters. */
2068 tree actparms = TREE_OPERAND (exp, 1);
2069 /* RTX for the function to be called. */
2071 /* Sequence of insns to perform a tail recursive "call". */
2072 rtx tail_recursion_insns = NULL_RTX;
2073 /* Sequence of insns to perform a normal "call". */
2074 rtx normal_call_insns = NULL_RTX;
2075 /* Sequence of insns to perform a tail recursive "call". */
2076 rtx tail_call_insns = NULL_RTX;
2077 /* Data type of the function. */
2079 tree type_arg_types;
2080 /* Declaration of the function being called,
2081 or 0 if the function is computed (not known by name). */
2083 /* The type of the function being called. */
2086 int try_tail_call = 1;
2087 int try_tail_recursion = 1;
2090 /* Register in which non-BLKmode value will be returned,
2091 or 0 if no value or if value is BLKmode. */
2093 /* Address where we should return a BLKmode value;
2094 0 if value not BLKmode. */
2095 rtx structure_value_addr = 0;
2096 /* Nonzero if that address is being passed by treating it as
2097 an extra, implicit first parameter. Otherwise,
2098 it is passed by being copied directly into struct_value_rtx. */
2099 int structure_value_addr_parm = 0;
2100 /* Size of aggregate value wanted, or zero if none wanted
2101 or if we are using the non-reentrant PCC calling convention
2102 or expecting the value in registers. */
2103 HOST_WIDE_INT struct_value_size = 0;
2104 /* Nonzero if called function returns an aggregate in memory PCC style,
2105 by returning the address of where to find it. */
2106 int pcc_struct_value = 0;
2107 rtx struct_value = 0;
2109 /* Number of actual parameters in this call, including struct value addr. */
2111 /* Number of named args. Args after this are anonymous ones
2112 and they must all go on the stack. */
2115 /* Vector of information about each argument.
2116 Arguments are numbered in the order they will be pushed,
2117 not the order they are written. */
2118 struct arg_data *args;
2120 /* Total size in bytes of all the stack-parms scanned so far. */
2121 struct args_size args_size;
2122 struct args_size adjusted_args_size;
2123 /* Size of arguments before any adjustments (such as rounding). */
2124 int unadjusted_args_size;
2125 /* Data on reg parms scanned so far. */
2126 CUMULATIVE_ARGS args_so_far;
2127 /* Nonzero if a reg parm has been scanned. */
2129 /* Nonzero if this is an indirect function call. */
2131 /* Nonzero if we must avoid push-insns in the args for this call.
2132 If stack space is allocated for register parameters, but not by the
2133 caller, then it is preallocated in the fixed part of the stack frame.
2134 So the entire argument block must then be preallocated (i.e., we
2135 ignore PUSH_ROUNDING in that case). */
2137 int must_preallocate = !PUSH_ARGS;
2139 /* Size of the stack reserved for parameter registers. */
2140 int reg_parm_stack_space = 0;
2142 /* Address of space preallocated for stack parms
2143 (on machines that lack push insns), or 0 if space not preallocated. */
2146 /* Mask of ECF_ flags. */
2148 /* Nonzero if this is a call to an inline function. */
2149 int is_integrable = 0;
2150 #ifdef REG_PARM_STACK_SPACE
2151 /* Define the boundary of the register parm stack space that needs to be
2153 int low_to_save, high_to_save;
2154 rtx save_area = 0; /* Place that it is saved */
2157 int initial_highest_arg_in_use = highest_outgoing_arg_in_use;
2158 rtx temp_target = 0;
2159 char *initial_stack_usage_map = stack_usage_map;
2161 int old_stack_allocated;
2163 /* State variables to track stack modifications. */
2164 rtx old_stack_level = 0;
2165 int old_stack_arg_under_construction = 0;
2166 int old_pending_adj = 0;
2167 int old_inhibit_defer_pop = inhibit_defer_pop;
2169 /* Some stack pointer alterations we make are performed via
2170 allocate_dynamic_stack_space. This modifies the stack_pointer_delta,
2171 which we then also need to save/restore along the way. */
2172 int old_stack_pointer_delta = 0;
2175 tree p = TREE_OPERAND (exp, 0);
2176 tree addr = TREE_OPERAND (exp, 0);
2178 /* The alignment of the stack, in bits. */
2179 HOST_WIDE_INT preferred_stack_boundary;
2180 /* The alignment of the stack, in bytes. */
2181 HOST_WIDE_INT preferred_unit_stack_boundary;
2183 /* See if this is "nothrow" function call. */
2184 if (TREE_NOTHROW (exp))
2185 flags |= ECF_NOTHROW;
2187 /* See if we can find a DECL-node for the actual function.
2188 As a result, decide whether this is a call to an integrable function. */
2190 fndecl = get_callee_fndecl (exp);
2193 fntype = TREE_TYPE (fndecl);
2195 && fndecl != current_function_decl
2196 && DECL_INLINE (fndecl)
2197 && DECL_SAVED_INSNS (fndecl)
2198 && DECL_SAVED_INSNS (fndecl)->inlinable)
2200 else if (! TREE_ADDRESSABLE (fndecl))
2202 /* In case this function later becomes inlinable,
2203 record that there was already a non-inline call to it.
2205 Use abstraction instead of setting TREE_ADDRESSABLE
2207 if (DECL_INLINE (fndecl) && warn_inline && !flag_no_inline
2210 warning ("%Jcan't inline call to '%F'", fndecl, fndecl);
2211 warning ("called from here");
2213 (*lang_hooks.mark_addressable) (fndecl);
2217 && lookup_attribute ("warn_unused_result",
2218 TYPE_ATTRIBUTES (TREE_TYPE (fndecl))))
2219 warning ("ignoring return value of `%D', "
2220 "declared with attribute warn_unused_result", fndecl);
2222 flags |= flags_from_decl_or_type (fndecl);
2225 /* If we don't have specific function to call, see if we have a
2226 attributes set in the type. */
2229 fntype = TREE_TYPE (TREE_TYPE (p));
2231 && lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (fntype)))
2232 warning ("ignoring return value of function "
2233 "declared with attribute warn_unused_result");
2234 flags |= flags_from_decl_or_type (fntype);
2237 struct_value = targetm.calls.struct_value_rtx (fntype, 0);
2239 /* Warn if this value is an aggregate type,
2240 regardless of which calling convention we are using for it. */
2241 if (warn_aggregate_return && AGGREGATE_TYPE_P (TREE_TYPE (exp)))
2242 warning ("function call has aggregate value");
2244 /* If the result of a pure or const function call is ignored (or void),
2245 and none of its arguments are volatile, we can avoid expanding the
2246 call and just evaluate the arguments for side-effects. */
2247 if ((flags & (ECF_CONST | ECF_PURE))
2248 && (ignore || target == const0_rtx
2249 || TYPE_MODE (TREE_TYPE (exp)) == VOIDmode))
2251 bool volatilep = false;
2254 for (arg = actparms; arg; arg = TREE_CHAIN (arg))
2255 if (TREE_THIS_VOLATILE (TREE_VALUE (arg)))
2263 for (arg = actparms; arg; arg = TREE_CHAIN (arg))
2264 expand_expr (TREE_VALUE (arg), const0_rtx,
2265 VOIDmode, EXPAND_NORMAL);
2270 #ifdef REG_PARM_STACK_SPACE
2271 #ifdef MAYBE_REG_PARM_STACK_SPACE
2272 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
2274 reg_parm_stack_space = REG_PARM_STACK_SPACE (fndecl);
2278 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2279 if (reg_parm_stack_space > 0 && PUSH_ARGS)
2280 must_preallocate = 1;
2283 /* Set up a place to return a structure. */
2285 /* Cater to broken compilers. */
2286 if (aggregate_value_p (exp, fndecl))
2288 /* This call returns a big structure. */
2289 flags &= ~(ECF_CONST | ECF_PURE | ECF_LIBCALL_BLOCK);
2291 #ifdef PCC_STATIC_STRUCT_RETURN
2293 pcc_struct_value = 1;
2294 /* Easier than making that case work right. */
2297 /* In case this is a static function, note that it has been
2299 if (! TREE_ADDRESSABLE (fndecl))
2300 (*lang_hooks.mark_addressable) (fndecl);
2304 #else /* not PCC_STATIC_STRUCT_RETURN */
2306 struct_value_size = int_size_in_bytes (TREE_TYPE (exp));
2308 if (CALL_EXPR_HAS_RETURN_SLOT_ADDR (exp))
2310 /* The structure value address arg is already in actparms.
2311 Pull it out. It might be nice to just leave it there, but
2312 we need to set structure_value_addr. */
2313 tree return_arg = TREE_VALUE (actparms);
2314 actparms = TREE_CHAIN (actparms);
2315 structure_value_addr = expand_expr (return_arg, NULL_RTX,
2316 VOIDmode, EXPAND_NORMAL);
2318 else if (target && GET_CODE (target) == MEM)
2319 structure_value_addr = XEXP (target, 0);
2322 /* For variable-sized objects, we must be called with a target
2323 specified. If we were to allocate space on the stack here,
2324 we would have no way of knowing when to free it. */
2325 rtx d = assign_temp (TREE_TYPE (exp), 1, 1, 1);
2327 mark_temp_addr_taken (d);
2328 structure_value_addr = XEXP (d, 0);
2332 #endif /* not PCC_STATIC_STRUCT_RETURN */
2335 /* If called function is inline, try to integrate it. */
2339 rtx temp = try_to_integrate (fndecl, actparms, target,
2340 ignore, TREE_TYPE (exp),
2341 structure_value_addr);
2342 if (temp != (rtx) (size_t) - 1)
2346 /* Figure out the amount to which the stack should be aligned. */
2347 preferred_stack_boundary = PREFERRED_STACK_BOUNDARY;
2350 struct cgraph_rtl_info *i = cgraph_rtl_info (fndecl);
2351 if (i && i->preferred_incoming_stack_boundary)
2352 preferred_stack_boundary = i->preferred_incoming_stack_boundary;
2355 /* Operand 0 is a pointer-to-function; get the type of the function. */
2356 funtype = TREE_TYPE (addr);
2357 if (! POINTER_TYPE_P (funtype))
2359 funtype = TREE_TYPE (funtype);
2361 /* Munge the tree to split complex arguments into their imaginary
2363 if (targetm.calls.split_complex_arg)
2365 type_arg_types = split_complex_types (TYPE_ARG_TYPES (funtype));
2366 actparms = split_complex_values (actparms);
2369 type_arg_types = TYPE_ARG_TYPES (funtype);
2371 /* See if this is a call to a function that can return more than once
2372 or a call to longjmp or malloc. */
2373 flags |= special_function_p (fndecl, flags);
2375 if (flags & ECF_MAY_BE_ALLOCA)
2376 current_function_calls_alloca = 1;
2378 /* If struct_value_rtx is 0, it means pass the address
2379 as if it were an extra parameter. */
2380 if (structure_value_addr && struct_value == 0)
2382 /* If structure_value_addr is a REG other than
2383 virtual_outgoing_args_rtx, we can use always use it. If it
2384 is not a REG, we must always copy it into a register.
2385 If it is virtual_outgoing_args_rtx, we must copy it to another
2386 register in some cases. */
2387 rtx temp = (GET_CODE (structure_value_addr) != REG
2388 || (ACCUMULATE_OUTGOING_ARGS
2389 && stack_arg_under_construction
2390 && structure_value_addr == virtual_outgoing_args_rtx)
2391 ? copy_addr_to_reg (convert_memory_address
2392 (Pmode, structure_value_addr))
2393 : structure_value_addr);
2396 = tree_cons (error_mark_node,
2397 make_tree (build_pointer_type (TREE_TYPE (funtype)),
2400 structure_value_addr_parm = 1;
2403 /* Count the arguments and set NUM_ACTUALS. */
2404 for (p = actparms, num_actuals = 0; p; p = TREE_CHAIN (p))
2407 /* Compute number of named args.
2408 Normally, don't include the last named arg if anonymous args follow.
2409 We do include the last named arg if
2410 targetm.calls.strict_argument_naming() returns nonzero.
2411 (If no anonymous args follow, the result of list_length is actually
2412 one too large. This is harmless.)
2414 If targetm.calls.pretend_outgoing_varargs_named() returns
2415 nonzero, and targetm.calls.strict_argument_naming() returns zero,
2416 this machine will be able to place unnamed args that were passed
2417 in registers into the stack. So treat all args as named. This
2418 allows the insns emitting for a specific argument list to be
2419 independent of the function declaration.
2421 If targetm.calls.pretend_outgoing_varargs_named() returns zero,
2422 we do not have any reliable way to pass unnamed args in
2423 registers, so we must force them into memory. */
2425 if ((targetm.calls.strict_argument_naming (&args_so_far)
2426 || ! targetm.calls.pretend_outgoing_varargs_named (&args_so_far))
2427 && type_arg_types != 0)
2429 = (list_length (type_arg_types)
2430 /* Don't include the last named arg. */
2431 - (targetm.calls.strict_argument_naming (&args_so_far) ? 0 : 1)
2432 /* Count the struct value address, if it is passed as a parm. */
2433 + structure_value_addr_parm);
2435 /* If we know nothing, treat all args as named. */
2436 n_named_args = num_actuals;
2438 /* Start updating where the next arg would go.
2440 On some machines (such as the PA) indirect calls have a different
2441 calling convention than normal calls. The last argument in
2442 INIT_CUMULATIVE_ARGS tells the backend if this is an indirect call
2444 INIT_CUMULATIVE_ARGS (args_so_far, funtype, NULL_RTX, fndecl, n_named_args);
2446 /* Make a vector to hold all the information about each arg. */
2447 args = alloca (num_actuals * sizeof (struct arg_data));
2448 memset (args, 0, num_actuals * sizeof (struct arg_data));
2450 /* Build up entries in the ARGS array, compute the size of the
2451 arguments into ARGS_SIZE, etc. */
2452 initialize_argument_information (num_actuals, args, &args_size,
2453 n_named_args, actparms, fndecl,
2454 &args_so_far, reg_parm_stack_space,
2455 &old_stack_level, &old_pending_adj,
2456 &must_preallocate, &flags,
2457 CALL_FROM_THUNK_P (exp));
2461 /* If this function requires a variable-sized argument list, don't
2462 try to make a cse'able block for this call. We may be able to
2463 do this eventually, but it is too complicated to keep track of
2464 what insns go in the cse'able block and which don't. */
2466 flags &= ~ECF_LIBCALL_BLOCK;
2467 must_preallocate = 1;
2470 /* Now make final decision about preallocating stack space. */
2471 must_preallocate = finalize_must_preallocate (must_preallocate,
2475 /* If the structure value address will reference the stack pointer, we
2476 must stabilize it. We don't need to do this if we know that we are
2477 not going to adjust the stack pointer in processing this call. */
2479 if (structure_value_addr
2480 && (reg_mentioned_p (virtual_stack_dynamic_rtx, structure_value_addr)
2481 || reg_mentioned_p (virtual_outgoing_args_rtx,
2482 structure_value_addr))
2484 || (!ACCUMULATE_OUTGOING_ARGS && args_size.constant)))
2485 structure_value_addr = copy_to_reg (structure_value_addr);
2487 /* Tail calls can make things harder to debug, and we're traditionally
2488 pushed these optimizations into -O2. Don't try if we're already
2489 expanding a call, as that means we're an argument. Don't try if
2490 there's cleanups, as we know there's code to follow the call.
2492 If rtx_equal_function_value_matters is false, that means we've
2493 finished with regular parsing. Which means that some of the
2494 machinery we use to generate tail-calls is no longer in place.
2495 This is most often true of sjlj-exceptions, which we couldn't
2496 tail-call to anyway.
2498 If current_nesting_level () == 0, we're being called after
2499 the function body has been expanded. This can happen when
2500 setting up trampolines in expand_function_end. */
2501 if (currently_expanding_call++ != 0
2502 || !flag_optimize_sibling_calls
2503 || !rtx_equal_function_value_matters
2504 || current_nesting_level () == 0
2505 || any_pending_cleanups ()
2507 try_tail_call = try_tail_recursion = 0;
2509 /* Tail recursion fails, when we are not dealing with recursive calls. */
2510 if (!try_tail_recursion
2511 || TREE_CODE (addr) != ADDR_EXPR
2512 || TREE_OPERAND (addr, 0) != current_function_decl)
2513 try_tail_recursion = 0;
2515 /* Rest of purposes for tail call optimizations to fail. */
2517 #ifdef HAVE_sibcall_epilogue
2518 !HAVE_sibcall_epilogue
2523 /* Doing sibling call optimization needs some work, since
2524 structure_value_addr can be allocated on the stack.
2525 It does not seem worth the effort since few optimizable
2526 sibling calls will return a structure. */
2527 || structure_value_addr != NULL_RTX
2528 /* Check whether the target is able to optimize the call
2530 || !(*targetm.function_ok_for_sibcall) (fndecl, exp)
2531 /* Functions that do not return exactly once may not be sibcall
2533 || (flags & (ECF_RETURNS_TWICE | ECF_LONGJMP | ECF_NORETURN))
2534 || TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (addr)))
2535 /* If the called function is nested in the current one, it might access
2536 some of the caller's arguments, but could clobber them beforehand if
2537 the argument areas are shared. */
2538 || (fndecl && decl_function_context (fndecl) == current_function_decl)
2539 /* If this function requires more stack slots than the current
2540 function, we cannot change it into a sibling call. */
2541 || args_size.constant > current_function_args_size
2542 /* If the callee pops its own arguments, then it must pop exactly
2543 the same number of arguments as the current function. */
2544 || (RETURN_POPS_ARGS (fndecl, funtype, args_size.constant)
2545 != RETURN_POPS_ARGS (current_function_decl,
2546 TREE_TYPE (current_function_decl),
2547 current_function_args_size))
2548 || !(*lang_hooks.decls.ok_for_sibcall) (fndecl))
2551 if (try_tail_call || try_tail_recursion)
2554 actparms = NULL_TREE;
2555 /* Ok, we're going to give the tail call the old college try.
2556 This means we're going to evaluate the function arguments
2557 up to three times. There are two degrees of badness we can
2558 encounter, those that can be unsaved and those that can't.
2559 (See unsafe_for_reeval commentary for details.)
2561 Generate a new argument list. Pass safe arguments through
2562 unchanged. For the easy badness wrap them in UNSAVE_EXPRs.
2563 For hard badness, evaluate them now and put their resulting
2564 rtx in a temporary VAR_DECL.
2566 initialize_argument_information has ordered the array for the
2567 order to be pushed, and we must remember this when reconstructing
2568 the original argument order. */
2570 if (PUSH_ARGS_REVERSED)
2579 i = num_actuals - 1;
2583 for (; i != end; i += inc)
2585 args[i].tree_value = fix_unsafe_tree (args[i].tree_value);
2586 /* We need to build actparms for optimize_tail_recursion. We can
2587 safely trash away TREE_PURPOSE, since it is unused by this
2589 if (try_tail_recursion)
2590 actparms = tree_cons (NULL_TREE, args[i].tree_value, actparms);
2592 /* Do the same for the function address if it is an expression. */
2594 addr = fix_unsafe_tree (addr);
2595 /* Expanding one of those dangerous arguments could have added
2596 cleanups, but otherwise give it a whirl. */
2597 if (any_pending_cleanups ())
2598 try_tail_call = try_tail_recursion = 0;
2601 /* Generate a tail recursion sequence when calling ourselves. */
2603 if (try_tail_recursion)
2605 /* We want to emit any pending stack adjustments before the tail
2606 recursion "call". That way we know any adjustment after the tail
2607 recursion call can be ignored if we indeed use the tail recursion
2609 int save_pending_stack_adjust = pending_stack_adjust;
2610 int save_stack_pointer_delta = stack_pointer_delta;
2612 /* Emit any queued insns now; otherwise they would end up in
2613 only one of the alternates. */
2616 /* Use a new sequence to hold any RTL we generate. We do not even
2617 know if we will use this RTL yet. The final decision can not be
2618 made until after RTL generation for the entire function is
2621 /* If expanding any of the arguments creates cleanups, we can't
2622 do a tailcall. So, we'll need to pop the pending cleanups
2623 list. If, however, all goes well, and there are no cleanups
2624 then the call to expand_start_target_temps will have no
2626 expand_start_target_temps ();
2627 if (optimize_tail_recursion (actparms, get_last_insn ()))
2629 if (any_pending_cleanups ())
2630 try_tail_call = try_tail_recursion = 0;
2632 tail_recursion_insns = get_insns ();
2634 expand_end_target_temps ();
2637 /* Restore the original pending stack adjustment for the sibling and
2638 normal call cases below. */
2639 pending_stack_adjust = save_pending_stack_adjust;
2640 stack_pointer_delta = save_stack_pointer_delta;
2643 if (profile_arc_flag && (flags & ECF_FORK_OR_EXEC))
2645 /* A fork duplicates the profile information, and an exec discards
2646 it. We can't rely on fork/exec to be paired. So write out the
2647 profile information we have gathered so far, and clear it. */
2648 /* ??? When Linux's __clone is called with CLONE_VM set, profiling
2649 is subject to race conditions, just as with multithreaded
2652 emit_library_call (gcov_flush_libfunc, LCT_ALWAYS_RETURN, VOIDmode, 0);
2655 /* Ensure current function's preferred stack boundary is at least
2656 what we need. We don't have to increase alignment for recursive
2658 if (cfun->preferred_stack_boundary < preferred_stack_boundary
2659 && fndecl != current_function_decl)
2660 cfun->preferred_stack_boundary = preferred_stack_boundary;
2661 if (fndecl == current_function_decl)
2662 cfun->recursive_call_emit = true;
2664 preferred_unit_stack_boundary = preferred_stack_boundary / BITS_PER_UNIT;
2666 function_call_count++;
2668 /* We want to make two insn chains; one for a sibling call, the other
2669 for a normal call. We will select one of the two chains after
2670 initial RTL generation is complete. */
2671 for (pass = try_tail_call ? 0 : 1; pass < 2; pass++)
2673 int sibcall_failure = 0;
2674 /* We want to emit any pending stack adjustments before the tail
2675 recursion "call". That way we know any adjustment after the tail
2676 recursion call can be ignored if we indeed use the tail recursion
2678 int save_pending_stack_adjust = 0;
2679 int save_stack_pointer_delta = 0;
2681 rtx before_call, next_arg_reg;
2685 /* Emit any queued insns now; otherwise they would end up in
2686 only one of the alternates. */
2689 /* State variables we need to save and restore between
2691 save_pending_stack_adjust = pending_stack_adjust;
2692 save_stack_pointer_delta = stack_pointer_delta;
2695 flags &= ~ECF_SIBCALL;
2697 flags |= ECF_SIBCALL;
2699 /* Other state variables that we must reinitialize each time
2700 through the loop (that are not initialized by the loop itself). */
2704 /* Start a new sequence for the normal call case.
2706 From this point on, if the sibling call fails, we want to set
2707 sibcall_failure instead of continuing the loop. */
2712 /* We know at this point that there are not currently any
2713 pending cleanups. If, however, in the process of evaluating
2714 the arguments we were to create some, we'll need to be
2715 able to get rid of them. */
2716 expand_start_target_temps ();
2719 /* Don't let pending stack adjusts add up to too much.
2720 Also, do all pending adjustments now if there is any chance
2721 this might be a call to alloca or if we are expanding a sibling
2722 call sequence or if we are calling a function that is to return
2723 with stack pointer depressed. */
2724 if (pending_stack_adjust >= 32
2725 || (pending_stack_adjust > 0
2726 && (flags & (ECF_MAY_BE_ALLOCA | ECF_SP_DEPRESSED)))
2728 do_pending_stack_adjust ();
2730 /* When calling a const function, we must pop the stack args right away,
2731 so that the pop is deleted or moved with the call. */
2732 if (pass && (flags & ECF_LIBCALL_BLOCK))
2735 #ifdef FINAL_REG_PARM_STACK_SPACE
2736 reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant,
2739 /* Precompute any arguments as needed. */
2741 precompute_arguments (flags, num_actuals, args);
2743 /* Now we are about to start emitting insns that can be deleted
2744 if a libcall is deleted. */
2745 if (pass && (flags & (ECF_LIBCALL_BLOCK | ECF_MALLOC)))
2748 adjusted_args_size = args_size;
2749 /* Compute the actual size of the argument block required. The variable
2750 and constant sizes must be combined, the size may have to be rounded,
2751 and there may be a minimum required size. When generating a sibcall
2752 pattern, do not round up, since we'll be re-using whatever space our
2754 unadjusted_args_size
2755 = compute_argument_block_size (reg_parm_stack_space,
2756 &adjusted_args_size,
2758 : preferred_stack_boundary));
2760 old_stack_allocated = stack_pointer_delta - pending_stack_adjust;
2762 /* The argument block when performing a sibling call is the
2763 incoming argument block. */
2766 argblock = virtual_incoming_args_rtx;
2768 #ifdef STACK_GROWS_DOWNWARD
2769 = plus_constant (argblock, current_function_pretend_args_size);
2771 = plus_constant (argblock, -current_function_pretend_args_size);
2773 stored_args_map = sbitmap_alloc (args_size.constant);
2774 sbitmap_zero (stored_args_map);
2777 /* If we have no actual push instructions, or shouldn't use them,
2778 make space for all args right now. */
2779 else if (adjusted_args_size.var != 0)
2781 if (old_stack_level == 0)
2783 emit_stack_save (SAVE_BLOCK, &old_stack_level, NULL_RTX);
2784 old_stack_pointer_delta = stack_pointer_delta;
2785 old_pending_adj = pending_stack_adjust;
2786 pending_stack_adjust = 0;
2787 /* stack_arg_under_construction says whether a stack arg is
2788 being constructed at the old stack level. Pushing the stack
2789 gets a clean outgoing argument block. */
2790 old_stack_arg_under_construction = stack_arg_under_construction;
2791 stack_arg_under_construction = 0;
2793 argblock = push_block (ARGS_SIZE_RTX (adjusted_args_size), 0, 0);
2797 /* Note that we must go through the motions of allocating an argument
2798 block even if the size is zero because we may be storing args
2799 in the area reserved for register arguments, which may be part of
2802 int needed = adjusted_args_size.constant;
2804 /* Store the maximum argument space used. It will be pushed by
2805 the prologue (if ACCUMULATE_OUTGOING_ARGS, or stack overflow
2808 if (needed > current_function_outgoing_args_size)
2809 current_function_outgoing_args_size = needed;
2811 if (must_preallocate)
2813 if (ACCUMULATE_OUTGOING_ARGS)
2815 /* Since the stack pointer will never be pushed, it is
2816 possible for the evaluation of a parm to clobber
2817 something we have already written to the stack.
2818 Since most function calls on RISC machines do not use
2819 the stack, this is uncommon, but must work correctly.
2821 Therefore, we save any area of the stack that was already
2822 written and that we are using. Here we set up to do this
2823 by making a new stack usage map from the old one. The
2824 actual save will be done by store_one_arg.
2826 Another approach might be to try to reorder the argument
2827 evaluations to avoid this conflicting stack usage. */
2829 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2830 /* Since we will be writing into the entire argument area,
2831 the map must be allocated for its entire size, not just
2832 the part that is the responsibility of the caller. */
2833 needed += reg_parm_stack_space;
2836 #ifdef ARGS_GROW_DOWNWARD
2837 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
2840 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
2843 stack_usage_map = alloca (highest_outgoing_arg_in_use);
2845 if (initial_highest_arg_in_use)
2846 memcpy (stack_usage_map, initial_stack_usage_map,
2847 initial_highest_arg_in_use);
2849 if (initial_highest_arg_in_use != highest_outgoing_arg_in_use)
2850 memset (&stack_usage_map[initial_highest_arg_in_use], 0,
2851 (highest_outgoing_arg_in_use
2852 - initial_highest_arg_in_use));
2855 /* The address of the outgoing argument list must not be
2856 copied to a register here, because argblock would be left
2857 pointing to the wrong place after the call to
2858 allocate_dynamic_stack_space below. */
2860 argblock = virtual_outgoing_args_rtx;
2864 if (inhibit_defer_pop == 0)
2866 /* Try to reuse some or all of the pending_stack_adjust
2867 to get this space. */
2869 = (combine_pending_stack_adjustment_and_call
2870 (unadjusted_args_size,
2871 &adjusted_args_size,
2872 preferred_unit_stack_boundary));
2874 /* combine_pending_stack_adjustment_and_call computes
2875 an adjustment before the arguments are allocated.
2876 Account for them and see whether or not the stack
2877 needs to go up or down. */
2878 needed = unadjusted_args_size - needed;
2882 /* We're releasing stack space. */
2883 /* ??? We can avoid any adjustment at all if we're
2884 already aligned. FIXME. */
2885 pending_stack_adjust = -needed;
2886 do_pending_stack_adjust ();
2890 /* We need to allocate space. We'll do that in
2891 push_block below. */
2892 pending_stack_adjust = 0;
2895 /* Special case this because overhead of `push_block' in
2896 this case is non-trivial. */
2898 argblock = virtual_outgoing_args_rtx;
2901 argblock = push_block (GEN_INT (needed), 0, 0);
2902 #ifdef ARGS_GROW_DOWNWARD
2903 argblock = plus_constant (argblock, needed);
2907 /* We only really need to call `copy_to_reg' in the case
2908 where push insns are going to be used to pass ARGBLOCK
2909 to a function call in ARGS. In that case, the stack
2910 pointer changes value from the allocation point to the
2911 call point, and hence the value of
2912 VIRTUAL_OUTGOING_ARGS_RTX changes as well. But might
2913 as well always do it. */
2914 argblock = copy_to_reg (argblock);
2919 if (ACCUMULATE_OUTGOING_ARGS)
2921 /* The save/restore code in store_one_arg handles all
2922 cases except one: a constructor call (including a C
2923 function returning a BLKmode struct) to initialize
2925 if (stack_arg_under_construction)
2927 #ifndef OUTGOING_REG_PARM_STACK_SPACE
2928 rtx push_size = GEN_INT (reg_parm_stack_space
2929 + adjusted_args_size.constant);
2931 rtx push_size = GEN_INT (adjusted_args_size.constant);
2933 if (old_stack_level == 0)
2935 emit_stack_save (SAVE_BLOCK, &old_stack_level,
2937 old_stack_pointer_delta = stack_pointer_delta;
2938 old_pending_adj = pending_stack_adjust;
2939 pending_stack_adjust = 0;
2940 /* stack_arg_under_construction says whether a stack
2941 arg is being constructed at the old stack level.
2942 Pushing the stack gets a clean outgoing argument
2944 old_stack_arg_under_construction
2945 = stack_arg_under_construction;
2946 stack_arg_under_construction = 0;
2947 /* Make a new map for the new argument list. */
2948 stack_usage_map = alloca (highest_outgoing_arg_in_use);
2949 memset (stack_usage_map, 0, highest_outgoing_arg_in_use);
2950 highest_outgoing_arg_in_use = 0;
2952 allocate_dynamic_stack_space (push_size, NULL_RTX,
2956 /* If argument evaluation might modify the stack pointer,
2957 copy the address of the argument list to a register. */
2958 for (i = 0; i < num_actuals; i++)
2959 if (args[i].pass_on_stack)
2961 argblock = copy_addr_to_reg (argblock);
2966 compute_argument_addresses (args, argblock, num_actuals);
2968 /* If we push args individually in reverse order, perform stack alignment
2969 before the first push (the last arg). */
2970 if (PUSH_ARGS_REVERSED && argblock == 0
2971 && adjusted_args_size.constant != unadjusted_args_size)
2973 /* When the stack adjustment is pending, we get better code
2974 by combining the adjustments. */
2975 if (pending_stack_adjust
2976 && ! (flags & ECF_LIBCALL_BLOCK)
2977 && ! inhibit_defer_pop)
2979 pending_stack_adjust
2980 = (combine_pending_stack_adjustment_and_call
2981 (unadjusted_args_size,
2982 &adjusted_args_size,
2983 preferred_unit_stack_boundary));
2984 do_pending_stack_adjust ();
2986 else if (argblock == 0)
2987 anti_adjust_stack (GEN_INT (adjusted_args_size.constant
2988 - unadjusted_args_size));
2990 /* Now that the stack is properly aligned, pops can't safely
2991 be deferred during the evaluation of the arguments. */
2994 funexp = rtx_for_function_call (fndecl, addr);
2996 /* Figure out the register where the value, if any, will come back. */
2998 if (TYPE_MODE (TREE_TYPE (exp)) != VOIDmode
2999 && ! structure_value_addr)
3001 if (pcc_struct_value)
3002 valreg = hard_function_value (build_pointer_type (TREE_TYPE (exp)),
3003 fndecl, (pass == 0));
3005 valreg = hard_function_value (TREE_TYPE (exp), fndecl, (pass == 0));
3008 /* Precompute all register parameters. It isn't safe to compute anything
3009 once we have started filling any specific hard regs. */
3010 precompute_register_parameters (num_actuals, args, ®_parm_seen);
3012 #ifdef REG_PARM_STACK_SPACE
3013 /* Save the fixed argument area if it's part of the caller's frame and
3014 is clobbered by argument setup for this call. */
3015 if (ACCUMULATE_OUTGOING_ARGS && pass)
3016 save_area = save_fixed_argument_area (reg_parm_stack_space, argblock,
3017 &low_to_save, &high_to_save);
3020 /* Now store (and compute if necessary) all non-register parms.
3021 These come before register parms, since they can require block-moves,
3022 which could clobber the registers used for register parms.
3023 Parms which have partial registers are not stored here,
3024 but we do preallocate space here if they want that. */
3026 for (i = 0; i < num_actuals; i++)
3027 if (args[i].reg == 0 || args[i].pass_on_stack)
3029 rtx before_arg = get_last_insn ();
3031 if (store_one_arg (&args[i], argblock, flags,
3032 adjusted_args_size.var != 0,
3033 reg_parm_stack_space)
3035 && check_sibcall_argument_overlap (before_arg,
3037 sibcall_failure = 1;
3039 if (flags & ECF_CONST
3041 && args[i].value == args[i].stack)
3042 call_fusage = gen_rtx_EXPR_LIST (VOIDmode,
3043 gen_rtx_USE (VOIDmode,
3048 /* If we have a parm that is passed in registers but not in memory
3049 and whose alignment does not permit a direct copy into registers,
3050 make a group of pseudos that correspond to each register that we
3052 if (STRICT_ALIGNMENT)
3053 store_unaligned_arguments_into_pseudos (args, num_actuals);
3055 /* Now store any partially-in-registers parm.
3056 This is the last place a block-move can happen. */
3058 for (i = 0; i < num_actuals; i++)
3059 if (args[i].partial != 0 && ! args[i].pass_on_stack)
3061 rtx before_arg = get_last_insn ();
3063 if (store_one_arg (&args[i], argblock, flags,
3064 adjusted_args_size.var != 0,
3065 reg_parm_stack_space)
3067 && check_sibcall_argument_overlap (before_arg,
3069 sibcall_failure = 1;
3072 /* If we pushed args in forward order, perform stack alignment
3073 after pushing the last arg. */
3074 if (!PUSH_ARGS_REVERSED && argblock == 0)
3075 anti_adjust_stack (GEN_INT (adjusted_args_size.constant
3076 - unadjusted_args_size));
3078 /* If register arguments require space on the stack and stack space
3079 was not preallocated, allocate stack space here for arguments
3080 passed in registers. */
3081 #ifdef OUTGOING_REG_PARM_STACK_SPACE
3082 if (!ACCUMULATE_OUTGOING_ARGS
3083 && must_preallocate == 0 && reg_parm_stack_space > 0)
3084 anti_adjust_stack (GEN_INT (reg_parm_stack_space));
3087 /* Pass the function the address in which to return a
3089 if (pass != 0 && structure_value_addr && ! structure_value_addr_parm)
3091 structure_value_addr
3092 = convert_memory_address (Pmode, structure_value_addr);
3093 emit_move_insn (struct_value,
3095 force_operand (structure_value_addr,
3098 if (GET_CODE (struct_value) == REG)
3099 use_reg (&call_fusage, struct_value);
3102 funexp = prepare_call_address (funexp, fndecl, &call_fusage,
3103 reg_parm_seen, pass == 0);
3105 load_register_parameters (args, num_actuals, &call_fusage, flags,
3106 pass == 0, &sibcall_failure);
3108 /* Perform postincrements before actually calling the function. */
3111 /* Save a pointer to the last insn before the call, so that we can
3112 later safely search backwards to find the CALL_INSN. */
3113 before_call = get_last_insn ();
3115 /* Set up next argument register. For sibling calls on machines
3116 with register windows this should be the incoming register. */
3117 #ifdef FUNCTION_INCOMING_ARG
3119 next_arg_reg = FUNCTION_INCOMING_ARG (args_so_far, VOIDmode,
3123 next_arg_reg = FUNCTION_ARG (args_so_far, VOIDmode,
3126 /* All arguments and registers used for the call must be set up by
3129 /* Stack must be properly aligned now. */
3130 if (pass && stack_pointer_delta % preferred_unit_stack_boundary)
3133 /* Generate the actual call instruction. */
3134 emit_call_1 (funexp, fndecl, funtype, unadjusted_args_size,
3135 adjusted_args_size.constant, struct_value_size,
3136 next_arg_reg, valreg, old_inhibit_defer_pop, call_fusage,
3137 flags, & args_so_far);
3139 /* If call is cse'able, make appropriate pair of reg-notes around it.
3140 Test valreg so we don't crash; may safely ignore `const'
3141 if return type is void. Disable for PARALLEL return values, because
3142 we have no way to move such values into a pseudo register. */
3143 if (pass && (flags & ECF_LIBCALL_BLOCK))
3147 bool failed = valreg == 0 || GET_CODE (valreg) == PARALLEL;
3149 insns = get_insns ();
3151 /* Expansion of block moves possibly introduced a loop that may
3152 not appear inside libcall block. */
3153 for (insn = insns; insn; insn = NEXT_INSN (insn))
3154 if (GET_CODE (insn) == JUMP_INSN)
3165 rtx temp = gen_reg_rtx (GET_MODE (valreg));
3167 /* Mark the return value as a pointer if needed. */
3168 if (TREE_CODE (TREE_TYPE (exp)) == POINTER_TYPE)
3169 mark_reg_pointer (temp,
3170 TYPE_ALIGN (TREE_TYPE (TREE_TYPE (exp))));
3173 if (flag_unsafe_math_optimizations
3175 && DECL_BUILT_IN (fndecl)
3176 && (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_SQRT
3177 || DECL_FUNCTION_CODE (fndecl) == BUILT_IN_SQRTF
3178 || DECL_FUNCTION_CODE (fndecl) == BUILT_IN_SQRTL))
3179 note = gen_rtx_fmt_e (SQRT,
3181 args[0].initial_value);
3184 /* Construct an "equal form" for the value which
3185 mentions all the arguments in order as well as
3186 the function name. */
3187 for (i = 0; i < num_actuals; i++)
3188 note = gen_rtx_EXPR_LIST (VOIDmode,
3189 args[i].initial_value, note);
3190 note = gen_rtx_EXPR_LIST (VOIDmode, funexp, note);
3192 if (flags & ECF_PURE)
3193 note = gen_rtx_EXPR_LIST (VOIDmode,
3194 gen_rtx_USE (VOIDmode,
3195 gen_rtx_MEM (BLKmode,
3196 gen_rtx_SCRATCH (VOIDmode))),
3199 emit_libcall_block (insns, temp, valreg, note);
3204 else if (pass && (flags & ECF_MALLOC))
3206 rtx temp = gen_reg_rtx (GET_MODE (valreg));
3209 /* The return value from a malloc-like function is a pointer. */
3210 if (TREE_CODE (TREE_TYPE (exp)) == POINTER_TYPE)
3211 mark_reg_pointer (temp, BIGGEST_ALIGNMENT);
3213 emit_move_insn (temp, valreg);
3215 /* The return value from a malloc-like function can not alias
3217 last = get_last_insn ();
3219 gen_rtx_EXPR_LIST (REG_NOALIAS, temp, REG_NOTES (last));
3221 /* Write out the sequence. */
3222 insns = get_insns ();
3228 /* For calls to `setjmp', etc., inform flow.c it should complain
3229 if nonvolatile values are live. For functions that cannot return,
3230 inform flow that control does not fall through. */
3232 if ((flags & (ECF_NORETURN | ECF_LONGJMP)) || pass == 0)
3234 /* The barrier must be emitted
3235 immediately after the CALL_INSN. Some ports emit more
3236 than just a CALL_INSN above, so we must search for it here. */
3238 rtx last = get_last_insn ();
3239 while (GET_CODE (last) != CALL_INSN)
3241 last = PREV_INSN (last);
3242 /* There was no CALL_INSN? */
3243 if (last == before_call)
3247 emit_barrier_after (last);
3249 /* Stack adjustments after a noreturn call are dead code.
3250 However when NO_DEFER_POP is in effect, we must preserve
3251 stack_pointer_delta. */
3252 if (inhibit_defer_pop == 0)
3254 stack_pointer_delta = old_stack_allocated;
3255 pending_stack_adjust = 0;
3259 if (flags & ECF_LONGJMP)
3260 current_function_calls_longjmp = 1;
3262 /* If value type not void, return an rtx for the value. */
3264 /* If there are cleanups to be called, don't use a hard reg as target.
3265 We need to double check this and see if it matters anymore. */
3266 if (any_pending_cleanups ())
3268 if (target && REG_P (target)
3269 && REGNO (target) < FIRST_PSEUDO_REGISTER)
3271 sibcall_failure = 1;
3274 if (TYPE_MODE (TREE_TYPE (exp)) == VOIDmode
3276 target = const0_rtx;
3277 else if (structure_value_addr)
3279 if (target == 0 || GET_CODE (target) != MEM)
3282 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
3283 memory_address (TYPE_MODE (TREE_TYPE (exp)),
3284 structure_value_addr));
3285 set_mem_attributes (target, exp, 1);
3288 else if (pcc_struct_value)
3290 /* This is the special C++ case where we need to
3291 know what the true target was. We take care to
3292 never use this value more than once in one expression. */
3293 target = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)),
3294 copy_to_reg (valreg));
3295 set_mem_attributes (target, exp, 1);
3297 /* Handle calls that return values in multiple non-contiguous locations.
3298 The Irix 6 ABI has examples of this. */
3299 else if (GET_CODE (valreg) == PARALLEL)
3301 /* Second condition is added because "target" is freed at the
3302 the end of "pass0" for -O2 when call is made to
3303 expand_end_target_temps (). Its "in_use" flag has been set
3304 to false, so allocate a new temp. */
3305 if (target == 0 || (pass == 1 && target == temp_target))
3307 /* This will only be assigned once, so it can be readonly. */
3308 tree nt = build_qualified_type (TREE_TYPE (exp),
3309 (TYPE_QUALS (TREE_TYPE (exp))
3310 | TYPE_QUAL_CONST));
3312 target = assign_temp (nt, 0, 1, 1);
3313 temp_target = target;
3314 preserve_temp_slots (target);
3317 if (! rtx_equal_p (target, valreg))
3318 emit_group_store (target, valreg, TREE_TYPE (exp),
3319 int_size_in_bytes (TREE_TYPE (exp)));
3321 /* We can not support sibling calls for this case. */
3322 sibcall_failure = 1;
3325 && GET_MODE (target) == TYPE_MODE (TREE_TYPE (exp))
3326 && GET_MODE (target) == GET_MODE (valreg))
3328 /* TARGET and VALREG cannot be equal at this point because the
3329 latter would not have REG_FUNCTION_VALUE_P true, while the
3330 former would if it were referring to the same register.
3332 If they refer to the same register, this move will be a no-op,
3333 except when function inlining is being done. */
3334 emit_move_insn (target, valreg);
3336 /* If we are setting a MEM, this code must be executed. Since it is
3337 emitted after the call insn, sibcall optimization cannot be
3338 performed in that case. */
3339 if (GET_CODE (target) == MEM)
3340 sibcall_failure = 1;
3342 else if (TYPE_MODE (TREE_TYPE (exp)) == BLKmode)
3344 target = copy_blkmode_from_reg (target, valreg, TREE_TYPE (exp));
3346 /* We can not support sibling calls for this case. */
3347 sibcall_failure = 1;
3351 if (shift_returned_value (TREE_TYPE (exp), &valreg))
3352 sibcall_failure = 1;
3354 target = copy_to_reg (valreg);
3357 if (targetm.calls.promote_function_return(funtype))
3359 /* If we promoted this return value, make the proper SUBREG. TARGET
3360 might be const0_rtx here, so be careful. */
3361 if (GET_CODE (target) == REG
3362 && TYPE_MODE (TREE_TYPE (exp)) != BLKmode
3363 && GET_MODE (target) != TYPE_MODE (TREE_TYPE (exp)))
3365 tree type = TREE_TYPE (exp);
3366 int unsignedp = TREE_UNSIGNED (type);
3369 /* If we don't promote as expected, something is wrong. */
3370 if (GET_MODE (target)
3371 != promote_mode (type, TYPE_MODE (type), &unsignedp, 1))
3374 if ((WORDS_BIG_ENDIAN || BYTES_BIG_ENDIAN)
3375 && GET_MODE_SIZE (GET_MODE (target))
3376 > GET_MODE_SIZE (TYPE_MODE (type)))
3378 offset = GET_MODE_SIZE (GET_MODE (target))
3379 - GET_MODE_SIZE (TYPE_MODE (type));
3380 if (! BYTES_BIG_ENDIAN)
3381 offset = (offset / UNITS_PER_WORD) * UNITS_PER_WORD;
3382 else if (! WORDS_BIG_ENDIAN)
3383 offset %= UNITS_PER_WORD;
3385 target = gen_rtx_SUBREG (TYPE_MODE (type), target, offset);
3386 SUBREG_PROMOTED_VAR_P (target) = 1;
3387 SUBREG_PROMOTED_UNSIGNED_SET (target, unsignedp);
3391 /* If size of args is variable or this was a constructor call for a stack
3392 argument, restore saved stack-pointer value. */
3394 if (old_stack_level && ! (flags & ECF_SP_DEPRESSED))
3396 emit_stack_restore (SAVE_BLOCK, old_stack_level, NULL_RTX);
3397 stack_pointer_delta = old_stack_pointer_delta;
3398 pending_stack_adjust = old_pending_adj;
3399 stack_arg_under_construction = old_stack_arg_under_construction;
3400 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
3401 stack_usage_map = initial_stack_usage_map;
3402 sibcall_failure = 1;
3404 else if (ACCUMULATE_OUTGOING_ARGS && pass)
3406 #ifdef REG_PARM_STACK_SPACE
3408 restore_fixed_argument_area (save_area, argblock,
3409 high_to_save, low_to_save);
3412 /* If we saved any argument areas, restore them. */
3413 for (i = 0; i < num_actuals; i++)
3414 if (args[i].save_area)
3416 enum machine_mode save_mode = GET_MODE (args[i].save_area);
3418 = gen_rtx_MEM (save_mode,
3419 memory_address (save_mode,
3420 XEXP (args[i].stack_slot, 0)));
3422 if (save_mode != BLKmode)
3423 emit_move_insn (stack_area, args[i].save_area);
3425 emit_block_move (stack_area, args[i].save_area,
3426 GEN_INT (args[i].locate.size.constant),
3427 BLOCK_OP_CALL_PARM);
3430 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
3431 stack_usage_map = initial_stack_usage_map;
3434 /* If this was alloca, record the new stack level for nonlocal gotos.
3435 Check for the handler slots since we might not have a save area
3436 for non-local gotos. */
3438 if ((flags & ECF_MAY_BE_ALLOCA) && nonlocal_goto_handler_slots != 0)
3439 emit_stack_save (SAVE_NONLOCAL, &nonlocal_goto_stack_level, NULL_RTX);
3441 /* Free up storage we no longer need. */
3442 for (i = 0; i < num_actuals; ++i)
3443 if (args[i].aligned_regs)
3444 free (args[i].aligned_regs);
3448 /* Undo the fake expand_start_target_temps we did earlier. If
3449 there had been any cleanups created, we've already set
3451 expand_end_target_temps ();
3454 /* If this function is returning into a memory location marked as
3455 readonly, it means it is initializing that location. We normally treat
3456 functions as not clobbering such locations, so we need to specify that
3457 this one does. We do this by adding the appropriate CLOBBER to the
3458 CALL_INSN function usage list. This cannot be done by emitting a
3459 standalone CLOBBER after the call because the latter would be ignored
3460 by at least the delay slot scheduling pass. We do this now instead of
3461 adding to call_fusage before the call to emit_call_1 because TARGET
3462 may be modified in the meantime. */
3463 if (structure_value_addr != 0 && target != 0
3464 && GET_CODE (target) == MEM && RTX_UNCHANGING_P (target))
3465 add_function_usage_to
3467 gen_rtx_EXPR_LIST (VOIDmode, gen_rtx_CLOBBER (VOIDmode, target),
3470 insns = get_insns ();
3475 tail_call_insns = insns;
3477 /* Restore the pending stack adjustment now that we have
3478 finished generating the sibling call sequence. */
3480 pending_stack_adjust = save_pending_stack_adjust;
3481 stack_pointer_delta = save_stack_pointer_delta;
3483 /* Prepare arg structure for next iteration. */
3484 for (i = 0; i < num_actuals; i++)
3487 args[i].aligned_regs = 0;
3491 sbitmap_free (stored_args_map);
3495 normal_call_insns = insns;
3497 /* Verify that we've deallocated all the stack we used. */
3498 if (! (flags & (ECF_NORETURN | ECF_LONGJMP))
3499 && old_stack_allocated != stack_pointer_delta
3500 - pending_stack_adjust)
3504 /* If something prevents making this a sibling call,
3505 zero out the sequence. */
3506 if (sibcall_failure)
3507 tail_call_insns = NULL_RTX;
3510 /* The function optimize_sibling_and_tail_recursive_calls doesn't
3511 handle CALL_PLACEHOLDERs inside other CALL_PLACEHOLDERs. This
3512 can happen if the arguments to this function call an inline
3513 function who's expansion contains another CALL_PLACEHOLDER.
3515 If there are any C_Ps in any of these sequences, replace them
3516 with their normal call. */
3518 for (insn = normal_call_insns; insn; insn = NEXT_INSN (insn))
3519 if (GET_CODE (insn) == CALL_INSN
3520 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
3521 replace_call_placeholder (insn, sibcall_use_normal);
3523 for (insn = tail_call_insns; insn; insn = NEXT_INSN (insn))
3524 if (GET_CODE (insn) == CALL_INSN
3525 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
3526 replace_call_placeholder (insn, sibcall_use_normal);
3528 for (insn = tail_recursion_insns; insn; insn = NEXT_INSN (insn))
3529 if (GET_CODE (insn) == CALL_INSN
3530 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
3531 replace_call_placeholder (insn, sibcall_use_normal);
3533 /* If this was a potential tail recursion site, then emit a
3534 CALL_PLACEHOLDER with the normal and the tail recursion streams.
3535 One of them will be selected later. */
3536 if (tail_recursion_insns || tail_call_insns)
3538 /* The tail recursion label must be kept around. We could expose
3539 its use in the CALL_PLACEHOLDER, but that creates unwanted edges
3540 and makes determining true tail recursion sites difficult.
3542 So we set LABEL_PRESERVE_P here, then clear it when we select
3543 one of the call sequences after rtl generation is complete. */
3544 if (tail_recursion_insns)
3545 LABEL_PRESERVE_P (tail_recursion_label) = 1;
3546 emit_call_insn (gen_rtx_CALL_PLACEHOLDER (VOIDmode, normal_call_insns,
3548 tail_recursion_insns,
3549 tail_recursion_label));
3552 emit_insn (normal_call_insns);
3554 currently_expanding_call--;
3556 /* If this function returns with the stack pointer depressed, ensure
3557 this block saves and restores the stack pointer, show it was
3558 changed, and adjust for any outgoing arg space. */
3559 if (flags & ECF_SP_DEPRESSED)
3561 clear_pending_stack_adjust ();
3562 emit_insn (gen_rtx (CLOBBER, VOIDmode, stack_pointer_rtx));
3563 emit_move_insn (virtual_stack_dynamic_rtx, stack_pointer_rtx);
3564 save_stack_pointer ();
3570 /* Traverse an argument list in VALUES and expand all complex
3571 arguments into their components. */
3573 split_complex_values (tree values)
3577 /* Before allocating memory, check for the common case of no complex. */
3578 for (p = values; p; p = TREE_CHAIN (p))
3580 tree type = TREE_TYPE (TREE_VALUE (p));
3581 if (type && TREE_CODE (type) == COMPLEX_TYPE
3582 && targetm.calls.split_complex_arg (type))
3588 values = copy_list (values);
3590 for (p = values; p; p = TREE_CHAIN (p))
3592 tree complex_value = TREE_VALUE (p);
3595 complex_type = TREE_TYPE (complex_value);
3599 if (TREE_CODE (complex_type) == COMPLEX_TYPE
3600 && targetm.calls.split_complex_arg (complex_type))
3603 tree real, imag, next;
3605 subtype = TREE_TYPE (complex_type);
3606 complex_value = save_expr (complex_value);
3607 real = build1 (REALPART_EXPR, subtype, complex_value);
3608 imag = build1 (IMAGPART_EXPR, subtype, complex_value);
3610 TREE_VALUE (p) = real;
3611 next = TREE_CHAIN (p);
3612 imag = build_tree_list (NULL_TREE, imag);
3613 TREE_CHAIN (p) = imag;
3614 TREE_CHAIN (imag) = next;
3616 /* Skip the newly created node. */
3624 /* Traverse a list of TYPES and expand all complex types into their
3627 split_complex_types (tree types)
3631 /* Before allocating memory, check for the common case of no complex. */
3632 for (p = types; p; p = TREE_CHAIN (p))
3634 tree type = TREE_VALUE (p);
3635 if (TREE_CODE (type) == COMPLEX_TYPE
3636 && targetm.calls.split_complex_arg (type))
3642 types = copy_list (types);
3644 for (p = types; p; p = TREE_CHAIN (p))
3646 tree complex_type = TREE_VALUE (p);
3648 if (TREE_CODE (complex_type) == COMPLEX_TYPE
3649 && targetm.calls.split_complex_arg (complex_type))
3653 /* Rewrite complex type with component type. */
3654 TREE_VALUE (p) = TREE_TYPE (complex_type);
3655 next = TREE_CHAIN (p);
3657 /* Add another component type for the imaginary part. */
3658 imag = build_tree_list (NULL_TREE, TREE_VALUE (p));
3659 TREE_CHAIN (p) = imag;
3660 TREE_CHAIN (imag) = next;
3662 /* Skip the newly created node. */
3670 /* Output a library call to function FUN (a SYMBOL_REF rtx).
3671 The RETVAL parameter specifies whether return value needs to be saved, other
3672 parameters are documented in the emit_library_call function below. */
3675 emit_library_call_value_1 (int retval, rtx orgfun, rtx value,
3676 enum libcall_type fn_type,
3677 enum machine_mode outmode, int nargs, va_list p)
3679 /* Total size in bytes of all the stack-parms scanned so far. */
3680 struct args_size args_size;
3681 /* Size of arguments before any adjustments (such as rounding). */
3682 struct args_size original_args_size;
3688 CUMULATIVE_ARGS args_so_far;
3692 enum machine_mode mode;
3695 struct locate_and_pad_arg_data locate;
3699 int old_inhibit_defer_pop = inhibit_defer_pop;
3700 rtx call_fusage = 0;
3703 int pcc_struct_value = 0;
3704 int struct_value_size = 0;
3706 int reg_parm_stack_space = 0;
3709 tree tfom; /* type_for_mode (outmode, 0) */
3711 #ifdef REG_PARM_STACK_SPACE
3712 /* Define the boundary of the register parm stack space that needs to be
3714 int low_to_save, high_to_save;
3715 rtx save_area = 0; /* Place that it is saved. */
3718 /* Size of the stack reserved for parameter registers. */
3719 int initial_highest_arg_in_use = highest_outgoing_arg_in_use;
3720 char *initial_stack_usage_map = stack_usage_map;
3722 rtx struct_value = targetm.calls.struct_value_rtx (0, 0);
3724 #ifdef REG_PARM_STACK_SPACE
3725 #ifdef MAYBE_REG_PARM_STACK_SPACE
3726 reg_parm_stack_space = MAYBE_REG_PARM_STACK_SPACE;
3728 reg_parm_stack_space = REG_PARM_STACK_SPACE ((tree) 0);
3732 /* By default, library functions can not throw. */
3733 flags = ECF_NOTHROW;
3745 case LCT_CONST_MAKE_BLOCK:
3746 flags |= ECF_CONST | ECF_LIBCALL_BLOCK;
3748 case LCT_PURE_MAKE_BLOCK:
3749 flags |= ECF_PURE | ECF_LIBCALL_BLOCK;
3752 flags |= ECF_NORETURN;
3755 flags = ECF_NORETURN;
3757 case LCT_ALWAYS_RETURN:
3758 flags = ECF_ALWAYS_RETURN;
3760 case LCT_RETURNS_TWICE:
3761 flags = ECF_RETURNS_TWICE;
3766 /* Ensure current function's preferred stack boundary is at least
3768 if (cfun->preferred_stack_boundary < PREFERRED_STACK_BOUNDARY)
3769 cfun->preferred_stack_boundary = PREFERRED_STACK_BOUNDARY;
3771 /* If this kind of value comes back in memory,
3772 decide where in memory it should come back. */
3773 if (outmode != VOIDmode)
3775 tfom = (*lang_hooks.types.type_for_mode) (outmode, 0);
3776 if (aggregate_value_p (tfom, 0))
3778 #ifdef PCC_STATIC_STRUCT_RETURN
3780 = hard_function_value (build_pointer_type (tfom), 0, 0);
3781 mem_value = gen_rtx_MEM (outmode, pointer_reg);
3782 pcc_struct_value = 1;
3784 value = gen_reg_rtx (outmode);
3785 #else /* not PCC_STATIC_STRUCT_RETURN */
3786 struct_value_size = GET_MODE_SIZE (outmode);
3787 if (value != 0 && GET_CODE (value) == MEM)
3790 mem_value = assign_temp (tfom, 0, 1, 1);
3792 /* This call returns a big structure. */
3793 flags &= ~(ECF_CONST | ECF_PURE | ECF_LIBCALL_BLOCK);
3797 tfom = void_type_node;
3799 /* ??? Unfinished: must pass the memory address as an argument. */
3801 /* Copy all the libcall-arguments out of the varargs data
3802 and into a vector ARGVEC.
3804 Compute how to pass each argument. We only support a very small subset
3805 of the full argument passing conventions to limit complexity here since
3806 library functions shouldn't have many args. */
3808 argvec = alloca ((nargs + 1) * sizeof (struct arg));
3809 memset (argvec, 0, (nargs + 1) * sizeof (struct arg));
3811 #ifdef INIT_CUMULATIVE_LIBCALL_ARGS
3812 INIT_CUMULATIVE_LIBCALL_ARGS (args_so_far, outmode, fun);
3814 INIT_CUMULATIVE_ARGS (args_so_far, NULL_TREE, fun, 0, nargs);
3817 args_size.constant = 0;
3822 /* Now we are about to start emitting insns that can be deleted
3823 if a libcall is deleted. */
3824 if (flags & ECF_LIBCALL_BLOCK)
3829 /* If there's a structure value address to be passed,
3830 either pass it in the special place, or pass it as an extra argument. */
3831 if (mem_value && struct_value == 0 && ! pcc_struct_value)
3833 rtx addr = XEXP (mem_value, 0);
3836 /* Make sure it is a reasonable operand for a move or push insn. */
3837 if (GET_CODE (addr) != REG && GET_CODE (addr) != MEM
3838 && ! (CONSTANT_P (addr) && LEGITIMATE_CONSTANT_P (addr)))
3839 addr = force_operand (addr, NULL_RTX);
3841 argvec[count].value = addr;
3842 argvec[count].mode = Pmode;
3843 argvec[count].partial = 0;
3845 argvec[count].reg = FUNCTION_ARG (args_so_far, Pmode, NULL_TREE, 1);
3846 #ifdef FUNCTION_ARG_PARTIAL_NREGS
3847 if (FUNCTION_ARG_PARTIAL_NREGS (args_so_far, Pmode, NULL_TREE, 1))
3851 locate_and_pad_parm (Pmode, NULL_TREE,
3852 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3855 argvec[count].reg != 0,
3857 0, NULL_TREE, &args_size, &argvec[count].locate);
3859 if (argvec[count].reg == 0 || argvec[count].partial != 0
3860 || reg_parm_stack_space > 0)
3861 args_size.constant += argvec[count].locate.size.constant;
3863 FUNCTION_ARG_ADVANCE (args_so_far, Pmode, (tree) 0, 1);
3868 for (; count < nargs; count++)
3870 rtx val = va_arg (p, rtx);
3871 enum machine_mode mode = va_arg (p, enum machine_mode);
3873 /* We cannot convert the arg value to the mode the library wants here;
3874 must do it earlier where we know the signedness of the arg. */
3876 || (GET_MODE (val) != mode && GET_MODE (val) != VOIDmode))
3879 /* There's no need to call protect_from_queue, because
3880 either emit_move_insn or emit_push_insn will do that. */
3882 /* Make sure it is a reasonable operand for a move or push insn. */
3883 if (GET_CODE (val) != REG && GET_CODE (val) != MEM
3884 && ! (CONSTANT_P (val) && LEGITIMATE_CONSTANT_P (val)))
3885 val = force_operand (val, NULL_RTX);
3887 #ifdef FUNCTION_ARG_PASS_BY_REFERENCE
3888 if (FUNCTION_ARG_PASS_BY_REFERENCE (args_so_far, mode, NULL_TREE, 1))
3892 #ifdef FUNCTION_ARG_CALLEE_COPIES
3893 && ! FUNCTION_ARG_CALLEE_COPIES (args_so_far, mode,
3898 /* loop.c won't look at CALL_INSN_FUNCTION_USAGE of const/pure
3899 functions, so we have to pretend this isn't such a function. */
3900 if (flags & ECF_LIBCALL_BLOCK)
3902 rtx insns = get_insns ();
3906 flags &= ~(ECF_CONST | ECF_PURE | ECF_LIBCALL_BLOCK);
3908 /* If this was a CONST function, it is now PURE since
3909 it now reads memory. */
3910 if (flags & ECF_CONST)
3912 flags &= ~ECF_CONST;
3916 if (GET_MODE (val) == MEM && ! must_copy)
3920 slot = assign_temp ((*lang_hooks.types.type_for_mode) (mode, 0),
3922 emit_move_insn (slot, val);
3926 tree type = (*lang_hooks.types.type_for_mode) (mode, 0);
3929 = gen_rtx_MEM (mode,
3930 expand_expr (build1 (ADDR_EXPR,
3931 build_pointer_type (type),
3932 make_tree (type, val)),
3933 NULL_RTX, VOIDmode, 0));
3936 call_fusage = gen_rtx_EXPR_LIST (VOIDmode,
3937 gen_rtx_USE (VOIDmode, slot),
3940 call_fusage = gen_rtx_EXPR_LIST (VOIDmode,
3941 gen_rtx_CLOBBER (VOIDmode,
3946 val = force_operand (XEXP (slot, 0), NULL_RTX);
3950 argvec[count].value = val;
3951 argvec[count].mode = mode;
3953 argvec[count].reg = FUNCTION_ARG (args_so_far, mode, NULL_TREE, 1);
3955 #ifdef FUNCTION_ARG_PARTIAL_NREGS
3956 argvec[count].partial
3957 = FUNCTION_ARG_PARTIAL_NREGS (args_so_far, mode, NULL_TREE, 1);
3959 argvec[count].partial = 0;
3962 locate_and_pad_parm (mode, NULL_TREE,
3963 #ifdef STACK_PARMS_IN_REG_PARM_AREA
3966 argvec[count].reg != 0,
3968 argvec[count].partial,
3969 NULL_TREE, &args_size, &argvec[count].locate);
3971 if (argvec[count].locate.size.var)
3974 if (argvec[count].reg == 0 || argvec[count].partial != 0
3975 || reg_parm_stack_space > 0)
3976 args_size.constant += argvec[count].locate.size.constant;
3978 FUNCTION_ARG_ADVANCE (args_so_far, mode, (tree) 0, 1);
3981 #ifdef FINAL_REG_PARM_STACK_SPACE
3982 reg_parm_stack_space = FINAL_REG_PARM_STACK_SPACE (args_size.constant,
3985 /* If this machine requires an external definition for library
3986 functions, write one out. */
3987 assemble_external_libcall (fun);
3989 original_args_size = args_size;
3990 args_size.constant = (((args_size.constant
3991 + stack_pointer_delta
3995 - stack_pointer_delta);
3997 args_size.constant = MAX (args_size.constant,
3998 reg_parm_stack_space);
4000 #ifndef OUTGOING_REG_PARM_STACK_SPACE
4001 args_size.constant -= reg_parm_stack_space;
4004 if (args_size.constant > current_function_outgoing_args_size)
4005 current_function_outgoing_args_size = args_size.constant;
4007 if (ACCUMULATE_OUTGOING_ARGS)
4009 /* Since the stack pointer will never be pushed, it is possible for
4010 the evaluation of a parm to clobber something we have already
4011 written to the stack. Since most function calls on RISC machines
4012 do not use the stack, this is uncommon, but must work correctly.
4014 Therefore, we save any area of the stack that was already written
4015 and that we are using. Here we set up to do this by making a new
4016 stack usage map from the old one.
4018 Another approach might be to try to reorder the argument
4019 evaluations to avoid this conflicting stack usage. */
4021 needed = args_size.constant;
4023 #ifndef OUTGOING_REG_PARM_STACK_SPACE
4024 /* Since we will be writing into the entire argument area, the
4025 map must be allocated for its entire size, not just the part that
4026 is the responsibility of the caller. */
4027 needed += reg_parm_stack_space;
4030 #ifdef ARGS_GROW_DOWNWARD
4031 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
4034 highest_outgoing_arg_in_use = MAX (initial_highest_arg_in_use,
4037 stack_usage_map = alloca (highest_outgoing_arg_in_use);
4039 if (initial_highest_arg_in_use)
4040 memcpy (stack_usage_map, initial_stack_usage_map,
4041 initial_highest_arg_in_use);
4043 if (initial_highest_arg_in_use != highest_outgoing_arg_in_use)
4044 memset (&stack_usage_map[initial_highest_arg_in_use], 0,
4045 highest_outgoing_arg_in_use - initial_highest_arg_in_use);
4048 /* We must be careful to use virtual regs before they're instantiated,
4049 and real regs afterwards. Loop optimization, for example, can create
4050 new libcalls after we've instantiated the virtual regs, and if we
4051 use virtuals anyway, they won't match the rtl patterns. */
4053 if (virtuals_instantiated)
4054 argblock = plus_constant (stack_pointer_rtx, STACK_POINTER_OFFSET);
4056 argblock = virtual_outgoing_args_rtx;
4061 argblock = push_block (GEN_INT (args_size.constant), 0, 0);
4064 /* If we push args individually in reverse order, perform stack alignment
4065 before the first push (the last arg). */
4066 if (argblock == 0 && PUSH_ARGS_REVERSED)
4067 anti_adjust_stack (GEN_INT (args_size.constant
4068 - original_args_size.constant));
4070 if (PUSH_ARGS_REVERSED)
4081 #ifdef REG_PARM_STACK_SPACE
4082 if (ACCUMULATE_OUTGOING_ARGS)
4084 /* The argument list is the property of the called routine and it
4085 may clobber it. If the fixed area has been used for previous
4086 parameters, we must save and restore it. */
4087 save_area = save_fixed_argument_area (reg_parm_stack_space, argblock,
4088 &low_to_save, &high_to_save);
4092 /* Push the args that need to be pushed. */
4094 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4095 are to be pushed. */
4096 for (count = 0; count < nargs; count++, argnum += inc)
4098 enum machine_mode mode = argvec[argnum].mode;
4099 rtx val = argvec[argnum].value;
4100 rtx reg = argvec[argnum].reg;
4101 int partial = argvec[argnum].partial;
4102 int lower_bound = 0, upper_bound = 0, i;
4104 if (! (reg != 0 && partial == 0))
4106 if (ACCUMULATE_OUTGOING_ARGS)
4108 /* If this is being stored into a pre-allocated, fixed-size,
4109 stack area, save any previous data at that location. */
4111 #ifdef ARGS_GROW_DOWNWARD
4112 /* stack_slot is negative, but we want to index stack_usage_map
4113 with positive values. */
4114 upper_bound = -argvec[argnum].locate.offset.constant + 1;
4115 lower_bound = upper_bound - argvec[argnum].locate.size.constant;
4117 lower_bound = argvec[argnum].locate.offset.constant;
4118 upper_bound = lower_bound + argvec[argnum].locate.size.constant;
4122 /* Don't worry about things in the fixed argument area;
4123 it has already been saved. */
4124 if (i < reg_parm_stack_space)
4125 i = reg_parm_stack_space;
4126 while (i < upper_bound && stack_usage_map[i] == 0)
4129 if (i < upper_bound)
4131 /* We need to make a save area. */
4133 = argvec[argnum].locate.size.constant * BITS_PER_UNIT;
4134 enum machine_mode save_mode
4135 = mode_for_size (size, MODE_INT, 1);
4137 = plus_constant (argblock,
4138 argvec[argnum].locate.offset.constant);
4140 = gen_rtx_MEM (save_mode, memory_address (save_mode, adr));
4142 if (save_mode == BLKmode)
4144 argvec[argnum].save_area
4145 = assign_stack_temp (BLKmode,
4146 argvec[argnum].locate.size.constant,
4149 emit_block_move (validize_mem (argvec[argnum].save_area),
4151 GEN_INT (argvec[argnum].locate.size.constant),
4152 BLOCK_OP_CALL_PARM);
4156 argvec[argnum].save_area = gen_reg_rtx (save_mode);
4158 emit_move_insn (argvec[argnum].save_area, stack_area);
4163 emit_push_insn (val, mode, NULL_TREE, NULL_RTX, PARM_BOUNDARY,
4164 partial, reg, 0, argblock,
4165 GEN_INT (argvec[argnum].locate.offset.constant),
4166 reg_parm_stack_space,
4167 ARGS_SIZE_RTX (argvec[argnum].locate.alignment_pad));
4169 /* Now mark the segment we just used. */
4170 if (ACCUMULATE_OUTGOING_ARGS)
4171 for (i = lower_bound; i < upper_bound; i++)
4172 stack_usage_map[i] = 1;
4178 /* If we pushed args in forward order, perform stack alignment
4179 after pushing the last arg. */
4180 if (argblock == 0 && !PUSH_ARGS_REVERSED)
4181 anti_adjust_stack (GEN_INT (args_size.constant
4182 - original_args_size.constant));
4184 if (PUSH_ARGS_REVERSED)
4189 fun = prepare_call_address (fun, NULL_TREE, &call_fusage, 0, 0);
4191 /* Now load any reg parms into their regs. */
4193 /* ARGNUM indexes the ARGVEC array in the order in which the arguments
4194 are to be pushed. */
4195 for (count = 0; count < nargs; count++, argnum += inc)
4197 rtx val = argvec[argnum].value;
4198 rtx reg = argvec[argnum].reg;
4199 int partial = argvec[argnum].partial;
4201 /* Handle calls that pass values in multiple non-contiguous
4202 locations. The PA64 has examples of this for library calls. */
4203 if (reg != 0 && GET_CODE (reg) == PARALLEL)
4204 emit_group_load (reg, val, NULL_TREE, GET_MODE_SIZE (GET_MODE (val)));
4205 else if (reg != 0 && partial == 0)
4206 emit_move_insn (reg, val);
4211 /* Any regs containing parms remain in use through the call. */
4212 for (count = 0; count < nargs; count++)
4214 rtx reg = argvec[count].reg;
4215 if (reg != 0 && GET_CODE (reg) == PARALLEL)
4216 use_group_regs (&call_fusage, reg);
4218 use_reg (&call_fusage, reg);
4221 /* Pass the function the address in which to return a structure value. */
4222 if (mem_value != 0 && struct_value != 0 && ! pcc_struct_value)
4224 emit_move_insn (struct_value,
4226 force_operand (XEXP (mem_value, 0),
4228 if (GET_CODE (struct_value) == REG)
4229 use_reg (&call_fusage, struct_value);
4232 /* Don't allow popping to be deferred, since then
4233 cse'ing of library calls could delete a call and leave the pop. */
4235 valreg = (mem_value == 0 && outmode != VOIDmode
4236 ? hard_libcall_value (outmode) : NULL_RTX);
4238 /* Stack must be properly aligned now. */
4239 if (stack_pointer_delta & (PREFERRED_STACK_BOUNDARY / BITS_PER_UNIT - 1))
4242 before_call = get_last_insn ();
4244 /* We pass the old value of inhibit_defer_pop + 1 to emit_call_1, which
4245 will set inhibit_defer_pop to that value. */
4246 /* The return type is needed to decide how many bytes the function pops.
4247 Signedness plays no role in that, so for simplicity, we pretend it's
4248 always signed. We also assume that the list of arguments passed has
4249 no impact, so we pretend it is unknown. */
4252 get_identifier (XSTR (orgfun, 0)),
4253 build_function_type (tfom, NULL_TREE),
4254 original_args_size.constant, args_size.constant,
4256 FUNCTION_ARG (args_so_far, VOIDmode, void_type_node, 1),
4258 old_inhibit_defer_pop + 1, call_fusage, flags, & args_so_far);
4260 /* For calls to `setjmp', etc., inform flow.c it should complain
4261 if nonvolatile values are live. For functions that cannot return,
4262 inform flow that control does not fall through. */
4264 if (flags & (ECF_NORETURN | ECF_LONGJMP))
4266 /* The barrier note must be emitted
4267 immediately after the CALL_INSN. Some ports emit more than
4268 just a CALL_INSN above, so we must search for it here. */
4270 rtx last = get_last_insn ();
4271 while (GET_CODE (last) != CALL_INSN)
4273 last = PREV_INSN (last);
4274 /* There was no CALL_INSN? */
4275 if (last == before_call)
4279 emit_barrier_after (last);
4282 /* Now restore inhibit_defer_pop to its actual original value. */
4285 /* If call is cse'able, make appropriate pair of reg-notes around it.
4286 Test valreg so we don't crash; may safely ignore `const'
4287 if return type is void. Disable for PARALLEL return values, because
4288 we have no way to move such values into a pseudo register. */
4289 if (flags & ECF_LIBCALL_BLOCK)
4295 insns = get_insns ();
4305 if (GET_CODE (valreg) == PARALLEL)
4307 temp = gen_reg_rtx (outmode);
4308 emit_group_store (temp, valreg, NULL_TREE,
4309 GET_MODE_SIZE (outmode));
4313 temp = gen_reg_rtx (GET_MODE (valreg));
4315 /* Construct an "equal form" for the value which mentions all the
4316 arguments in order as well as the function name. */
4317 for (i = 0; i < nargs; i++)
4318 note = gen_rtx_EXPR_LIST (VOIDmode, argvec[i].value, note);
4319 note = gen_rtx_EXPR_LIST (VOIDmode, fun, note);
4321 insns = get_insns ();
4324 if (flags & ECF_PURE)
4325 note = gen_rtx_EXPR_LIST (VOIDmode,
4326 gen_rtx_USE (VOIDmode,
4327 gen_rtx_MEM (BLKmode,
4328 gen_rtx_SCRATCH (VOIDmode))),
4331 emit_libcall_block (insns, temp, valreg, note);
4338 /* Copy the value to the right place. */
4339 if (outmode != VOIDmode && retval)
4345 if (value != mem_value)
4346 emit_move_insn (value, mem_value);
4348 else if (GET_CODE (valreg) == PARALLEL)
4351 value = gen_reg_rtx (outmode);
4352 emit_group_store (value, valreg, NULL_TREE, GET_MODE_SIZE (outmode));
4354 else if (value != 0)
4355 emit_move_insn (value, valreg);
4360 if (ACCUMULATE_OUTGOING_ARGS)
4362 #ifdef REG_PARM_STACK_SPACE
4364 restore_fixed_argument_area (save_area, argblock,
4365 high_to_save, low_to_save);
4368 /* If we saved any argument areas, restore them. */
4369 for (count = 0; count < nargs; count++)
4370 if (argvec[count].save_area)
4372 enum machine_mode save_mode = GET_MODE (argvec[count].save_area);
4373 rtx adr = plus_constant (argblock,
4374 argvec[count].locate.offset.constant);
4375 rtx stack_area = gen_rtx_MEM (save_mode,
4376 memory_address (save_mode, adr));
4378 if (save_mode == BLKmode)
4379 emit_block_move (stack_area,
4380 validize_mem (argvec[count].save_area),
4381 GEN_INT (argvec[count].locate.size.constant),
4382 BLOCK_OP_CALL_PARM);
4384 emit_move_insn (stack_area, argvec[count].save_area);
4387 highest_outgoing_arg_in_use = initial_highest_arg_in_use;
4388 stack_usage_map = initial_stack_usage_map;
4395 /* Output a library call to function FUN (a SYMBOL_REF rtx)
4396 (emitting the queue unless NO_QUEUE is nonzero),
4397 for a value of mode OUTMODE,
4398 with NARGS different arguments, passed as alternating rtx values
4399 and machine_modes to convert them to.
4400 The rtx values should have been passed through protect_from_queue already.
4402 FN_TYPE should be LCT_NORMAL for `normal' calls, LCT_CONST for `const'
4403 calls, LCT_PURE for `pure' calls, LCT_CONST_MAKE_BLOCK for `const' calls
4404 which should be enclosed in REG_LIBCALL/REG_RETVAL notes,
4405 LCT_PURE_MAKE_BLOCK for `purep' calls which should be enclosed in
4406 REG_LIBCALL/REG_RETVAL notes with extra (use (memory (scratch)),
4407 or other LCT_ value for other types of library calls. */
4410 emit_library_call (rtx orgfun, enum libcall_type fn_type,
4411 enum machine_mode outmode, int nargs, ...)
4415 va_start (p, nargs);
4416 emit_library_call_value_1 (0, orgfun, NULL_RTX, fn_type, outmode, nargs, p);
4420 /* Like emit_library_call except that an extra argument, VALUE,
4421 comes second and says where to store the result.
4422 (If VALUE is zero, this function chooses a convenient way
4423 to return the value.
4425 This function returns an rtx for where the value is to be found.
4426 If VALUE is nonzero, VALUE is returned. */
4429 emit_library_call_value (rtx orgfun, rtx value,
4430 enum libcall_type fn_type,
4431 enum machine_mode outmode, int nargs, ...)
4436 va_start (p, nargs);
4437 result = emit_library_call_value_1 (1, orgfun, value, fn_type, outmode,
4444 /* Store a single argument for a function call
4445 into the register or memory area where it must be passed.
4446 *ARG describes the argument value and where to pass it.
4448 ARGBLOCK is the address of the stack-block for all the arguments,
4449 or 0 on a machine where arguments are pushed individually.
4451 MAY_BE_ALLOCA nonzero says this could be a call to `alloca'
4452 so must be careful about how the stack is used.
4454 VARIABLE_SIZE nonzero says that this was a variable-sized outgoing
4455 argument stack. This is used if ACCUMULATE_OUTGOING_ARGS to indicate
4456 that we need not worry about saving and restoring the stack.
4458 FNDECL is the declaration of the function we are calling.
4460 Return nonzero if this arg should cause sibcall failure,
4464 store_one_arg (struct arg_data *arg, rtx argblock, int flags,
4465 int variable_size ATTRIBUTE_UNUSED, int reg_parm_stack_space)
4467 tree pval = arg->tree_value;
4471 int i, lower_bound = 0, upper_bound = 0;
4472 int sibcall_failure = 0;
4474 if (TREE_CODE (pval) == ERROR_MARK)
4477 /* Push a new temporary level for any temporaries we make for
4481 if (ACCUMULATE_OUTGOING_ARGS && !(flags & ECF_SIBCALL))
4483 /* If this is being stored into a pre-allocated, fixed-size, stack area,
4484 save any previous data at that location. */
4485 if (argblock && ! variable_size && arg->stack)
4487 #ifdef ARGS_GROW_DOWNWARD
4488 /* stack_slot is negative, but we want to index stack_usage_map
4489 with positive values. */
4490 if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS)
4491 upper_bound = -INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1)) + 1;
4495 lower_bound = upper_bound - arg->locate.size.constant;
4497 if (GET_CODE (XEXP (arg->stack_slot, 0)) == PLUS)
4498 lower_bound = INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1));
4502 upper_bound = lower_bound + arg->locate.size.constant;
4506 /* Don't worry about things in the fixed argument area;
4507 it has already been saved. */
4508 if (i < reg_parm_stack_space)
4509 i = reg_parm_stack_space;
4510 while (i < upper_bound && stack_usage_map[i] == 0)
4513 if (i < upper_bound)
4515 /* We need to make a save area. */
4516 unsigned int size = arg->locate.size.constant * BITS_PER_UNIT;
4517 enum machine_mode save_mode = mode_for_size (size, MODE_INT, 1);
4518 rtx adr = memory_address (save_mode, XEXP (arg->stack_slot, 0));
4519 rtx stack_area = gen_rtx_MEM (save_mode, adr);
4521 if (save_mode == BLKmode)
4523 tree ot = TREE_TYPE (arg->tree_value);
4524 tree nt = build_qualified_type (ot, (TYPE_QUALS (ot)
4525 | TYPE_QUAL_CONST));
4527 arg->save_area = assign_temp (nt, 0, 1, 1);
4528 preserve_temp_slots (arg->save_area);
4529 emit_block_move (validize_mem (arg->save_area), stack_area,
4530 expr_size (arg->tree_value),
4531 BLOCK_OP_CALL_PARM);
4535 arg->save_area = gen_reg_rtx (save_mode);
4536 emit_move_insn (arg->save_area, stack_area);
4542 /* If this isn't going to be placed on both the stack and in registers,
4543 set up the register and number of words. */
4544 if (! arg->pass_on_stack)
4546 if (flags & ECF_SIBCALL)
4547 reg = arg->tail_call_reg;
4550 partial = arg->partial;
4553 if (reg != 0 && partial == 0)
4554 /* Being passed entirely in a register. We shouldn't be called in
4558 /* If this arg needs special alignment, don't load the registers
4560 if (arg->n_aligned_regs != 0)
4563 /* If this is being passed partially in a register, we can't evaluate
4564 it directly into its stack slot. Otherwise, we can. */
4565 if (arg->value == 0)
4567 /* stack_arg_under_construction is nonzero if a function argument is
4568 being evaluated directly into the outgoing argument list and
4569 expand_call must take special action to preserve the argument list
4570 if it is called recursively.
4572 For scalar function arguments stack_usage_map is sufficient to
4573 determine which stack slots must be saved and restored. Scalar
4574 arguments in general have pass_on_stack == 0.
4576 If this argument is initialized by a function which takes the
4577 address of the argument (a C++ constructor or a C function
4578 returning a BLKmode structure), then stack_usage_map is
4579 insufficient and expand_call must push the stack around the
4580 function call. Such arguments have pass_on_stack == 1.
4582 Note that it is always safe to set stack_arg_under_construction,
4583 but this generates suboptimal code if set when not needed. */
4585 if (arg->pass_on_stack)
4586 stack_arg_under_construction++;
4588 arg->value = expand_expr (pval,
4590 || TYPE_MODE (TREE_TYPE (pval)) != arg->mode)
4591 ? NULL_RTX : arg->stack,
4592 VOIDmode, EXPAND_STACK_PARM);
4594 /* If we are promoting object (or for any other reason) the mode
4595 doesn't agree, convert the mode. */
4597 if (arg->mode != TYPE_MODE (TREE_TYPE (pval)))
4598 arg->value = convert_modes (arg->mode, TYPE_MODE (TREE_TYPE (pval)),
4599 arg->value, arg->unsignedp);
4601 if (arg->pass_on_stack)
4602 stack_arg_under_construction--;
4605 /* Don't allow anything left on stack from computation
4606 of argument to alloca. */
4607 if (flags & ECF_MAY_BE_ALLOCA)
4608 do_pending_stack_adjust ();
4610 if (arg->value == arg->stack)
4611 /* If the value is already in the stack slot, we are done. */
4613 else if (arg->mode != BLKmode)
4617 /* Argument is a scalar, not entirely passed in registers.
4618 (If part is passed in registers, arg->partial says how much
4619 and emit_push_insn will take care of putting it there.)
4621 Push it, and if its size is less than the
4622 amount of space allocated to it,
4623 also bump stack pointer by the additional space.
4624 Note that in C the default argument promotions
4625 will prevent such mismatches. */
4627 size = GET_MODE_SIZE (arg->mode);
4628 /* Compute how much space the push instruction will push.
4629 On many machines, pushing a byte will advance the stack
4630 pointer by a halfword. */
4631 #ifdef PUSH_ROUNDING
4632 size = PUSH_ROUNDING (size);
4636 /* Compute how much space the argument should get:
4637 round up to a multiple of the alignment for arguments. */
4638 if (none != FUNCTION_ARG_PADDING (arg->mode, TREE_TYPE (pval)))
4639 used = (((size + PARM_BOUNDARY / BITS_PER_UNIT - 1)
4640 / (PARM_BOUNDARY / BITS_PER_UNIT))
4641 * (PARM_BOUNDARY / BITS_PER_UNIT));
4643 /* This isn't already where we want it on the stack, so put it there.
4644 This can either be done with push or copy insns. */
4645 emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), NULL_RTX,
4646 PARM_BOUNDARY, partial, reg, used - size, argblock,
4647 ARGS_SIZE_RTX (arg->locate.offset), reg_parm_stack_space,
4648 ARGS_SIZE_RTX (arg->locate.alignment_pad));
4650 /* Unless this is a partially-in-register argument, the argument is now
4653 arg->value = arg->stack;
4657 /* BLKmode, at least partly to be pushed. */
4659 unsigned int parm_align;
4663 /* Pushing a nonscalar.
4664 If part is passed in registers, PARTIAL says how much
4665 and emit_push_insn will take care of putting it there. */
4667 /* Round its size up to a multiple
4668 of the allocation unit for arguments. */
4670 if (arg->locate.size.var != 0)
4673 size_rtx = ARGS_SIZE_RTX (arg->locate.size);
4677 /* PUSH_ROUNDING has no effect on us, because
4678 emit_push_insn for BLKmode is careful to avoid it. */
4679 if (reg && GET_CODE (reg) == PARALLEL)
4681 /* Use the size of the elt to compute excess. */
4682 rtx elt = XEXP (XVECEXP (reg, 0, 0), 0);
4683 excess = (arg->locate.size.constant
4684 - int_size_in_bytes (TREE_TYPE (pval))
4685 + partial * GET_MODE_SIZE (GET_MODE (elt)));
4688 excess = (arg->locate.size.constant
4689 - int_size_in_bytes (TREE_TYPE (pval))
4690 + partial * UNITS_PER_WORD);
4691 size_rtx = expand_expr (size_in_bytes (TREE_TYPE (pval)),
4692 NULL_RTX, TYPE_MODE (sizetype), 0);
4695 /* Some types will require stricter alignment, which will be
4696 provided for elsewhere in argument layout. */
4697 parm_align = MAX (PARM_BOUNDARY, TYPE_ALIGN (TREE_TYPE (pval)));
4699 /* When an argument is padded down, the block is aligned to
4700 PARM_BOUNDARY, but the actual argument isn't. */
4701 if (FUNCTION_ARG_PADDING (arg->mode, TREE_TYPE (pval)) == downward)
4703 if (arg->locate.size.var)
4704 parm_align = BITS_PER_UNIT;
4707 unsigned int excess_align = (excess & -excess) * BITS_PER_UNIT;
4708 parm_align = MIN (parm_align, excess_align);
4712 if ((flags & ECF_SIBCALL) && GET_CODE (arg->value) == MEM)
4714 /* emit_push_insn might not work properly if arg->value and
4715 argblock + arg->locate.offset areas overlap. */
4719 if (XEXP (x, 0) == current_function_internal_arg_pointer
4720 || (GET_CODE (XEXP (x, 0)) == PLUS
4721 && XEXP (XEXP (x, 0), 0) ==
4722 current_function_internal_arg_pointer
4723 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT))
4725 if (XEXP (x, 0) != current_function_internal_arg_pointer)
4726 i = INTVAL (XEXP (XEXP (x, 0), 1));
4728 /* expand_call should ensure this. */
4729 if (arg->locate.offset.var || GET_CODE (size_rtx) != CONST_INT)
4732 if (arg->locate.offset.constant > i)
4734 if (arg->locate.offset.constant < i + INTVAL (size_rtx))
4735 sibcall_failure = 1;
4737 else if (arg->locate.offset.constant < i)
4739 if (i < arg->locate.offset.constant + INTVAL (size_rtx))
4740 sibcall_failure = 1;
4745 emit_push_insn (arg->value, arg->mode, TREE_TYPE (pval), size_rtx,
4746 parm_align, partial, reg, excess, argblock,
4747 ARGS_SIZE_RTX (arg->locate.offset), reg_parm_stack_space,
4748 ARGS_SIZE_RTX (arg->locate.alignment_pad));
4750 /* Unless this is a partially-in-register argument, the argument is now
4753 ??? Unlike the case above, in which we want the actual
4754 address of the data, so that we can load it directly into a
4755 register, here we want the address of the stack slot, so that
4756 it's properly aligned for word-by-word copying or something
4757 like that. It's not clear that this is always correct. */
4759 arg->value = arg->stack_slot;
4762 /* Mark all slots this store used. */
4763 if (ACCUMULATE_OUTGOING_ARGS && !(flags & ECF_SIBCALL)
4764 && argblock && ! variable_size && arg->stack)
4765 for (i = lower_bound; i < upper_bound; i++)
4766 stack_usage_map[i] = 1;
4768 /* Once we have pushed something, pops can't safely
4769 be deferred during the rest of the arguments. */
4772 /* ANSI doesn't require a sequence point here,
4773 but PCC has one, so this will avoid some problems. */
4776 /* Free any temporary slots made in processing this argument. Show
4777 that we might have taken the address of something and pushed that
4779 preserve_temp_slots (NULL_RTX);
4783 return sibcall_failure;
4786 /* Nonzero if we do not know how to pass TYPE solely in registers.
4787 We cannot do so in the following cases:
4789 - if the type has variable size
4790 - if the type is marked as addressable (it is required to be constructed
4792 - if the padding and mode of the type is such that a copy into a register
4793 would put it into the wrong part of the register.
4795 Which padding can't be supported depends on the byte endianness.
4797 A value in a register is implicitly padded at the most significant end.
4798 On a big-endian machine, that is the lower end in memory.
4799 So a value padded in memory at the upper end can't go in a register.
4800 For a little-endian machine, the reverse is true. */
4803 default_must_pass_in_stack (enum machine_mode mode, tree type)
4808 /* If the type has variable size... */
4809 if (TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4812 /* If the type is marked as addressable (it is required
4813 to be constructed into the stack)... */
4814 if (TREE_ADDRESSABLE (type))
4817 /* If the padding and mode of the type is such that a copy into
4818 a register would put it into the wrong part of the register. */
4820 && int_size_in_bytes (type) % (PARM_BOUNDARY / BITS_PER_UNIT)
4821 && (FUNCTION_ARG_PADDING (mode, type)
4822 == (BYTES_BIG_ENDIAN ? upward : downward)))